Without using arraylists, arraycopy, or any other imported method, but simply just using for loops and an additional array, how does one remove the first occurrence of a certain element?  this is my code so far:   public class remover { public static void main(String[] args) {      //initial array     int[] oldArray = {1,2,3,4};      //value to remove is 3       //define the new array with smaller size     int[] newArray = new int[oldArray.length];      //cycle through array     for(int i=0;i < oldArray.length;i++)      {         if(oldArray[i] == 3) {             for(int k=0; k<i; k++) {                 newArray[i] = oldArray[i];             }             for(int m=i; m<oldArray.length; m++) {                 newArray[m] = oldArray[m];             }           }      }   for(int i=0; i<oldArray.length; i++) { System.out.println(oldArray[i]); } } }

Given an array of n Objects, let's say it is an array of strings, and it has the following values:  foo[0] = "a"; foo[1] = "cc"; foo[2] = "a"; foo[3] = "dd";   What do I have to do to delete/remove all the strings/objects equal to "a" in the array?


If there is a simple pendulum in a non-accelerating frame with period $T_1$, it will have period $T_2 < T_1$ when placed in a frame accelerating perpendicularly to the direction of gravity. Why?

I have been looking for this for quite some time now. A simple pendulum behaves in SHM. Let's put that pendulum in an upward accelerating elevator. The component of the force that acts in SHM $(\text{mg}\sin\theta)$ still stays the same in my head.  However, websites and books tell me to use $m(g+a)\sin\theta$ where $a$ is the acceleration of the elevator.  I tried to look up Free Body Diagrams, but I can't find any for the case of accelerating frames. Can someone explicitly prove this without using the flimsy argument of "Think it's a noninertial frame with a new effective g"?


It seems like you're required to have an Indian identity card or something. Is it possible, if you don't have one, or must you use another site?

I've read that trains in India are very busy and its best to book in advance. So where is the best website to book online? I've found the site  and  - both of which seem to have a straight forward website, however I found loads of reviews that basically condemn them (i.e. )  The journeys I need to book for November are:  Delhi - Varanasi Varanasi - Agra Agra - Jodhpur Jodhpur - Jaipur  Is it best to book online? If not what's the best way of booking?


This question was marked as a duplicate of another, but I'm trying to ask a different question that is not addressed. Please keep reading.  The other question asks whether or not the Others can simply swim or sail around the wall. I argue this is a moot point, since by latitude and geography, I can't imagine the Bay of Ice doesn't simply freeze over in the winter. Is there any canon mention of this one way or the other?  If it does freeze, the Others could just walk south from the Frozen Shore to the Wolfswood and Deepwood Motte, completely bypassing both the wall and the mountains.

As explained in a  earlier , the Wall does not extend all the way to the sea on the East, and the castle there is essentially undefended anyway. Thus, wildlings -- and Stannis' army -- were able to go around it undetected.  We know that the Others and the wights they raise can't cross through the Wall, and I think we can assume that it's built to stand up to any attacks they make trying to bring it down. But there does not appear to be any reason they can't just go around like anyone else.  Possibly related: in the TV Show, we actually see the attempted evacuation of Hardhome, and the Night King allows Jon Snow and his human army and civilians to flee back to their boats to safety, even after raising a massive army of wights. You could interpret this as merely a psychological ploy, but it may be a hint that the dead can't cross the water either.  Has there been any indication (books or show) that the Others/White Walkers and their army of wights are blocked by open water, or are somehow tied to the land of the Frozen North, or that there's any other obstacle keeping them from just sailing/swimming around the Wall?


When I want to update:  W: Failed to fetch http://ppa.launchpad.net/osd-lyrics/ppa/ubuntu/dists/saucy/main/binary-amd64/Packages  404  Not Found  W: Failed to fetch http://ppa.launchpad.net/osd-lyrics/ppa/ubuntu/dists/saucy/main/binary-i386/Packages  404  Not Found  E: Some index files failed to download. They have been ignored, or old ones used instead.   Any idea?

PPA seems to be constantly offline. Whenever I use sudo apt-get update, this error is shown:  W: Failed to fetch http://ppa.launchpad.net/ 404  Not Found   How do I fix these errors?


I want my textbox to NOT suggest the old values (when clicked) entered in it before.

How do you disable autocomplete in the major browsers for a specific input (or form field)?


If R is a commutative ring with identity that has exactly three ideals 0, I and R. Show that if a  does not belong to the I then a is unit R.

A homework question from my algebra class asks:     Show that in a local ring $R$ with maximal ideal $M$, every element outside $M$ is a unit.   My argument is that since $M$ is maximal $R /M $ is a field and so for any $ x \in R \backslash M $, $ x + M $ has a multiplicative inverse, which implies $ x $ is a unit.  I don't see where we need the fact that $R$ is a local ring.


So I have a Person class derived from dict that contains details like first name, last name, and id.    I have the data loaded from a json file into object and instantiated person class per person in the json (about 30 people) and put them in a peopleList list in the following code:    import json  class Person(dict):     def __init__(self, firstname, lastname, personID):         super().__init__()         self.firstname = firstname         self.lastname = lastname         self.personID = personID  peopleList = []  with open('data.json', 'r') as peopleData:     dataObject = json.load(peopleData)      for registrant in dataObject['registrants']:         newperson = Person(registrant["firstname"], registrant["lastname"], registrant["personID"])          peopleList.append(newperson)     Now I'm trying write a function that takes the peopleList and criteria parameter.  This function will sort the list based in alphabetical order based on criteria (firstname, or lastname, or even ID)  Trying to use the peopleList.sort() menthod and failing hard with this.  Any input from you guys would be greatly appreciated here.  :)

I've got a list of Python objects that I'd like to sort by an attribute of the objects themselves.  The list looks like:  >>> ut [<Tag: 128>, <Tag: 2008>, <Tag: <>, <Tag: actionscript>, <Tag: addresses>,  <Tag: aes>, <Tag: ajax> ...]   Each object has a count:  >>> ut[1].count 1L   I need to sort the list by number of counts descending.  I've seen several methods for this, but I'm looking for best practice in Python.


Can there exist two (or more) different prime numbers, such that their roots added together equal a rational number?  This came up while trying to prove that two square roots, added together, can only equal an integer if perfect squares were used in the first place, but I realized I can't think of any instance where the sum of square roots would even be rational, unless those square roots were themselves integers. (Now, you don't know me, so you will have to take my word for it that me not being able to think of something does not, in fact, mean that it can not exist.)  Is there some kind of proof that two irrational numbers added together will never equal a rational number (other than cheating like $\pi + (1 - \pi)$)?

I need to find a way of proving that the square roots of a finite set    of different primes are linearly independent over the field of    rationals.    I've tried to solve the problem using elementary algebra  and also using the theory of field extensions, without success. To  prove linear independence of two primes is easy but then my problems  arise. I would be very thankful for an answer to this question.


Some days ago, I asked a  which got 4 down votes and further put on hold by mr.  citing the reason that it was too broad and answers would be apparently very long not suitable for this platform.   I tried to improve the question, and made it more specific and then I raised a flag. The flag was marked helpful but question didn't reopen.   I don't quite understand how will it reopen, I assume that some moderators will vote to reopen it, but why? I guess they don't have that much time.   What should I do now? One guy suggested me to delete my question but I have read that deleted post move towards an automatic ban.   Just locked, shocked and stuck. I would appreciate if anyone helps me out.

I flagged a post and (choose one)   my flag was marked as helpful, yet nothing was done my flag was marked as declined, yet the post was deleted/edited/closed   Why?


Let $b_1,b_2,...$ be a given sequence of real numbers. Denote $a_n(x)$ by the summation from 1 to n of $\frac{1}{4^k|x-b_k|}$. Define a function $f$ from $\Bbb R$ such that $f(x)=\lim a_n(x)$ if the limit exists, else $f(x)$ equals infinity. Prove the measure of the set of value $x$ such that $f(x)<1$ is infinite. I am stuck on this problem since at first, I could not see that the set the problem asked is even nonempty! How do we even show this set has an infinite measure. How do we proceed with this problem? This one was from a problem set about Egorov and Lusin theorem. Any help would be appreciated.

Consider the following problem from Axler's "Measure, integration and real analysis" (p72):  Honestly, I'm not even sure where to begin. This problem appears in the section that proves Lusin's and Egorov's theorem. The abstract Lebesgue integral is not yet introduced so I can not use that. Otherwise I could just show that the sum has finite integral and could conclude. I think we can write $f= \lim_k f_k$ as a pointwise limit of the partial sums but this probably does not quite help. Further attempt: I tried to show $$\{x: f(x) < 1\}$$ contains a set of infinite measure but was unsuccesful. A hint to get started is appreciated!


Problem 15 of the first chapter, Groups, in Hungerford's Algebra states  Let $G$ be a nonempty finite set with an associative binary operation such that for all $a, b, c \in G$ , $ab = ac \implies b = c$ and $ba = ca \implies b =c$ . Then G is a group. Show that this conclusion may be false if $G$ is infinite.  It can be deduced from this that the inverse and the identity element are unique, but I can not understand how to attack the problem to prove $G$ may not be a group if it is infinite. How to approach the problem?

Let $G$ be a finite, nonempty set with an operation $*$ such that   $G$ is closed under $*$ and $*$ is associative Given $a,b,c \in G$ with $a*b=a*c$, then $b=c$. Given $a,b,c \in G$ with $b*a=c*a$, then $b=c$.   I want to prove that $G$ is a group, but I don't know how to show that there exists an identity $e\in  G$ such that $e*x=x$ and $x*e=x$ $\forall x \in G$. I also don't know how to show that $\forall$ x $\in G$ there exists a $y \in G$ such that $y*x=e$ and $x*y=e$. How do I do this?


Accidentally I have the following issue:  typedef void VOID;  class Cls1 ｛ public:   VOID Clear(VOID); };   And the compiler (g++ 4.6.1) reported     error: 'anonymous' has incomplete type   error: 'invalid use of 'VOID {aka void}'   Is there a particular reason 'void' differ from 'VOID'?

I have the following code:  typedef void VOID; int f(void); int g(VOID);   which compiles just fine in C (using gcc 4.3.2 on Fedora 10). The same code compiled as C++ gives me the following error:  void.c:3: error: ‘<anonymous>’ has incomplete type void.c:3: error: invalid use of ‘VOID’   Now, this is something in external library and I would like the owner to fix that problem. So I have a question - does C++ standard forbids this construct? Could you give me a pointer/citation? The only thing I can recall is that function declaration with (void) to signal empty parameter list is deprecated in C++, but I don't understand why typedefed VOID does not work.


Suppose there is a space with constant magnetic field, and a charged particle is moving in that space with a constant velocity, ofcourse it experiences a magnetic force and gets deflected.  But the particle it not necessarily moving wrt all frames. There may be some frame for which the particle doesn't move at all but still gets deflected. How is this possible, there must be some velocity for the particle to experience any deflection under influence of a magnetic field? Also a still particle in the same space doesn't experience any deflection. True, but the same particle may be moving wrt to some other frame without experiencing a magnetic force, so here we have a velocity but no magnetic force case.  I remember I have used the relation $|F| = qv|B|$ a lot before, but I am afraid to use it any more, these things are really confusing.

