Why does my program seem to go over some numbers?

I need some help I cannot understand why my program doesn't record the right numbers. It will record parts of the number but skip the rest.  Example (How I want it):  Player Name: Lev Yashin Sign Up Time: 9 09 Sign In Time: 1 01 Player Name: Andrei Arshavin Sign Up Time: 6 09 Sign In Time: 12 15 Player Name: Igor Akinfeev Sign Up Time: 7 36 Sign In Time: 5 29 Player Name: Igor Netto Sign Up Time: 4 28 Sign In Time: 7 29   But when I run my code, I get:  Player Name: Lev Yashin Sign Up Time: 9 9 Sign In Time: 1 1   Its looking like it passes zeros, and I can't seem to understand why it does it. Once and awhile I will pass in some other data and it will produce all the numbers.  Anyone have any ideas on why it doesn't include some numbers?  int modifyStr(FILE *soccerWebsiteData, char firstAndLast[], char *pSignUpHours, char *pSignUpMinutes, char *pSignInHours, char *pSignInMinutes) { char *position = NULL; char oneLineOfFile[MAX_LENGTH]; char signUpHours = 0, signUpMinutes = 0, signInHours = 0, signInMinutes = 0;  while (!feof(soccerWebsiteData)) {     fgets(oneLineOfFile, MAX_LENGTH, soccerWebsiteData);     position = strchr(oneLineOfFile, ',');      strncpy(firstAndLast, oneLineOfFile, (position - oneLineOfFile));     firstAndLast[(position - oneLineOfFile)] = '\0';      signUpHours = atoi(position + 1);     *pSignUpHours = signUpHours;      position = strchr(position, ':');      signUpMinutes = atoi(position + 1);     *pSignUpMinutes = signUpMinutes;      position = strchr(position + 1, ',');      signInHours = atoi(position + 1);     *pSignInHours = signInHours;      position = strchr(position, ':');      signInMinutes = atoi(position + 1);     *pSignInMinutes = signInMinutes;      printf("Player Name: %s \n", firstAndLast);     printf("Sign Up Time: %d %d \n", signUpHours, signUpMinutes);     printf("Sign In Time: %d %d \n", signInHours, signInMinutes); } return 0;   }


How to calculate the running time of my program?

I wrote a program and now I want to calculate the total running time of my program from start to end.  How can I do this?


Proving $\mu_f(A)$ is a measure on $(\mathbb{R},S)$

I need to prove that $\mu_{f}(A)=\sup \left\{\sum_{x \in F} f(x): F \subseteq A \text { is finite }\right\}$ is a measure on $(\mathbb{R},S)$ where $f:\mathbb{R} \rightarrow [0,\infty)$ and $\mathcal{S}=\{A \subseteq \mathbb{R}: \text { either } A \text { is countable or } \mathbb{R} \backslash A \text { is countable }\}$. I have done everything apart from proving that for disjoint sets $\mu\left(\bigcup_{i \in \mathbb{N}} E_{i}\right)=\sum_{i \in \mathbb{N}} \mu\left(E_{i}\right)$. I think it would be easier to prove the measure is an outer measure and then prove that for every set in the $\sigma$-algebra, $\mu$ is $\mu$-measurable. But apart from this i am very stuck. Thanks in advance.


Prove $N\cap Z(P)\ne e$ given a $p$-group $P$ and a normal subgroup $N$.

Let $P$ be a $p$-group and let $N\triangleleft P$. Prove $N\cap Z(P)\ne e$ .  Here's what I know so far: $P$, being a $p$-group, is nilpotent and therefore is solvable. That means that it has its upper central series: $e=Z_0\triangleleft Z_1\triangleleft Z_2....Z_n...$ where $Z_1=Z(P)$ and that at some point, the series stabilizes at P forever... I also know that $Z_{i+1}=${ $x\in P|\forall y\in P: [x,y]\in Z_i$}. (In my notebook it's been defined that way: $Z_{i+1}=\pi^{-1}(Z(G$\ $Z_i)$ whichc confuses me a little. )  How can I show that the desired intersection is not empty?


Prove that no group $G$ satisfies $G/Z \approx Q_8$ where $Z$ is centre of $G$  My initial thoughts on this were the following:   The image of a group under an isomorphism with a trivial centre must also have a trivial centre. $Q_8$ has a non trivial centre, $ \{ \pm 1 \} $.   So it would be nice to claim that $G/Z$ has a trivial centre and so we are done. However I do not think this is the case, e.g. $D_8 /Z \approx D_4 $ and the centre of $D_4$ is nontrivial (contains rotation element).   Firstly is my above claims correct, and what ideas should I consider to solve this problem?


Intuition for why the sum of Bernoulli trials is a sufficient statistic via cancellations on numerator and denominator?

Suppose that $X_1, \ldots, X_n$ are iid Bernoulli trials with parameter $p$, and that $Y = \sum_{i=1}^nX_i$. Then, we have that $Y$ is a sufficient statistic by the following condensed proof:  $$ P(X_1 = x_1,  ... , X_n = x_n |Y = y) = \frac{p^y(1-p)^{n-y}}{\binom{n}{y}  p^y(1-p)^{n-y}} =\frac{1}{\binom{n}{y}}   \text{ if } \sum_{i=1}^{n}x_i = y $$  I am trying to see why this is the case. My reasoning is that there is some cancellation property on top and bottom that "kills" off the parameter $p$. In that whatever is on top through $p$ is perfectly matched by whatever is on the bottom minus scaling factors (in this case $\binom{n}{y}^{-1}$).   However, I am wondering what the deeper meaning behind this is, that the numerator of the joint distribution of the data and the sufficient statistic has its EXACT form on the bottom, except for constants which are only multiplicative (to facilitate cancellations). Am I onto something bigger and deeper here?


Can't install Nvidia Drivers on Ubuntu 18.04.2 LTS (GTX 1050 Mobile, AMD Ryzen 5 2500u)

I've tried for hours to install nvidia drivers for my laptop. The standard nvidia-390, the newer nvidia-418 through the repo, various other versions, the .run files from Nvidia's website, tried changing into lightdm, tried the various grub parameters like nomodeset etc. Last thing I tried was installing nvidia-384 because why the hell not at this point, which resulted in a login loop. Not the first time this is happening either, the standard nvidia-390 does the same and I have no idea why. Has someone managed to install nvidia drivers in a similar system that could help me? Thank you. Edit: I've disabled secure boot, so unless my BIOS is lying to me, this shouldn't be an issue...  EDIT 2: After installing nvidia-driver-418 I can boot the system, but the command nvidia-settings give me this output:  ERROR: Unable to load info from any available system   (nvidia-settings:2477): GLib-GObject-CRITICAL **: 12:22:32.065: g_object_unref: assertion 'G_IS_OBJECT (object)' failed ** Message: 12:22:32.070: PRIME: No offloading required. Abort ** Message: 12:22:32.070: PRIME: is it supported? no   And the nvidia-settings window is empty. Any ideas?


Does the integral $\int_{1}^{\infty} \sin(x\log x) \,\mathrm{d}x$ converge?

I tried a couple of substitutions but have so far gotten nowhere. Can anyone guide me in the right direction? Thanks for your time.


I came across this sentence:     Cummings Motors, Smith Electric nor our subcontractors can be held liable.   Is this a proper use of the word nor?  I can understand     Neither Cummings Motors nor Smith Electric nor our subcontractors can be held liable.   But nor without neither? What about neither, nor, nor? Is one nor sufficient?


Is the statement "To try and manipulate" grammatically correct?

Something seems off about the wording "try and..."


How would I go about detecting monopoles?

A question needed for a "solid" sci-fi author: How to detect a strong magnetic monopole? (yes, I know no such thing is to be found on Earth).  Think of basic construction details, principles of operation and necessary components of a device capable of detecting/recognizing a macroscopic object emitting magnetic field of equivalent of order ~0.1-10 Tesla near its surface, but with only one pole, reliably distinguishing it from normal (2-pole) magnets, preferably at a distance.  Preferably a robust method, not involving extremely advanced technology. Detect the presence, possibly distance (or field strength) and direction.  I know of SQUIDs, but these concentrate on extreme sensitivity. I'm thinking of something less sensitive but more robust (like, no need for the monopole to fall through the loop) and still able to recognize a monopole against a magnet.  Also, how would such a macroscopic object behave practically? Such a "one-pole magnet" about the size and strength of a refrigerator magnets - how would it behave around ferromagnetics, normal magnets and so on?


Where in, Einstein’s "On the Electrodynamics of Moving Bodies" (Relativity), is “Time” reasonably shown to exist, or why is it a valid assumption?

Given the widespread acceptance that  “Einstein’s Relativity” reasonably proves the existence of Space-‘Time’, and thus “Time”... Can any member of the Physics StackExchange please show precisely where, in "On the Electrodynamics of Moving Bodies", (or related core Relativity) papers, “Time” is actually, in any reasonable way shown to exist, as opposed to just, or only being (unscientifically) “assumed”? (added) or, why it is legitimate for the paper to make this assumption or axiom?  Many individuals and publications refer to Relativity as our best theory of Space, and “Time”, and thus imply it is a given that time exists... because Relativity intricately employs the concept of time.   But wherever such claims are made, they are rarely accompanied by any clear justification or specific reference to a specific section of SR or GR. At best, it is claimed that SR proves “Time dilation”, and thus the existence of “time” as a genuine dimension.   Therefore  unless it can be shown that Relativity, ("On the Electrodynamics of Moving Bodies" etc), actually incorporates a reasonable proof of times existence, or cites such a proof, or even just gives a valid reason to “suspect” a thing called “time” might exist, then the “time dilation” shown may in fact prove only that moving things “are” changing “slower” (i.e just at a dilated rate), than stationary things, and not that a “temporal past”, and/or “temporal future”, or thing called “time” also exists. (As per space-“time”, block-“time”, growing block-“time” etc).  Precisely where Relativity is valid in assuming a thing called time exists, is a very important question, given the large number of theories based on the belief Relativity does proves time’s existence. And, the large number of fundamentally conflicting theories about time, problems resolving quantum and classical “time”, and even disagreement about time’s actual existence or not.   Therefore, if anyone here on the stack exchange can show just where "on the electrodynamics of moving bodies" actually, legitimately validates its use of "time", or why they accept its assumptions in the specific area of "Time",  please clarify this not just for me, but I assume many others..


KRACK unpatched routers are not safe to use in wireless-client and WISP modes?

How the KRACK attack destroys nearly all Wi-Fi security  Key Reinstallation Attacks   There is the vulnerability in wpa_supplicant in linux. This means wireless-client and WISP modes are also vulnerable due to the unpatched KRACK? Because this means all the "plain text" traffic that go through the targeted router can be compromised by MitM attack?  Edit 1: I edited to explain how different is my question to "Is it really possible for most enthusiasts to crack people's Wi-Fi networks?" This question is more specific on a single issue. However, if some or many see a narrower one must be "duplicate", they always have their rights to see and express in that way. But I don't think that's healthy for the community as a whole. Well, there may be just me after all.  Edit 2: What if a KRACK vulnerable client can lock on channel? Does it make a difference to non-channel-lock client?


How are subspecies defined, in contrast to species?

When should a taxon be considered to be a subspecies of a certain species, and when as a different species? Are there some general guidelines how to assign a specific taxonomic status to a taxon?


