I was commissioned a job that comes out a bit from the patterns of my job (programmer). I was asked to create a book for a famous interior design company. I first accepted, because it is simply a question of composing a book with illustrative images and simple captions. The question is: which software do you recommend for layout or in any case for realization?  ps. on the stack I joined recently so I apologize in advance if this question can be off-topic.

The last time I did any desktop publishing it was ten years ago and I used Microsoft Publisher. Now I need to put together a product user manual, troubleshooting guide, and a new catalog. I figured Adobe would be the place to start, but their product features section focuses so much on cross-platform functionality and collaboration that I can't tell which product, if any is used to lay out a multi-page document. I'm primarily a Windows user on a desktop. I can afford software licenses but I'm not married to Adobe. Where do I start?  EDIT: I'm a mechanical engineer with very little desktop publishing experience. The documentation I'm trying to create includes the installation manual for my product, a separate troubleshooting manual, and a product line catalog. I have two engineers working for me contributing content. We don't all have Publisher so I would prefer to find another program, preferably one with the smallest possible learning curve. If the results look too rough, I can always turn the result over to a professional and say "Make it look like this, only better."


I have a class like that:  public class A{  //some properties }  public class B : A{    //some more properties }  public class C : A{    //some more properties }   I would like to make a list of B, C and so on like that:  List<A> mylist = new List<A>() mylist.add((B)someobject); mylist.add((C)someobject);   If I add B, C etc. type of elements to mylist, It will cast them to type A. Therefore if I want to get properties of mylist[0] it gives me only class A properties.  How can I solve the problem and reach B or C type properties too?

In C#, what is the best way to access a property of the derived class when the generic list contains just the base class.  public class ClassA : BaseClass {    public object PropertyA { get; set; } }  public class ClassB: BaseClass {     public object PropertyB { get; set; } }  public class BaseClass { }  public void Main {     List<BaseClass> MyList = new List<BaseClass>();     ClassA a = new ClassA();     ClassB b = new ClassB();      MyList.Add(a);     MyList.Add(b);      for(int i = 0; i < MyList.Count; i++)     {         //I would like to access PropertyA abd PropertyB from the derived classes             } }


I am working on displaying output like ls command (just ls, no options). And I have a working program using the system calls. But I experienced a strange behavior while testing as shown below.  $ ls  a b c $ ls > somefile $ cat somefile a b c   so, as you see the output is written one file per file, NO ADDITIONAL SWITCHES WERE GIVEN TO LS. You can test it out. So from above I infer, ls command has some built-in logic to display it one per line if written to a file via redirection.   To add to the puzzle, I believe it's the shell that interprets the redirection.   So I am confused I would like to kown what exactly is making the output one per line if redirected to a file? Any hint?

How does commands like ls know what its stdout is?  It seems ls is operating different depending on what the target stdout is. For example if I do:  ls /home/matt/tmp    the result is:  a.txt b.txt c.txt   However if I do  ls /home/matt/tmp | cat   the result is (i.e. new line per result):  a.txt b.txt c.txt   The process is passed a file descriptor 1 for stdout right? How does it determine how to format the result? Does the file descriptor reveal information?


I didn't finish it, though I'd like to know if I'm on the right track. Let's suppose our reals are indexed in decreasing order: $a_1 \geq a_2 \geq \dots \geq a_{99} \geq a_{100}$. Clearly $a_1 \geq 0 \geq a_{100}$. Hence, we know the sets $A_1 = \{a_1, a_2, \dots, a_k\}$, $A_2 = \{a_{k+1}, a_{k+2}, \dots, a_{100}\}$ are nonempty sets of nonnegative and nonpositive reals respectively.  So we can say with confidence that there's at least ${k}\choose{2}$ nonnegative pairwise sums. If $k\geq 15$, our job is done.  Let's suppose $k<15$. This implies $|A_1|<15, |A_2|>85$. We also have the following equivalence:  $$a_1 + \dots + a_k + a_{k+1} + \dots + a_{100} = 0 \ \ \iff \\  a_1 + \dots + a_k = -\big( a_{k+1} + \dots + a_{100} \big) \ \ \iff \\ a_1 + \dots + a_k = |a_{k+1} + \dots + a_{100}|$$   It's easy to see that for every ${100-k}\choose{k}$ subset of $k$ elements of $A_2$ (let's call it $A_{2_k}$), some element in $A_1$ is greater than $\inf |A_{2_k}|$. So we would then have that there's at least  $${k\choose 2} + {100-k\choose{k}} $$  nonnegative pairwise sums. (Is this binomial coefficient necessarily greater than $99$? I feel like it may be, but I don't know how to prove it).

Suppose, one hundred real numbers are given and their sum is 0.Then how can I prove that at least 99 of the pairwise sums of these hundred numbers are non-negative?  I tried this: Let the real numbers be $a_i$,$1\leq i\leq100$. By the given condition, $a_1+a_2+\dots +a_{100}=0$.Suppose for the sake of contradiction, that at most 98 of the pairwise sums of these given reals are non-negative.I just tried to examine the case when exactly 98 of them are non-negative. I labelled the sums $S_1$,$S_2,\dots S_{4950}$,WLOG assume that sums $S_1,S_2,\dots S_{4852}$ are negative, the rest are non-negative. $$S_1+S_2+\dots +S_{4950}=99(\sum_{i=1}^na_i)=0$$ Case I: $S_{4853}+a_{4854}+\dots +a_{4950}=0$.That simply means that $S_1+S_2+\dots +S_{4852}=0$.But, by the given condition, $S_1+S_2+\dots +S_{4852}<0$,a contradiction.After that, I am not able to make any progress.  Can anyone please suggest a more efficient method to solve this problem.I feel this approach will involve enormous case work.


It's pretty normal when people use inversion in a sentence like this one (with the aux verb at the front): "In no way do I agree with what you're saying." But I'm not sure if these belong to a type of inversion: "To the west of Ethiopia near the Sudanese border lies a place called the Asosa zone." "In the middle of the room stands a sculpture by Penny Byrne" If so, where are the aux verbs? I'm so confused, please help!

I understand inversion but I have a difficulty when it comes down to "there."  A: Under the window there stood a vase. B: Under the window stood a vase.  Here my teacher said that option B is correct.  C: Under the window there was a vase. D: Under the window was a vase.  And here he said that option A is correct.  Could someone explain why I can't say option D?


By theory I know that Naive Bayes Classifier is a linear one, but when I implemented the decision boundary it was a curve (not linear as shown below). Is there any explanation why this is happening? or Are there any reasons to make Naive Bayes nonlinear?  Here is the code  from sklearn.naive_bayes import GaussianNB  classifier = GaussianNB()  classifier.fit(X_train, y_train)  y_pred = classifier.predict(X_test)

I've seen the other thread  but I don't think the answer satisfied the actual question.  What I have continually read is that Naive Bayes is a linear classifier (ex: ) (such that it draws a linear decision boundary) using the log odds demonstration.  However, I simulated two Gaussian clouds and fitted a decision boundary and got the results as such (library e1071 in r, using naiveBayes())   As we can see, the decision boundary is non-linear.  Is it trying to say that the parameters (conditional probabilities) are a linear combination in the log space rather than saying the classifier itself separates data linearly?


I have two lights with the power to the first light and passing through to a second light then to a switch. how is this wired?

How do you wire two ceiling lights on one switch?  I have installed the switch, and the two lights, but only one light is working.  It is the light that the power source enters.  My setup is like this:  Power  enters first light    + another light   + switch.   The first light is working with the switch (where power enters), but the second is not.  Can you draw a picture for me of the wiring that should be done to make this circuit work?


I'm trying to simulate laserbeams going through movable mirrors to see where they end up on some screen depending on the orientation of the mirrors. So I figured that I could use raycast from the laser source to the mirrors and from the location and normal vector of the mirror cast a new ray in the reflected direction an so on. But I can't get the raycast to work. I have previously used the raycast from 3Dview to objects from the template with success. But I can't find any good explanation or documentation on the basic object.ray_cast() function. import bpy import mathutils  source = bpy.data.objects.get('Source')  location  = source.location direction = mathutils.Vector([0 , -1 , 0])  ray_succes, ray_object, ray_normal = source.ray_cast(location, direction)  But I get this error:  So I lack the basic understanding of how the function works. Any explanation, good answered questions, tutorials, documentation would be really appreciated. I'm open to alternative ways to shine light beams through mirrors which I can then move and rotate with python code.

object.ray_cast() is not behaving as I would expect in Blender 2.77. I understand that it expects object local coordinates, but this problem happens when the object is not translated, rotated, or scaled.  If I edit the shape of the cube mesh without moving the cube, the results of ray_cast() seem plain wrong.  Steps to reproduce   Create a cube at 0,0,0 Move a vertex of the cube from 1,1,1 to 5,5,5 Create an empty called "src" at 2,2,2 Create an empty called "dst" at 2,2,6   Run this python  cb = bpy.data.objects['Cube'] src = bpy.data.objects['src'] dst = bpy.data.objects['dst'] hit, loc, norm, face = cb.ray_cast(src.location, dst.location) bpy.ops.object.empty_add(location = loc)   This is the result on my system. The new Empty created at the interesection point is selected:    The source and the destination are both at x = 2 and y = 2. The cube has a surface at x = 2 and y = 2. So why on earth is the intersection point at x = 2.22222, y = 2.22222?


I am a South African passport holder with a valid USA visit visa. I am flying from South Africa to Dublin, Ireland, via London. Do I need a transit visa for the UK?

Is there a website or some other way to find out if I need a transit visa for a short stop in the UK on my way somewhere else? Ideally this should give me the answer for all nationalities, and take into account any other visas I may have.


Help! I backed up my "common" folder when I reset my PC, but now, when I try to copy it into "steamapps", Steam doesn't detect the files AT ALL. I have really slow internet, so I'd be looking at about a week of re-downloading my 14 games if I can't resolve this!  I'm on windows 10.

So when I got Steam working offline I had 26 games listed in my library but only 2 installed. Recently I brought a bunch more so I want to update my library on my Offline PC with the full list that's on my Online Laptop.  I thought that all I would need just copy the data from userdata/[ID]/config/localconfig.vdf however when I do the number goes down to 2 (the number of games I do have installed) and also the OST I got with Monster Monpiece doesn't appear. When I restore just that file the list and the music listing returns.  So what do I need to copy over from my Online Laptop to the Offline PC to update the list of games in the library?


In season 2, episode 1 of the Waking Dead, there is a scene in which dead people are shown in their cars, not having been zombified. However, we know from a later revelation that everyone is infected and will turn in to zombies when they die. Taking that into consideration, it would seem that those who had died in their cars would have turned in their cars and walked away. However, they are simply rotting corpses sitting in their seats without apparent head trauma to indicate prevention of the zombification process.