I know that Lorentz force for a charge $q$, with velocity $\vec{v}$ in magnetic field $\vec{B}$ is given by  $$\vec{F} =q \vec{v} \times \vec{B}$$  but there will exist a frame of reference where observer move at same velocity with that of charge $q$, so according to him $v=0$. hence he will see no magnetic force is exerted on charge $q$. I have work on this problem for a while and found that the special relativity predicts equivalent electric force will acting upon charge instead. I want to know the relationship between this equivalent electric force and magnetic force.  Thanks in advance


I'm trying to understand in a practical/graphical view the derivative of $\sin(x)$ (that results in $\cos(x)$).  Is there any animation or illustration explaining that?

One of the first things ever taught in a differential calculus class:   The derivative of $\sin x$ is $\cos x$. The derivative of $\cos x$ is $-\sin x$.   This leads to a rather neat (and convenient?) chain of derivatives:   sin(x) cos(x) -sin(x) -cos(x) sin(x) ...   An analysis of the shape of their graphs confirms some points; for example, when $\sin x$ is at a maximum, $\cos x$ is zero and moving downwards; when $\cos x$  is at a maximum, $\sin x$ is zero and moving upwards.  But these "matching points" only work for multiples of $\pi/4$.  Let us move back towards the original definition(s) of sine and cosine:  At the most basic level, $\sin x$ is defined as -- for a right triangle with internal angle $x$ -- the length of the side opposite of the angle divided by the hypotenuse of the triangle.  To generalize this to the domain of all real numbers, $\sin x$ was then defined as the Y-coordinate of a point on the unit circle that is an angle $x$ from the positive X-axis.  The definition of $\cos x$ was then made the same way, but with adj/hyp and the X-coordinate, as we all know.  Is there anything about this basic definition that allows someone to look at these definitions, alone, and think, "Hey, the derivative of the sine function with respect to angle is the cosine function!"  That is, from the unit circle definition alone.  Or, even more amazingly, the right triangle definition alone.  Ignoring graphical analysis of their plot.  In essence, I am asking, essentially, "Intuitively why is the derivative of the sine the cosine?"


My laptop is supposed to have 6 GB ram but  it only detects 2 GB of it, so I don't know what to do.  I searched the web for answer and what i get that there's 2 possible problem:  1- That 4 GB ram card is broken and not working  2- or the 2 ram card have a different path so the windows chose the path of the smaller ram card which would be the 2 GB ram   I don't know what is the path in first place so I really don't know what to do.  How would I troubleshoot, and work out why the 4 GB stick is not being detected?  My laptop's specifications are as follows:  Windows 7 Home premium 64- bit Operating system   processor : intel (R) core(TM) i7 CPU   Q740 @1.73 GHz 1.73GHz  installed memory(RAM) : 2.00 GB  (but it suppose to be 6 GB -_- )   My laptop is Dell and it's Model N5010

Is there anything I can do to see what happened to it? Is there a chance it came loose? How can I check if it's fried?  Edit: nobody stole my RAM. I didn't physically do anything to it. I have a Dell Studio Laptop. I'm running 64-bit Windows 7. I don't know exactly what else to specify, I'm not familiar with dealing with RAM.  Update:    I ran a MemTest but it did nothing except confirm that I had 2 gigs of RAM that worked.   I opened the laptop and took out the 2 GB module, putting the 4 gig module in its place. I powered up the laptop, and it reported 4 GB.  Then I put the 2 GB module in the old 4 gig slot, powered up, and the laptop reported 6 GB.    The short story is that I don't know what the problem was, but it's no longer manifesting itself. Don't buy Dell.


Question I would like to see how the machine learning algorithms (models) used in a paper could affect the citation count the paper receives (suppose all papers considered are published at about the same time). More specifically, I have a dataset that looks like following id model citation count   1  SVM             10   2 LSTM              5   3 GBDT              0   4  HMM              2   5  SVM              4 ...  them is it possible to see how the third column is influenced by the second column? There are two naive thoughts  Encode the model name with 1, 2, 3, etc, and use Pearson correlation. Plot the distribution of model name count and citation count respectively, and measure the difference of two distributions using JS divergence or KS divergence. However, in my example, "SVM" will have a high model name count and therefore higher citation count, then the result might not make sense.  Could someone provide pointers to my problem? Thank you in advance!

What's a meaningful "correlation" measure to study the relation between the such two types of variables?  In R, how to do it?


I have two lists in python list_a and list_b. The list_a have some images links, and the list_b too. 99% of the items are the same, but i have to know this 1%. The all surplus items are in list_a, that means all items in list_b are in list_a. My initial idea is subtract all items: list_a - list_b = list_c, where the list_c are my surplus items. My code is:  list_a = [] list_b = [] list_c = []  arq_b = open('list_b.txt','r') for b in arq_b:     list_b.append(b)  arq_a = open('list_a.txt','r') for a in arq_a:     if a not in arq_b:         list_c.append(a)  arq_c = open('list_c.txt','w') for c in list_c:     arq_c.write(c)   I think the logic is right, if i have some items, the code is run fast. But i dont have 10 items, or 1.000, or even 100.000. I have 78.514.022 items in my list_b.txt and 78.616.777 in my list list_a.txt. I dont't know the cost of this expression: if a not in arq_b. But if i execute this code, i think wont finish in this year.  My pc have 8GB, and i allocate 15gb for swap to not explode my RAM.  My question is, there's another way to make this operation more efficiently(Faster)?   The list_a is ordinate but the list_b not. Each item have this size: images/00000cd9fc6ae2fe9ec4bbdb2bf27318f2babc00.png The order doesnt matter, i want know the surplus.

Right now I have vector3 values represented as lists. is there a way to subtract 2 of these like vector3 values, like  [2,2,2] - [1,1,1] = [1,1,1]   Should I use tuples?  If none of them defines these operands on these types, can I define it instead?  If not, should I create a new vector3 class?


Dim oXL As Object         Dim oWB As Object         Dim oSheet As Object         ' Start Excel and get Application object.         oXL = CreateObject("Excel.Application")         oXL.Visible = True         ' Get a new workbook.         oWB = oXL.Workbooks.Add         oSheet = oWB.ActiveSheet         .........         oXL.Quit()         oWB = Nothing         oXL = Nothing         oSheet = Nothing   I can see the application opened in task manager ... Why ?

I'm using the Excel interop in C# (ApplicationClass) and have placed the following code in my finally clause:  while (System.Runtime.InteropServices.Marshal.ReleaseComObject(excelSheet) != 0) { } excelSheet = null; GC.Collect(); GC.WaitForPendingFinalizers();   Although this kind of works, the Excel.exe process is still in the background even after I close Excel. It is only released once my application is manually closed.  What am I doing wrong, or is there an alternative to ensure interop objects are properly disposed of?


I live in Austria and I am a student in computer science and there is a specific thing that drives me bonkers: Every time when a person in my vicinity or I am conversing with is mentioning the product "Microsoft Azure", they pronounce the word Azure /ˈeɪʒə/ (like Asia) or /ˈeʃə/ (like pressure without the initial pr). What is so odd is that not only users of this product or students pronounce it that way, but also representatives from MS who promote this product. So far the representatives I have met have all been non-native English speakers, though. Sometimes I have corrected the person in such a conversation and telling them it is pronounced /ˈazjʊə/ (like sure with an a the beginning and replacing the s with a zh sound. , a commonly used online dictionary. The primary proof I bring forward however in such a case is the song , in which the word azure is pronounced /azjʊə/ like I mentioned. My question is: Am I right that everyone who pronounces the name Azure like Asia or essure pronounces it incorrectly, or have I missed anything when learning the English language and I am just plain stupid? Or does the Microsoft product have a different pronunciation to the regular word azure?

This is not a techie query. I am just unclear on how to pronounce the word "Azure" which is the brand name for Microsoft's cloud computing service.


Let $(M,g)$ be a 3-dimensional Riemannian manifold and $\Sigma\subset M$ a closed surface. Is it equivalent to say:  1) $\Sigma$ is minimal, i.e. its mean curvature identically vanishes;  2) $\Sigma$ is a local minimizer for the area functional?  Does a characterization for minimal surface exists?

Let $\Omega\subset\mathbb{R}^2$ be an open subset such that $\partial\Omega$ is a closed, simple curve.   I'm trying to find an example of an $u:\overline{\Omega}\to\mathbb{R}$ such that $\Sigma:=\text{graph}(u)$ is a minimal surface and, yet, there exists another minimal surface $\Sigma'$ with $\partial\Sigma'=\partial\Sigma$ and $\text{Area}(\Sigma')<\text{Area}(\Sigma)$.  Does such an example exist?


This is something I've wondered about for a while now; What is so special about normal subgroups that makes modding out by them "act nice"?  I understand the proofs for things like the first isomorphism theorem, but all these proofs really seem to do is verify that we can mod out by any sub-group satisfying $gNg^{-1} = N$ and end up with another group. I get the verification; that's not what I'm asking about.  It's possible to mod out by any subgroup, but what's so special about the property $gNg^{-1} = N$ that makes it so that we can "move" $N$ around inside $G$ in a way that satisfies the group axioms? Is there something deeper about the normality property that makes this make sense?

Let $G \in \mathbf{Grp}$, $H \leq G$, $G/H := \lbrace gH: g \in G \rbrace$. We can then introduce group operation on $G/H$ as $(xH)*(yH) := (x*y)H$, so that $G/H$ becomes a quotient group when $H$ is a normal subgroup. But why do we only work with quotient groups by normal subgroups? If we introduce the notion of left quotient group in the above manner, how much good properties of a quotient group do we lose?


I want to find the last two digits of $9^{9^9}$ or $9^{81}$. I tried using Euler's theorem but I can't make anything of it. Any hint or a guide? Thanks!

I tried to calculate the last two digits of $9^{9^9}$ using Euler's Totient theorem, what I got is that it is same as the last two digits of $9^9$.   How do I proceed further?


