I'm wondering if there is a simple one liner that would unbox an array of Doubles into an array of doubles.  Obviously it could be done simply using a for loop, but I'm just curious to see if Java has some fancy auto-unboxing feature that allows the conversion without explicitly writing a for loop.

If you have an array of Java objects which have a primitive type (for example Byte, Integer, Char, etc).  Is there a neat way I can convert it into an array of the primitive type?  In particular can this be done without having to create a new array and loop through the contents.  So for example, given  Integer[] array   what is the neatest way to convert this into  int[] intArray   Unfortunately, this is something we have to do quite frequently when interfacing between Hibernate and some third party libraries over which we have no control.  It seems this would be a quite common operation so I would be surprised if there's no shortcut.  Thanks for your help!


Me and my Moroccan friend are currently planning a holiday to Portugal (I'm a british citizen). We're slightly concerned though, that because her Schengen visa has been issued via the French embassay and is a 'French shengen' visa, that she has to go to France first and then travel to Portugal.  Can anyone confirm whether she would need to go to France first(and then figure out a way to Portugal), or if she can just go straight from Morocco to Portugal.

In case, if I get a multiple-entry Schengen visa in one of the embassies in Ukraine, Kyiv - should my first trip be to the country which issued the visa?  Any there any requirements of this sort? Does this condition vary depending on embassy which issued the visa?  What are the possible consequences on not visiting that country first? Does it somehow depend on country where the embassy is (i.e. non-Schengen and not EU members)?


I'm trying to work with the statistical package R. R is already installed. sudo apt-get install r-base-dev returns: "r-base-dev is already the newest version (3.4.3-1xenial0). 0 upgraded, 0 newly installed, 0 to remove and 23 not upgraded." However, which R gives me "R not found".  Now, how can I locate R? Is it really installed?  (Ubuntu 16.04)

I tried aptitude search r, but (unsurprisingly), there are waaaay too many results to sift through.


I have problem get data from database. Persian words appear as question marks like ???????. How can I avoid this?  Here is my code:  header('Content-Type: text/html; charset=utf-8'); $conn = mysqli_connect("localhost", "somevalue", "somevalue", "somevalue"); $output = array(); $query  = "SELECT * FROM af_home ORDER BY home_id DESC LIMIT 50"; $result = mysqli_query($conn, $query); if (mysqli_num_rows($result) > 0) {     while ($row = mysqli_fetch_array($result)) {         $output[] = $row;     }     echo json_encode($output); }

I'm setting up a new server and want to support UTF-8 fully in my web application. I have tried this in the past on existing servers and always seem to end up having to fall back to ISO-8859-1.  Where exactly do I need to set the encoding/charsets? I'm aware that I need to configure Apache, MySQL, and PHP to do this — is there some standard checklist I can follow, or perhaps troubleshoot where the mismatches occur?  This is for a new Linux server, running MySQL 5, PHP, 5 and Apache 2.


I am utilizing Blender for 3D Printing purposes and the 3D Printing software uses the metric system (specifically mm and cm). I have already established preset units in the Scene tab:   Millimeters  Length: Metric  Angle: Degrees  Unit Scale: 0.0001  Generating a cube results in a cube with the dimensions 20cm x 20cm x 20cm. It appears as if the object generated exceeds the boundary of the scene as you can see from what looks like clipping.    After some experimentation with the unit scaling value, 20cm (at a Unit Scale of 0.0001) is the smallest I can make the absolute bounding box. If you reduce the unit scale value even further (0.00001) it will default to 2km, the initial value if the unit scale is set to 1.0.  If there are any fixes or add-ons that allow for scaling down to millimeters, I would be grateful.

I'm having an odd issue - When I try to zoom in on a detail using my MMB, the "camera" in the 3D view seems to be cutting off the exterior surface of my object and showing me the inside instead. I'd expect this behavior, but only when I was much more zoomed in.  If I zoom out a bit (one click on the scroll wheel) then I can see the exterior as I intend.  Is there any way to adjust this behavior?  Thanks!


I'm trying to get my head around the convertValue method of Jackson. Initially I thought it would be somewhat equivalent to the Gson#fromJson method but this doesn't seem to be the case.  Here's the problem:  // Map<String, Object> map = ... ObjectMapper mapper = new ObjectMapper(); MyPojo pojo = mapper.convertValue(map.get(key), MyPojo.class); for (Map.Entry<String, Object> m : map.entrySet()) {     System.out.println("k=" + m.getKey() + "    v=" + m.getValue()); } pojo.name = "Banana"; for (Map.Entry<String, Object> m : map.entrySet()) {     System.out.println("k=" + m.getKey() + "    v=" + m.getValue()); }   Output  k=66e8c013   v=MyPojo{name='Apple'}  k=66e8c013   v=MyPojo{name='Banana'}   Note: Code and output has been stripped down to the relevant part  So, if I modify my pojo object, it's also getting changed in the original Map. For me it seems like Jackson doesn't call "new MyPojo()" internally and set the values for each found variable afterwards.  What can I do to prevent this? Is there an alternative method? Do I need to create a copy constructor in order to get a truly new object without references to the values in the Map? Additionally it would be cool if someone could tell me what convertValue actually does.

Is there any utility for deep cloning for java collections:   Arrays Lists Maps   NOTE: prefer some solution without usage of serialization, but with use of Object.clone() method. I can be sure that my custom object will implement clone() method and will use only java-standard classes that are cloneable...


Definition: A topological space $X$ is totally disconnected if for all $x \in X$ , the connected  component of $X$ containing $x$ is $\{x  \}$.  My question is:     Is there a totally disconnected topological space so which is not Hausdorff?

Recall a space is totally disconnected if the only connected subsets are singletons (one-point subsets). Is a totally disconnected space,  Hausdorff?     I think it is true since if $a $ and $b $ are two distinct points, they can be separated two disjoint  open sets, since the main space is totally disconnected (see Theorem at <  >).   Is this argument true?


I want to define a new command that serves two slightly different purposes. Can I define a new command called \set such that it's definition is chosen according to the number of argument(s) is(are) filled? I want {1,2,3} when I use \set{1,2,3} and I want {x | x>0} when I use \set{x}{x>0}.

I want to define a command that expands to two completely different things depending on whether I supply, or not, an optional argument. For example,  \mycmd{normal}            ->  something(normal) \mycmd[optional]{normal}  ->  anotherthing(normal, optional)   How can I do this?


How to reduce the physical RAM size in RHEL 5.7?  I would like to reduce the memory for testing

I am running ltib Linux on P1022RDK (P1022 Core) platform. I have 512 MB = 0x20000000 memory. I want my Linux kernel to use the second half of the board memory (i.e from 256 MB to 512 MB) and want the first half of memory to be reserved for some other purpose.   For this I am building the Linux kernel using ltib, and setting the following kernel configuration. Please suggest if I am doing it the right way.  CONFIG_LOWMEM_SIZE = 0x10000000 # 256 MB  CONFIG_PHYSICAL_START = 0x10000000 # Starting from 256MB (second half of memory)   On the Uboot I am loading the kernel the following way:  setenv loadaddr 0x11000000 # Kernel base = 0x10000000 + 0x01000000 (offset)  setenv fdtaddr 0x10c00000 # Kernel base = 0x10000000 + 0x00c00000 (offset)  bootm $loadaddr - $fdtaddr My kernel Load address is 0x10000000 & kernel entry point is 0x10000000  Using the above configuration/steps my kernel is stuck at the following on Uboot:  Booting kernel from Legacy Image at 11000000 ...  Image Name: Linux-2.6.32.13  Image Type: PowerPC Linux Kernel Image (gzip compressed)  Data Size: 3352851 Bytes = 3.2 MB  Load Address: 10000000  Entry Point: 10000000  Verifying Checksum ... OK  Flattened Device Tree blob at 10c00000  Booting using the fdt blob at 0x10c00000  Uncompressing Kernel Image ... OK   It should uncompress FDT here & continue  Any thoughts?


How do I get my iCloud account to let me change my email account without having to give my old password for my other email account? I don't remember that password.

I bought a used iPhone 4.  The previous owner re-set the phone, but did not remove the device from their iCloud.  It is asking me for their iCloud information when I try to set-up the phone.  I don't have contact with the previous owner anymore.  Is there a way to remove the device from their iCloud so I can use a new one?


Whilst creating a navigation bar for my site I decided to make the active page tab show up in bold for usability purposes, but when I change the font-weight on the element it only slightly makes the element wider, an example I made using hover effects instead demonstrates my issue and i've never known a way to solve it..    HTML

         Link 1

         Link 2

         Link 3

   CSS  * {     font-family: Arial;     font-size: 14px;     list-style: none;     margin: 0;     padding: 0;     text-decoration: none; }  #mainNav {     background: RGB(200, 230, 240);     border-bottom: 1px solid RGB(0, 0, 0);     height: 30px;     margin: 0 auto;     position: relative;     width: 100%; }  .navItem {     display: block;     float: left;     position: relative; }  .navItem:last-child .navLink {     border-right: 1px solid RGB(0, 0, 0); }  .navLink {     border-bottom: 1px solid RGB(0, 0, 0);     border-left: 1px solid RGB(0, 0, 0);     display: inline-block;     height: 30px;     line-height: 30px;     padding: 0 15px;     white-space: nowrap; }  .navItem:hover .navLink {     background: RGB(120, 200, 250);     color: RGB(255, 255, 255);     cursor: pointer;     font-weight: bold; }  #activeLink {     background: RGB(90, 170, 220);     color: RGB(255, 255, 255);     font-weight: bold; }  #activeLink:hover {     background: RGB(110, 190, 240); }  .navItem:hover .subNav {     display: block; }

I created a horizontal menu using a HTML lists and CSS. Everything works as it should except when you hover over the links. You see, I created a bold hover state for the links, and now the menu links shift because of the bold size difference.  I encounter the same problem as . However, the post does not have proper solution. I've searched everywhere for a solution and can't find one. Surely I can't be the only one trying to do this.  Does anyone have any ideas?  P.S: I don't know the width of the text in menu items so I cannot just set the width of the li items.    .nav { margin: 0; padding: 0; } .nav li {      list-style: none;      display: inline;      border-left: #ffffff 1px solid;  } .nav li a:link, .nav li a:visited {      text-decoration: none;      color: #000;      margin-left: 8px;      margin-right: 5px;  } .nav li a:hover{      text-decoration: none;      font-weight: bold;  } .nav li.first { border: none; }

item 0

item 1

item 2

item 3

item 4


for non-template class, I can use forward declaration in the header file. But it gave me error when I use it in the template class.  I have to include the header file, I would like to know the reason.  class Pu;  template <typename T> class Pt() {      void test(Pu<T> u); }

I am looking for the definition of when I am allowed to do forward declaration of a class in another class's header file:  Am I allowed to do it for a base class, for a class held as a member, for a class passed to member function by reference, etc. ?


Context There is a similar question , however I feel the answer does not expand on how to "invoke the user environment profile from the launchd script"; and the alternative solution of identifying differences in the user and launchd environments shouldn't apply since I am running a launchd agent (run within user context) and not a launchd daemon (run within system context). My setup I have a run_rsync_back.sh file in my home directory with the following (note that this script runs sucessfully when manually run from the terminal): date >> ~/.cron.log && rsync --stats -hai --delete /Users/username/Documents/ username@server.net:/home/username/Documents_MacbookPro/ >> ~/.backup.log 2>&1   I have ensured the above file is executable with chmod +x And created a launchd Property List file for my agent: ~/Library/LaunchAgents/com.rsyncbackup.plist with the following: <?xml version="1.0" encoding="UTF-8"?> <!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd"> <plist version="1.0">   <dict>     <key>Label</key>     <string>com.rsyncbackup</string>     <key>ProgramArguments</key>     <array>       <string>/Users/username/.run_rsync_backup.sh</string>     </array>     <key>RunAtLoad</key>     <true/>     <key>StartInterval</key>     <integer>7200</integer>   </dict> </plist>  After starting the daemon (launchctl load ~/Library/LaunchAgents/com.rsyncbackup.plist), I can confirm that nothing was transferred to the server, and the following error appears in the ~/.backup.log file: Sat Aug 29 17:19:16 CEST 2020 rsync: [sender] opendir "/Users/username/Documents/." failed: Operation not permitted (1) IO error encountered -- skipping file deletion  Number of files: 1 (dir: 1) Number of created files: 0 Number of deleted files: 0 Number of regular files transferred: 0 Total file size: 0 bytes Total transferred file size: 0 bytes Literal data: 0 bytes Matched data: 0 bytes File list size: 0 File list generation time: 0.015 seconds File list transfer time: 0.000 seconds Total bytes sent: 67 Total bytes received: 70  sent 67 bytes  received 70 bytes  274.00 bytes/sec total size is 0  speedup is 0.00 rsync error: some files/attrs were not transferred (see previous errors) (code 23) at main.c(1307) [sender=3.2.2]  I have also tried the above on an out-of-the-box Mac, with exactly the same result!

After upgrading to Mojave, my rsync based backup script run via a launch agent in ~/Library/LaunchAgents, could no longer read some directories in ~/Library.


This may seem silly, but how do they know that the effects we are seeing from , (which we only assume must be there due to observed acceleration), are not from gravity pulling us out from the other side?  Say there's all of this fast moving energy like light, and it extends further out than slower moving galaxies in the sphere of the entire universe.   Would the gravity of all those particles be enough to produce the observations that we assume are due to a pushing effect?

Dark energy is suggested to be a repulsive force in the universe causing an accelerated expansion. If the amount of mass outside our observable universe is greater than inside (higher mass density), would it not cause an accelerated expansion from our viewpoint?


I want to get " By [16, Proposition 4.2]" in my article,  but when I input "[\cite{16}, Proposition 4.2]" in my article, then pdflatex-bibtex-pdflatex-pdflatex, what I get is "[[16], Proposition 4.2]". If I input "\cite{16}, Proposition 4.2", what I get will be "[16], Proposition 4.2". What needed to point is I will use the reference [16] at least twice, so I can't name it 16, Proposition 4.2.

I would like to cite the item (iii) of proposition 3 of a reference. How can I do it? Which ways do you suggest? This is a question not only about LaTeX, but also about style. One option I have seen to cite pages of a reference is \cite[p.~333]{Audet}. Is there something similar to cite theorems, propositions and so on?


Ever so often on Ubuntu 14.04 my desktop freezes. The mouse stops moving and nothing moves. However the sound keeps going and processes in the terminal keep going (although I can't see their progress).  To get my system working I have to go to ctrl alt f2 and then switch back using ctrl alt f7. This usually does the trick and everything resumes like nothing ever happened.  This has happened after a fresh install and continued since then. I expected it to go away after I performed all my updates- but it has not.  I'm on Ubuntu 14.04 with a nvidia graphics card. (I'm using Nvidia's drivers).  Note that this appears to be the same probalem as  but there has been no solution that works posted yet.  Has anyone ran into this issue- know of any solutions?

All operating systems freeze sometimes, and Ubuntu is no exception. What should I do to regain control when...   just one program stops responding? nothing at all responds to mouse clicks or key presses? the mouse stops moving entirely? I have an    In what order should I try various solutions before deciding to pull the power plug?  What should I do when starting up Ubuntu fails?  Is there a diagnostic procedure I can follow?


Every time I try to go to this directory it says it does not exist, but it does exist!  ~$ sudo cd /Downloads sudo: cd: command not found ~$ cd /downloads bash: cd: /downloads: No such file or directory

How do I change directories to downloads, from the home folder, in the latest version Ubuntu 12.10? I tried cd /downloads, but it gave an error saying that there is no such directory.


In my survival world in Minecraft, I built a compass. It was working fine, but when the 1.9 update arrived it started acting haywire! It doesn't point to my spawn point OR my bed. When I followed it to where it was pointing, I ended up in the middle of nowhere. (I know it wasn't my spawn point because my spawn point was next to a mushroom tree and I built a house around it.)  I used my compass a lot! Why doesn't it work anymore?  No mods are being used, not on a server, just a regular vanilla single player world.

When I use a compass it does not seem to point towards my bed. I have heard that now compasses point towards North. Is this true?


(Here be spoilers)    Crucial events in the plot of "Arrival" involve:   Main character Louise learning from the Chinese General his wife's last words, as well as his phone number (that apparently never changes) ; along a vision she gets of a reception subsequent to the Heptapods visit   Louise using this phone number to call the General, and remind him of his wife's last words in order to trigger him to stop using violence towards the Heptapod visitors, during their visit to Humanity.     According to the General's comments during the reception (something like "I don't understand how your mind works"), it seems that he has not mastered the Heptapod language, and only has a linear perception of time. From his point of view, it seems that the reason he mentions his wife's words during the reception, is because he remembers the phone call Louise made him years ago. And a reason why Louise can tell him those words during their phone call, is because she learnt them from that discussion. This seems like a "circular" paradox to me: the depiction of a universe and timeline where event #1 causes event #2, and where event #2 causes event #1. Also, the easiness with which the General discloses such a personal information does not feel consistent with the character.    I was very happy to watch a movie depicting a somewhat rigorous scientific approach to communication attempts with visiting members of a new species; and am not reluctant to discontinuing my disbelief regarding the perception skill that mastering the Heptapod language brings, given how convincingly this feature is presented during the movie. However I feel dissatisfied with what I perceive as a violation of the rule of causality, introduced without any other justifications, and that looks like an artificial way of generating more "buzz" and discussion around the movie - while it already has more than enough good material to inspire those.     Is this paradox present in the original novel? Is there an explanation that makes it more consistent with the overall rigorous tone of the story?

Would the 18 months later conversation between Louise and General Shang in Arrival still be the same after Louise having accessed the information from that conversation before she "physically" reaches that point in time? If not, wouldn't that create a paradox?  For the immutable time theory to work, i.e. Louise to be unaware of her calling him, she shouldn't have that information which after the events of the movie she does.   Does this suggest a multiple timeline theory? That would support heptapods trying to change their fate by transcending humans and asking for their help. But at the same time it challenges their ability to be able to perceive the future, as there would be infinite possibilities and also they would have choice to change their fate which the movie plot goes against.


I have imported a mesh (AutoCad DXF) and I'm experiencing strange shading behavior. I've done the following to try and address the problem with no luck:  Recalculate Normals Remove Doubles Delete Loose Geometry Cleared Seam, Sharp, and Bevel Weights  There are no modifiers on the mesh.  The original imported mesh looks fine in smooth shading but I need the mesh to be in quads which causes the shading to mess up as shown in photo. I can add my .blend file but I'm not sure how to do that.

Here is the viewport in material view.  The node setup is just a PNG texture into a diffuse shader.    And this is in rendered view.  I've tried using environmental lighting as well as a directional light, and while the lit parts become brighter/washed out, the darker parts stay dark.  Normals are correct and there is no z-fighting.  Ambient Occlusion is not enabled.  Changing to Flat shading makes it worse.    Update:  Any modifier that alters the mesh (bevel, subdivide, etc) make the problem go away instantly.


Ever since I have received a , clicking on the notifications icon* from within the app crashes it.  I cannot open the notifications panel at all now.  Version: 0.1.26  UPDATE: It seems to have been resolved in 0.1.27 as the notification panel is opening now.  *Since there seems to be some confusion, I meant clicking on the notifications icon and not the specific careers notification as mentioned in the previous question.

I got a notification from Careers 2.0 today. Clicking on the notification opened the app, and was promptly followed by a crash.   Now, I know that Careers is probably not a priority for the app, (is it?) so, either notifications from careers should not be shown in the app inbox, or they should directly open up the browser.  Version: 0.1.26  UPDATE: It seems to have been resolved in 0.1.27 as the notification now opens up in a browser window.


I am trying to find out the class of an element when hovered over, and I am getting a   TypeError: undefined is not an object (evaluating 'classString.split')   console error. Here is my code.  function findClass(){     var classString = $(this).attr('class');     var myClass = classString.split(' ')[0];     alert(myClass); }  //blog  $(".img2.blog").mouseenter(function() {     $('.img2.blog').css('opacity', '0');     $('.img1.blog').removeClass('hidden');      findClass(this);  });  //albums  $(".img2.albums").mouseenter(function() {     $('.img2.albums').css('opacity', '0');     $('.img1.albums').removeClass('hidden');      findClass(this); });  //videos  $(".img2.videos").mouseenter(function() {     $('.img2.videos').css('opacity', '0');     $('.img1.videos').removeClass('hidden');      findClass(this); });  //contact  $(".img2.contact").mouseenter(function() {     $('.img2.contact').css('opacity', '0');     $('.img1.contact').removeClass('hidden');      findClass(this); });   Not sure how to pass "this" as an argument. Any help appreciated.

I have a pretty good understanding of Javascript, except that I can't figure out a nice way to set the "this" variable.  Consider:  var myFunction = function(){     alert(this.foo_variable); }  var someObj = document.body; //using body as example object someObj.foo_variable = "hi"; //set foo_variable so it alerts  var old_fn = someObj.fn;   //store old value someObj.fn = myFunction;   //bind to someObj so "this" keyword works someObj.fn();               someObj.fn = old_fn;       //restore old value   Is there a way to do this without the last 4 lines?  It's rather annoying...  I've tried   binding an anonymous function, which I thought was beautiful and clever, but to no avail:  var myFunction = function(){     alert(this.foo_variable); }  var someObj = document.body;        //using body as example object someObj.foo_variable = "hi";        //set foo_variable so it alerts someObj.(function(){ fn(); })();    //fail.   Obviously, passing the variable into myFunction is an option... but that's not the point of this question.  Thanks.


Name of this short story & anthology it appears in? From around 2000.  Two men stranded on a planet find an alien storehouse of multi rooms. There seems to be a vehicle in the first room and one man works on getting it started. When the other man searches for supplies, a door closes between them, but they can still communicate by radio. The exploring man does find what they want and calls the first man - who says he got the vehicle started and it's hungry...

I read this short story in about 1974 or 1975.  It was in a library book, definitely a hardcover collection of science fiction short stories.  Two men are marooned in space.  They gain access to an alien space station (or maybe some sort of emergency shelter).  They don't know anything about the aliens (there are none present; the station was either abandoned,  automated, or an emergency outpost).  The story is about them trying to figure out what the stuff in the station does, and whether any of it is food that they can eat.  The phrase "One man's meat is another man's poison" was used several times; it's the first time I ever encountered it (I was about 8-9 at the time).


I don't know much about computers. But a friend of mine installed Ubuntu 14.04 to try and I like it. But I can't play videos and music. Its says it needs MP3 codecs.  How can I get them?

How can I install the most used plugins like flash player and mp3 in Ubuntu?


guys  I am currently writing to a time series but the limit for the list of points I can send is 200 elements at a time. Currently the length of my list is 1586 elements. how do I process the first 200, then the next 200, until I reach the full length of 1586 elements ? Lets say my dummy list has 1586 elements, what will be an appropriate  way of doing this? dummy_list = [99,245, 69,00,27.. ,.., .., .., n]

I have a list of arbitrary length, and I need to split it up into equal size chunks and operate on it. There are some obvious ways to do this, like keeping a counter and two lists, and when the second list fills up, add it to the first list and empty the second list for the next round of data, but this is potentially extremely expensive.  I was wondering if anyone had a good solution to this for lists of any length, e.g. using generators.  I was looking for something useful in itertools but I couldn't find anything obviously useful. Might've missed it, though.  Related question:


Now that iOS 11 supports HEIC images as first-class citizens, I'm wondering if there's any way to convert existing JPEG images from the camera to the new format?  My wife's iPhone 6 is stuffed to the gills, and the vast majority of it is photos. Upgrading them in-place would save many gigs.

Can the whole icloud library be converted from the non-optimised format to the new optimised format, or vise versa?  I have noticed that some of my photos have automatically be using the new format.


I'm taking a class on classical fields and I came across a statement that I can't think about an argument to show that its true.  It says that Invariance of a Lagrangian under transformations on Poincaré group ensures the covariance of the Euler–Lagrange equations under these transformations.  How can one prove this?

Invariance of action $\Rightarrow$ covariance of field equations? Is this statement true?  I have only seen examples of this, like the invariance of Electromagnetic action under Lorentz transformations.  How could we prove it?  The action is a scalar, $S$, so how I can't even transform it like $U^{-1}SU$...


I joined Area 51 earlier today. I find out very interesting to track proposed forums, vote on example questions, etc.  When I think of a downloaded Android app, I expect nearly all functionality... Which would include Area 51 sample question posting, sharing proposal links, commenting to revise sample questions, etc.  The layout for Area 51 is unique, but I feel that it could be easily translated into the Android app, especially for the future tablet version. You can view proposals by tag (or category). You can easily flag silly sample Qs or comments.

Will  be supported on the Android App in the future? I visit A51 rather frequently and I would like to see it in the App.


I've created a self-signed sertificate  $ openssl genrsa -out key.pem 1024 $ openssl req -new -key key.pem -out request.csr $ openssl x509 -req -in request.csr -signkey key.pem -out cert.pem   and created an HTTPS server:  var server = https.createServer({     key: fs.readFileSync(__dirname + "/key.pem"),     cert: fs.readFileSync(__dirname + "/cert.pem") }   Then I requested the page. The expected result is that a browser complained that a connection is not secure. My question how does a browser know that? Is it server job to verify the certificate and notify browser about that or it's a browser job?

What is the series of steps needed to securely verify a ssl certificate?  My (very limited) understanding is that when you visit an https site, the server sends a certificate to the client (the browser) and the browser gets the certificate's issuer information from that certificate, then uses that to contact the issuerer, and somehow compares certificates for validity.     How exactly is this done?  What about the process makes it immune to man-in-the-middle attacks? What prevents some random person from setting up their own verification service to use in man-in-the-middle attacks, so everything "looks" secure?


Let $G$ be a group, $N \triangleleft G$ and $\bar{G} = G/N$.  Prove that for every two elements $\bar{a},\bar{b} \in \bar{G}$ the following is true:  $\bar{a}\bar{b} = \bar{b}\bar{a} \Leftrightarrow a^{-1}b^{-1}ab \in N$  So this looks a lot like the Correspondence Theorem, so I have an understanding as to how these are connected, but I'm at a loss when it comes to the proof of this.  I am supposed to prove this without having that G/N is Abelian.

I am trying to prove the above with the conditions that N is normal to G and $G/N$ is abelian.  So then for $Na,Nb\in{G/N}, NaNb=NbNa$.  But $NaNb=Nab=Nba$, so then we know $ab=ba$, so G is abelian.  So if $ab\in{G}, N=abN(ab)^{-1}=abN(ba)^{-1}=baNa^{-1}b^{-1}....$ and i'm getting lost...


My professor showed the following false proof, which showed that complex numbers do not exist. We were told to find the point where an incorrect step was taken, but I could not find it. Here is the proof: (Complex numbers are of the form $\rho e^{i\theta}$, so the proof begins there) $$\large\rho e^{i\theta} = \rho e^{\frac{2 \pi i \theta}{2\pi}} = \rho (e^{2\pi i})^{\frac{\theta}{2\pi}} = \rho (1)^{\frac{\theta}{2\pi}} = \rho$$ $$Note: e^{i\pi} = -1, e^{2\pi i} = (-1)^2 = 1$$ Since we started with the general form of a complex number and simplified it to a real number (namely, $\rho$), the proof can claim that only real numbers exist and complex numbers do not. My suspicion is that the error occurs in step $4$ to $5$ , but I am not sure if that really is the case.

$$e^{i} = e^{i2\pi/2\pi} = (e^{2\pi i})^{1/(2\pi)} = 1^{1/(2\pi )} = 1$$  Obviously, one of my algebraic manipulations is not valid.


Are there any major differences between <button type="button" name="theButton">SUBMIT</button> and <input type="submit" value="SUBMIT" name="theButton" />  Also, can you use <button type="submit" name="theButton">SUBMIT</button>?

When looking at most sites (including SO), most of them use:  <input type="button" />   instead of:  <button></button>    What are the main differences between the two, if any? Are there valid reasons to use one instead of the other? Are there valid reasons to use combine them? Does using <button> come with compatibility issues, seeing it is not very widely used?


Let x, y and z be three integers. Suppose that the binary representation of x uses n bits, the binary representation of y uses n bits and the binary representation of z uses n bits. How many bits does the binary representation of the product xyz use? Note: Provide all details of your solution and give your final answer using Θ-notation.  I figured out if x y and z are all the maximal bit number then x=y=z=2^n-1  Not sure how to proceed or deliver the answer in Θ-notation

Problem:  Let $x, y,$ and $z$ be three integers. Suppose that the binary representation of $x$ uses $n$ bits, the binary representation of $y$ uses $n$ bits and the binary representation of $z$ uses $n$ bits. How many bits does the binary representation of the product $xyz$ use?  Thoughts:  My first impulse is to consider the case where $x,y,z$ are all the maximal number that can be represented by $n$ bits in binary, namely that $x=y=z=2^n -1 $.   Then $xyz = (2^n -1)^3 = 2^{3n}-2^{2n}-2^{2n+1}+2^{n+1}+2^n-1$  $=2^{2n}(2^n-1)-2^{n+1}(2^n-1)+2^n-1 = (2^{n}-1)(2^n-2^{n+1}+1)$  Expanding in this manner has not really helped me clarify what the solution should be. Any different approaches or hints would be much appreciated.


I have been working on this question. Let A be an open set.  Does Int(A-closure)= A?    Here is my answer:  Let my space be [0,1] ∪ {2} and my topology be the subspace topology.    Let A = (0,1) ∪ {2}.  Then, A-closure = [0,1] ∪ {2}  But then, int(A-closure) = [0,1] ∪ {2} = A-closure  Hence int(A-closure) does not equal A.

If $U$ is an open set in a topological space, is it true that $U$ is the interior of the closure of itself?   If $U$ is open, it must be the interior of itself. But is it the interior of the closure of itself? In the closure, we include all points $x$ such that any open set containing $x$ also contains a point in $U$. In the interior of the closure, we take the union of all open sets contained in the closure.


I'm a bit newbie in DSP. I'm trying to modulate two signals and create DSB-SC am signal. I choose ring modulator for it. So can anyone show me any working ring modulator circuit?

I am using ring modulator for DSB-SC  am modulation in a transmitter circuit. Can anyone please tell me about more DSB SC modulator for am modulation? I want to know which one to use where?


Smallest n>0 such that $2001^n-1\:%$ is divisible by $\:2^{2002}$, can you give me some hints as to what theorem/algorithm to use to approach this problem?

Can someone explain me how this type of examples are being solved? I know that I can watch this example like this $2001^{n}\equiv 1\ ({\rm mod}\ 2^{2002})$ but I don't know what to do when the divisor is such a large number like $2^{2002}$  $2^{2002}|2001^{n}-1$


I have a video that I want to upscale but I don't want to lose the aspect ratio of the original video. My source file resolution is 864 x 692 and I want to upscale it to 1280 x 720 I found this on  but honestly I could not understand how to do it. If you can help me build a ffmpeg command that is suited to my case it will really help me. Thank you Update I used this guide and I got close to whatever I wanted to do

I have a html 5 video player which is 700px wide, 400px high. I'm trying to use avconv to use ffmpeg to resize (while retaining the aspect ratio) and making sure it fits into my player.  Input can be a file of any size, so I need to resize the larger ones but center the smaller ones with black bars. So far I've tried: -s and -aspect, I've seen pad being used with the -vf switch but don't understand how it works enough to get what I need.    This is a rough idea of what I need. I'm not sure if it's even possible. It's almost like CSS's max-width/max-height. I realise this may just be a jumble of words but if anyone happens to understand what I'm talking about, I'd appreciate help, Thanks.  avconv command:  avconv -y -i control.avi -vcodec libx264 -b 2000k -bufsize 20M -acodec aac -strict experimental -ar 44100 -ab 256k bigbuck_out.mp4


Can you tell me what the difference is between cat and sudo cat?  All I know so far is that cat is used for displaying contents of file and concatenation.

What are the differences between sudo, su, visudo, chroot, and gksu ?


Sometimes Xcode will show an error "Expected expression" on the line after a case. For example, Xcode is pointing to UserContentViewController with a red arrow:  - (void)tableView:(UITableView *)tableView didSelectRowAtIndexPath:(NSIndexPath *)indexPath {     switch (indexPath.row) {         case IndexVideo:              UserContentViewController* detailViewController = [[UserContentViewController alloc] initWithUser:self.user];             [self.navigationController pushViewController:detailViewController animated:YES];             break;      } }   If I put braces around my case, the error is gone. Firstly, I want to know what is the problem with not using braces. I've never used braces in cases in any other language. Secondly, why does Xcode only complain about my cases on rare occasions? I can't quite discern what type of code triggers this error.

I've always wondered this - why can't you declare variables after a case label in a switch statement?  In C++ you can declare variables pretty much anywhere (and declaring them close to first use is obviously a good thing) but the following still won't work:  switch (val)   {   case VAL:     // This won't work   int newVal = 42;     break; case ANOTHER_VAL:     ...   break; }     The above gives me the following error (MSC):     initialization of 'newVal' is skipped by 'case' label   This seems to be a limitation in other languages too.  Why is this such a problem?


I tried to open a background image (jpg) and it is not showing. I made sure I checked the background box and I also tried it with with many images. I saw tutorials and I cannot find any differences in the procedure, except in my case the image doesn't appear. Do you know what I maybe do wrong?

I am trying to find out how to approach a relief type project. I have a background image and a flat plane mesh to sculpt on, but I actually don´t see any changes looking straight on top. When I tilt the perspective a bit the image disappears.  Is there a way to make the image appear at all perspectives?


I've managed to remove password on login but can't remove this useless screen, so every time I boot up I have to press the "Log in" button to bypass it:    Following on from a comment suggestion I've tried the solutions listed at  but nothing has changed. I edited lightdm.conf file to include autologin-enable=true which wasn't there, and nothing has changed  Perhaps it's because I'm running Linux Mint 19 Tara, Cinnamon 3.8.7 whereas the suggested duplicate is for Mint 18. I don't know.

Mint 18.2 64b Cinnamon 3.4.3   This is running in a VM on my machine so I'm not worried about login security. I've been looking around on the Mint forums and only found a lot of threads about troubleshooting problems with autologin.   The setting is not in the Login Window settings screen.   The setting is not in the Users and Groups settings screen.   Where is this setting located now?


I ran into some claims of my own while doing an exercise that I would like to be true for my solution to be correct. Are the following true or false, how to prove or disprove it?  Let $ \varphi : \mathbb{N} \setminus I \rightarrow \mathbb{N} $ with  $I \subseteq\mathbb{N}$,   is it bijective ?  I know it holds for I finite, because by Dedekind's criterion there exist a bijection between an infinite set and some proper subset. But I am not sure if I can say the same for I infinite, because what if for example I is $\mathbb{N} \setminus \{1\}$,then the domain of $\varphi$ would be just $\{1\}$, wouldn't it? and $\varphi$ wouldn't be a bijection . But it might as well be just an ilusion like when one thinks even numbers are half of natural numbers, and then it turns out they are equinumerous 2) If $ \psi : Z  \rightarrow \mathbb{N} $ is a bijection,with $Z$ a subset of $\mathbb{N}$, then $ \psi : Z\setminus I  \rightarrow \mathbb{N}\setminus I$ is also a bijection, $I \subseteq\mathbb{N}$ Same kind of doubt here if I is infinite, but also I guess I have to consider two cases: $I \cap Z \neq\phi$ and $I \cap Z =\phi$

We all know that $|\mathbb{N}| = \aleph_0$. Since $|\{-1\} \cup \mathbb{N}| = \aleph_0$ as well, I guess you could say that $\aleph_0 + 1 = \aleph_0$.  You can go on to derive that $\aleph_0 + \aleph_0 = \aleph_0$, and by induction $n \times \aleph_0 = \aleph_0$ (assuming that $n$ is finite, anyway).  Now, here's a thing: What is $\aleph_0 - \aleph_0$?  Well, $|\mathbb{P}| = \aleph_0$, and $|\mathbb{P} \backslash \mathbb{N}| = \aleph_0$, so perhaps $\aleph_0 - \aleph_0 = \aleph_0$?  No, wait. Consider the set $S = \{n \in \mathbb{N}: n > 5\}$. Now we have $|S| = \aleph_0$, and yet $|\mathbb{N} \backslash S| = 5$. So maybe $\aleph_0 - \aleph_0 = 5$?  But that is absurd, since we can redefine $S$ to make the result any finite number we wish. Or we can define $S$ such that the result is countably infinite.  Does this mean that the notion of $\aleph_0 - \aleph_0$ simply has no definite answer? Or am I just being too simplistic here?


In Star Wars movie, Luke blow up the death star by flying really close to the surface at high speed and shooting a missile straight down.  From what I understand it has to be at 45° before the top of the hole to shoot, like this:   <=L=>mm          m            m             m   ----------|m|---------------            |m|            |m|   Where m is the trajectory used by the missile.  Is there any explanation on how can the missile turn in such a steep way, and why couldn't it be fired from somewhere else, since the missiles seems to have extra high maneuverability ?

Based on this question:    Proton Torpedoes launched from Luke's X-Wing were able to change direction 'on a dime' 90 degrees to get into Death Star's thermal exhaust shaft.  It seems intuitively obvious that the cause of that was technological (since Luke had nowhere near Force training at the time to be able to cause the turn).  Is there any sort of official Canon explanation for how the torpedoes turned?   E.g., was it some capability of torpedoes' propulsion? Forcefields from an X-Wing? Some interplay between a torpedo and Death Star's technology as TangoOversway's answer to that question alluded to being a possibility? Some other mechanism?  Please note that "programmed to turn in advance by X-Wing's targeting computer" is not an answer, as I'm looking specifically for what the mechanism for ability to execute the turn, NOT why the turn happened when it happened.


I've tried this using the remesh modifier with cubes and looks great, but it loses the texture/coloring, and the cubes aren't perfect, the cubes aren't at same size and position on a 3d grid.  The cubes must be all the same size, and the positions be align by the cubes size. The texture/colors and uv must be made from views(front,back,left,right,bottom,top) and pixelated interpolating colors.

I am using Blender's particle system to try to voxelize my mesh. I'd like to color the voxels based on the diffuse color of the textured mesh at the closest location to each voxel. This is an image that shows what I'm trying to do:     explains how to color emitted particles based on the mesh from which they are emitted. The technique uses the "jittered" emission setting:    Using the technique in the post I linked to, here is what I get with "jittered" selected. You can see that the emitted cubes correctly match the color of the mesh:    When I change the emission setting to "grid", the cubes no longer match the color of the object:    I'd like to use the "grid" emission setting for voxelization, but can't figure out how to get the color of the emitted particles to correctly match the color of the mesh.   This is what my shader nodes look like for the cube which I am using as the dupli object:    I'd appreciate any help with this! Please let me know if there's something I can clarify.


I have the following problem:  Suppose that $A$ is a symmetric matrix, with $A$ = $A^{T}$ . Suppose $\vec{v}$ and $\vec{w}$ are eigenvectors of $A$ associated with distinct eigenvalues. Show that $\vec{v}$ and $\vec{w}$ must be orthogonal. (Hint: Show that a$\vec{v}$ $\cdot$ $\vec{w}$ = $\vec{v}$ $\cdot$ b$\vec{w}$.)  I am unsure how to approach this, even with the hint taken into account. I tried to use the fact that orthogonal complement of Im(A) is in Ker of A transpose, and since they are equal it is also in ker A, but that didn't get me anywhere (I am probably thinking in the wrong direction). Thanks in advance for your hints!

Can someone point me to a paper, or show here, why symmetric matrices have orthogonal eigenvectors? In particular, I'd like to see proof that for a symmetric matrix $A$ there exists decomposition $A = Q\Lambda Q^{-1} = Q\Lambda Q^{T}$ where $\Lambda$ is diagonal.


I've built a particle animation I like in blender... basically like dust falling through the air. I want to import this to KeyShot for rendering.   I think I need to convert the particles to mesh, but I want them to still be animated as they are. I think I'm missing a step. I want to be able to export via .abc which KeyShot can import as a Keyframed animation.   I'm pretty new to Blender. If someone can offer me the steps, I'd be very grateful. I assume it'll be something like:   Create Particle Animation > Convert Particles to Mesh > Apply Baked Particle Animation to Mesh (not sure how to do this) > Keyframe animation > Export as Alembic  I haven't been able to get it to work. Thanks in advance.

I've started trying to make a 3D model that I will end up exporting to an augmented reality app but I've hit a problem in terms of the particle system. The app wants the 3D file in .dae(collada) format which blender allows, but it doesn't seem to export particle systems. I've read that blender doesn't support exporting particle systems at all so I'm now focused on converting the particle system to lots of meshes which will (hopefully)animate using key frames. Then I can export all the meshes and the particles will 'work'.  Currently I'm just using a standard particle system emitting small icospheres. I've tried a few different techniques, such as 'make duplicates real' and using a particle instance instead but they don't seem to animate. Instead it just freezes the current frame into an object(which exports fine but is not what I want). I've also tried recording the animation in the blender game engine but particle systems don't work with it so that didn't work either.  Any help would be appreciated! Thanks


Is there any difference in adding the plain text and key vs using xor instead(apart from the performance improvements)?

I found a program which takes a purely alphabetical message, converts the letters to their ASCII values and combines them with the ASCII values of an alphabetical key (wrapping around when it gets to Z).  (The key being used is fully random and is required to be at least a long as the message.)  But from what I usually read about one-time pads, the message and the key are in binary, and the bits in the message is XORed with the key to produce the ciphertext. Combining the ASCII values sounds like a similar but obviously very different process.  Is this a valid way to implement a one-time pad? Or does the process merely resemble the binary XOR and doesn't have the same cryptographic properties as a one-time pad?


Can anyone explain the following. What is exactly causing the following problem?  int main() {   double a;   double b;   int i = 2115;   a = 77.0*i/1000*100;   printf("%.20f\n", a);    b = 77.0*i/10;   printf("%.20f\n", b); }   I expect both outputs to be 16285.50000000000000000000 but it prints 16285.49999999999818101060 then 16285.50000000000000000000  I understand that numbers are represented in binary and which is why many decimals cannot be represented correctly in computer systems. However, specifically, why does 77.0*i/10 work but not 77.0*i/1000*100? How is 77.0*i/10 always able to be represented correctly? (Please dont explain using i = 2115 only, what about all REAL number i?)  And if so, what other variations of this multiplication/division can work?

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


I am listening to the audiobook Darth Plagueis. In the book it mentions that there existed sorcery (at least in the past), and this sorcery had cross-over with the Sith but apparently was not the darkside itself.  This leaves me with some questions. The Force, from what I can tell, while an esoteric, celestial power with the Jedi and Sith pseudo-religous traditions surrounding it, was explicable by science. OTOH, I don't understand how sorcery could be -- was this part of the story a shift from Science Fiction to pure fantasy and magic?  Was the sorcery intertwined with the Force or truly separate? Was it stronger? Would only a Sith practice sorcery, or also Jedi? Could some examples of it be given?   I'm not making any distinction here between Disney and pre-Disney (I'm not even sure if this is a Disney era book), so feel free to draw from either.  This is VERY different than the question "does magic exist in Star Wars canon" wherein the answer is "no magic exists in the Disney version" because    I'm referencing a book that says it does exist and  I don't care about Disney vs. non-Disney   Also    I'm specifically asking about sorcery -- especially that which the Sith (and possibly Jedi) practiced; whether that is the same as "magic" or not is part of my question.

Is there any sort of magic, besides the Force, existing in the Star Wars universe?  What triggered me to ask this question were the . The Wookieepedia article refers to their powers as "magicks" and seems to present deeds unseen in other force users:     The most powerful of them could use that ichor to summon objects out of the thin air, transform people into ghostly versions of their true forms, or even reanimate the dead.   I have found  that almost alludes to the Dark Side of the Force once; however it does so without a proper citation, and only actually says "gifted with the power to wield dark magicks", avoiding the topic.


I removed one switch from a three gang switchbox. I simply don't need it. All the wires to that switch have been trimmed and taped off and the same at the opposite end of those wires.   Now, what can I do to finish off the outside of that switch? The simple solution would be to plaster over the vacant third of the box and put a double gang cover on the outside. Am I breaking any codes if I do that? If so what's a decent alternative?  This is in Canada.

I have a three gang box, dimmable, switch, switch.  I want to use a wifi capable switch, but it comes with all three switches in a single gang switch.  How do you use the existing 3 gang box with only one gang switch now?


I am a bit confused in understanding the casting concept in java. Here is a piece of code that I have written.  class Parent {     public int a = 5;     public void print()     {         System.out.println("a :: " + a);     } } class Child extends Parent {     public int b = 10 ;      public void printMe()     {         System.out.println("a :: " + a + " b::  " + b);     } }  public class Main  {     public static void main(String[] args) {          Child b = new Child();         Parent a = (Parent)b;         Child b1 = (Child)a;         b1.printMe(); // This piece of code works fine. There is no exception           Parent a1 = new Parent();         Child b2 = (Child) a1;         b2.printMe(); //This piece of code throws a java.lang.ClassCastException     } }   In the first piece of code I am creating a child object and typecasting it to parent. When I typecast the parent object to child again It works fine. But in the other piece of code I am creating a Parent object first and then typecasting it to child. Compiler doesn't show any error. But when I run the code It is throwing ClassCastException. Can someone explain me why is it so ? If there is no problem with first piece of code means second one also should work fine right ? I am so confused. And one more question is when do we assign a child object to a parent reference ? I mean for example if we write a code like below  Parent p = new Child();   which is equal to the following code right ?  Parent p = new Parent();   Then what is the benefit in writing such code ?

I have seen this mentioned a few times and I am not clear on what it means. When and why would you do this?   I know what interfaces do, but the fact I am not clear on this makes me think I am missing out on using them correctly.   Is it just so if you were to do:  IInterface classRef = new ObjectWhatever()   You could use any class that implements IInterface? When would you need to do that? The only thing I can think of is if you have a method and you are unsure of what object will be passed except for it implementing IInterface. I cannot think how often you would need to do that.   Also, how could you write a method that takes in an object that implements an interface? Is that possible?


A few minutes ago I have noticed a small decrease in my rep (-4), not an issue, just assumed that there were two downvotes. But when I opened my rep for today, I only had:  40 today +10 upvote +15 accept +15 accept   I then went ahead and calculated total rep as a sum for each day displayed (I have not been here for a long time) and got 4474, while the page displays 4470.  Comparing daily rep shown in profile and rep shown in  I found these diffs:         profile page | /reputation page Jun 11          106 | 96      Jun 22            0 | 10  Jun 30          217 | 215    - no idea what's this (-2)  Jul 2            73 | 58     - accept Jul 4           223 | 238    - unaccept  Jul 7           227 | 235    - serial downvotes Jul 8           313 | 307    - undownvote (shown in profile as +8, not +6) (-2)   So currently the diff between profile page and /reputation page is "-4", which is exactly the reputation change that I saw today, but cannot find any explanation for this.  Is there some sort of reputation clean-up mechanism that might be the reason for this?

My reputation rating on SO took this hit an hour ago, and it is due to what appears to be the simultaneous deletion of multiple questions.  I am uncertain why it happened, am concerned, and would appreciate an explanation.  Going to  shows that it was removed due to moderation.  Was a script run deliberately, or were we hit with a question deletion attack; what happened?  -12     today -2  1 hour ago  removed     How to send a 2d Vector over UDP in c++ -2  1 hour ago  removed     How do I use the Eclipse debugger to debug a Java application? -2  1 hour ago  removed     PHP string error; inconsistency with local and server -2  1 hour ago  removed     Unable to start the MySQL service after a server migration -2  1 hour ago  removed     How to use Java to print a text file on a ticket printer? -2  1 hour ago  removed     How can all of the ZBrush Obj files be imported to make a complete model?


$$\frac{\sin(x)}{x} = 1$$ and $$\frac{1-\cos(x)}{x} = 0$$  I can't come up with any solution. Could you please help me?  Also: $$\lim_{x\to 0} \frac{1-\cos(x)}{\tan(x)\sin(x)}$$

How can one prove the statement $$\lim_{x\to 0}\frac{\sin x}x=1$$ without using the Taylor series of $\sin$, $\cos$ and $\tan$? Best would be a geometrical solution.  This is homework. In my math class, we are about to prove that $\sin$ is continuous. We found out, that proving the above statement is enough for proving the continuity of $\sin$, but I can't find out how. Any help is appreciated.


| is an OR and & is AND. I have the following code and they works OPPOSITE.             int a = 0;             int b = 0;             int c = -1;             if ((a | b | c) == 0)              {                 textBox8.Text = "everything 0";              }             else             {                 textBox8.Text = "something is not a 0"; // <- code goes here             }                         if ((a & b & c) == 0)             {                 textBox9.Text = "everything 0";  // <- code goes here                         }             else             {                 textBox9.Text = "something is not a 0";                            }  why i have this result?

I have always used || (two pipes) in OR expressions, both in C# and PHP. Occasionally I see a single pipe used: |. What is the difference between those two usages? Are there any caveats when using one over the other or are they interchangeable?


I have a set of equations which are defined below  \begin{figure*}[h] \label{eq1} \begin{alignat}{2}    & E_{\mathrm{access}}    && = E_{\mathrm{read}} + E_{\mathrm{write}}                                 = E_{\mathrm{R\_L1}} + E_{\mathrm{R\_lower}} + E_{\mathrm{W\_L1}} + E_{\mathrm{W\_lower}} \label{equation1} \\    .... \end{alignat}    \end{figure*}   The output produced is logically correct. However, I want to use smaller fonts and reduce the distance between symbols. For example, the distance between T+D, N*E....    How can I do that?

In TeX and LaTeX, the math binary relations (like =, \parallel, <, \le ...) have a default (rubber-length) spacing to either side, which is too large for my liking. How can reduce it?


I'm reviewing Complex Analysis and I don't quite understand the concept of normal family. There is an exercise in Ahlfors' Complex Analysis: Prove that in any region the family of analytic functions with positive real part is normal.  I believe this is wrong. Theorem 15 says a family of analytic functions is normal with respect to $\mathbb{C}$ iff the functions are uniformly bounded on every compact set. However, this set contains the constant functions with arbitrary real part. So there is no way those functions are locally bounded.  Where am I wrong?

I'm having difficulty with the following exercise in Ahlfors' text, on page 227.     Prove that in any region $\Omega$ the family of analytic functions with positive real part is normal. Under what added condition is it locally bounded? Hint: Consider the functions $e^{-f}$.   Here is what I've tried:  I will start with a remark:  Apparently, Ahlfors wants us to show that the family is "normal in the classical sense". That is, every sequence of functions in the family has a subsequence which converges uniformly on compact subsets or tends uniformly to $\infty$ on compact subsets. In order to see why this is the right definition, consider the sequence $f_n(z)=n$. It is contained in the family but has no appropriate subsequence (in the sense of definition 2 in the text with $S=\mathbb C$).  Now, to the attempt itself:  Let $\Omega \subset \mathbb C$ be a fixed region, and consider the family $$\mathfrak F=\{f: \Omega \to \mathbb C | f \text{ is analytic and } \Re(f) >0 \}. $$ We would like to show that $\mathfrak F$ is normal in the classical sense. Following the hint, we examine the family $$ \mathfrak G=\{e^{-f}:f \in \mathfrak F \}.$$  $\mathfrak G$ is locally bounded (since $|e^{-f}|=e^{- \Re (f)}<1$ for every $f \in \mathfrak F$), thus it is normal with respect to $\mathbb C$ (theorem 15), and obviously, it is normal in the classical sense as well.  Let $\{ f_n \}$ be a sequence in $\mathfrak F$, and consider the sequence $\{ g_n \}=\{e^{-f_n} \}$ in $\mathfrak G$. According to normality it has a convergent subsequence $\{ g_{n_k} \}=\{e^{-f_{n_k}} \}$ which converges uniformly on compact subsets of $\Omega$ to some function $g$ (which is analytic by Weierstrass' theorem).  Since each $\{ g_{n_k} \}$ is nonvanishing, the limit function $g$ is either identically zero, or non vanishing as well (Hurwitz's theorem). In the former case it is easy to show that the subsequence $\{ f_{n_k} \}$, obtained by the same indices, tends to $\infty$ uniformly on compact sets. Hence, we will assume from now that $g(z) \neq 0$ for all $z \in \Omega$.  Up until now, I was trying to show that the subsequence $\{ f_{n_k} \}$ works in all cases, but sadly, this is not the case. Consider the sequence $f_n(z) \equiv 1+2 \pi i (-1)^n \in \mathfrak F$. In that case $g_n(z)=e^{-1}$, and an admissible subsequence is $g_{n_k}=g_k=e^{-1}$. However, $f_{n_k}=1+2 \pi i (-1)^k$ diverges everywhere.  Can anyone please help me finish this proof? Or maybe give me some hints?  Thanks!


So I was clicking around on the new profile page here on meta and I got presented with this...    While I understand the purpose of a rate limiter, seems like its prob. being a little to aggressive..

I just got this error message for the first time (I was getting this as the response to any request on the SE network for about the last five minutes, until now):     We're sorry...      There are an unusual number of requests coming from this IP address.   To protect our users, we can't process any more requests from this IP   address right now. We'll restore access as quickly as possible, so try   again soon. If you believe you have reached this page in error,   contact us.   As far as I know, I was not spamming SE or participating in DOS attack, and I find it unlikely that any of my office coworkers who share my IP address were doing so either.  Granted, I was pressing F5 a lot. But I've always pressed F5 a lot on SE, and have never gotten this message before. So my question is: Is it possible to get this error message simply by refreshing too much or too often? Or is that message reserved for a truly massive number of requests that are unlikely to be caused by one person refreshing a lot? (In the former case, I can't explain why I've never gotten it before; in the latter case, I can't explain why I just got it now).


After a reboot, my NFS drives do not mount automatically, I need to manually do:  sudo mount -a  What is wrong? My /etc/fstab looks like this:  /dev/disk/by-uuid/b59667cf-c443-4832-9286-0856ca9e7a35 / ext4 defaults 0 0 /swap.img       none    swap    sw      0       0  192.168.1.96:/nfs/Backups /media/iomega nfs nolock 0 0 192.168.1.96:/nfs /media/ix2-6 nfs nolock 0 0 192.168.1.97:/nfs /media/ix2-4 nfs nolock 0 0 192.168.1.97:/nfs/Videos /media/ix2-4-videos nfs nolock 0 0 192.168.1.97:/nfs/Documents/Archives /media/ix2-4-archives nfs nolock 0 0 192.168.1.92:/nfs/Videos /media/wd-ex2/videos nfs nolock 0 0 192.168.1.92:/nfs/Documents /media/wd-ex2/Documents nfs nolock 0 0 192.168.1.92:/nfs/Sounds /media/wd-ex2/Sounds nfs nolock 0 0 192.168.1.92:/nfs/USB_TrekStor_DS_maxi_g.u_q_1 /media/wd-ex2/usb1 nfs nolock 0 0

right now   I have setup /etc/fstab like this:  //192.168.5.167/H /mnt/ssd cifs credentials=/root/.smbreds,noauto,x- systemd.automount 0 0   I want to set it up like first network should be connected and then fstab mount should get mounted.


Today I saw a post with abusive words.   I flagged the post, waited for 10 mins, and after that I did an edit.   I am right in doing such an edit?

I noticed that the posts of the recent spam surge on Ask Ubuntu were all edited by community members into something like     EDITED - REMOVED SPAM ANSWER   or similar.  While I understand why the users have done this and I too don't want to leave the spam content visible for longer than absolutely necessary, it made flagging more time consuming for me.  I had to check the revision for every of those possible spam posts to check if it is actually spam, instead of being able to flag directly from the review site. Spam flags carry a serious penalty, I'm not willing to add my spam flag without checking that it's really spam.  I see the benefit of editing spam, but it also causes some more effort for the later flaggers. Should we as a general policy edit out the content of spam posts, or should we deal with them solely by flagging?


What is the difference between  and ? I came to know about some materials that have low toughness but high hardness such as  ceramic tiles and glass. I want to know if it is true that high toughness also implies high hardness.

I had to look through several videos and re-read Wikipedia statements about these material properties several times before I could even begin to differentiate them. However, now that I have found out this is what I understand:    measures the pressure needed to cause permanent change.  measures the load that can be withstood before permanent change.  measures the stress needed before fracturing.   Overall, all three properties could be generalized to measure the stress needed to cause permanent change whether by fracture, plastic deformation or any other form of failure or no? Are their only differences the specific type of stress applied and the specific failure when the amount of said stress exceeds the property measurement?


I would like to deliver the application to my client, who don't have any computer knowledge, therefore, I don't wanna to let him/her to use terminal to execute my script. How can I make a single package, and let the user double click and execute?? Is there any way to do so?? Moreover, is this possible to package the python runtime to the application? Because the client may not wanna to install python.... I just wanna him/her running something like a .exe written from C, just double click and execute it. Any tools to do so?? Thanks.   Please recommend for Windows & Mac OS X.

I am looking for a Python3.0 version of "py2exe". I tried running 2to3 on the source for py2exe but the code remained broken.  Any ideas?


var ProvinciasWMS = L.tileLayer.wms('http://localhost:8080/geoserver/Mocambique/wms?',{     layers:'Mocambique:Provincias_Moz',   version: '1.1.0',    transparent:'true',    format: 'image/png',    attribution: "myattribuition" }).addTo(map);  var DistritosWMS = L.tileLayer.wms('http://localhost:8080/geoserver/Mocambique/wms?',{     layers:'Mocambique:Distritos',   version: '1.1.0',    transparent:'true',    format: 'image/png',    attribution: "myattribuition" }).addTo(map);  var PostosAdministraticosWMS = L.tileLayer.wms('http://localhost:8080/geoserver/Mocambique/wms?',{     layers:'Mocambique:Moçambique_Distritos_e_Postos',   // styles:'Provincias',   version: '1.1.0',    transparent:'true',    format: 'image/png',    attribution: "myattribuition" }).addTo(map)  ; //I tried with this code, but the popup doesn't come out with information ... and it automatically downloads a file ... I don't know what the error is map.addEventListener("click", onMapClick); popup = new L.Popup({ maxWidth: 1000 }); function onMapClick(e) {   var latlngStr = "(" + e.latlng.lat.toFixed(3) + ", " + e.latlng.lng.toFixed(3) + ")";   var BBOX = map.getBounds()._southWest.lng + "," +              map.getBounds()._southWest.lat + "," +              map.getBounds()._northEast.lng + "," +              map.getBounds()._northEast.lat;   var WIDTH = map.getSize().x;   var HEIGHT = map.getSize().y;   var X = map.layerPointToContainerPoint(e.layerPoint).x;   var Y = map.layerPointToContainerPoint(e.layerPoint).y;   var URL = "http://localhost:8080/geoserver/Mocambique/wms?SERVICE=WMS&VERSION=1.1.0&REQUEST=GetFeatureInfo&LAYERS=" +     "Mocambique:Provincias_Moz,Mocambique:Distritos,Mocambique:Moçambique_Distritos_e_Postos" +     "&QUERY_LAYERS=" + "Mocambique:Provincias_Moz,Mocambique:Distritos,Mocambique:Moçambique_Distritos_e_Postos" +     "&STYLES=&BBOX=" + BBOX +     "&FEATURE_COUNT=5&HEIGHT=" + HEIGHT + "&WIDTH=" + WIDTH +     "&FORMAT=image%2Fpng&INFO_FORMAT=text%2fhtml&SRS=EPSG%3A4326&X=" +     X + "&Y=" + Y;   popup.setLatLng(e.latlng);   popup.setContent(     "<iframe src='" + URL + "' width='400' height='200'         frameborder='0'></iframe>"   );   map.openPopup(popup); }

I am trying to make a WMS GetFeatureInfo request using Leaflet. I can not find something in the documentation to describe this process. Can you please provide with an example demostraing how to do something like this?


I have set up a test web server on CentOS 7 to find a way to fix Padding Oracle vulnerability, which I got when I scanned our production site on ssllabs.com. On the test server, I installed openssl(1.0.2j, which is latest as of 1/12/2017) and apache(2.4.25, which is also latest as of 1/12/2017) from source and made some basic changes to apache configuration such as SSL. After making sure SSL works by accessing it with a web browser, I scanned the test site on ssllabs.com, which told me that it still had the same vulnerability. I thought the test site would pass it because the bug was already fixed at the release of 1.0.2h according to the Openssl official site. I have no idea what else to try next. Any advice would be appreciated.  I think the apache uses the openssl I installed instead of the other one (1.0.1e), which is built in on CentOS7. Below is one of what I did to make sure of that.  Under the condition of ServerTokens Full  [root@*** ~]# curl --head http://***.*********.com HTTP/1.1 200 OK Date: Thu, 12 Jan 2017 19:52:31 GMT Server: Apache/2.4.25 (Unix) OpenSSL/1.0.2j Last-Modified: Mon, 11 Jun 2007 18:53:14 GMT ETag: "2d-432a5e4a73a80"  Accept-Ranges: bytes Content-Length: 45 Content-Type: text/html

We run Ubuntu Lucid 10.0.4 as the foundation of our LAMP environment. We are trying to become PCI compliant so that we can pass CC info through our server. We have run some third-party scans on our servers to begin the certification process and have run into errors regarding PHP 5 versions and Apache versions. The latest PHP version hosted in our official lucid repository is about 10 versions lower than what PCI compliance requires.   How do we upgrade to stay current with PCI compliance requirements?   We need to get from php 5.3.2 to php 5.3.15  As well as up to apache 2.2.23  I've searched far and wide for an answer and haven't come up with a realistic answer. Some recommend compiling manually - which sounds like a nightmare, and others recommend a PPA - which sounds insecure. What should we do?


This question has been always intrigued me. Why proof by Induction is admissible/acceptable ? We use this type of proof nearly every where and some times It's the easiest way of proof.

What makes induction (over natural numbers) a valid proof technique? Is $$ \dfrac{ P(0) \quad \forall i \in \mathbb{N}. P(i) \Rightarrow P(i+1) }{ \forall n \in \mathbb{N}.  P(n)} $$ just taken for granted as a proof rule, or can it be derived from more foundational axioms?  Similarly, can the principle of induction over well-founded sets be derived from something more foundational, or does it have to be assumed to be a valid inference rule?


Find the value of $\sqrt{1+\frac{1}{1^2}+\frac{1}{2^2}}+\sqrt{1+\frac{1}{2^2}+\frac{1}{3^2}}+...+\sqrt{1+\frac{1}{1999^2}+\frac{1}{2000^2}}$ I found the general term of the sequence. It is $\sqrt{1+\frac{1}{k^2}+\frac{1}{(k+1)^2}}$ So the sequence becomes $\sum_{k=1}^{1999}\sqrt{1+\frac{1}{k^2}+\frac{1}{(k+1)^2}}$ I tried telescoping but i could not split it into two partial fractions.And this raised to $\frac{1}{2}$ is also troubling me.What should i do to find the answer?

What is the fastest, paper-pencil method of finding $$\sum \limits_{i=1}^{69} \sqrt{\left( 1+\frac{1}{i^2}+\frac{1}{(i+1)^2}\right)}?$$  This is actually a quantitative aptitude problem, and hence the solutions should be fast enough and probably under a minute.  ; however, I am not sure how to find this quickly in the paper-pencil way.


I'm trying to override the tooltip style of Leaflet 1.3.1.and want to completely remove the tooltip pointer as shown in figure.  This is my css:  .ToolTipProvince{           font-size: 15px;                 font-weight:bold;                 padding: 0px;                 background: none;                 border: none;                 color: aqua;                 text-shadow: 0px 0px 10px black;                 box-shadow: none;             outline: none;         }   and applying style to layer tooltip:  layer.bindTooltip("Province Number: "+feature.properties.PROVINCE+"", {permanent: true, direction: 'centre', className: 'ToolTipProvince'});

I'd like to override the default style of Leaflet 1.0.0 tooltips, especially the bubble/frame. I don't see any options or methods for this. How do I hook into the CSS? I want to change layers individually, so I need to select each layer's tooltips individually with CSS.


My system is encountering issues while processing packages ureadahead and util-linux:  root@sait32:/home/sait32/Downloads# sudo dpkg --configure -a dpkg: error processing package ureadahead (--configure):  package is in a very bad inconsistent state; you should  reinstall it before attempting configuration dpkg: error processing package util-linux (--configure):  package is in a very bad inconsistent state; you should  reinstall it before attempting configuration Errors were encountered while processing:  ureadahead  util-linux   Can anyone please help on how to resolve this?

I can't update my system because it freezes while installing a third-party update (zramswap-enabler)! Sometimes I get the following message in Update manager:  Could not initialize the package information An unresolvable problem occurred while initializing the package information. Please report this bug against the 'update-manager' package and include the following error message: E:The package zramswap-enabler needs to be reinstalled, but I can't find an archive for it.  I tried to remove the zramswap-enabler, but it's impossible because I get the following message: dpkg: error processing zramswap-enabler (--remove):  Package is in a very bad inconsistent state - you should  reinstall it before attempting a removal. Errors were encountered while processing:  zramswap-enabler E: Sub-process /usr/bin/dpkg returned an error code (1)  Actually I would really reinstall that package, but it is unable to do it! If I remove this third-party PPA then the system is warning me about a very very serious problem. So why can I not install/reinstall/remove/update this package and why freezes the updater if I try to update?


I have data that looks like this:  Id | Loc1 | Loc2 | Loc3 | Loc4 ---+------+------+------+----- 1  | NY   | CA   | TX   | IL 2  | WA   | OR   | NH   | RI   And I want to convert it to this:  Id | LocNum | Loc ---+--------+---- 1  |   1    | NY 1  |   2    | CA 1  |   3    | TX 1  |   4    | IL 2  |   1    | WA 2  |   2    | OR 2  |   3    | NH 2  |   4    | RI   What's the easiest way to do this in Excel 2007?


I am using chemstyle or chemescheme package to automatically generate labels of compounds in the scheme. It took me a long time to make it work after I notice that it require --shell-escape to display the .esp file in the pdflatex mode.   However, I get all of the compounds labeled correctly, but how can I reference them in the text part? I tried to use \schemeref{label}, but it does not work.

I am using chemstyle and bpchem to number my compounds. I save my chemdraw drawings as eps and use TMP and TMP2 as markers that will replaced by the compound numbers. As long as \CNlabel is used before the scheme is inserted, it works fine, but if the text is below the picture as in the following example, the labeling in the text is different from the labeling in the schemes.   \documentclass{article}  \usepackage[runs=2]{auto-pst-pdf} \usepackage{bpchem} \usepackage[journal=rsc, tracking=bpchem]{chemstyle} \usepackage[version=3]{mhchem}   \begin{document}  \begin{scheme}     \begin{center}         \schemeref[TMP]{1}         \schemeref[TMP2]{2}         \includegraphics{Reactions_MSC/I010}     \end{center} \end{scheme}  \begin{scheme}     \begin{center}         \schemeref[TMP]{3}         \schemeref[TMP2]{4}         \includegraphics{Reactions_MSC/I012}     \end{center} \end{scheme}    Text where I mention the compounds in a different order than in the schemes: \CNlabel{2}, \CNlabel{3}, \CNlabel{4}, \CNlabel{1}  \end{document}    Additionally, I would prefer to have the numbering in the order the compounds appear in the schemes instead of in the order they appear in the text. Is there a good solution to do this? One possible workaround I can think of would be to add a list like this in the beginning of the document:   \CNlabelnoref{1} \CNlabelnoref{2} \CNlabelnoref{3} \CNlabelnoref{4}   To do this manually, however, would be quite tedious. Is there a way I could generate such a list automatically?


Is it possible to change the comment-meta fields?  I have tried searching the file structure and cannot see what function is writing it - all I want to do is change the word "says"

                                         james says:

   Thanks James

I am developing a WordPress theme for which I would like each comment's timestamp wrapped in in a  element for the sake of styling it with CSS rules. However,  as I use it in my theme's comments.php template does not seem to provide options to alter the HTML produced:
     <?php         wp_list_comments( array(             'style'       => 'ol',             'format'      => 'html5',             'short_ping'  => true,         ) );     ?>
   which produces timestamps as such:  <time datetime="2015-12-21T19:09:49+00:00"> december 21st,  2015 on 19:09 </time>   How can I alter the function's output to include a element around each <time> element without altering core files?  I've tried looking at my theme's functions.php, as well as WordPress wp-includes/comment.php and wp-includes/comment-template.php. None of them deal with the actual tag structure of the comment timestamps generated by wp_list_comments(), so there was nothing there for me to play with.


We all know the following universal truth since childhood.     Earth (and other planets) orbits around the Sun.   And, while I was reading , I found that the reason behind Earth revolution is chiefly due to one force:   Gravitational pull   Some physicists explains the movement of Earth around the Sun on the basis of the following image:       As we can see, the initial state of rock is rest. And when we apply a force, it starts moving in a circular path.   Now my question is from where the Earth had got the inertia of motion? As the rock in the above example was initially at rest and so the Earth should also be in state of rest (without any force applied on it).

The origin of spin is some what a puzzle to me, everything spin from galaxies to planets to weather to electrons.  Where has all the angular momentum come from? Why is it so natural?  I was also thinking do photons spin? we always think of the wave as a standard 2d sin wave but could this rotate in 3d? What implications would this have?   And what about spacetime how does all the spinning effect?  This has always been avoided in all lectures and classes I ever went to.


Say that $\Bbb N \times \Bbb N$ is the set of all pairs $(n_1, n_2)$ of natural numbers. Is it countable? My hypothesis is yes it is countable because sets are countable. But I am unable to come up with a proof. Is my hypothesis correct? How is it countable?

How can I prove that the Cartesian product of two countable sets is also countable?


How can I change all blocks in a specific area around me (where I am currently standing) to another block? I tried using the /setblock command, but it only works for a single block.  For example, if I wanted to replace all of the grass with mycelium in a range of +/- 140 blocks in the X or Z directions, covering the entire Y range, how would I do that?

I'd like to be able to select a region (either with a graphical utility or command line) and be able to switch one block type with another, e.g. change all cobblestone in the region to stone. Does a program/mod exist that can do this?


I upvoted an answer a while ago, but I realized it was not a good answer. The system does not allow me to take it away, but it allows me to upvote answers long after I have seen it. Shouldn't I be able to unupvote if I'm allowed to vote?

I've found many questions here regarding this 'feature' and many answers explaining how it works, but none showing any 'philosophical' concept behind it. i.e., why is it here? Is it helping to make site better?  For example, just now I made a downvote, retracted it to think a bit more, left a comment with explanation and tried to downvote again. No game. And this is not the only real-life situation when value of this 'feature' is doubtful. There're plenty on this meta.  So, what was the primary reason to introduce it? A flow of people who change all their votes on daily basis?


I'm looking for an opportunity to launch an application (eg, compilers) with specific environment variables . I want same functionality like env in Linux. env var=value application.exe  I found  but not satisfied with the decision. (because it has a lot of character in the writing which you can make a mistake )  Something changed from 2010 year ? I would be happy  not even with  builtin solutions.

In Bash, I can do EDITOR=vim command and command will be run with EDITOR set to vim, but this won't affect the value of EDITOR in the shell itself. Is it possible to do this in cmd.exe?


I know somebody asked what happened between Jack Crusher and Picard. I also read the answer which I already knew. There was an accident on the Stargazer, Picard had to choose between life or death, Picard is somehow responsible for making a choice that led to Jack Crusher's death. These sets of facts were laid out over many episodes.  Do we know the actual reason how and why Beverly Crusher's husband died? What was the away mission? What were the circumstances? What decision did Picard make?  Is there anything in the novels or anywhere else that describes the details of the away mission any more than what I've stated already?

In ST:TNG "Encounter at Farpoint", it's clear that Dr. Crusher knows Jean-Luc Picard, and this had something to do with the way her former husband died.   From the script:     RIKER: Jean-Luc? You know Captain Picard?   WESLEY: When I was little, he brought my father's body home to us.   ...     BEVERLY: Then you must object to me personally. Has it to do with our last meeting?   PICARD: I'm trying to be considerate of your feelings, Doctor Crusher. For you to serve with a commanding officer who would continually remind you of such a terrible personal tragedy... .    ...   BEVERLY: Captain. My feelings about my husband's death will have no effect on the way I serve you, this vessel, or this mission.   Is it known what exactly the circumstances were?


Last line of paragraph should end with a minimum of five characters of the word. Is it possible to obtain this with LaTeX ?

This question led to a new feature in a package:      One rule in French typography is that the last line of a paragraph should not be shorter than the double of the indentation of the next paragraph.  Is it possible to specify that, or least considering that all paragraphs are indented of the same value, to make sure the last line is longer than twice this value?  A LuaTeX-specific solution is welcome, too.


I need to get the users public key, that was used to authenticate the current ssh session.  Running env only shows:  SSH_CLIENT=192.168.1.2 35538 22 SSH_TTY=/dev/pts/0 SSH_CONNECTION=192.168.1.2 35538 192.168.1.3 22

Is there a way how you can check what auth method the user which just logged in to an account were using?  I like to print out a warning after login if someone is using a password instead of a keyfile.  Sure one solution is to check the ssh-logs. But is there a nicer way to do this? Since looking up logs could impact performance depending on the log size and method you use to gather this information.  We are using SUSE and Ubuntu.


Why do people comment when it's a spot-on answer? I often get useful comments like , but wonder why they don't post those as answers. If they post them as answers, I can boost their reps by upvoting and choose "solved" but I can't do that with comments. Is it for readability or something? I don't have to scroll much to see comments, and that's convenient, but are there other reasons why people do this?

Why do some people post comments that are actually answers to the question? Wouldn't posting an answer be better?


I would like to prevent my iPhone draining power from my MacBook Air while the laptop is not plugged in and relying on battery power. How would I do this? Note, there doesn't seem to be any "unpowered USB ports" on the MacBook Air, both of them seem to charge my iPhone even when the laptop is not plugged into a power socket...

I am developing iOS apps and I hate, that always when I connect my iPhone to my Mac to install and test an app, the iPhone gets charged. Is there any possibility to connect my iPhone to my Mac without charging the phone?    My Environment: -  iPhone 4S (No Jailbreak) -  MacBook Air3,2 (Late 2010)


I want maximum one citation name in my text. Therefore I used the option maxcitenames=1 in the biblatex package. This works for all my references except for two: verdonck2009 and verdonck2011. I am not sure whether this is because the author name is the same or because of some other reason. I have put a MWE example below together with my bibtex references. The result of the MWE example is added in the image at the bottom. As you can see it uses only one citation name, except for verdonck2009 and verdonck2011. Any ideas on how this can be solved?  \documentclass[a4paper,12pt,oneside]{book} \usepackage[backend=biber, natbib=true, style=authoryear, maxcitenames=1, maxbibnames=99]{biblatex} \addbibresource{bib/literature.bib}  \begin{document}  In \citet{verdonck2009}, \citet{verdonck2011}, \citet{kaas2008} and \citet{england2002} is stated that...  \printbibliography \end{document}  @article{verdonck2009, title={A robustification of the chain-ladder method}, author={Verdonck, T and Van Wouwe, M and Dhaene, J}, journal={North American Actuarial Journal}, volume={13}, number={2}, pages={280--298}, year={2009}, publisher={Taylor \& Francis} }  @article{england2002, title={Stochastic claims reserving in general insurance}, author={England, P  and Verrall, R}, journal={British Actuarial Journal}, volume={8}, number={03}, pages={443--518}, year={2002}, publisher={Cambridge Univ Press} }  @article{verdonck2011, title={The influence of individual claims on the chain-ladder estimates: Analysis and diagnostic tool}, author={Verdonck, T and Debruyne, M}, journal={Insurance: Mathematics and Economics}, volume={48}, number={1}, pages={85--98}, year={2011}, publisher={Elsevier} }  @book{kaas2008, title={Modern actuarial risk theory: using R}, author={Kaas, R and Goovaerts, M and Dhaene, J and Denuit, M}, volume={128}, year={2008}, publisher={Springer Science \& Business Media} }

In the header of my document I set the maximal author names to 2:  \usepackage[style=authoryear-icomp, maxbibnames=9, maxcitenames=2, backend=biber]{biblatex}   Now, when I cite texts with two authors, LaTeX gives me the following:     (Author_A/ Author_B 2012: 232)   When I have three authors or more, LaTeX makes it:     (Author_A/ Author_B et al. 2012: 232)   But I want LaTeX to just name the first author if there are more than two authors ... like this:     (Author_A et al. 2012: 232)   Any tips on how to achieve this ?


How do you check whether your device is in a wifi deadzone? Specifically, I have a 2007 Macbook.  Environments:   At home  At public places with wifi Hotel wifi setups

I often have trouble connecting to wifi with my MacBook Pro. To help identify the problem, I was wondering if there were any tools for measuring wireless signal strength.


I use the Linguex package for examples with glosses (word-for-word translations) and I want to add right-aligned comments to specify the language of my examples, but this doesn't work with glossed examples. I tried this:  \documentclass{article} \usepackage{linguex} \begin{document}  \exg. J'ai deux pommes.\hfill{French}\\       {I have} two apples.\ \end{document}   The \ \ is necessary when you add glosses and can't be omitted. I also tried using flushright and raggedright, but nothing seems to work.  Thanks in advance for any help!

I'm writing a linguistics paper that uses a large amount of linguistic examples from a wide variety of languages, using the gb4e package. I want to be able to label each example with information about the language it comes from, as I've seen in some texts, sort of like this:   Language (family, citation, etc.)      (1) example text          glosses        'translation'    gb4e is great at formatting the examples themselves, but I can't seem to get the label placed where I want it, that is, placed immediately before the example and without an indent. Here's some example code:  \documentclass{article} \usepackage{gb4e} \usepackage{lipsum}  \begin{document} \lipsum[2]  Hungarian (Finn-Ugric, \emph{reference})   \begin{exe}   \ex \gll    J\'anos h\'aza\\               John house.his\\       \glt    `John's house'   \end{exe}  \lipsum[3] \end{document}   If the label text is outside the exe environment, it's treated like a regular paragraph, but if I try to put it inside, it gives me an error. How can I make it look the way I want? I've looked at other packages that do numbered examples, but they don't seem to have solutions either, and they also don't have the same functionality as gb4e that I need.  Any help would be greatly appreciated.


Please could someone give me some advice.  My son has been playing on Minecraft in creative mode.  He has spent hours building a world and today built a portal to the Nether.  He is completely lost and cant find his portal. He seems to be underground.    My question is how can he get back to his much loved world?  Thanks for your help.

I am on creative and was exploring the Nether. I happened to travel very far without realizing it and could not find my way back. I decided to try and make another nether portal but that sent me to the middle of an ocean.  I can't kill myself and go to spawn because I am on creative if anyone can help that would be great.


I have a Moto E5 Play with Oreo 8.1(Android Go) and I can't enable notification icons badge, I mean those little dots over the application icons on home.  When I go to Configuration-> Apps Notifications there's no option to enable it.  If I go to application configuration is there an option to enable it individually but is grayed out.  I search on the web but nothing solve this.

I have a TECNO Spark 2 running on Android 8.1 Oreo (Go Edition). Every time I try to install apps that require notification access, it says that the feature is not available.  How to fix it?


I have a lists of lists, like this: indices = [[0, 1, 2], [0, 1], [0], [0, 1, 2], [0, 1]]  Now I want to loop over all of these indices, meaning that I want to go for the combinations [0, 0, 0, 0, 0], [0, 0, 0, 0, 1], [0, 0, 0, 1, 0], ..., in effect the same as for i in indices[0]:   for j in indices[1]:     for k in indices[2]:       ....  I know that this will lead to a combinatorical explosion pretty fast, but I know that everything I'll need this for is tractable. I am simply looking for a general way to write that, and I think one could build a (recursive?) generator for this, but I cannot wrap my head around how that must look like. If I knew all of the sub-lists had a fixed length, I would generate the product of the lens of the sublist and then get the binary/ternary/decimal/... representation of that number, however both the length of the sub-lists as well as the length of indices is variable.

How can I get the Cartesian product (every possible combination of values) from a group of lists?  Input:   somelists = [    [1, 2, 3],    ['a', 'b'],    [4, 5] ]   Desired output:  [(1, 'a', 4), (1, 'a', 5), (1, 'b', 4), (1, 'b', 5), (2, 'a', 4), (2, 'a', 5) ...]


On Terry Tao's blog I found the following problem:  I think I have a solution but I dont know how to write math on his blog so I posted my solution here.  Problem: Let $\{ a_n\}_{n\in \mathbb{N}}\subseteq \mathbb{R}$ be a bounded sequence. Suppose that the power series: $$f(x)=\overset{\infty}{\underset{n=0}{\sum}}\dfrac{a_n}{n!}x^n.$$ (which has an infinite radius of convergence) decays like $O(e^{-x})$ as $x\to\infty$ ($\underset{x\to \infty}{\lim}\dfrac{f(x)}{e^{-x}}=C$). Must the sequence ${a_n}$ be of the form ${a_n = C (-1)^n}$ for some constant ${C}$?

Suppose that   $$f(x)=1+\sum_{n=1}^\infty a_n \frac{x^n}{n!}\ \ \forall \ x\in \mathbb{R}$$   where $\sup_{x>0}\left|e^xf(x)\right| < \infty$ and $\sup_{n\in\mathbb{N}} |a_n|< \infty$.      Prove that $a_n = (-1)^n$ , $\forall n\in \mathbb{N}$   It seems amazing to me. What we need to prove is $f(x)=e^{-x}$. It seems insufficient to prove this strong conclusion, but actually it is true and all the "counterexamples" I found were wrong.  My attempt  Put $g(x)=e^x f(x)$. $$\left|g^{(n)}(0)\right|=\left|\sum_{k=0}^n \binom{n}{k} f^{(k)}(0)\right|\le 2^n\sup_{n\in\mathbb{N}} |a_n|  $$ Put $h(x)=g(\frac{x}{2})$. Thus  $$h^{(n)}(0)=\frac{1}{2^n}g(0) \le \sup_{n\in\mathbb{N}} |a_n|$$ which implies that $$h(x)=1+\sum_{n=1}^\infty b_n \frac{x^n}{n!}\ \ \forall \ x\in \mathbb{R}$$ where $$|b_n|\le \sup_{n\in\mathbb{N}} |a_n| \ \ \forall \ n\in\mathbb{N}  \,\,\,\,\,\& \,\,\,\,\,  \sup_{x>0}\left|h(x)\right| < \infty $$   And hence if $b_k<0$, then there exists $l>k$ such that $b_l>0$. I want to yield a contradiction by supposing this, but I failed.  Any hints or other new ideas? Thanks in advance!   (I heard that this problem can be solved by complex analysis. This is the reason why I attach the complex-analysis tag.)


I just came across a question where a user posted two answers, one of which was accepted. Now, I'm not saying there's anything wrong — the answers are far and above outstanding; see them for yourself!    As of this writing, the unaccepted answer doesn't yet qualify for Populist, as it has less than 2 times the score of the accepted answer. However, considering that both answers were posted by the same user, I'm wondering: when the unaccepted answer does eventually reach double the score of the accepted answer, should the user earn a Populist badge?  Or has there been a case where a user did or did not earn Populist over his own accepted answer?  Note that I'm not so much concerned about badge gaming as simply curious if it makes sense to be a populist over yourself... whatever that means.

I saw a 1 character  and wondered why; apparently it was after my (less-comprehensive) answer was accepted, to allow the check-mark to be transferred to the higher voted answer (written by the asker) after giving himself a Populist badge.  I think that self-answers should be ineligible for the Populist badge.


I would like to have the following gnuplot graph (that's just an exemple), which is using embedded data instead of an external file:  $data << EOD 1 5 2 10 3 1 EOD ; plot $data using ($1):($2) with lines;   I tried the following simple approach, which obviously is not working as intended: the generated gnuplot code is missing the line breaks, which are necessary for a correct processing by gnuplot:  \begin{tikzpicture}   \begin{axis}     \addplot gnuplot [raw gnuplot]{     $data << EOD      1 5      2 10      3 1 EOD ;     plot $data using ($1):($2) with lines;    };   \end{axis} \end{tikzpicture}   Is it possible to feed gnuplot raw input (preserving line break) to \addplot ?

I want to do a simple graph, where its points will be assigned by a list (NOT a file) of coordinates.  So, I know, that I can do something like this:  \addplot gnuplot [raw gnuplot, color=blue]{plot "test.dat" };   But I need to use it like this:  \addplot gnuplot [raw gnuplot, color=blue]{plot { (0,0)(1,5)(10,12) } };   It looks pretty easy, but I'm somehow not able to find a single mention of using Pgfplots with gnuplot like this.  So, is it even possible to use it like that? And if it is, then how?


what effect will the number of PCs do if we increase it on PCA? Thank you.

Say that the raw data is $N$-dimensional, where $N$ is a large positive integer. If we apply PCA to the dataset, and compute the reconstruction error (in $\ell^2$-norm) using the first $d \leq N$ components, will the reconstruction error monotonically decrease to $0$ as $d \rightarrow N$?


R2D2, C3PO, BB8 and so on. Is there an explanation in-universe and out of universe for this naming protocol?

I was noticing that the two famous droids from Star Wars, C-3PO and R2-D2 have a four character alphanumeric name.  Now, these are just two of so many droids out there, but I was wondering, in the Star Wars universe - do all droids have a four character alphanumeric name? If not, does the length or having an alphanumeric name as opposed to purely digits or characters have any significance?