Prove an identity for the continuous integral solution of the conservation law

This is an exercise in Evans, Partial Differential Equations (1st edition), page 164, problem 13:     Assume $F(0) = 0, u$ is a continuous integral solution of the conservation law   $$ \left\{ \begin{array}{rl}  u_t + F(u)_x = 0 &\mbox{ in $\mathbb{R} \times (0,\infty)$} \\   u=g &\mbox{ on $\mathbb{R} \times \left\{t=0\right\} $} \, ,        \end{array} \right. $$   and $u$ has compact support in $\mathbb{R} \times [0,\infty]$. Prove    $$ \int_{-\infty}^{\infty} u(\cdot,t)\,dx = \int_{-\infty}^{\infty}g \,dx $$   for all $t>0$.   How to solve it?


I logged into my profile today to find myself missing some rep. Not too much, just enough to make me question it. Turns out all of my (three!) questions have been downvoted.        All three were downvoted within 1 minute of each other.  As far as I'm concerned there is absolutely nothing wrong with these questions. So my questions are:   Should a user be allowed to downvote all of my answers in such quick succession? Given that there is presumably a motive?  Is there anything I can do about this?


Why not concatenate C source files before compilation?

I come from a scripting background and the preprocessor in C has always seemed ugly to me. None the less I have embraced it as I learn to write small C programs. I am only really using the preprocessor for including the standard libraries and header files I have written for my own functions.  My question is why don't C programmers just skip all the includes and simply concatenate their C source files and then compile it? If you put all of your includes in one place you would only have to define what you need once, rather than in all your source files.  Here's an example of what I'm describing. Here I have three files:  // includes.c #include <stdio.h>     // main.c int main() {     foo();     printf("world\n");     return 0; }     // foo.c void foo() {     printf("Hello "); }   By doing something like cat *.c > to_compile.c && gcc -o myprogram to_compile.c in my Makefile I can reduce the amount of code I write.  This means that I don't have to write a header file for each function I create (because they're already in the main source file) and it also means I don't have to include the standard libraries in each file I create. This seems like a great idea to me!  However I realise that C is a very mature programming language and I'm imagining that someone else a lot smarter than me has already had this idea and decided not to use it. Why not?


Passing that ball on, where does it end up in?

$10$ people are seating on chairs around a circular table. These chairs are marked   in a clockwise manner. There is a ball on the man’s hand who is seated on $0$   marked chair, and the ball will be passed from one man to another in clockwise manner.   In first step, the ball goes to $1$ marked chair with $1^1$ turn. In second step, from there, the   ball goes to 5 marked chair with $2^2$ turns. In third step, the ball goes to $2$ marked chair by $3^3$   turns from $5$ marked chair. By this means, in which chair the ball will be in $2020$th   step?   Source:   I'm not sure about exactly how many turns are required in the 2020th step. The question is a great deal ambiguous. Does the $n$th step require $n^n$  turns? Or does the pattern of $1^1, 2^2, 3^3$ repeat itself?  But often in cases like this where there are multiple possibilities for the answer, the one that seems more intuitive and makes more common sense is more likely to be the answer. After solving the problem in both the possible ways, comparing the two different answers should make the answer obvious.   I've already tried to solve the problem  in a self-answer. However, I can't solve it the $n^n$ way; it's too advanced for me. I'm only an 8th grader, you see.


I would appreciate if someone could check the mathematical equation for the seasonal ARIMA (4,1,4) x (1,1,1) period 12 that I wrote. I have done it this way, but I am not really sure if it correct is. Can someone check it and correct it? I would be graetfull.  $(1+0.0789359 B - 0.0007957 B^2- 0.7559195B^3 + 0.2814265B^4)(1+0.0851737 B^{12}) (1-B) (1-B^{12}) Y_t= (1 - 0.4212575 B - 0.2042966  B^2 -0.9272988 B^3 + 0.5528213B^4)(1-0.8477401B^{12})e_t$  Please just tell me if I am thinking right. Coefficients here:      Thank you for your answer!  but how can I simplify it?   I am very new to SARIMA and I am really facing a poblem which p,q,P,Q to use. Here is ACF and PACF of first-difference (two top plots),  and ACF and PACF of first-seasonal difference.  I think that P=1, Q=1 because ACF and PACF of first-seasonal difference drop off at lag 1 and are outside the confidence band. What about p and q ? Can I then say that p=2 and q=2 because it drop of at lag 2? Or should I take under consideration the fact that only at lag 4 ACF and PACF are outside confidence band? Is p=4 and q=4 or 2 for both?  Or should I do AIC test for (2,1,2)(1,1,1)12, (4,1,2)(1,1,1)12, (2,1,4)(1,1,1)12, (4,1,4)(1,1,1)12 and check which one has the smallest? Or assuming that p=2 and q=2 does not make any sense because its within the confidence band?


How to make good camera tracking markers

I am going to be making a scene where I will be using camera tracking for the first time and I was wondering how to make good markers for good scene tracking... the scene is going to consist of just white drywall with a ball smashing through it from the inside of the drywall into view... I will be using cell fracture and bullet constraints for the scene... If there would be any other good tips for me to know, it would be great if you could comment it... But I need to know how to make good markers for camera tracking... Thank you very much!


Why did Bilbo physically age faster than Gollum?

In the LoTR movies (not sure if the books are the same) but when Gollum lost the ring to Bilbo decades ago in The Hobbit, he appeared to look the same and even move the same in The Fellowship of the Ring. Bilbo on the other hand, seemed to have aged very rapidly when he passed the ring to Frodo. When Frodo met up with Bilbo in Rivendell shortly after his quest began, Bilbo appeared much older and even more much slower.  I realize that Gollum had the ring for much longer than Bilbo, but wouldn't him losing the ring have the same effect as it had on Bilbo?


What is the mechanism of the semi-transparent glass?

There are some one-way transparent glasses.  Light can pass the glass in this way, but cannot in the other way around.   It is quite contrary to the experience that the path of light is reversible.   So what is the reason behind?


Which finite groups $G$ do not embed in any symmetric group $S_n$ with $n < \lvert G \rvert$?

Recall the following classic result:  Cayley's Theorem Let $G$ be a group, and let $\operatorname{Perm}(G)$ be the group of set-theoretic bijections $G \to G$. The function $g \mapsto (h \mapsto gh) : G \to \operatorname{Perm}(G)$ is an injective group homomorphism.  Corollary Let $G$ be a finite group of order $n$. Then $G$ is isomorphic to a subgroup of $S_n$.  One may ask if Cayley's Theorem is "sharp", i.e. is it possible to embed a finite group $G$ in a smaller symmetric group than $S_{\lvert G \rvert}$? Let's say that a group $G$ is sharp if $G$ does not embed in $S_n$ for any $n < \lvert G \rvert$.  My question is: which finite groups are sharp?  This seems hard to answer in general but I'd be interested to learn what (partial) results are known. Here are some quick observations:   Let $G$ be a cyclic group of order $p_1^{a_1} p_2^{a_2} \cdots p_k^{a_k}$ with $p_1, \dots, p_k$ being distinct primes and each $a_i \geq 1$. Then $G$ embeds in $S_n$ with $n = p_1^{a_1} + p_2^{a_2} + \cdots + p_k^{a_k}$. If $k > 1$ then $n < \lvert G \rvert$, so $G$ is not sharp. The quaternion group (of order $8$) is sharp. If $n > 2$ then $S_n$ is not sharp, since it embeds in itself and $n < n!$   It also makes sense to ask if infinite groups are sharp (with the same definition), and I'd be interested to hear results there as well! Obviously, any countably infinite group is sharp.


How do I change Windows 7 to boot normally instead of in safe-mode?

I was not able to boot in safe mode on my Windows 7 PC, so I went into boot manager and checked off boot into safe mode to see if that would fix the issue. Unfortunately it did not, and now my PC seems only to be able to keep trying to boot into safe-mode. Is there a way to set it back to regular normal boot from outside of Windows?


I've switched from C4D (getting too costly for a retiree) to Blender 2.8. I've created a simple scene consisting of the monkey atop a plane.  Why is everything in the viewport and eevee shaded in violet (see attached screenprint)?


Contains and Custom Label in Rule Criteria - Workflow

I have a picklist field-XYZ which contains a lot of values.Lets say (A,b,c,d...z) I am trying to write a rule criteria which will execute if the picklist value is any of the following (A,b,c...p).So instead of mentioning all the values in rule criteria , i created a custom label and put the values (a,b,c,d..p) in that and wrote the following in the rule criteria :   CONTAINS(TEXT(XYZ__c) ,$Label.CustomLabel))   This is not working even is the value of the picklist is equal to the one mentioned in the Custom Label.I guess the CONTAINS function is matching the whole value of custom label with Picklist.Is there other workaround/solution for this?


Subgroup of the center that is not Characteristic subgroup

Good morning everyone,  I'm looking for a subgroup of $Z(G)$ the center of the group $G$ that is not characteristic subgroup of $G$.  Did someone have that in his pocket ?  I wish you a very good day !


Source and PDF side by side in Texmaker?

I've just started using Texmaker and am using it on a fairly large screen, large enough that it would be useful for me to be able to type my document and have the output PDF file next to it. I know it's possible as the setups at my university do exactly that. However, when I click the arrow next to "build pdf" it opens the PDF in a separate window. I've found a similar question on here to what I'm asking, but it refers to a preferences window that I simple cannot find anywhere.  Any help would be appreciated.


Number of integer partitions of a natural number

Consider $S \in \mathbb{N}$ where $\mathbb{N}$ is the set of natural numbers. I want to obtain $S$ by summing $k$ natural numbers strictly positive. I want to find how many possibilities I have to obtain $S$ by summing $k$ numbers, considering that:  1) order does not matter, e.g. $2+1+3$ is the same as $3+1+2$  2) repetitions are allowed


Command line tool to "cat" pairwise expansion of all rows in a file

Suppose I have a file (call it sample.txt) that looks like this:  Row1,10 Row2,20 Row3,30 Row4,40   I want to be able to work on a stream from this file that is essentially the pairwise combination of all four rows (so we should end up with 16 in total). For instance, I'm looking for a streaming (ie efficient) command where the output is:  Row1,10 Row1,10 Row1,10 Row2,20 Row1,10 Row3,30 Row1,10 Row4,40 Row2,20 Row1,10 Row1,20 Row2,20 ... Row4,40 Row4,40   My use case is that I want to stream this output into another command (like awk) to compute some metric about this pairwise combination.  I have a way to do this in awk but my concern is that my use of the END{} block means that I'm basically storing the entire file in memory before I output. Example code:  awk '{arr[$1]=$1} END{for (a in arr){ for (a2 in arr) { print arr[a] " " arr[a2]}}}' samples/rows.txt  Row3,30 Row3,30 Row3,30 Row4,40 Row3,30 Row1,10 Row3,30 Row2,20 Row4,40 Row3,30 Row4,40 Row4,40 Row4,40 Row1,10 Row4,40 Row2,20 Row1,10 Row3,30 Row1,10 Row4,40 Row1,10 Row1,10 Row1,10 Row2,20 Row2,20 Row3,30 Row2,20 Row4,40 Row2,20 Row1,10 Row2,20 Row2,20   Is there an efficient streaming way to do this without having to essentially store the file in memory and then output in the END block?


