Show that $$  \overline \lim\limits_{n \rightarrow \infty}\left(\frac{1+a_{n+1}}{a_{n}}\right)^{n} \geq \mathrm{e}  $$ For any sequence $\{a_n\}$ with positive terms, and that this estimate cannot be improved.  I found this problem in "Mathematical Analysis I" of Zorich, just Google Books and turn to page 149 of the preview. I believe this problem is somehow incorrectly stated (since I can't solve it :) ) , so I asked for sure.   Thanks.

Why is the following inequality from Chapter 1 of Littlewood's  true?      Suppose $a_n>0$ for all $n$. Then $$\limsup_{n\to\infty}\left(\frac{1+a_{n+1}}{a_n}\right)^n\geq e.$$


My first name is Lluis but always Ubuntu changes my name as Llus when my computer starts as Ubuntu. I don't understand why this 'i' is missed.

Some time ago, when I installed Ubuntu, I chose a rather stupid username for my account that I do not want to use anymore. How do I change this (including the name of my home directory, and the name in the terminal) without losing settings for applications? How do I keep permissions and my keys for various authentification (e.g. email, SSH, GPG and more)? What settings could possibly get lost if I changed my username?


I play small role playing activities and games with some friends of mine, and one of them always has highly destructive and somewhat unpredictable characters. He will consistently attempt to kill other PCs, interesting people he comes across, or entire ecosystems if he gets the power, and will sometimes just do really random stuff like trying to cast spells to make people look like Eragon. This comes across a lot more childish in writing than it does in person. He's quite aware of what he does and sometimes makes more intelligent decisions when prompted to. Right now I have to keep preventing him from killing everything, which isn't very fun for him (although he enjoys the attempt), and the other players get a bit tired of his constant violence and strangeness (although mostly they laugh at the absurdity of his ideas and the nature of his failures).  So, how could I put this behavior to good use? I've had a few ideas, but they tend to center around him being a villain, which will inevitably end up in being defeated all the time, which is too much like the problem I have now. I would like to let him be destructive, and somehow use that for the benefit of the other players on adventure or leading kingdoms or whatever.  To answer some comments: He's not actually being very detrimental to the game play. He tries to kill some random guy, other people react to him accordingly, and the story moves on. He takes it surprisingly well and seems to mostly have fun in the attempt at violence or weirdness, although he also likes to succeed sometimes. We've never run into "my guy" syndrome because... well, everyone already knows that's what his guy would do, including him. Fortunately his plans aren't well thought out and usually when they succeed it's more by chance than design. I'm seeking ideas for how I could use this to benefit game play.  We don't use any systems but my own little designs, which are usually simple. Our stories go everywhere from building worlds to figuring out what happened in an abandoned near-future city. I do plan to start using official systems soon, and at that point it will become crucial to know what to do with this player.

I GM a Dresden Files campaign, and I have a first time role-player that has become a problem in terms of advancement of the story.  At first I chalked it up to inexperience, but its become more and more pronounced, to the point that tonight he took up half of the time with an inconsequential inter-party conflict, then after he was rendered unconscious, left.  The players and I are becoming more frustrated with his antics as we have a very short time weekly to play, and much of that time is taken up by this player.  I've tried to talk to him both in-game and out-of-game (and other players have also) and though he appears to be understanding and receptive of the talks, it continues to be a problem, and in many cases, his retort is that this is important to his character, so we continue to work through this week after week, and I have to end the session in exposition rather than a gradual discovery/uncovering so that we can make progress.  I'm attempting not to exclude him from the game, but short of that is there something that as a game master I can do to enforce direction and advancement of plot?  NOTE: I was trying to make the question a bit generic, but to give a bit more insight about one of the situations: he was using the sight to assess the scene, and after he was finished with his assessment, he attempted to look at each of the players in turn.  As they'd seen him use the sight before, he was able to get a good look at one of the characters before they figured out what he was doing, and one of the other players took exception to the intrusion on their privacy IC.    The situation escalated and became physical.  In other cases where there's been inter-party conflict, they've played the combat a bit, then the person on the losing end concedes and they tell the story from that perspective.  But he wouldn't concede.  The other players used this as a cover as it happened to be a distraction, but as he's the only full wizard, when the combat started, they were a bit hobbled by the loss of their spell power going against a wizard.  So it's not enforcement of a particular plot.  If he was going in a different direction with the plot, I've done that before with this group, even to the point of improvising scenes when they do stuff I haven't planned.  It's the movement with any plot.


I get these errors and I can't understand why:  Source.cpp #include <iostream> #include "priority.h"  int main() {     PriorityQueue test(std::vector<int> {1, 2, 3}); }  priority.h #pragma once #include <vector>  template <typename T> struct PriorityQueue {     std::vector<T> heapMin;      PriorityQueue();     PriorityQueue(std::vector<T>);     void minHeapfy(int);     /*void insertElement();     T priorityMax();     T priorityExtractMax();*/ };  priority.cpp #include "priority.h" #include <algorithm>  template<typename T> PriorityQueue<T>::PriorityQueue() { }  template<typename T> PriorityQueue<T>::PriorityQueue(std::vector<T> initializare) : heapMin(initializare) { }  template <typename T> void PriorityQueue<T>::minHeapfy(int pozitie) {     int st = pozitie * 2 + 1, dr = pozitie * 2 + 2;     int imin = pozitie;     if (st < heapMin.size() && heapMin.at(st) < heapMin.at(imin))     {         imin = pozitie;     }     if (dr < heapMin.size() && heapMin.at(dr) < heapMin.at(imin))     {         imin = pozitie;     }     if (imin != pozitie)     {         swap(heapMin.at(pozitie), heapMin.at(imin));         minHeapfy(imin);     } }  I thought that there might be wrong with the initializing list, and I deleted it, but I still get the error. Why is that? This is my first time using templates, so if I'm doing something wrong with them, please guide me. Thanks:)

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


Code open-ended, opinionated, code discussions are discouraged on the regular SO.  Is there a SO community for that?

Stuff like polls, recommendations based on subjective constraints, puzzles, webcomics etc. do not belong on the serious main SE sites, where professionals should be considered at work and having just a few spare minutes ("code's compiling") to answer questions, so they should not be distracted by such things. However, I'd also like to have a home for these things still using the SE engine. For the reason I mentioned before, this needs to be a separate place though. Let's call it four.[sitename-here].com.


I need to solve the congruence of $ x^{5}\equiv 13 \pmod{18}$ and find whether it is solvable.  Actually I can solve $x^{k}\equiv \pmod{q}$ when $q$ is odd. But now it is composite, and I do not know how to apply the theorem. Can you help me?

I'm trying to prove a fact about $k$th roots that says that if $(k, \phi(m)) = 1$ and $(b,m) = 1$, then there is a unique $k$th root modulo $m$ (composite $m$).   I'm not sure how to go about it but here's an attempt;  Suppose towards a contradiction that there are two solutions $x_1 = b^r$ and $x_2 = b^s$ to the congruence $x^k \equiv b \bmod m$. Then $$x_1^k \equiv x_2^k \equiv b \bmod m$$  so that $b^{kr} \equiv b^{ks} \equiv b \bmod m$, or equivalently, $b^{kr - 1} \equiv b^{ks - 1} \bmod m$. We can then conclude that $m \mid b^{kr - 1} - b^{ks - 1}$. Now we can factor to obtain $b^{kr - 1} - b^{ks - 1} = b^{kr - 1}(b^{k(s-r)} - 1)$ to conclude that $m \mid b^{kr - 1}(b^{k(s-r)} - 1)$. But since $(b, m) = 1$, we must have $m\mid b^{k(s-r)} - 1$, or equivalently,   $$b^{k(s-r)} \equiv 1 \bmod m$$  which would imply $k(s-r) = \phi(m)v$ for some $v \in \mathbb Z$.  I feel like there could be a way to extract a contradiction from this last step but I can't see it, would somebody be able to check if this is a good way to go?


How can I prove the following equation?  $$   \lfloor nx \rfloor =   \lfloor x \rfloor +    \Big\lfloor x + \frac{1}{n} \Big\rfloor +    \Big\lfloor x + \frac{2}{n} \Big\rfloor +    \Big\lfloor x + \frac{3}{n} \Big\rfloor +    \Big\lfloor x + \frac{4}{n} \Big\rfloor +    \Big\lfloor x + \frac{5}{n} \Big\rfloor+ \dotsb +    \Big\lfloor x + \frac{n-1}{n} \Big\rfloor $$  $n∈N$ and $x∈R$

I'm doing some exercises on Apostol's calculus, on the floor function. Now, he doesn't give an explicit definition of $[x]$, so I'm going with this one:     DEFINITION Given  $x\in \Bbb R$, the integer part of $x$ is the unique $z\in \Bbb Z$ such that $$z\leq x < z+1$$ and we denote it by $[x]$.   Now he asks to prove some basic things about it, such as: if $n\in \Bbb Z$, then $[x+n]=[x]+n$  So I proved it like this: Let $z=[x+n]$ and $z'=[x]$. Then we have that  $$z\leq x+n<z+1$$  $$z'\leq x<z'+1$$  Then $$z'+n\leq x+n<z'+n+1$$  But since $z'$ is an integer, so is $z'+n$. Since $z$ is unique, it must be that $z'+n=z$.  However, this doesn't seem to get me anywhere to prove that  $$\left[ {2x} \right] = \left[ x \right] + \left[ {x + \frac{1}{2}} \right]$$  in and in general that   $$\left[ {nx} \right] = \sum\limits_{k = 0}^{n - 1} {\left[ {x + \frac{k}{n}} \right]} $$  Obviously one could do an informal proof thinking about "the carries", but that's not the idea, let alone how tedious it would be. Maybe there is some easier or clearer characterization of $[x]$ in terms of $x$ to work this out.  Another property is $$[-x]=\begin{cases}-[x]\text{ ; if }x\in \Bbb Z \cr-[x]-1 \text{ ; otherwise}\end{cases}$$  I argue: if $x\in\Bbb Z$, it is clear $[x]=x$. Then $-[x]=-x$, and $-[x]\in \Bbb Z$ so $[-[x]]=-[x]=[-x]$. For the other, I guess one could say:  $$n \leqslant x < n + 1 \Rightarrow  - n - 1 < x \leqslant -n$$  and since $x$ is not an integer, this should be the same as $$ - n - 1 \leqslant -x < -n$$  $$ - n - 1 \leqslant -x < (-n-1)+1$$  So $[-x]=-[x]-1$


If I know coordinates of point $A$, coordinates of circle center $B$ and $r$ is the radius of the circle, is it possible to calculate the angle of the lines that are passing through point A that are also tangent to the circle?    $A$ is the green point, $B$ is the center of the red circle and I am trying to find out the angle of the blue lines.