At the start of the second season of The Walking Dead, the group is driving down the interstate with a destination of Ft. Benning.  They then have to stop because of a grid lock of parked cars blocking the RV from continuing through. This sets a scene for the next several episodes.  All the cars are either abandoned or have a corpse sitting in the seats. And I think it was either Andrea or Carol making a solemn comment that that it's a graveyard.  But the passengers are not zombies.  And many of the cars with corpses are still intact.    So what did everyone on the road die from while sitting in their cars?


As I said in title, I'm creating a parent class implementing Comparable interface in it but without implement compareTo() method and this is causing an error in child classes but not in Parent class ¿Why?  This is a sample:  public abstract class EarthquakeMarker extends CommonMarker implements Comparable<EarthquakeMarker> { // I know that I need to implement compareTo() here }   My child classes are:  public class LandQuakeMarker extends EarthquakeMarker { }  public class OceanQuakeMarker extends EarthquakeMarker { }   Both child classes are  complaining about the implementation of compareTo() method. I want to know why this error appears in child classes instead of the parent class which is the class that's using the comparable interface

A curious thing happens in Java when you use an abstract class to implement an interface: some of the interface's methods can be completely missing (i.e. neither an abstract declaration or an actual implementation is present), but the compiler does not complain.  For example, given the interface:  public interface IAnything {   void m1();   void m2();   void m3(); }   the following abstract class gets merrily compiled without a warning or an error:  public abstract class AbstractThing implements IAnything {   public void m1() {}   public void m3() {} }   Can you explain why?


I am running Ubuntu 18.04 LTS on a custom PC and it was working great until I installed AMD drivers. I installed Crimson Edition 15.12 driver for ubuntu 32-bit. After the drivers were installed I can't even get the computer up and running to the boot menu it is simply just a black screen so I can't even get into the BIOS or recovery mode to try and fix the issue. I have tried booting it with the graphics card both installed and uninstalled. I am looking for a solution to get my PC up and running so I can remove the drivers. Any help would be greatly appreciated. Thank you.  Parts List:  Motherboard Supermicro X8DTL-i, Xeon 5680 X2, Sapphire ATI Radeon HD 7870 GHz, 32 GB ECC RAM, 750 Watt EVGA PSU, Seagate Barracuda 2TB Hard Drive.

I have 14.04.5/16.04 or newer and an AMD GPU. I'm not getting the performance I want, and some programs say they need things like OpenCL.  I've heard about fglrx, but if I try to install it on my machine, it breaks and I have no GUI.  Is there anything I can do to get my AMD card working to its full potential?


So, I was reading about how bacteria protects its own DNA by methylation against restriction enzyme. But if the plasmid DNA is also methylated then we can't cut plasmid using restriction enzyme for doing cloning. And if we are isolating this plasmid from Methylase deficient strain so that the plasmid is not methylated, won't it would be digested by the bacterial restriction enzyme. Do we isolate these plasmid from a strain that is also unable to produce restriction enzyme ?

In the textbook that I'm using, it explains that bacteria does not digest its own chromosomal DNA because the sites that would be cut by its own endonuclease are methylated. Is there a similar mechanism involved for protecting its own plasmids? If so, how are plasmids cut while serving as vectors?


I have a method that takes a parameter of the type DateTime?  I need to convert what I receive to a string of the format - yyyy-mm-dd  What is the cleanest optimal way to achieve this?

I've got a huge list of date-times like this as strings:  Jun 1 2005  1:33PM Aug 28 1999 12:00AM   I'm going to be shoving these back into proper datetime fields in a database so I need to magic them into real datetime objects.   This is going through Django's ORM so I can't use SQL to do the conversion on insert.


We had to compute the integral $$\int \frac{3}{x^3-1} dx$$ I am just starting to learn about integration, and I have no idea how to begin. Can you please help me solve this? Even a hint would be very helpful. Thank you in advance!  P.S. This question is not really a duplicate because the numerator is 3 not 1, so it is harder. If it were 1, I could do it easily.

this is my first question here so I hope I did everything right. Still really new to LaTeX as well$$\int \frac{1}{x^3 -1}dx $$  I first used partial fractions to decompose this integral into two parts$$\int \frac{1}{3(x-1)}dx -\frac{1}{3} \int \frac{x+2}{x^2 + x + 1}dx$$   I definitely can solve the first part as $\frac{\ln(x-1)}{3}$ but I'm stuck with the second part as I don't know what to do since the denominator is not easily factor-able.   Thanks in advance to anybody taking the time to read this.  Edit: I do know that you can complete the square to make the integral prettier, but I don't know how to cancel the numerator or seperate it to relate the integral to $\int \frac{1}{x^2 + 1}$ to get some value of arctan(x) +c


I read somewhere that the statement "$x \cup y$ exists for every $x$ and $y$" can be proven in $ZFC$ set theory without using the full strength of the union axiom, which says that arbitrary unions exist, not just binary unions. Can that statement also be proven from $ZF$ set theory? Is this an open problem?

If $A$ and $B$ are sets, then $A\cup B$ is defined as follows: $$A\cup B:=\{x: x\in A \, \, \,\text{ or } \, \, \, x\in B\}.$$ In ZFC, $A\cup B$ exists because $\bigcup\{A, B\}$ exists by union axiom, and it is known that axiom of union is independent of rest of ZFC. If there is a set such that $A\subseteq C$ and $B\subseteq C$, then we can define $A\cup B$ using the $C$ and separation axiom. But can I prove the existence of $C$ in ZF-Union? Thanks for any help.


Given a metric space $(X,d)$. Let $A$ and $B$ be two nonempty subsets of $X$. If $A$ is compact and $B$ is closed,  then there exist $x_0\in A$ and $y_0\in B$, such that $d(A,B)=d(x_0,y_0)$?  I know that, if $A$ and $B$ are both compact, then the conclusion is right. But if $B$ is just a closed subset?  Thank you for any help.

Let $A, B$ be subsets of a metric space $X$. If $A$ is compact and $B$ is closed, show that the distance between $A$ and $B$ is achieved.   Attempt at a proof:    Let $A$ be compact and $B$ be closed. Let $m=d(A,B)=\inf_{b\in B} d(A,B)$. Then, there are two possibilities: (a) $\exists b\in B$, $d(a,b)=m$. If this is the case, we're done. (b) $\forall b\in B$, $d(a,b)>m$. In this case,     there exists a sequence $\{b_n\}\subseteq B:$ $d(a,b_n)\rightarrow m$ as $n\rightarrow\infty$ by definition of infinum. Then there exists a subsequence $\{b_{n_k}\}$: $d(b_{n_1},a)>d(b_{n_2},a)>...$ which is monotonic decreasing. Then note that $d(b_{n_k},a)<d(b_{n_1},a)<\infty$. So it's a bounded sequence. Now I want to show that it has a convergent subsequence that converges to $b\in B$ and then I want to do the same for $A$. And then finally to show that $d(a,b)=m$ in fact. Any clues to how to get there?


"My brothers, my cousins, and I" "My brothers, my cousins and I" Which one is correct?

Should I put a comma before the last item in a list?     I would like crackers, cheese and some soda.   I would like crackers, cheese, and some soda.


I'm looking at a datagram-based protocol that encrypts a payload. The payload is encrypted with AES or blowfish in CBC mode, and the result is then authenticated with a HMAC.  To save space, the protocol uses a zero IV, but prepends a special prefix to the data before encryption.  The prefix consists of 12 random bytes, followed by a unique sequence number that isn't reused for the same key.  In summary, the datagram payload basically looks like this:  HMAC(12+ bytes) CBC-ENCRYPT (IV=0, RANDOM(12 bytes) SEQUENCE(4 bytes) REAL_DATA)  My question is, is there an obvious flaw to this construct? As I see it, it basically is like normal CBC, but instead of a fully random IV, it uses ECB-ENCRYPT(random + sequence) as (effective) IV.

