I am unable to find xpath for the below success message:  WebElement successOverlayMsg = findElement(By.xpath("//*[text()='A new app overlay \"APAutomation_Merchant_M32XphDFc\" has been created successfully']")); if (successOverlayMsg.getText().equals("A new app overlay 'APAutomation_Merchant_MUjL7PDwO' has been created successfully"))


How do you create optional arguments in php?

In the PHP manual, to show the syntax for functions with optional parameters, they use brackets around each set of dependent optional parameter. For example, for the  function, the manual reads:  string date ( string $format [, int $timestamp = time() ] )   Where $timestamp is an optional parameter, and when left blank it defaults to the  function's return value.  How do you go about creating optional parameters like this when defining a custom function in PHP?


Can the sum of finitely many inverses of distinct odd integers $\geq 3$ be 1?

Is there a positive number $n$ of distinct odd integers $z_1,z_2, \ldots, z_n \geq 3$ such that $\frac{1}{z_1} + \frac{1}{z_2} + \cdots + \frac{1}{z_n} = 1$?


Can someone tell me why my code finishes running too early?

This is for a class and I can't figure out why my code stops running after the first question. It will ask the user the first question, allow user input then say that the operation is complete. What am I doing wrong? Thanks.      import java.util.Scanner;     public class TemperatureConverter {  public static void main(String[] args) {     //Create scanner object       Scanner keyboard = new Scanner(System.in);     //Declare variables       double temperature;       double temp;       String temperatureScale;     //Use scanner to ask for user input       System.out.println("What is the temperature?");       temperature = keyboard.nextDouble();     //Use scanner to ask for user input       System.out.println("Is the temperature Celsius or Fahrenheit?");       temperatureScale = keyboard.nextLine();     //If statement        if (temperatureScale == "Fahrenheit"){          temp = temperature - 32 * 5/9;          System.out.println("The result is " + temp + "degrees Celsius.");          }        else if (temperatureScale == "Celsius"){          temp = temperature * 1.8 + 32.0;          System.out.println("The result is " + temp + "degrees           Fahrenheit.");          }        else{           System.out.println("An incorrect value was input.");          }       } }


Ajax pager of views does not work when using in quicktabs

I have 2 views that are using pagers since they display lists of articles. Each view is within a tab of a quicktab. The views are set to use AJAX.   Right now, I am able to move between the pages of the first view which is inside the first tab. The problem is when I move to the second tab and I try to use the pager to move through the pages. No matter what page I choose (in the second tab) the page redirects me to the first tab and the second page.   Also, I´ve set both pagers ID to a different number but the problem has remained the same.  This is where it points the second page of the second tab: localhost/drupal/live-healthier?page=1&js=true  To summarize, how can I use 2 views inside quicktabs with ajax pagers?  Thank you for your help !


This is Ahlfors q. 1, p. 227. Prove that in any region the family of analytic functions with positive real part is normal. Under what added condition is it locally bounded? Hint: Consider $e^{-f}$. Well I proved that $e^{-f}$ is normal, but I don't know what to do next, moreover If I am right normality implies locally boundeness in the analytic case,I'm trying to figure out why asked that question...


From the books and the movie, we know that a Patronus charm will push a Dementor away. But is it possible for a wizard to actually destroy a Dementor?


How do I list installed software with the installed size?

I would like to have a list of the installed software on my machine, with the disk space consumed by them alongside. I would prefer to be able to order by largest/smallest, but that is not a necessity.  I am the sort of person who will install software to try it, and never clean up after myself.  As a result, my 7GB (Windows and my Data are on separate partitions, as well as a swap area) Ubuntu 11.04 partition is suffering, and has started regularly showing warning messages.


How to get R to deal with a 0 value in your dependent variable when you want to log your distribution

I have a heavily positive distribution in my dataset of my x variable, the aim to put the variable into 4 categories of categorical variable. Although, my initial idea is to log the continuous data then split it into categories. However, lots of values of the dependent variable are 0 which then would require a constant in the log transformation. Is it appropriate to just split a positive skewed dataset into a categorical variable rather than transforming the data first. Regards, Otis


One of the necessary documents for a Schengen visa for non EU citizens is proof of your flights, but it doesn't state the actual (e-)tickets (for which I already paid), or the reservation of flights.  So my question is, which option would be more acceptable (if I can provide any of them) to provide printed tickets to an EU member embassy or reservation of flights (reservation does not expect payment)?


How to generate predicted survivor curves from frailty models (using R coxph)?

I want to compute predicted survivor function for a Cox proportional hazards model with frailty terms [using survival package]. It appears that when frailty terms are in the model, the predicted survivor function cannot be computed.  ## Example  require(survival) data(rats)  ## Create fake weight set.seed(90989) rats$weight<-runif(nrow(rats),0.2,0.9)  ## Cox model with gamma frailty on litter fit <- coxph(Surv(time, status) ~ rx+weight+frailty(litter,dist="gamma"), data = rats)   ## Compute survival curve from the cox model for rx=0 and weight=0.5 kg plot(survfit(fit, newdata=data.frame(rx=0,weight=0.5)),xlab = "time", ylab="Survival")   ## Running this line, I get following error message: Error in survfit.coxph(fit, newdata = data.frame(rx = 0, weight = 0.5)) :  Newdata cannot be used when a model has sparse frailty terms   I tried using both sparse and non-sparse computation methods by using sparse=TRUE, Sparse =FALSE, sparse =0, sparse=5 options. However, none worked.  How do I compute predicted survivor curve based on my frailty model?


I'm employed and will attend a conference in the UK but I can't figure out what kind of visa I should be applying for. In the gov.uk website its written I should be applying for a standard visitor visa, but in my application I don't have the option to pick a standard visitor visa.  What appears in my application is type visit and in subtype I have to choose  between business tourism or business academic etc .I work in a university. Should I pick business academic?


How to do a CONCAT on a GROUP BY in SQL Server?

How can I do a concatenation of comma separated course IDs that for each student?  select student.ID,   concat(student_course.COURSE_ID,',')    from student.ID join student_course on student.ID=student_course.STUDENT_ID group by student.ID  Student Id  |  Course Id 1           |  101, 230, 432 2           |  293, 101


Mathematician A asks Mathematician B to guess the age of his three sons. Mathematician A starts off by giving Mathematician B two clues. The two clues are:   The product of their ages is 72. When you add the ages of the sons, it will be the same as the number of apples on his his apple tree.   After these two clues, Mathematician B  claims that it is impossible to find the ages. And so, Mathematician A gives yet one more clue.   The eldest son loves to play basketball.   After this clue, Mathematician B claims that he has found the ages of the sons.  How old are Mathematician A's sons?


"man coproc" report error but "help coproc" works (where to find documentation for certain commands?)

I learned that from an instruction:     Co-processing does two things at the same time. It spawns a subshell in background mode and executes a command within that subshell.   [root@iz2ze9wve43n2nyuvmsfx5z ~]# coproc ( sleep 10; sleep 2 ) [1] 32508 [root@iz2ze9wve43n2nyuvmsfx5z ~]# jobs [1]+  Running                 coproc COPROC ( sleep 10; sleep 2 ) &   When I refer to its manual, get an error as feedback  root@iz2ze9wve43n2nyuvmsfx5z ~]# man coproc No manual entry for coproc [root@iz2ze9wve43n2nyuvmsfx5z ~]# coproc --info [1] 32579 [root@iz2ze9wve43n2nyuvmsfx5z ~]# bash: line 25: --info: command not found  [1]+  Exit 127                coproc COPROC --info   help works  [root@iz2ze9wve43n2nyuvmsfx5z ~]# help coproc coproc: coproc [NAME] command [redirections]     Create a coprocess named NAME.      Execute COMMAND asynchronously, with the standard output and standard     input of the command connected via a pipe to file descriptors assigned     to indices 0 and 1 of an array variable NAME in the executing shell.     The default NAME is "COPROC".      Exit Status:     Returns the exit status of COMMAND.   This's very confusing, How could I have a big picture of the commands on which manuals I can reach to? How to distinguish them?


I want to have something like this: {'a': 43, 'b': 44}  with this list: [{'a': 43}, {'b': 44}]  Is there a way not to use a variable?


Is XOR adequate for encrypting truly random data?

It is well-known that the two-time pad is very insecure.  However, it seems unexploitable in the case where the plaintext is indistinguishable from random (ex. symmetric keys).  Is this property useful?  Note: I don't plan on using this in production.


Should I reject edits with disturbingly incorrect and/or confusing edit comment? (summary)

Sometimes I get an edit to review that has comment which has nothing to do with the edit. Such as a retag edit commented as fixed grammar or improved formatting. These comments confuse me a lot and make me think the user did something else then he intended to do or thought he was doing. Yet I would accept the edit without hesitation if it wasn't for the comment.


Story about a sentient star system, in a 50s or early 60s anthology

Story about a sentient star system, possibly in f&sf anthology from 50s or early 60s. I know this is a long shot, but I hope someone will know of this story.  I believe it was called "Darkness or into the darkness". End of the story had it spinning off a galaxy, (possibly ours?).


Can two photons form a gravitational bound state?

I've always wondered if it's possible to bind two photons, in particular by gravitational interaction. Photons don't have a rest mass, but do nevertheless have a gravitational mass, by which they can attract each other. However, I can't imagine a bound state. My intuition of special relativity goes against it. Is it possible at all? Can photons at least bend each other's trajectories?  Interactions of other kinds (non gravitational) are also an acceptable answer, but I'm not interested in (if they exist) effective interactions in matter.


ConcurrentModificationException with 2 Iterators and one ArrayList