The following was taken from Stephen Friedberg's Linear Algebra, 2nd Edition.  Let $A$ be a $m \times n$ matrix, $B$ and $C$ be $n \times p$ matrices.  Show that $A(B+C) = AB + BC$ and, for any $k \in F$, $k(AB) = (kA)B = A(kB)$.  Proof:  $[ A(B+C) ]_{ij} = \sum_{i=1}^n A_{ik}(B+C)_{kj}$  $= \sum_{i=1}^n A_{ik}B_{kj} + \sum_{i=1}^n A_{ik}C_{kj} = (AB)_{ij} + (BC)_{ij} = [AB + BC]_{ij}$  I did the second part myself:  We have $[k(AB)]_{ij} = k \sum_{i=1}^n A_{ik}B_{kj}$  $ = \sum_{i=1}^n kA_{ik}B_{kj} = \sum_{i=1}^n (kA)_{ik}B_{kj}$  $ = \sum_{i=1}^n A_{ik}kB_{kj} = \sum_{i=1}^n A_{ik}(kB)_{kj}$  As a result, $k(AB) = (kA)B = A(kB)$.  I noticed that the proof used the definition of matrix addition and scalar multiplication.  $(B+C)_{ij} = B_{ij} + C_{ij}$ and $(kA)_{ij} = k(A)_{ij}$.  Now is it possible to prove without the definitions?  I became curious because Mr. Friedberg introduced the matrix as a representation of a linear transformation over an ordered basis.  So, I tried proving via the linear transformation over an ordered basis and could not do it.  For example:  Let $\alpha = \{x_1, x_2 ... x_n\}$ be an ordered basis of $V, \gamma = \{z_1, z_2 ... z_m\}$ be an ordered basis of $W$,  and $T: V \rightarrow W$ be a linear transformation.  Elsewhere, Mr. Friedberg already defined that $(kT)(x_j) = kT(x_j)$.  Suppose that $A$ is the matrix representation of $T$.  $k(A) = k *[ \space T(x_1) \space T(x_2) \space ... \space T(x_n) \space ] = [\space kT(x_1) \space kT(x_2) \space ... \space kT(x_n) \space ] = [ \space (kT)(x_1) \space (kT)(x_2) \space ... \space (kT)(x_n) \space]$  But this is possible only because of the definition of scalar multiplication.

If $A,B,C$ are matrices I am thinking how to show that $$ A(B + C) = AB + AC$$  Is possible to show without sums like $\sum_i a_i, ..., \sum_j b_j$? It seems if I do the proof with many indexes then is tedious and I don't learn much from it.


There is a set of segments. and I want to calculate the area of the largest polygon which can be build using these segments.  I try to search it, but I can't find anything.  thanks

Given the length of the sides of an irregular polygon (no coordinates provided) how do you compute the area of the maximum area of the polygon?   Thanks in advance


I need help understanding what they ask of me. This is my second refusal in a month. Let me give you the background story to the whole process.  Last April 2017, after visiting Thailand with my then friend, we decided to date exclusively and for me to visit him on July that year. I applied for a UK visa and put my newly acquired boyfriend as my sponsor but stated that he was a family friend instead, as we are a homosexual couple and I was quite apprehensive that stating or labelling ourselves as a homosexual couple would hinder the chances of granting a visa. Another reason is that I had only turned 18 a few months prior to the UK visa application in 2017.  As I recall, I only submitted my school transcripts, passport copies of my own and my boyfriend's, bank statements of each of ours and his letter of invitation. I got the UK visit visa but unfortunately did not travel due to personal commitments with the University.  My first refused visa application (letter not found) mentioned I failed to meet requirements of Appendix V paragraph V4.2 a) and c) and states that I heavily relied on my sponsor (boyfriend) and did not have funds of my own as well as not providing enough ties that convince my return to the country of my residence.   Now, my boyfriend ("partner" as per application) and I are persistent that I visit him in his home in Wales from 18th July 2018 to 29th August 2018. We bought a round-trip ticket. I declared that I had GBP 1,000 in my account for my personal expenses with my bank statement as evidence, my boyfriend's willingness to pay of GBP400 for my trip and also added my mum as another payee, who woule be funding GBP 1,050 for my trip (I thought this would make a stronger base for my app.).  I declared in my application that I would be expecting to spend around GBP 500-600 in expenses (excluding the round-trip tickets back home). I mentioned that we we're on a long-distance relationship and we traveled to a country in Asia to meet instead of our own country homes).  For my accommodation, I mentioned that I would be staying at my partner/boyfriend's rented house in Wales. For my visit purpose I stated that I planned to visit a University campus as a prospect student l, as it is an associated university of the college I am currently studying in and I am able to top-up my degree to a bachelor's in this Welsh university. Another reason is the obvious visit for my partner, as we haven't seen each other in a year (duration not stated in application), as well as visit local tourist, cultural and historical attractions, and visit his friends and family.  I have submitted my previous employment contracts, and my 2 current employments (my bosses aren't keen on stating until I have to work for them, as I am employed only part-time in both establishments. They only state my starting date until PRESENT), my current payslips, my identity card that mentions permanent residency in my country of residence (other than my nationality), and birth certificate that ties me to my mum, who is also living with me, my proof of address via letters from schools and other government bodies, and a school tcertificate that states I am an enrolled student in their campus for the year 2018 - 2019. These are the documents I have submitted to prove I have ties to my country of residency and must return by the end of my trip.  What can I do to get approval on my next application? How can I prove my relationship with my boyfriend?  Please assist. Should there be any more queries or should you require further information about my application, please comment below and I will answer promptly. Your help is highly appreciated.

Many of the UK visa refusals we see here share a common pattern and the prevailing reasons refer to V 4.2 (a) and (c).    I do understand that, while the applicants may describe very different individual circumstances, there's a consistent pattern and, broadly, fall into specific categories:    Credibility (lifestyle, lack of ties, visit history, lies & omissions) Funding (insufficient funds, provenance of funds, funds parking) Sponsorship (family, friends, employer)   Question: What most commonly triggers a UK visa refusal where V 4.2 (a) and (c) are given as the grounds?  Secondarily: Given that there is a clear pattern, to what extent are these refusals predictable? Does sponsorship make a difference? Is there a set of personal circumstances, however abstract, where a refusal is all but guaranteed? For example, why do those we see here on TSE who sought entry for the PLAB or British Army appear to be refused with a common theme? Is there a uniform shortcoming or is it just discrimination?   PLAB: What is about applications for a visa, for the purpose of sitting the Professional and Linguistic Assessments Board (PLAB) exam, that seem to invite refusals. After all, the test is given so that international medical graduates can show that they qualify to practise medicine in the UK. The first part, PLAB 1, can be taken in centres outside of the UK. However, PLAB 2 can be taken only in the UK. Why can't you can't get a visa just to sit the exam, promising that you'll leave immediately after?    British Army: Since Commonwealth citizens are eligible to apply online to join, even those who don't reside in the UK, why is it so difficult to get a visa just to attend an interview to see whether you are suitable? Even with an invitation from the Army, such visa applications seem to be unsuccessful. Isn't a career in the British Army a valid reason?     Lastly:  After such a refusal, what approaches would increase the chance of a successful application?


and make a singly linked list while looping? like so:  def make_nodes(n):     head_node = Node(0,None)     for i in range(1,n):         node("i") = Node(i, None)         #somehow link them    so that the nodes will be named: node1 node2 node3 ... node9  Many thanks in advance!

What's the easiest way to use a linked list in python? In scheme, a linked list is defined simply by '(1 2 3 4 5). Python's lists, [1, 2, 3, 4, 5], and tuples, (1, 2, 3, 4, 5), are not, in fact, linked lists, and linked lists have some nice properties such as constant-time concatenation, and being able to reference separate parts of them. Make them immutable and they are really easy to work with!


I just recently encountered this problem in c++  std::cout << -5.0000004768371582 + 5 << "\n";   This will print -4.76837e-007 even though you would think it would print something like 0.000000476... I know floating points aren't always correct, but I've never seen this before. I've also seen this happen with other numbers.  Why is this. And how could I fix it?

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


As can be seen in the image here with, yellow O in  the google not rendering correctly. Similar image rendering issue happen with other sites also.  How do I further debug this  or solve this ?

I've strange blue borders around images on google chrome see for your self


If the answer is no, could someone give a simple counterexample? Thank you!

It is a common practice to apply PCA (principal component analysis) before a clustering algorithm (such as k-means). It is believed that it improves the clustering results in practice (noise reduction).   However I am interested in a comparative and in-depth study of the relationship between PCA and k-means. For example, Chris Ding and Xiaofeng He, 2004,  showed that "principal components are the continuous solutions to the discrete cluster membership indicators for K-means clustering". However, I have hard time understanding this paper, and Wikipedia actually .  Also, the results of the two methods are somewhat different in the sense that PCA helps to reduce the number of "features" while preserving the variance, whereas clustering reduces the number of "data-points" by summarizing several points by their expectations/means (in the case of k-means). So if the dataset consists in $N$ points with $T$ features each, PCA aims at compressing the $T$ features whereas clustering aims at compressing the $N$ data-points.  I am looking for a layman explanation of the relations between these two techniques + some more technical papers relating the two techniques.


The story describes the society of the species in question and how advanced they are in subjects such as mathematics, but toward the end of the story, it is revealed that      they are a cattle-like species who have no oppose-able thumbs, no arms and no manual dexterity whatsoever. They advance their ideas purely by visualizing and then verbally describing everything to others. Later they enlist the help of a lesser advanced, ape like species to perform manual labor.

This book is pretty unique. It's about a planet only populated with intelligent horses who have domesticated their humans, because they have hands (horses don't have them). The whole time reading you expect some connection to our times, or our universe, but this book was very brave and didn't go for that cheap thrill like Planet of the Apes.  There simply aren't any humans in it, at all. John Campbell would never have bought this story/novel.  I know of no other SF book about intelligent animals that lacks all reference to Earth, humans, or our universe whatsoever. It's one of the most alienating books I've ever read.  It is not:   Gulliver's Travels. VAMPIRES IN THE LEMON GROVE The Island of Dr. Moreau Josepha Sherman's story "The Case of the Purloined L'isitek or written by a very well-known author (I think).    It's more SF than fantasy, because it's on a different planet. But it's not hard SF.  It's also pretty old. Certainly before the 90s (perhaps even before the 80s). My guess is it's between 1940-1980.


Can I use these pronouns as a reaction immediately after something was said or happened, in order to express my opinion?        This is/was amazing.   That is/was amazing.   It is/was amazing.      And by the way, is it more appropriate to use "This" when using a noun instead of an adjective?For instance "This is madness" compared to "That's crazy".

Learning and using English I'm always confused about what word to use for referring to things that have been described by me a few sentences earlier: "that" or "this".   Confusion comes from the fact that only the equivalent of "this" is always used in my native language for such referring. But I've noticed that in English for such referring "that" is used as often as "this" (or maybe even more often).  Some examples for illustrating (just tried to google something appropriate to convey my idea better):     We assess local... the demographics of the local population. What are the natural traffic drivers in the area. Things like cinemas and pubs and retail and office and all that type of things and we now put together a bit of a matrix and actually give a weighted score to each of the things we know help our business. That helps us decide in a more scientific fashion.   or:     The problem of Cervantes' origin became after that into a tough matter. Some experts believed that the Cervantes from Alcázar, in the times of the Lepanto Battle, was in the age of a child, more concerned about gathering nests and that type of things than about fighting as a soldier.   and for "this":     I believe lot of people who involved fishery industries in Mexico Gulf are suffering now but as for economic issues, U.S government and other countries will support them and give an utmost response to it. Important thing is that we learn from this mistake and make sure this type of things will never happen in the future and protect nature environment thus we have to take this technology to get energy from water very seriously. I really hope this technology will be available and used for everybody as soon as possible.   Is there a rule describing proper usage of these words in cases like this? (or should I have written "..in cases like that"?)