What if, instead of using CBC mode in the normal way with a random IV, I used this approach:   Use a fixed IV (like a block of 0's). Before encrypting, generate a random block and prepend it to the plaintext. After decrypting, ignore the first block.   Is this exactly the same in terms of security as using a random IV?  Also, would it make any difference if I used something like a message counter instead of a random block in step 2?


I've tried using codes from Minecraft 1.13 to summon specific villagers, but it doesn't seem to work as I always get the same villager. Is there such a command that works in Minecraft 1.14?

I'm trying to set up a shop system in a vanilla minecraft realm and villagers seem like the most streamlined method of doing so, however I'd also like to make it so that other players on the server can program their own villager, or have me program it for them as an operator so that other players can trade with each other through the villager. I figure that since villagers now have a secret inventory, they can collect items, but I was wondering if there's any way to access the items traded to them or if they just disappear.  Currently my thoughts are that a player would initiate a trade, the villagers sells would be linked to individual slots in a chest and the villager buys could be linked to another chest, allowing the player to fill a chest and thus 'program' their villager, and that finally a third chest would be filled with the item the villager receives, while the chest containing the trades would decrement the specific number of the item in the relevant slot.


I'm building an outdoor bbq and have a 20A circuit with 2 runs - 1 for outlets and 1 for lights. The outlets are done with 20A receptacles and 12 ga wire inside 1/2" emc.  The lights will be hanging pull lights (16 ga wire in the cord) and because it's a little cheaper and easier, I wanted to get power to the fixtures by 14 ga wire, also in 1/2" emc.  Is this a no-no? The only thing on this run would be 5 lights, so very low load.

I am looking at replacing a couple of old, porcelain style single bulb fixtures in my basement with some 4 lamp fluorescent fixtures.  I am actually running new wire to the fluorescent fixtures from a 100amp sub panel in the basement, and not reusing then existing wiring that goes to the current light.  As I was taking the porcelain fixture down I discovered that there is 14 gauge wire going to it - ok.  There are 3 such fixtures in the basement.  There are also other things on this same breaker upstairs in the main living part of the house - 3 or 4 outlets that are on 12 gauge wire.  The breaker is a 20 amp breaker for all of these.  Is this ok to mix 14 & gauge wire like this?  If not, why did they do it?


Let's say I need the decimal value of $\sin/\cos/\tan$ of $33°6'13''$, or just any non-standard value. How do I do that without using a calculator?

In school, we just started learning about trigonometry, and I was wondering: is there a way to find the sine, cosine, tangent, cosecant, secant, and cotangent of a single angle without using a calculator?  Sometimes I don't feel right when I can't do things out myself and let a machine do it when I can't.  Or, if you could redirect me to a place that explains how to do it, please do so.  My dad said there isn't, but I just had to make sure.  Thanks.


Although most examples here come from or are potentially from the Skywalker line (which may or may not make their offspring more powerful),I want to ask, why is it that the Jedi order (before the events of a New Hope when force-sensitives became a rarity and they trained literally anyone 'cos, you know... no choice) thinks it's better to train Jedi at a young age?  Yoda complained about training Luke at the age of 19 in TESB, and even declared an eight-year-old Anakin to be too old. However, both turned out to be extrememly powerful Jedi, and even an untrained Leia was proficient at sensing events through the force.  Although I hate to bring this up with no clear answers yet, but maybe it'll be pertinent in the future: Rey, who received the least amount of training, was instantly able to master Jedi mind-tricks (which stumped a similarly-aged Ezra on his first- and conscious- attempt at doing so), great lightsaber fighting skills and Force abilities.  Is it simply because these Jedi were of the Skywalker line that makes them more powerful -passing on those (whispers midichlorians) like a pro...?     Why not allow users to develop both mentally and physically before teaching them about the Force? After all, Anakin- the youngest of these examples and longest trained- was not a liability due to his age, but due to his mental instability.

Anakin Skywalker was about nine years old (see script link, below) during "The Phantom Menace". Yet according to various people, he was too old (or even "far too old") to begin training as a Jedi:   QUI-GON: "I'm afraid not. Had he been born in the Republic, we would have identified him early, and he would have become Jedi, no doubt...he has the way. But it's too late for him now, he's too old." OBI-WAN: "The boy will not pass the Council's tests, Master, and you know it. He is far too old." MACE WINDU: "He is too old. There is already too much anger in him." and even ANAKIN himself: "I'm with Qui-Gon...but...they're not going to let me be a Jedi. I'm too old."   All quotes above from .  However, during "The Empire Strikes Back" Yoda gives Luke's age (18 in chapter IV according to the ) as the reason to deny him training only after first saying that Luke is:   too impatient too angry not ready is unfocused ("Never his mind on where he was") and reckless   All from .  I would have thought that, if at 9 Anakin was too old, Yoda would have seen Luke at 18+ and started off by saying, "No chance, he has".  So, what is the age to begin Jedi training?


I have bought XOLO Q1010 it has Android version 4.2.2. Is it possible to upgrade to Android version 4.4 KitKat? if yes then how?  Thanks.

This Community Wiki question is designed to be the "canonical question" for questions asking how to upgrade one's device to a new Android version.   I want to get a newer version of the OS for my Android device. How can I do that?  See also:


Imagine an electron around an atom absorbs a photon and becomes excited, it has now jumped to a higher orbital. At this point in time, where does the momentum of the photon goes?

Suppose I have an atom in its ground state $|g⟩$, and it has an excited state $|e⟩$ sitting at an energy $E_a=\hbar\omega_0$ above it. To excite the atom, one generally uses a photon of frequency $\omega$ equal (or sufficiently close to) the transition frequency $\omega_0$, and this will stimulate a transition.  One thing that is often left by the roadside,* though, is the fact that the incoming photon has momentum as well as energy, and that if the atom wants to swallow the energy it also needs to swallow the momentum. So, in the nuts and bolts of states and operators,     how does one describe the transfer of momentum during an atomic transition?   In addition to this, the fact that this recoil momentum is rarely mentioned is a good indication that it is also rarely an issue. Why is it that in most circumstances we can safely ignore the photon's momentum when describing electronic transitions?  *Apart from treatments of Doppler cooling, which simply take the momentum transfers for granted and do not explain how and why they happen.


I'm studying a paper called "". As it can be understood from its name, it has proposed an optimization algorithm based on the reaction of a bacterium toward its environment. The bacterium tends to go towards chemoattractants and stay away from repellents. The path of the bacterium consists of a sequence of straight-line trajectories that each of them has a different direction and duration.  In order to calculate the duration of each trajectory (denoted by τ), they have used an exponential probability density function like this:  $$P(X=τ) = 1/T e^{-τ/T}$$  where for $f_pr / l_pr >= 0$, $T=T_0$ and for $f_pr / l_pr < 0$, $T=T_0 (1+b|f_pr / l_pr|)$  I'm new to exponential distribution, as far as I know the formula for the exponential distribution is:  $P(X>x) = e^{-\lambda x}$ and $P(X<x) = 1-e^{-\lambda x}$  and the probability of the value of $P(X= a.constant.number)$ is equal to $0$, isn't it? If so, what is the meaning of the presented formula in the paper?  My second question is that: according to what I stated about the paper, does $T$ here denote the mean duration of the trajectories up to this moment?

On the , there is this line:      $p(\mathrm{height}|\mathrm{male}) = 1.5789$ (A probability distribution over 1 is OK. It is the area under the bell curve that is equal to 1.)    How can a value $>1$ be OK? I thought all probability values were expressed in the range $0 \leq p \leq 1$. Furthermore, given that it is possible to have such a value, how is that value obtained in the example shown on the page?


The Dell Windows 7 just died and I have a ThinkPad with new hard drive & Ubuntu 10.1. Can I update to Ubuntu 15.4? How? I can't figure out how to connect to WiFi (private secure connection). I realize it is an old computer but was refurbished. Geek that installed OS moved away and both computer stores can't help me with Linux. Any suggestions?

I am currently using Ubuntu 10.04. I know there is a 10.10 release, but can I upgrade directly to 11.04? Could you walk me through the steps please?


$\lim_{n\to\infty}\frac{2^n\cdot n!}{n^n}$   I think we can do it by squeeze rule but I could not find a sequence bigger than this one converging to 0 without using Stirling approximation of n!

Let $c>0$ be a real number. I would like to study the convergence of $a_n := c^n n!/n^n$, when $n \to \infty$, in function of $c$.   I know (from  question) that $n!>(n/e)^n$, so that $c^n n!/n^n>1$ for $c ≥e$. But this doesn't imply that the sequence goes to infinity. And I'm not sure what to do for $c<e$. I tried usual tests (D'Alembert...), without any success. I would like to avoid using Stirling approximation.  Thank you for your help!


Statement: The lower the p-value corresponding to some test statistic, the greater the evidence against the null hypothesis.  I see this statement everywhere, I would argue that this statement is false for the simple reason that "evidence against the null hypothesis" can only translate into its probabilistic equivalent $P(\text{null hypothesis being true| the data})$. Ofcourse this probability must be unknown because p-values deal with the reverse conditional probability--- the test statistic exceeding the observed value assuming that the null is true.

Johansson (2011) in "" (here is also ) states that lower $p$-values are often considered as stronger evidence against the null. Johansson implies that people would consider evidence against the null to be stronger if their statistical test outputted a $p$-value of $0.01$, than if their statistical test outputted a $p$-value of $0.45$. Johansson lists four reasons why the $p$-value cannot be used as evidence against the null:        $p$ is uniformly distributed under the null hypothesis and can therefore never indicate evidence for the null.    $p$ is conditioned solely on the null hypothesis and is therefore unsuited to quantify evidence, because evidence is always   relative in the sense of being evidence for or against a hypothesis   relative to another hypothesis.   $p$ designates probability of obtaining evidence (given the null), rather than strength of evidence.   $p$ depends on unobserved data and subjective intentions and therefore implies, given the evidential interpretation, that the   evidential strength of observed data depends on things that did not   happen and subjective intentions.      Unfortunately I cannot get an intuitive understanding from Johansson's article. To me a $p$-value of $0.01$ indicates there is less chance the null is true, than a $p$-value of $0.45$. Why are lower $p$-values not stronger evidence against null?


I need to prove that the ∃x(R(x)→∀yR(y)) is logically valid. I'm trying to understand why this statement is true but I can't figure it out.

Why is this true?  $(\exists x)(P(x) \Rightarrow (\forall y) P(y))$


Now, this is highly conceptual. I don't know if I understand this correctly, so please help me understand the difference.  Let's assume that name is a private std::string data member that is accessed by the getName() accessor function:  const string& getName() const {        return name;   }   Now then, this returns a reference, which is just another word for alias, to name. So, an alias is being returned, i.e. the name data member is being returned. Is this allowed or will it defeat the whole purpose of data hiding?   In other words, how exactly is the above method different to the conventional:  string getName() const {      return name; }   ???  And finally, is it really worth implementing the former instead of the latter?

Whilst refactoring some code I came across some getter methods that returns a std::string.  Something like this for example:  class foo { private:     std::string name_; public:     std::string name()     {         return name_;     } };   Surely the getter would be better returning a const std::string&?  The current method is returning a copy which isn't as efficient.  Would returning a const reference instead cause any problems?


Here are pictures of why render and of my scene.

I am making a house in Blender Cycles. In rendered mode, all shaders are somehow visible, even though I don't use any lamps. I do have an environment texture, however it shouldn't light up the inside of the house. Especially when there are no windows. Even if I set the background strength to 0, it still lights up the inside and outside of the house.  So now, if I add any lamps, I has nearly no impact on shadows, shaders, reflections etc. What could be wrong with my scene?  Let me know if you have any questions on my settings that might help you find the problem.  File:   These are the world settings:   For the Ambient occlusion I always use this node:   It usually works fine.


I have this code:  SELECT CAST(Numero as varchar(255)) + ';' as Result  FROM Acao   This code returns this:    I want to return a single line like this: "52;56;57;59", because I want to put this in a formula of a computed column. How do I do this using SQL?

I'm trying to migrate a MySQL-based app over to Microsoft SQL Server 2005 (not by choice, but that's life).  In the original app, we used almost entirely ANSI-SQL compliant statements, with one significant exception -- we used MySQL's group_concat function fairly frequently.  group_concat, by the way, does this: given a table of, say, employee names and projects...  SELECT empName, projID FROM project_members;   returns:  ANDY   |  A100 ANDY   |  B391 ANDY   |  X010 TOM    |  A100 TOM    |  A510   ... and here's what you get with group_concat:  SELECT      empName, group_concat(projID SEPARATOR ' / ')  FROM      project_members  GROUP BY      empName;   returns:  ANDY   |  A100 / B391 / X010 TOM    |  A100 / A510   So what I'd like to know is: Is it possible to write, say, a user-defined function in SQL Server which emulates the functionality of group_concat?   I have almost no experience using UDFs, stored procedures, or anything like that, just straight-up SQL, so please err on the side of too much explanation :)


$$(z+1)^6=z^6 $$ $$\frac{(z+1)^6}{z^6 }=1$$ $$\left(\frac{(z+1)}{z }\right)^6=1$$ $$\left(\frac{(z+1)}{z }\right)^6=\cos(2*\pi*k)+i\sin(2*\pi*k)$$ $$\frac{(z+1)}{z }=\left(\cos(2*\pi*k)+i\sin(2*\pi*k)\right)^{1\over6}$$ $$1+\frac{1}{z }=\cos({2*\pi*k\over6})+i\sin({2*\pi*k\over6})$$  $$\frac{1}{z }=(\cos({\pi*k\over3})-1)+i\sin({\pi*k\over3})$$ $$\frac{1}{(\cos({\pi*k\over3})-1)+i\sin({\pi*k\over3}) }=z$$ I dont know how else to solve this. A lot of help is appreciated. Also i know that k should go from 1-5.

Find all $x$ such that $$x^6=(x+1)^6.$$   So far, I have found the real solution $x= -\frac{1}{2}$, and the complex solution $x = -\sqrt[3]{-1}$.  Are there more, and if so what/how would be the most efficient find all the solutions to this problem? I am struggling to find the rest of the solutions.


I wrote the following sentence and was criticized for using a comma before the quotation marks.      Steve states: The topic for discussion will be Friedrich Nietzsche's controversial philosophical concept of the, "Superman or Overman."    The "Ubermensch" was Nietzsche's concept but the English translations of it, that Steve insisted I use because other people use them, were not his and more importantly they are both incorrect. The correct translation would be, "Superhuman," as the concept was not meant to be gender specific.  Is using a comma before quotation marks in the above sentence, for the reasons that I have stated, acceptable or not?

Sam developed an annual sweepstakes promotion entitled “The Free Gas Punt Return Game”.    Do I need a comma after entitled or not?


I'm from Malaysia and I have visa-free entry to the Schengen area for 90 days. On January 1st, my visa-free entry renews. I'm running an Internet start up and am based in Toronto, Ontario, Canada.  I'm planning to enter the Schengen area again on the 31st since I want to celebrate New Year's Eve and my engagement ceremony on that day. My fiance and I aren't married yet but we are getting engaged on the 31st. He is Austrian, so that isn't an issue, but if I enter the Schengen area on the 31st, a day before my Visa free entry date starts, would that be a problem?  I've already applied for my Rot-Weis-ROT CARD so that I can establish my start-up in Austria. It's been 6 weeks since I applied for it in October (2nd or 3rd week) and they probably received my application in November. They have also had a recent election, which has slowed down the process according to my fiance.  Is this possible?

I have searched the web a lot and could not find an answer that fits my situation. Here are two links that are quite contradictory:       My situation:  I've visited Portugal in December 2012 for 29 days on a Schengen visa valid from December 1st, 2012 to February 1st, 2013 for research purposes (I am a Ph.D. student). I want to visit Sweden from February 10th, 2013 to May 10th, 2013 (89 days). I have applied for a Schengen visa again (for research). How will the 90/180 rule work in my situation?


I'm making a minigame and I need to summon 100 Zombies in 1 command block. How do I do so?

I am looking to try and set multiple commands in a single command block, but so far everything I have tried just returns "Unknown Command".  What is the format for writing multiple commands in a single command block in Minecraft 1.8?  Can I use either of the following:  Command:(command here) Command:(command here)     /command here; /command here;   Or is there another format?


Please bear with me as my knowledge on electrical is very limited.  Background   Question relates to a driving simulator product = Thrustmaster T500 Product uses a 24v / 6.67a 4 pin power supply (factory supplied)   Context   I intend to purchase one but it does not come with a power supply I can source one on Amazon / Ebay but it is extremely expensive ($100AUD) The product will be used in Australia. There is someone who has used a 19v / 7.1a laptop power supply and simply cut the wires (male from power unit / femal in the base) and connected the positive and negatives back together in order to power the unit. They claim everything works, and been using it for over a year with no problems   Concerns   I understand if I do this I will lose any warranty on the base Unsure if not using recommended volt/amp is a wise decision Asthetically it will look ugly as its hard to hide all the wires The only Pro is that the cost will be very minimal, especially if I can find a 2nd hand laptop PSU   Question   Is doing it the "cheap" way possible and logical ? What are the implications of using the non recommended volt/amp   BTW - I tried to find an answer to no avail. Thanks heaps for reading up this far and your feedback will be greatly appreciated :)  Kind regards  Gary

Power supplies are available in a wide range of voltage and current ratings.  If I have a device that has specific voltage and current ratings, how do those relate to the power ratings I need to specify?  What if I don't know the device's specs, but am replacing a previous power supply with particular ratings?  Is it OK to go lower voltage, or should it always be higher?  What about current?  I don't want a 10 A supply to damage my 1 A device.


Which of these is correct?     Our company has a philosophy that "People Matter".      Our company has a philosophy that "People Matter."   Does the period go inside the quotes here or outside?

The American convention in quotations is (typically) to place punctuation inside quoted text. But I always run into situations where the punctuation of the quote interferes with the punctuation of the sentence. How would you punctuate this (American, non technical)?     When my friends ask, "What do you want for your birthday?", I never know how to respond.   It seems odd to place the last comma outside the quote simply because of the question mark. Is that the preferred (i.e. most often accepted) standard?


Finding the limit using L'Hopital's method might seem fine for me, but how can you prove that the limit exists :   $\lim_{n \in\mathbb N}\sqrt[n]n$

Thomson et al. provide a proof that $\lim_{n\rightarrow \infty} \sqrt[n]{n}=1$ in . It has to do with using an inequality that relies on the binomial theorem:  I have an alternative proof that I know (from elsewhere) as follows.  Proof. \begin{align} \lim_{n\rightarrow \infty} \frac{ \log n}{n} = 0 \end{align} Then using this, I can instead prove: \begin{align} \lim_{n\rightarrow \infty} \sqrt[n]{n} &= \lim_{n\rightarrow \infty} \exp{\frac{ \log n}{n}} \newline & = \exp{0} \newline & = 1 \end{align}  On the one hand, it seems like a valid proof to me. On the other hand, I know I should be careful with infinite sequences. The step I'm most unsure of is: \begin{align} \lim_{n\rightarrow \infty} \sqrt[n]{n} = \lim_{n\rightarrow \infty} \exp{\frac{ \log n}{n}} \end{align} I know such an identity would hold for bounded $n$ but I'm not sure I can use this identity when $n\rightarrow \infty$. Question: If I am correct, then would there be any cases where I would be wrong? Specifically, given any sequence $x_n$, can I always assume: \begin{align} \lim_{n\rightarrow \infty} x_n = \lim_{n\rightarrow \infty} \exp(\log x_n) \end{align} Or are there sequences that invalidate that identity?  (Edited to expand the last question) given any sequence $x_n$, can I always assume: \begin{align} \lim_{n\rightarrow \infty} x_n &=  \exp(\log \lim_{n\rightarrow \infty} x_n) \newline &=  \exp(\lim_{n\rightarrow \infty} \log x_n) \newline &=  \lim_{n\rightarrow \infty} \exp( \log x_n) \end{align} Or are there sequences that invalidate any of the above identities? (Edited to repurpose this question). Please also feel free to add different proofs of $\lim_{n\rightarrow \infty} \sqrt[n]{n}=1$.


I've just met tensor products of modules in part of my self-study and as a concrete exercise I've been asked to calculate $\mathbb{Z}/(10){\otimes}_{\mathbb{Z}} \mathbb{Z}/(12)$. Short of writing out each symbol $m\otimes n$ and finding which ones are equal to each other, is there a good way to do this?

I've just started to learn about the tensor product and I want to show: $$(\mathbb{Z}/m\mathbb{Z}) \otimes_\mathbb{Z} (\mathbb{Z} / n \mathbb{Z}) \cong \mathbb{Z}/ \gcd(m,n)\mathbb{Z}.$$  Can you tell me if my proof is right:  $\mathbb{Z}/m\mathbb{Z}$ and $\mathbb{Z} / n \mathbb{Z}$ are both finite free $\mathbb{Z}$-modules with the basis consisting of one single element $\{ 1 \}$. So $(\mathbb{Z}/m\mathbb{Z}) \otimes_\mathbb{Z} (\mathbb{Z} / n \mathbb{Z})$ has the basis $\{ 1 \otimes 1 \}$.  Therefore, any element in $(\mathbb{Z}/m\mathbb{Z}) \otimes_\mathbb{Z} (\mathbb{Z} / n \mathbb{Z})$  is of the form $(ab) 1 \otimes 1$ and any element in $\mathbb{Z}/ \gcd(m,n)\mathbb{Z}$ is of the form $k 1 = k$ where $k \in \{ 0, \dots , \gcd(n,m) \}$.  I would like to construct an isomorphism that maps $ab$ to some $k$. Let this map be $ab (1 \otimes 1) \mapsto ab \bmod \gcd(n,m)$.  This is a homomorphism between modules: it maps $0$ to $0$ because it maps the empty sum to the empty sum. It also fulfills $f(a + b) = f(a) + f(b)$ because there is only one element, $a = 1$.   It is surjective. So all I need to show is that it is injective. But that is clear too because if $ab \equiv 0 \bmod \gcd(m,n)$  then both $a \equiv 0 \bmod n$ and $b \equiv 0 \bmod m$ so the kernel is trivial.  Many thanks for your help!!


Let $n$ be a natural number. Show that   $$\left[ \frac{n}{1} \right ] + \left[ \frac{n}{2} \right ] + \left[ \frac{n}{3} \right ] + \cdots + \left[ \frac{n}{n} \right ] + [\sqrt{n}]$$ is even. Here $[x]$ means the greatest integer less than or equal to $x$.    Let $$f(n) = [\sqrt{n}] + \sum_{k=1}^{n} \left[ \frac{n}{k} \right]$$  $$f(1) = [1] + [1] = 2 \checkmark$$  The statement for $f(n+1)$ is to be proved:  $$f(n+1) = [\sqrt{n+1}] + \sum_{k=1}^{n+1} \left[\frac{n+1}{k} \right]$$  I just need some hints from now?

Let $n$ is a natural number. Prove that $$\left\lfloor\frac{n}{1}\right\rfloor+\left\lfloor\frac{n}{2}\right\rfloor+....+\left\lfloor\frac{n}{n}\right\rfloor+\left\lfloor{\sqrt{n}}\right\rfloor$$   is even.   I used induction and the inequality $$x-1<\lfloor{x}\rfloor\le{x}$$ to prove it.  Is there any other, nicer way to do it?


After upgrading my mac to Catalina beta, there is an added icon on the menu bar. It looks like a "remove the drive" button but I don't need it.  Is it possible to remove it from the menu bar? Tapping it only reveals "no drive" menu and I has not been able to find anything relevant on System Preferences.

￼How do I get rid of this icon?  I'm not even sure what it's for. It's possible that it's for remote CD Drive, but I don't remember how I got it up there in the first place.  Details:   iMac 27 inch late 2012 OS X Mavericks


I take a string with integer count  int count=0; string s="wow"   and i am using foreach loop to count number of characters in a  specified string   foreach(char ch in s) {  count++ }   so how can i count those characters which are repeated in my string like 'w'.

If I have the following string:  string s = "abcdefghab";   Then how do I get a string (or char[]) that has just the characters that are repeated in the original string using C# and LINQ. In my example I want to end up with "ab".  Although not necessary, I was trying to do this in a single line of LINQ and had so far come up with:  s.ToCharArray().OrderBy(a => a)...


I found my laptop powered on from Stand by mode about 6 hours later. I did a research around the site to find out the reason why it would automatically turn on from sleep. So, it told me to go into the power management of the devices and disable the wake up of computer sleep. I'll do that.  What I want to know is: Can I know exactly what made my computer wake up from sleep? Does it keep track of it the logs or events?  Update:  I have looked into the Event viewer to figure out the time when my computer came out from sleep:  The system has returned from a low power state.  Sleep Time: 2013-09-10T11:46:31.927985300Z Wake Time: 2013-09-10T16:46:38.116075100Z  Wake Source: Unknown   It clearly says that the Source was Unknown. Is there still possibility I might get to know?

Every night I put my Windows 7 machine into sleep mode, and every morning I wake up and the thing is running.    How I can find out which process is waking the thing up?  I've already looked at the Event Log and for the past two days the answer seems to be the "Windows Image Acquisition (WIA) service entered the running state."  What can I do about this?


I have a dedicated server with a domain tied to the IP that came with the box. I got another IP assigned to the server and want to know if there's a way I can run my second domain, using that second IP, on the same server?  I know there's software like Virtualmin for hosting multiple domains on one server, but I would like to know if there's a way to do this without utilizing such software.  Any help is appreciated. Thanks.

I have a VPS that I've installed a Apache Web Server on. What I want to do is forward my own website domains to that server and host those websites' files inside my Apache Web Server. As far as I understand a DNS server is required to manage which domain is hosted where (IP-wise). But what I want to do is host my websites under the same IP address, the one that my web server has. How can I separate those websites' files inside my web server so I don't have to use http://host/foo for www.foo.com and http://host/bar for www.bar.com?


Everyone says space is expanding and distances between galaxies growing. But space isn't limited to outside of the earth. Space is everywhere on earth and around me. However I don't notice any expansion of the space around me? Is it because I am on Earth and the local space is affected by gravity?

I have looked at other questions on this site (e.g. "why does space expansion affect matter") but can't find the answer I am looking for.  So here is my question: One often hears talk of space expanding when we talk about the speed of galaxies relative to ours. Why, if space is expanding, does matter not also expand? If a circle is drawn on balloon (2d plane), and the balloon expands, then the circle also expands. If matter is an object with 3 spatial dimensions, then when those 3 dimensions expand, so should the object.  If that was the case, we wouldn't see the universe as expanding at all, because we would be expanding (spatially) with it.  I have a few potential answers for this, which raise their own problems:   Fundamental particles are 'point sized' objects. They cannot expand because they do not have spatial dimension to begin with. The problem with this is that while the particles would not expand, the space between them would, leading to a point where the 3 non-gravity forces would no longer hold matter together due to distance Fundamental particles are curled up in additional dimensions a la string theory. These dimensions are not expanding. Same problems as 1, with the added problem of being a bit unsatisfying. The answer seems to be (from Marek in the previous question) that the gravitational force is so much weaker than the other forces that large (macro) objects move apart, but small (micro) objects stay together. However, this simple explanation seems to imply that expansion of space is a 'force' that can be overcome by a greater one. That doesn't sound right to me.


In Overwatch, armor reduces damage taken by 5. Is there a minimum damage or it actually goes to 0?  Lets take Winston for ex. He has:     Tesla Cannon:      Type:     Multitarget Beam      Damage:   60 per second, 3 per round      Maximum range     8 meters      Area of effect    6 meter width      Ammo  100      Ammo usage    20 rounds per second      Reload time     1.5 seconds      Headshot  ✕   If you check the bolded part you see that he actually does 3 damage per round. That, reduced by armor means -2 (0 since I guess you don't start healing the enemy :)) ) damage. This basically means that any character with 1 armor is unbeatable by Winston. My instinct (and the 99999 kills in Overwatch - although I never checked if the dead ppl had armor or not :P) tells me I'm wrong, but can't find anything to back me up.  Is there maybe a minimum of 1 damage/round or something?

Overwatch has many sources of health. What do all these terms mean?   Health Life Armour Shield


What is the difference between "a half century" and "half a century"? Is there a specific time when each phrase should be used, or is it simply a matter of preference?

I'll be back in half an hour. I'll be back in half hour.   Which is the correct sentence? Are there any differences between British English and American English?


A guy on Instagram wants to be my sugar daddy and send me money through bitcoin. We've only been talking for about a week and he hasn't asked for any of my info. He just asked to sign up for a blockchain wallet. He said I can use the CashApp app and cash out my bitcoin? Is it a scam?

I met a guy on a sugar daddy dating site and we talked, I told him my situation and he said he would help.   He asked for my bank account information and I told him you can use cash app or PayPal to go through. He said his account manager deals with his finances. So I set up an account with a bank that I don’t use so that my primary account isn’t used.  Eventually he was in the process of sending me money and we had agreed on a amount that wasn't crazy. But then he asked for my address and I asked why and he said just wondering. Then said he wanted to send me a surprise for being his baby. Which I didn’t give.  Then later on he sent the money and said he sent me a bonus and that I was supposed to use that to pay his mothers caregiver, which he didn’t mention until after.  I kept questioning him and he was saying that he works in construction and he’s trusting me to carry out the errand. Then he said don’t let him down and I asked him if he was threatening me and he kept saying I need this done but didn’t really answer my question.  Am I being scammed? I’m about to change my password but is this a scam?


I am trying to make this matrix with the lines over it, as the image:    I know the matrix environment but I don’t know how to do this. Thanks.

Is there a way to create a new command with 9 arguments ({a_{11}},{a_{12}},{a_{13}},{a_{21}},{a_{22}},{a_{23}},{a_{31}},{a_{32}},{a_{33}}) that has as output a matrix with the Sarrus Rule? For instance: to obtain     just use the command that we will call sarrus:  \sarrus{-k}{k-1}{1}{0}{k-1}{k}{2}{0}{1}.   If it is possible i want to use the command sarrus in math mode just like matrix for istance.


What can be said about the radius of convergence of the poower series  $$\sum_0^{\infty} n!x^{n^2}$$  I know that $\limsup_{n\to\infty}(n!)^{\frac1{n}}\to\infty$. Is that of any use here? Should I use ratio test or root test? Any hints? Thanks beforehand.

Find all x for which $\sum_{n=1}^n x^{n^2} n!$ is convergent  So I tried using the ratio test and got $\lim_{n\to \infty} x^{2n+1}(n+1)$ but I don't know how to proceed from that.   I also tried using the root test which gave me $\lim_{n\to \infty} x^{n}(n!)^{1/n}$ which wasn't really helpful either...


I'm really confused.  uint8_t hash[20]; uint32_t u;  // Setting hash to some value here...  u = *(uint32_t*) hash;   This *(uint32_t*) hash causes a warning:   Dereferencing type-punned pointer will break strict-aliasing rules [-Wstrict-aliasing].   I think it's something wrong in typecasting, but I'm not sure, because I don't clearly know on how *(type*) var way of typecasting actually works. It seem to point on an object with an asterisk inside too. I am confused, that's the thing which forces me to ask a question about that. Especially I'd like to know how type* differs from *(type*). This may be a lot of help to get rid of this warning. Thanks in advance.

When asking about , people sometimes refer to the strict aliasing rule. What are they talking about?


Consider a binary matrix $\mathbf A_n$ corresponding to values $0$ to $2^n-1$ where each row represents a length $n$ binary representation of a real number. For example, for $n=3$ we have  $\mathbf A_3=\begin{bmatrix}      0   &  0   &  0\\      1    & 0  &   0\\      0   &  1  &   0\\      1   &  1   &  0\\      0   &  0  &   1\\      1  &   0   &  1\\      0   &  1  &   1\\      1  &   1    & 1 \end{bmatrix}.$  Consider two arbitrary non-zero binary vectors $\mathbf v_1, \mathbf v_2$ of length $n$ (column vector) such that $\mathbf v_1\neq\mathbf v_2$. Now, assume $\mathbf u_1=\mathbf A\mathbf v_1$ (mod $2$) and $\mathbf u_2=\mathbf A\mathbf v_2$ (mod $2$) . I can verify for an arbitrary $n$ that $\mathbf u_1.^*\mathbf u_2$ (element-wise multiplication) has always $2^{n-2}$ ones. For example, for $\mathbf A_5$ and $$ \mathbf v_1=\begin{bmatrix}0,\ 0,\ 1,\ 1,\ 1\end{bmatrix}^T, \mathbf v_2=\begin{bmatrix}0,\ 1,\ 0,\ 0,\ 0\end{bmatrix}^T $$ We have  $$ \mathbf u_1.^*\mathbf u_2=\begin{bmatrix} 0\     0\     0 \    0 \    0  \   0\     1 \    1\     0 \    0 \    1  \   1 \    0  \   0 \    0  \   0 \    0 \    0\     1\  1\     0 \    0  \   0\     0 \    0\     0 \    0 \    0 \    0 \    0\     1\     1\end{bmatrix}^T $$ of length $2^5$ which has $2^{5-2}=8$ ones. I am looking for an analytical way to prove this.


I recently reread The Deathly Hallows, in which Hermione uses polyjuice potion to turn into Bellatrix Lestrange. I was wondering whether Hermione could have summoned Lord Voldemort by touching the Dark Mark. It is not the original mark after all.

I was just reading Harry Potter and the Deathly Hallows, and I was wondering, when Hermione Granger changed into Bellatrix Lestrange, she should've obtained the Dark Mark, temporarily.  Now, my question is: would the Dark Mark work if pressed?


I'm trying to add rooms to the N,S,E,W of every room I create using this function; typedef struct {      object roomObject;      int status;      Creature creaturesInRoom[10];      Room n,s,e,w; }Room;  However, I cant add room objects to a room object. Is there any way to get around this?

I haven't been writing C for very long, and so I'm not sure about how I should go about doing these sorts of recursive things... I would like each cell to contain another cell, but I get an error along the lines of "field 'child' has incomplete type". What's up?  typedef struct Cell {   int isParent;   Cell child; } Cell;


I have a r.v. $X$~Poisson($\lambda$). Denote $Y=⌊X/a⌋$. What will be the distribution of $Y$ and how to calculate its mean? (A relaxation can be made if it makes the problem simpler: $a$ is an integer).  What I got so far: $P(Y=k)=P(X∈[ak,ak+a))=Fx(⌊ak+a⌋)-Fx(⌈ak⌉),k=0,1,2,... $, where $Fx$ is the CDF of r.v. $X$.   I can't go any further and derive a closed-form expression for $E[Y]$.  Any help will be much appreciated. Thank you.

If I have random variables $X_1,X_2,\ldots,X_n$ that are Poisson distributed with parameters $\lambda_1, \lambda_2,\ldots, \lambda_n$, what is the distribution of $Y=\left\lfloor\frac{\sum_{i=1}^n X_i}{n}\right\rfloor$ (i.e. the integer floor of the average)?  A sum of Poissons is also Poisson, but I am not confident enough in statistics to determine if it is the same for the case above.


My HP laptop is asking for Power On Password that I never setup.  How do I get around the password and how do I remove this setting so the problem does not recur?

My neighbor has asked me help with his laptop, an HP with lost power-on password. I tried inserting an Ubuntu cd to format the partition, but well... it doesn't even get there. Any ideas?


Spells like Mass Suggestion require that the target(s) must be able to hear and understand you.  The Great Old One’s Awakened Mind allows a Warlock to telepathically speak and be understood by anyone that understands at least one language (not necessarely those the Warlock knows).  My question is : within the Awakened Mind’s 30ft radius, can you affect creatures with Mass Suggestion even if their known languages don’t include yours ?

Can the warlock class feature "awakened mind" be used in conjunction with the suggestion spell, allowing the warlock to make the suggestion telepathically?  Awakened Mind, Player's Handbook p. 110:     You can telepathically speak to any creature you can see within 30 feet of you. You don't need to share a language with the creature for it to understand your telepathic utterances.   Suggestion, Player's Handbook p. 279:     You suggest a course of activity (limited to a sentence or two) and magically influence a creature you can see within range that can hear and understand you.   If it works with suggestion, would it also work with mass suggestion?  To be clear, I am not asking about the verbal component of the spell, only the method the caster "suggests a course of activity".


Many big Sci-Fi and Fantasy works, such as Harry Potter and Star Wars, have so much material spanning multiple media types that they have to be pruned every now and again and redefine different levels of canonicity. For example, before Disney came along, there were (I believe) 5 different types of canonicity in the Star Wars universe. Even after Disney, there are still two types. There are also multiple levels in the Harry Potter universe, where the books and word of JK are Tier 1, and the movies are Tier 2.  Does Tolkien's Legendarium have a similar setup, where the books are on a higher level of canonicity than the movies, or is it simply a case of "The movies are not canon"? If so, what are these tiers?

It is almost always difficult to determine the canonicity (if that's a word) of different works within a fictional universe, but the problems are even more complicated in regards to Tolkien's Middle-earth/Arda related material.  It is safe to say that LotR, the second edition of The Hobbit, and probably the published Silmarillion are canon.  But even the published Silmarillion is, in large part, the work of Christopher Tolkien, although to a lesser degree than it is the work of his more famous father.    When we look at the rest of the corpus, things become even more opaque.  Unfinished Tales contains different versions of the same stories.  The same is true, in even greater degree, of The History of Middle-earth.  These volumes might be considered an almost equal endeavor on the parts of Christopher and J.R.R Tolkien.    Is there a tentative canon of Tolkien's Middle-earth related works, and if not, is it possible to create one?    With such a large body of work, of varying degrees of canonicity, it would be very helpful to have something like the now-outdated levels of canon associated with the Star Wars universe, ranked by a series of letters.  Has anyone put together such a system for Tolkien's Middle-earth related works?


As I was researching about how wifi works, I saw that wireless information exchange happens by using electro magnetic waves.  Also, the shorter the electro magnetic waves are, the less they can pass a material (like a wall). So senders with 5 GHz are not able to send as good as senders with 2.4 GHz through a wall.  And light is also an electro magnetic wave, right? So what would happen if the wavelength of it got doubled? or tripled?  Would light then be able to "go through a wall"?

I did search the question on Physics S.E considering it would be previously asked. I found this  But in this question , the answers are w.r.t to or in comparison with microwaves , their absorption and certain other things. I didn't find a sort of general answer that could be the answer to the question. So the question is - wifi or radio waves  reach us through concrete walls . They also reach us through the ceiling (if some one is using it in the flat above ours ). Even through the air they travel such a lot , bending around corners or doors . Now I would not compare them to microwaves (because I don't want the answer in terms of properties of the material but physics). Visible light which is so much powerful than them can't penetrate black opaque paper leave alone the walls. Same is true for gamma rays (penetration through a very thick wall). So why then radio waves being so very less powerful than light  waves are able to travel through walls? There should be a general concept as to why the radio waves are able to pass through walls but microwaves or light waves cannot ! A linked question is also that sound travels much faster in solids(walls) but is not audible in it though it is in air. After reading @BillN's answer, it would be really helpful if any one could explain it in terms molecular resonance or crystalline structure or electrical conductivity or how does molecular resonance or crystalline structure or electrical conductivity cause this.


After executing cd %TEMP% i was taken to C:\Users\KRISWE~1\AppData\Local\Temp I have never seen the folder KRISWE~1 before, does anyone know what this is? It seems to be exactly identical to my regular user folder. It doesn't show up as a hidden folder, and i can only access it via cd. I noticed it's exactly 8 characters long, so i was thinking it might be some sort of hidden legacy system. Does anyone know?

Since my first Windows 98 (and even now on Win7), I could enter the first 6 letters (symbols) of a folder's name and add ~1 after it (when there was just one folder with those six letters in current directory), and it would work as the full name of it. And it appears that if there are more than one folder with the same six first symbols in its name, I can use FOLDER~2 and so on, and it will open the corresponding folder, as if I entered its full name. Like c:\progra~1 will open C:\Program Files and c:\progra~2 will open C:\Program Files (x86) on win7 64 bit.  How does this work?


How many normal subgroups does a non abelian group $G$ of order 21 have other than the identity subgroup $\{e\}$ and $G$?  I think we can solve the problem using syllow's $p$-subgroups

How many normal subgroups does a non-abelian group $G$ of order $21$ have other than the identity subgroup $\{e\}$ and $G$?  1) 0  2) 1  3) 3  4) 7  I think option 1 is incorrect because every group of order 1 to 59 is not simple. Hence group of order 21 has atleast one normal subgroup.   Now from the Sylow's theorem we get there has one subgroup of order 7 and one subgroup of order 3 or 7 subgroup of order 3. Since 3 and 7 are primes then any group of order 3 and 7 is cyclic. hence normal. I think I am wrong some where but I am unable to locket the point. please help me to choose the right answer.