I have a quick question that involves one ArrayList, 2 Iterators, and some nested for loops. Im trying to make a bit of a gravity engine using multiple gravity wells pulling on each other and moving around. To do this, Iv made an ArrayList of these gravity wells, all randomly places on the screen with a random size. Here it is for reference.  for(int i = 0; i < amount; i++){ // makes all        int mass = rand.nextInt(45,65);       int locX = rand.nextInt(50, getWidth()-100);       int locY = rand.nextInt(50, getHeight()-100);       Color cColor = rand.nextColor();        if(mass%8==0){         mass = rand.nextInt(25,35);       }       else if(mass%7==0){         mass = rand.nextInt(75,85);       }         Body body = new Body((double)locX,(double)locY,mass);       body.setFilled(true);       body.setColor(Color.WHITE);       body.setFillColor(cColor);       add(body);       bodys.add(body);     }   bodys is the name of the ArrayList containing everything. So my real problem comes to the Iterators. Heres the code thats giving me trouble:    public void move(){     Iterator<Body> eIter = bodys.iterator();     while(eIter.hasNext()){ // finding the thing we edit       Body edit = eIter.next();        int addX = 0, addY = 0;       int totalX = 0, totalY = 0;       double ex = edit.getX(), ey = edit.getY();       double eMass = edit.getMass(), eSize = edit.getHeight();       double eMoveX = edit.getMoveX(), eMoveY = edit.getMoveY();       int placeInArrayEdit = bodys.indexOf(edit);        Iterator<Body> fIter = bodys.iterator();        while(fIter.hasNext()){ // iterating through the force pulling the edit body         Body force = fIter.next(); /// ConcurrentModificationException is thrown         int placeInArrayForce = bodys.indexOf(force);          if(placeInArrayForce != placeInArrayEdit){ // making sure the 2 bodys arent the same            double fx = force.getX(), fy = force.getY();           double fMass = force.getMass();           double fMoveX = force.getMoveX(), fMoveY = force.getMoveY();             double difX = (ex-fx);           double difY = (ey-fy);            double distX = distanceP(ex, fx);           double distY = distanceP(ey, fy);            double vecX = (difX/distX);           double vecY = (difY/distY);            if(distance(fx,ex,fy,ey) <= eSize/3){ // if they are colliding             if(eMass >= fMass){               remove(edit);               edit.addMass((int)(fMass));               eIter.remove(); // problem             }             if(eMass < fMass){               remove(force);               force.addMass((int)(eMass));               fIter.remove();             }           }            double grav = (eMass/fMass);           grav -= (grav*.50);            addX -= (vecX/grav)/2; // this determines movement which means i           addY -= (vecY/grav)/2; // need to edit this with fMass         }         edit.setVelX(addX/(eMass + (eMass*.75)));         edit.setVelY(addY/(eMass + (eMass*.75)));          edit.addMoveX(edit.getVelX());         edit.addMoveY(edit.getVelY());          edit.move(edit.getMoveX(),edit.getMoveY());       }     }   }   The code above is moving the gravity wells and testing for collision. The problem is that ConcurrentModificationException is thrown where iv commented it to be thrown.   Iv spent about an hour or so looking around for a solution and nothing iv tried has worked. The code works up until the wells actually hit each other, then the error is thrown. Is there a way to avoid this error while still testing for collision like this, or is my code just too broken?  Thanks for all the help! Please let me know if you need anything clarified as this is my first question on StackOverflow


\begin{figure}[h] \centering \label{fig:serviceworker} \includegraphics[width=\textwidth]{img/sw} \caption{Service workers en HTTP Requests} \end{figure}  In Figuur \ref{fig:serviceworker} wordt er getoond hoe de service worker als een brug functioneert tussen de website en de server waar de applicatie zijn data van haalt. Op deze manier kan de service worker toch nog informatie teruggeven aan de website als de verbinding met de server niet kan gemaakt worden. Dit zorgt er dus voor dat je de applicatie kan blijven gebruiken bij  geen of een slechte internetconnectie.   The problem is that the figure has number 3.1. But when I try to reference it in the text it shows as (Figure 3.2). What am I doing wrong here?


Let $V$ be a vector space with inner product. If $W$ is a closed subspace of $V$ we always have $W\subseteq W^{\perp\perp}$. Now, I found a proof where the equality holds if $V$ is Hilbert. It is an easy consequence of $V=W\oplus W^{\perp}$. So my question is if this is not true if $V$ is not Hilbert. Does anyone know a counterexample?  Thank you.  Edit: Oh, sorry if I didn't clarify. I'm still suppossing $W$ is closed.


Induction on inequalities: $\frac1{1^2}+\frac1{2^2}+\frac1{3^2}+\ldots+\frac1{n^2}<2$

I am trying to solve this inequality by induction. I just started to learn induction this week and all the inequalities we had been solved were like an equation less than another equation (e.g. $n! \geq 2^n$) So I am confused how to prove an inequality that is less than a particular value like the following problem? Thanks in advance.     $$\frac1{1^2}+\frac1{2^2}+\frac1{3^2}+\ldots+\frac1{n^2}<2$$


Why wont this equation split using \begin{align} and \end{align}

I have this equation here and I am trying to split it up.  I use the \begin{align} and \end{align} commands and I use \\ where I want the equation to split onto the next line.   Here is the code  \begin{align}         \mathcal{H}_{q1} \mathcal{H}_{q2} \mathcal{H}_{q3}...\mathcal{H}_{qn}0 \\         =\frac{1}{2}H_{q1}\{\mathcal{H}_{q2}\mathcal{H}_{q3}...\mathcal{H}_{qn}0\} \\         +\frac{1}{2} h_{q1}\} \\          =\frac{1}{2}H_{q1}\{\frac{1}{2} H_{q2}[\mathcal{H}_{q3}...\mathcal{H}_{qn} 0]+\frac{1}{2}h_{q2}\} +\frac{1}{2}h_{q1} \\          =  \frac{1}{2}H_{q1} \frac{1}{2} H_{q2} \\ [\frac{1}{2}H_{q3}(\mathcal{H}_{q4}..\mathcal{H}_{qn}0)+\frac{1}{2}h_{q3}]+          \frac{1}{2}h_{q2}+\frac{1}{2}h_{q1}.. \\          =(\frac{1}{2^n})H_{q1}H_{q2}H_{q3}..H_{qn}0+   \\ (\frac{1}{2^n})H_{q1}H_{q2}H_{q3}..H_{qn-1}h_{q1}+(\frac{1}{2^n})H_{q1}H_{q2}H_{q3}..H_{qn-2}h_{qn-1}+.. +          (\frac{1}{2})h_{q1}=\sum^n_{j=1} (\frac{1}{2^j}) H_{qo}H_{q1} H_{q2}H_{q3}..H_{qj-1} h_{qj}         \end{align}   I try and compile this but nothing is outputted in place of this equation, just a blank space.      What can I do?


Intuitive explanation of the tower property of conditional expectation

I understand how to define conditional expectation and how to prove that it exists.  Further, I think I understand what conditional expectation means intuitively. I can also prove the tower property, that is if $X$ and $Y$ are random variables (or $Y$ a $\sigma$-field) then we have that  $$\mathbb E[X] = \mathbb{E}[\mathbb E [X | Y]].$$  My question is: What is the intuitive meaning of this? It seems quite puzzling to me.  (I could find similar questions but not this one.)


How to add an extra speaker to my existing audio system?

I have windows 10 running on my laptop. I have connected stereo speakers to it via the existing 3.5 mm audio jack.  I want to connect one more speaker via Bluetooth and want to play the same content on all of the speakers simultaneously or if that is impossible I would be equally satisfied even if I am able to play some different content in the Bluetooth speakers via my laptop and different content on stereo speakers simultaneously.  Now how do I do this? Without extra hardware.  Highly appreciate your help!


If matrices $A$ and $B$ are orthogonal then $A-B$ or $A+B$ are singular

If $A$ and $B$ are orthogonal matrices and they have same odd row, prove that one of matrices $A+B$ and $A-B$ are singular.  I have no idea, can you help me? I tried with $\det(A+B)(A-B)=\det(A^2-AB+BA-B^2)$, but I do not get anything.


SSMS Error when creating database "Method not found .. StringCollection"

I'm using SQL Server Management Studio 2016. When I try to create a local database by right clicking on Databases and selecting "New Database" I get the following error:    I've tried restarting SSMS and the machine.  I can create the database through SQL, however I get the same error when trying to launch any GUI dialogs for the database. So creating it thru SQL doesn't work around my issue as I need to configure it also (and I don't want to write scripts for everything).


Is commitment necessary to participate in beta (as of June 2015)?

There's this proposal for a new S.E. site which is about to enter the beta phase. It reads  This proposal is in: Commitment A successful site needs people to commit to use it. This proposal is 100% complete. Committed users will be invited to the private beta soon.  I'd like to participate in the beta but I don't want to commit (due to a full name being required). Will I be unable to participate in the beta if I don't commit?


$5-$Sylow subgroup of $GL_3(\mathbb{F}_5)$?

Give  example of a $5-$Sylow subgroup of $GL_3(\mathbb{F}_5)$ ?  My attempt : $5-$Sylow subgroup of $GL_3(\mathbb{F}_5)= 5^{3(3-1)/2}=125$


How can I fix the gray wifi icon? It will not slide to turn on wifi, it's been happening since the new ios7 update


I'm looking for a good indicators to tell a user something is draggable, and to some extent, to tell the user (once they are dragging), that they can drop something "here".  What have you used as indicators for these action? I'm looking for a little more than "make the cursor="move" when they mouse over it. I'm also thinking more along the lines of persistent, not things that only show on mouse over. In a sense the indicator must be strong yet subtle.  Thoughts?


all functions that uphold $f'(x)=f(1/x)$

Find all functions $y:\mathbb{R}\to\mathbb{R}$ such that  $$y'(x)=y\Big(\frac{1}{x}\Big)$$ we can differentiate both sides to get a homogenous second order Euler equation $$y''(x)=-\frac{1}{x^2}y'\Big(\frac{1}{x}\Big)=-\frac{1}{x^2}y(x)\implies x^2y''+y=0$$ which is doable.   My question is, am I missing something? From a short glance at WA it doesn't seem that all of the solutions of the Euler equation uphold the required criteria.


The question is simple. I would like to implement the Gamma function in my calculator written in C; however, I have not been able to find an easy way to programmatically compute an approximation to arbitrary precision.  Is there a good algorithm to compute approximations of the Gamma function?  Thanks!


def hbond(system, donors, acceptors):     for frame in system.frames:         result = len(frame.molecules)*[[0]*len(frame.molecules)]         for i, mol1 in enumerate(frame.molecules):             for j, mol2 in enumerate(frame.molecules):                 if i != j:                      result[i][j] = isDonor(                           mol1, mol2, donors, acceptors, frame.cell[0]                     ) #Problem with this assignment            yield result   Hello I am having difficulties with this fragment of code. isDonor() is a function which returns either 0 or 1 The problem is that this function always returns result as a list with every element equal to 0 whatever the initialized list is. Its like all the elements of the list are assigned to the last return value of isDonor function. If however change the code to this:                      result[i][j] += isDonor(                           mol1, mol2, donors, acceptors, frame.cell[0]                     )    I will get the correct results since the initialized list elements are 0.  Am I missing something about scope in Python ?


I am getting the same error for whatever I am trying to install. How to fix this unmet dependency and broken package ?

I am currently trying to install wine and previously have failed to install VLC on Ubuntu 17.10. I have tried almost all the solutions available on other forums.  $ sudo apt-get install vlc     Reading package lists... Done     Building dependency tree            Reading state information... Done     You might want to run 'apt --fix-broken install' to correct these.     The following packages have unmet dependencies:      libvlc5 : Depends: libvlccore9 (>= 4.0.0~rc1~~git20180102+r73456+113~ubuntu17.10.1~) but it is not going to be installed      vlc : Depends: vlc-bin (= 4.0.0~rc1~~git20180123+r73755+120~ubuntu17.10.1) but it is not going to be installed            Depends: vlc-plugin-base (= 4.0.0~rc1~~git20180123+r73755+120~ubuntu17.10.1) but 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1 is to be installed            Depends: vlc-plugin-qt (= 4.0.0~rc1~~git20180123+r73755+120~ubuntu17.10.1) but 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1 is to be installed            Depends: vlc-plugin-video-output (= 4.0.0~rc1~~git20180123+r73755+120~ubuntu17.10.1) but 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1 is to be installed            Recommends: vlc-l10n (= 4.0.0~rc1~~git20180123+r73755+120~ubuntu17.10.1) but 4.0.0~rc1~~git20180102+r73456+113~ubuntu17.10.1 is to be installed            Recommends: vlc-plugin-notify (= 4.0.0~rc1~~git20180123+r73755+120~ubuntu17.10.1) but 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1 is to be installed            Recommends: vlc-plugin-samba (= 4.0.0~rc1~~git20180123+r73755+120~ubuntu17.10.1) but 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1 is to be installed            Recommends: vlc-plugin-skins2 (= 4.0.0~rc1~~git20180123+r73755+120~ubuntu17.10.1) but 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1 is to be installed            Recommends: vlc-plugin-video-splitter (= 4.0.0~rc1~~git20180123+r73755+120~ubuntu17.10.1) but 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1 is to be installed            Recommends: vlc-plugin-visualization (= 4.0.0~rc1~~git20180123+r73755+120~ubuntu17.10.1) but 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1 is to be installed      vlc-plugin-base : Depends: libvlccore9 (>= 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1) but it is not going to be installed                        Depends: vlc-plugin-abi-4-0-0      vlc-plugin-notify : Depends: libvlccore9 (>= 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1) but it is not going to be installed                          Depends: vlc-plugin-abi-4-0-0      vlc-plugin-qt : Depends: libvlccore9 (>= 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1) but it is not going to be installed                      Depends: vlc-plugin-abi-4-0-0                      Recommends: vlc-bin but it is not going to be installed      vlc-plugin-samba : Depends: libvlccore9 (>= 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1) but it is not going to be installed                         Depends: vlc-plugin-abi-4-0-0      vlc-plugin-skins2 : Depends: libvlccore9 (>= 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1) but it is not going to be installed                          Depends: vlc-plugin-abi-4-0-0                          Recommends: vlc-bin but it is not going to be installed      vlc-plugin-video-output : Depends: libvlccore9 (>= 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1) but it is not going to be installed                                Depends: vlc-plugin-abi-4-0-0      vlc-plugin-video-splitter : Depends: libvlccore9 (>= 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1) but it is not going to be installed                                  Depends: vlc-plugin-abi-4-0-0      vlc-plugin-visualization : Depends: libvlccore9 (>= 4.0.0~rc1~~git20180122+r73743+120~ubuntu17.10.1) but it is not going to be installed                                 Depends: vlc-plugin-abi-4-0-0     E: Unmet dependencies. Try 'apt --fix-broken install' with no packages (or specify a solution).