I know that APS-C is many times bigger than 1 inch and it dramatically effects shallow depth of field. But I was wondering if I'll shoot night city for example with same aperture and ISO setting on both 1 inch and APS-C would 1 inch sensor shot look underexposed?

Let's say I have a micro-4/3rd camera and a full frame camera, both set to 1/60 at f/2.8, taking a picture of the same scene in the same lighting. Will the exposure be the same across both cameras despite the different sensor sizes?  The reason why I'm asking is because of the difference in depth of field between micro-4/3 and full frame sensors. I'm finding that, in order to take a picture of certain scenes with the full frame camera at the same depth of field as the micro-4/3rd camera, I have to increase the aperture, which in turn forces me to crank up the ISO.


I was working on a small Integration problem, where i was needed to solve another integral:  $$I= \int_0^{\pi} \frac{1}{1+\cos^2x} dx $$  Working:  $$\int_0^{\pi} \frac{1}{1+\cos^2x} dx=\int_0^{\pi} \frac{\sec^2x}{\sec^2x+1} dx$$ $$=\int_0^{\pi} \frac{\sec^2x}{2+\tan^2x} dx$$  Substituting, $\tan x=t, \sec^2x dx=dt$  $$\implies \frac{\sec^2x}{2+\tan^2x}dx=\frac{dt}{2+t^2}$$ which gives us $$I= \left[       \begin{array}{cc|c}{\frac{1}{\sqrt2}\tan^{-1}\frac{\tan x}{\sqrt2}}       \end{array}     \right]_0^\pi$$ I think the answer should be zero. After seeing the answer at , i think i am doing a serious mistake. Ay help will be appreciated.

The following integral can be obtained using the :   $$\int \frac{dx}{1+\cos^2 x} = \frac{\tan^{-1}(\frac{\tan x}{\sqrt{2}})}{\sqrt{2}}$$  Now assume we are performing this integration between $0$ and $2\pi$. Hence the result of the integration is zero.  On the other hand when looking at the integrand, $\displaystyle \frac{1}{1+\cos^2 x}$, we see that it is a periodic function that is never negative. The fact that it is never negative guarantees that the result of the integration will never be zero (i.e., intuitively there is a positive area under the curve).  What is going on here?


I have 2 hdds in my computer in first hdd I have windows. In second I have partition D and E. How can I install Ubuntu on my second hdd without affecting windows partitions?

I have 2 1tb hard drives on my computer with Windows 8 on the first hard drive and nothing on the other.  I want to install Ubuntu 14 on the second hard drive. I've looked up some guides and they all say to install Ubuntu on the sdb partition when booting off a usb stick. I have also seen some say to unplug the Windows HDD and then install Ubuntu onto the second HDD, and Ubuntu will automatically detect Windows and ask what you want to boot into upon boot.   I am really concerned about this - Will it ask me to choose what OS I want to boot into? Is there something like rEFInd(Mac) for Windows? Can anyone please give me a guide on how to do it without ruining my computer?  Thanks


I want my custom boxes to use the same counter as my theorems. I took a look in the tcbox manual and tried various things like "use counter from=theorem" and so on but probably it doesn't work like this:  This is a mwe of the above picture. : \documentclass{article} \usepackage[most]{tcolorbox} \tcbuselibrary{breakable} \usepackage{fontawesome}  %Theorems  \newtheorem{theorem}{Theorem}[section] \newtheorem{definition}[theorem]{Definition}  % Boxes  \newtcolorbox[auto counter,number within=section]{abox}[2][]{%     colback=green!5!white,colframe=green!50!black,     enhanced,     colbacktitle=green!50!black,      attach boxed title to top left={xshift=0.5cm,yshift=-2mm},     fonttitle=\bfseries,     title=\faPencil\ Exercise~\thetcbcounter: #2,#1}  \newtcolorbox[auto counter,number within=section]{bbox}[2][]{%     colback=blue!5!white,     enhanced,     colframe=blue!50!black,     colbacktitle=blue!50!black,      attach boxed title to top left={xshift=0.5cm,yshift=-2mm},     fonttitle=\bfseries,     title=\faPaperclip\ Example~\thetcbcounter #2,#1}    \begin{document}  \section{Section 1}      \begin{theorem} Hello, I am a theorem.     \end{theorem}    This is some random text.     \begin{definition} Let $A$ blabla     \end{definition}              \begin{abox}{Differential Equations} This exercise should have the counter 1.3 \end{abox}      \section{Section 2}      \begin{definition} asdf \end{definition}     \begin{bbox}{} This example should have the counter 2.2 \end{bbox} \end{document}

I want to use this code below to define theorems style:  \tcbuselibrary{theorems}  \newtcbtheorem[number within = section]{mytheorem}{\emph{Teorema}} {colback = blue!10, colframe = blue!50!black, fonttitle = \bfseries}{th}   I'm having problems to numbering it with the other environments, like definition for example. I tried to define a "ghost" counter  \newcounter{count} \numberwithin{count}{section} \theoremstyle{definition}        \newtheorem{definition}[count]{\protect\definitionname}   So just change number within = section for number within = count .  It almost work, but now theorems are numbered like "1.2.1",  "1.3.1" and so on while definitions (and others) are numbered like "1.2" "1.3" ...   How can I fix this?  Edit: Here's the code used in my initial problem  \documentclass[11pt]{article}   \usepackage[most]{tcolorbox}             %tcolorbox para caixas. \usepackage{amsmath} \usepackage{amsthm}  \newcounter{count} \numberwithin{count}{section}  \tcbuselibrary{theorems}  \newtcbtheorem[number within = count]{teo}{\emph{Teorema}} {colback = blue!10, colframe = blue!50!black, fonttitle = \bfseries}{th}  \theoremstyle{definition}           % use "definition-style" font for the rest. \newtheorem{definition}[count]{\protect\definitionname} \providecommand{\definitionname}{Def}  \title{Test document}  \makeindex \begin{document} \maketitle     \tableofcontents \section{Test section 1}  Here is the section  \begin{definition} Test definition. 1 \end{definition}  \begin{teo}{Teo 1}{} Test theorem. 1 \end{teo}  \section{Test section 2}  Here is the section  2 \begin{definition} Test definition. 2 \end{definition}  \begin{teo}{Teo 2}{} Test theorem. 2 \end{teo}  \end{document}


I've been playing around with  for building things in Terraria and was wondering what are the stacking categories, for example fallen stars stack up to 99 and dirt stacks up to 999. Is there a certain category that stacks a certain way? What items stack at 99 and what items stack at 999?

I want to know how much a stack in Terraria is. I am able to get over at least 200 blocks, but I don't know how much more. I want to know because I am going around trying to get a ton of stone blocks for a big building. I want to know that if a stacks real high, I won't need that many.


My country of origin is India. I want my parents to pay me a visit in Canada. I am a permanent resident here.  Problem:  My father is a self-employed businessman and so I'm not sure about the documents about his business. From what I have googled they say you should give reasons why you want to go back.  His annual income as per ITR is 550,000 rupees.  He doesn't have a business registration as it's a small business. But he has a website, trademark information, enough bank balance, a current account etc.  My mother is also self-employed but she has a boutique and again she doesn't have any business registration or any solid proof. Her annual income as per ITR is 500,000 rupees.  Worst part: My parents already have 2 USA rejections in their history of tourist visas.  So, can anyone suggest something? I don't want them to face another rejection because I want them to come here.

How can I prove the immigrant officers that I have significant ties in my home country?  Are there any documents that I need?


Define $a_{0} = 1$ and $a_{n + 1} = \sqrt{1 + a_{0}}$.   Then we have  $$\lim_{n\to\infty} a_{n} = \sqrt{1 + \sqrt{1 + \sqrt{1 + \sqrt{1 + \ldots }}}} $$  So I let $x = \sqrt{1 + \sqrt{ 1 + \ldots }}$. Then we have  $$x =  \sqrt{1 + x}  \Longleftrightarrow x = \frac{1 \pm \sqrt{5}}{2}.$$  So I think it converges to the golden ratio. But how can I prove this? Clearly, it's monotone increasing. Now I can just show the golden ratio is a supremum for the sequence. But how can I do that? (Monotone Convergence Theorem)

I have the following exercise: Let $S_1$ = 1  and for $n \geq 1$  let $S_{n+1} = \sqrt{S_n + 1}$. Prove that the limit of this sequence is $\frac{1}{2}(1 + \sqrt{5})$


I have an Ubuntu server (named vader) running in my house that I would like to set up SFTP connections with my Mac (named MacbookBro).   From vader, when I run:     sftp mourkeer@MacbookBro.local   It connects just fine. However, from MacbookBro (or any other machine), if I run:     sftp mourkeer@vader.local   My entire LAN crashes, and I have to reboot the router.  So my Ubuntu machine can send SFTP requests, but it can't receive them. FTP, SCP, and most importantly, SSH all work to/from either machine. What could be causing my network to crash? I'm assuming it's some sort of time out, and my router just sucks. But that doesn't explain why the issue is happening to begin with.  Vader is connected by ethernet to my Linksys E2500 router. MacbookBro is connected wirelessly. I was running Ubuntu 13.10 before, but I fruitlessly upgraded to 14.04 hoping that might fix the problem.

I'm having a problem transferring files between my Ubuntu server and other machines with FTP.  Basically, if I initiate an FTP request from my Ubuntu to my Mac, it works fine. But if I make a request from my Mac to my ubuntu machine, the entire LAN crashes, and I have to reboot the router to fix it. I have experimented with what triggers this. FTP from my Ubuntu to other machines works. FTP from my Mac to other machines works. But any FTP request to my Ubuntu from any machine crashes the network.   To sum it up, if my Ubuntu receives an FTP request, my network dies, but it can initiate them just fine.   Even more, if I make a git pull request from my Ubuntu repo, the network crashes. But Ubuntu can push/pull just fine to/from my Mac. I've already been told this is likely a router issue, and I'm fine with accepting that. However, it's just odd that the issue surrounds my Ubuntu, and only when receiving FTP connections. so I'm asking if there is something that could be wrong with the machine, instead of the router.  I have even upgraded to Ubuntu 14.04.1 to see if there was some outdated package, but the problem persists.  I'm completely at a loss with what detail specs to offer, so if any other info is need, let me know.  I am using a Linksys E2500 router. It's about a year old, and I've never had issues with these routers before.  UPDATE:  After some more tinkering, I realized that FTP works fine. SFTP is what is crashing my network. I have openssh-server installed already, so I'm wondering if there is some other package that needs to be setup to allow the Ubuntu server to receive SFTP connections.  Since this problem appears not to match the original stated, I made a new thread:


