When trying to send a large number of requests (>500), I get a connection error like so:  ConnectionError: ('Connection aborted.', gaierror(8, 'nodename nor servname provided, or not known'))  The code:     def compare_and_fix(mac, reqSession):          url = hosturl + &lt;api as a string&gt; + mac          try:                 resp = json.loads(reqSession.get(url, headers=headers, cert=(…), timeout=10, verify=False).text)                 response_code = resp['status']                 if response_code == 200:                         result = resp['data']                 else:                         print “oo-ooh!”         except Exception as ex:                 print ex.message       def worker(reqSession):             while True:                     mac = q.get()                     if validate_mac(mac):                             compare_and_fix(mac, reqSession)                     q.task_done()      num_worker_threads=500     q = Queue()      for i in range(num_worker_threads):             session = requests.session().client()             t = Thread(target=worker, args=(session,))             t.daemon = True             t.start()      for mac in mac_list:             q.put(mac)     print "Waiting for threads to join"                                                                                                                                                                      q.join()   This works well if num_worker_threads is low ~100-200. Anything more, and I start to see the above error. If I go more than 500, I see it happen quite a bit (~15% of all calls fail with this error at this point).  Trace:      exception : Traceback (most recent call last):            File “xyz.py", line 62, in abc                 resp = json.loads(reqSession.get(url, headers=headers, cert=(…), timeout=10, verify=False).text)            File "/Library/Python/2.7/site-packages/requests/sessions.py", line 476, in get                 return self.request('GET', url, **kwargs)            File "/Library/Python/2.7/site-packages/requests/sessions.py", line 464, in request                 resp = self.send(prep, **send_kwargs)            File "/Library/Python/2.7/site-packages/requests/sessions.py", line 576, in send                 r = adapter.send(request, **kwargs)            File "/Library/Python/2.7/site-packages/requests/adapters.py", line 415, in send      ConnectionError: ('Connection aborted.', gaierror(8, 'nodename nor servname provided, or not known'))   Any insight into this issue is appreciated. Thanks!
Does anyone know?  And a bigger question is what happens when you encounter this maximum? Is this the same number with other Windows OSs such as Vista, XP etc.?
CreateService get error: ERROR_INVALID_ADDRESS (0x000001e7) So, I've finally obtained the Werewolf form. After returning out of the form, fully naked...  I seem to be stuck in third person view! How can I fix this? Scrolling or pressing F does not work.  I want to get back in first person view...    Mouse wheel allows to zoom in/out but not get me into the first person view but rather behind and slightly to the right of the character. The command animcam locks me at a certain distance, doing it again brings me back into the mode that I'm stuck in third person view. Hitting F after this doesn't work. tfc doesn't help me either, although that command is nice to take screenshots... Sum of $\sum \limits_{n=0}^{\infty} \frac{1}{(kn)!}$ Does a closed form exist for      $$\sum \limits_{n=0}^{\infty} \frac{1}{(kn)!}$$   in terms of $k$ and other functions? The best that I have been able to do is solve the case where $k=1$, since the sum is just the infinite series for $e$. I would guess that any closed form must involve the exponential function, but am at a loss to prove it. My brother owns Skyrim on steam. We use Steam Family Share, but we were wondering how both of us could play it at the same time? Unbounded continuous function on non-compact metric space Suppose $(S,d)$ is a non-compact metric space. Is it possible to construct an unbounded continuous function from $S$ to $\mathbb{R}$? If it is possible, please show the construction method :)  Here's my attempt to solve this problem: Because $S$ is not compact, we can find a neighborhood assignment function $N(x)$ so that a finite cover is not possible. Then each time we can find an uncovered point from the union of neighborhoods before, and change the function by $f(x):=max\{f(x),\text{a function which equals to the indice of this point at that point and gradually vanishes at further points from the selected point}\}$. However I'm concerned that while this function is unbounded, there may be some invalid points for this function (goes to infinity)...  EDIT: As I found out there is a duplicate question, however the elementary solution is not presented in that question, so I still wish to know about this problem. :) Number Theory: Find all solutions of $\phi(n)=16$ and $\phi(n)=24$ I'm trying to give the best experience to users of a very huge system (like a CRM). It has a lot of forms and much of these have a lot of fields. My doubt is about if I should use a single column form (which raises too much vertical scrolling), or a two columns form (which needs less vertical scrolling and uses more horizontal white space) and a last one with four columns (which has few scrolling and uses almost whole white space to try to keep most of the fields above the fold).  It's important to say that our clients hate scrolling, and they always ask why we don't use the horizontal white space when we present a one column form).  So I'm little bit confused about it, because a lot of UX studies and good practices recommend to do not use/avoid multicolumn forms but the clients most of times ask multi column forms.  Our clients are very used to desktop programs and not everybody is very familiar with web based systems.  Below follows some possibilities I would like to share to illustrate an example of a complex form in the system with the three possibilities I mentioned:    In the example above I'm using the one column form (most recommended in UX studies), but with a very long vertical scroll.    In the second example I tried to reduce vertical space by using two columns.    This is the client's favorite one, 4 columns using white space and trying to keep everything above the fold.   The lengths of fields are based on the average of characters amount for each field.   I would like to know your opinion about the best approach to this case. Can the Flash run faster than light? The representative point of a cluster or cluster center for the k-means algorithm is the component-wise mean of the points in its cluster. The mean is chosen because it helps to minimize the within cluster variances (which is to say that it is minimizing within cluster squared Euclidean distance, since its the same). Now, when I want to use a different distance metric, like L1 (Manhattan distance), I would be minimizing the within cluster absolute deviations (if I choose to). I was looking at what the centers calculation would be like, because the mean won't reduce the new objective function, and I found this on the Matlab documentation of their kmeans function for the distance parameter     cityblock - Sum of absolute differences, i.e., the L1 distance. Each centroid is the component-wise median of the points in that cluster.   Now, how did they come up with the component-wise median? How does a median minimize absolute deviations? What training do doctors/Healers receive above their school education?   A fresh Hogwarts graduate does not seem to have all the skills required to be a Healer, so s/he would need to be learning those skills somehow/someplace. So how/where do they get those skills?  Also, there is one instance of a doctor being praised for inventing a healing spell. Is there any research system, like funding, trials etc or any other source of innovation? Let $F$ be a field, let $\omega$ be a primitive $n$th root of unity in an algebraic closure of $F$. If $a$ in $F$ is not an $m$th power in $F(\omega)$ for any $m\gt 1$ that divides $n$, how to show that $x^n -a$ is irreducible over $F$? Cycles not rendering with background image I read a story once about a man who escapes from his pursuers by doing an uncontrolled jump into hyperspace. If I'm not mixing my stories up he was blind but could see through the eyes of other sighted people/animals nearby. He was able to see through his pet but it dies and he thinks he's finished - he's blind and lost in hyperspace but there's a rat on board which he eventually catches by turning off gravity and then he can see through the rat's eyes. He works out how hyperspace operates and can hop back to where he came from.   Can anyone remember the name of the story and the author? I enjoyed it when I was a kid and would like to read it again. Run a program X times A Variation of the even-town odd-town problem Let assume facebook has $n$ users. Mark Zuckerberg decided that people are allowed to open groups under the following restrictions:      1) No two different groups can exactly the same participants.      2) The number of users in each group is even.      3) Every two group has an odd number of common users.      Denote by $m$ the maximal number of groups that can be formed in facebook under the restrictions mentioned above. Prove $m \leq n$.   I tried solving this by defined a matrix, multiplying it by its transpose and using some rank considerations I thought I could derive the bound, but I didn't succeed. Could you please give me a hint?  The question had anther subsection : prove that in the case that $n$ is even than we have stron inequality I would like to upload a file asynchronously with jQuery.     $(document).ready(function () {     $("#uploadbutton").click(function () {         var filename = $("#file").val();          $.ajax({             type: "POST",             url: "addFile.do",             enctype: 'multipart/form-data',             data: {                 file: filename             },             success: function () {                 alert("Data Uploaded: ");             }         });     }); }); &lt;script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/2.2.0/jquery.min.js"&gt;&lt;/script&gt; &lt;span&gt;File&lt;/span&gt; &lt;input type="file" id="file" name="file" size="10"/&gt; &lt;input id="uploadbutton" type="button" value="Upload"/&gt;     Instead of the file being uploaded, I am only getting the filename. What can I do to fix this problem? Showing just color ramp in legend without values Consider:  namespace WindowsApplication1 {     public partial class Form1 : Form     {         public Form1()         {             InitializeComponent();         }          private void button1_Click(object sender, EventArgs e)         {             //int[] val = { 0, 0};             int val;             if (textBox1.Text == "")             {                 MessageBox.Show("Input any no");             }             else             {                 val = Convert.ToInt32(textBox1.Text);                 Thread ot1 = new Thread(new ParameterizedThreadStart(SumData));                 ot1.Start(val);             }         }          private static void ReadData(object state)         {             System.Windows.Forms.Application.Run();         }          void setTextboxText(int result)         {             if (this.InvokeRequired)             {                 this.Invoke(new IntDelegate(SetTextboxTextSafe), new object[] { result });             }             else             {                 SetTextboxTextSafe(result);             }         }          void SetTextboxTextSafe(int result)         {             label1.Text = result.ToString();         }          private static void SumData(object state)         {             int result;             //int[] icount = (int[])state;             int icount = (int)state;              for (int i = icount; i &gt; 0; i--)             {                 result += i;                 System.Threading.Thread.Sleep(1000);             }             setTextboxText(result);         }          delegate void IntDelegate(int result);          private void button2_Click(object sender, EventArgs e)         {             Application.Exit();         }     } }   Why is this error occurring?     An object reference is required for the nonstatic field, method, or property 'WindowsApplication1.Form1.setTextboxText(int) I want to color sketches in Photoshop, but when I prepared the sketch (using Levels, Hue, and other modifications) to turn it into workable line art, some details were missing. I think it depends on how you draw your sketch.  What are important steps for drawing a sketch (with pen or pencil) that is to be colored in Photoshop? A step-by-step instruction would be appreciated.  For instance, here it is the sketch    This is after my preparations in Photoshop If $M^n$ is a compact topological manifold (not necessarily with additional structure), is there an upper bound on the number of charts needed to cover $M$ ? Does this bound depend on the dimension of $M$ ?  Thanks in advance...  Cheers