I know the proof using binomial expansion and then by monotone convergence theorem. But i want to collect some other proofs without using the binomial expansion.  *if you could provide the answer without the concept of calculus it will be appreciated * But any way do provide whatever method you can.

Here is my candidate for  the most elementary proof that $\lim_{n \to \infty}(1+1/n)^n $ exists. I would be interested in seeing others.  $***$ Added after some comments: I prove here by very elementary means that the limit exists. Calling the limit "$e$" names it. $***$  It only needs Bernoulli's inequality (BI) in the form $(1+x)^n \ge 1+nx$ for $x > -1$ and $n$ a positive integer, with equality only if $x = 0$ or $n = 1$. This is easily proved by induction: It is true for $n=1$, and $(1+x)^{n+1} = (1+x)(1+x)^n \ge (1+x)(1+nx) = 1+(n+1)x+nx^2 \ge 1+(n+1)x $. (If $-1 < x < 0$, if $1+nx \ge 0$, the above proof goes through, and if $1+nx < 0$, $1+mx < 0$ for all $m \ge n$ so certainly $(1+x)^m > 1+mx$.)  This proof originally appeared in N.S Mendelsohn, An application of a famous inequality, Amer. Math. Monthly 58 (1951), 563 and uses the arithmetic-geometric mean inequality (AGMI) in the form $\big(\sum_{i=1}^n v_i/n\big)^n \ge \prod_{i=1}^n v_i$  (all $v_i$ positive) with equality if and only if all the $v_i$ are equal.  Let $a_n = (1+1/n)^n$ and $b_n = (1+1/n)^{n+1}$.  We will prove that $a_n$ is an increasing sequence  and $b_n$ is an decreasing sequence.  Since $a_n < b_n$, this implies,  for any positive integers $n$ and $m$ with $m < n$  that $a_m < a_n < b_n < b_m$.  For $a_n$, consider n values of $1+1/n$ and $1$ value of $1$.  Since their sum is $n+2$ and their product is $(1+1/n)^n$, by the AGMI,  $((n+2)/(n+1))^{n+1} > (1+1/n)^n$,  or $(1+1/(n+1))^{n+1} > (1+1/n)^n$,  or $a_{n+1} > a_n$.  For $b_n$, consider $n$ values of $1-1/n$ and $1$ value of $1$.  Since their sum is $n$ and their product is $(1-1/n)^n$, by the AGMI,  $(n/(n+1))^{n+1} > (1-1/n)^n$  or $(1+1/n)^{n+1} < (1+1/(n-1))^n$,  or $b_n > b_{n+1}$.  Since $b_n-a_n  = (1+1/n)^{n+1} - (1+1/n)^n = (1+1/n)^n(1/n) =a_n/n $ and every $a_n$ is less than any $b_n$ and $b_3 = (1+1/3)^4 = 256/81 < 4$, $b_n-a_n < 4/n$, so $b_n$ and $a_n$ converge to a common limit.  These proofs do not seem to be really elementary,  since they use the AGMI.  However, they use a special form of the AGMI,  where all but one of the values are the same,  and this will now be shown to be implied by BI,  and thus be truly elementary.   Suppose we have $n-1$ values of $u$ and $1$ value of $v$ with $u$ and $v$ positive.  The AGMI for these values is  $(((n-1)u+v)/n)^n \ge u^{n-1}v$  with equality if and only if $u = v$.  We will now show that this is implied by BI: $(((n-1)u+v)/n)^n \ge u^{n-1}v$  is the same as  $(u+(v-u)/n)^n \ge u^n(v/u)$.  Dividing by $u^n$,  this is equivalent to  $(1+(v/u-1)/n)^n \ge v/u$.  By BI,  since $(v/u-1)/n > -1/n > -1$, $(1+(v/u-1)/n)^n \ge 1+n((v/u-1)/n) = v/u$  with equality only if $n=1$ or $v/u-1 = 0$. Thus BI implies this version of the AGMI.