I found, that some faces are blinking (like Moire effect) while rotating in preview.  Is this normal?  Reboot didn't help. Blender version is 2.76  OS is Windows 10 prof.  Video is GeForce GTX 770.  Sample:   UPDATE  The following message appears upon start:    (AL lib: (EE) UpdateDeviceParams: Failed to set 44100hz, got 48000hz instead)  UPDATE  I found it is the problem of my model, since it affects only half of it:    I was extruding circle and the split is located exactly where I started. I.e., right half was extruded from the circle to the right, and the left half was extruded from the left vertices to the left.  Also I noticed extruding behavior changed when I was doing this:

When I extruded vertices in edit mode, for some reason one of the sides of my 3-D model (the textured-looking side to the right) is creating a lot of errors. First off, it automatically sets extrusions on the x-axis. Secondly, it doesn't allow me to extrude planes into 3-D shapes. Thirdly, I can't increase the height of vertices without it creating a new face. Finally, it renders those automatic textures to create a grainy black texture in render mode. I attached an image with the solid object (top) and the rendered object (bottom). Note: I did not set any textures or alter the lighting on the model. Also, the left gray side is working perfectly fine without errors.


In my LATEX document, I would like to have the following graph:  Is there a way I can put these colors next to the vertices without the vertex numbers disappear? I don't want to use online drawing tools..

I feel intimidated in learning TikZ. I was wondering if there are some nice materials (or just your replies) at different level:   for providing big picture, which is important to beginners to not lose direction during learning. for comprehensive reference.   Examples are important, but only examples are not always clear for understanding the big picture and organization.


A number of websites that I use have really bad stylesheets for the print media, but their screen stylesheets are quite good.  Is there any way to tell my browser to ignore the print stylesheet and just print with the screen stylesheet?  I’d also like to do this when I want to show clients the difference between the two.

is it possible to ask a browser to print using the screen CSS rather than the print CSS?


I have just successfully installed a driver (athk9_htc) for TP-Link TL-WN722N (a USB WiFi adaptor) in Ubuntu 14.04.1. My goal is to capture the WiFi traffic with Wireshark.  I try to configure the adaptor to monitor mode by running: sudo iwconfig wlan1 mode monitor However it give me an error message:  Error for wireless request "Set Mode" (8B06):     SET failed on device wlan1; Device or resource busy.   How can I set it to monitor mode?  Edited: I do not agree this is a duplicated question. Actually I have found that thread before I asked this question. However there are two responses in that thread, but not any verified answer. If I do not ask this question again, how can I get the answer? Also the answer given by @chili555 is different to the responses in that thread, and I verified this answer is working. If the question is duplicated, should not it be adding a comment in that thread to indicate that a verified answer is here, instead of indicating an answered question is a duplicated question?

I need to sniff all the wifi traffic that I can capture using wireshark in Ubuntu. My wireless interface is named as eth1 in the interfaces list. When I select that interface in Wireshark and start new sniff, I got following error;    As  thread says, I tried to installed the mentioned driver but I got an error in installation saying that that driver is not supported by my device. After that I tried the second answer in the same thread and run following command to enable monitor mode in my wireless card.  echo 1 > /proc/brcm_monitor0   Then I saw a new Ethernet interface (not a wireless interface ) called prism0 in wireshark interface list. I couldn't start a sniff using that interface using monitor mode because in that interface settings, monitor mode check box has been disabled.  I have installed a broadcom wireless driver in Additional Drivers as follows:    Is there an error listing my Wifi interface as eth1 rather than wlan0 in the interfaces list? How can I start my wireless interface in monitor mode for sniffing?   Thank you.


I want to learn measures of possibility but first I need to learn Fuzzy Set/Logic, some book/material recommendations for beginners?

I want to study Fuzzy Sets and Fuzzy logic self. For that what would be better book to start from basic?


Basically i entered a wrong command on one of my most important cpanel server chmod -R 777 / And all the folders and files are changed to 777 permission and all the services like phpmyadmin and mail services has been stop no idea due to high permission. Can anyone suggest that how i can restore the permission of each files and folder to the default one.

I was trying to run chmod -R 777 ./ but ended up typing chmod -R 777 / and set 777 on my entire machine. What can go wrong? How can I fix it?


Today I stumbled over a C riddle that got a new surprise for me.  I didn't think that -1[p] in the example below would compile, but it did. In fact, x ends up to be -3.      int x;     int array[] = {1, 2, 3};     int *p = &array[1];     x = -1[p]   I searched the internet for something like -1[pointer] but couldn't find anything. Okay, it is difficult to enter the correct search query, I admit. Who knows why -1[p] compiles and X becomes -3?

As Joel points out in , in  (aka: K & R), there is mention of this property of arrays in C: a[5] == 5[a]  Joel says that it's because of pointer arithmetic but I still don't understand. Why does a[5] == 5[a]?


Currently it only show 4 possible autocompletes when I'm typing something in the search box, does anyone know how to increase that?  This is for Windows 10.

Is it possible to have more items in the Google autocomplete suggestions as you type?


I was watching a Person of Interest episode a few weeks ago.  I noticed that the main star, Michael Emerson (who plays Harold Finch) was credited in the "With" part of the Starring credits.  Also, despite being in most of the season, John Nolan was credited as Guest Starring, as was Julian Ovenden, despite them being series regulars.  On Supergirl, despite being a series regular, Jenna Dewan Tatum gets Special Guest Star billing even though she has been in most of the episodes.  On The Catch, Elena Rusconi and Jamie Van Dyke (a woman, like Jamie Lee Curtis) were credited as Guest Starring despite being series regulars in the show.  How is this decided with the credits who gets to be in With/And Starring, Special Guest Star, Guest Starring?  If a show had 23 actors in it as regular characters [like the British show Casualty, Doctors have large casts] and they were in it nearly every episode [about 90-95% of the time] how do you think they would credit the actors? This hypothetical show would be a crime drama of sorts, like CSI or The Catch.  50% starring, 50% guest stars, or some other means?   Also, do some actors not named in opening credits, but who are main characters/integral to the show, just get shafted to the end credits if they can't fit them in the opening credits?  What shows have the longest list of Starring, And Starring etc.  Is it decided based on the actor's level of fame or some other way, is it arbitrary?  I would appreciate it if anyone knows why this is so.

I've always been curious what decides if a credit is in the opening or closing credits.  It seems loosely that cast (in order of today's "big name" significance), directors and financiers get the front spots, and everything else appears later.  But lately I've been developing some specific curiosities about how cast members are credited on TV shows.  Opening credits seem to follow this rough outline:  Part of "opening credits" video segment   (optional) Major Actors Show Title Core Cast Actors Directors Producers (optional) Episode Title Episode Writers   Subtitles over beginning of show, after opening video   (Episode Title and Writers may appear here, instead) Special Guest Actors   I've probably missed a few things, and mis-ordered a few things.  But, as I said, my main curiosity is about actor credits.  Typically, there is little indication of which characters the core cast actors play.  Sometimes their name is edited to appear along with an image of the character as an indictator, but sometimes there is no indication.  As I've never seen anyone credited in both the opening and closing credits, that leaves the potential for core actors to never be directly associated with their character.  This seems potentially problematic; is there a reason for this?  Are viewers expected to know who's who?  Guest actors sometimes are simply credited by name (and not being part of the opening video, this means they will never be associated with their character in credits).  But often they are credited as "special guest as character name".  This is quite helpful.  The thing I find really confusing is, sometimes the last few regular cast actors will get the guest actor treatment.  I've seen opening video with "and actor as character" paired with an image of that character for an entire season.  Why does this actor get special treatment?  Finally, sometimes guest actors will be credited at the front following the opening video, sometimes they'll be credited in the closing credits.  Are there rules for deciding who get's credited early or late?  I've sometimes wondered if shows deliberately play with actor's name position to obfuscate plot arcs ("you won't think we're killing of this character if their actor is still in the opening credits", or "you won't expect this recurring guest if we place their name in the closing credits") and I've also wondered if there are thresholds for "people appearing in XX number or YY percentage of episodes get placed here."  But it's difficult to build a good sampling base for this.  And season 7 of Stargate SG-1 kinda took a shotgun to my guesses so far.  So...  Are there rules?


I understand, at least at a basic level, that the light-difference between inside and outside, determines whether someone walking past my house can see into my room or not.  Partially-see-through materials, such as net curtains, adjust the light difference needed (make it harder to see in/out).  Is there an everyday-test that can be done to determine, from inside my house, whether someone outside my house could see in through my curtains? e.g. "If I can see them they can't see me" (but obviously that doesn't work)  In other words, what's the conditions that make me able to see out but not in, and can I tell from inside when those conditions are met?

How does a  work? If seen from the outer side, we can see through thinking it is transparent, while if seen from the inside, the glass acts as a mirror. How?


I'm currently stuck on the following problem: Given $c,n,k\in \mathbb{N}_0$, what is the amount of tupels $(a_1, \dots, a_n) \in \{0, \dots, c\}^n$ such that $\sum_{i=1}^{n} a_i = k$? More precisely, what is $$ z(n,c,k) := \left|\left\{(a_1, \dots, a_n) \in \{0, \dots, c\}^n \mid \sum_{i=1}^{n} a_i = k\right\}\right| $$  Now, the case $c\leq 1$ is easy: $$ z(n,0,k) = \begin{cases} 1 & \text{ if $n=0$ or k=0}\\ 0 & \text{ else}\end{cases} $$ and $$ z(n,1,k) = \binom{n}{k} $$ Also, if $c\geq k$ there is a rather easy solution: $$ \begin{eqnarray} &z(n,c,k)   &\\ & = & \left|\left\{(a_1, \dots, a_n) \in \{0, \dots, c\}^n \mid \sum_{i=1}^{n} a_i = k\right\}\right|\\ & = & \left|\left\{(a_1, \dots, a_n) \in \mathbb{N}_0^n \mid \sum_{i=1}^{n} a_i = k\right\}\right|\\ & = & \binom{n+k-1}{k} \end{eqnarray} $$ since for every $(a_1, \dots, a_n) \in \mathbb{N}_0^n$ with $\sum_{i=1}^{n} a_i = k$ we must also have $a_i \leq k \leq c$ for all $i$.  But I'm having difficulties finding a nice formula for the remainig case $1<c<k$. Here are some ideas:   By the above, we know that $$\binom{n}{k} \leq z(n,c,k) \leq \binom{n+k-1}{k}$$ We also know that $$ z(n,c,k) = \sum_{a=0}^c z(n-1,c,k-a) $$ by partitioning the set by possible values of $a_1$.

The problem of counting the solutions $(a_1,a_2,\ldots,a_n)$ with integer $a_i\geq0$ for $i\in\{1,2,\ldots,n\}$ such that $$a_1+a_2+a_3+....a_n=N$$ can be solved with a stars-and-bars argument. What is the solution if one adds the constraint that $a_i\leq r_i$ for certain integers $r_1,\ldots,r_n$?  e.g. for $n=3$, $N=6$ and $(r_1,r_2,r_3)=(3,3,2)$, the tuple $(a_1,a_2,a_3)=(2,3,1)$ is a solution, but $(2,1,3)$ is not a solution because $a_3=3>2=r_3$.


Guys i have many links:  "img/dasda/ja.png", "../img/no.png", "wild/rpm/gulp/in.png",  How in js change sting to last "/"? To get just the name of image?

I have a url like   I need a javascript function to give me the 'th' value from that.  All my urls have the same format (2 letter filenames, with .html extension).  I want it to be a safe function, so if someone passes in an empty url it doesn't break.  I know how to check for length, but I should be checking for null to right?


Scenario: let's say we are talking about a simple form, which contains the following field types:   All fields are mandatory. Number: only digits are allowed. Text: text must not exceed the maximum length. Email: must be a valid email address 'xxx@xxx.xxx'.   Preventing: make it impossible to enter an incorrect value by only allowing a valid input that follows the pattern, the submit button is only enabled once every field is entered correctly.  Explaining: allow submitting the form, check all the fields and generate a list of validation errors if there are any.  (On failure, user isn't forced to re-enter data. I guess everything should be preserved, since incorrect values could be really long and only require minor changes to be corrected.)