ANOVA analysis with only mean and standard deviation

This is probably a silly question, but how can I run ANOVA using only the mean, standard deviation, and the sample size?  i.e.  Group  mean    sd    n  1:    200      5    5    2:    100     22    5  3:    150     14    5   I am using Statsoft Statistica software.  I know how to run it using the spreadsheet with all the data, but I have never done this using only the information listed above.  Any information would be greatly appreciated.


Questions about gravitational and inertial mass

What differences between  and ? I cannot tell the differences between them.  In history, which concept was put forward firstly?  Are there some experiments to prove they are identical?


How do you make an account for Pokemon Go


How to generate a 2D array data structure in tikz?

I need to illustrate a 2D array data structure in my document. This is a picture I found on the internet. I want something similar.    I also want to show the memory layout in the illustration. Something like this:   Can someone help me with drawing them in Tikz? Thanks in advance.  MWE  \documentclass{article} \usepackage[utf8]{inputenc} \usepackage{tikz} \usetikzlibrary{matrix,backgrounds}  \begin{document} \begin{tikzpicture}[font=\ttfamily, array/.style={matrix of nodes,nodes={draw, minimum size=7mm, fill=green!30},column sep=-\pgflinewidth, row sep=0.5mm, nodes in empty cells, row 1/.style={nodes={draw=none, fill=none, minimum size=5mm}}, row 1 column 1/.style={nodes={draw}}}]  \matrix[array] (array) { 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9\\   &   &   &   &   &   &   &   &   &  \\}; \node[draw, fill=gray, minimum size=4mm] at (array-2-9) (box) {};  \begin{scope}[on background layer] \fill[green!10] (array-1-1.north west) rectangle (array-1-10.south east); \end{scope}  \draw (array-1-1.north)--++(90:3mm) node [above] (first) {First index}; \draw (array-1-10.east)--++(0:3mm) node [right]{Indices}; \node [align=center, anchor=south] at (array-2-9.north west|-first.south) (8) {Element\\ (at index 8)}; \draw (8)--(box); % \end{tikzpicture} \\ \begin{tikzpicture}[font=\ttfamily, array/.style={matrix of nodes,nodes={draw, minimum size=7mm, fill=red!30},column sep=-\pgflinewidth, row sep=0.5mm, nodes in empty cells, row 1/.style={nodes={draw=none, fill=none, minimum size=5mm}}, row 1 column 1/.style={nodes={draw}}}]  \matrix[array] (array) {  &  &  &  &  &  &  &  &  & \\  &   &   &   &   &   &   &   &   &  \\}; % \end{tikzpicture} \\ \begin{tikzpicture}[font=\ttfamily, array/.style={matrix of nodes,nodes={draw, minimum size=7mm, fill=blue!30},column sep=-\pgflinewidth, row sep=0.5mm, nodes in empty cells, row 1/.style={nodes={draw=none, fill=none, minimum size=5mm}}, row 1 column 1/.style={nodes={draw}}}]  \matrix[array] (array) {  &  &  &  &  &  &  &  &  & \\  &   &   &   &   &   &   &   &   &  \\}; % \end{tikzpicture} \end{document}


Differences Between Row Echelon and Reduced Row Echelon

Let $$A =\begin{bmatrix} 1&3&-6&2\\5&12&-24&7\\9&15&-30&6\end{bmatrix}$$  $$RREF(A) =\begin{bmatrix} 1&0&0&-1\\0&1&-2&-1\\0&0&0&0\end{bmatrix}$$ $$REF(A) =\begin{bmatrix} 1&3&-6&2\\0&1&-2&1\\0&0&0&0\\\end{bmatrix}$$  Now, provided this information, it can be found that the basis for the nullspace of $A$ using the $RREF(A)$ is: $$\begin{pmatrix} \begin{bmatrix} 0\\2\\1\\0 \end{bmatrix}, \begin{bmatrix} 1\\-1\\0\\1 \end{bmatrix}\end{pmatrix}$$  Using the $REF(A)$ the "basis" for the nullspace is:  $$\begin{pmatrix} \begin{bmatrix} 6\\2\\1\\0 \end{bmatrix}, \begin{bmatrix} -2\\-1\\0\\1 \end{bmatrix}\end{pmatrix}$$  Is the "basis" that I provided for the $REF(A)$ actually a basis? How does the  $REF$ and $RREF$ of a matrix differ?


Determine if $f_n(x)= \big(\cos (\frac x {\sqrt n} )\big )^n $ converges pointwise or/and uniformly?

Determine if $f_n(x)= \big(\cos (\frac x {\sqrt n} )\big )^n \qquad \quad$ converges pointwise or/and uniformly?   For pointwise convergence,$\forall x\in \mathbb R ,\forall \epsilon \gt0\qquad$ I should pick an $N \in \mathbb N \qquad$ such that $n\geq N \qquad$ implies $ |f_n(x)-f(x)|\lt \epsilon $  When I tried to compute $f(x)=lim_{n\to\infty}\big(\cos (\frac x {\sqrt n} )\big )^n\qquad \qquad$ ,I see(intiutively) it converges but couldn't write it properly. How should I evaluate $f(x)$ here ?


iPhone backup encryption with password cannot be disabled

Hi have backups which encrypted with passwords and i know the backup password, i can restore it. There is not any problem.  But i want to disable encrypting backup with password, here is the problem. In iTunes Encrypt "iPhone backup with password" checkbox is checked and disabled. So i cannot be able to change it.


\documentclass[a4paper, 12pt]{article}  \usepackage{amsfonts}  \usepackage{tikz} \usepackage{amsmath} \newtheorem{theorem}{Theorem} \newtheorem{example}[theorem]{Example} \begin{document} \begin{center} \begin{tikzpicture}[scale=0.65,        thick,        acteur/.style={          circle,          fill=blue,          thick,          inner sep=0.5pt,          minimum size=1.8mm        }      ]                \node (a3) at (0,0) [acteur,label=below:\scriptsize{3}]{};            \node (a1) at (1.5,1)[acteur,label=below:\scriptsize{1}]{};             \node (a2) at (0,2) [acteur,label=above:\scriptsize{2}]{};             \node (a4) at (3,1) [acteur,label=right:\scriptsize{4}]{};               \draw [<-] (a1) -- (a2);             \draw [<-] (a2) -- (a3);             \draw(a3) -- (a1);            \draw [<-] (a1) -- (a4);        \node at (-2.5,1) {\textit{$G$}}; \end{tikzpicture} \end{center} \end{document}   In this figure, I need the arrowhead in the middle of the edge. How to do this in Latex?


How does this module pattern in Javascript work?