I'm looking for a site where I can ask a PayPal business account question. The essence of my question would be:  Am I obligated to use PayPal's invoicing system for their online payments service?  And I will go on to explain:  They are US based and most articles on tax are US law based. I'm in the Romania / EU. Romanian law is very picky on how an invoice should look like and is administered. For that I already have a service provider with whom I'm generating invoices manually.   ? It's not personal, although I suspect most people there know PayPal and the answer to my question. ? Too theoretical I think. ? Perhaps, because I'm most worried about the legal aspect of a US company generating invoices. (Which I prefer to avoid.)   PayPal's help information all point to "how to do it". But before I start going down this road, I prefer to know where it will end up. And perhaps others here have the experience already.

I have a question about a problem I'm having installing optifine with forge on minecraft.  Is there a place where I could ask this question?  I asked this on gaming, but I just got downvoted and told it is the wrong place.  The question is here:


i know $ |z_1 -z_2 |^2 =  |z_1 |^2 + |z_2 |^2 - 2|z_1 | |z_2 | \cos \alpha $ where $ \alpha $ is angle between $z_1$  and $z_2 $. Similarly i get $ |z_1 -z_2 |^2 + |z_2 -z_3 |^2 + |z_3 -z_1 |^2 = 2(4+9+16) - 2(6 \cos \alpha+8 \cos \beta+12\cos \gamma)$ What will be minimum value of $ 6 \cos \alpha+8 \cos \beta+12\cos \gamma $ if  $ z_1  , z_2, z_3   $ lie on the 3 given circles