I've been having a debate (mostly with myself) over the best approach to deal with invalid input in text fields -- validation versus prevention.    Taking a  numeric text field as an example, is it better to prevent the entry of non-numeric characters (allowing for special cases like sign, decimal pt., etc.) or allow the entry of whatever and then indicate an error message (typically when focus is left) if the result is invalid?    The first approach is "don't allow the user to do something you know is wrong" but has the disadvantage that it may not be at all obvious what is going on if a keyboard key is typed and nothing happens.  It also breaks the expectation that, if you type something in a text field, you expect to see what you typed.    In the past, I've generally leaned towards the prevention approach but in general but feel perhaps, at the field input-level, the validation approach provides a better user experience.  Is anyone aware of a best practice here?


I have a trilateration-related problem that I'm unsure how to solve mathematically. I can see a solution is possible through geometry, but I'm unsure how to solve the resulting equations.     Given three 2D points, find where to put a new point on the same plane. You know the exact distances from the new point to each existing point.   By drawing a picture, it is clear that this is attainable:    In this image, $P_1,P_2,P_3$ are the known points, and $P_4$ is the point we want to find coordinates for. The red lines denote known distances.  Given only two points, we can find 2 candidate positions (where the circles intersect), while the third given point limits us to our solution.  Using the properties of circles, I have come up with 3 equations and 2 unknowns. Let $P_i=[x_i,y_i]^T$ and $r_i=|P_i-P_4|$ for $i\in\{1,2,3,4\}$. Then my set of equations, expanded, is $$r_1^2 = (x_4 - x_1)^2 + (y_4 - y_1)^2\\ r_2^2 = (x_4 - x_2)^2 + (y_4 - y_2)^2\\ r_3^2 = (x_4 - x_3)^2 + (y_4 - y_3)^2$$ How can I calculate $x_4$ and $y_4$?    I FOUND THE ANSWER I WAS LOOKING FOR  (I'd answer my own question, but since it's closed as a duplicate all I can do is post it here)  So I was hoping to find a way to express this as a linear least-squares ($Ax=b$) type problem. I mentioned that in the comments, but not in this OP. Regardless, the link from @dxiv in the comments below helped me get to this solutions. Also worth mentioning, the question this is a duplicate of reaches the same conclusion (as it obviously should). It just stops short of the $Ax=b$ form.  In short, the approach is to combine the 3 quadratic equations to get 2 linear ones.  Given  $$\text{(1)  } r_1^2 = (x_4 - x_1)^2 + (y_4 - y_1)^2\\ \text{(2)  }r_2^2 = (x_4 - x_2)^2 + (y_4 - y_2)^2\\ \text{(3)  }r_3^2 = (x_4 - x_3)^2 + (y_4 - y_3)^2$$  we first expand each to  $r_i^2 = \hat{x}^2 + \hat{y}^2 - 2\hat{x}x_i - 2\hat{y}y_i + x_i^2 + y_i^2$  Then we subtract (2) from (1) and (3) from (1):  $$\text{(1)-(2)   }2\hat{x}(x_2 - x_1) + 2\hat{y}(y_2 - y_1) + (x_1^2 - x_2^2) + (y_1^2 - y_2^2) - (r_1^2 - r_2^2) = 0\\ \text{(1)-(3)   }2\hat{x}(x_3 - x_1) + 2\hat{y}(y_3 - y_1) + (x_1^2 - x_3^2) + (y_1^2 - y_3^2) - (r_1^2 - r_3^2) = 0$$  This is now able to be expressed as an least-squares problem, particularly as an $Ax=0$ (i.e. nullspace) problem if the distances $r_i$ are precise.  $\left[  \begin{matrix}   2(x_2 - x_1) & 2(y_2 - y_1) & (x_1^2 - x_2^2) + (y_1^2 - y_2^2) - (r_1^2 - r_2^2) \\   2(x_3 - x_1) & 2(y_3 - y_1) & (x_1^2 - x_3^2) + (y_1^2 - y_3^2) - (r_1^2 - r_3^2)  \end{matrix} \right] \left[ \begin{matrix} \hat{x} \\ \hat{y} \\ 1 \\ \end{matrix} \right] \left[ \begin{matrix} 0 \\ 0 \end{matrix} \right] $  Thus, in short, the solution for $\left[ \begin{matrix} \hat{x} \\ \hat{y} \end{matrix} \right]$ is found in the nullspace of the $A$ matrix.  If the distances $r_i$ have some uncertainty, this can be expressed as a linear least-squares minimization problem which is easily solvable using SVD.

I need to find location of the point $s_0$; the locations of other three points ($s_1$, $s_2$, $s_3$) are known. $d_i$ are known distances.  Given: $x_1$, $x_2$, $x_3$, $y_1$, $y_2$, $y_3$, $d_1$, $d_2$, $d_3$ To be found: $x_0$, $y_0$  This will be a physical system. $s_i$ will be fixed antennas and the distances $d_i$ will be read via proximity sensors. The aim will be to make $s_0$ find its own location. So, $s_0$ will always exist; there will always be a unique solution point $s_0:(x_0, y_0)$.  How do I solve this problem?


I have newly installed Windows 8.1 on a new miniDesktop:           Model Lenovo ThinkCentre   CPU Intel® Core™ i5-4570T  @ 2.90GHz × 4   RAM 3.7 GiB   Disk 32.9 GB     I dual booted it with Ubuntu 18.04 LTS. Problem is that I am not able to add write permissions to my Windows partitions. I have tried: sudo chmod -wrx /media/pmay3/Data  All it returns with is chmod: changing permissions of '/media/pmay3/Data': Read-only file system  Even if the folders are accessed from the graphical interface, and changing their permissions is attempted, it is Screenshot of Permissions Tab:  Share your expertise please. I have re-installed Ubuntu 20.04 LTS, and 18.04 LTS twice.