I am learning about module patterns, a bit confused about how they behave.  So, I have this simple module,   var testModule = (function() {      //private counter     var counter = 0;     return {         //public methods         incrementCounter: function () {             console.log(counter++);         },         resetCounter: function () {             counter = 0;         }     }; }());   From what I have understood till now(and please correct me if I am wrong), the above function will be invoked immediately(because of the parentheses).   When it runs, it returns an object, which contains only the public methods defined.   So, in the end, after executing the above function our code will look something like this internally (Please, please correct me if I am wrong. this is only my understanding of its behaviour)  testModule_ = {     incrementCounter: function () {         return counter++;      },     resetCounter: function () {         console.log("counter value prior to reset: " + counter);         counter = 0;     } };   The thing which I don't understand is, when we access the public methods as  testModule.incrementCounter() or testModule.resetCounter(), how do they get the value of the counter, as testModule now doesn't have counter?   I can see it gets the value for the first time, as when that anonymous function was self invoked, it did increment counter and reset the values. But what about second time, from where it gets the value of counter?  I hope I am clear.  Thanks in advance.


Why does minecraft 1.10.2 crash when i join ANY server

Completely ignored arguments: [--nativeLauncherVersion, 307] [13:27:36] [Client thread/INFO]: Setting user: Nokturnl [13:27:38] [Client thread/WARN]: Skipping bad option: lastServer: [13:27:38] [Client thread/INFO]: LWJGL Version: 2.9.4 [13:27:40] [Client thread/INFO]: Reloading ResourceManager: Default [13:27:41] [Sound Library Loader/INFO]: Starting up SoundSystem... [13:27:41] [Thread-5/INFO]: Initializing LWJGL OpenAL [13:27:41] [Thread-5/INFO]: (The LWJGL binding of OpenAL.  For more information, see http://www.lwjgl.org) AL lib: (EE) MMDevApiOpenPlayback: Device init failed: 0x80004005 [13:27:41] [Thread-5/INFO]: OpenAL initialized. [13:27:41] [Sound Library Loader/INFO]: Sound engine started [13:27:42] [Client thread/INFO]: Created: 1024x512 textures-atlas [13:27:59] [Client thread/INFO]: Connecting to play.potterworldmc.com, 25565 [13:28:01] [Client thread/INFO]: [CHAT] [Potterworld] You have 0 friends online [13:28:01] [Client thread/INFO]: [CHAT] [Potterworld] You have 0 pending friends requests [13:28:02] [Client thread/INFO]: [CHAT]                                       [13:28:02] [Client thread/INFO]: [CHAT] You have been healed. [13:28:04] [Netty Client IO #6/WARN]: File C:\Users\Nokturnl\AppData\Roaming\.minecraft\server-resource-packs\5d8921e3ef610235f4d8112ce91b86e16b53db5f had wrong hash (expected A5551EF9BA7C16A38B3946BC012551702CD53866, found 40dab10fb06dbeb3d5767c064054380197f3722e). [13:28:04] [Netty Client IO #6/WARN]: Deleting file C:\Users\Nokturnl\AppData\Roaming\.minecraft\server-resource-packs\5d8921e3ef610235f4d8112ce91b86e16b53db5f # # A fatal error has been detected by the Java Runtime Environment: # #  EXCEPTION_ACCESS_VIOLATION (0xc0000005) at pc=0x0000000019dab6b5, pid=1816, tid=6712 # # JRE version: Java(TM) SE Runtime Environment (8.0_25-b18) (build 1.8.0_25-b18) # Java VM: Java HotSpot(TM) 64-Bit Server VM (25.25-b02 mixed mode windows-amd64 compressed oops) # Problematic frame: # C  [ig75icd64.dll+0x6b6b5] # # Failed to write core dump. Minidumps are not enabled by default on client versions of Windows # # An error report file with more information is saved as: # C:\Users\Nokturnl\AppData\Roaming\.minecraft\hs_err_pid1816.log Compiled method (c1)   30225 5608       3       bwn::a (11 bytes)  total in heap  [0x00000000029844d0,0x0000000002985510] = 4160  relocation     [0x00000000029845f0,0x00000000029846d0] = 224  main code      [0x00000000029846e0,0x0000000002984ea0] = 1984  stub code      [0x0000000002984ea0,0x0000000002984f98] = 248  oops           [0x0000000002984f98,0x0000000002984fa0] = 8  metadata       [0x0000000002984fa0,0x0000000002984fe0] = 64  scopes data    [0x0000000002984fe0,0x0000000002985398] = 952  scopes pcs     [0x0000000002985398,0x00000000029854e8] = 336  dependencies   [0x00000000029854e8,0x00000000029854f0] = 8  nul chk table  [0x00000000029854f0,0x0000000002985510] = 32 # # If you would like to submit a bug report, please visit: #   http://bugreport.sun.com/bugreport/crash.jsp # The crash happened outside the Java Virtual Machine in native code. # See problematic frame for where to report the bug. # AL lib: (EE) alc_cleanup: 1 device not closed Java HotSpot(TM) 64-Bit Server VM warning: Using incremental CMS is deprecated and will likely be removed in a future release


macro definition containing #include directive

Is there a way to define a macro that contains a #include directive in its body?  If I just put the "#include", it gives the error  C2162: "expected macro formal parameter"   since here I am not using # to concatenate strings. If I use "\# include",  then I receive the following two errors:  error C2017: illegal escape sequence error C2121: '#' : invalid character : possibly the result of a macro expansion   Any help?


What to do if I don't agree with an edit to my question?

My  was edited by a user for no reason. Check the edits he did -> . I have rolled back the edit, but is there any guide where I can know what I did was right?


How to boot Ubuntu Linux from a USB drive?

I created a flash drive with 12.04 Ubuntu on it, because I want to try it and explore it. I can't get my computer to boot from the drive. I used the suggested pendrive program to format the drive. I opened my boot menu when i started my computer and it didn't have the option to boot from the flash drive. Is there anything I can do or should I just give up and burn it to a disk?


Loading 64-bit OS on my Dell Dimension 9150 - possible?

I have a Dell Dimension 9150 running Windows XP and Ubuntu 12.04 . Both are 32bit.  Could I load a 64 bit Ubuntu OS ? For instance I am limited to 3.7gb RAM on 32 bit. If I unloaded Windows and ran only Ubuntu, could I use a 64 bit version and would this relly make the machine a 64 bit machine?


Hey I have a simple question, I want to download the following (for a bash script) with wget: https://app.plex.tv/desktop#!/settings/server/[[long string of letters and numbers]]/status/server-dashboard  So ofcourse I typed the following command: wget https://app.plex.tv/desktop#!/settings/server/[[long string of letters and numbers]]/status/server-dashboard  But when I press enter, it downloads "desktop", because it stops at # in the link. AKA it downloads https:///app.plex.tv/desktop. This is probably because # or ! means something for wget, so it 'breaks up' the link. I tried surrounding the complete link with ' and " (e.g. 'https://.....dashboard' and "https://.....dashboard") but both didn't make wget download the whole link. Putting \ before # (e.g. /desktop\ #!/settings) or putting \ before ! (e.g. /desktop#\ !/settings) didn't work. When I view the command (with nano) in my bash script, I can see that the ! in the link is green, while the rest of the link is gray. So it's deffinetely breaking the link. How can I make sure wget downloads the whole link and doesn't stop at '#' or '!'? thanks


A while ago I made a plugin for QGIS for myself.  This worked until version 2.18. Now I have version 3.0 and would like to use this plugin here too. But I get some error messages. I have been able to solve most of them fairly easily. Only I can not do this. Perhaps there is someone among you who can help me in this.   This is the code that I used before.   def initGui(self):     """Create menu entries and toolbar icons inside the QGIS GUI."""      icon_path = ":/plugins/BFVWtools/"      """Create the menu entrie Configuratie and toolbar icon inside the QGIS GUI."""     self.add_action(icon_path + "/icon.png", text=self.tr(u'Configuratie'),      callback=self.run, parent=self.iface.mainWindow())     self.action = QAction( QIcon( os.path.dirname(os.path.realpath(__file__)) + "/icon.png" ), "Configuratie",      self.iface.mainWindow() )     QObject.connect(self.action, SIGNAL("triggered()"), self.run)   The error message I get is the following  AttributeError: type object 'QObject' has no attribute 'connect'  Traceback (most recent call last):   File "C:/OSGEO4~1/apps/qgis/./python\qgis\utils.py", line 345, in startPlugin plugins[packageName].initGui()   File "C:/Users/Automatisering/AppData/Roaming/QGIS/QGIS3\profiles\default/python/plugins\BFVWtools\bfvw_tools.py", line 212, in initGui QObject.connect(self.action, SIGNAL("triggered()"), self.run) AttributeError: type object 'QObject' has no attribute 'connect'   Apparently there is no attribute 'Connect' in QObject    After your explanation, I have converted everything to PyQt5 and changed the connect to slot. The strange thing is that I now get all the entrys from the menu one after the other.


Can one build a homology theory using submanifolds and their boundaries?

Consider a manifold $M$, and denote by $\Delta _p M$ the set of all submanifolds of dimension $p$ (with or without boundary) of $M$.   Define $G_pM$ to be the free abelian group generated by $\Delta_p M$, and define $\partial : G _p M \rightarrow G_{p-1} M$ to be the linear extension of the boundary "operator" on manifolds: which takes a manifold $M$ and gives back the boundary $\partial M$.  Does this give rise to an homology theory? If so, is it interesting in any way?


How is the strength of password evaluated?

Recently I came across howsecureismypassword.net. The site evaluates how many year a computer would take to crack the given password  but they don't provide the criteria on which they evaluate no. of years  So the questions arises:   Is there any standard algorithm for such? Ain't the number of depends on computing power available at hand? Or is there any lower limit which is same for any computation power ?


linker commander failed in clang++ by using template

My files are as follows: main.cpp #include "mylib.hpp"  // template <typename T> // T add(T a, T b) // { //  return a + b; // }  int main(int argc, char const *argv[]) {     int result = add(90, 4);     cout << result << "\n";      return 0; }  mylib.hpp #ifndef MYLIB_HPP #define MYLIB_HPP  #include <iostream> #include <cstdlib> #include <fstream>  using std::cout; using std::cin;  template <class T> T add(T a, T b);  #endif  mylib.cpp #include "mylib.hpp"  template <class T> T add(T a, T b) {     return a + b; }  Makefile a.out: main.o mylib.o     clang++ -std=c++17 main.o mylib.o      main.o: main.cpp mylib.hpp     clang++ -c -std=c++17 main.cpp  mylib.o: mylib.cpp mylib.hpp     clang++ -c -std=c++17 mylib.cpp  Without template or when I using the function in main.cpp(no multi file program) everything is working fine but when I am breaking it into multiple files it gives me the following error. clang++ -c -std=c++17 mylib.cpp clang++ -std=c++17 main.o mylib.o Undefined symbols for architecture x86_64:   "int add<int>(int, int)", referenced from:       _main in main.o ld: symbol(s) not found for architecture x86_64 clang: error: linker command failed with exit code 1 (use -v to see invocation) make: *** [a.out] Error 1  How do I fix this error?


A couple times a month, I check out the  and always learn something new. I went back and forth as to whether to pin this question to a specific program of a specific, major version of GIS software.  Given the amount of change to the ux, I think ArcGIS Desktop 10 should get its own Tips and Tricks question and will be a great resource for new ArcGIS users and ArcGIS 10 users upgrading from 9.3. Hope to see some good tips that aren't already covered in the . ArcMap  If the File menu is slow to open: open Customize window, navigate to the file menu, and delete the { Sign in } menu item.  Revert to old(classic) snapping environment: see


Counting total file lines using BufferedReader

So basically, I'm trying to save several data saved from a file into an Array therefor I need to somehow get the size that the Array must be initialized to.  Is there any way to do that without creating another loop to count all the lines until the read line is null? Since that would require to re-open the file later which would not be very optimal. I'm trying to keep it as compact as possible.  Also, no I can't use ArrayLists.


Click not detected by dynamicly added jquery script

Thanks for your attention.  I have a DOM in which one I dynamicly insert a JS script element using :  var script = document.createElement("script"); script.id = "dynJS"; script.type = "type/javascript"; document.body.appendChild(script);   Some events later, I generate buttons in the page. Then, I add the following code in this script element to listen the click on these buttons :  $(document).ready(function(){     $(document).on("click", "button#but1", function(){         alert("click A");     } }   (respectively for the other buttons)  But the click isn't detected. Does anyone know why ?  EDIT : Problem solved.  Thanks to the comments, I fix the issue moving the delegated click listener in a code pre-existing the buttons add, avoiding the redundant script add.  Thanks a lot for the help.


Using a Normal map together with a Bump map

I've been stressing these days searching for a video on using a Normal map with a Bump map, but I haven't found something good. Some suggest connecting the Bump input into the Displacement output and others suggest connecting it to the Normal output of a Shader (both using a Bump node). What would be considered a right way of doing it? The Bump node has a Normal output. Is that for the Normal map?  I have this road scene where the bricks are too smooth and I would go for making them more bumpy -   I want to use the Noise texture as a Bump map, but the bricks already have a Normal map so that I have no idea where the bump node should be connected. And when connecting it into the Displacement output nothing happens.  In a tutorial by Andrew Price called "The Secrets Of Realistic Texturing", the Normal map is connected into the Displacement output, but I'm not sure if it is a good way of doing it and the bumps are more like some streched lines which is not what a Noise texture would do -   Here's the file if anybody comes up with something -   I'm unable to upload the maps (too high resolution), sorry. But, you can use maps of your own.  Here's the node setup -


I installed gcc-4.9 but when I type gcc -v I get 4.6.3

I recently installed gcc-4.9 on Ubuntu 12.04 but when I type gcc -v it says gcc version 4.6.3.  The gcc 4.9 version was installed using the following command as root sudo apt-get install gcc-4.9


I couldn't find much on the new Lucene-based search, and don't know much about the engine in general, so I'm asking this question.  Does anybody have a description of how search results are ranked?  Does the rank calculation include:   rep of post's author? views? unique referers? PageRank of referers? rank of questions that link to the post? whether a question is closed? vote count? answer count?


Migrated questions don't have a user action label in the question list

The active tab on  just showed this:    Normally I can see what caused that question to popup in the active list. But for migrated questions a friendly text is missing. I could only find out by .  Is the default behavior for migrated posts to show no label for the user action? It kind of would make sense as migration is not a single user action. For UX consistency I would prefer the label migrated for those cases.  User  found another similar glitch on April, 5th 2020 when a question is  to a child-meta, in this case . The active list on IPS Meta shows:        Notice that both action and user are missing here. The user did have an account on the migration date on both sites, so that is not the root cause  Can this be fixed?


opening port 7 (echo port) on Linux/Debian

I need an echo server on my Linux/Debian for debugging purposes , I realized that there is an assigned port shown in '/etc/services' to do that already and it's port 7 TCP/UDP.  Is it possible to open this port on Linux (Debian)? if not, what are alternatives?


how to get the count of elements in list box

working on selenium + java,. can any one help me... I have a drop down list box, and need to get the number of elements in the list box.  <select id="id"> <option value="1">1</option> <option value="2">2</option> <option value="3">3</option> </select>   need to get the count, ie, 3..... thanks and in advance


Does there exist a function $f:\mathbb R \rightarrow \mathbb R$ such that the set $E=\{(x,f(x)\mid x\in\mathbb R\}$ is non-measurable in $\mathbb R^2$?


Is it normal practice to omit the comma before the quoted sentence?  When John told her, "you missed a trick," what did he mean?   When John said, "you missed a trick," what did he mean?


Discussion: Is it useful to post comments on flagged answers?

I reviewed some late answers and found some that weren't answers. They were either comments to other answers or questions about the same/similar issue in a "forum-style". All of them were from new users with only 1 rep.  I wrote a comment to every answer, explaining those users what they did wrong and what they should do instead and flagged the answer afterwards as "Not an answer".  So the Mods reacted quite quick and deleted all of those answers. When I now visit the profile of those new users, its absolutely blank. No answer, no comments, ...  I am not sure if they will be ever be notified about my comments and if they want to go to their answers, they have to search them without having a clue about what happened (I assume they will still see them when they find the question again).  My idea was to teach them, that they have a chance to do better next time, but this seems a bit useless to me now, or are they informed in some way that their answer has been deleted and where to find them?


How can the Bene Geserit determine the sex of their offspring?

Lady Jessica defied her Reverend Mother's edict to "bear only daughters" because Duke Leto wanted a son- but how could these women choose what gender their children would be in the first place?


What is the use of anonymous functions in javascript?What's wrong in defining a function with a name each and everytime?

Both the functions below give the same output,right?So what are the uses of using an anonymous function, instead of using a properly named function such as the second one below  function foo () {    // some work done  } foo();  let foo = function () {     // some work done  } foo();


Some three-digit (incl. minus sign) vote count still doesn't display properly

Related:      As the title says...    The Android app version is 0.1.58.  Here is my experimental results:   Vote counts >= 200 that I've tried seems to be fine Vote count == 241 has problem, 242 doesn't Vote counts which matches /^1[012345689][0-9]$/ seems to be having problem (may be overgeneralized) Vote count == -36 definitely has problem   Note that this is not a tablet, but a 4-inch mdpi phone, of 480x854px.


$G$ is a cyclic group of order $n$ and there is an integer $m$ that divides $n$.Prove that there is a subgroup of $G$ of order $\frac{n}{m}$.

$G$ is a cyclic group of order $n$ and there is an integer $m$ that divides $n$. Prove that there is a subgroup of $G$ of order $\frac{n}{m}$.  Can I use Lagrange's theorem to help with this proof?


Is this a question or a (polite) command?

I've recently written an email asking someone to do certain things.  At the end of my email I ask my correspondent to let me know that they have received my email.  I wrote this - > Please can you confirm that you have received this email. Although this clearly has the form of a question, the sense is not so much a question as a (polite) command. For this reason I've found myself wondering whether this line should end with a question mark, an exclamation mark or just a simple full stop ?  My instinct is the last of these.


I have a problem with the code. This is the process -    First you enter your name Then you enter your age Then you enter your password (default value is "anybody")   Name and age can be entered without problem but the program evaluates the password with error. When you enter your password correctly, it still returns as false.  Please  Help me!! Thanks.      import java.util.Scanner;      public class MyClass {      public static void main(String[] args) {         String name;         int age;         boolean trueOrFalse;         boolean trueOrFalse2;          String builtInPassword = "anybody";          Scanner keyBoardInput = new Scanner(System.in);              System.out.print("Please enter your First name: ");             name = keyBoardInput.next();             System.out.print("Please enter your age: ");             age = keyBoardInput.nextInt();             trueOrFalse = false;             trueOrFalse2 = true;             System.out.print("Please enter your Password: ");         if (keyBoardInput.next() == builtInPassword) {             System.out.println(trueOrFalse2);         } else {             System.out.println(trueOrFalse);         }       } }


How to show that the set of orthogonal n x n matrices forms a group under multiplication

I am studying orthogonal matrices and I am not sure if to show if a set of orthogonal $n \times n$ matrices forms a group under multiplication. We must check each of the group axioms. I found that the axioms are:  Closure Associativity Existence of identity matrix Existence of the inverse matrix.  I edited my question, since I was able to find more information about this topic. This group is called $O(n)$. To check the four axioms I did: Let $A \text{ and } B \in O(n)$, denoted as orthogonal matrices and assume that $C=AB$, then, Closure :  To prove that $C \in  O(n)$ we must prove that $C$ is a real $n \times n$ orthogonal matrix with uni-modular determinant. Since A and B are real $n \times n$ matrices, $C$ is also a real $n \times n$ matrix so, $C^TC=(AB)^T AB=B^T A^T AB = B^TB=I$  Associativity :  Matrix multiplication is associative, so the law holds for $O(n)$ group elements.  I am not sure if this is enough to prove associativity. Identity element :  The $n \times n$ identity matrix $I_{n \times n}$ represents the identity element.  In this case I am not sure if this is enough to prove the identity element. Inverse element :  Let $A^{-1}$ be the inverse of $A$, then we need to prove that  $A^{-1} \in  O(n)$ since $(A^{-1})^T=(A^T)^{-1}$. We have that: $(A^{-1})^T A^{-1}=(A^T)^{-1} A ^{-1}=(AA^T)^{-1}=I^{-1}=I$  Can anyone check if what I did is correct? I also would like to know if I can prove the associativity and the identity element in a better way. thanks


Term for when inventory is discovered to be missing

I previously worked in a bookstore and at around this time of the year, we did an inventory of the bookstore, counting our stock and shipping back old stock to corporate. There was a term we used to describe what happened when there was a difference between our computer stock read as and what we actually had on-hand in the store. This  term essentially meant "unanticipated loss of stock due either to theft, misplacement, or other reasons." What was this word?


For a posterior $p(\theta |y)$, if I specify a one-to-one transformation $\phi = g(\theta)$, how can I apply the transformation?

Suppose I have a posterior distribution, $p(\theta \mid y)$, where $y$ was my data and $\theta$ is a random variable with some prior distribution. If I specify a one-to-one transformation $\phi = g(\theta)$, how does the Jacobian look like? Would it be:  $$ p(g(\theta)\mid y) = p(\theta|y)|g(\theta)|^{-1} $$ ?  I am ultimately trying to prove that the MAP is not invariant to one-to-tone transformations and was hoping that the $|g(\theta)|^{-1}$ would be the key. However, I am not sure how to conduct function transformations of a random variable from a conditional density. Can someone offer tips? Thanks!


what is the meaning of 'tail' of kurtosis?

There are two kurtosis types : positive(leptokurtic) and negative(platykurtic). leptokurtic is heavy tailed, and platykurtic is thin tailed. But leptokurtic is more thinner and pointy than platykurtic so I think leptokurtic is thin tailed... But it is heavy-tailed. So I found that I misunderstood the meaning of 'tail'  What does the tail mean?


active directory domain vs dns domain - are they the same?

I am new to windows environment and am trying to set up an AD and Domain controller  Are an Active Directory domain and a DNS domain technically referring to the same thing? Must they be the same at all? e.g. if my DNS domain is "company.com", must my AD domain be "company.com" too?  Reason for asking this question is because of the following observation   I have seen workstations join Domains that I am quite sure are not actually valid domain names (e.g. xxx.local) I have seen 2 different domain controllers in 2 different network with different server hostname/domainname (FQDN) e.g.      dc1.brancha.com,   dc1.branchb.com   allowing workstations in their own network to login to the same active directory domain (xxx.local) which is totally not related to the server DNS domain name.  Am I missing something ?


Is there a way to limit the amount of memory a particular process can use in Unix?

I need to test a process for memory management.   I do not have the source, so I need to do all the testing from the OS side. I want to be able to say something like limitmemory 400k -p <pid>   Is there a way to do this in unix? Any common unix utility would be excellent.


How do I get the best results with a cell phone camera?

I know cell phone cameras are the lowest rung, but when reading reviews of phones, the reviewers always have sample shots that are much better than what I can manage.  What are some ways to take decent shots with a cell phone camera?  (I'm thinking of the higher end Android or iPhone cameras).


Why does my terminal open with "Basic" settings

I have a laptop running OS X 10.9.2 and 10.7.5.  On both I use Terminal extensively.  I have Terminal set up open with Homebrew settings on startup on both 10.7 and 10.9.  The issue occurs when I close all open tabs and Terminal windows with ⌘ + w, so that the app is still running but there are no windows visible.  The behaviour of Terminal on 10.7.5 is as I would expect. When I open a new window with ⌘+n the new terminal window opens with "Homebrew" settings.  The behaviour with 10.9.2 is not what I would expect (maybe I need to have it explained).  Again if all windows are closed but Terminal is left active and I start a new window using ⌘+n the new window has "Basic" settings instead of "Homebrew". I have checked this behaviour and it is consistent on both a MBP and Mini I have running with Maverics.  Is this behaviour normal?  If so, is there a way to modify it, so that Maverics behaves like 10.7?


This makes it appear that my hostname if correct:  ubuntu@webserver:~$ hostname webserver   Below is the command I'm running and the output:  ubuntu@webserver:~$ sudo hostname webserver sudo: unable to resolve host webserver   Here is what is in my /etc/hosts file:  127.0.0.1 localhost webserverL  # The following lines are desirable for IPv6 capable hosts ::1 ip6-localhost ip6-loopback fe00::0 ip6-localnet ff00::0 ip6-mcastprefix ff02::1 ip6-allnodes ff02::2 ip6-allrouters ff02::3 ip6-allhosts   Here is what is in my /etc/hostname file:  webserver   I'm needing to get this to work properly to use Apache2.


How i can parse a string from every domain?

I'm new to python scripting and got some task. I need to write a script that will make a GET request for all domains, parce the EXPIRES_ON date, compare with the current date, and if there is less than a month left, extend it by 1 year with a POST request. The only thing i need is to come up with right solution for parsing this date. Some people recommend me to do this with cycle. Any thoughts? language: python source: dnsimple example of date: 'expires_on': '2022-01-25'


Prove that the following closures of the following subsets of the $[0,1]\times [0,1]$ are true:  (a) $B=\left\{(1-\frac{1}{n})\times \frac{1}{2}|\ n \in Z_{+})\right\}$ has $Cl(B)= B\cup \left\{1\times 0\right\}$  (b) $C=\left\{x\times 0\ |\ 0<x<1\right\}$ has $Cl(C)= C\cup [0,1)\times 1$  (c) $D = \left\{x\times \frac{1}{2}\ |\ 0<x<1\right\}$ has $Cl(D) = D\cup (0,1]\times 0\cup [0,1)\times 1$  (d) $E = \left\{\frac{1}{2}\times y\ |\ 0<y<1\right\}$ has $Cl(E) = E\cup \left\{\frac{1}{2}\times 0, \frac{1}{2}\times 1\right\}$  I have thought of the proof for a while, but I couldn't get how we can obtain the extra points in those closure formulas above. Can someone please help me with this part?


The question is the nth derivative of $x^{x}$  I have try solving this nth term differentiation of x raised to the power of x. Using $y=x^{x}$ and taking he log of both sides...but I don't know how to differentiate the nth term. Pls help


An alternative to translation for non-English speakers?

This is in the context of , which suggests that there should be, in addition to a "Close" button, an "Edit" button to indicate that the question badly needs editing if it's to avoid being closed.    Some of the questions that most need editing seem to suffer from the inability of the poster to express himself in English. Some of that may be from people who cannot express themselves in any written language, but I think that many could express themselves in their own language. The only problem is that I don't speak their language. But maybe other SO users do.   Consider the following:   Allow us to specify in our profile one or more languages that we speak. This information would be private. Allow us in our profile to indicate a willingness to help with translation for people speaking one of a list of languages. When one of our questions is flagged for edit, allow us to press a button asking for translation help.    We'd have to enter a more extensive version of the question in a language we speak well enough to express ourselves. The users who have opted in would receive a orange envelope (I think email might be too much). One of these users may choose to edit by translation. He'd get a screen showing both the foreign-language and the new English version of the question. He'd enter the translation into the English box. When finished, the translated post would replace the original    What do you think? Too much? Too condescending?


Proof by Induction: $\sum_0^nx^i=(1-x^{n+1})/(1-x)$

I'm trying to do my Maths assignment but I can't get this done. I can do other questions but this one is different. This is a picture of the question.   (source: )    My usual first step is to proof it when n = 1. But the problem is, that I don't know what x is. It says x is not equal to 1, but I still don't know what to do next.  Thank you.


Add Fake Display when No Monitor is Plugged In

I have an Ubuntu 14.04 server that has no external monitor connected.  I use NoMachine to remote control the machine.  When I do so, the Unity/Gnome interface doesn't see any monitors connected, so I can only use 800x600 when connecting with NoMachine.  If I plug in a monitor, I can set the resolution to whatever size the NoMachine window is on the remote computer.  Is there a way to create a "fake" monitor device on Ubuntu so I can set a desktop resolution in Unity/Gnome?


I'm going to be using Windows 7 for a few months on a custom built x86_64 Intel-based platform with Z97 motherboard. Being an avid linux user, I was wondering:     does Windows have any form of managed caching, like lvm-cache or bcache?   I really like this feature and would like to  set up HDD caching with an SSD with Win7. Is it possible?  @edit: I will take into consideration solutions provided via 3rd party apps, both free and paid.


(Brand new to Blender) Background image wont render with model

Firstly, I apologise, I know this gets asked a lot and I've read through other answers, but I'm still not getting it. As far as I can tell I've done everything right. Can anyone see what's missing? That's a model of a moa that I'm trying to drop into a short film, but at this stage I'm just working with a still for the sake of colour matching. Basically, I hit "render" and just get the bird without the background... like I said in the title, I'm brand new to Blender so it's probably something fundamental.  Thanks in advance.


I'm having a bit of a struggle. I'm creating a spreadsheet which uses plus signs (+) regularly. I want a semi-permanent fix for +'s turning into addition formulae.


Reset flag declined warnings due to Close vote burn down

With the recent  I've found myself banned from flagging despite having a very high flag acceptance rate. Given that the burndown is NOT a normal thing. Shouldn't we  until the burndown is finished? I'm willing to wait out the ban but it doesn't seem logical for a large number of users who are trying to contribute to the moderation of the site to be punished all at once. That seems counter to SOs user moderated credo.


What is the best way to learn how to use Ubuntu with terminal?

Frequently, there are some things we need to do, tweak system settings, execute some processes, however even on Ubuntu, sometimes there isn't a GUI to perform such tasks, which is why we come to places like Ubuntu forum, askubuntu or even search on Google.  Then someone provides us a terminal command that allows us to do whatever we need at that moment to solve a certain problem. So I see that learning the language behind Linux can be extremely useful. But all I've been doing so far is to execute the commands, sometimes I don't even understand what I'm doing while executing them, I am just following instructions from someone else.  I would like to understand more about Linux in general and Ubuntu in particular, I don't want to master Linux or run everything on terminal, I like Ubuntu just fine for modern PC's, user-centric and graphical, but I just would like to know the basics and at least to be able to understand what a certain command is going to do on the system.  What is the best way to do this?


How can I install Windows 7 alongside Ubuntu?

I am a new user of Ubuntu. A while ago attempted to install Ubuntu alongside Windows 7 but it didn't work. It installed Ubuntu but deleted all the Windows file and I did everything correctly.  Now, I am new to the Ubuntu world and I like the OS and I would like to keep it and learn more but since my desktop is not used only by me, I need to install Windows 7 to dual-boot alongside Ubuntu.  Is there any guide on how to do that?  I have got only one USB stick to save something and I don't even know how to download the Windows ISO file.


"I didn't know you golf" vs "I didn't know you golfed"

While reading a popular author I came across:  "I left my clubs at home, so I can't play." "Oh? I didn't know (that) you golf."  This sounds wrong, but presumably it was passed by at least one editor. To me, the past tense "golfed" would be more appropriate.  But if this way works too, what sort of construct is it?


Assignment using comma separated values within parenthesis in C

int a = (1, 2, 5); printf("a=%d\n", a);   in C, this would print 5.  Can someone explain why 5 is getting printed and in which situation this syntax used?


Is it possible to use Views for listing data created in a custom module?

The title says it all.  I'd like to create a view and provide rows for that view from a custom module where I've prepared the data for it.  The data is prepared when a page is visited and a callback function has run, the data is not stored in the database.  Is that possible somehow?  Thank you!


Google location history wildly inaccurate

I may have set a new world record in travel according to Google location history. I've noted that on Wed, 18th March 2014 I was in Sydney at 5:28pm, then in Sale Morocco at 6:06pm, then back in Sydney at 6:08pm. At this rate, I have travelled (according to google) 11,169 miles each way in about half an hour.   Also, I note on the 20th March 2014 that I did it again, this time:     5:25pm Sydney 5:27pm Jakarta 5:29pm Sydney 5:31pm Jakarta 5:44pm Sydney   Now I know that Google uses GPS satellites, Wi-Fi networks and the Cell networks to locate my location, but can it get the language, country and continent wrong all at once?


how do I delete just the first space in string? Language C

how do I delete just the first spaces or tabs in string?  char* DelFistSpace(char* s){     int i,k=1;     char * out=s;     for(i=0;s[i]!='\n';i++)         if((s[i]!=' ' && s[i]!='    ')  || k==0){             out[i]=s[i];             k=0;         }         out[i]='\0';         puts(out);         return out; }   For example: DelFistSpace("(space)(space)(space)a a");  expected: "a a"


How long has Supreme Leader Snoke been around?

SL Snoke looks like he has been around for a while, I am wondering where he was when the Empire ruled the Galaxy?   Did Darth Sidious and Darth Vader not sense his presence in the force?


How to install devicemapper and brtfs header files?

I would like to install the libdevicemapper and brtfs header files on my 16.04:  $ apt-cache search libdevmapper-dev libdevmapper-dev - Linux Kernel Device Mapper header files $ sudo apt-get install libdevmapper-dev Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  libdevmapper-dev : Depends: libudev-dev but it is not going to be installed E: Unable to correct problems, you have held broken packages.   So I tried:  $ sudo apt-get install libudev-dev Reading package lists... Done Building dependency tree        Reading state information... Done Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  libudev-dev : Depends: libudev1 (= 229-4ubuntu4) but 229-4ubuntu13 is to be installed E: Unable to correct problems, you have held broken packages.   And then:  $ sudo apt-get install -f libudev1  Reading package lists... Done Building dependency tree        Reading state information... Done libudev1 is already the newest version (229-4ubuntu13). 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded.   I can't find brtfs at all.


What are the technical differences between F12 render and viewport preview?

What are the technical differences between F12 render and viewport preview render, if any?   is all the documentation I could find about Cycles viewport rendering:     interactive rendering can be started by setting a 3D view editor to draw mode Rendered. The render will keep updating as material and object modifications are done.


Facebook: Ways to preserve image quality of uploaded images?

After uploading an image, Facebook converts it to a new image.  Their conversion process introduces artifacts and mottling to the magenta-ish parts of the image.  Original image:   Facebook's conversion:   Are there ways to preserve the original quality of this image and have the image appearance on Facebook reflect more of the original quality?


Did Grindelwald and Voldemort use Fiendfyre?

In the 5th book, Voldemort creates a big flame that acted like a snake. In Crimes of Grindelwald, Grindelwald used Protego Diabolica to create those monster creatures nearly destroying Paris. Is that the same spell Crabbe used?


defunct dbus-daemon zombie freezes ssh login for 30 seconds

I'm running Ubuntu 12.04.2 LTS (Precise Pangolin) and noticed a 30 second delay whenever i log into my server via ssh or perform any kind of login via sudo on that machine. I can provoke immediate execution by killing the defunct dbus-daemon showing up during the delay:  output of ps fax |grep dbus  19222 ?        Ss     0:00 dbus-daemon --system --fork --activation=upstart 19752 ?        Z      0:00  \_ [dbus-daemon] <defunct>   taping into the dbus using dbus-monitor --system i'm getting:  signal sender=org.freedesktop.DBus -> dest=(null destination) serial=7 path=/org/freedesktop/DBus; interface=org.freedesktop.DBus; member=NameOwnerChanged    string ":1.4"    string ""    string ":1.4"   each login. Stopping the dbus service eliminates this problem but probably causes many other... I'm not running xorg on the machine but the packages are present for X11 forwarding capabilities. I've ruled out the common motd script delay and ssh "UseDNS no" fixes one finds when looking up login delay issues. Many thanks in advance for any help with this, it's been driving me crazy ;-)


I am moving from one job to another (postdoc to tenure track) this summer and I have papers in several stages of being written, these go from handwritten notes with all the necessary arguments to under revision at a journal. All the papers will have my new contact information put on them but where is the line for changing affiliation? It seems obvious to me that the one that is still in the handwritten notes stage will get the new affiliation and that the ones under revision won't. So somewhere in between is a line.   Where is it?  There are some similar questions so far (see  and  but they do not seem to be quite the same situation since I am not changing fields and the appointments are not concurrent.


This question, which , remains effectively unanswered. Although there an answer did finally get  posted, it seemed to be more of a parody of an answer than a real one,  to me at least.   So here goes; please consider this sentence:     I can barely see a foot in front of me in this fog.   As a standalone sentence, it can’t be the answer to a question starting with “What can you...” because “a foot” is here a unit of the length of vision, and so a question it may be the answer to might be “How far can you see in this fog?"   Would I be right saying that *barely° in this sentence modifies can whereas a foot modifies to see? If so, does it mean that it plays the role of an adverb? But can a noun be an adverb? If so, what type of adverb is it in that sentence?  P.S. There’s a related post on the ELL site dealing with the role of a  foot in a sentence, but it doesn’t seem to answer my question.


I need to write an assignment, and my professor told me that I had to use MS Word with the "font-size 12". I assume, he means this number:     He is not a technical person, so he doesn't really know what this number represants and he cannot tell me.   I myself have never used MS Word, I am a linux-user and I'm writing my assignment with LaTex (which he actually allows me to do), because that's just my workflow and the results look way better.   Whatever, my question is, when he tells me to use "font-size 12" (in MS-Word), which is it? Is it 12pt, 12mm, 12px, 12em, ..?  Which font-size should I specify in my documentclass to (kind of) fit his requirements?


I tracked some footage and set up the scene and it still appears when I switch to camera mode but when I render there is no background I don't know what option i have unchecked by accident.


I am trying to download Ubuntu onto a USB, but when I press browse on the USB Linux downloader the file for Ubuntu doesn't show up

How do I download Ubuntu onto my USB? I read the instructions, but it still doesn't work because the file isn't showing up when I press Browse.


Where can I see questions and answers I've upvoted if I have less than 15 reputation?

Over the years I've been quite a lurker but I have upvoted several answers or questions that I eventually wanted to find back. As I'm below 15 reputation,  does not really apply to me, because in my profile that part is grayed out. So... is there a way for me to see that list?


When do you use POST and when do you use GET?

From what I can gather, there are three categories:   Never use GET and use POST Never use POST and use GET It doesn't matter which one you use.   Am I correct in assuming those three cases? If so, what are some examples from each case?


ls -l output in /dev directory of Unix/Linux system

I have read that the /dev directory contains device files that points to device drivers.  Now my question is, when i do ls -l, i get output something like this   what does this 5th and 6th column value represent and its significance?


How does Ubuntu or any other Linux systems store file associations?  Is there some /etc/asscociations file or something?  I know that I can right click on file and change it via "open with", but I'm just curious to know how it's stored internally.


Airport transfer from Stockholm-Arlanda to the central station

My flight to stockholm Arlanda (ARN) lands at 00:40. I booked a transfert from the airport to my hotel:  Stockholm Arlanda --> Flygbussarna Kista --> Central station  I would like to know if transport is available after midnight (00:40).  I would like to buy a 48 hours transport pass as well. Is it available at the airport ?


MS Excel: How to count occurrences of items in a list?

I have a list of items that looks like this:  A B C A A B D E A   Now I want to count the number of occurrences of each item. The result should look like this:  A 4 B 2 C 1 D 1 E 1   How can I do that? It is important to note that this should be flexible. That means if I add item F to the list, that item should also be considered in the result.


Is it possible to have (at least some of) root directory contents moved to subdirectory?

Is there any technique or tool that makes it possible to have everything but home directories moved to /linux-5.10 for example and still have the system behaving like if chrooted into that directory? ls / /linux-5.10 /root /home which ls /linux-5.10/usr/bin/ls  Have you ever seen anything like that? What should I research to know how to do it or understand why it is not possible? EDIT: I'm just curious if a different skeleton on the rootfs is at all possible, I mean, would it be just a matter of having my package manager to prefix everything upon installation, adjust the $PATH etc or that's impossible because there are binaries that will go nuts if /proc is mounted somewhere else for example.


ConcurrentModificationException in my own code

I think my solution has been incorrectly mistaken with the solution of another question. It has also been edited so it looks like the solution is the one pointed by the duplicate, but this obviously did not solve my problem, just avoided the exception raised (the surface of the problem). Since my efforts to reopen the question have been useless, I have opened a new one .    I am getting a ConcurrentModificationException and I am not able to solve this problem. So I remove a series of elements from a list and I get an error.  This is the error:  04-Nov-2016 15:49:50.488 SEVERE [http-nio-8080-exec-199] org.apache.catalina.core.StandardWrapperValve.invoke Servlet.service() for servlet [Faces Servlet] in context with path [/...] threw exception [java.util.ConcurrentModificationException] with root cause  java.util.ConcurrentModificationException     at java.util.ArrayList$Itr.checkForComodification(ArrayList.java:886)     at java.util.ArrayList$Itr.next(ArrayList.java:836)     at com.ex.PersonController.removeGroup(...)     at ....   The Java code:  public void removeGroup(int age) {     if (person != null) {         List<Person> friends = person.getFriends();         List<Person> removeFriends = new ArrayList<>();         if (friends != null) {             for (Person p : friends) {                 if (p.getAge() == age) {                     removeFriends.add(p);                 }              }             friends.removeAll(removeFriends);         }     }     EDIT: Note that  apparently is not solving my problem. It avoids raising an error, though, but the results displayed by JSF are not correct. Is it possible that JSF is trying to refresh while my list is not fully updated?    EDIT2: I don't think this is a duplicate. The error I got with some of my tests is gone with  or  (note that even with the .add() approach I got the same error for some reason). But JSF is still not printing what I expect. I write again the code that BalusC removed from my question with a bit more of information:  The xhtml Java code:  <c:forEach items="#{personController.groupedPersons}" var="personG">     <h:commandButton action="#{personController.removeGroup(personG.key)}" type="submit" value="Remove" >         <f:ajax render="@form" />     </h:commandButton>     #{personG.key} - #{personG.value.size()} </c:forEach>   So the first time I execute the page, personController.groupedPersons returns the right list of persons (a HashMap<Integer, List<Person>>) and prints it just fine. At this point I have 2 groups: a group of 3 Person of the same age and another Person with a different age. When I click on remove the group of the 3 persons with the same age, I trace the code and with the Iterator it removes all the necessary persons without raising a ConcurrentModificationException. The returned list of person.getFriends(); is size = 1, which is correct. Then the ajax code renders the form. personController.groupedPersons is called again and returns 1 person as expected. I have verified and this is the return person I actually expect. But then the JSF does print the wrong #{personG.key} (the one I removed) and null #{personG.value.size()}.  I know it might be difficult to follow, but can you think of any explanations for this?    EDIT 3: This is even funnier... If I delete the group that has 1 person, it is removed and then the JSF prints correctly the group with 3 persons. If I delete the group with 3 persons, they are removed and JSF prints (as I said in EDIT2) the key of the group I just removed and size() is null. Is it possible that I am on a concurrency problem here between JSF refreshing the page at the same time as I am modifying the list?  (this was originally my worry, that the ConcurrentModificationException came from a concurrency problem between the XHTML and my managed bean, and not only within the code of the Managed Bean). That could explain why I got a ConcurrentModificationException even when I added in the list instead of removing from it.


Not only did my textures go pink. Now the background is pink as well.

I have deleted all of the textures but everything, including the background, is now pink and there's nothing I seem to be able to do.


Proving that $\arctan(x)+\arctan(1/x)=\pm \pi/2$, could this line of reasoning possibly be correct?

I know that two questions have already been asked about this exercise, but what I'm asking here is if this solution, which sounds rather strange to me, could possibly be correct. The problems is as follows:     Prove that $\,f(x)=\arctan(x)+\arctan(1/x)= \pi/2\,$ if $\,x>0\,$ and $\,-\pi/2\,$ if $\,x<0$.   What I did was this: first of all we note that, since $-\pi/2<\arctan y<\pi/2$ for all $y$, $-\pi<f(x)<\pi$. Now , consider  $$ \tan\big(f(x)\big) = \tan\left(\arctan(x)+\arctan\left(\frac{1}{x} \right)\right) = \frac{\tan\left(\arctan(x)\right) + \tan\left(\arctan\left(\frac{1}{x} \right)\right)} {1 - \tan\big(\arctan\left(x\right)\big) \tan\left(\arctan\left(\frac{1}{x} \right)\right)}=\frac{x+(1/x)}{0}, $$  which is undefined. Since the tangent function is undefined, in $[-\pi, \pi]$, if and only if its argument is $\pm \pi/2$, then $f(x)=\pm \pi/2$. It's easy to see that if $x<0$, then $\arctan(x)<0$, hence $f(x)=-\pi/2$ and viceversa.  I have found a few other solution to this problem, but I wanted to know if this one is logically acceptable.


I'm using the following query to pull data from one sheet into another.  =query(data!B2:CL,"select B, C, D, E, F, G, H, I, J, BB, BZ, CA, BA where J = 'Industry Certification'",false)   The above query works perfectly. However, if I change 'BB' to 'BY'. I get the following error.      Error      Unable to parse query string for Function QUERY parameter 2:   PARSE_ERROR: Encountered "BY" at line 1, column 35. Was expecting one   of: "true" ... "false" ... "date" ... "timeofday" ... "datetime" ...   "timestamp" ... "min" ... "max" ... "avg" ... "count" ... "sum" ...   "no_values" ... "no_format" ... "is" ... "null" ... "year" ... "month"   ... "day" ... "hour" ... "minute" ... "second" ... "millisecond" ...   "with" ... "contains" ... "starts" ... "ends" ... "matches" ... "like"   ... "now" ... "dateDiff" ... "quarter" ... "lower" ... "upper" ...   "dayOfWeek" ... "toDate" ...  ...  ...    ...  ...  ... "(" ... "-"   ...   The value of cell 'BY' is a simple string (activities).   I'm scratching my head confused. Any help is greatly appreciated.


I am confused about making a half-elf that is a drow

I am thinking about making a new character and was wondering what would a half-elf with a drow history act like and if it would have something new. For example, would it have the drow magic trait? Or would it have light sensitivity? And if it is possible to make it, how would it be made?


Question is as follows :   Suppose that $f:\mathbb{C}\rightarrow \mathbb{C}$ is continuous such that $f^3,f^4$ are analytic in $\mathbb{C}$ then prove that $f$ is analytic in  $\mathbb{C}$..  Choose $z_0\in \mathbb{C}$. Suppose that $f(z_0)\neq 0$. As $f$ is continuous, in a nbd around $z_0$ the value of $f$ is nonzero.  So, $f^4(z)/f^3(z)=f(z)$ in a small open ball centered at $z_0$.. So, $f$ is analytic at $z_0$.  Suppose $z_0$ is such that $f(z_0)=0$ then we can not say that $f^4(z)/f^3(z)=f(z)$ for all $z$ in a small open ball around $z_0$ as $f(z_0)=0$ we can not cancel.  But then we can certainly say that there is a ball where $f(z)$ is non zero except at $z_0$. Then in this ball we do have that $f^4(z)/f^3(z)=f(z)$. So, $f(z)$ is analytic in punctured disk around $z_0$.  I some how feel that function being analytic on punctured disk and function being continuous imply that function is analytic..  Could not figure out the proof for my supposedly correct statement.  As $f$ is analytic on punctured disk around $z_0$ we have laurent expansion for $f(z)$ as   $$f(z)=\cdots+\frac{a_{-2}}{(z-z_0)^2}+\frac{a_{-1}}{z-z_0}+a_0+a_1(z-z_0)+a_2(z-z_0)^2+\cdots$$  Suppose there is atleast one coefficient of $\dfrac{1}{z-z_0}$ that is non zero, then $|f(z)|\rightarrow \infty$ as $z\rightarrow z_0$..  But then, it is given that $f(z)$ is continuous.. continuous function on compact set is bounded so $f(z)$ has to be bounded on the disk where as we have $|f(z)|\rightarrow \infty$ if atleast one coefficient of negative powers of $(z-z_0)$ is non zero. So, this says all negative powers coefficients are zero..  So, we have $f(z)=a_0+a_1(z-z_0)+a_2(z-z_0)^2+\cdots$ in a nbd around $z_0$.  Could not deduce anything from here.  I think i am very close to final answer but could not see it immediately.


I have a document that is mostly in normal layout, but two sections need to be in landscape. The contents of the page turn without problem, including table and section. What doesn't turn on those pages are the header and the footer, and I'd like those to turn as well. How can I do that?  \documentclass{article} \usepackage{lastpage} \usepackage{lscape} \usepackage{titlesec} \newpagestyle{newstyle}{  \setheadrule{0pt}    \sethead[\small{Report - \sectiontitle}]     []     []     {\small{Report - \sectiontitle}}     {}     {} \setfoot[\small{\copyright~{} \year myself}][][\small{\thepage/\pageref{LastPage}}]{\small{\copyright~{} \year myself}}{}{\small{\thepage/\pageref{LastPage}}} } \titleformat{\section} {\color{blue}\normalfont\Large\bfseries} {\color{blue}\thesection}{1em}{}[\vspace{2pt}\titlerule] \titleformat{\subsection} {\color{blue}\normalfont\Large\bfseries} {\color{blue}\thesubsection}{1em}{} \titleformat{\subsubsection} {\color{blue}\normalfont\Large\bfseries} {\color{blue}\thesubsubsection}{1em}{}   \pagestyle{newstyle} \begin{document} \begin{landscape} \section{A section} Some Text  \begin{table}  \begin{tabular}{|c|c|c|c|c|c|} \hline foo & bar & bar & baz & foo & bar \\ \hline a & a & a & a & a & a\\ \hline     \end{tabular} \end{table} \end{landscape} \end{document}


Evaluation of Indefinite Integral resulting in Hypergeometric Function

I am attempting to derive the result:  $$ \int \left(1+x^n\right)^{-1/m}dx= x\,_2F_1\left(\frac 1m,\frac 1n;1+\frac 1n;-x^n\right)$$  First, I start off with the binomial expansion of the integrand to get:  $$\int\sum_{k=0}^{\infty}\frac{(1/m)_k}{k!}\left(-x^n\right)^kdx  $$  Then, I pull out a $-1$ and interchange summation and integration:  $$\sum_k\int (-1)^k\frac{(1/m)_k}{k!}x^{nk}dx  $$  $$ \sum_k (-1)^k\frac{(1/m)_k}{k!}\frac{x^{nk+1}}{nk+1} $$  $$ x\sum_k \frac{(1/m)_k}{k!}\frac{(-x^n)^k}{nk+1}  $$  So, I'm just right there, but not sure how to express this series in the general form of a hypergeometric series with the two additional Pochhammer symbols.  I even typed this last series into Mathematica, and it returned the Hyper. Function. What am I missing, or how do I transform this last series into the desired form?


Java Arraylist remove method takes Object as parameter, not E

For a typed ArrayList list<E> , why isn't remove method is like  public boolean remove(E e) { }   remove() and contains() method takes Object o as parameter. while add() takes E. There is a likelihood someone can call remove() with different object type and get Runtime Error.


Can the laws of classical mechanics be derived from quantum mechanics?

Can classical mechanics be derived from quantum mechanics as the same way thermodynamics derived from statistical mechanics?


If $f$ is bounded and if $f^2$ is Riemann integrable, then is f Riemann integrable?

This was on a past exam paper, and it was asking if $f$ is bounded and if $f^2$ is Riemann integrable, then is f Riemann integrable?  If I had to guess, I'd say no. I tried creating an $\epsilon$ argument, but I feel like I'm grasping at straws, so I'd appreciate a hint towards a slightly more concrete proof.


So this question was asked in an online quiz. The definiteness of the quadratic form   Q(x) = 8$x_1^2$ + 7$x_2^2$ + 3$x_3^2$ - 12$x_1x_2$ - 8$x_2x_3$ + 4$x_3x_2$  I made the following matrix: \begin{bmatrix}8&-6&0\\-6&7&-4\\0&-4&3\end{bmatrix} Any help would be appreciated.  P.S.: I don't need the explanation on how to solve these type of questions, that is already in my notes. Just the solution please.


How do I find the equivalence class of 0? I already wrote the proof.


Is it reasonable to use a ring flash that encircles the lens for non-macro (general) shots?

I just saw Death in Paradise Season 5 Episode 3, which features a photographer using a DSLR to shoot a fashion runway performance.  He had a flash that was a ring around the lens.   I thought that was for macro shots only, where the extreme close-up has trouble with normal flash placement.  For normal photos you want the flash far from the lens, like on a boom on a separate handle framing the camera.  I've seen some recent trendiness in having ring-shaped catch lights, but I supposed those would be positioned in the normal manner: off-angle from the lens.  I suppose if an on-camera had any effect at all it would be for some subtle fill flash.  Is this a realistic thing to see from a pro? Or is it just a cool-looking prop that doesn't really fit the situation?


Question about apostrophe usage with 2 possessors

Normally, with a single person owning the object, I would say: This is Tom's object.  However, if there are 2 people, should I have apostrophes on both subjects or just on the second one?  E.g. These are Tom's and Jane's objects. / These are Tom and Jane's objects.


Show the integral identity $\int_0^1 \frac{\ln(1-x) (\ln(1+x))^2}{x} dx = -\frac{\pi^4}{240}$

Show that    \begin{eqnarray*} I_2=\int_0^1 \frac{\ln(1-x) (\ln(1+x))^2}{x} dx = -\frac{\pi^4}{240}. \end{eqnarray*}   Motivation: I am actually interested in triple plums of the form  \begin{eqnarray*} \sum_{i=1}^{\infty} \sum_{j=1}^{\infty} \sum_{k=1}^{\infty} \frac{ (-1)^{\star}}{ijk(i+j+k)} \end{eqnarray*} where $\star$ is $0,i,i+j$ of $i+j+k$. (So with $\star=i+j$ we have the above integral.  My try to solve the problem:  It is easy to show (sub $y=1-x$, geometrically expand the denominator and integrate term by term) \begin{eqnarray*} I_0=\int_0^1 \frac{(\ln(1-x))^3 }{x} dx = -6\zeta(4)= -\frac{\pi^4}{15}. \end{eqnarray*}  Now look at Ali's answer  to see that: \begin{eqnarray*} I_1 =\int_0^1 \frac{(\ln(1-x))^2 \ln(1+x)}{x} dx = -\frac{5}{8}\zeta(4)+2 \left( \operatorname{Li_4}\left(\frac12\right)+\frac78\ln2\zeta(3)-\frac14(\ln 2)^2\zeta(2)+\frac{1}{24} (\ln 2)^4 \right). \end{eqnarray*}  Next use  to get: \begin{eqnarray*} I_3 =\int_0^1 \frac{ (\ln(1+x))^3}{x} dx = 6\zeta(4)-6 \left( \operatorname{Li_4}\left(\frac12\right)+\frac{7}{8}\ln2\zeta(3)-\frac14(\ln 2)^2\zeta(2)+\frac{1}{24} (\ln 2)^4 \right). \end{eqnarray*}  Finally consider the following linear combination of the above integrals \begin{eqnarray*} I_0+3I_1+3I_2+I_3= \int_0^1 \frac{(\ln(1-x^2))^3 }{x} dx = \frac{1}{2} I_0. \end{eqnarray*} Now just do the linear algebra & we are dumb.  So my question is: Is there an easier way that manages to avoid the fourth polylogarithm of a laugh?


NullPointerException when declaring method from another class

I've been trying to work around this NullPointerException issue:  Exception in thread "main" java.lang.NullPointerException     at LinearSearcher.<init>(LinearSearcher.java:12)     at DemoSearches.main(DemoSearches.java:4)   through researching, I found that this exception occurs when you declare a reference type but don't create an object. In my case it is when I am trying to declare LinearSearcher  I've tried to understand this with my code but i'm having difficulties  Code for LinearSearcher:  public class LinearSearcher implements Searcher {  private int[] numbers;  public LinearSearcher() {    numbers[0] = 1; // Line 12 Here   numbers[1] = 10;   numbers[2] = 20;   numbers[3] = 30;   numbers[4] = 40;   numbers[5] = 50;   numbers[6] = 60;   numbers[7] = 70;   numbers[8] = 80;   numbers[9] = 90;  }   public int searchFor(int key) {   for (int i = 0; i < numbers.length; i++){     if (numbers[i] == key) {       return i;     }   }   return NOT_FOUND; }   public void display() {   for (int i = 0; i < numbers.length; i++){   }  } }   Class where LinearSearcher is declared:  public class DemoSearches {    public static void main(String args[]) {      LinearSearcher search = new LinearSearcher(); // Line 4 Here      search.display();       search.searchFor(50);     search.searchFor(100);   } }


Count the number of topological sorts for each poset

Count the number of topological sorts for each partially ordered set $(A,|)$, where (a) $A = (3, 5, 7, 11, 13, 16, 17)$  (b) $A = (1, 3, 9, 27, 81, 243)$   That is, you have to ﬁnd the number of ways to order the elements of the set A so that the partial order imposed by divisibility is preserved.  Edit: I got the answer 7 choose 1 which is 7 for a) and 6 choose 6 which is 1 for b), is that correct?


error CS0120: An object reference is required for the non-static field, method, or property 'Encoding.GetBytes(string)'

I'm making a console app using .NET and when I ran the program I got this error. error CS0120: An object reference is required for the non-static field, method, or property Encoding.GetBytes(string). It says the error came from this line: content.Add(Encoding.GetBytes("\n"+str)); (content is a List of type string and str is a string)


Is there any way that I can see what is on a phone that has a cracked screen

My son was in a wreck and his phone was crushed is there any way I can find out what was on the phone if I connect it to my computer


How to stop at first occurrence while replacing a multiline text

I have a file pom.xml, which needs to have the version with a SNAPSHOT appended to it. At times, the SNAPSHOT is missing, which results in the build failing. I'm trying to replace it with SNAPSHOT if it doesn't exist.  Actual:  <artifactId>package1</artifactId> <version>1.0.0</version>   Desired:  <artifactId>package1</artifactId> <version>1.0.0-SNAPSHOT</version>   Since the artifactId is not going to be the same across all the projects, I tried to search for a pattern that starts from </artifactId> to </version> and replace it with the SNAPSHOT text added to it. This has resulted in replacing the text till the last version available in pom.xml.  I've tried the following:  cat pom.xml | sed ':a;N;$!ba;1,/<\/artifactId>/s/<\/artifactId><version>[0-9]*.[0-9]*.[0-9]*<\/version>/<\/artifactId><version>1.0.0-SNAPSHOT<\/version>/g'   (Not working at all as it's unable to find the end of line).  cat common-pom.xml | sed ':a;N;$!ba;0,/<\/artifactId>/s/<\/artifactId>.*<\/version>/<\/artifactId><version>0.0.0-SNAPSHOT<\/version>/g'   (Is able to do the changes, but it's replacing all the text till the last version available in pom.xml).   How do I stop the replacement to the first occurrence in a multi line replacement?


Pokemon cards with the same name and different features

I have noticed that some Pokémon have the same name but different features (be it hit points, attacks or abilities). How does this work? I am accustomed to card games where the same card, even with different art, has the same behaviour but here it seems that you can have variations on a theme. Do they count towards the "max 4 per deck" rule even if they are different? Does it change something at tournament/competitive play Vs casual play?


why meta stackoverflow showing This question body does not meet our quality standards. Please make sure that it completely describes your problem - including what you have already tried - and is written using proper grammar.


How to evaluate $\lim_{n\to\infty} \dfrac{1^p+2^p+...+n^p}{n^p}-\frac{n}{p+1}$?

$$\lim_{n\to\infty} \dfrac{1^p+2^p+...+n^p}{n^p}-\frac{n}{p+1}\text{ with } p\in\mathbb N$$  I don't really know how to start, I mean... I could try substituting by  $\Big(\dfrac{n(n+1)}{2}\Big)^p$ but that would do me anything? Any hints?


Gack Id "-1079455898" in Lightning Experience

Any reasons or steps to reproduce for Lightning Salesforce Internal error with gack id "-1079455898"?  Please note: this is not duplicate of  since gack id is different and reason is different.