If $z_{1},z_{2},z_{3}$ are three complex number Such that $|z_{1}| = 2\;\;,|z_{2}| = 3\;\;, |z_{3}| = 4\;\;$ Then $\max$ of $|z_{1}-z_{2}|^2+|z_{2}-z_{3}|^2+|z_{3}-z_{1}|^2$  $\bf{My\; Try::}$ Let $z_{1}=2\left(\cos \alpha+i\sin \alpha\right)$ and $z_{2}=3\left(\cos \beta+i\sin \beta\right)$ and $z_{3}=4\left(\cos \gamma+i\sin \gamma\right)$ So $$f(\alpha,\beta,\gamma) = 58-\left[12\cos(\alpha-\beta)+24\cos(\beta-\gamma)+16\cos(\gamma-\alpha)\right]$$ Now How can I calculate $\max$ of $f(\alpha,\beta,\gamma)$ Help me Thanks


So, floor is a function that converts a real number to an integer. It rounds down. This makes sense; however, what about complex numbers? I know that depending on the number, it can be split linearly. However, I do not know what $\lfloor i\rfloor$ equals. Is there a clearly defined definition of $\lfloor i\rfloor$?

My question is very simple. How would one take the floor of a complex number and what is the floor of i?


In the Roman Catholic Church, the Apostles' Creed says, "From thence He shall come to judge the living and the dead." I am unsure whether "from thence" is correct or if it simply should be, "Thence He shall come to judge the living and the dead." This is based on a rudimentary understanding of the antiquated "thence" as being equivalent to modern "from there".