Display historical characters "uͤ", "oͤ" and "aͤ"?

I'm trying to display the above mentioned symbols. These are German historical letters which I need to mention in my thesis. I just found how to display letters with an "o" above them, but nothing with an "e". Any ideas?


Using amsmath and extarrows packages, we have many extensible arrows. But these arrows look ugly, since some parts in an arrow are boldfaced.     Are there any better-looking extensible arrows?


How can I make a CanDestroy tool on Minecraft Bedrock Edition?

I've been putting in the command: /give @p iron_pickaxe 1 0 {CanDestroy: ["diamond_ore"]}  I've been putting this into a command block. I've repeatedly tried to fix it, change it a little, re-enter it, I even destroyed the command block and tried a new one. Nothing worked. It's been saying the same thing: Line 1, Column 2 Missing: "}" or object member name  What am I doing wrong here?


Does anyone know what are the minimum requirements to install Ubuntu 20.10?


What is the physical representation of a qubit?

In regular computers, bits may be physically represented using a wide variety of two-state devices, such as polarity of magnetization of a certain area of a ferromagnetic film or two levels of electric charge in a capacitor.  But qubits have a property that they can be in a superposition of both states at the same time. I've seen 's answers, which explain how can a qubit be represented, or modeled using a regular computer.  So I want to know what can be used (and is used by companies like D-Wave) to represent a qubit in a real physical quantum computer?


How can I blend two objects and keep equal distance between them, not from their centres but from their whole figure (so the space between the objects is always the same)?  e.g. in this blending, the distance is equal between centres. I am looking for a bending that leaves same space between objects.    Note: I would like to avoid the use of brushes, that can create some inconsistencies in the objects I place.


Has anyone compiled a moderately comprehensive list on the web or elsewhere of textbooks on probability   For students who have not been introduced to the subject before That introduce both discrete and continuous probability distributions and their cumulative distribution functions, and include things like the Poisson limit theorem, the central limit theorem (say the former with proof and the latter not necessarily), and  That perhaps cover the simplest stochastic processes like the Poisson process or infinite sequences of Bernoulli trials?


VirtualDocumentRoot Setup For Local Development

I'm trying to learn about setting up httpd.conf and httpd-vhosts.conf files. I would like to have a local setup, using Wampserver on Windows 7, so that I can add a new project just by adding a new directory and a quick edit to the hosts file. I would like for it to work at least for the following general domain formats: domain.com, www.domain.com, sub.domain.com, and www.sub.domain.com.   The following is what I have so far. It seems to work, but I'm just thinking there is likely a better, possibly more succinct way:  NameVirtualHost *:80  <Directory "C:/wamp/www/%0/public_HTML">     Options Indexes FollowSymLinks Includes     AllowOverride All     Order allow,deny     Allow from all </Directory>  <VirtualHost *:80>     VirtualDocumentRoot "C:/wamp/www/%0/public_HTML" </VirtualHost>  <VirtualHost *:80>     ServerAlias www.*.*.com     VirtualDocumentRoot "C:/wamp/www/%3+/public_HTML/%2" </VirtualHost>  <VirtualHost *:80>     ServerAlias www.*.com     VirtualDocumentRoot "C:/wamp/www/%2+/public_HTML" </VirtualHost>  <VirtualHost *:80>     ServerAlias *.*.com     VirtualDocumentRoot "C:/wamp/www/%2+/public_HTML/%1" </VirtualHost>   My folder structure is as follows: C:/wamp/www/(project)/public_HTML/(folder named as the sub part of sub.domain.com)  This works, but if I change the order of the VirtualHosts in any way, it causes a 404 error for at least one of the domain formats listed above. I was wondering if anyone could explain to me why that is? And also, if someone has a suggestion for a better way, I'd love to hear it.  Thanks!


In email recognizing pattern for entity in ibm watson what is the term {2, } indicates here?

This is the pattern for recognizing an email value for the entity in IBM Watson.  \b[A-Za-z0-9._%+-]+@[A-Za-z0-9.-]+\.[A-Za-z]{2,}\b   Can you please elaborate it why below terms are used here:  \b {2, }


How are percentiles calculated in Careers 2.0?

I noticed that a percentile is placed at the top of my resume in Careers 2.0.    How are these percentiles calculated? Is there a certain threshold you need to be over in order for it to be displayed?


Kabuto used Yamato's power during the war to strengthen the Zetsu army. Will Yamato be rescued? Or will Kabuto kill him after he's done experimenting on him?


What is the probability that throwing $m$ balls at random in $n$ urns at least one urn contains $c$ elements?