If I know coordinates of point $A$, coordinates of circle center $B$ and r as the radius of the circle, is it possible to calculate lines that are passing through point $A$ that are also tangent to the circle?    A is the green point, B is the center of the red circle and I am trying to find out the blue lines.


One of the developers at Stack Overflow, Nick Craver, , pending for the resolution of    Now that this bug is solved, so I wonder whether Stack Overflow has already upgraded to .Net 4.6? Or SO is still holding on the upgrade, pending for more testing on RyuJIT in x64 environment?

What tools and technologies are used to build the Stack Exchange Network?  See also:


There's this bilinear form $f$ such that $\forall x, y \in V \ \ f(x, y) = 0 \implies f(y, x) = 0$. What I need to prove is that this form is symmetric or skew-symmetric.  I don't understand how to approach this. I've tried adding something like $f(x - x, y)$ (which equals to $0$) and such to $f(x, y)$, and then applying the property above to the result, but didn't get anything. I've also tried looking at $f(x, y) - f(y, x)$ and something like $f(x + y - y, y)$, hoping I'd get some revelation if I try to transform these expressions in various ways, but to no avail.

Let $b$ be a bilinear form on a finite-dimension vector space $V$ (over a field with char $\neq$ 2) such that for each $x,y\in V$ one has $b(x,y)=0\Leftrightarrow b(y,x)=0$. Prove that $b$ is symmetric or skew-symmetric.  The condition is equal to this: for every vector $x$ co-vectors $b(\cdot,x)$ and $b(x,\cdot)$ have the same kernels, so for some non-zero  constant $c:b(\cdot,x)=cb(x,\cdot)$. But I didn't manage to prove that $c$ is equal to $1$ or $-1$ for every $x$.


I have created a batch file that changes the proxy settings based on the wireless SSID connection. I have set it to the Task scheduler, so that whenever I am logged in at the office, the proxy settings will kick in. Here is my batch file.   Set SSID=%VAR1% %VAR2% echo ------------------------------------- Echo Current Wireless Network: "%SSID%" echo ------------------------------------- echo .  If "%SSID%" == "NameOfSSID" (     ECHO ------------     echo Enable Proxy     ECHO ------------     SETX /M HTTP_PROXY "proxy.company.com:80"     SETX /M HTTPS_PROXY "proxy.company.com:80"     SETX /M NO_PROXY "127.0.0.1,localhost" ) ELSE (     SETX /M HTTP_PROXY ""     SETX /M HTTPS_PROXY ""     SETX /M NO_PROXY "127.0.0.1,localhost" )   The batch file kicks in when I login and runs. But when I try to browse, I have to manually enable it in the Internet connection settings as shown below. (shortcut to this settings is proxycfg in windows start).     I understand that there are many questions (and answers) on SuperUser. I just can't find the solution for this issue. Please help.

How do I change proxy settings from command line in Windows 7?  I'm not talking about just the http_proxy. I need to set system-wide proxy settings (the ones in Internet properties setting). How do I do that?


I'm attempting to use a class inside a struct, which seems to be no problem if I declare the class first:  class Foo { } stuct Bar {     Foo example[5];    // array of Foos }   This seems fragile. It should work in whatever order like functions use prototypes for. I tried prototyping them, but this doesn't work.  class Foo; struct Bar;  stuct Bar {     Foo example[5]; } class Foo { }   Why doesn't this work?  Error code C2079 (on visual studio): 'Bar::Foo' uses undefined class 'Foo'. Error code C2148: total size of array must not exceed 0x7fffffff bytes. Both on the errors occur on Foo example[5];  Also, would it be appropriate to keep my function prototypes above the ADTs (abstract data types) so I can use the functions inside them, or should I write the function inside the ADT?

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. ?


I have a site which shows an infinite feed of post previews (with the option to read full text using javascript). The page allows users to click through to the full-text of any post, and change the order in which posts are sorted. There are a few SEO considerations I have questions about. See the attached image for HTML architectural reference.    The "trending" sort option excludes posts with fewer than 140 characters, meaning not ALL content is guaranteed to appear on the homepage (which uses "trending" as it's default sorting option). However, I want the homepage to be the highest priority page, so adding rel=canonical to from "trending" to "newest" isn't too appealing. What's the best way to deal with this? Javascript loading of full-text without changing pages just uses a hidden  element to store the text until the user requests it by clicking "continue reading." Does this present a potential duplicate content issue? Individual post pages contain the full-text of content that can be shown on the homepage from time to time. Does this present yet another duplicate content issue? Infinite scrolling uses a "startIndex" parameter for pagination to allow for load more functionality. As the content fluctuates from day to day, Google's indexed content for loadmore URLs becomes outdated. Is there anything I can/should do to accommodate?

I am creating a new website for a client, and I think a single page website / layout will be pretty neat. There is not that much detailed content, it is a company that imports a lot of products from different companies. So it will be a bit of a showcase of the different types of products / equipment you can order. Of the whole catalog only maybe 10 products are actually shown.  Now I have the basic structure with sections and links like:      #home / #products / #equipment / #services / #contact.    Now from what I understand is that Google does not index links containing #, so there will be no problem of duplicate content, everything will be indexed as the frontpage.  Now what I want to optimize is searching. This company is agent of some product in the country, meaning only they have the permission to import and sell that product. This means  that when somebody searches for product x, this website pops up as the first hit.  Now can I make it that they will be automatically brought to the #products part of the website directly from google.  I was thinking of something like having google index the different sections as different pages. Is something like that possible?


I have different users on the machine who use different keyboard layouts.  In 11.04, you could change the keyboard layout on the login screen (and it would remember it per user).  How can I do this in 11.10?  Or is it not possible?

I have a netbook with an AZERTY layout. I've changed it to "bépo" to try it, but now I've reset it to a french layout.  While all the apps have taken the change into account, Ubuntu's login manager still uses bépo, making entering passwords a challenge. I've enabled the virtual keyboard for the time being so that I could login again.  I don't remember what I had done in the first place to switch the login screen to bépo, but now I can't switch it back.    EDIT : In the keyboard settings page, if I click "use system defaults", then everything is in bépo ! Where is this different keyboard layout set ?  ANOTHER EDIT : Here's what did not work :   Changing the layout in settings using the "use system defaults" checkbox in settings sudo dpkg-reconfigure keyboard-configuration changing it in Xconf adding a line in /etc/lightdm/lightdm.conf  sudo dpkg-reconfigure locales slaming head against desk dpkg-reconfigure lightdm sudo gsettings set org.gnome.libgnomekbd.keyboard layouts "['fr']" combinations of the above     Is it possible to relaunch the keyboard configuration tool that's in ubuntu's setup ? The thing has automatic layout detection and it changes the setting everywhere.


Find $$\int^u_0\frac{dx}{x^2+3x+2}$$  I'm having trouble making progress on this.  Specifically, I know the following means to find an integral:  Antiderivative Integration by parts Change of variable Definition of integral (either Darboux or Riemann).  None of these have been helpful to me:  $\frac{1}{x^2 + 3x + 2}$ is not the derivative of anything I can construct.  The closest is $\frac{2x + 3}{x^2 + 3x + 2} = [\log (x^2 + 3x + 2)]'$.  This might be useful in combination with another method, so let's keep on looking. I've tried various combinations, such as $u = \frac{1}{x^2 + 3x + 2}, v= x^2 + 3x$ or $u = \log(x^2 + 3x + 2), v = \frac{1}{2x+3}$.  Again, none have gotten me further. $f(x) = 1/x, u(x) = x^2 + 3x +2, u'(x) = 2x$.  The problem is I can't get the $u'(x)$ factor to appear. I've made no progress with the definitions.  In fact, I've only seen definitions used to prove general theorems, never to compute a specific integral.  Can you point me in the right direction? Please do not post the full solution; just let me know how I need to tackle this.

Could someone take me through the steps of decomposing  $$\frac{2x^2+11x}{x^2+11x+30}$$ into partial fractions?   More generally, how does one use partial fractions to compute integrals $$\int\frac{P(x)}{Q(x)}\,dx$$ of rational functions ($P(x)$ and $Q(x)$ are polynomials) ?    This question is asked in an effort to cut down on duplicates. See .  Also see .


I want to clone an object that has more objects inside of it, without accidentally modifying the first object. To try to explain this more easily, I will try an example with an object that has only one property first obj1 = {test : "hey"} obj2 = obj1 obj2.test = "hi"  This will modify the first obj too, which is something that I don't want. After searching a bit I realized I have to do this instead: obj1 = {test : "hey"} obj2 = Object.Assign({},obj1) obj2.test = "hi"  Now obj1 seems to be unmodified. Yay! But here is my problem, I have an object that has nested objects as properties. Imagine that it looks like this: obj1 = {test : {moretest : "hey"}} obj2 = Object.Assign({},obj1) obj2.test.moretest = "hi"  This creates the problem that if I Object.Assign the initial obj1 to obj2, the nested objects will still be passed by reference (so if I change obj2.test.moretest, then obj1.test.moretest will also change, even though I used Object.Assign!) How can I clone an object by value along with all the nested objects inside of it?

I have an object x. I'd like to copy it as object y, such that changes to y do not modify x. I realized that copying objects derived from built-in JavaScript objects will result in extra, unwanted properties. This isn't a problem, since I'm copying one of my own literal-constructed objects.  How do I correctly clone a JavaScript object?


If $f:\overline D\to\mathbb{C}$, where $D=\{z:|z|<1\}$, is continuous on $\overline D$ and holomorphic on $D$ is it true that $f$ extends to a holomorphic function on $\overline D$?   Since $f$ is continuous on $\overline D$ then it has no poles, so it intuitively should extend to a holomorphic function on closed disc, but I don't know how to prove it.

Suppose one has a function $f$ in the disc algebra ie: $f$ is continuous on $|z|\leq1$ and holomorphic in $|z|<1$. I wondered, can $f$ always be extended to a holomorphic function on some region containing the boundary (ie: $T$ the unit circle). If not can you give me an example? Thank you,


Dear fellow stackoverflowers,  Is there some kind of guarantee that coercing a float type to a "wider" one, always yields the same result as performing the according static_cast?  Here an example:  float f = <any float>; double a = f; double b = static_cast<double>(f);  // does this always hold? EXPECT_TRUE(a==b);   Thank you for the information.

I've been writing C and C++ code for almost twenty years, but there's one aspect of these languages that I've never really understood. I've obviously used regular casts i.e.  MyClass *m = (MyClass *)ptr;   all over the place, but there seem to be two other types of casts, and I don't know the difference. What's the difference between the following lines of code?  MyClass *m = (MyClass *)ptr; MyClass *m = static_cast<MyClass *>(ptr); MyClass *m = dynamic_cast<MyClass *>(ptr);


What is an example of a map $T$ from a complex vector space $C$ to itself such that $T(v+w)=T(v)+T(w)$. but $T$ is not linear.

Let $V$ and $W$ be vector spaces over field $F$.  A function $f: V \rightarrow W$ is said to be linear if for any two vectors $x$ and $y$ in $V$ and any scalar $\alpha\in F$, the following two conditions are satisfied:   $f(x + y) = f(x) + f(y)$ $f(\alpha x) = \alpha f(x)$   Let $F$ be a field of real numbers. Is it possible to construct $f$ such that the first condition is satified but not the second one?


I'm currently starting to play around in the Terminal (MacOS), and learning to get the most out of it. I knew Homebrew was a very populair alternative package-manager on MacOS, so I decided to look into it.   I get the software installed, and everything is fine, and I can use it. But there is generally two things that I have a hard time figuring out.   Generally I can't wrap my head around where package-managers get their packages from? As an example if I were to download firefox on via APT or HB, where do their get the packages from?  apt-get install firefox brew cask install firefox   When I go to Mozillas webpage and download Firefox I know they simply have the file on one of their servers, but is that also the case with the above? And in which case, is it the original developers server or maybe github as it seems to be with HB?  Also, when I download a file from the website, I generally know that Mozilla is a company with a good rep, and their files are safe. But how can I make sure the files I get via APT or HB is safe as well?  PS. I understand that it has something to do with the SHA keys that will have to match.

Okay, I understand how I may use apt-get {install|upgrade|remove} mypackages to install, upgrade, or remove binaries as well as their configuration data files and dependencies (actually, remove will only remove the binaries unless additional flags are provided).  I am not looking for how it is used as the man describes this, but high level what it is doing.  My end goal is to create a means for me to install and manage some custom software (created by a make file) on multiple remote machines, and I need to learn more about the process.  If answers to this question are based on which distribution is used, please tailor to Debian.  In addition to generally how it works, I have the following specific questions:   How does the client that is accessing the apt repository keep track of the files? Must the repository be hosted on the same operating system (i.e. can apt repository be hosted on redhat)? How are the locations to install files specified?  Is this specified by the .deb file? How is a remote machine accessing the repository?  Is it just ftp(s) or http(s)? Is the machine that is hosting the repository running special software (like gitlab for a git repository), or is it just some structured file system?


I recently migrated from fedora 10 to Ubuntu 14.04 and believe me it was a real challenge :)  I almost managed to work anything out but only one problem is remaining. in fedora 10 i used to create .sh file containing commands to be executed in terminal and easily run those by double clicking on .sh file.  here is the method i was using in fedora: 1- creating a file with gedit 2-typing the command in it 3- chmod u+rwx example.sh  I followed the same method in Ubuntu but it does not work. however the shell file works perfectly when I type sh example.sh . also I read somewhere to go and allow the file to be executable and choose terminal as a default program for shell script file type, but there is no terminal in that list.