I just saw a , where one of the characters says:     it must be cast back in the fire from whence it came!   This struck me as odd, since I expected them to say "whence it came"; but now I find that "from whence" seems to occur as well.  Does anybody know whether this is correct, or whether it has been correct at some point and subsequently fell into disgrace (or vice versa)?


Wikipedia says that path-connectedness is a stronger property than connectedness.  My intuition cannot seem to come up with an example of an object that is connected but not path-connected. Are there any examples?

Consider the following two definitions:  Connected : A topologiocal space X is connected if it is not the disjoint union of two open subsets, i.e. if X is a disjoint union of two open sets A and B, then A or B is empty set.  Path Connected : A topological space X is path-connected if any two points in X can be joined by a continuous path.    So far I can picture, I think they should be equivalent. If X is connected iff it is path-connected. But, the Thm I got from lecture is just if X path connected then X is connected (The converse not necessarily true.)  Can anyone give me some picture of space which is connected but not path-connected? Just picture please, cuz I wanna grab the idea. I have already seen some examples like in , I cannot grab the idea if it (such space) consist of a single piece, then I couldn't make a continuous path from any two points.  Thank you :)


I'm using the Interpolation plug-in in QGIS 2.18 to perform IDW Interpolation. I was hoping to specify a power of 2 and use the 10 nearest points to calculate the output, but I don't necessarily see a way to do so.   Is there another tool that I can use to accomplish this?

I'm using QGIS 1.8.0 to interpolate weather data. This is, I have a weather station located in say, A and C. With the Inverted Distance Weighting or Triangular Interpolation methods, I can know/interpolate information in B. When using the IDW method, I have to choose a coefficient.   Does anyone know in which range the coefficients should be?   Say from 1 to 10 or .1 to .99 or 100 to 1000?   Any ideas?


I was trying to create a public and private share directory using samba and I ended up accidently relocated my main user to smbshare group and can no longer use sudo commands or log in as root. I will not be able to get into recovery mode.

I clean-installed Ubuntu 11.10 today, and then installed VirtualBox.  This required me to add myself to the vboxusers group, and since 11.10 seems to no longer have a graphical app to add users to a group, I ran the following command:  sudo usermod -G vboxusers stephane   This is a problem.  I now see what I should have run instead is:  sudo usermod -aG vboxusers stephane   The end result is I'm no longer in the groups I should be in.  Including whatever group is required to run "sudo".  When I run any command as sudo now, I get the following:  $ sudo ls [sudo] password for stephane:  stephane is not in the sudoers file.  This incident will be reported.   Is there a way to fix this, or do I need to re-install from scratch again?


I am hoping somebody can explain to me what a <T> object is, just a little confused on what it is/what it contains. Thank you

Can someone explained, as detailed as possible, the differences between the following types?  List List<Object> List<?>   Let me make this more specific. When would I want to use  // 1  public void CanYouGiveMeAnAnswer(List l) { }  // 2 public void CanYouGiveMeAnAnswer(List<Object> l) { }  // 3 public void CanYouGiveMeAnAnswer(List<?> l) { }


I can't find the path of SMS database files in android os. where is the right path for SMS database files?  I already tried these values and these values are not right:  /data/data/com.jb.gosms/databases/gommssms.db /data/data/com.android.providers.telephony/databases/mmssms.db

Where in the file system are SMS messages stored?  I'm using ES File Explorer to browse around but can't seem to find this - is it on the phone or the SD, and where?  I have an HTC Wildfire but I would imagine it doesn't vary hugely from vendor to vendor (although I am an iOS developer who knows little about Android).


I have many nodejs software running.  (Each node.exe is other script) I want to understand the memory, cpu of each of them. But all looks similar at Windows TaskList  An image of Windows Task List:    I've reviewed  but that question and its answers deal with finding the arguments passed to an executable.  I want to see this in Task Manager.

I'm looking for a tool or method to find out what command line parameters have been passed to a program, for example when it was run by another program (launcher-application scenario).


I have a healthy and working machine that has Windows 10 on it. The PC has two SSDs. Windows is installed in one of them. There is nothing in the second drive. If I use a Xubuntu 20.04 installer I have in a usb stick to install this OS on this second drive, will this break the Windows install? I noticed during the installer ( which I still did not run completely )  that the same does not even detect windows is in the second drive. Should I go ahead and install it though? I do not want to break it and be forced to reinstall windows all over again, but there is no problem if I have both.

I'm absolutely new to Linux. I would like to know how to install Ubuntu alongside the pre-installed Windows 8+ OS.  Should I do it with Wubi, or through the Live USB/DVD?  What steps do I need to take to correctly install Ubuntu?


When I booted up my machine, it said failed to start session. So I press Ctrl + alt + f1, then I login. Now I need to install the mate desktop. But I don't know what the command for that is, I know what the command for unity is but not for mate. I have very limited file space and using unity would eat it all up, so I need e command to install the mate desktop.

I have seen several youtube videos that are showing MATE (The Gnome 2.x fork) installed in 11.10. How can I install it to test it out in 11.10 and above.  If it helps the only sources I know of are:  , , and


I have an html file that can be accessed by browsing to  https://localhost:8080/contextRoot/home.html   This html uses 2 images:      The first image is packaged in my war file and loads fine. When I reload the page, it is fetched from cache instead of re-downloading it. I see this in the developer tools of my browser.  The second image also loads fine, but it is downloaded every time the page is requested. It is never cached. It uses a special java servlet to handle what we call static content:  <servlet>     <servlet-name>staticFileServlet</servlet-name>     <servlet-class>com.company.web.file.StaticFileServlet</servlet-class> </servlet>  <servlet-mapping>     <servlet-name>staticFileServlet</servlet-name>     <url-pattern>/static/*</url-pattern> </servlet-mapping>   This servlet searches the computer's disk for the folder C://images/ for a file called image1 and serves it by writing those bytes to the response, while also heading a content-type header to the response (so the browser knows what kind of file it is receiving).  I think I might have to add additional headers to explain the browser that this content should be cached. Can the Cache-control header help me here? However, I thought browsers were smart enough to cache requests regardless of what headers I (don't) use.   Here are the response headers for an image that is succesfully cached (served by being the war file)  Accept-Ranges:bytes Content-Length:354 Content-Type:image/gif Date:Mon, 04 Jan 2016 09:43:42 GMT ETag:W/"354-1449227028000" Last-Modified:Fri, 04 Dec 2015 11:03:48 GMT Server:Apache-Coyote/1.1   Here is an example of an image that is served by the servlet and isn't cached:  Cache-Control:max-age:864000 Content-Type:image/jpeg Date:Mon, 04 Jan 2016 13:59:04 GMT Server:Apache-Coyote/1.1 Transfer-Encoding:chunked   EDIT: my files are behind an SSL connection, which could cause the deny of caching. However, I'm certain it is not the server denying this caching because   It is caching some images. There no headers (pregma, etag, cache-control...) set on the response.   Does google chrome automatically refuse caching from (some) ssl connections?