I have both Ubuntu 16.04 LTS and Windows 10 Pro installed and I use them both very often.  Sometimes, when using Ubuntu, I can see and use Windows partitions also. But sometimes, I cannot. I dont know why?  Ubuntu gives the error:  Error mounting /dev/sda5 at /media/mani/0AC217250AC21725:   Command-line `mount -t "ntfs" -o "uhelper=udisks2,nodev,nosuid,uid=1000,gid=1000" "/dev/sda5" "/media/mani/0AC217250AC21725"' exited with non-zero exit status 14:   The disk contains an unclean file system (0, 0).   Metadata kept in Windows cache, refused to mount.   Failed to mount '/dev/sda5': Operation not permitted   The NTFS partition is in an unsafe state. Please resume and shutdown Windows fully (no hibernation or fast restarting), or mount the volume read-only with the 'ro' mount option   Although I have shut it down many times, it still gives me this error. Please help so that I can use the two operating systems easily.


Let say I wanted a list with all zeros of 5x3 (row x column). I can make the list in 2 ways  Using for loop:  a = []   # My 2D list (currently empty) for i in range(5):     thisele = []     for j in range(3):         thisele.append(0)     a.append(thisele)   Using element multiplication method which I recently learnt  a = [[0]*3]*5  Now both genertes the same 2D list which looks like this [0, 0, 0] [0, 0, 0] [0, 0, 0] [0, 0, 0] [0, 0, 0]  Now I want to replace an element in the third column at first row with 11 so I used the following line a[0][2] = 11 This gives 2 different results based on the technique used. The first technique gives: [0, 0, 11] [0, 0, 0] [0, 0, 0] [0, 0, 0] [0, 0, 0]  and the second technique gives: [0, 0, 11] [0, 0, 11] [0, 0, 11] [0, 0, 11] [0, 0, 11]  The second result is clearly undesirable as thats not what I intended to do. Can someone explain why the results vary in the second case and if it's a bug or a feature. If its a feature then in what scenario can the second method be implemented

I needed to create a list of lists in Python, so I typed the following: my_list = [[1] * 4] * 3  The list looked like this: [[1, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]]    Then I changed one of the innermost values: my_list[0][0] = 5  Now my list looks like this: [[5, 1, 1, 1], [5, 1, 1, 1], [5, 1, 1, 1]]    which is not what I wanted or expected. Can someone please explain what's going on, and how to get around it?


$P = \binom{N}{0}-\binom{N}{1}+\binom{N}{2}-\binom{N}{3}+ \dotsb + (-1)^N\binom{N}{N}$  I can calculate the value of this equation manually, but there any direct formula for calculating the value of this equation? Can anyone please help?

Show that $$\sum_{k=0}^n(-1)^k\binom nk=0$$ So for odd $n$ we have an even number of terms. So $\binom nk=\binom n{n-k}$ which have opposite signs. Thus the sum is 0.  For even $n$ we have that $$\sum_{k=0}^n(-1)^k\binom nk= \binom n0+\sum_{k=1}^{n-1}(-1)^k\binom nk+\binom nn$$ Now $$\sum_{k=1}^{n-1}(-1)^k\binom nk= \sum_{k=1}^{n-1}(-1)^k\left[\binom{n-1}k+\binom{n-1}{k-1}\right]$$ What would that sum be in the square brackets?


Which user/db setting would cause the date conversion here to fail with Conversion failed when converting date and/or time from character string?  SELECT     -- This works:     CONVERT(datetime2, '01 ' + LEFT([MonthName], 3) + ' ' + CAST([Year] as char(4)), 106)      -- This doesn't:     ,CONVERT(datetime2, '01 ' + LEFT([MonthName], 3) + ' 2018', 106)   [Year] is of type int NOT NULL.  [MonthName] is of type nvarchar(100) NOT NULL and its collation is SQL_Latin1_General_CP1_CI_AS.  DBCC USEROPTIONS shows this:  language   | us_english dateformat | mdy   I tried creating another table with seemingly the same settings and the query works there. Something is obviously different but I can't figure out what.  EDIT  Doing a SELECT DISTINCT [Year], [MonthName] reveals that there's data only for 'December', 2017. So yes, the month name is in English.  Leap years can't be the problem because of the previous point but also because I'm forcing the day to be 1.  Interestingly, TRY_CONVERT doesn't return NULL for any row. I did a  WHERE TRY_CONVERT(datetime2, '01 ' + LEFT([MonthName], 3) + ' 2018', 106) IS NULL   I'm suspecting that inputting the ' 2018' causes the resulting string to be of some other collation (or something) which makes SQL Server expect the date format to be something different.  Here's the weird part. The query works if it's like this:  SELECT DISTINCT     CONVERT(datetime2, + LEFT([MonthName], 3) + '01 2018', 106)     ,CONVERT(datetime2, '01 ' + LEFT([MonthName], 3) + ' 2018', 106)     ,[Year]   But removing either the [Year] or the DISTINCT will again produce the same error.  The query has only two tables joined in the FROM clause and no WHERE clause. The [MonthName] comes from the second table and the [Year] from the first.

I have a query to insert data from one table into another. One of the source columns is larger than the destination table's, although the actual data selected in the query isn't. So e.g. the source table is varchar(25), the destination table is varchar(10), and the query selects records that do not exceed 10 characters for that specific column.  My initial query failed with a truncation error, but when I rewrote it selecting the same records but changing the where clause i.e. to use WHERE IN and filtering on a cte it ran successfully.  i.e instead of doing  select * from tbl where col1 = 1   I did:  with cte as (select 1) select * from tbl where col1 in (select 1 from cte)   I understand that this is a bug in SQL Server, still I am wondering at which point does SQL Server validate the data for insertion. At which point is the error thrown?


I don't know what to do to unfreeze my question, ask again?

As a newcomer to StackOverflow, I recently asked my first . I wanted to start with a fairly safe general question, to get the feel for how the site worked. My question was intended to be programming-related, but my original wording was not clear enough, so another user decided to close it.  I've re-phrased my question, and had received one useful answer before the question was closed, but I'm not sure what the procedure is after your question is closed to allow people to post answers again...  I've checked the FAQ and About pages, searched the SO questions, but have had no luck. Could someone point me in the right direction as to how I get my question re-opened, or if it is possible to do at all?


I'm not even sure this is the right place to ask this question! Let alone where to ask any questions. As you can probably figure, I'm very new to the StackExchange family of sites, but I'm very eager to join in. I'm mainly interested in speech recognition and web development questions. I think I can figure out where the latter goes, but not so sure about the former. Any advice?  EDIT: I am mostly interested in creating custom scripts for Dragon v14 and Vocola, I am an endeavoring web developer and I use Dragon with my code editor, so questions on integrating direct recognition into my programming work would be normal, as would questions on working vbs scripts and scripts for vocola.  I'm not sure what example questions I could ask, I'm coming up kind of black right now sorry xd I might edit again later if need be when I think of some.

There seems to be more than a few computer science/programming Stack Exchange networks (is that the correct term?). Stack Overflow, being the first, has by far the most users, questions, and answers.  What is the reasoning for creating the others, and are there clear guidelines for which kinds of questions should be posted? I can see a large amount of potential overflow, many cases of people not getting a good answer to their question, because the person who has the answer isn't browsing that particular network at the moment.  I understand that they were probably created for organizational purposes, but wouldn't it almost make more sense to just have them as categories under Stack Overflow, keep them separated but still connected, instead of making people have to create multiple 'account's, one for each network?  I am sure there was a very good reason to break them up, but as someone that is new to SE, it can be somewhat intimidating to decide which one to post in to ensure you get a good answer. For example, if I am a computer science student, my first instinct might to be to post in the computer science network, until I see that it literally has 1% of the users as the Stack Overflow network, which still seems to be for programming/computer science related questions.  So my second instinct would then to be to post it into the Stack Overflow site on the basis that I have a significantly higher chance of my question being seen and getting a good answer. Then I notice that there is also a 'programmers' network, and I don't even begin to know where that fits in. I, and I am assuming most people, will probably just post on Stack Overflow to be safe.  My question is, other than the short little description blurb of each one, is there a clear cut set of guidelines which what each network is intended for, what kinds of questions should go to each one, and is anything being done to encourage people to post in these newer, smaller (more specialized?) networks as opposed to just posting in big daddy Stack Overflow?  Now again, this is for computer science/programming/"why isn't this code doing what I want?" related questions, I am not saying that if I had a question about Linux or WordPress or something I would have the same confusion.


I recently booked Etihad flight tickets from USA to INDIA and it didnt ask my passport details.

I have been looking to book a bundle (hotel and flight) with Expedia to Puerto Vallarta MX. When I get to the booking section it does not ask for my passport number. Do they ask for my passport after I book? Or later when the date gets near? My passport is currently being renewed and I want to book my hotel and flight before they sell out but I am afraid it'll ask me for my passport number. Can anyone inform me about this situation?


I just ran into a small null pointer problem. I was setting up an EditView (textInputNewWeight) for my Dialog Window. The code you see down here is a button (confirmer), which checks the editView after clicking on it. It should make a toast message that the field is empty but it crashed every time when the editView is empty and I press the confirm button (code below). But when I put a some number it works fine. I know that its gonna something easy and simple but I have been stuck with this for hours and I couldnt find an answer on how to fix this haha Thanks for any help in advance How should I write the first if statement to make it showing the toast message instead of crashing? confirmer.setOnClickListener(new View.OnClickListener() {             @Override             public void onClick(View view) {                  if (textInputNewWeight == null){                     Toast.makeText(getContext(), "The field cannot be empty.", Toast.LENGTH_SHORT).show();                 } else {                     int weightNumberInput = Integer.parseInt(textInputNewWeight.getEditText().getText().toString().trim());                      if (weightNumberInput > 0 && weightNumberInput < 100){ //1 - 99                         confirmInput(1);                         dismiss();                     }                     else if (weightNumberInput > 99 && weightNumberInput < 1000){ //100-999                         confirmInput(2);                         dismiss();                     } else {                         Toast.makeText(getContext(), "The number was set incorrectly.", Toast.LENGTH_SHORT).show();                     }                  }               }         });

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?


The following bash script #!/bin/bash  startNumber=$(( 1 )) endNumber=$(( $startNumber + 3 ))  #for number in {$startNumber..$endNumber} for number in {1..4} do         echo $number done  exit 0  gives the desired output 1 2 3 4  However, when I switch the uncommented and commented for loop, the output is {1..4}  What am I doing wrong?

I am trying to enumerate a range of integers using a variable but having some trouble.  When I type  echo {1..5}   I get  1 2 3 4 5   However, when I type a variable, I am unable to get the enumeration.  For example  $ num=5 $ echo {1..$num} {1..5}   I am stumped as to why the result is not the same.  I have tried using quotes and that has not helped either.  Can someone help or explain?


The folowing is stated and proved in the random graphs book by Luczak, Janson, Rucinski and this is on page 108 in the Giant component section.  I can't understand why the conclusion follows from the last statement in the proof.  Question: We consider a series of branching processes with immediate offspring distribution $X_n \sim \mathrm{Bin}(n,p)$ where $np \to c$ as $n\to \infty$ for some constant $c>1$.  We also consider a random variable $X \sim \mathrm{Poiss}(c)$.  If we denote by $\rho_{X_i}$ the extinction probability.  Show $\rho_{X_i} \to \rho_X$.  Solution: This is the solution given in my textbook, it seems wrong to me and I don't seem to be able to fix it, it is quite important to me as the remainder of the chapter is based on it.  We know that generating functions are  $$f_{X_n}(x)=(1-p+xp)^n$$ and  $$f_X(x)=e^{c(x-1)}$$  It is now a standard result that for a fixed $x$ $f_{X_n}(x) \to f_X(x)$ so $f_n$ converge pointwise to $f$.  As $c<1$ we have $f_{X_n}(\rho_{X_n})=\rho_{X_n}$ and $f_{X}(\rho_{X})=\rho_{X}$  Now the book just states that this implies $\rho_{X_n} \to \rho_X$. And I just don't see why.

I am stuck on exercise 11.2 From Grimmett's  probability on graphs. Here is a  to the pdf on his website.     Consider a branching process whose family-sizes have the binomial distribution bin$(n, \frac{\lambda}{n})$. Show that the extinction probability converges to $\eta(\lambda)$ as $n \rightarrow \infty$, where $\eta(\lambda)$ is the extinction probability of a branching process with family-sizes distributed as $\text{Po}(\lambda)$.   To solve this exercise, we use a theorem from his other book, which states that if you have a branching process whose family sizes are $X$ distributed then the extinction probability of this branching process is the smallest non-negative fixed point of the equation $s = G(s)$ where $G$ is the probability generating function $G(s) = \sum_{k = 0}^\infty \mathbb{P}(X = k)s^k$.  My next step was computing these probability generating functions for $\text{bin}(n,\lambda)$, these are $G_n(s) = (1+\frac{\lambda( s -1)}{n})^n$. When the family sizes are Poisson distributed with parameter $\lambda$ we get $G(s) = e^{\lambda(s-1)}$. and so clearly $G_n$ converges pointwise to $G$.  This however is not enough, as we want to show that the extinction probabilities also converge, so we have $s_n$ extinction probabilities of the $n$-th process, i.e. $s_n$ is the smallest non-negative solution to $s = G_n(s)$, and we want to show that this converges the smallest non-negative solution of $s = G(s)$. I hoped I could use some theorem which states that if you have pointwise convergence then the fixed points also converge, but this is false, see this .  During writing this I thought of an attempt to solve this using Hurwitz theorem, namely, show that the smallest non-negative fixed point of $G(s)$ is smaller than 1, then show that the function $G'$ is complex differentiable with non-zero derrivative, use inverse function theorem, get an open neighbourhood of our fixed point, find sequence of fixed points which converge to the smallest non-negative fixed point $\eta(\lambda)$ of $G$. Here I am stuck trying to show that $s_n$ are the smallest non-negative fixed points of $G_n$.     How to proceed?


I'm trying to zip streaming text, and unzip it later. A minimal example is:  echo "Hey, could you zip this for me?" | zip hello.zip - ; unzip -p hello.zip   This fails, with the following output:  warning [hello.zip]:  76 extra bytes at beginning or within zipfile   (attempting to process anyway) error [hello.zip]:  reported length of central directory is   -76 bytes too long (Atari STZip zipfile?  J.H.Holm ZIPSPLIT 1.1   zipfile?).  Compensating...    skipping: -                       need PK compat. v4.5 (can do v2.1)  note:  didn't find end-of-central-dir signature at end of central dir.   (please check that you have transferred or created the zipfile in the   appropriate BINARY mode and that you have compiled UnZip properly)   I'm guessing this has something to do with that note about binary mode, but I can't figure out what, or find any help in the relevant man pages / Google / StackExchange. I believe this question is different from "" The error messages are the same, but that question is about fixing an existing 3rd party file archive, whereas this is about working with an archive you just created yourself.  Version detail:   OS X 10.10.4 Zip 3.0 (July 5th 2008), by Info-ZIP UnZip 5.52 of 28 February 2005, by Info-ZIP

When I enter unzip ../founation-latest.zip, it outputs this:     warning [../foundation-latest.zip]:  248 extra bytes at beginning or within zipfile (attempting to process anyway)   The file is 138KB. It unzips correctly, but why am I getting this error?


Consider the following link:  https://doc-0g-bc-docs.googleusercontent.com/docs/securesc/ha0ro937gcuc7l7deffksulhg5h7mbp1/9la5prt2u93men2ft6831kkki73u94n0/1403496000000/02058467015715614041/*/0ByTrbPQHgxJddnBTSlUxZVNBOG8?h=16653014193614665626   If I try to include it as a link in this post using the "displaced URL" syntax (), the href of the resulting <a> (in the output, not the markdown) gets converted to:  https://doc-0g-bc-docs.googleusercontent.com/docs/securesc/ha0ro937gcuc7l7deffksulhg5h7mbp1/9la5prt2u93men2ft6831kkki73u94n0/1403496000000/02058467015715614041/%2a/0ByTrbPQHgxJddnBTSlUxZVNBOG8?h=16653014193614665626   If you scroll to the right, you will see that the difference is that * in the URL has been %-encoded to %2a. But here is the problem: the version of the URL with the * goes to the right place (here is a link from a shortener:  - you should get a PDF of the Ramayana), while the link above, which has %2a, does not.   I'm not sure whether this is a bug in SE or in Google, but even if it is a bug at Google, it would probably be a good idea for SE to have a workaround for it.  Note also: If I try to use a literal <a> tag in my post to include the link, it fails to render: (). The same URL with the * removed links just fine using a literal <a> tag () (albeit there's nothing at that URL), so this is probably a symptom of the same underlying problem.

There seems to be a problem with making a clickable archive.org URL. For example:     See the .   I am using Chrome. I suspect something about the * in the URL, perhaps because it gets encoded as %2a, causes the URL request to be sent to the current site (meta.stackoverflow.com) which doesn't make sense.


I've looked at a number of questions on what symmetries are in physics, such as ,  and . However, I found the questions and answers to be not completely satisfying because they were somewhat informal in certain ways that confused me.      Let $(S,\Phi)$ be a dynamical system, where $S$ is the state space, and $\Phi:\mathbb R\times S \to S$ gives the time evolution of the system given an initial condition. i.e. $s_t=\Phi(t,s_0)$ gives the state of the system at time $t$ if the initial state is $s_0$. Then a transformation $T:S\to S$ is a  symmetry transformation of the physical system $(S,\Phi)$ if and only if for all $s_0$ and all $t$, $\Phi(t,s_0)=T^{-1}\left(\Phi(t,T(s_0))\right)$. In other words, we can transform the system by $T$, let the system evolve, and transform it back by $T^{-1}$, and it would be as if we hadn't transformed the system at all.   $(S,\Phi)$ could represent any physical system, whether $S$ is the phase space of a few classical point-mass particles, or the quantum state of an atom.  Is this a good general definition of what is meant by "symmetry" in physics?   I have seen people define a symmetry as something that leaves the lagrangian unchanged. However, some changes in the lagrangian (e.g. adding a constant) have no effect on the trajectory $\Phi(t,s_0)$ in the underlying physical system, so this seems like a bad definition. I am not sure whether this captures gauge symmetries, or whether gauge symmetries are different from other symmetries (as I don't know what gauge symmetries are).

How are  precisely defined?  In basic physics courses it is usual to see arguments on symmetry to derive some equations. This, however, is done in a kind of sloppy way: "we are calculating the electric field on a semicircle wire on the top half plane on the origin. Since it is symmetric, the horizontal components of the field cancel and we are left with the vertical component only".  Arguments like that are seem a lot. Now I'm seeing Susskinds Theoretical Minimum courses and he defines a symmetry like that: "a symmetry is a change of coordinates that lefts the Lagrangian unchanged". So if the lagrangian of a system is invariant under a change of coordinates, that change is a symmetry.  I've also heard talking about groups to talk about symmetries in physics. I've studied some group theory until now, but I can't see how groups can relate to this notion of symmetry Susskind talks about, nor the sloppy version of the basic courses.  So, how all those ideas fit together? How symmetry is precisely defined for a physicist?


I uploaded my website to the server 2 days ago. I'm already being indexed by google and bing. I have a sitemap that they can read as it's confirmed in my g-analytic report and webmaster tools. Robots are find. I set the title, description, keywords. However, the website is not showing up on google results with keywords contained in my website title, description and so on. Is that the normal behavior considering that my web has been published just for 48 hours or less?  I must say I have strong competitors because is a website about puzzles and crosswords. Yet I feel I'm not doing things well. I'm open to any suggestion. I know it's too sun to get frustrated but still...

What are the best ways to improve a site's position in the Google search results?


I am a German citizen currently living in Russia with a Russian study visa. I am planning on driving to Minsk with a car and from there to Poland. Since I already have a visa for Russia, is a special visa required for Belarus? I am aware of  but my question differs in the respect that I am not an US, but a EU citizen and that I am not entering Belarus by plane or train.

I am a U.S. citizen living in Russia with a multi-entry student visa. I noticed that on my migration card it lists the Russian Federation as well as the Republic of Belarus. Do I need to get another visa if I want to visit Belarus, or is what I already have sufficient?


What is the longest discrepancy between death and publication?

One of my advisors suddenly passed away while I was in graduate school.  We had some discussions and ideas about future publications, but he passed away before any of the work was completed.  When the work was finally completed and published, I and my co-authors were therefore presented with an ethical dilemma about how best to acknowledge his contributions to the ideas behind the paper.  Should we list him as a co-author?  Put him in the acknowledgements?  Listing him as an author would give credit for the original idea, however, we would have no way of knowing if he actually approved of—and would want his name attached to—our methods and writing.  In the end my co-authors and I decided to list him as a co-author with a footnote stating that he passed away before publication.  I’m interested to hear from others who have been in similar situations and/or suggestions on what constitutes “co-authorship” when one of one’s collaborators passes away before the publication or work is complete.


Help a newcomer out please. It's much appreciated.

I have been reading Stack Exchange for years - mostly not logged in, and have never posted (this is my first). I'm simply not very talkative, and very good at googling.  Recently a few occasions have come up when I've wanted to comment on a question.  I wanted either to ask for, or provide, clarification which did not warrant a new answer.  How do I gain enough reputation to comment without:   asking questions which have already been answered or that I can figure out on my own, or posting my comment like as an answer (i.e. being  rude)?


As noted below in the comments, this question specifically addresses how the functionality delivered to "complete" the  question is not sufficient, and requests a CHANGE to .   TL;DR I want to be able to quickly vote to keep good questions open WITHOUT having to go click through the review queue. Currently, we cannot easily vote for questions to be left open when they have existing close votes on them - the only way to do this is to go to the review queue and click through until you find the question you want to vote to keep open. This discourages the use of "Leave Open" votes by making them difficult to cast.    There have been numerous good questions that are descriptive, on-topic, and informative for IT professionals that still manage to get several close votes. It is quite difficult for us to go into the review queue and slog through all the other questions and hope we don't burn through our close vote quota before we get to the question needing a helping hand.  And if we've already used up our close quota, we can't do anything at all until Midnight GMT to help a question out. (Note: it's possible that Leave Open uses up one of those votes. I don't know.)  I'm requesting that a 'Leave Open' button be provided in the Close Vote dialog that pops up on the questions page.  This will enhance our ability us to improve the quality of ServerFault questions in a positive and qualitative manner.

I just reached the 3k rep limit required for close votes and have started exploring the vote-to-close UI that's opened up to me, and I have a request.  The review queue has a Do Not Close button, but when I click the close link under a question that has close votes (i.e. it shows close (1)), there isn't an option for me to vote against closing the question. I came across a question that had a vote to close it as not a question, but it had just been updated with code and more details and was no longer a candidate for closing. However, I couldn't cast a vote to not close it from the question itself. When I clicked on close, it brought up the usual voting UI, and "Do Not Close" was not an option.  TL;DR, do this:   Open a question in the close votes review queue Note the Do Not Close button Click the question title to go to it Click the close (n) link under the question (assuming it hasn't already been closed) Notice the lack of an equivalent "Do Not Close" option   Could a "Do Not Close" option be added to the close button popup for questions that already have close votes, that way the review interface isn't the only place a "Do Not Close" vote can be cast?  Edit: Okay, so 5 3 "Do Not Close" votes kicks it out of the review queue, it doesn't have "no effect" as suggested in the comments. (See , in which the  was just updated a few minutes ago to say 3 DNC votes.) I still don't see why the same DNC option can't be available from the question.  Basically, I guess I would like some rationale behind this bullet point from :     Only accessible from the review queue (so rather difficult to target a specific question). Yes, this is very much by-design.


I've been trying to use the linux shell to output a sequence of bytes into a file using Python. The problem is when I do:  python -c "print '\x11\x22\x33\x44'" > new_file   The new_file contains '\x11\x22\x33\x44\x0a'.  I looked up similar questions here on StackOverflow and tried to strip out the \x0a by the following and many other similar techniques:  python -c "print '\x11\x22\x33\x44'.rstrip('\x0a')" > new_file   The \x0a, however, refuses to go.  Has anyone run into this problem before? Would really appreciate a quick fix. Thanks.  PS: I've tried this with various versions of Python including 2.5, 2.7, 3.1, 3.3. All lead to the same problem.

I'd like to do it in Python. What I'd like to do in this example in C: #include <stdio.h>  int main() {     int i;     for (i=0; i<10; i++) printf(".");     return 0; }  Output: ..........  In Python: >>> for i in range(10): print('.') . . . . . . . . . . >>> print('.', '.', '.', '.', '.', '.', '.', '.', '.', '.') . . . . . . . . . .  In Python print will add a \n or space, how can I avoid that? Now, it's just an example, don't tell me I can first build a string then print it. I'd like to know how to "append" strings to stdout.


If there is any sort of field in a conductor, then the charge would rearrange such that the field is canceled. Then, why is it that there is electron flow in the circuit? Or is it that at each point the 'charge' density is same at all points?

If you take a perfect conductor, there cannot be a field across it since if there were, the particles would arrange themselves in a way to cancel out the field right?  Yet, why does the same not hold true for a wire. A wire is essentially a long, thin conductor yet electrons do indeed flow so there must be an electric field.  Does this not contradict with what happens in a conductor? Why don't the electrons re-arrange to cancel out the electric field?


Is there a way to be able to have users select Content Type when on Newform.aspx? It currently works when on EditForm.aspx

I have a custom list and I am using content types to add items to the list. I am using OOTB forms for new and edit items. One field that I see on the EditForm.aspx is the one that I hope I get on the NewForm.aspx also and it is the Content Type field. It is shown in the following screenshot. Do you know how to add that field on the NewForm.aspx page also?    Thanks.