Let us fix a number of urns $n$ and a fixed capacity $c$. I would like to know which is the probability that $m$ balls, thrown at random in $n$ urns, "overflow", in the sense that at least one urn has assigned $\geq c$ balls.  There are several results in the literature about the maximum number of balls in an urn (in particular, Raab and Steeger's 1999 paper), but the results are all asymptotic with high probability. I need a precise analytical result.


Future society with life span depending upon achievements

I seek some help identifying a short book I read in my childbook. It was a science fiction book about a society where due to scarcity of resources, you were allowed a certain life span depending on your achievements and contributions to society. If you exceed the amount before doing something that causes you to get promoted to a higher life span, you will be taken in the night by some sort of police and vanish.   For extraordinary achievements the highest status you could achieve was immortality (I seem to dimly remember the usage of the word amaranth for those people).   The protagonist of the novel was someone who had once been granted immortaility but then had it stripped away from him again due to some misdeed or mistake. Now he tries to get that status again (maybe under a fake identity?), but one of the immortal people is suspicious of him so he murders her. She gets revived later, because that's part of the immortality package.    It ends with him being apprehended, but society decides to invest heavily into space again so that hopefully in the future there is space for everyone to be immortal. The book ends with the protagonists being sent of an explorer into space alone.


sort behavior when using numerical option: "sort -k2,2 -nk6,6 foo" vs "sort -k2,2 -k6,6n foo"

The two examples in the title produce very different results. The first (sort -k2,2 -nk6,6 foo) brings back the following results:  153759 townhome 900 2 1 79000 876543 townhome 745 2 1 79000 222999 townhome 850 2 2 83333 759153 condo 850 2 1.5 85000 453215 townhome 1000 3 1.5 86000 646484 condo 890 3 1 93333 444555 condo 930 2 1 99999   etc.   The second (sort -k2,2 -k6,6n foo) brings back:  759153 condo 850 2 1.5 85000 646484 condo 890 3 1 93333 444555 condo 930 2 1 99999 777894 condo 790 3 1 101000 221155 condo 1030 3 1 109500 248624 duplex 1250 3 1 120000 987654 duplex 1100 3 1.5 140000   These are the correct results I'm looking for.  What causes the difference?


How do I run wireshark, with root-privileges?

A standard installation of Wireshark doesn't give the program permission to access the network interface.   I suppose I have to run the program with sudo, but do not know how to add it to the icon - if that's the way to do it.


Do I need a transit visa for the USA for travelling to Toronto via Newark?

I am an Indian national. I am flying from New Delhi to Toronto with United Airlines via Newark. I will be landing at terminal C Newark Liberty airport with a transit time of 3 hours 55 minutes and then I have a connecting flight to Toronto from Terminal B La Guardia New York with the same United Airlines. Do I need a transit visa for the USA? More related information would be highly appreciated.


How to align checkboxes and their labels consistently cross-browsers

This is one of the minor CSS problems that plague me constantly. How do folks around Stack Overflow vertically align checkboxes and their labels consistently cross-browser? Whenever I align them correctly in Safari (usually using vertical-align: baseline on the input), they're completely off in Firefox and IE. Fix it in Firefox, and Safari and IE are inevitably messed up. I waste time on this every time I code a form. Here's the standard code that I work with:   <form>     <div>         <label><input type="checkbox" /> Label text</label>     </div> </form>    I usually use Eric Meyer's reset, so form elements are relatively clean of overrides. Looking forward to any tips or tricks that you have to offer!


Append one file to two files in unix script

I need to append one trail record to both the files.   cat file1 >> file2   this appends everything in file1 to file2  My requirement is to append to file1 content to both file2 and file3.


How can I delete all cookies with JavaScript?

I have written code to save cookies in JavaScript. Now I need to clear the cookies irrespective of values that I assigned. Are there any script modules to delete all cookies that were generated by ? My Sample Code: document.cookie = 'ppkcookie2=another test; expires=Fri, 3 Aug 2001 20:47:11 UTC; path=/'  function createCookie(name,value,days) {     if (days) {         var date = new Date();         date.setTime(date.getTime()+(days*24*60*60*1000));         var expires = "; expires="+date.toGMTString();     }     else var expires = "";     document.cookie = name+"="+value+expires+"; path=/"; }  function readCookie(name) {     var nameEQ = name + "=";     var ca = document.cookie.split(';');     for(var i=0;i < ca.length;i++) {         var c = ca[i];         while (c.charAt(0)==' ') c = c.substring(1,c.length);         if (c.indexOf(nameEQ) == 0) return c.substring(nameEQ.length,c.length);     }     return null; }  function eraseCookie(name) {     createCookie(name,"",-1); }  How else could I clear all of the cookies? Will there will be any problems when I test the code on the webserver?


probability of gamma greater than exponential

Let $X \sim Gamma(3,3)$ and $Y \sim Exp(1)$.  How do I calculate $P(X>Y)$?  I believe I rewrite it as $P(X-Y>0)$ but I am unsure how to calculate $X-Y$ for two different distributions?


is it possible to login/create user in stackoverflow.com without creating/login using OpenID? i hate using OpenID, it's really confusing if you create different user/account on different websites :(     Note: the following text was submitted as an edit suggestion. I approved it, giving the user the benefit of the doubt and assuming that it was the OP's other account. -   even when i want to post this question under my new openid, i still logged as the old user, so i can't view my own question when i logged under my userid


How to reduce the command line prefix length in Bash

How to reduce the command line prefix length (i.e folder name or path in bash)?  For example:  venu@venupc:~$ cd Documents/Code/new/ venu@venupc:~/Documents/Code/new$   I want to display present folder name new instead of complete path (venu@venupc: new$).


Bash script with `set -e` doesn't stop on `... && ...` command

I use set -e to .  All work OK unless I use command with &&:  $ cat script set -e cd not_existing_dir && echo 123 echo "I'm running! =P" $ $ ./script ./script: line 2: cd: not_existing_dir: No such file or directory I'm running! =P $   compared with:  $ cat script set -e cd not_existing_dir echo "I'm running! =P" $ $ ./script ./script: line 2: cd: not_existing_dir: No such file or directory $   The first example still echoes I'm running!, but the second one doesn't. Why do they behave differently?  UPD. Similar question:


Full question: A function $f$ from a space $X, \tau$ to a space $Y, \tau'$ is said to be open if $f(V)$ is open in $Y$ whenever $V$ is an open subset of $X$. Prove that the projection $p_i$ from the product space $X_I S_i \tau$ into $S_i \tau_i$ is open for each $i \in I$.  Attempt: Let $S = \Pi_{i \in I} S_i$ be the product space. Then, let $p_i: S, \tau \to S_i, \tau_i$ be the projection $p_i(s) = s_i$ for each $s \in S$. Then, $p_i$ is continuous for all $i \in I$.  Then, if $V_i$ is open in $S_i$, then $p_i^{-1}(V_i) = S$ is one of the open sets in the basis, namely $\{\Pi_I V_i : V_i \text{ open in } S_i \text{ and } V_i = S_i \text{ for all but at most finitely many i}\}$, and we see clearly that $V_i$ fits the criteria for all $i \in I$ because we defined $V_i$ as being open in $S_i$ and $I$ is a finitely countable set, hence there will be at most finitely many $i$ for which $V_i = S_i$.  Thus, the projection $p_i$ is open for each $i \in I$.  I'm not sure if I tackled this correctly and wanted to make sure I was on the right track or got it right.


How can I split a monolithic partition into two, one for `/` and one for `/home`?

Right now, I have everything in a partition (except EFI system partition). How can I split the partition into two, one for / and one for /home?   How would you use parted to do that step by step?  How would you use gparted to do that step by step?  How would you use LVM to do that step by step?   One thing I am not sure of is that I can't just shrink the partition and create a second partition on the space that is freed by shrinking, because that doesn't move /home to the new partition.  Thanks.    $ sudo parted -l [sudo] password for t:  Model: ATA TOSHIBA MQ01ABF0 (scsi) Disk /dev/sda: 500GB Sector size (logical/physical): 512B/512B Partition Table: gpt Disk Flags:   Number  Start   End    Size   File system  Name                  Flags  1      1049kB  538MB  537MB  fat32        EFI System Partition  boot, esp  2      538MB   500GB  500GB  ext4  $ sudo df -h [sudo] password for t:  Filesystem      Size  Used Avail Use% Mounted on udev            1.7G     0  1.7G   0% /dev tmpfs           340M  1.4M  338M   1% /run /dev/sda2       457G  6.7G  428G   2% / tmpfs           1.7G   27M  1.7G   2% /dev/shm tmpfs           5.0M  4.0K  5.0M   1% /run/lock tmpfs           1.7G     0  1.7G   0% /sys/fs/cgroup /dev/sda1       511M  6.1M  505M   2% /boot/efi tmpfs           340M   20K  340M   1% /run/user/1000 tmpfs           340M     0  340M   0% /run/user/106


I am assuming that $\omega_1$ is the first uncountable ordinal and I'm using ordinal arithmetic.   I have so far that if $\alpha$ and $\beta$ are ordinals, then $\alpha + \beta$ = sup{$\alpha + \gamma$ | $\gamma < \beta\}$ where $\beta$ is a limit ordinal.   So since $\omega$ and $\omega_1$ are both ordinals, can I say that $\omega + \omega_1$ = sup{$\omega + \gamma$ | $\gamma < \omega_1 \}$?   And then I'm not sure where to go with this.   Thanks in advanced.


Why doesn't this question "meet our quality standards"?

I've tried to ask this question both on  and .  Is it possible to prove idempotence? Is it possible to use static or dependent types to prove a function is idempotent? If so, how would one do it?  I keep getting an error saying the question "does not meet our quality standards". This seems like a very reasonable question to me, what's wrong with it?


What is the purpose to use an empty interface?

Empty interface:  interface IError { }   and inherited more than one classes:  class A : IError {    //To do }  class B : IError {    //To do }


I found a way to earn reputation by downvoting. Specifically: If I downvote a post, then wait a while, then un-downvote the post, my net reputation count increases by 1.   Here's why it's happening. Two days ago, I posted an answer to  question on math.SE. It became a "hot" network question and I quickly reached my daily reputation limit. Thus, the question kept getting upvoted, but I wasn't earning reputation for it (as it should be).   Today, I once again reached my daily reputation limit. After reaching this limit, I downvoted a post on math.SE. So, my daily earned reputation was effectively 199. The next time somebody upvoted my question, I gained +1 reputation. But then, I retracted the downvote. To my surprise, I gained another +1 reputation.   Here is the data on the reputation I gained today:    Usually, I would have earned 215 in total: 200 reputation from upvotes and 15 from one accepted answer. But instead I earned 216 because I gained the extra +1 from retracting the downvote after already being "reimbursed".  Obviously, this trick isn't widely applicable. A user has to already have reached their reputation cap. And due to the limit of 40 votes per day, they would only be able to use this trick to earn a maximum of 40 bonus reputation points per day. I realize I'm not the first to point out inconsistencies in the voting system (see , , ). But as far as I can tell, this is the first instance where it is possible for a user to reliably game the system to earn 40 reputation per day without making any contributions.   Is this a bug? Should it be addressed?


I am traveling to India and I hold two passports from two different countries. Is it ok for me to enter India with one passport and then leave the country and next time to enter with my other passport.I would appreciate if someone could shed a light on this issue. Thank you!


why grep "!" shows "bash: !: event not found"?

If I run  grep "!" test.txt   it will show error     bash: !: event not found   Well, I know I actually should use grep '!'. But how to understand the above error?  I know ! is bash special character. According to .      Double quotes: "..." prevents some substitutions but allows others.   Every substitution that begins with a dollar sign $ is performed, as   is the legacy ... (backtick) command substitution. Backslash   escaping is also performed. No word splitting or filename expansion is   performed.   It doesn't mention that double quotes will affect !. Could somebody explain how does bash or grep interpret grep "!"? What is the "event"?


Find the volume of the largest right circular cone that can be inscribed in a sphere of radius r?

I checked this  but didn't fully understand it.   I know that the volume of a right circular cone is $V = \frac{1}{3}\pi x^2h$  I know that I must take the first derivative and set it equal to zero, which will find the maximum.   My problem is how to deal with the variable $h$, the height?   How can I rewrite that in terms of $x$ or $r$.      I have tried to implicitly differentiate this equation, but that wasn't helpful for me.


unable to run the tests using testng in selenium

While running the below code getting java.lang.NullPointerException: . Let me know how to resolve this package login; public class an { public WebDriver driver; @BeforeTest public void setup() {     System.setProperty("webdriver.chrome.driver",             "C:\\Users\\chromedriver.exe");     WebDriver driver = new ChromeDriver();     driver.manage().window().maximize(); } @Test public void url() {     driver.get("https://www.google.com/"); }  } error


Google Analytics: Unable to create more Property and View

I have 20 Properties and one of them has 10 Views. The "Create new Property" and "Create new view" are grayed out, after I added those 10 Views. Is there a limit or something I did wrong?


Average number of comparisons made by the Binary search (summation computation)

I am trying to find out the average number of comparisons made by the Binary search. In that, I'm confronted with following summation :- Avg = $(1/n)\sum_{i=1}^{\log_2 n} i*2^i$ In this summation, $i$ are the number of comparisons made at each node in $i^{th}$ level of the Binary tree and $2^i$ is the number of nodes in the tree at level $i$. Please help me solve this summation. If not completely solve the summation, at least please help me get started.


I found this interesting function defined by the following infinite series:  $$g(x)=\sum_{n=0}^\infty(-1)^nx^{2^n}$$  And I noticed that it followed the functional equation $g(x)=1-g(x^2)$.  I was interested, particularly, in the following limit:  $$L=\lim_{x\to1^-}g(x)$$  And assuming it exists, the functional equation yields  $$L=1-L\implies L=\frac12$$  Which, at first look, the limit appears to exist.    However, upon closer inspection, convergence gets a little sketchy...    Can we determine if the limit converges?


Figuring out who is the real owner of Facebook Page

Is there any way for anyone at Facebook to determine, who is the real owner of Facebook Page?  I want the create a webpage, where I want to post some true facts about my previous employer, to prevent others from falling into same problems, like I did. There will be absolutely no lies, just the pure facts (but verifiable only, once you're employed, not before, and that is the purpose of the page). But even so, I want to avoid any problems did by my former employer. And in the same time, I don't want to violate Facebook's policy and registering another (fake) account for setting up that page.  Is there any way for my former employer or anyone to find out, who had actually created (and is managing) particular Facebok Page? Or this kind of details are available only to Facebook stuff and would be revealed only upon eventual court case?


im getting this error "Exception in thread "main" java.lang.NullPointerException" even thought there are no errors in the code

I'm getting an error even though I don't see the problem by reviewing the code.   It says the error is at "char[] linechars;".   I'm not sure why I'm getting this error when using character arrays in the Employee1 class.    public class Employee1 {     public String name;     public String number;      Scanner keyboard = new Scanner(System.in);      char[] lineChars;      public Employee1() {         this.lineChars = number.toCharArray();     }      public void setName() {         System.out.println("enter name");         name = keyboard.nextLine();     }      public String getName() {         System.out.println("your name is " + name);         return name;     }      public void setNumber() {         System.out.println("enter number");         for (int i = 0; i < lineChars.length; i++) {             if (i == 0 || i == 1 || 1 == 2 || i > 0 && i <= 9) {                 number = keyboard.nextLine();             } else {                 System.out.println("must be 1-9");             }         }     }      public String getNumber() {         System.out.println("your number: ");         return number;     } }


Is it possible to learn a neural networks for a constant target?

I saw a paper () where they learn L based on the following cost function: $$(D_1L(q(k-1), q(k)) + D_2L(q(k),q(k+1)))² = 0$$ Here $D$ is the derivative with respect to ith argument of L. This can be obtained via automatic differentiation and it is fully compatible with backpropagation. So the target is always zero independently of the input of L but how does the optimization method knows the real values of L for a given input? I mean as long as the cost function is satisfied with a zero value the model is learning but it can be learning wrong values for L. For instance, if the real value of $D_1L(q(k-1), q(k))$ is 10 then the real value of $D_2L(q(k),q(k+1))$ has to be -10. However the neural network may be learning wrong values for L as long as they are symmetric, for example -3 and 3. This is an ill posed problem due to the infinite possible solutions. Am I missing something or the method in that paper simply doesn't make any sense? Is it possible to learn a neural network in regression task with constant target? Edit: The goal is not to predict always that value. The goal is to learn L by predicting always zero (see the cost function). The question here is in order to learn L in such a way that it respects the cost function, there are infinite possible solutions, for instance if $D1L(q(k−1),q(k))$ = x then D2L(q(k),q(k+1))=-x and its sum gives 0 respecting the cost function. But as you can see x can assume any value as long as the cost function is respected, when in reality the goal is to learn a specific L. But the optimization doesn't know a priori value for L so I guess it should just assume a random value for x. In the paper they don't mention the ill posedness of the problem, either they solved it or not. I would like to know if what I'm thinking makes sense or if I'm just missing something.


LaTeX or TeXstudio creating a bunch of files for each compilation

I just got a new laptop and I installed the TeX Live installation of LaTeX. My favorite editor is TeXstudio so I downloaded that as well. I spent a day working on a document and compiled it a bunch of times. When I subsequently checked the working directory, I found that a lot of files had been created. These files end up as, for example, "NAME".tex.AFi688, "NAME".tex.ALw688, etc... with every compilation creating a new set of files with a different, but similar, file extension.  In the start of my document I have the line "%& -aux-directory=AuxOut", which should take care of the auxiliary files, but upon closer inspection, the auxiliary files don't appear in in this directory, but rather in the directory that contains the source file itself.  This is not a problem when compiling on my desktop computer, so it might be that some of my settings are different on my laptop, but I am unable to identify which settings to modify.  Has anyone experienced something similar?  Thank you


Create shortcut for creating new folder in windows

Is there any way to set a shortcut (e.g. ctrl+alt+n) for creating a new folder in windows 7?   This is obviously instead of right clicking and pressing create new folder.


What's the official method for checking integrity of a source package?

I want to add a feature to pam, and I figured a good starting point was to download the libpam-modules source. On download, I notice this warning: gpgv: Can't check signature: public key not found  What is the official method for verifying the integrity of source packages, when apt-get cannot find the public key?  The newest version of ubuntu-keyring and debian-keyring packages are installed already.  There are  to find the corresponding public key and install it. However that in itself does not provide integrity, because in effect it is trusting the contents of the dsc file to tell me which public key to use to verify the signature on the dsc file.  Is the gpg signature on the dsc file a critical part of the integrity verification? Could a man in the middle or a rouge mirror serve a malicious version of the file where the warning from gpg is the only indication something bad is happening? Or does apt-get have other means of validating the integrity?  Where would I find official documentation on the security model? Ideally I would like to understand the full trust path from the install image to the source package I am downloading.  The full output from the download was this:  $ apt-get source libpam-modules Reading package lists... Done Building dependency tree        Reading state information... Done Picking 'pam' as source package instead of 'libpam-modules' NOTICE: 'pam' packaging is maintained in the 'Bzr' version control system at: https://code.launchpad.net/~ubuntu-core-dev/pam/ubuntu Please use: bzr branch https://code.launchpad.net/~ubuntu-core-dev/pam/ubuntu to retrieve the latest (possibly unreleased) updates to the package. Need to get 2,043 kB of source archives. Get:1 http://dk.archive.ubuntu.com/ubuntu/ trusty/main pam 1.1.8-1ubuntu2 (dsc) [2,510 B] Get:2 http://dk.archive.ubuntu.com/ubuntu/ trusty/main pam 1.1.8-1ubuntu2 (tar) [1,893 kB] Get:3 http://dk.archive.ubuntu.com/ubuntu/ trusty/main pam 1.1.8-1ubuntu2 (diff) [147 kB] Fetched 2,043 kB in 6s (316 kB/s)                                               gpgv: Signature made Fri 31 Jan 2014 11:12:23 PM CET using RSA key ID 64792D67 gpgv: Can't check signature: public key not found dpkg-source: warning: failed to verify signature on ./pam_1.1.8-1ubuntu2.dsc


Laptop freezes for a few minutes then resumes

This laptop has 3 years of use. After Windows 7 boots it starts having this freezing "waves" that last for a few seconds to a few minutes. I can use it again for a few seconds or minutes and then it happens again.  During the freezes the mouse still moves, but no clicks or keys are effective. Almost anything I try to do seem to trigger the freeze, like trying to connect wifi, trying to enter the Task Manager, trying to install Google Chrome.  In safe mode with network the problem is still present. I noticed it happening even in the BIOS utility (transitions from menus freezing for 2sec). I already restored de OS to the factory state with a full restore (formatting HDD) and it still happens. Thus, I don't think it's SW related.  I know the fan can still spin because I can hear it and there is hot air flowing through the vent. After the boot it's always making noise. After the first freeze it goes silent and no noticeable air flowing.  It never really freezes in a hard way and never turn off or restart. The HD Led never goes off, it's always on or blinking fast, like there is a lot of HD operations going on.  SMART stats:


Let $Z_n$ be the set of all $n \times n$ matrices that commute with all $n \times n $ matrices. Show that $$Z_n = \{\lambda I_n \ | \  \lambda \in \mathbb R\}$$  ($I_n$ is the $n \times n$ identity matrix)  I don't know how to use $E_{ij}$ (matrix with $1$ in $(i,j)$ and $0$ elsewhere) and the elementary matrix $P_{ij}$ to prove this question. Can anyone explain it please?


Spellcasting and interactions with S/M components when hands are in use

Let's say I've got a creature who has a shield in one hand and their focus in another. They also have the war caster feat  They'd like to cast a spell requiring a Material component with cost/that will be consumed and a somatic component.  What does the caster need to do in order to successfully cast this spell?  The way I've always understood if its a spell that needs a costly material/material consumed then you would have to drop something in order to give you a free hand to access the materials.   To give more clarity for this issue, here is a specific example. I have a high level wizard at my table, who has taken the war caster feat, they also have proficiency with shields. In one hand they wield a shield, in the other they carry their arcane focus of a wand. They cast the 6th level spell, Circle of Death which has the following Components: V, S, M (the powder of a crushed black pearl worth at least 500 gp). At the table I allowed the cast to go through as the wizard had previously obtained the crushed black pearl dust of the appropriate value. My question becomes, should I have required the wizard to drop/unequipped the shield so that he could of accessed the pearl dust from his backpack/component pouch.


How do I use an NBT editor to modify item properties?

In Minecraft, the NBT (Named Binary Tag) format is used to store data of our Minecraft worlds, including block, entity, and item properties. In the Java Edition of Minecraft, you can modify this data by including the data in the command, like so: /give @s diamond_sword{Enchantments:[{id:"minecraft:knockback",lvl:10s}]}  In the Bedrock Edition, on the other hand, NBT is inaccessible from commands. In order to modify NBT, we need to use an external editor. What are some useful item properties that I can modify with an NBT editor, and how can I do so?  Related:


\phantom ignored at beginning of line (or line break inserted)

In a document, I tried to use \phantom{} to indent the next line. However, it seems the phantom part is removed and/or a line break inserted.  \documentclass[xcolor=pdftex,dvipsnames,table]{beamer} %  \begin{document}  \noindent X abc abc\\ X abc abc\\ \phantom{X} abc abc\\  \end{document}   This is what I get:    What I expected is the X to be invisible and the abcs to be aligned under to line above. Why is this not happening?


I mostly have exposure to American English online. I am currently writing out a resume and need some help.   In Australia, in general, we write programme to mean a schedule or community programme. However with computer studies I'm inclined to write program to mean a computer program rather than the proverbial programme.  What is the correct spelling?


Material preview doesn't show color changes, the object stays black

I've just started a Blender course, but I got an issue. When I go to the Material Preview and want to change the color, nothing happens, it stays black.


How to permanently add macros to Excel as part of the program?

I have a macro where I'm not sure when I will need to use it.    I need them built into Excel to be able use them at every start of the program – like you would install some add-on (e.g. Kutools).  How can I do it?


How do I get the form id of my form? I've just begun to make my modules and I'm at a standstill. I got this code from someone else and am trying to customize it:  function hook_form_alter(&$form, &$form_state, $form_id) {   if ($form_id == 'the form id for the node form') {     $form['#submit'][] = 'my_custom_submit_handler';   } }


Two-point Gaussian Quadrature Rule with weight function $w(x)=x$

I am trying to construct a formula of the form $\int_0^1 xf(x)dx=A_0f(x_0)+A_1f(x_1)$ with degree of precision 3.   A Gaussian Quadrature is the only interpolatory quadrature with degree of precision 2n+1 with $x_0,x_1,...,x_n$ being the nodes chosen that are also the $n+1$ zeros of the $(n+1)$th orthogonal polynomial.   Looking through similar questions, most recommend using the method of undetermined coefficients to find $x_0,x_1,A_0,$ and $A_1$ by using $f(x) = 1,x,x^2,$ and $x^3$. Does using the method of undetermined coefficients inherently give you nodes that are the $n+1$ zeros of the $(n+1)$th orthogonal polynomial?   For $w(x)=1$, we can use the Legendre orthogonal polynomials to get the nodes, but from what I could find online there doesn't exist such a thing for $w(x)=x$.


How do I merge the answers I gave with my unregistered account with the answers I gave using the account I created later?

I have answered a question (); I then registered an account with my OpenID, but the answer has not been assigned to my current account. What went wrong?


edges on graph do not align with center of nodes in foreach

As far as I can understand this should draw the same set of five edges in exactly the same way.  The first set of edges are positioned correctly.  But the second set of edges is horribly aligned.  On my screen, of the \foreach edges, the bottom horizontal one is shifted to the right, the others seems to start ok and then end up further from the center of the pentagon then they should.  Aside from wondering how to fix the alignment, I would also love to understand why this only happens inside a \foreach.  I can "solve" this by first drawing the nodes with minimum size=0mm, and then at the very end redrawing them with 2mm, but that seems less than optimal...  \documentclass{beamer}  \usepackage{calc,ifthen} \usepackage{amsthm,amsmath,amssymb} \usepackage{tikz}  \begin{document}  \frame{ \begin{tikzpicture} \def\r{2cm}  \foreach \t in {0,...,4} {   \node[circle,draw, outer sep=0mm, inner sep=0mm, minimum size=2mm] (a\t) at ({90+\t*72}:\r) {} ; }  % draw the edges of the pentagon in a silly way % draws edges from node-center to node-center \draw (a0) edge (a1) ; \draw (a1) edge (a2) ; \draw (a2) edge (a3) ; \draw (a3) edge (a4) ; \draw (a4) edge (a0) ;  % draw the edges of the pentagon in a better way % draws edges from node-something to node-something-else \foreach \t in {0,...,4} {   \pgfmathsetmacro{\s}{mod(\t+1,5)}   \draw (a\t) edge (a\s) ; }  \end{tikzpicture} }  \end{document}


What does it mean for two definitions (of the reals) to be equivalent?

I have read that the real numbers can be defined in several ways, but that these definitions are all 'equivalent'. What does this actually mean? Is it that there is a unique set of numbers satisfying each definition, and that these sets are all the same?


Consider the following code:  if b > 5:     a += 1 elif b < 0:     a += 2 else:     a += 3   In C there is a convenient (although not very transparent) way to write it in one line:   b > 5 ? a+=1 : b < 0 ? a+=2 : a+=3;   Is there a way to write it that concisely in Python?


"Was" and "were", which is correct in this context? Can a mood be established in a terminating clause?

I'm not sure I understand what establishes a mood. Does a sentence have to establish a mood at the begining or can a mood be established in a clause at the end?     And, that's if he could get elected after 35% of Americans turned out in opposition to both parties and a new popular movement was seeded.   Or,      And, that's if he could get elected after 35% of Americans turned out in opposition to both parties and a new popular movement were seeded.   In both of these we're talking about a scenario that doesn't exist. The top one clearly sounds more right to me.


Why power set of integer is uncountable?


I was working on a c# program today and ended up having to chase a bug for quite some time.   I was trying to make a copy of an object change a few fields and send it on as well as the original  for example  Function(Object A) {     Object B = new Object();     Object B = A;      B.foo = "bar";      Send(A);      Send(B); }   My program started treating A and B as the same object meaning that any changes to A would also change B and vise versa.  I know that the Object A and B are both referencing the same memory.  Is there a short hand way to ensure the line Object B = A references new memory thus creating different objects. Or is the only way to create a copy constructor in my Object and create B with Object B = new Object(A)  eg:   Object(Object a){    foo = a.foo;    ... }   Basically i just what to know more about how C# handles object references and memory allocations. Big subject i know.


Using varchar variable with IN operator where ints are expected

This works:  declare @ids varchar(50) = '1, 2, 3' create table #test  (id int) exec('insert into #test select userid from users where userid in(' + @ids + ')')   This doesn't:  declare @ids varchar(50) = '1, 2, 3' create table #test  (id int) insert into #test select userid from users where userid in(@ids)   It (kinda obviously) returns:     Conversion failed when converting the varchar value '1, 2, 3' to data   type int.   Is there an elegant way to make the query work without using exec(), like I try to do in the second piece of code?


Prove: $\det(A)=0$ where $A\in M^{(2k+1)\times(2k+1)}(\mathbb{R})$ is anti-symmetric

Let $A\in M^{(2k+1)\times(2k+1)}(\mathbb{R})$ where $k$ is a natural number, and also assume that $A$ is an anti-symmetric, meaning  $$A=−A^{T}$$  Prove that $\det(A)=0$.


If circle and line is a draw command as below, is it possible to get intersection? for this example, the C point now is hardcoded.   \documentclass[border=5pt,convert={density=300,outext=.jpg}]{standalone} \usepackage{tikz}  \usetikzlibrary{positioning} \begin{document} \tikzset{>=latex} \tiny\begin{tikzpicture}  \coordinate (O) at (0,0);  \coordinate (A) at (1,0);  \coordinate (B) at (1,1.732);  \draw[->] (0,0) -- (2,0);  \draw[->] (0,0) -- (0,2);  \draw (A) circle (1);  \draw (A) -- (1,2);  \draw (O) -- (B);  \coordinate (C) at (0.5,0.861);//fix me with intersection of circle and line  \draw (A) -- (C);   % annotation  \draw[fill=red] (O) circle (1pt)  node[below left=0 of O] {O};  \draw[fill=red] (A) circle (1pt)  node[below right=0 of A] {A};  \draw[fill=red] (B) circle (1pt)  node[above right=0 of B] {B};  \draw[fill=red] (C) circle (1pt)  node[above left=0 of C] {C}; \end{tikzpicture}  \end{document}   Output:


I plan on configuring an Ubuntu Server via the CLI. Is there any program that can capture my commands (and perhaps responses)? Just trying to make documentation more efficient.  Thank you.


`renice` seems to have no effect on CPU usage on Mac 10.13.4

I am trying to test out the renice command on my Mac, it seems to be having no effect. This is how I'm testing it:  I have a dual core CPU with hyper threading, so I run 6 instances of node -e 'while(1){}' which, combined, max out my CPU. (Alternatively, run while true; do echo running > /dev/null ; done if you dont have node.)  I then get a PID of one of the node processes, either by the activity monitor application or pgrep, and then run sudo renice -n 19 -p $PID.  By looking at the activity monitor application or htop, the CPU usage of all of the node processes are still equivalent:    My understanding was that the process that I reniced would have a low priority, and so would not use a significant amount of CPU time when there are other processes using it.  Am I misunderstanding something about renice? Or is this a bug in Mac OS?


I am learning algebraic number theory, the exercises are so hard for me, could you please recommend me a book with answers? Many thanks!


Review queue tests are not always valid; there should be an option to appeal a test

After failing a review queue test there should be a button to appeal the test, which later can be reviewed by other people, to remove temporary bans.  Some questions are invalid, but upvoted because they are important information to the community, but they should not be allow to be integrated as a test.    This question is very broad and misleading, and the majority of the information to understand the question is third party and not part of our site.


Why is it that a one time pad is vulnerable is the key is shorter than the message?  I know that if a key is reused across multiple plaintexts, you can XOR two existing ciphertexts to get the pad, but I'm not entirely sure how this works in practice.    Any help/ explanation is appreciated. Thanks.


A group of order $pqr$ (primes $p > q > r$) has a subgroup of order $qr$

I've done most of the following problem, but I can't seem to get part (d).  Let $G$ be a group of order $pqr$ for primes $p > q > r$.  By a counting argument one can see that there is either a normal Sylow $p$-subgroup or a normal Sylow $q$-subgroup (you may assume this).  Prove: (a) $G$ has a normal subgroup $H$ of order $pq$. (b) Every subgroup of order $p$ or $q$ is contained in $H$. (c) $G$ has a normal subgroup of order $p$. (d) $G$ has a subgroup of order $qr$.  Proof: Let me first state the following lemma: if $N_0$ is a subgroup of a finite group $G_0$, and $[G_0 : N_0]$ is equal to the smallest prime which divides $|G_0|$, then $N_0$ is normal in $G_0$.  The proof is not difficult.  It can be established by a counting argument, or by looking at the natural homomorphism from $G_0$ to the symmetric group on the left cosets of $N_0$ in $G_0$. For (a), let $N$ be a Sylow $p$-subgroup, and $K$ a Sylow $q$-subgroup.  One of these subgroups is normal by assumption.  So $H := NK$ is a subgroup of $G$ with order $pq$.  Its index in $G$ is $r$, so it is normal in $G$ by the lemma. (b) If $P$ is a subgroup of order $p$, it is a Sylow $p$-subgroup, so it equals $gNg^{-1}$ for some $g \in G$.  So $g^{-1}Pg = N \subseteq H$, whence $P \subseteq gHg^{-1} = H$. Similarly for a subgroup of order $q$. (c) Let $P$ be a subgroup of order $p$.  Then it is a Sylow $p$-subgroup and it is contained in $H$. Since $|H| = pq$, and $[H : P] = q$, automatically $P$ is normal in $H$.  If $P_1$ is another Sylow $p$-subgroup of $G$, then it is also contained in and normal in $H$, whence $P = P_1$. (d) Let $Q$ be a Sylow $q$-subgroup, and $R$ a Sylow $r$-subgroup.  If $Q$ is normal in $G$, we are done, since $QR$ is a subgroup of order $qr$.  Otherwise, $n_q$ (the number of Sylow $q$ subgroups) is either $r, p,$ or $pr$.  We cannot have $n_q = r$, since then $q$ divides $r-1 < q$.  If $n_q = p$, then $|N_G(Q)| = qr$ and we are done.  The last possibility is that $n_q = pr$.  I don't know what to do here.  I've tried making a counting argument involving the possibilities for $n_r$, but I haven't been able to make anything work.


In XCOM: Enemy Unknown missions get more difficult as I advance in the game - at least in absolute terms. I was wondering if the mission difficulty does or does not depends on   Elapsed time (ingame) Plot progress Research progress other factors   Anyone has any insight into this?


You're given a card game as the following:   With a randomly shuffled set of 52 cards, you keep turning over the first card from the remaining cards until you get an Ace Once you get an Ace, you keep turning over cards only this time you look for 2, once you get 2, you look for 3, so on so forth When you have turned over all cards, the biggest number you reached to is your score   What is your expected score then?  [ People used simulation to solve this problem in the aforementioned link.  Is it possible to solve this problem analytically?   For example, as a classic question, we know that on average you need to wait for 10.6 cards to get an Ace.   Or is it possible to get an accurate range for the expectation at least?


I have completed the game, beaten my rival, and have talked to Professor Sycamore. but I didn't get the upgrade and I just finished the looker quest line. And I am not restarting the game. so how do I fix this?


Entering as a tourist after French student visa

I am a US citizen. I just finished a French visa type D VLS-T "long séjour temporaire" student visa on February 27. I returned to the US and got an exit stamp.   I want to return to France (to visit friends) for 70 days starting April 1. I want to confirm that the 90/180 rules did not apply while I had a type D visa, even though it was a VLS-T not a VLS-TS. I think this is in article 6 of the schengen borders code.   I want to confirm this, but the French consulate is being vague and I'd really like a more clear answer as to how/why this is possible. Additionally, I am worried that a VLS-T may not have the same rights as a VLS-TS.   ****if anybody is wondering I got into the country no problem


Differential equations that are also functional

I was toying with equations of the type $f(x+\alpha)=f'(x)$ where $f$ is a real function. For example if $\alpha=\frac{\pi}{2}$ then the solutions include the function $f_{\lambda,\mu}(x)=\lambda cos(x+\mu)$. Are there more solutions?  On the other hand, if I want to solve the equation for any $\alpha$, I can assume a solution of the form $f(x)=e^{\lambda x}$, and find $\lambda$ as a complex number that enables me to solve the equation...   I was wondering: is the set of the solutions of dimension 2 because the derivative operator creates one dimension and the operator $\phi: f(x)\mapsto f(x+1)$ adds another one? Is there some litterature about this kind of equations?  Please satisfy my curiosity if you can... Thanks!


Limit of a trigonometric rational expression

How to evaluate the limit of this expression?  $$\lim_{x\to\infty} \frac{\sin^2\left( \sqrt{x+1}-\sqrt{x}\right)}{1-\cos^2\frac{1}{x}}$$  I managed to simplify the denominator into a sinus form by the Pythagorean formula, and also modified the argument of the sinus in the numerator by dividing with a conjugate which I think is necessary, into this final form:  $$\lim_{x\to\infty} \frac{\sin^2\left(\frac{1}{\sqrt{x+1}+\sqrt{x}}\right)}{\sin^2\frac{1}{x}}$$  And that's where I got stuck. So far I've tried to come up with some solution to eliminate the sinus from the denominator, without success. I'm sure the solution is pretty obvious but I don't quite know how to modify the trigonometric functions in this fashion, so any help would be most appreciated.


What are the server requirements in terms of CPU, RAM and bandwith for etherpad-lite?

As my  was marked as duplicate of a very generic question, I want to post here again,as i found an answer :-) For an event with 500 to 1000 participants we plan to use etherpads for subgroup work (100-200 subgroups of 5 users each). Does anybody have experiences what kind of server (in terms of CPUs, RAM, bandwidth, whatever) is required to have a optimal performance of etherpad-lite? I didn't find any documentation about performance and user numbers. As mentioned in response to anx's comment, of course we do plan to run a load test, but before I'd like to get at least a rough idea of what are we talking about in terms of CPU and RAM requirements of etherpad-lite in relationship with number of concurrent users. If someone has already done some testing and gathered some experience with Etherpad, this would help me reduce my own testing effort. Is there a maximum number of concurrent users per pad that is recommended? Is there anything to consider for such an setting? Thanks!


"If P, then Q; If P, then R; Therefore: If Q, then R." Fallacy and Transitivity

Two fallacious arguments:   If P, then Q  If P, then R  Therefore: If Q, then R   And   If P, then Q  If R, then Q  Therefore: If P, then R   However, if these particular propositions were interpreted as being connected not by a conditional sign but by an "=" (identity) sign, wouldn't we have examples of the transitive property (i.e. P=Q, P=R, so Q=R)?


What would be the best method for making regularly spaced holes in a cylindrical mesh? Similar to the vent holes you'd see on gun barrels like these:       Without creating any n-gons, having good topology, and not excessively increasing the tri/polycount overall (this is for models that would potentially be used in a game). It would be good to know how to do this in a way that would work where the holes overlap on the x axis of the cylinder if you see what I mean, like the MG34 barrel, and where they don't, like the SMG barrel.


What is the difference between HTML tags  and ?

I would like to ask for some simple examples showing the uses of <div> and <span>.   I've seen them both used to mark a section of a page with an id or class, but I'm interested in knowing if there are times when one is preferred over the other.


Using "that" 2 times in a sentence next to itself

Can I use "that" 2 times in a sentence next to itself?


Action induces action of group ring on singular chain complex.

See  for a related question.  Let $X$ be a space that satisfies the hypotheses used to construct a universal cover $\overline{X}$. Let $\pi = \pi_1(X)$ and consider the action of the group $\pi$ on the space $\overline{X}$ given by the isomorphism of $\pi$ with $\text{Aut}(\overline{X})$. Let $A$ be an abelian group and let $\mathbb{Z}[\pi]$ act trivially on $A$, $a \cdot \sigma = a$ for $\sigma \in \pi$ and $a \in A$.  How do I see that the action of $\pi$ on $\overline{X}$ induces an action of $\mathbb{Z}[\pi]$ on the singular chain complex $C_*(\overline{X})$ such that each $C_q(\overline{X})$ is a free $\mathbb{Z}[\pi]$-module and$$C_*(X; A) \cong A \otimes_{\mathbb{Z}[\pi]} C_*(\overline{X})?$$


I was trying out Jinx with Runaan's Hurricane in a game (cause I saw in the patch that the Runaan's bolts now look like Jinx rockets.  Hey explode like them too.  The question I had is, do the bolts on Runaan's apply on hit effects, specifically Jinx's rocket AOE damage?


Source:      The airport has become a symbol of Ukraine's fight against separatists, and the "cyborgs" are Ukrainians who have held on to it despite persistent rebel attack.   The nickname was first used online and has since become a media staple in Ukraine. It stuck, because to some the Donetsk airport defenders' exploits have appeared superhuman.   What does that actually mean?


How to avoid double quotes when saving Excel file as Unicode?

I have an Excel file with Unicode content of which some cells contain text inside double quotes, for example "text".   When I save the Excel file to a text file in Unicode format, the text which contains the double quote is saved as three double quotes, for example """text""".  There are some places where I even have text which contains comma (,). For example, text, which is converted into "text," in the Unicode file. It is adding double quotes to the text, which I guess contains special characters.  How can I avoid this?


Why are there two versions of VLC on the Software Center?

On the Software Center I've seen that there are two versions of VLC. The first one is the 2.2.2-5ubuntu0.16.04.4, the one that I already have installed, and that has all the reviews on the page, and the second one is the  3.0.1-4-g14a4897.  Why? And should I uninstall the old one and switch to the other one, or not?


Global search- I want search results to be displayed all related records of account and also records of their account hierarchy

I have an account with account hierarchy setup and there is one Custom object "Agreement" added as related list on the account. When, I search an account with an account name on global search I want all related agreement records of that account as well as of all account comes under the account hierarchy, to be displayed after search. How to achieve this in Salesforce?


I want to add some days into a given date and below are my codes: Example: Given date = 2015/11/27 11:00, number of days = 2 My result should be 2015/11/29 11:00..  function setEndDate(date) {     var duration = $("#duration").val();     var dValue = parseInt($("#showDValue").val()) * 7;      if (duration == "Week(s)") {          date.setDate(date.getDate() + dValue);     } }   But i m getting error of this :  TypeError: date.getDate is not a function   Any solution?? Please help...


TCP *:hbci (LISTEN) - What does hbci mean?

I simply open an http server from my terminal (with node) listening on port 3000, which is obviously working if I request localhost:3000 in a browser.    Now, I want to see this connection so I use netstat. I'm supposed to see server connection on port 3000, and client connection on another port:    $ netstat -p tcp Proto Recv-Q Send-Q  Local Address          Foreign Address        (state)  tcp6       0      0  localhost.hbci         localhost.50215        ESTABLISHED tcp6       0      0  localhost.50215        localhost.hbci         ESTABLISHED tcp6       0      0  localhost.hbci         localhost.50214        ESTABLISHED tcp6       0      0  localhost.50214        localhost.hbci         ESTABLISHED tcp6       0      0  localhost.hbci         localhost.50213        ESTABLISHED tcp6       0      0  localhost.50213        localhost.hbci         ESTABLISHED tcp6       0      0  localhost.hbci         localhost.50211        ESTABLISHED tcp6       0      0  localhost.hbci         localhost.50212        ESTABLISHED tcp6       0      0  localhost.50212        localhost.hbci         ESTABLISHED tcp6       0      0  localhost.50211        localhost.hbci         ESTABLISHED tcp6       0      0  localhost.hbci         localhost.50210        ESTABLISHED tcp6       0      0  localhost.50210        localhost.hbci         ESTABLISHED   No entries about the server connection on port 3000. But the localhost.hbci, switching from a local to a foreign address, seems to be my server connection. And if I type:      $ lsof -i TCP:3000 COMMAND  PID        USER   FD   TYPE DEVICE             SIZE/OFF  NODE NAME node    1144 garysounigo   11u  IPv6 0x6d9a12e1e288efc7 0t0       TCP  *:hbci (LISTEN)   I'm sure that hbci represent my port 3000.   Does anyone know something about what hbci means or refers to? Is it a port for local server ? A protocol for s local connection? I find anythings everywhere (  on any port.. ;) )


Ranking based on binomial data (example: website conversions)

Let's say I have a database of all websites and their corresponding viewers and buyers. I want to rank the websites based on the conversion rate or where we see more conversion.   So example:  website   viewer   buyer abc.com   1000     10 xyz.com   10       2 def.com   200      1   How do I rank the websites so that I know the top websites are the ones which have higher conversion rates.   Conversion is buyer/viewer


VirtualBox not starting after kernel upgrade

Yesterday I received a kernel upgrade and after reboot, VirtualBox stopped working.  Here is my system info (after kernel upgrade):  matteo@workstation:~$ cat /etc/lsb-release  DISTRIB_ID=Ubuntu DISTRIB_RELEASE=16.04 DISTRIB_CODENAME=xenial DISTRIB_DESCRIPTION="Ubuntu 16.04.3 LTS" matteo@workstation:~$ uname -a Linux workstation 4.4.0-116-generic #140-Ubuntu SMP Mon Feb 12 21:23:04 UTC 2018 x86_64 x86_64 x86_64 GNU/Linux   I installed VirtualBox long ago with  sudo apt install linux-headers-$(uname -r) sudo apt install virtualbox-dkms virtualbox virtualbox-qt   used on daily basis and never had problems with kernel updates. The error I receive now is   matteo@workstation:~$ sudo modprobe vboxdrv modprobe: ERROR: could not insert 'vboxdrv': Exec format error matteo@workstation:~$ dmesg | tail -n 1 [ 1413.167311] vboxdrv: version magic '4.4.0-116-generic SMP mod_unload modversions ' should be '4.4.0-116-generic SMP mod_unload modversions retpoline '   I found a forum post with this error message  from three days ago, unfortunately without resolution. Therfore I tried to remove the VirtualBox packeges from the Ubuntu repo, and install the latest 5.2 using . However, even after rebooting the machine, the error remains.  What can I do in this case?


Do immature fruits perform photosynthesis?

Most immature fruits are green: peppers, pine cones, plums, lots of them. I want to know if the green is from chlorophyll in the cells. Do the fruit cells perform photosynthesis? When you cover a green stem or leaf, it will turn pale and stretch. That is because the stems have little need for chlorophyll in the dark, which is why they are pale. They stretch because the auxins in the stems are not destroyed by the photons, and the stems stretch out and topple over. If a green fruit is covered, will it turn pale and stretch like that?


jQuery event run increasing on each event click

I have the below HTML and jquery snippet, the new rows are added correctly and the the rows are deleted when clicked on which is expected but for the .delete_row click it isn't calculated the row count correctly after a row is deleted.  So say I have added 3 custom rows, I click to delete one row, it will delete and a alert box will display, if I click to delete a second row the process will alert twice and when I click to delete the third row the alert will pop up 3 times.  A single alert should only ever display when one row is removed but it's like the delete a row is incrementing by one on each run, cant see why though!?    $("#add_row").on("click", function(e) {   e.preventDefault();    var row_num = $(this).data("id");   var row_limit = 50;   var code_snippet = '

' + row_num + '

';    if (row_num <= row_limit) {     $("#count").val(row_num);      $(code_snippet).insertBefore("#base");      row_num += 1;      $(this).data("id", row_num);   }    if (row_num >= row_limit) {     // Disable button once limit reached     $(this).attr("disabled", true).addClass("disabled");   }    $(".delete_row").on("click", function(e) {     $(this).parent().parent(".row").remove();      alert("Deleted Row");      $("#add__row").data("id", ($("#add__row").data("id") - 1));   }); });  <fieldset>

Header Title

       <input type="hidden" name="count" id="count" value="0" />       <button id="add_row" data-id="1">Add New Row</button>

 </fieldset>


Any Way To Find An iPhone That Isn't Signed Into iCloud?

I lost my iPhone 6s that isn't signed into iCloud. So, in turn, I can't use 'find my iPhone' or call the iPhone, because I haven't yet assigned a phone number to it. I did sign into the phone, though. Just not iCloud. Is there any way to find my 6s?


How can I profile a multithread program in Python?

I'm developing an inherently multithreaded module in Python, and I'd like to find out where it's spending its time. cProfile only seems to profile the main thread. Is there any way of profiling all threads involved in the calculation?


Is there a semantic (code) behind the color of review-queue-indicator in the top-bar

Until yesterday the review queue indicator was always orange like:    But yesterday it was dark red (unfortunately no screenshot).  Is there color-code (semantic behind the color not CSS/HTML stuff) for the indicator?


Why the prediction of neural network doesn't change?

I've created two neural networks for a prediction purposes, the first is a network with one hidden layer and the second is two hidden layers, I use the cross validation techniques,  the training error for both networks is around 2E-4 but at the test step, for the two topologies, the prediction values do not change over the time, (just a small change in a fraction of 5).  I've tried different functions for the hidden layers (between tangh and sigmoid) and a sigmoid for the output layer.  So, where is the problem?  Thanks.


The commutative law of multiplication states that:     If '$a$' and '$b$' are any whole numbers,   then   '$a · b = b · a$'.   I've been looking for why multiplication has this property and how is saying that 3 times 4  the same thing as saying  4 times 3. I've found two interpretations:   $3 \cdot 4 = 12$ and $4 \cdot 3 = 12$  so, $3 \cdot 4 = 4 \cdot 3$, Think of $3\times 4$ as the area of a rectangle with width $4$ and height $3$.  If you rotate the rectangle by $90^\circ$, the area is unchanged, but now the width is $3$, and the height is $4$.  So, $3\times4 =$ area of rectangle = area of rotated rectangle $= 4\times3$.   These explanations don't seem to show why multiplication has this property but are showing us a way to make it intuitive and, thus, accept it as common sense.  Is there a better way to show that multiplication is fundamentally commutative?


How to force break a line to new page in longtable?

I am using longtable and I'd like to force add a line break so that the row starting with Others & Figuring out what one is good at.... can be on page 96 in the screenshot below.    I have searched on StackExchange for answers including , , and . But none of them worked or are relevant to solve what I'd like to do.  Thank you in advanced for your answers!


Why can't this truck lift Mjolnir but a Helicarrier can?

Stan Lee said     Whosoever holds this hammer, if he be worthy, shall possess the power of Thor.                                    Why this truck can't lift Mjolnir ? But                                  The Helicarrier is in flight and it is lifting Mjolnir.                                  (Thor hangs his hammer on coat rack)  I don't understand. Why is this different? Isn't this truck worthy enough?


I get a new elastic IP, I attach it to an instance, but it doesn't work? I can't ping the IP from my local computer either? Am I missing something here?   How do I use Amazon Elastic IP? When is a new IP assign to an instance? When I turn it off and reboot?


Showing that Lie($U(n)$)=$\mathfrak{u}(n)$  What is the dimension of $U(n)$ and $\mathfrak{u}(n)$? Is it true that $\dim(U(n))=\dim(\mathfrak{u}(n))$?  If the above is true, to prove that Lie($U(n)$)=$\mathfrak{u}(n)$, it is sufficient to prove that if $X\in T_e(U(n))$ then $X\in\mathfrak{u}(n)$. For this, if $X\in T_e(U(n))$ then $X=\dot{\gamma}(0)$ for some $\gamma:I\to U(n)$, then as $\gamma(t)\in U(n)$ for all $t\in I$, it is true that $\gamma(t)\gamma(t)^*=Id$ and thus $0=\frac{d}{dt}|_{t=0}\gamma(t)\gamma(t)^*$, but I would like to use that $\frac{d}{dt}|_{t=0}\gamma(t)\gamma(t)^*=\frac{d}{dt}|_{t=0}\gamma(t)+\frac{d}{dt}|_{t=0}\gamma(t)^*$, why is this true? If the latter is true, we would have to $0=\frac{d}{dt}|_{t=0}\gamma(t)\gamma(t)^*=\frac{d}{dt}|_{t=0}\gamma(t)+\frac{d}{dt}|_{t=0}\gamma(t)^*=X+X^*$ and thus $X\in\mathfrak{u}(n)$, whereby Lie($U(n)$)=$\mathfrak{u}(n)$.


Where are some places to get reference images for modeling?

I'm a newbie.  I've gone through a number of tutorials and want to get some actual experience with modeling. But, I don't know where to go to get good reference images for modeling with front/sides views.  Can anyone recommend the best places to find such images?


Nexus 6 defaults to Call screen upon unlock

Is the Nexus 6 supposed to default to the Call screen every time I unlock my phone? I get tired of unlocking my phone, and hitting the Home button every time. I want to unlock my phone and get the Home screen....anybody got any ideas?


In Naruto, some animals can talk, like the toads of Mount Myōboku, Kakashi's ninja dogs, Manda, and Katsuyu. Some of them have ever used hand signs.  Yet Akamaru can't even talk. Is the ability to talk given to certain animals at random, or can they all talk when they have enough chakra or do they just simply have to learn how?


Accessing a controller from inside a callback function in AngularJS

I have the following AngularJS controller:  controllers.controller('QueuesCtrl', ['$scope', 'QueueRes',function($scope,QueueRes) {      $scope.queues = QueueRes.query();     this.queue={};      this.create = function() {         QueueRes.save(this.queue,function(){             this.queue={};         })      };    }]);   The object this.queue is a form, that I want to reset after I successfully POST the data.  The this.queue={}; inside of the callback function doesn't work (which makes sense since this is different in that context).  If I move this.queue={}; to outside of the callback, my code works, but resets the password regardless of the outcome of the POST operation, which is not what I desire.  How can I access the controller from inside the callback ?


I had a Chase MileagePlus Explorer card, which I cancelled due to numerous issues with United.  I called up and told them I wanted to cancel the card.  They confirmed, and that was that.  However, I can still log on to the website.  I can still see that I have a "$0.00 balance".  Did they really cancel (i.e. do they have a legal obligation to, and one they usually follow), or should I double-check?


adding additional class to get the post thumbnail

I'm just starting to create new theme and i'm new to code. I'm stuck in customizing the post thumbnail code, i tried add   <?php previous_post_link(get_the_post_thumbnail(get_previous_post(), array(                         'class' =>  'rounded-lg object-cover'            )) . '
%link
',            '%title',false    ); ?>   but it doesn't seem to work. did my array mistakenly placed in the code?


Why did the Empire discontinue the clone trooper program?

I understand why the Empire would want to start using more than one genetic template to create clone troopers, but why did it start using non-clone troopers instead of just continuing the cloning program?  It seems that with cloning they were able to use a training program (and genetic manipulation) that gave them completely loyalty (other than when the Kaminoan rebellion, where the Kaminoans had sabotaged the training programs).  Why stop using such troops and start using people that might question orders or aren't as easily controlled as clones were?


using umask to set default file settings

I am setting default umask of linux box for the first time.  I log in as root user on a Centos 6 server. I want these default values:  owner:  read/execute/write (7) group:  read/execute (5) other:  read (4)   To get umask value, I deduct targets from 777: 777-754 = 023  # umask 023   then do a double check  # umask -S   u=rwx,g=rx,o=r   then create and display file permissions  # echo x > testfile.txt # ll | grep testfile.txt   -rw-r--r--.  1 root   root           4 Jun 26 01:15 testfile.txt   which is not quite what I was expecting.


Is it possible to get LaTeX to write "\" out

I need to write a backslach but LaTeX always wants a command after . Any ideas?


If $C_0, C_1, C_2,..., C_n$ denote the binomial cofficients in the expansion of $(1+x)^n$ then find $$C_{0}^2+2C_{1}^2 + 3C_{2}^2  +\dots+ (n+1)C_{n}^2.$$


Is there a way to vary the thickness and color of lines created by just edges and vertices? I realize that a face can be defined and then color and material applied, but is there any way to apply a color to the edges?


Are the highlighted past participles acting as adjectives or passive voice in these examples?

The park was covered with snow.      Mr. Smith is known to everyone in this town.      The legislator participates in the delegation and is involved in sweeping reforms.      English is spoken in the UK.    In these sentences, are the highlighted past participles acting as adjectives or passive voice?


straight into windoes while dual booted with ubuntu

I am dual booting a computer to build android but it is a family computer and my mother wants it so that it boots straight to Ubuntu so she doesn't have to choose Ubuntu or windows. Is there a way to set it where it boots straight to windows and if I want to boot into Ubuntu I mash a button that takes me to a menu? If so help would be appreciated. Thanks everyone!


Are Harry Potter and Ginny Weasley Distant Relatives?

Below is a picture of the Black Family Tree, based on a .     Please note the unions of:   Dorea Black and Charlus Potter  Lucretia Black and Ignatius Prewett (Molly's maiden name) Cedrella Black and Septimus Weasley (#4 removed from the tree)    To add, here is a quote from Sirius Black:      The pure-blood families are all interrelated. If you're only going to let your sons and daughters marry pure-bloods your choice is very limited; there are hardly any of us left. Molly and I are cousins by marriage and Arthur's something like my second cousin once removed. But there's no point looking for them on here - if ever a family was a bunch of blood traitors it's the Weasleys.   Not only would this mean Molly and Arthur are distantly related by marriage, it would also mean Harry and Ginny are distantly related if Charlus Potter is indeed of the same Potter ancestry as Harry. And the  on the Potter family tree isn't helpful. Is there any proof that he is/ isn't?


How can I show the contact number of the Dialed contact

I want the contact number to appear on the dialling screen when initiating call that if contact has more than one number I want to know which number I had dialled.


Windows Server 2012 & Exchange Server 2013 CAL's

Trying to build an Exchange server solution for a company and they want me to look into licensing for Windows. I'm going to be purchasing the necessary server licenses for Windows Server 2012 Standard and Microsoft Exchange 2013 Enterprise. I just have a few questions about the CAL's thing which seems like a complete ripoff to me. How are CAL's tracked for both Windows Server and Exchange? Is it tied to Active Directory profiles? What happens if I dont have the necessary CAL's for Windows Server? Will a client be denied access from Active Directory? Is there any enforcement for this? Also the same question for Exchange 2013 CAL's  Thanks


How do I not auto-select auto-suggestions in the address bar of Chrome?

I like to see auto suggestions when I'm typing in the address bar, but I hate it when chrome auto-selects one of those as I'm typing.  For example, let's say I search for   vanilla ice cream with sprinkles[Enter]   (where I hit the Enter key at the end there).  Then, a minute later, I just want to search for  vanilla ice cream[Enter]   because I just remembered I hate sprinkles.  Chrome auto suggests my previous search, which includes with sprinkles, and when I hit Enter, it just goes to that search.  But I didn't want the sprinkles!  [I'm using the current version of chrome on the current version of OS X.]  Can I disable that "feature" without disabling the suggestions themselves?


I want to install python-xml package on ubuntu.  I see this command for installing it:  sudo apt-get install python-xml   but  $ sudo apt-get install python-xmlReading package lists... Done Building dependency tree        Reading state information... Done E: Unable to locate package python-xml   Should I add repository to fix it?


Gravity in the center of a hollow neutron star

Imagine a hollow 100 metre diameter (for example) sphere made of incredible dense material (ie neutron star dust etc) but is self supporting (ie the central cavity).  Assuming that the sphere skin is reletively thick so that the whole object is exceptionally heavy (eg the mass of planet earth.   What would someone who was stationed dead center of the sphere feel? IE would they be crushed by the potential gravity or ripped apart and smeared on the inside other sphere cavity (due to the gravity of the surrounding material?


Is there L'Hospital's rule for analytic functions of complex variable?  If yes where can I find it, in what books, and how to prove it?


What causes 5 pink bars on 27" iMac (2011)?

I've got a 27 inch iMac made in 2011 that displays 5 pink vertical bars on the screen. It won't boot properly. I ran the Apple Hardware Test and it came up clean.   Machine Specs:  Apple Subfamily:    Mid-2011  Apple Model No: A1312 (EMC 2429) Model ID:   iMac12,2


My tags are follows:  \documentclass{book}  \usepackage{showframe}  \usepackage{gb4e,qtree,skull}   \begin{document}  \begin{exe} \ex\emph{Superiority-obeying and Superiority-violating multiple \emph{wh}-questions} \begin{xlist} \ex {\textit{Which} student read \textit{which} book? } \ex {{\em Which} book did {\em which} student read ?} \end{xlist} \end{exe}  \end{document}   and the output came as:   How can I get the entries starts from the left margin, please advise...


In my integration adventures, I came across this sum which I could not simplify:  $$\sum_{n=1}^{\infty}\frac{(-1)^{n}\log(2n+1)}{2n+1}$$   seems to believe the sum diverges and is not of much help here.  Does a closed form for this sum exist?  If not, can this sum be transformed nicely that has faster convergence?


Show that two complex nilpotent matrices are similar

We consider he following proposition. Two $n\times n$ complex nilpotent matrices are similar if and only if they have same nilpotence index. How do I show that the statement is correct for  $n=3$ ? And why isn't it correct for $n=4$?


How do I prove that there is way that at least $2$ people will sit in front of their own name card?

Fifteen people are sitting at a round table. There are 15 name cards on the table, but no one is sitting in front of their own name card. Show that you can rotate the table in such a way that at least two persons will sit in front of their own name card. How do I show this?   I know that you have to use the pigeonhole-principle, but I can't seem to understand in which way I can use this principle in this case.


Error while trying to remove a ppa (with ppa-purge) which itself throws an error

I tried to add a ppa to control the heat issues of Ubuntu 20.04 but it threw an error. So I then tried to remove it, which again throws the same error. $ sudo ppa-purge ppa:webupd8team/unstable Updating packages lists E: The repository 'http://ppa.launchpad.net/webupd8team/unstable/ubuntu focal Release' does not have a Release file. Warning:  apt-get update failed for some reason  How do I get rid of it?


How can write a shell script that sends an email?

How do you write a shell script that sends an email memo to all employees when a particular process is launched?