I deploy a webapp on two different containers (Tomcat and Jetty), but their default servlets for serving the static content have a different way of handling the URL structure I want to use ().  I am therefore looking to include a small servlet in the webapp to serve its own static content (images, CSS, etc.). The servlet should have the following properties:   No external dependencies Simple and reliable Support for  header (i.e. custom  method) (Optional) support for gzip encoding, etags,...   Is such a servlet available somewhere? The closest I can find is  from the servlet book.  Update: The URL structure I want to use - in case you are wondering - is simply:      <servlet-mapping>             <servlet-name>main</servlet-name>             <url-pattern>/*</url-pattern>     </servlet-mapping>     <servlet-mapping>             <servlet-name>default</servlet-name>             <url-pattern>/static/*</url-pattern>     </servlet-mapping>   So all requests should be passed to the main servlet, unless they are for the static path. The problem is that Tomcat's default servlet does not take the ServletPath into account (so it looks for the static files in the main folder), while Jetty does (so it looks in the static folder).


Find all the group homomorphisms from $G_1$ into $G_2$ wher $G_1=\{e, a, a^2|a^3=e\}$ and $G_2=\{e,b,b^2, b^3|b^4=e\}$.  So I know that $G_1=\langle a\rangle$ and $G_2=\langle b \rangle$, also $o(a)=3$ and $o(b)=4$ so $(3,4)=1$ that means there exists only one homomorphism. Which one?

Consider the following multiple choice problem:  Let $H$ be the set of all group homomorphsims $\phi:{\bf Z}_3\to{\bf Z}_6$. How many functions does $H$ contain? A.1  B.2 C.3 D.4 E.6  Since $1$ generates ${\bf Z}_3$, one can analyze $\phi(1)$ case by case, which may be rather time consuming, for me, at least. Since this is a multiple choice problem, is there any quick way to solve it?


What Stack Exchange community is suitable for the following question?     It's Pretty straightforward. When I download an HTML file from my   server it becomes corrupted with bunch of Chinese characters I didn't   put there. I don't know what's the problem, the encoding of the file   seems fine, and it shows up nicely in the browser.      That is, unless I put the downloaded file back on the server, then   it's all screwed.

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'm looking for a diff implementation in Java. I've seen that Python has its own SequenceMatcher (with difflib), which is exactly what I need... in Java.  Is there any portage? Or is there any other class/library that performs the same in Java?  If not, where can I find the source code of that difflib (if free as in speech) to make my own implementation of SequenceMatcher in Java ?  Unfortunately, Apache Commons Lang doesn't help me much.  Thanks!

I need to perform Diffs between Java strings. I would like to be able to rebuild a string using the original string and diff versions. Has anyone done this in Java? What library do you use?  String a1; // This can be a long text String a2; // ej. above text with spelling corrections String a3; // ej. above text with spelling corrections and an additional sentence  Diff diff = new Diff(); String differences_a1_a2 = Diff.getDifferences(a,changed_a); String differences_a2_a3 = Diff.getDifferences(a,changed_a);     String[] diffs = new String[]{a,differences_a1_a2,differences_a2_a3}; String new_a3 = Diff.build(diffs); a3.equals(new_a3); // this is true


What are the requirements in physics and mathematics that somebody must have in order to start learning Quantum Mechanics by himself?

Could someone experienced in the field tell me what the minimal math knowledge one must obtain in order to grasp the introductory Quantum Mechanics book/course?  I do have math knowledge but I must say, currently, kind of a poor one. I did a basic introductory course in Calculus, Linear algebra and Probability Theory. Perhaps you could suggest some books I have to go through before I can start with QM?


I'm trying to understand regular expression operations, string slicing, and strings in Python. String slicing using .start() and .end() results in the expected substring, and if I go for a single character from a string using .start() the resulting character is as expected, but if I go for a single character from a string using the .end() index, it doesn't result in the expected character. I understand that lists (including strings) begin with element zero, but why are exceptions to this rule the stop index of a string slice and the re Match .end() index? >>> import re >>> m = re.search("bake","123bake456") >>> m <re.Match object; span=(3, 7), match='bake'> >>> m.span() (3, 7) >>> m.start() 3 >>> m.end() 7 >>> "123bake456"[m.start():m.end()] 'bake' >>> "123bake456"[m.start()] 'b' >>> "123bake456"[m.end()] '4'

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


My friends and I planned to visit Germany, so I got a single entry tourist Schengen visa to Germany. However, my travel plans have changed since then, because my friends are going to Italy instead. I don't have time to apply for a visa to Italy, but I have been told that I can use my Schengen visa to enter Italy. Is that true?

I am a non-EU national, permanent UK Resident. Recently, my work issued me with a multiple Schengen visa with Norway as the first (main) point of entry. Now I want to go on holidays to Greece - do I need to apply to Schengen visa again, as Greece is not Norway and I am not going there for work?


I have 2 challenges,   On page load, I would like to show a warning saying that "caps is on". Still the user press the shift + key or Caps on + key - I would like to through error.   I search in google and find a solution, but it doesn't work. any one help me to sort this issue please? please refresh the page using caps lock on/off to get the current status. nothing works.  Here is the function I got from google search:  function capLock(e){  kc = e.keyCode?e.keyCode:e.which;  sk = e.shiftKey?e.shiftKey:((kc == 16)?true:false);  if(((kc >= 65 && kc <= 90) && !sk)||((kc >= 97 && kc <= 122) && sk))   console.log('caps lock on')  else   console.log('caps lock off'); }  $('#password').on('keypress', function(e){     capLock(e.which) })

How do you tell if caps lock is on using JavaScript?  One caveat though: I did google it and the best solution I could find was to attach an onkeypress event to every input, then check each time if the letter pressed was uppercase, and if it was, then check if shift was also held down. If it wasn't, therefore caps lock must be on. This feels really dirty and just... wasteful - surely there's a better way than this?


I want powerful Pokemon and have enough Eevee candies. Can I force it to evolve into the Pokemon I want?  I'm not asking what it can evolve into, I'm asking how I can force evolving into those.

So I just caught an Eevee. Now, I need 25 candies to evolve it. The fact is that in the GameBoy color versions, that Pokémon needed a stone to evolve instead of experience. Depending of the stone he was fed with (thunder, water or fire), he was evolving in a different Pokémon.   Is the stone feature also in Pokémon Go? If not, what decide the evolution of this Pokémon?   Bonus point : If it's possible, how can I get a stone?


In chat, there have been several times that we have passed around links to Github repos, to access others' code and resources. Could theses be oneboxed, possibly just including the person's username, the repo title, and tpart of the gist?

I attempted to paste a link to a Gist in chat:  As you can see, neither URL is working, even though they both should:


Using a btree as my index. From what I understand(), btree works for comparison operators. For equality operator it works fine  explain analyze select latitude, longitude  from internal.location_log  WHERE entry_timestamp = 32903023;   Index Scan using internal_location_log_entry_timestamp_idx on location_log  (cost=0.42..8.44 rows=1 width=16) (actual time=0.063..0.063 rows=0 loops=1)    Index Cond: (entry_timestamp = 32903023)  Planning time: 0.104 ms  Execution time: 0.088 ms   however for comparison operator like  explain analyze select latitude, longitude  from internal.location_log  WHERE entry_timestamp >= 32903023;  Seq Scan on location_log  (cost=0.00..17969.96 rows=821837 width=16) (actual time=0.012..347.941 rows=821957 loops=1)    Filter: (entry_timestamp >= 32903023)  Planning time: 0.209 ms  Execution time: 537.699 ms   Am I missing something?

I have PG server (9.0.4) installed on Debian x86. In one of my tables I use numeric(6,1):  CREATE TABLE mytable(name text, numfield numeric(6,1))   Also index created for this field:  CREATE INDEX mytable_numfield_idx ON mytable USING btree (numfield);   Everything is going fine if I use this field with real numeric value. As I see the query uses the index:  EXPLAIN ANALYZE SELECT * FROM kodiall WHERE kodgo=123.0      Index Scan using mytable_numfield_idx on mytable  (cost=0.00..8.27 rows=1   width=193) (actual time=0.085..0.087 rows=1 loops=1)      Index Cond: (numfield = 123.0)      Total runtime: 0.131 ms   But the index is ignored for some reason if I use 0.0 or NULL as condition value:  EXPLAIN ANALYZE SELECT * FROM kodiall WHERE numfield=0.0 --EXPLAIN ANALYZE SELECT * FROM kodiall WHERE numfield=NULL      Seq Scan on mytable  (cost=0.00..57.80 rows=1080 width=193) (actual   time=0.033..1.853 rows=1088 loops=1)      Filter: (numfield = 0.0)   What wrong here? Is 0.0 not a numeric value?  In real query I use LEFT JOIN with numfield and values in joined table can be NULL.


$( X, Y)$ have a bivariate normal density centered at the origin with $E(X^2)$ = $E(Y^2) = 1$, and $E(XY) = p$ . In polar coordinates $(X, Y)$ becomes $(R,\Phi)$ where $R^2 = X^2 + Y^2$. Prove that $\Phi$ has a density given by $$\frac{\sqrt{1-p^2}}{2\pi(1-2p\sin(\varphi)\cos(\varphi))}$$ And is uniformly distributed iff $p = 0$. (To this point everything is clear) what i do not understand is how to conclude that $P\{XY > 0\} =  \frac{1}{2} +\pi^{-1} \arcsin (p)$ and $P\{XY < 0\}= \pi^{-1} \arccos (p)$.

Title says it all I looked for a proof on this site but couldn't find one.  Prove if $f$ is analytic on $D$ and $g$ is analytic on $\Omega$ containing the range of $f$ show $g(f(z))$ is analytic.  The statement seems obvious but I can't seem to be able to prove it.


what does curl means in electromagnetism? How can we derive relation between curl and gradient in electromagnetism?

What is the physical significance of  $$\nabla\times\boldsymbol{V}~?$$  I mean I read 'curl V represents the rotation of the vector $V$. My question what is it about the term $\nabla\times\boldsymbol{V}$ that it represents the rotation of the vector?


Lets say for fraud detection which has two labels for each transaction.   Fraud  Non fraud    In real world scenario we usually get more number of examples of Non fraud data points and very low number of fraud data points. Lets assume the ratio of Non fraud: fraud is 80:20. So my question is even if I build any classifier my model will predict the majority label but I know that data itself is not well distributed. So for such scenarios what should be the approach.

I have a data set in the form of (features, binary output 0 or 1), but 1 happens pretty rarely, so just by always predicting 0, I get accuracy between 70% and 90% (depending on the particular data I look at). The ML methods give me about the same accuracy, and I feel, there should be some standard methods to apply in this situation, that would improve the  accuracy over the obvious prediction rule.


I wanted to dual boot Ubuntu with Windows 10 Legacy BIOS but I followed the wrong video and created an EFI partition while installing ubuntu and the installation failed and now I'm not able to boot into any of the OS. This is my first question here. Sorry if I am missing any details. I've tried to keep it as precise as possible. Please help me.

I have a Samsung Notebook NP900X4C with an LUKS encrypted installation on it. The system is booting in UEFI mode.  The problem is that the samsung-notebook kernel module is disabled in UEFI mode and due to that I am missing features like the keyboard backlight.  Is it possible to modify the current installation so it can boot in BIOS mode?  Is this correct that the basic steps would be converting the disk from GPT to MBR and installing grub from a live CD? Would this be possible with a LUKS partition?


Where is this place "several houses on the rocky coast and rocky island with natural arch"?    If you think that I can check location on windows lock screen () look at this and tell me how:

Windows 10 has an extensive collection of lock screen photos, many of which have  here on Travel.SE.  Is there a website which lists the location of all of these photos? I imagine Microsoft has purchased an official license, so they should have a record about the photographer and the place where the photo was taken.


$x$,$y$ and $z$ are positive real numbers.  We have to show that $$\frac{y}{xy+2y+1} + \frac{z}{yz+2z+1} + \frac{x}{xz+2x+1}\leq\frac{3}{4}.$$ I am the equivalent of a senior in high school  (not a US citizen) and we didn't take a multi-variable calculus course. Is there a way this could be solved without it?   (It's a problem I found in a math olympiad somewhere,but I can't remember which one.)

Let $x,y,z\ge 0$, show that $$\dfrac{y}{xy+2y+1}+\dfrac{z}{yz+2z+1}+\dfrac{x}{zx+2x+1}\le\dfrac{3}{4}$$  I had solve $$\sum_{cyc}\dfrac{y}{xy+y+1}\le 1$$ becasuse After some simple computations, it is equivalent to  $$(1-xyz)^2\ge 0$$


Help! I need to check, if first text equals second!  pass = readPassFromFile() if(passTxt.getText().toString()==pass)   {     success() } else {     fail() }   I entered right password into EditText. Variable pass is a line from file. I used toast to see passwords. Result ('-' is a separator, '[]' is start/end): [Qwerty-Qwerty].

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


I am aware of floating point being inaccurate and would like to know the best way to get  0.08354 instead of (0.08353999999999999) when I do the following in Python:  d = 8.354/100  print (d)

I want a to be rounded to 13.95.  >>> a 13.949999999999999 >>> round(a, 2) 13.949999999999999   The  function does not work the way I expected.