Before I add more detail to my question, I have to say something very important: Yes, my script has "Allow executing file as program" turned on. The question itself: For programming reasons (shared libraries), I can't execute my program just from the executable, because I need to access LD_LIBRARY_PATH before executing the program. I created this script to do this (baring in mind this is my first time ever writing a script): #!/bin/bash #Get the current directory and append the SO's location currentDir=$(pwd)'/libs/'  #Change the library path export LD_LIBRARY_PATH=$currentDir  #Run the program ./program  After running this from the terminal I thought that it has worked, there were no errors and the program didn't complain about shared libraries. But unfortunately, if I try to double-click the .sh file from Nautilus, nothing happens. The worst part as well, is that since I'm running it from the GUI, I have no idea what error it is getting. I'm running Ubuntu 14.04 and the executable is a C++ program using the SFML libraries (Yes I could just have the dependencies, but SFML isn't commonly installed on Linux computers, and this is besides the point).


In asked question I have attached image which is some separator line on globe.  I  googled/stackoveflowed but did not find answer for following questions (for kid's home work).   What is the name of that line? What is the significance of that line? Why line shaped like hook? History behind it if any, any special consideration for shape of line.

I was watching Google map. Saw a line which is joinging north to south pole. It is going between middle of China and Mexico. But, the line is not straight. Tried to search in net but not able to get anything. Can anyone check and let me know  or


Intro I am somewhat new to cryptography. Repeating the basics of RSA from :  Textbooks say the one-way function is merely two primes (with some critical constraints) ...  may be a good base of this question, as well as . Also,  already asks the same thing as the question here, but in a more abstract way. The idea Why not calculating in advance, on many computers, a vast amount of multiplications of primes that you loop over systematically, in the constraints of RSA? And then you would save the outcome as keys in a Big Data system that you can quickly search through? You could use a Bloom filter, a key coordinator or other Big Data tricks to quickly find the computers that might have the multiplied value at hand, and then quickly find a value's underlying primes. You could have 10000 computers, with chosen different starting prime ranges. The first and second primes could be within a likely range that is needed to meet RSA standards of 4096 bit. You may also guess a bit, meaning to take a range that is rather around the square root of a chosen outcome, or take other tricks to guess a bit. Then it just depends on how many computers you use. Even if you hit just 0.001 % of the possible combinations you could already get the private key from the public key in 0.001 % of the cases. Or do I oversee something here. The question It cannot be that easy, can it? Can Big Data attack RSA by just calculating many prime multiplications in advance?

Would it be possible to break an RSA key, in for example 1 week of time, if the cracker have already spent X number of years building an index of primes by performing every permutation of existing prime keys up to $2^{2048}$?  I understand this would take an immense amount of time to do, but it would only be done once. Obviously, computing such an index would take a considerable amount of time and would have to be done with someone having the right amount of resource. Given the public key, you would be able to look up what the two primes are, and hence retrieve the private key instantly.  Breaking an 256 AES would then be easier, as AES keys are often generated using the RSA private key.  Would it be possible to build such an index? How long would that take in permutations and perhaps with the fastest computer in the world?


I'm trying to get text from server and then check it a to know what actions to take with the text adopted. The problem is that when I try to check if the received text for example is "Exited" the query always return the value "false" when the received text is really "Exited".  Here is the code :  class Get_Message_From_Server implements Runnable    {     public void run()      {           InputStream iStream = null;       try        {         iStream = Duplex_Socket_Acceptor.getInputStream();        }       catch (IOException e)        {         // TODO Auto-generated catch block         e.printStackTrace();        }       //Create byte array of size image       byte[] Reading_Buffer = null;        try        {           Reading_Buffer = new byte [Duplex_Socket_Acceptor.getReceiveBufferSize()];       //New_Buffer = new byte [100];        }       catch (IOException e1)        {         // TODO Auto-generated catch block         e1.printStackTrace();        }        byte[] Byte_Char_1 = new byte[1];        int Byte_String_Lenght = 0;        //read size       try        {         iStream.read(Reading_Buffer);          String Reading_Buffer_Stream_Lenghtor = new String(Reading_Buffer);          //System.out.println("full : " + Reading_Buffer_Stream_Lenghtor);          Byte_String_Lenght = Reading_Buffer_Stream_Lenghtor.indexOf(new String(Byte_Char_1));        }       catch (IOException e)        {         // TODO Auto-generated catch block         e.printStackTrace();        }       //Convert to String       Meassage = new String(Reading_Buffer);        Meassage = Meassage.substring(0, Byte_String_Lenght);//The text that received        Message_Getted = 1;     }   }   The query :  if(Message_1 != "Exited")//the message query   {    System.out.println("Continued 253");    continue;   }   Its always return the value - false   its important to know that the message is in Utf - 8 encoding   so how i can to fix the issue ?

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I am working with python3.4 on windows 7.Using py2exe for making executable file. In my python script i am opening multiple folders and reading files from them.The setup.py used is as follows,  from distutils.core import setup import py2exe, sys, os ,difflib  sys.argv.append('py2exe')  setup(      windows=['script.py'],       name="XYZ",       options = {'py2exe': {         "optimize": 2,         "bundle_files": 1,         "compressed": True          }}, )   The directory which holds the setup file and python script also have folders containing data files. so how can i possibly include the folders within this setup file.

I thought I heard that  was able to do this, but I never figured it out.  Has anyone successfully done this?  Can I see your setup.py file, and what command line options you used?  Basically I'm thinking of it giving me a single executable file that does something like unzips itself to maybe /temp and runs.


In C, I find that the following produces different results although in my mind they should do the same thing:  Say I have the function int main (int argc, char* args[]) and I want to switch on the value of the second character of the first argument.  This works as expected:   args[1]++;  switch (*args[1])  { //...   But this doesn't (always falls back to default:)  switch (*(args[1]++)) {  //...   Could a 'C' master explain what's going on?

In C, what is the difference between using ++i and i++, and which should be used in the incrementation block of a for loop?


I have recently made a 2d game in java and need help with making a network protocol that works. I am currently using DataOutputStream and DataInputStream with Sockets and ServerSocket. The Joining is working but the communication between the client and the server is not working. The way I want to have it work and the way i have it set up is so the server does the running and updating and the client receives the position info and data and renders the game and sends back control inputs for the player on the server.   Process:   server: starts client: starts and sends username to the server  server: replies with a UID witch is used to identify the        client and is assigned to the player that is the client  client: sends inputs to server and server receives them        updates the player and sends the data and position info        to the client client: reconstructs the data to a player and renders it (repeat last 2 steps)   This is what I have currently for the reading and writing functions    What I am looking for is suggestions of things I could do or Ideas to try. Thanks

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?


Hello All I'm writing some code and keep getting a Null Pointer Exception and for some reason I'm just hitting a mental wall.   Now I do know that null pointer is when the value its trying to use is null, but I can't seem to figure out how to fix the problem. (Errored Line is *'d out.)     public static void getMenuChoice(Dog s) {       int LCV = 0;      Scanner in = null; // create a scanner object   do {      System.out.println("Welcome to the Input Menu");      System.out.println("1: Assign the name");      System.out.println("2: Assign the owner");      System.out.println("3: Assign the age");      System.out.println("4: Assign the weight");      System.out.println("5: Assign the breed");      System.out.println("6: Assign the time");      System.out.println("7: Display Dog Information");      System.out.println("8: Quit");      System.out.print("Choose a Menu Option => ");        ****************int input = in.nextInt();*********************       switch (input) {         case 1:            System.out.println("Please Enter the Dogs name");            s.setDogName(in.next());            break;         case 2:            System.out.println("Please Enter the Owners name");            s.setOwnerName(in.next());            break;         case 3:            System.out.println("Please Enter the Dogs age");            s.setDogAge(in.nextDouble());            break;         case 4:            System.out.println("Please Enter the Dogs weight");            s.setWeight(in.nextDouble());            break;         case 5:            System.out.println("Please Enter the Dogs breed");            s.setDogName(in.next());            break;         case 6:            System.out.println("Please Enter the Time");            s.setTime(in.nextDouble());            break;         case 7:            System.out.println(s);            break;         case 8:            LCV = 8;            break;      }   } while (LCV != 8);   }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


Right now with the Wine 1.3.35 I do not know if I have a setting activated or not, for example:  Here you see an image of the "Change Settings" option in winetricks but they do not appeared marked or at least stay marked after I have checked them. How do I know which settings are activated and which are not. In the past I could do this in the sound tab for example when I wanted to emulate sound, full sound, alsa, oss or pulseaudio. Since the options are now gone and only found in winetricks I check them but they do not stay activated or shown after closing winetricks. I may be closing winetricks wrong or maybe there is another option somewhere to "save changes" but what I normally do is:  Open winetricks Select default wineprefix Select change settings Activate the settings I want and press the OK button  If I go back to the change settings option they do not appear marked. Looks like nothing was done.

I am looking for a step by step instruction to guide me in the ways of installing, configuring and debugging many of the issues new users have when dealing with Wine in Ubuntu.  What is the recommended way of installing Wine, some of the key issues that it has and how to solve them?  If I have a specific problem with an App in Wine, how do I go about solving it? What are the recommended steps to ensure that I can fix a problem related to an app I wish to use?


I'd like to replace the last N columns of a Numpy array by zeroes.  a = numpy.tile([1,2,3,4], (4,1))  array([[1, 2, 3, 4],        [1, 2, 3, 4],        [1, 2, 3, 4],        [1, 2, 3, 4]])   To replace the last, I do:  a[:,-1] = 0   To replace the last 2, I would do  a[:,-2:-1] = 0   but this only replaces the penultimate column  array([[1, 2, 0, 4],        [1, 2, 0, 4],        [1, 2, 0, 4],        [1, 2, 0, 4]])   Can you please explain why?  What should I do to get what I want?  Thanks

I need a good explanation (references are a plus) on Python's slice notation.   To me, this notation needs a bit of picking up.   It looks extremely powerful, but I haven't quite got my head around it.


I have connected a hosepipe to my shower drainage plumbing (1st floor), which I am running into the garden (ground floor) as a kind of grey-water system. However, the water drains out the shower terribly slowly.   The hosepipe is 50 meters long. I'm wondering whether the length is the problem. It probably only needs to be 20m to reach the end of the lawn. I don't want to cut it and ruin the hosepipe without knowing with some certainty that a shorter pipe will increase the flow/draining rate.   Any opinions?

if I have a closed system of horizontal pipes, filled with water, where I want to create a flow at some rate by using a pump. Does the length of the system influences the flow ? (in real world not in the wonderful world of the books)


It is program to find the largest prme factor of any number.   // Program to get the largest prime factor of a number  import java.util.*;  class factor{      ArrayList<Long> a;      public void large(long n){         for(long i = 1; i <= n; i++){             if (n % i == 0){                 a.add(i);             }             }         System.out.println(Collections.max(a));    } }  class test{      public static void main(String[] args){          factor g = new factor();          g.large(13195);      } }


The following matrix is of size $10 \times 10$, however it is representing an $m \times m$ matrix. Hence I need to signify that the first five columns represent terms $0$ to $\frac{m}{2} - 1$ and the second five columns represent terms $\frac{m}{2}$ to $m$. I have an attached an image of what I need to represent.  \documentclass[a4paper,12pt,times,numbered,print,index]{article}    \RequirePackage[left=37mm,right=30mm,top=35mm,bottom=30mm]{geometry} \RequirePackage{libertine}  \RequirePackage[small,bf,labelsep=space,     tableposition=top]{caption}  \usepackage{multirow}   \usepackage{subfig,amsfonts,amsmath,amssymb,braket} \usepackage{algorithm}% http://ctan.org/pkg/algorithms \usepackage{algpseudocode}% http://ctan.org/pkg/algorithmicx  \begin{document}  $$ H_{ab}= \begin{bmatrix}     1           & 1         & 0         & \dots     & \dots     & 0         &  0        & 0         & \dots     & 0 \\     0           & 0         & 0         & \dots     & \dots     & 1         & -1        & 0         & \dots     & \vdots \\     \vdots      & \dots     & \dots     & \dots     & \dots     & 0         & 0         & 0         & \dots     & \vdots \\     \vdots      & \dots     & \dots     & \dots     & \dots     & \dots     & \dots     & \dots     & \dots     & \vdots \\     0           & \dots     & \dots     & \dots     & \dots     & \dots     & \dots     & \dots     & \dots     & 0 \\  \end{bmatrix} $$ \end{document}     Does anyone have any idea how I could represent this in LaTeX? If it is not possible to get it to display exactly like in the image I don't mind, I am just looking for a way to represent th e information in the image as clearly as possible. Anyone know how to accomplish this?

What's the best way to produce a matrix with labels that are nested in braces, like this:


I'm currently working with some CSV datasets and was wondering whether there are any good (even better if standard) CLI ways of manipulating CSV data. To be more precise, I mainly want to be able to:  vertically concatenate CSVs SQL-style join CSVs on one or more columns

I work with CSV files and sometimes need to quickly check the contents of a row or column from the command line.  In many cases cut, head, tail, and friends will do the job; however, cut cannot easily deal with situations such as  "this, is the first entry", this is the second, 34.5   Here, the first comma is part of the first field, but cut -d, -f1 disagrees. Before I write a solution myself, I was wondering if anyone knew of a good tool that already exists for this job.  It would have to, at the very least, be able to handle the example above and return a column from a CSV formatted file.  Other desirable features include the ability to select columns based on the column names given in the first row, support for other quoting styles and support for tab-separated files.  If you don't know of such a tool but have suggestions regarding implementing such a program in Bash, Perl, or Python, or other common scripting languages, I wouldn't mind such suggestions.


We all know the definition of a topology $T$ on a nonempty set $X$: A collection $T$ of subsets of a nonempty set $X$ is a topology on $X$ if, (1) $\emptyset,X\in T$ (2) For any arbitrary collection of elements of $T$ their union is also in $T$ (3) For any finite collection of elements of $T$ their intersection is also in $T$. My question is why in the definition only the finite intersection is allowed why not arbitrary intersection?

One distinct difference between axioms of topology and sigma algebra is the asymmetry between union and intersection; meaning topology is closed under finite intersections sigma-algebra closed under countable union. It is very clear mathematically but is there a way to think; so that we can define a geometric difference? In other words I want to have an intuitive idea in application of this objects.


i have a problem if i have a string list   for example :  token=[aaa,bbb,ccc,ddd,0,eee,40,ggg,5]  how can i do to check whether token[i] is an integer  i want to see if token[i] is integer   i will put it in to a new string list by i+1:number  ex if token[4]=0 i will put it into result[5]="5:0"    sorry for explain not clear  first if i have many data  ex 39, State-gov, 77516, Bachelors, 13, Never-married, Adm-clerical, Not-in-family, White, Male, 2174, 0, 40, United-States, <=50K 50, Self-emp-not-inc, 83311, Bachelors, 13, Married-civ-spouse, Exec-managerial, Husband, White, Male, 0, 0, 13, United-States, <=50K  second i need to convert those data into specific number  ex State-gov into 2:1  Self-emp-not-inc into 2:2  however i can convert string into number but i cannot convert number into number ex if token[4]=0 i will put it into result[5]="5:0"  for line in lines:     token=re.split(', ',line)    for i in range(0,13,1):     try:         value = int(token[i])      except ValueError:         pass       if (token[14] in '<=50K.'):         result.append('1')     if (token[14] in '>50K.'):         result[j].append('2')     if (value == true):         result.append('i+1:token[i]')     if (token[i] in '?'):         result.append('i+1:0')     if(token[i] in 'State-gov'):         result.append("2:1")     if(token[i] in 'Self-emp-not-inc'):         result.append('2:2')

What is the best possible way to check if a string can be represented as a number in Python?   The function I currently have right now is:  def is_number(s):     try:         float(s)         return True     except ValueError:         return False   Which, not only is ugly and slow, seems clunky. However I haven't found a better method because calling float in the main function is even worse.


Lets take the semi-literal-translations  Wingardium Leviosa Wing + Levitate --> not really sure but whatever Levicorpus Levitate + body --> body fly  So presumably Levicorpus can be used on bodies only. But then why does Levicorpus exist? Draco, in the Cursed child, uses Wingardium Leviosa on a body, so why would Levicorpus exist?

, it was asked, why did Hermione whisper Levicorpus, instead of using it non-verbally. This is in the scene in The Deathly Hallows, where the trio are in the Lestrange Vault, trying to steal Helga Hufflepuff's cup. Harry couldn't reach the cup, so Hermione used the Levicorpus spell.  However, as shown when Harry first used that spell on Ron, and when James used it on Snape, that this particular spell lifts up the target by his ankle. Which would obviously cause the target to swing completely upside down if he is standing up. That's why James used it to embarrass Snape. Of course, then you'd have the difficulties of being upside down.   In the Lestrange Vault, Griphook warned the trio that Geminio and Flagrante curses had been added to everything, so the treasures would burn and multiply if touched. Ron demonstrated this by touching a cup. So subsequently, everyone avoided touching anything as far as possible. Now, Hermione knew that the effect of Levicorpus is to hoist the target up by his ankle, and at the same time, swinging him upside down. As shown in the book, Harry actually did hit something after being yanked up.  So out of all the spells, why did she use Levicorpus, and risk Harry hitting more things? She certainly could have used another spell, like Wingardium Leviosa. After all, she had mastered the spell before anyone else in their class. And it would definitely have given her more control of where Harry would move, so he wouldn't have hit anything. Why use Levicorpus and not Wingardium Leviosa?


According to the intermediate value theorem, we can infer that a single point function, for example $f(x) = \sqrt x + \sqrt(-x)$, which has a range of only $0$ and a domain of only $0$ is not a continuous function. Is my conclusion right or there is actually exception when it is continuous? or outside of the calculus realm of thinking single point function CAN BE continuous?

Is a function defined at a single point continuous?  For example $f:\{0\}\to\{0\}$ defined by $f(x)=\sqrt{x}+\sqrt{-x}$ is a sum of two continuous functions and is therefore continuous, however for $f$ to be continuous, it has to have the limit $\lim\limits_{x_0\to x}f(x_0)=f(x)$ but it dosen't seem to have that limit.


Let's say I start off with a 50/50 chance at winning the lottery. But I lose.  Now my chance is only half as good, or 25%. I lose again.  Now the chance is 12.5%. Same result.  If this continues all the way down to very low numbers, will I EVER in an infinite amount of time win the lottery?  What if every time I received a ticket, I had a million times less chance of winning than I had before?

Yesterday night, while I was trying to sleep, I found myself stuck with a simple statistics problem. Let's imagine we have a "magical coin", which is completely identical to a normal coin but for a thing: every time you toss the coin, the probability to get a head halves. So at t = 1 we have 50:50, then 25:75, then 12.5:87.5 and so on. At t = ∞ we are going to have 0:100.  My question is: if I toss this magical coin infinite times, can I say I am sure I am going to get at least one head? On one hand, I thought, the law of large numbers states that if an event is repeated infinite times, every state that is possible is bound to happen. On the other side, however, at t = ∞ the probability to get a head is zero.  Surely the solution of the problem is fairly easy, so what am I doing wrong?


I need every face of my model to fill the UV canvas (overlap). I thought that Lightmap Unwrap did this but I must be mis-remembering something. I have all edges marked as seams. The mesh is just a subdivided, elongated cube. All but 8 faces are identical and I can tweak those myself. How is this done? More info: I am making a pallet rack (for a warehouse) and I need the supports to have the same shapes cut out of them at regular intervals. The material is otherwise matte. So I figured I would make a really small, b/w alpha texture and overlay the uv faces so they all fill this small texture space. Here is the mapping I already did for the upright frames. I have secondary texture coordinates for the lighting to baked later. This will be exported to Unity.  Here is the horizontal frame that I still need to get the coordinates correct for. I want all these faces to cover the same area, the entire UV space:

I've created a plane and subdivided it. Now in the UV image editor,  I want to unwrap and place all the rectangles on top of each other to share the same texture. Is it possible? If possible, please share your method.


This is a question about Mach's principle. Why is Mach's principle still an open question? In particular, if inertia arises from distant matter, Mach's principle raises the question would a particle have inertia in a universe with only that one particle. Why is this still an open question? Do the thoughts below help settle such questions?  This question (and the title) come from  The most highly upvoted  says      This is a longstanding problem in physics and has not been wholly   solved to anyone's satisfaction. It's not just rotational motion, any   motion is subject to this concern. Very basically, what is "motion"   for a singular object in its own universe?   The question talks about Mach's principle, General Relativity, and Brans-Dicke theory.   Asking a similar question about electron spin seems obvious, but I didn't see one anywhere.   As  shows, an electron has an intrinsic spin with half integer values. The reason is that the wave function has boundary conditions. The value at $\theta=0$ must be the same as at $\theta = 2\pi$. Other sources say it is just an experimental fact. Either way, and electron has spin and angular momentum.  It seems this must apply to an electron in otherwise empty space. It doesn't seem right to argue that it may not have an angular momentum. Is there something wrong with this thought?

I often hear about subatomic particles having a property called "spin" but also that it doesn't actually relate to spinning about an axis like you would think. Which particles have spin? What does spin mean if not an actual spinning motion?


I have a table which have field name ID. My data showing like below  LE001001 LE0010010 LE001003 LE001005 LE001006 LE001007 LE001008 LE001009   But I want to show my data by sorting like below  LE001001 LE001003 LE001005 LE001006 LE001007 LE001008 LE001009 LE0010010   Please help me to crate query

We have a large database on which we have DB side pagination. This is quick, returning a page of 50 rows from millions of records in a small fraction of a second.  Users can define their own sort, basically choosing what column to sort by.  Columns are dynamic - some have numeric values, some dates and some text.  While most sort as expected text sorts in a dumb way. Well, I say dumb, it makes sense to computers, but frustrates users.  For instance, sorting by a string record id gives something like:  rec1 rec10 rec14 rec2 rec20 rec3 rec4   ...and so on.  I want this to take account of the number, so:  rec1 rec2 rec3 rec4 rec10 rec14 rec20   I can't control the input (otherwise I'd just format in leading 000s) and I can't rely on a single format - some are things like "{alpha code}-{dept code}-{rec id}".  I know a few ways to do this in C#, but can't pull down all the records to sort them, as that would be to slow.  Does anyone know a way to quickly apply a natural sort in Sql server?    We're using:  ROW_NUMBER() over (order by {field name} asc)   And then we're paging by that.  We can add triggers, although we wouldn't. All their input is parametrised and the like, but I can't change the format - if they put in "rec2" and "rec10" they expect them to be returned just like that, and in natural order.    We have valid user input that follows different formats for different clients.  One might go rec1, rec2, rec3, ... rec100, rec101  While another might go: grp1rec1, grp1rec2, ... grp20rec300, grp20rec301  When I say we can't control the input I mean that we can't force users to change these standards - they have a value like grp1rec1 and I can't reformat it as grp01rec001, as that would be changing something used for lookups and linking to external systems.  These formats vary a lot, but are often mixtures of letters and numbers.  Sorting these in C# is easy - just break it up into { "grp", 20, "rec", 301 } and then compare sequence values in turn.  However there may be millions of records and the data is paged, I need the sort to be done on the SQL server.  SQL server sorts by value, not comparison - in C# I can split the values out to compare, but in SQL I need some logic that (very quickly) gets a single value that consistently sorts.  @moebius - your answer might work, but it does feel like an ugly compromise to add a sort-key for all these text values.


I want to think my friend for always providing me with quality TV shows and movies. In my native language there is a single word that describes both of those things. What is the English word or phrase?    ... for being a bottomless source of TV shows and movies? ... for being a bottomless source of quality television? ... for being a bottomless source of television entertainment? ... for being a bottomless source of visual entertainment?

What is the hypernym for movie and TV series? I read that medium might be possible, but it doesn't sound that good.


I have a JS function in my HTML template which is assigned to a button tap. When the user clicks the button I'm sending a POST request to my Flask app which should make a redirect to another page. My problem is the redirection doesn't produce a real redirect, I mean my browser doesn't load the next page, while in the console I can see the 301 redirect on the network tab.   According to the browser's network tab, the redirection works, but my browser doesn't load the targeted url. This is how I manage the redirection with Flask:  @app.route("/signup/", methods = ['GET', 'POST']) def signup():         if request.method == 'POST':         session['usess'] = request.json['usess']         #return redirect(url_for('index'))         return redirect("/", code=301)     if session:         return redirect("/", code=301)     else:         return render_template("signup.html")     # already tried simply     # return render_template("signup.html")   And this is what happens in the log of my Flask app:   127.0.0.1 - - [20/Dec/2017 15:01:33] "POST /signup/ HTTP/1.1" 301 - 127.0.0.1 - - [20/Dec/2017 15:01:33] "GET / HTTP/1.1" 200 -   Based on these logs it works, however my browser doesn't want to load the '/' page.  And here is the function that is responsible for the session object. The whole process starts here:  btnSignUp.addEventListener('click', e => {          // ....         $.ajax({           type: "POST",           contentType: "application/json",           url: "/signup/",           data: JSON.stringify({usess: 'session_str'})           });  });   As the log shows the right requests I don't have an idea what can be the problem. I hope somebody with more experience can tell me what should I alter or try.

I'm using $.post() to call a servlet using Ajax and then using the resulting HTML fragment to replace a div element in the user's current page. However, if the session times out, the server sends a redirect directive to send the user to the login page. In this case, jQuery is replacing the div element with the contents of the login page, forcing the user's eyes to witness a rare scene indeed.   How can I manage a redirect directive from an Ajax call with jQuery 1.2.6?


This link  talks about Integer class being immutable and thus its value can't be changed. I understand that immutable objects can't be changed but their reference variable can change to point to another object can't they? Hence, by that logic, shouldn't the reference variable integer simply point to another Integer object with value 10 while the Integer object with value 5 remains unchanged in the heap? But the output remains unchanged public static void main(String[] args)  {     Integer integer=5;     System.out.println(integer);          modifyInteger(integer);     System.out.println(integer); }  public static void modifyInteger(Integer integer) {     integer=10; }

I always thought Java uses pass-by-reference. However, I've seen a couple of blog posts (for example, ) that claim that it isn't (the blog post says that Java uses pass-by-value). I don't think I understand the distinction they're making. What is the explanation?


if A is a infinite set ，define B={f|f is 1-1 correspondence on A}  I want to compute Card(B)  My attempt when A is finite ,then card(B)=$2^{card(A)}-2$  Such as A={$a_1,a_2$},then there exist two function f:$f(a_1)=a_2,f(a_2)=a_1$  $g:g(a_1)=a_1,g(a_2)=a_2$  So I guess when A is infinite ,card(B)=$2^{card(A)}$,but I can’t proof it can someone help me

How to show $|\mathrm{Sym}(\Gamma )|=2^{|\Gamma |}$ if $|\Gamma |$ is infinite?


Could anybody please  explain in detail  the sentence     "Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo."   I have seen the  but am unable to get it properly.

Why is the following statement valid, and how can I break it down so that it is easier to understand?     Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo.


I've been on StackOverflow for sometime now and haven't found any Easter Eggs. If you aren't familiar with what an "Easter Egg" is in this context, here is how  defines it: An Easter egg is an intentional joke, hidden message, or feature in a work.   Anyway after some research, I found a pretty funny one on the Stack Exchange About page . Stack Exchange is a pretty robust network and I know that google and youtube are chock-full of these things, so I'd expect Stack Overflow to have a few.  Know about any that are funny/cool? Have any personal favorites?  Edit: Chat has some Easter eggs that you can find in  question.

I would like to know what Easter eggs are hiding in Stack Overflow, and all the other Stack Exchange sites. I love Easter eggs and I love Stack Overflow, so adding even more is a good idea in my opinion, what do you think?


The information on the internet is highly unreliable, these websites say that potential remains constant inside conducting solid sphere:     These sites say potential varies as a function of distance:     which one is it?

I just began studying electrostatics in university, and I didn't understand completely why the electric potential due to a conducting sphere is  $$   V(\vec{r})=\begin{cases}     \dfrac{1}{4\pi\epsilon_0}\dfrac{Q}{R}, & \text{if $r \le R$}.\\ \\     \dfrac{1}{4\pi\epsilon_0}\dfrac{Q}{r}, & \text{if $r \gt R$}.   \end{cases} $$  Where Q is the total charge and R is the radius of the sphere (the sphere is located at the origin).  I only understand the second part of this equation (when $r > R$).  I know Gauss Law. know the charges go to the surface. I know the electric field strictly inside it must be zero. (I also know the electric field is not defined for a point that lies exactly in the surface). And I know $\vec{E} = -\nabla{V}$.  Therefore, I know the electric potiential inside the sphere must be constant. Let $C$ be this constant.  It seems that  $$ C = \lim_{r \to R^+} V(r) = \dfrac{1}{4\pi\epsilon_0}\dfrac{Q}{R} $$  But why is this true? My textbook says: because the electric potential must be a continuous function. But why? I am hoping for a non-experimental reason.  Please be precise when mentioning $r<R$ or $r\le R$. Those are different and I get easily confused when people misuse those.


I've upgraded from 10.04 to 10.10 (in order to be able to upgrade to 11.04).  It seems like the current graphics drivers are incompatible with the latest kernel I have. I don't know if I have installed drivers only from apt or if I have downloaded. I think it's only apt thou.  How do I uninstall all Nvidia drivers and revert to the default drivers? I've used at least 2 different multi monitor setup utilities, but it was last year so I don't remember much.  What config files do I need to change so that the default drivers works?

I always seem to have grief with Nvidia drivers and have often had to re-install Ubuntu: is there a better way to remove them? When I first installed the drivers, the display came up on 640 by 480.  I managed to set 2 screens to 1024 by 780 which was usable, but then Ubuntu recommended installing proprietary drivers (nvidia-current-updates 295.40-ubuntu1). After doing this and re-booting it shows LAPTOP and offers only 640 by 480 on a single screen.   Is there any way to revert to the original driver? Is there any way to find out if the new drivers work before installing them? - For years I have been hoping that it would be all fixed in the latest release… I always seem to fall for this!


I want to copy all the pictures on a site, but I don't know how to do it. Could you please tell me? Shall I use a tool?

I want a command that I type a URL, for example photos.tumblr.com, and it download all photos on this site in a folder, but not only images of the site's homepage. This command need to download the images from all parts of the site, such as photos.tumblr.com/ph1/1.png / photos.tumblr.com/ph3/4.jpg.  Please show me an example using this url:  and test it before answer the question


Say I want to provide a device (completely batteryless of course, and detached from any human touch) the capability to immitate a touch on a capacitive screen (Galaxy S6 here). I know I just need some kind of a capacitor to touch the screen. I managed to register a touch by folding a piece of metal snack wrap (an inch square of it), put it on a piece of plastic, to escape my body's capacitiveness, and touch the screen with it.  So, would I be able to do the same by connecting, let's say, an copper/aluminum foil to a capacitor, then touch the other side of that foil (or wires?) on the screen to register a touch?  I am asking about a capacitor, because I guess this would be the best/smallest solution to mimic our body's (connected to the finger) capcitiy. If I am totally wrong, and you have any other idea, welcome to suggest ;)  To make the question more clear: I want to mimic a finger (or multi touch) press, with the smallest/flattest possible (electrical?) device. I asked about a capacitor because it is small, and from my tiny knowledge in electronics, it "should do". So, this is not a general question like been asked before. I want to try and get to the specifics of how to mimic.  Thanks

I want to robotically touch an iPhone screen without any human intervention.   I've done some experiments but have not found a reliable solution. It seems even styluses that work through gloves still rely on the capacitive characteristics of the human body.    Carrot held by human works Carrot held in plastic clamp doesn't Pogo Stylus works held by human and held by human through clothes Stylus does not work held in plastic clamp.  Stylus works held in plastic clamp attached to human through clothes via jump lead. Stylus held in plastic clamp with jump lead dangling off seems to work most the time.   Is it possible to mimic the human element using capacitors and other components? What signal does the capacitive screen need to be triggered?  Thanks


Prove that for all $n\in\Bbb{Z}$, $a^{2n}-b^{2n}$ is divisible by $a+b$ using induction.     I know that if $a$ is divisible by $b$, then $a=kb$, where $k\in\Bbb{Z}$. Here we have that $a^{2n}-b^{2n}=(a+b)k$, with $k\in\Bbb{Z}$.  For the base case I set $n=1$, so $a^2-b^2=(a+b)(a-b)=(a+b)k$, where $k=a-b\in\Bbb{Z}$.  Now the inductive step (where I have doubts): $$a^{2n}-b^{2n}=(a+b)k\implies a^{2(n+1)}-b^{2(n+1)}=(a+b)m,\;k,m\in\Bbb{Z}.$$ We start from $a^{2(n+1)}-b^{2(n+1)}$. Then $$a^{2n+2}-b^{2n+2}=(a+b)\color{red}{(a^{2n+1}-a^{2n}b+a^{2n-1}b^2-\dots-a^2b^{2n-1}-ab^{2n}+b^{2n+1})},$$ so $a^{2(n+1)}-b^{2(n+1)}=(a+b)m$, where $m=a^{2n+1}-a^{2n}b+a^{2n-1}b^2-\dots-a^2b^{2n-1}-ab^{2n}+b^{2n+1}\in\Bbb{Z}.\qquad\square$    I have two questions:   Is the math in $\color{red}{\text{red}}$ a correct descomposition of $a^{2(n+1)}-b^{2(n+1)}$? We have not used the inductive hypothesis. Could we use it?

I did some mathematical induction problems on divisibility   $9^n$ $-$ $2^n$ is divisible by 7. $4^n$ $-$ $1$ is divisible by 3. $9^n$ $-$ $4^n$ is divisible by 5.   Can these be generalized as $a^n$ $-$ $b^n$$ = (a-b)N$, where N is an integer? But why is $a^n$ $-$ $b^n$$ = (a-b)N$ ?  I also see that $6^n$ $- 5n + 4$ is divisible by $5$ which is $6-5+4$ and $7^n$$+3n + 8$ is divisible by $9$ which is $7+3+8=18=9\cdot2$.  Are they just a coincidence or is there a theory behind?  Is it about modular arithmetic?


I have a function in JavaScript:  function main() {    console.log(this); }   How come this logs Document? Surely it should log function main?  If not, then how do I declare a variable within main to be accessed by the rest of the code as main.varName?  Thank you!

I just came across an interesting situation in JavaScript.  I have a class with a method that defines several objects using object-literal notation.  Inside those objects, the this pointer is being used.  From the behavior of the program, I have deduced that the this pointer is referring to the class on which the method was invoked, and not the object being created by the literal.    This seems arbitrary, though it is the way I would expect it to work.  Is this defined behavior?  Is it cross-browser safe?  Is there any reasoning underlying why it is the way it is beyond "the spec says so" (for instance, is it a consequence of some broader design decision/philosophy)?  Pared-down code example:  // inside class definition, itself an object literal, we have this function: onRender: function() {      this.menuItems = this.menuItems.concat([         {             text: 'Group by Module',             rptletdiv: this         },         {             text: 'Group by Status',             rptletdiv: this         }]);     // etc }


This is a quiz app in Java. I am trying to compare the answer text stored as a variable (answeredOne) to the actual answer Prophase. I cannot get them to be equal. Do you see anything wrong with this code?      EditText questionOne = (EditText) findViewById(R.id.answer_one);     String answeredOne = questionOne.getText().toString();     if (answeredOne == "Prophase") {         score = score + 1;     }   I keep getting zero when answering in the question.

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


Could anyone help me with an example of a pair of generating elements for the group $\mathrm{PSL}(2,q)$?  Here $\mathrm{PSL}(2,q)$ denotes the group of $2\times 2$ matrices with determinant $1$ and whose entries are elements of a finite field of order $q$ (alternatively, the quotient group of $\mathrm{SL}(2,q)$ by its center).  Many thanks!

Is there a nice presentation for the group $\text{PSL}(2,\mathbb{F}_q)$, for every prime $q$?  (I don't have any particular definition in mind for "nice", other than, say, a small number of generators and relations.)


Environment: Lenovo T530 running Windows 7.  Have installed Ubuntu 14.04 on a virtual machine using VM Virtual Box.  Have installed all the updates from both Virtual Box and Ubuntu.  Problem: While in Ubuntu's desktop and other Ubuntu initiated programs, the window is reduced to about 3x4 inches showing in the middle of the rest of my regular Virtual Box window.  I am seeing only the upper right hand of the screen output of what I would normally see.  Please help.   I've seen    But, none of these answers works in 14.04.

I've recently installed Ubuntu on Oracle's Virtualbox.  Now I want to install the guest additions.  I started up my Ubuntu guest OS, clicked "Devices" and chose "Install Guest Additions". Nothing happened, and I don't see the CD icon on my desktop.  How can I make this work?


Assume that that I am using the following environment for the references of my paper:  \bibliographystyle {amsalpha} \begin {thebibliography} {VDN92} \bibitem{abels} {\bf H. Abels,} Parallelizability ... Math. Ann. vol. 212, (1974), 1--19.  \end {thebibliography}   What should I do to add the page number of occurrences of this paper (those pages of my paper that I have cited the above paper) at the end of this citation?

In GKP's Concrete Mathematics, there is a useful and interesting feature I would like to see in more books. The bibliography entries include:   a - the page numbers where the book or article is cited in the document. b - a few lines of review of the cited work.   It is a kind of mix between bibliography, index and review.  Are there stable LaTeX packages/BibTeX styles to do (a) and (b) ?  EDIT: I wrote (b) initially as "comments about the work cited". It could be understood as "gathering comments made in the book about the work and reproducing them in the bibliography".  This is not what I meant but this could be something useful for others.


I wanted to have example of group which can not be ring?  I think if we have non abelian group with some operation we can not proceed to ring . Is it correct or it required to more argument ?   Actually this question asked by my prof in class I answered same but he is not satisfied . so I was confused whether I am correct or not ?  Please give me suggestion .

Given some Abelian group $(G, +)$, does there always exist a binary operation $*$ such that $(G, +, *)$ is a ring? That is, $*$ is associative and distributive:  \begin{align*} &a * (b * c) = (a*b) * c \\ &a * (b + c) = a * b + a * c \\ &(a + b) * c = a * c + b * c \\ \end{align*}  We also might have multiplicative identity $1 \in G$, with $a * 1 = 1 * a = a$ for any $a \in G$. Multiplication may or may not be commutative.  Depending on the definition, the answer could be no in the case of the group with one element: then $1 = 0$. But the trivial ring is not a very interesting case. For cyclic groups the statement is certainly true, since $(\mathbb{Z}_n, +, \cdot)$ and $(\mathbb{Z}, +, \cdot)$ are both rings. What about in general? Is there some procedure to give arbitrary abelian groups ring structure?


Hi All: I have the code below ( which was mostly given to me by someone on this list a while back ) and I can't figure out how the length of the each of the boxes is determined. I just want to change two things in the code which works quite nicely as is.  I want the length of the box to be five times as long as it currently is so basically becomes a rectangle.  I want the text in the box to be written at the right end of the rectangle.   Some people have given me nice solutions in another thread-question that I posed but I never explained that the boxes have to line up in a certain way with the horizontal axis so the solutions weren't really appropriate but that was my fault because of my lack of specificity. Thanks a lot. Oh, I'm thinking that the length of the box is somehow determined in the definition of squared node but I don't understand minimum width, minimum length and minimum size. I imagine that y=1.5cm is the height which is fine ? Thanks again. \begin{tikzpicture}[ squarednode/.style={draw=black, minimum size=9.9mm}, y=1.5cm ]  \newcommand{\absval}[1]{\ifnum#1<0 -\fi#1} \newcommand{\fullmin}[1]{\ifnum\absval{#1}<10 0\fi#1} \newcommand{\nextstep}[1]{\pgfmathparse{int(#1+0.5)}\pgfmathresult}  % horizontal axis \draw[->] (0,0) -- (11,0) node[anchor=north] {min};  % \foreach \x in {0,...,10}      { %help lines     \draw [help lines, color=gray!30, dashed] (\x,0) -- (\x,6); %ticks     \draw (\x,1pt) -- (\x,-3pt) node[anchor=north] {\fullmin{\x}};     }  % labels \foreach \y/\m/\mm in {5.5/00/05,4.5/01/06,3.5/02/07,2.5/03/08,1.5/04/09,0.5/05/10}     {     \draw (-1.5, \y) node{DERZZZ\textsubscript{(11:\m{}-11:\mm)}};               }          %boxes     \draw (0.5, 5.5) node[squarednode] {$X_{1}^{*}$};                     \draw (1.5, 4.5) node[squarednode] {$X_{2}^{*}$};     \draw (2.5, 3.5) node[squarednode] {$X_{3}^{*}$};             \draw (3.5, 2.5) node[squarednode] {$X_{4}^{*}$};             \draw (4.5, 1.5) node[squarednode] {$X_{5}^{*}$};             \draw (5.5, 0.5) node[squarednode,dashed] {$X_{6}^{*}$};                              \end{tikzpicture}

Hi All: I have a code snippet below which works beautifully and was provided by someone on this list to me a while back.  But now I want to change it so that I draw one long rectangle instead of the adjacent five boxes. The text inside the rectangle should just be at the far right of it and could say $Y^{*}_{whatever}$. I'm thinking that I need to define a rectnode instead of a squared node with different things in it.  But I don't understand how to make it the same length as the length of the boxes and in the same position. "minimum size" currently inside the definition of squarednode isn't making sense to me. EDIT: I have edited this question by including a handwritten drawing in order to express the fact that I need the rectangles to line up with the horizontal axis as shown. So, the first rectangle travels from 0 to 5. The second rectangle travels from 1 to 6, etc all the way to the 6th rectangle travelling from 5 to 10. Also, all the rectangles should be the same width and length even though it may not seem that way by the picture. I also don't need a y-axis. Thanks and I'm sorry for not being clearer the first time.  \begin{tikzpicture}[ squarednode/.style={draw=black, minimum size=9.9mm}, y=1.5cm ]    %boxes      \draw (0.5, 5.5) node[squarednode] {$X_{1}^{*}$};     \draw (1.5, 5.5) node[squarednode] {$X_{2}^{*}$};     \draw (2.5, 5.5) node[squarednode] {$X_{3}^{*}$};     \draw (3.5, 5.5) node[squarednode] {$X_{4}^{*}$};     \draw (4.5, 5.5) node[squarednode] {$X_{5}^{*}$};                  \draw (1.5, 4.5) node[squarednode] {$X_{2}^{*}$};     \draw (2.5, 4.5) node[squarednode] {$X_{3}^{*}$};     \draw (3.5, 4.5) node[squarednode] {$X_{4}^{*}$};     \draw (4.5, 4.5) node[squarednode] {$X_{5}^{*}$};     \draw (5.5, 4.5) node[squarednode,dashed] {0};      \draw (2.5, 3.5) node[squarednode] {$X_{3}^{*}$};     \draw (3.5, 3.5) node[squarednode] {$X_{4}^{*}$};     \draw (4.5, 3.5) node[squarednode] {$X_{5}^{*}$};     \draw (5.5, 3.5) node[squarednode,dashed] {0};     \draw (6.5, 3.5) node[squarednode,dashed] {0};          \draw (3.5, 2.5) node[squarednode] {$X_{4}^{*}$};     \draw (4.5, 2.5) node[squarednode] {$X_{5}^{*}$};     \draw (5.5, 2.5) node[squarednode,dashed] {0};     \draw (6.5, 2.5) node[squarednode,dashed] {0};     \draw (7.5, 2.5) node[squarednode,dashed] {0};          \draw (4.5, 1.5) node[squarednode] {$X_{5}^{*}$};     \draw (5.5, 1.5) node[squarednode,dashed] {0};     \draw (6.5, 1.5) node[squarednode,dashed] {0};     \draw (7.5, 1.5) node[squarednode,dashed] {0};     \draw (8.5, 1.5) node[squarednode,dashed] {0};          \draw (5.5, 0.5) node[squarednode,dashed] {0};     \draw (6.5, 0.5) node[squarednode,dashed] {0};     \draw (7.5, 0.5) node[squarednode,dashed] {0};     \draw (8.5, 0.5) node[squarednode,dashed] {0};     \draw (9.5, 0.5) node[squarednode,dashed] {0};                      \end{tikzpicture}


During the night, I set my phone to silent, since even the vibrate wakes me up. Is there some way to let it still vibrate if I get a call from certain contacts?

At work , i would prefer to set my phone in such a way that only the calls from my family group will ring , while all other contact calls should be silent. And later i should be able to switch it back to normal.  In general , there are sound profiles for phones, but the profiles are not specific to a contact or a group, i need a work profile which will set Family - Normal Others - Silent . etc  Is there any app in the market that would help me with this??


I need help proving the following mathematical statement:     Prove that for every $n$ there is a $k$ such that $n \leq k^2 \leq 2n$ where $n,k\in \mathbb{N}$.   Could someone get me started or give me some advice on proving this statement?

Problem: Prove that there is at least one perfect square in the sequence $n, n+1,\ldots, 2n$.  I know this is in fact very easy, but I can't seem to put my finger on the right equation for it. It involves something like $2(n+1)^2 <(2n)^2$ or the like.


import java.io.*;  import java.util.Scanner;  import java.math.*;   class Sort {   public static void main(String args[]) {      class gint {         int N, n, s;         int ggn[];     }      gint gginta=new gint();     gint ggintb=new gint();     gint ggintc=new gint();      int i=0;     int j=0;     char c[];     String ss;     String sggn;     String sggnrev="";       System.out.println("enter the number of maximum digits of the number");     Scanner scan=new Scanner(System.in);     gginta.N=scan.nextInt();     System.out.println("enter the number exact digits of the number ");     gginta.n=scan.nextInt();     System.out.println("enter the sign of the number");      System.out.println("enter the number");     sggn=scan.next();      char temp[];     int l=sggn.length();      for(j=l-1; j >= 0; j--) {         sggnrev= sggnrev+sggn.charAt(j);     }     int x= Integer.parseInt(sggn);     System.out.println(sggnrev);     System.out.println(sggn.length());     int h;     System.out.println(sggn.length());      for (int f=0;f<=sggn.length()-1;f++) {         System.out.println(f);         double y=(int) (x/Math.pow(10, f));         double z=(int) (x/Math.pow(10, f+1));         double w= y-(z*10);         System.out.println("power"+i+"= "+(int) y +"-"+(int)z*10+"="+w);         h= (int)  w;          gginta.ggn[f]=h;          System.out.print(gginta.ggn[l-1]);         l--;     }     for (i=0;i<=sggn.length()-1;i++) {                   if (sggn.length()!=gginta.n) {             System.out.println("number not in range....enter the number again ... ");             do {                 System.out.println("number not in range....enter the number again ... ");                            System.out.println("enter the number");                 sggn=scan.next();                    } while (sggn.length()!=gginta.n);         }     } }   this code is basically taking a number as a string and i am aiming to get each index of the string and transfer its value to the index of an integer array so that i have my number is in the integer array and each index of the array represents a digit of the number

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


In the Breusch-Godfrey test we use a model  $$ e_t = \varepsilon_t + \beta_1 \varepsilon_{t-1} + \dots+ \beta_p \varepsilon_{t-p}. $$  If we reject the null hypotesis of no serial auotocorrelation of the error, it means that the residuals follow an auto-regressive model of order ($p$).  If I want to avoid this problem, I must add a certain number of lags of the response variable $y$ as regressors in the original model. However, in some cases this method is not useful.   Are there other options to consider?

When modeling time series one has the possibility to  (1) model the correlational structure of the error terms as e.g. an AR(1) process (2) include the lagged dependent variable as an explanatory variable (on the right hand side)  I understand that their are sometimes substantial reasons to go for (2).   However, what are the methodological reasons to do either (1) or (2) or even both?


\endpspicture produces an error (for me) because it contains \fboxsep=0pt, and \fboxsep appears not to be undefined.  I thought perhaps I had accidentally deleted the file which contained the definition; so I tried to find where the definition was.  I did a search for \fboxsep in the entire CTAN ...\pstricks\base\   package without finding where it is defined.  What's going on?  EDIT: Various people have reported that it is defined in the LaTex kernel.  I am NOT a LaTex user and until very recently, \pstricks worked fine in PlainTex.  Was it decided that PsTricks is now a LaTex only package, or is it simply a bug in a new version?

Just writing the following very simple program I had some problems. I use to write in plain TeX and in this case I tried to make a picture with PSTricks and first of all sized it with \pspicture. The program is:  \input pstricks \pspicture (0,0)(5,5) \endpspicture \bye   but when I compiled with TeX, I encountered the following error:  Command Line:   tex.exe --src --interaction=errorstopmode "figura.tex" Startup Folder: C:\Users\MT\Documents\TeX  This is TeXk, Version 3.14159265 (TeX Live 2015/W32TeX) (preloaded format=tex)  Source specials enabled. (./figura.tex (c:/texlive/texmf-dist/tex/generic/pstricks/pstricks.tex we are running tex and have to define some LaTeX commands ... (c:/texlive/texmf-dist/tex/generic/xkeyval/pst-xkey.tex 2005/11/25 v1.6 PSTricks specialization of xkeyval (HA) (c:/texlive/texmf-dist/tex/generic/xkeyval/xkeyval.tex (c:/texlive/texmf-dist/tex/generic/xkeyval/xkvutils.tex (c:/texlive/texmf-dist/tex/generic/xkeyval/keyval.tex)) 2014/12/03 v2.7a key=value parser (HA) (c:/texlive/texmf-dist/tex/generic/xkeyval/xkvtxhdr.tex 2005/02/22 v1.1 xkeyval TeX header (HA)))) (c:/texlive/texmf-dist/tex/generic/pstricks/pst-fp.tex `pst-fp' v0.05, 2010/01/17 (hv)) (c:/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common.tex (c:/texlive/texmf-dist/tex/generic/pgf/utilities/pgfutil-common-lists.tex)) (c:/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeys.code.tex (c:/texlive/texmf-dist/tex/generic/pgf/utilities/pgfkeysfiltered.code.tex)) (c:/texlive/texmf-dist/tex/generic/pgf/utilities/pgffor.code.tex (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmath.code.tex (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathcalc.code.tex (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathutil.code.tex) (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathparser.code.tex) (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.code.tex (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.basic.code.tex) (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.trigonometric.code .tex) (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.random.code.tex) (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.comparison.code.te x) (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.base.code.tex) (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.round.code.tex) (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.misc.code.tex) (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfunctions.integerarithmetics .code.tex))) (c:/texlive/texmf-dist/tex/generic/pgf/math/pgfmathfloat.code.tex) )) `PSTricks' v2.64b  <2015/14/11> (tvz) (c:/texlive/texmf-dist/tex/generic/pstricks/pstricks.con)) ! Undefined control sequence. \endpspicture ...z@ \box \pst@hbox \else \fboxsep                                                    =0pt \fbox {\rule [-\pst@s... l.5 \endpspicture  ? x No pages of output. Transcript written on figura.log.  _____________________________________________________________________   TeX Compilation Report (Pages: 0)   Errors: 1   Warnings: 0   Bad Boxes: 0 _____________________________________________________________________   What's the problem?


This was a short film about some sort of items or plants/seeds sent to Earth. I remember a guy (like a Midwest farmer-style or something like that) found one.  He starts acting strange, building sort of a bunker container and is tracked by some sort of secret agent trying to get that item.   At the end of the film he puts his daughter with another dude and that item inside it. Then it is sort of the end of the world (post-apocalyptic style) but the magical plant from space is spreading out of that built container. During the destruction of Earth that organic matter sort of spreads inside the container to protect itself and the girl by creating a sort of cocoon.  Also that space magical plant or item fixed/healed a guy with broken legs or something similar in the middle of the movie.

Does anyone remember the title of this (possibly straight to video) movie from the late 1980's / early 1990's?   Live action. English dialogue, but this could have been a dub - the credits indicated that it was made in Hungary. The opening theme was a monotonous song - the lyric "to reach the end of the line" was repeated a lot. The setting was an authoritarian police state, possibly post apocalyptic. The protagonist was the driver of a sentient truck. The truck's name was "Monster". The truck could speak via a living flesh human mouth built into the dashboard. The opening titles may have had a wireframe animation of the truck. The protagonist rescues a young girl and agrees to escort her to a sanctuary. The protagonist dies towards the end, and his role of driving the truck is taken over by the young girl that he rescued.


Let's say I have this method in my runnable.  I always delete that @override. But I want to know if there is any negative effects to this?  I tried to search but didnt find nothing.  @Override public void run() {     while (running) {      } }

What are the best practices for using Java's @Override annotation and why?     It seems like it would be overkill to mark every single overridden method with the @Override annotation.   Are there certain programming situations that call for using the @Override and others that should never use the @Override?


A friend of mine uses RPM and has many custom in house developed packages of his own and wants to switch to Ubuntu.  The question he asked me was; Can I use RPM packages with Ubuntu instead of .deb ? as it is almost impossible recompiling all packages he has already.  Note: The question is about working Natively with RPM packages (not to convert RPM to deb using Alien)  Thanks.

I have a burning desire to install RPMs onto my Ubuntu installation - is this possible? Can I use Yum - or another RPM Package Management tool?


Hypothetically, if we could dig to the middle of the earth, how would gravity affect the people and equipment at different depths in the planet? It seems that at the centre, there would be equal forces pulling in every direction causing an object to "float". But how about at other places? I know that this question seems like a duplicate of  but I am asking for the effects, not the math of calculating such forces.

Would the effect of gravity on me change if I were to dig a very deep hole and stand in it? If so, how would it change? Am I more likely to be pulled downwards, or pulled towards the edges of the hole? If there would be no change, why not?


It was me who asked  question. It was a duplicate but it had not satisfied any solutions of the original question. I mentioned it over comments and even then it was put on hold. A lot after that I found my exact solution over . So why was that put on hold even when it's not solved?

Questions can be closed or marked as duplicates.  What does it mean for a question to be "closed"? What does it mean for a question to be marked as a "duplicate"? Who can close a question? What are the reasons for closing a question ? Is closure the end of the road for a question? When are closed questions eligible for deletion?   Related        For more information, see "" in the .


I am trying to exit the popup card by clicking anywhere other than the card i.e. on the blurred background, but I am not able to add the EventListener to the div, because the class is toggled off and the error is Cannot read property 'addEventListener' of null at... This code doesn't work. const blurMe = document.querySelector(".blur"); blurMe.addEventListener("click", function () {         for (let index = 0; index < 3; index++) {             card[index].classList.add("hidden");         }         blurMe.classList.remove("blur");  });   My cross button is working fine but I don't know how to add the feature to exit the popup just by clicking anywhere else on the screen.  please add the code to

I have some HTML menus, which I show completely when a user clicks on the head of these menus. I would like to hide these elements when the user clicks outside the menus' area.  Is something like this possible with jQuery?  $("#menuscontainer").clickOutsideThisElement(function() {     // Hide the menus });


What is better way to use cURL tool with Android Studio 1.1.x on Windows? because there is no proper information in official site for client tools on windows environment.  I tried to download from official website, but the downloads are available for windows 2000/XP. And unlike Linux cURL tool, it has got both free and paid version for Windows.

Is there a way to install cURL in windows in order to run cURL commands from the command prompt?


I've had this problem since my last build. I've got all new parts aside from my psu. I thought it was my gpu that was causing the issue but I swapped to an AMD temporarily and it still happens. My background will go black and I can get it back by restarting Windows Explorer, but that's a hassle for as often as it happens. It used to freeze in my old build but I haven't seen that happen yet, with this new GPU. Any ideas?

looks like this.  The icons show the desktop background behind them only after hovering over them. It doesn't happen all the time. The desktop became that way upon highlighting it, as you can see. I am currently using  as a stand in for my  while it is being repaired. I sent the Nvidia GPU in for repair because of this black background problem. Originally I had an Intel set up; I bought my Nvidia GPU just before building a new PC entirely. The parts I salvaged from my Intel system build were my PSU and the Nvidia GP I sent in. I never had this problem before I put the Nvidia GPU in my Intel build, but, now even in my AMD build and with an XFX card I still get this glitch/error. Note: I also salvaged my HDD and SSD from my old build. That could be the problem. All I have is Windows and it was a fresh install as of 2 or so months ago. This problem is (from what I can tell) cosmetic, I don't get any harmful system errors stops or glitches, but, I rather like my background so I’d like to have it fixed. As you can see in  I show the parts I salvaged from . Any part not shown in my Intel build was transferred from it to the AMD build. That’s all the information I have, though. Thanks to anyone taking the time to help.


I recently requested deletion of my Stack Exchange account on just one specific Stack Exchange site.  I followed the instructions here:   I made the request nine calendar days ago.  Then I waited.  Then I waited some more.  Then after a week, I used the contact form to try to request an update.  There's been no update, no communication, nothing except the "scheduled for deletion" banner on my account on that site.  I get that people are busy and such.  All I'm looking for is some quick indicator that something is happening, or at least is genuinely going to happen in the future.  What's the procedure for getting such an update if it's not coming from the individual site itself?

Because of personal reasons, 10 days ago I requested that all my accounts be deleted. I followed the guidelines  but it didn't generate any result; all my accounts are still active.  At this point I don't know if my request is stuck in the tubes somewhere, waiting or ...  So, can anyone explain the process for deleting users (who themselves demand the deletion) and how much time it usually takes? e.g.   Are the users deleted as soon as Stack Overflow/Stack Exchange has the manpower to do so, or is it an automatic process? If you interact with Stack Overflow/Stack Exchange after you request the deletion, is the deletion cancelled? Does the deletion account for the possibility a user might have had a bad day and decided to end it, but just in case do the delete later on (after weeks, months, etc.) in case maybe the user has a change of heart (recovery will  if deletion is done and the user wishes he could get his account back)?   ... this sort of stuff... Basically, what's the process?


Is there an integral domain in which all elements are reducible?  I can't think of a counter example. Some sugestion?

I am looking for rings that are integral domains but not factorization domains, that is, rings in which it is not possible to express a nonzero nonunit element as a product of irreducible elements.    Do you know any example?


$X$ and $Y$ are independent $U(0,1)$ random variables.   I have to find $E[X|X>Y]$.   I found it out by integrating $\int_0^1 \int_y^1 x dxdy$ to get $\frac{1}{3}$ as the answer but this is wrong according to the answer key. What is the mistake that I have made?

In particular, $f(x,y)=1$ for $0<x<1$ and $0<y<1$. How to calculate the conditional mean of $E(X\mid X<Y)$?  I understand the conditional mean $E(X\mid Y) = \int_{-\infty}^{\infty}xf(x\mid Y)dx$. But how do we make sense of conditions like $X<Y$?


Write down explicitly the optimal solutions to the Moreau-Yosida regularization of the function $f(x)=\lambda\|x\|_1$, where $f:\mathbb{R}^n\to(-\infty,+\infty]$.  I have found that the answer is   $x_i=sgn(x_i)\max\{|x_i|-1,0\}$  Here is my attempt to get the answer:     The proximal operator to $f(x)$ is $\min_{y\in\mathbb{R}^n}\lambda\|y\|_1+\frac{1}{2}\|y-x\|^2_1$.   I need to minimize this over y.   I have no idea how to continue. I have read a lot of references but I cannot find an explicit step-by-step solution to this problem.  Any help would be appreciated!

I am encountering an unconstrained minimization problem. The problem is of the form  $$\min_x \frac{\|x-a\|_2^2}{2}+\lambda\|x\|_1$$  where  $x,a \in R^n$ and $x$ is the optimization variable. $\lambda \in R$. The problem can be separated in each coordinate as follows,  $$\min_{x_i}  \frac{(x_i-a_i)^2}{2}+\lambda|x_i|$$  I found in some resource that the optimal $x_i^*$ has the form  $ x_i^* = \operatorname{sign}(a_i)\max(0,|a_i|-\lambda)$. I am having a hard time understanding why is it optimal solution for the problem. Hope anyone helps.  Thanks.