Stack overflow exception when creating interfaces in C#

I'm using C# .NET Framework console application. I'm creating my own interface but I am getting a stack overflow exception. Can someone explain to me why it is happening? Here is my code:  namespace Interfaces {     interface IWorker     {         string name { get; set; }         string surname { get; set; }         uint age { get; set; }     }     class TeamLeader : IWorker     {         public string name { get => name; set => name = value; }          public string surname { get => surname; set => surname = value; }          public uint age { get => age; set => age = value; }         public override string ToString()         {              return $"Name: {name} Surname: {surname} Age: {age}";         }     }      class Program     {         static void Main(string[] args)         {             TeamLeader tm = new TeamLeader();             tm.name = "John";             tm.surname = "Wick";             tm.age = 22;             Console.WriteLine( tm.ToString() );          }     } }    I'm new to this short ways to write get and set stuff. My background is C++, it's my first time using these syntax. In my opinion they are the ones that making the error.


I'm fairly new to android development, but am I long time android user. Phones used to have a "hardware" menu button, which I have since seen is emulated in software, but only when I'm running an 'old' app on my phone ("three dots stacked on top of each other that appears to the right of all the other buttons)  Why is writing apps that make use of the button discouraged?  Is it not supported by most phones?  Is it a bad user experience? ('swipe down from top to access soft buttons', etc..)


I have repeated samples from the following process: Most samples will only contain points that are randomly distributed on a 2-dimensional plane. Sometimes, however, the sample will contain not only randomly distributed points but also some points that will be arranged roughly on a line. I say roughly because the points I observe may not all be on the line exactly but be randomly displaced somewhat. Here's the R code for a little toy example to demonstrate what I mean:  line_active <- TRUE  line_n <- 50 noise_n <- 100 perturbation.sd <- 0.01  # background noise noise_x <- runif(noise_n) noise_y <- runif(noise_n)  # line coordinates start <- list(x=0.2,y=0.1) end <- list(x=0.8,y=0.9)  if(line_active) {   line_pos <- runif(line_n)   line_x <- start$x+line_pos*(end$x - start$x)       line_y <- start$y+line_pos*(end$y - start$y)    line_x_perturbed <- line_x+rnorm(length(line_x),0,perturbation.sd)   line_y_perturbed <- line_y+rnorm(length(line_y),0,perturbation.sd) } else {   line_x_perturbed <- c()   line_y_perturbed <- c() }  points <- data.frame(x=c(noise_x,line_x_perturbed),y=c(noise_y,line_y_perturbed))  # plot! plot(points$x,points$y) points(line_x_perturbed,line_y_perturbed,col='red')   My questions are:   How would I go about detecting whether or not there is a line in any sample I'm looking at? How would I go about detecting the slope and intercept of the line if it is there? How much more tricky does this problem get if the noise does not come from some known distribution but has to be estimated?


Affects:  14.04 / 14.10 / 15.04 / 15.10 / 16.04 / 16.10  I started my dropbox deamon today, with the following result in the panel:     The icon with the warning/failed symbol should be my Dropbox icon. I cannot right-click or left-click it, so no interaction.  I am running Xubuntu 15.10 on 4.2.0-27-generic x64. I also tried to re-install Dropbox, reinstall nautilus-dropbox, recursively delete ./cache/sessions/ as well as set other themes and icon sets.  Apparently nothing helped and similar problems described here and on other boards are similar, not the same and do not work in my case.


How do distributed transactions work (eg. MSDTC)?

I understand, in a fuzzy sort of way, how regular ACID transactions work.  You perform some work on a database in such a way that the work is not confirmed until some kind of commit flag is set.  The commit part is based on some underlying assumption (like a single disk block write is atomic).  In the event of a catastrophic error, you can just clear out the uncommitted data in the recovery phase.  How do distributed transactions work?  In some of the MS documentation I have read that you can somehow perform a transaction across databases and filesystems (among other things).  This technology could be (and probably is) used for installers, where you want the program to be fully installed or fully absent.  You simply begin a transaction at the start of the installer.  Next you could connect to the registry and filesystem, making the changes that define the installation.  When the job is done, simply commit, or rollback if the installation fails for some reason.  The registry and filesystem are automatically cleaned for you by this magical distributed transaction coordinator.  How is it possible that two disparate systems can be transacted upon in this fashion?  It seems to me that it is always possible to leave the system in an inconsistent state, where the filesystem has committed its changes and the registry has not.  I think in MSDTC it is even possible to perform a transaction across the network.  I have read , but it feels like only the beginning of the explanation, and that step 4 should be expanded considerably.  Edit: From what I gather on , it can be accomplished by a two-phase commit ().  After reading this, I'm still not understanding the method 100%, it seems like there is a lot of room for error between the steps.


If a set is closed in $\mathbb{R^{+}}$ then it's closed in $\mathbb{R}$

I know a set is closed if it contains all it's limit points. It sounds like if it contains all it's limit points in $\mathbb{R^{+}}$ then it will contain all it's limit points in $\mathbb{R}$, but I have no clue about the proof.


how to incrementing a variable in a recursive function in java

the variable s is not increasing already tried several forms, pass by parameter, global variable, nothing is right  public static int p(int m,int p,int t,int s ){    int resultado;          if(m == 0 ){       s++;       resultado =  s;              }     else if(m == 1){       s++;       resultado =  t;    }          else {       s++;       resultado =  2*p(m-1,p,t,s) + p(m-2,p,t,s);    }          return s ;       }


Switch off Windows Update for a particular program or feature

I'm getting really tired of unchecking the same Windows Update candidates so save hundreds of MB's of dowbloads, especially for programs I never use, that are in fact not even installed, and those I don't wish to update.  Is there any way to permanently, or until another explicit change, to turn off certain updates?  There is an option called 'Hide update', but that unsettles me a bit.


Trying to update but not enough space on boot (answer here)

The error message I get suggests  "sudo apt-get clean"  I try running it but nothing happens.  Just get back to the prompt.  Is there any other terminal commands I should try to clean temporary files out of my boot partition?


Staying anonymous with connected accounts

Say I want to join and discuss sensitive topics on e.g  and still stay completely anonymous. Wouldn't this be impossible if anyone could see my other accounts on other SE sites. Where I might tell more about my self, where I work and so on?  Is it possible to hide your other accounts on your Stack Exchange account page? Should it be possible or even the default option?  I understand the idea of having your accounts on SO and Meta connected. But what is the main reason of having every one of your SE accounts connected?


I am nearing the end of my Ph.D. I need to publish a bit more, but am unsure what to do. So far I have published two rather large articles with my supervisor, where we develop new methods. I have also published a smaller article along with an external collaborator, where some of the new methods are used. My supervisor thinks we should publish another large article together, while I lean more towards two small ones alone. I am not guaranteed a post doc anywhere yet, and will most likely have to write my own grant application. What would be the best thinking in terms of securing external funding afterwards?


How to create and add custom fields to existing custom object programmatically using apex?

I've looked around for this and there seem to be a couple of different ways on how to do this.     However, all of these seem to be old ways (I might be completely wrong here and those methods can be totally valid today) but I'd like to make sure I'm using the latest method for doing this and avoid making a request like it's suggested in one of the StackExchange answers in the link above (The tooling API method). I also don't want to implement this in a Visual Force or any UI pages, I'd like to create custom fields on an existing object based on a received post request. A simple example for what I'm trying to do: for (String fieldName : fieldNameList) {    Existing_Custom_Object__c.CreateNewCustomField(name = fieldName, type = checkbox, ...);    // Upload/Push this change to the org }


How to display a Windows Form in full screen on top of the taskbar?

I have a .net windows application that needs to run in full screen. When the application starts however the taskbar is shown on top of the main form and it only disappears when activating the form by clicking on it or using ALT-TAB. The form's current properties are as follow:     WindowState=FormWindowState.Normal   TopMost=Normal   Size=1024,768 (this is the screen resolution of the machines it's going to be running on)   FormBorderStyle = None   I've tried adding the followings on form load but none worked for me:     this.Focus(); (after giving the focus this.Focus property is always false) this.BringToFront(); this.TopMost = true; (this however would not be ideal in my scenario) this.Bounds = Screen.PrimaryScreen.Bounds; this.Bounds = Screen.PrimaryScreen.Bounds;   Is there a way to do it within .NET or would I have to invoke native windows methods and if so a code snippet would very much be appreciated.  many thanks


Shortcuts / practicality of brute forcing block cipher (AES) + ECB with known plaintext

I know the plaintext (26 bytes long) and cryptotext of block cipher (suspected to be AES) in ECB mode. I can generate hundreds or thousands of such samples, but the samples are not arbitrary. What are my chances of recovering the crypto key using brute force methods or using brute-force + some crypto analysis?  Is there any good guidance to pull off padding oracle?


What methods of suicide cause the least amounts of collateral damage?

CK2 is a big game with lots of variables, so I'll stick to adding them upon being requested to minimize the hassle.  Anyway, let's say that you have a lot of children and the oldest one claims all the land according to laws of succession. After the father dies, the circumstances will obviously piss off a lot of people (in my case that would be 6 out of 8 vassals and 4 siblings with an opinion of -50 and below one of which is a sister married to the Basileus of the Byzantine friggin' Empire, a case of excommunication, 4 failed assassination attempts under 3 years... and lots and lots of vikings). Let's also say that the current playable character is completely incompetent compare to the next sibling in line.  So, what would be the most optimal methods to off myself without further screwing over the countryside so the next heir in line has to fix it (if we assume that said heir is actually capable of doing so)?  This is my list of DLCs (not including music and unit packs):   Charlemange Legacy of Rome Sword of Islam The Republic Way of Life


Why does standardizing my data cause better results?

I've trained a simple Neural net (scikit learn's MLPClassifier) in order to perform binary classification on some data (the titanic dummy problem on kaggle).  I know that standardizing data prior to using it to train neural nets is supposed to make training faster but I didn't expect it to change the results (it scores around 65% accuracy on non-standardized data vs around 80% for standardized data (local test set) )  # comment the following code to see the difference scaler = StandardScaler() scaler.fit(X_train)  X_train = scaler.transform(X_train) X_test = scaler.transform(X_test)   I noticed that the results of both approaches seem to converge when I train the neural net using full batch gradient descent (the default is to use mini batches with stochastic gradient descent).      see the notebook  (look at parapgraph [8])   Question: Are these discrepancies solely due to the stochastic nature of SGD?


REST API composite query: How do I use the result of a query subrequest in the referenceId of another subrequest?

I am using Salesforce's REST API to (1) retrieve a list of object IDs according to a query, then (2) retrieve the records that correlate to those IDs.  I am familiar with the Salesforce composite documentation .    My request looks like this:  POST: /services/data/v48.0/composite  {     "allOrNone":false,     "compositeRequest": [ {         "method":"GET",         "url": "/services/data/v48.0/query?q=SELECT+Id+FROM+My_Entity+WHERE+(CreatedById+!=+'asdfghjkl')",         "referenceId": "myEntity"         },{         "method":"GET",         "url": "/services/data/v48.0/composite/sobjects/My_Entity?ids=@{myEntity.records[0].Id}",         "referenceId":"myObject"     }] }   My response:  {     "compositeResponse" : [ {         "body" : {             "totalSize" : 21,             "done" : true,             "records" : [ {                 "attributes" : {                     "type" : "My_Entity",                     "url" : "/services/data/v48.0/sobjects/My_Entity/a0D6g000xxxxxxx"                 },                 "Id" : "a0D6g000xxxxxxx"                 }, {*record2*}, {*etc*}             ]},             "httpHeaders" : { },             "httpStatusCode" : 200,             "referenceId" : "myEntity"         }, {         "body" : [ {         "errorCode" : "PROCESSING_HALTED",         "message" : "'myEntity.records' references an invalid Datatype. Only Strings and primitive data types are allowed to be referenced from previous operations."         } ],         "httpHeaders" : { },         "httpStatusCode" : 400,         "referenceId" : "myObject"     } ] }   The first subrequest (the query) executes without errors.  My problem is the second subrequest.  I understand from  that I can refer to the ID of a single item (e.g. myEntity.records[0].Id).  Question: How do I use all items from myEntity.records in the second subrequest?


CloudPagesURL() value not showing in HTML

I am trying to pass the email value from a data extension to HTML. I am using the CloudPagesURL() in my email in attempt to grab the subscriber's email.  Here is my code syntax that I am attempting to use:  Email Code:
Click to unsubscribe page 505
   CloudPage AMPScript Code:  %%[  VAR @emailAddress  SET @emailAddress = RequestParameter("emailaddr")  ]%%   Cloudpage HTML Code:  <input type='text' name='Name1' value='%%=v(@emailAddress)=%%' id='Name1' />	   Any reason as to why this doesn't work? My syntax might just be wrong or I might be using the CloudPagesURL() function incorrectly.


Proving that second derivative is perpendicular to curve

How can I prove the following?  $\gamma (t)$ is unit speed, $\dot \gamma(t) \not= 0 \Rightarrow \ddot \gamma(t)$ is perpendicular to $\gamma(t)$   I don't really see where a problem would arise when $\dot \gamma(t)=0$ would cause such a problem


I am trying to use the command "apt-get update", but it gives me this error. It's not the only command that gives errors like these.      apt-get update E: Could not open lock file /var/lib/apt/lists/lock - open (13: Permission denied) E: Unable to lock directory /var/lib/apt/lists/ E: Could not open lock file /var/lib/dpkg/lock - open (13: Permission denied) E: Unable to lock the administration directory (/var/lib/dpkg/), are you root?   How can I fix that?


On Terraia Android I accidentally deleted my world while trying to back it up. Is there any way I can recover it? I really need help because it was my main world. I had a slime staff and all my money, materials, and crafting items on it.


Converting the mean and std of Normal distribution to the mean and std of lognormal distribution

Hi  I feel a little bit confused about transforming the parameters of normal distribution to log normal.  I have a random variable that is N(0.06,0.000144). Because this random variable cannot take negative values, I want to use an equivalent lognormal distribution. I calculated the mu (location parameter) as -2.83 and sigma squared (scale parameter) as 0.39. The model that I am using for simulation takes the mean and standard deviation of the lognormal distribution. when I calculate the mean and standard deviation of lognormal using the mu and sigma I get the original mean and standard deviation of the normal distribution. Is that correct? Ps. I used the following formulas to calculate mu, sigma, mean and standard deviation of the lognormal:


copy command in postgresql to append data

I am executing copy command from a function  execute 'copy (select * from tableName) to ''/tmp/result.txt'''   It works fine. But, tableName is dynamic and will be having more tables (iterating in a loop). result.txt is having only the last iteration (table) data.   I could do, if I had to, via the command line with \o or >> by appending to a file. But, I have to use the function.  I read .  It suggests a solution using temporary tables. Can I do something similar, but without temp tables? (I must avoid archive logs).  Will creating a temp table create archive logs?  Is there any way to do appending with copy command in a function?


Does an electron have a fixed orbit in reality?

The Heisenberg's uncertainty principle prevents us from measuring the position and momentum of an electron accurately at the same time. But that is just our inability, right?  In reality, would electrons be revolving in fixed orbits like in Bohr's model?  Even if electrons have wave nature, does the maximum of the wave revolve in an orbit like an electron in Bohr's model?


Does anyone know of a listing of all rings (or at least those that are commutative) of a given order?  In particular $p^3$, for a prime $p$.


How can apply the $L^p$ norm in a circle to $L^2$ norm in a square?


How can I bulk download images from a photo gallery-like website?

Is there anything like NeoDownloader for Ubuntu that I can use to download all the images from a link? Or is it somehow possible to download the directory from a web server containing photos?


I'm undergraduate student of mathematics.  I need to prove: $$\sum_{k=0}^{n} \binom{2n}{2k}= 2^{2n-1}$$ Can you please help me


It is often advised to use non-WWW url, so that there is less redirects and link juice does not leak, since people most often type non-WWW urls. But who cares what the user types? Links are not indexed from what user type into the address bar but what can be found on the web in form of anchor tags right? Some of those tags you got a control over (your own website, advertisement,..). The others are typed by users, yes, but they are parsed by the service, where the user types them - Facebook etc. For Facebook to recognize text as a URL, you have to use www. prefix and many other services auto prepend www too. So correct me if I am wrong, but most links, that you have no control over, are WWW variants and therefore from a perspective of SE crawler, running WWW version of your site will produce less 301s. User typing the url into his browser will get one more 301 from non-WWW to WWW, but that has no relevance to page rating.


Whenever I use the colortbl package to format tables, a thin white space between the cells sometimes shows up on screen (not in print for as far as I can tell). For example in this table:    Is there an easy way to enlarge each rectangle by a tiny amount so that the white space is not visible anymore?  (My guess is that the white space appears due to rounding in my pdf viewer, evince. I don't know if other pdf viewers have the same issue. Regardless, I would like to have my pdf file look good in common pdf readers)


What are main algorithmic differences between XGboost, lightGBM and Catboost?

Also, what makes lightGBM run faster than XGBoost?


How does Fist of Suns work with my Commander?

I am working on a deck that features  as my Commander and started looking at . Besides just being good because of the large number of high cost spells in the deck, I was curious how this worked with my Commander on every cast beyond the first. And honestly, I'm not entirely sure how to word this question.  For each cast of the Commander, the mana cost is increased by 2 colorless. The Fist of Suns Oracle text says     You can't pay more than one alternative cost for a spell.   Does the additional colorless cost added after the first casting of a Commander count as alternative costs? Can I use Fist of Suns to make the cost of Progenitus WUBRG every time, or just the first time it is cast? I know that it can't be cast for WUBRG plus the additional colorless, since it seems unreasonable to combine mana costs like that.


Prove that $ AB$ is a subgroup of order $mn$ if $m$ and $n$ are relatively prime.

If $A$ and $B$ are finite subgroups, of orders $m$ and $n$, respectively, of the abelian group $G$, Prove that $AB$ is a subgroup of order $mn$ if $m$ and $n$ are relatively prime. Definition: $AB=\{ab|a\in A, b\in B \}$   My attemptation: $A$ has $m$ elements, $B$ has $n$ elements. There are $mn$ representations of elements in $AB$. If some of them are equal or there exist $a,a'\in A, b, b'\in B$ such that $ab=a'b'$, then $AB$ has elements less than $mn$, if such elements do not exist then $AB$ has order of $mn$. Therefore we want to show that if $m$ and $n$ are relatively prime then such elements do not exist. Please show me how to do it. I think it has something to do with Lagrange's theorem and properties of prime numbers.


Can I set environment variables from code?

I am trying to install apche tomcat. There arises a need to set environment variable's , how can I set environment variable?  I tried using ProcessBuilder but it doesn't work:  ProcessBuilder pb = new ProcessBuilder("CMD.exe", "/C", "SET"); // SET prints out the environment variables   pb.redirectErrorStream(true);   Map<String,String> env = pb.environment();   String path = env.get("CATALINA_HOME") + apachePath; env.put("CATALINA_HOME", path);   Process process = null; try {     process = pb.start(); } catch (IOException e) {     // TODO Auto-generated catch block     e.printStackTrace(); }


Is there any way to view saved wifi passwords on the iPhone?

I've previously connected to a wifi network on my iPhone but I've no way of finding out the password. So is there any way to view saved wifi passwords on the iPhone?


prove a subset of a given Hilbert space $X$ is convergent in norm.

Assume $\{x,x_1,x_2,\ldots\}$ is a subset of a given Hilbert space $X$ with norm $||\cdot||$ such that $x_j$ converges to $x$ weakly and $||x_j||$ converges to $||x||$. Prove that $x_j$ converges to $x$ in norm.  For this question, I think that since $X$ is a Hilbert space, then $||x||$ is equal to the root of the inner product $\langle x,x\rangle$, $||x_j||$ is equal to the root of $\langle x_j,x_j\rangle$, so the root of $\langle x_j,x_j\rangle$ converges to root of $\langle x,x\rangle$.  Does this mean $\langle x_j,x_j\rangle$ converges to $\langle x,x\rangle$?   For my main question, I hope to get a counterexample if $\{x,x1,x2,\ldots\}$ is a subset of a Banach space. Thanks a lot.


How to set resolution according to a given scale in OpenLayers

This is a followup to .  What I know is:    given the papersize, I can calculate how many pixels for a given DPI fill a millimeter (dpi * 1/25.4) =pixelpermilimeter the number of pixels needed to represent one meter could be calculated via getPointResolution()*proj.getMetersPerUnit() =pixeltomapmeter the scale is given as 1000 * pixelpermilimeter * pixeltomapmeter   From the issue mentioned above, I learned, that with a given papersize and a given screensize, I could set the resolution to fit the paper as follows:   map.getView().setResolution(resolution / scaling);   where resolution is the map resolution and scaling as the quotient of one map dimension in relation to the paper dimension.   What I am looking for is a way to determine the correct mapsize / resolution /  scaling such, that a given scale is printed on paper.   Say the scale is 1:10000, I need the center of the map printed such, that 1 cm represents 100m.  Does that make sense?  I think, I have the dots, but I am not able to connect them in the right way.


I am trying to grep a string from a file but grep returns nothing (even though the string is present in the file). It turned out that the file starts with a ÿþ mark. If I remove it manually then grep works. How do I make grep work without manually removing the BOM?


Pokemon go with android doesn't let me even log in

I have two options to log in with Google or trainer club. I choose Google and then nothing happens. Screen is with spinning poke ball in the middle of the screen and nothing. Tried reinstalling clearing cache even made full restore to factory setting. I'm on Samsung Galaxy Note 4 910T. edit I created trainer club account and I still cannot connect even log in...


What happens when you click to re-open a Java application if it was hidden when closed?

I have a GUI application that I made and I wanted it to run in the background if it was closed so I simply set it's default close operation to be HIDE_ON_CLOSE and it will add a tray icon which will re-open the window when clicked. However, I want to make sure the same thing happens if I click on the desktop icon of my java application (I want it to just set the frame to visible) instead of going through its normal start procedures. Will this happen by default if I have hidden my JFrame? Thanks


Can someone please help me to prove this:  Prove that $1+x+x^2+x^3+x^4+x^5+x^6$ is irreducible in Q[X]


How many $4$ digit even numbers have all $4$ digits distinct?

How many $4$ digit even numbers have all $4$ digits distinct ?   This question has been asked if we replace even with positive.   I was solving this Problem like: For first position $1-9$ (No $0$) for next $0-9$ (leaving out the digit which has been choose) for next $0-9$ (leaving out $2$ digits), but on last digit I get stuck. From what I should choose. Will it be $0, 2, 4, 6, 8$, because number needs to be even? How should I solve it?


Can't use PHP extension Mcrypt in Ubuntu 13.10 (Nginx, PHP-FPM)

I installed a fresh Ubuntu 13.10 on my laptop. Like I usually do, I install the packages I need for Web development, which are nginx, php5-fpm, mysql, php5-mysql, php5-mcrypt and a few others.  After editing some configuration files, this usually works.  But today, since 13.10, an error appears instead of the Web page I expected.  Laravel requires the Mcrypt PHP extension.    The package php5-mcrypt has been installed and reinstalled.  The command php -m doesn't seem to show mcrypt.  Any idea where the problem could come from? I've done this setup many times and it always worked.


I am trying to build a pool on top of a plane, the pool goes below the plane, How can  I remove the part of the plane that is in the pool?


How do install package of R language's interpreter for statistical computing?

How to install the R language interpreter? What is the package name? I have tried R, rlang, Rlang, rproject, etc. but nothing works - neither apt-get nor Ubuntu Software Centre found R.  Is it possible that R is not included in the official Ubuntu repositories?


Is 64 bit Ubuntu stable for general use?

Are there still general problems using the Ubuntu 64bit version ? I heard that most of the programs do not work out of the box?  Will I notice a significant speed-boost? Until now I have always used Ubuntu 32 bit.


Relationship between $\star$-products in phase-space QM and NC geometry

What exactly is the relationship between $\star$-products in phase-space quantum mechanics, i.e.  $$ (f \star g) (x,p) = f(x,p) e^{\frac{i \hbar}{2} ( \overleftarrow{\partial_x} \cdot \overrightarrow{\partial_p} - \overleftarrow{\partial_p} \cdot \overrightarrow{\partial_x})} g(x,p) ~,$$ and $\star$-products in $2n$-dimensional non-commutative spaces, i.e.,  $$ (f \star g) (X) = \left . e^{\frac{i\hbar}{2} \theta^{\mu\nu} \frac{\partial}{\partial X^\mu}\frac{\partial}{\partial Y^\nu}} f(X) g(Y)\right \vert_{Y \to X}  ~~,$$ where $\theta^{\mu\nu}$ is a constant anti-symmetric tensor?  To be a bit more specific, is there a way to reinterpret/reformulate the phase-space non-commutativity as spatial non-commutative geometry? Or something of that sort.


Binary tree filling (NullPointerException)

I need to fill a binary tree using only class Node with recursion. However when I try to use left and right children I get a NullPointerException. How should I fix it?  public class Node {      private Integer key;     public Node right;     public Node left;      public void addValue(Integer value) {         if (key == null) {             key = value;             right = null;             left = null;         } else {             if (key > value) {                 left.addValue(value);                 left.right = null;                 left.left = null;             } else {                 right.addValue(value);                 right.right = null;                 right.left = null;             }         }     } }  public class Main { public static void main(String[] args) {     Node node = new Node();     node.addValue(5);     node.addValue(4);     node.addValue(3);     node.addValue(2);     node.addValue(1); }   }


Help with finding $\int_0^\infty \frac{\arctan(x)\log(x^2+1)}{x(x^2+1)}$

I am trying to evaluate $$\int_0^\infty \frac{\arctan(x)\log(x^2+1)}{x(x^2+1)}$$ I have tried differentiating under the integral sign, with different parameters, as well as contour integration, but I have not succeeded with neither of them. Wolfram Alpha gives a numerical value $\approx 0.754694$, but I suspect that there is a more exact answer.  I would be very glad to get some hints on how to solve it.


How to get the Country according to a certain IP?

Does anyone know any simple way to retrieve the country from a given IP Address, preferably in ISO_3166-1 format?


Is "most" equivalent to "a majority of"?

In sentences such as the following, how is most best understood?       1) Most children do not like cauliflower.        2) Most of the balls in the bucket are red.   I suppose there are three or more possible interpretations for most in these sentences.     A) a plurality (at least one more than any other alternative)        B) a majority (more than half, even if barely more)        C) a comfortable majority (well more than half)   For sentence 1, interpretations A and B would be equivalent since there are only two alternatives.


Temporary failure resolving 'es.archive.ubuntu.com' on Ubuntu Server

I have an Ubuntu server, but when I try to update I get this error  Err:1 http://es.archive.ubuntu.com/ubuntu artful InRelease Temporary failure resolving 'es.archive.ubuntu.com'   I know that the problem is DNS.  This is the content of /etc/network/interfaces  # This file describes the network interfaces available on your system # and how to activate them. For more information, see interfaces(5).  source /etc/network/interfaces.d/*  # The loopback network interface auto lo iface lo inet loopback  # The primary network interface auto eno1 iface eno1 inet static address 175.23.11.2 netmask 255.255.255.0 gateway 175.23.11.1 dns-nameservers 8.8.8.8 8.8.4.4   With ifconfig this is what I see:  eno1  Link encap:Ethernet  HWaddr a4:ba:db:32:f5:18         inet addr:175.23.11.2  Bcast:172.21.11.255  Mask:255.255.255.0       inet6 addr: fe80::a6ba:dbff:fe32:f518/64 Scope:Link       UP BROADCAST RUNNING MULTICAST  MTU:1500  Metric:1       RX packets:3269550 errors:0 dropped:35950 overruns:0 frame:0       TX packets:45180 errors:0 dropped:0 overruns:0 carrier:0       collisions:0 txqueuelen:1000        RX bytes:243192512 (243.1 MB)  TX bytes:65765157 (65.7 MB)       Interrupt:16   Everything looks great but doesn't work.  root@server:/etc/network# ping 8.8.8.8 PING 8.8.8.8 (8.8.8.8) 56(84) bytes of data. 64 bytes from 8.8.8.8: icmp_seq=2 ttl=54 time=4.11 ms  root@server:/etc/network# ping google.com ping: unknown host google.com root@server:/etc/network# ping www.google.com ping: unknown host www.google.com   My resolv.conf is empty because the DNS conf is in interfaces file instead  Note: I have this file resolv.conf but not resolvconf.  How can I fix this?


I bought a laptop that came with Windows 8 on it.  Used another laptop running Linux mint and the dd command to make a ubuntu bootable USB and thats what I'm running now.  I want to create a Windows 10 bootable USB on my Ubuntu machine but I'll be damned if I can get this thing working.  I downloaded a fresh .iso from microsoft (and tried three others I had on hand, including a Windows 7 .iso) and used the following procedure:  Created partition table on the USB drive (Tried msdos and gpt) and formatted a new partition (Tried NTFS and FAT32).  Flagged partition as bootable within gparted.  Unmounted the partition with:  sudo umount /dev/sdb1  Copied Win10 image over to the drive with:  sudo dd if=Win10.iso of=/dev/sdb && sync  Now when I reboot and try to boot to the USB I get no error messages it just boots right into my Ubuntu installation on my hard drive.  Funny thing is if I plug in my Ubuntu bootable USB it works just fine.  Any ideas on what the problem could be?


Regex for all strings not containing a string?

Ok, so this is something completely stupid but this is something I simply never learned to do and its a hassle.  How do I specify a string that does not contain a sequence of other characters.  For example I want to match all lines that do NOT end in '.config'  I would think that I could just do  .*[^(\.config)]$   but this doesn't work (why not?)  I know I can do  .*[^\.][^c][^o][^n][^f][^i][^g]$   but please please please tell me that there is a better way


can I change the date of travel to the UK after filling out the online form?

After filling out my online form I had to change the date of my travel to UK, what can I do?


I'm looking for some Linux alternative to  (image viewer). At best, it should have all its features, the same controls (both mouse and kbd) or fully adjustable, and be as quick.  In particular (this list covers 95 % of my use cases):   Support for many formats, for both input and output Automatic navigation through the directory with Space and Backspace Thumbnails (T) Batch processing (B) Rotating (R, L) Zoom with Ctrl + mouse wheel or + / - Fullscreen (Enter) Image movement with PgUp and PgDn, Home. End Select a rectagle with a mouse -> Ctrl + Y to crop -> Ctrl + S to save as a PNG file Basic image editation - copy, cut, paste, color filters, text input, basic shapes Immediate startup No need to play video or audio   Etc... IrfanView is something like iPhone amongst image viewers, there's nothing to change ;-)  So - what is as close as possible?  Edit: No virtualization please - IrfanView crashes under  in my environment; running virtualized Windows is even further away from being quick; perhaps it could be Java, but native is native.


Is there a way to detect what program is stealing focus on my Mac?

I've got a problem with some app on my Mac stealing the keyboard focus (the current window's title bar becomes inactive). However, it is not actually putting up any windows or menu bar of its own, and it does not respond identifiably to keyboard shortcuts.  Is there a way to determine what application has the keyboard focus even if it is one of those which has no menu bar or Dock icon? I know of one built-in feature that almost does this; the Force Quit dialog, if invoked from the keyboard, will open with the focused application selected. However, it only lists normal has-a-dock-icon applications, so it doesn't help in this case.  This started occurring around the time when I upgraded from 10.8 to 10.9; I suspect that one of the apps I already had installed, or upgraded along with the OS, is newly misbehaving.  I am open to solutions involving a small amount of programming (or AppleScript, say), use of developer tools, etc.; but not ones like “Uninstall things until it goes away” because that would be excessively disruptive at the moment. I'd like to definitively identify the application and file a bug report or fix its configuration.  My research has only turned up a couple of threads requesting the same on Apple Support Communities which did not contain an answer.


Minecraft execute as armor stand unless other armor stand in distance

im trying to create a type of conveyor belts for minecraft, therefore im using command like   execute as @e[type=minecraft:armor_stand] if block ~.4 ~-1 ~-.4 minecraft:carved_pumpkin[facing=south] if block ~-.4 ~-1 ~-.4 minecraft:carved_pumpkin[facing=south] run tp ~ ~ ~.1  With this command I'm moving the armorstand (in this case) south, where it gets catched by another commandblock for another direction. Although I want to queue them up, when there is already a armor stand in front. For example when my conveyor belt ends or there is a wall, they should queue up. I thought this could be done by adding the following:  unless entity @e[type=minecraft:armor_stand,distance=1]  As far as I understood this, I thought it'll run the command above, unless there is an armor stand in a radius of 1 block. It doesn't seem to work though. Am I missing something or just didn't use the unless part correctly?


I'd like to create a table as below.     How can I do it with latex?


error "latexdiff: The Perl Script could not be found."

I have MikTeX 2.9 installation and Strawberry Perl 5.10.1.5.   All the latexdiff, latexdiff-fast, latexidff-so paths seem to be present in the scripts.ini file and their .exe files in the miktex/bin/x64.  Somehow when I try to run latexdiff command in the directory where the two versions of .tex files are present, I get this error  latexdiff: The Perl script could not be found.  latexdiff: Data: scripts/latexdiff/perl/latexdiff.pl   When I run the command, a pop-up window asks for installation of latexdiff.pl and I press ok, but it ends up in the error shown above. I followed some posts with similar problem, but couldn't find a solution.  Any help would be appreciated.


How to count the number of times a reference was cited?

I used the command \ cite in my entire thesis. I cannot count the number of times that each reference appears in the thesis after being described in the Bibliographic References as shown in the Figure below. How to make?


How to cross-reference labels in the text using LyX?

I'm having trouble using labels and cross-referencing in Lyx.  I put a label into the document where I want it.  It is not embedded in anything, it's just in the text.  Then I put a cross-reference to link it at a different point in the paper.  When I make the pdf, the cross-reference does not go to the link but rather to the top of the section it's in.  What going on?  However, within Lyx, whenever I use the (Navigate Bar -> Other Lists -> Labels and References) then the reference appears to work fine.  It's just not working in the pdf..  What could be the problem?  Thank you in advance!


Merge partitions after windows installation failure

After windows failed to install, I was left with my partition, which bootcamp was supposed to remove but it froze and I exited it (probably not the brightest idea ever). So now I have these extra partitions and I'm trying to merge them back into my main disk, like how it was before the windows installation.   I've tried looking online at what to do but the (-) option that most sites seem to suggest using is greyed out, and would highly appreciate anyone who could help me.   I've attached screenshots of my disk information. I have the 2017 iMac, with Mojave installed.


How do I find what command created an existing window?

In the system monitor application (gnome-system-monitor), there is a column titled "Command Line" that gives the command (complete with arguments) that was used to create that window.   Is there a command that allows you to select a window via clicking (like xkill), then returns the command called for that window?


I'm developing an Android App using Xamarin Android. Implementing the UI, I've a loop creating some buttons and it's handlers. My problem is thar whenever the handler is executed, the primitive value passed into the method is the reference of the outter value (i).  private void MyUiMethod(){     var i = 0;   foreach(var item in itemList){     var data = new MyCustomData();     var button = new Button();     button.Click = (s, e) => ButtonClick(s, e, data, i);     i++;   } }  private void ButtClick(object s, EventArgs e, MyCustomData data, int index){   // HERE ALWAYS THE VALUE OF INDEX IS THE LAST VALUE   // e.g. If the list has 3 items, index = 3 no matter the button I've clicked;  }   Any suggestions?


Ubuntu thinks I have a manually installed driver

Ubuntu seems to think I have a manually installed driver when I am using the default drivers (Nouveau) and therefore I cannot switch to the other Nvidia drivers. I want to install them this way and not manually so is there any way I can make Ubuntu realise I do not have any manually installed drivers.


I recently looked at some  relating to this topic but as far as I can tell there is currently not a working plugin or script for QGIS 2.0 to achieve a four color theorem for styling polygon vector data (it doesn't necessarily have to be 4 colors, just so that each neighboring polygon is a different color, though keeping it at a minimum number of 4-6 colors would be elegant).


How do I find the Truth Table for Mealy State Machine?

This is a followup to : I have this assignment in college:  You are to design a Mealy state diagram for a safety device. Assume that two debounced push-buttons, A and B, are available to enter the combination. An electromechanical interlock guarantees that the buttons cannot be activated simultaneously. The lock should have the following features: The combination is A-A-B-A-B-A. If this sequence is correctly entered, an output signal is asserted that causes the lock to open. For any state, three B pulses in a row should guarantee to reset the control to its initial state. When any out-of-sequence use of the A push-button occurs, an output is asserted that rings a bell to warn that the lock is being tampered with. Once the lock is open, pressing either A or B will cause the lock to close without signaling an error. Draw a Mealy state diagram for this finite state machine. Indicate what each state represents and what input conditions cause state and output changes. Not everything may have been specified, so write down any assumptions you make.  I have to implement this Mealy machine using D flip-flops and MUX'es. I have 10 states for my machine: S0 -> "Input Start" // Nothing happened S1 -> A S2 -> AA S3 -> AAB S4 -> AABA S5 -> AABAB S6 -> AABABA -> this means EXIT S7 -> B S8 -> BB S9 -> A -> "ALARM ON"  *****Machine States   DIFFERENCE: -> My request is if somebody can show me the way to do the Truth Table for this machine please?


I use Debian 7 and have installed a virtual host with address sub.domain.com following this tutorial:   I have enabled it, rebooted the PC but still the subdomain opens /var/www  Here is the file contents of the file named "sub.domain.com", located at /etc/apache2/sites-available/ :  <VirtualHost *>     ServerName sub.domain.com     DocumentRoot /usr/share/destfolder     ServerAdmin info@domain.com     ErrorLog /var/log/apache2/sub.domain.com-error_log     CustomLog /var/log/apache2/sub.domain.com-access_log common </VirtualHost>   By the way when I reload apache's configuration, I get: NameVirtualHost *:80 has no VirtualHosts  Any suggestions?


Johansen Cointegration on a stationary time series?

Following question. Assume we have 6 variables  A - stationary at level . I(0) B - stationary at level . I(0) C - stationary at level . I(0) D - stationary at level . I(0) E - stationary at level . I(0) F - stationary at level . I(1)   We applied a Granger Wald test to   A - B with the result that A causes B. Unidirectional. C - D with the result that C causes D. Unidirectional. E - F No causality. For this test, we applied a VECM Granger testing model,       since F was I(1).   Question:  Is it okay to also test A + B and C + D for Johansen cointegration, though they are both I(0), i.e. stationary at level? We tested E + F for cointegration with each first differences. The point: The results of cointegration were very much the same as for the Granger Wald test.   A - B existence of cointegration vector. C - D existence of cointegration vector. E - F no existence of cointegration vector.   I only wonder why I should maybe not test A + B and C + D with Johansen, or if it's nonsense once both variables are I(0).


How to show that $(\mathbf{p} \cdot \mathbf{q})^2 + \|\mathbf{p} \times \mathbf{q}\|^2 = \|\mathbf{p}\|^2\|\mathbf{q}\|^2$

How to show that $$(\mathbf{p} \cdot \mathbf{q})^2 + \|\mathbf{p} \times \mathbf{q}\|^2 = \|\mathbf{p}\|^2\|\mathbf{q}\|^2$$ for vectors $\mathbf{p}, \mathbf{q} \in \mathbb{R}$.


I have Minecraft PC on my computer, which is on Windows 7. We are upgrading to Windows 10.  My question is, can I play my current version on Windows 10, or must I play the Windows 10 Pocket Edition Style gameplay? If I must have the Windows 10 edition, do I have to buy it, or will it be free since I bought regular Minecraft?


I have a linux server with tomcat and MySql installed on it, with axis2 as well.  At first I started with ~400MB allocated I deployed my project and still memory allocation was the same.  But then I tried to use Log4j, which I think caused the problem. Problem is that not I have ~800MB allocated. Then I removed the service I deployed and still 800MB allocated.  What have I done wrong? How can I check what have done wrong and fix it?  Thanks Yoav


cURL sftp not supported or disabled in libcurl

I am trying to use sftp with cURL to upload files to my webserver, if I run curl -V on my server I get this output   curl 7.47.0 (i686-pc-linux-gnu) libcurl/7.47.0 zlib/1.2.8 libssh2/1.8.0 Protocols: dict file ftp gopher http imap pop3 rtsp scp sftp smtp telnet tftp Features: IPv6 Largefile libz UnixSockets   But if I try to upload files to my server using sftp:// for the curl URL I get this output after adding the -v option to the curl command:   * Protocol sftp not supported or disabled in libcurl * Closing connection -1 curl: (1) Protocol sftp not supported or disabled in libcurl   To install cURL with the SFTP protocol I used these instructions .


Is there any way to add backgrounds in Blender 2.8?

In 2.8, there is no background image option:     I am aware of the alternatives like putting an image in a empty or the image directly to the camera. But is there like an addon or something I similar that I can do?


What's the best way to parse command line arguments?

What's the easiest, tersest, and most flexible method or library for parsing Python command line arguments?


Why is sequence $(1+\frac{1}{n})^{n+1}$ descending?

I was studying the proof of $e$ number when I noticed something:  Why is the sequence $(1+\frac{1}{n})^{n+1}$ descending? It starts ascending with grater n but in one moment it starts descending? Why is that? On what $n$ this happens?  Edit: Let me try to rephrase the question... How come  that sequence $(1+\frac{1}{n})^n$ rises, but the sequence $(1+\frac{1}{n})^{n+1}$  falls, just because of the one more 1+1/n multiplication (power)?


Wrong user when logging into Data Explorer

I think I'm having the same issue as reported in this question:    When I log into SEDE with the same OpenID account I use for SE, a different user comes up ("James Wiseman" on Stack Exchange and "adsense" in Data Explorer).  Is there anything I can do personally to rectify this, or must I rely on the admins?


Timeout for Always On Synchronous Commit Mode

For SQL Server Enterprise's Always On availability groups, how can you configure the timeout for Synchronous Commit mode?  Is there a maximum?  Can it work, for example, between continents? Thanks


A good reference on optimal control theory

Ok, so I am reading about decision making and I came across this subject. Fortunately it has a  , but the point is I want to see some examples, and learn to solve regular problems of this field. Of course I can go for the book by Pontryagin but then I don't think that would be an educative book. Does anyone has a suggestion? I would be happy if it also covers LQ problems. P.S. I studied math, therefore I appreciate a book with rigorous approach to the subject.


Area 51 login issue after typing an incorrect password once

I also got  (which was previously closed as fixed), with a very long error message that had lots of red text overlapping other areas on the page. This error message was observed after typing an incorrect password once, and then a correct password. Some strings have been replaced by [stringX] for privacy, and a space has been added after each protocol to avoid autolinking. I was attempting to log in with my Stack Exchange account that I was already logged into on most other Stack Exchange  sites. The return_to parameter does not have the same protocol (HTTP vs HTTPS) as the "actual URL" and the latter also has a whole lot more in parameter information.  Unable to log in with your OpenID provider: The openid.return_to parameter (http:// area51.stackexchange.com/users/authenticate/?[string1]) does not match the actual URL (https:// area51.stackexchange.com/users/authenticate/?[string1]&openid.claimed_id=https%3A%2F%2Fopenid.stackexchange.com%2Fuser%2F[string2]&openid.identity=https%3A%2F%2Fopenid.stackexchange.com%2Fuser%2F[string2]&openid.sig=[string3]&openid.signed=claimed_id%2Cidentity%2Cassoc_handle%2Cop_endpoint%2Creturn_to%2Cresponse_nonce%2Cns.alias3%2Calias3.mode%2Calias3.type.alias1%2Calias3.value.alias1%2Calias3.type.alias2%2Calias3.value.alias2&openid.assoc_handle=[string4]&openid.op_endpoint=https%3A%2F%2Fopenid.stackexchange.com%2Fopenid%2Fprovider&openid.return_to=http%3A%2F%2Farea51.stackexchange.com%2Fusers%2Fauthenticate%2F[string5]%26dnoa.userSuppliedIdentifier%3Dhttps%253A%252F%252Fopenid.stackexchange.com%252Fuser%252F[string2]&openid.response_nonce=[string6]&openid.mode=id_res&openid.ns=http%3A%2F%2Fspecs.openid.net%2Fauth%2F2.0&openid.ns.alias3=http%3A%2F%2Fopenid.net%2Fsrv%2Fax%2F1.0&openid.alias3.mode=fetch_response&openid.alias3.type.alias1=http%3A%2F%2Faxschema.org%2Fcontact%2Femail&openid.alias3.value.alias1=[string7]&openid.alias3.type.alias2=http%3A%2F%2Faxschema.org%2FnamePerson&openid.alias3.value.alias2=[string8]) the request was made with.


I could substitute some strings by sed Next, I'd like to sed multiple strings by following Day='2020/12/1' Dir=/home/test/data i='test'  sql=$(sed "s|Day|$Day|g" < "$Dir/$code.sql") sql=$(sed "s|Id|$i|g" < "$Dir/$code.sql")  but it only substituteId. are there any way to achieve multiple substitution ? If someone has opinion,please let me know Thanks


What is the easiest way to draw a 3D cube with TikZ?

I'm trying to find the easiest way to draw a 3D cube (it's for my UML diagram) with TikZ. Could you please give an example?   Like this:


$(f_n)$ converges uniformly $\iff \|f_n-f\|_\infty=\sup\{|f_n(x)-f(x)|;\ x\in I\}$

I am trying to prove the following statement : $(f_n)$ converges uniformly $\iff \sup\{|f_n(x)-f(x)|;\ x\in I\}=\|f_n-f\|_\infty\to 0.$ $\implies$ : We have $\forall \epsilon \leq 0$ $\exists N$ $\forall n \leq N$ $\forall x \in I$ : $|f_n(x)-f(x)| \leq \epsilon$. We also have that $|f_n(x)-f(x)| \leq \sup\{|f_n(x)-f(x)|;\ x\in I\}$ but then I don't really see how to properly link it to the $\epsilon$. For $\leftarrow$, I fix an $\epsilon\geq 0$. Then there exists $n_0\in \mathbb{N}$ such that $$\forall n\geq n_0, \sup \{|f(x) - f_n(x)| : x \in I\}\leq \epsilon $$ Which implies, $$\forall n \leq n_0 |f(x) - f_n(x)|\leq \sup \{|f(x) - f_n(x)| : x \in I\}\leq \epsilon , \text{ for any } x\in I.$$ Hence, $f_n\rightarrow f $ as $n\rightarrow\infty$ uniformly. I don't know if I did it correctly though...


what is dialout group in ubuntu?what permissions do the memberships of this group have?I read about it that memberships can access to the serial devices. what are serial devices? thank you for your answers.


Hyperlinks to web sites using anchors sometimes don't work

I am not sure if this is an issue with how web sites are configured, or the hyperref pacakge.  The following two links are correct (which you can verify by copying the first paramater to \href{}{} and pasting in a browser.    \href{https://en.wikipedia.org/wiki/Global_warming#Regional_trends}{Climate Change: Regional Trends}  \href{http://www.imperial.ac.uk/a-z-research/#group-M}{A-Z Research: Group M}     However, clicking on the pdf file for the second link does not work.   It seems as if the offending link that is attempted to be opened is  http://www.imperial.ac.uk/a-z-research/%23group-M   where the # has been replaced with a %23.  However, the Wikipedia link seems to be displayed with the # in the URL.  So, is there anything I can do when generating the PDF to get both of these links to correctly work. Preferrably I can do this without having to manually click on the link and determine if tweaking is required.  Code:  \documentclass{article} \usepackage{hyperref}  \begin{document}  \href{https://en.wikipedia.org/wiki/Global_warming#Regional_trends}{Climate Change: Regional Trends}  \href{http://www.imperial.ac.uk/a-z-research/#group-M}{A-Z Research: Group M}  \end{document}


I'm trying to install the flashplayer plugin in the three steps shown on  but get the following message:  Package adobe-flashplugin is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source. E: Package 'adobe-flashplugin' has no installation cadidate.  I'm a total noobie when it comes to Linux, and I didn't bother at all with the DOS when using Windows OS, so what does this exactly mean? Can I install flash from somewhere else?  Jannike


What is the difference between "which" and "that? What should I use in the sentence?

What is the difference between which and that? For example, I have a sentence,  They describe different methods, which their company usually practices.  Which is better to use here — which or that?


I have been thinking about what would happen if by chance the photons collided with each other. I heard once that electromagnetic waves pass through each other without any interference.  I wanted to know if I am correct?  Does the collision produce sound?


How can I change the class of a button with javascript?

I have this code:  var image = button.getElementsByTagName("span")[0]; if (isEnabled) {     image.style.color = "#BBB" else {     image.style.color = "#AAA"   Can someone give me some advice on how instead of directly setting a color that I could set the button to have a 3rd class of enabled and then later set it to have a 3rd class of disabled?  Note that my button currently has classes like this:  class="fa fa-bold" class="fa fa-arrow"   etc.  So I would need the first two classes to be unchanged. Then I need to be able to set to like this:  class="fa fa-bold enabled" class="fa fa-bold disabled" class="fa fa-bold enabled"   etc.


Do natural weapons count for two weapon fighting?

Do natural weapons such as those granted by being a Tabaxi or an Aarakocra count for the purposes of two weapon fighting? Would they have the light property to allow it and if not what about if you take the dual wielder feat that removes the restriction on them being light?  From a logical perspective I would think claws or talons would be light enough to count and with them being "natural weapons" this means they are definitely weapons so it would make sense for them to be considered light and one handed.


I'm attempting to use the LyZ plugin for Zotero and LyX and it requires the LyX server to be present.  I've looked on the  for information and it makes reference to .lyxpipe.in and .lyxpipe.out but these are not present when I install LyX from the Ubuntu repository.  What are these files and how can they be created?


What's the best practice backup plan for AWS Account access?

I was thinking what if my AWS Account gets deleted or is inaccessible one day? Has anyone implemented a solution for this? Can we backup from one AWS account and restore to another AWS account?  Currently am using Skeddly to backup my AWS instances, which is again stored in AWS itself.  Any thoughts?


Score for question looks different than for answer

I  notice the font for question score seems to scale when it is 4 digits to fit rather than wrap. Same doesn't happen for answer though.   Noticed this on question


How can I stop YaCy from starting when my machine starts?

I have installed the YaCy P2P search engine following these instructions (adding the YaCy repo to my sources and installing from there):   That page includes instructions on starting/stopping the YaCy daemon:  sudo /etc/init.d/yacy stop sudo /etc/init.d/yacy start sudo /etc/init.d/yacy restart   I can stop YaCy right now, but it starts again the next time I boot up. How can I stop it doing that, and only start when I tell it to (with sudo /etc/init.d/yacy start)?  This Upstart technique to permanently disable a service (accepted answer at ) does not work (YaCy still starts next time I boot):  sudo sh -c "echo 'manual' > /etc/init/yacy.override" #doesn't work


Efficient way of writing the elements of a quotient group.

I am considering the normal subgroup $H=\langle[28]\rangle$ of the additive group $\mathbb{Z}_{220}$. I want to obtain the elements of the quotient group $\mathbb{Z_{220}}/H$. Since $H=\langle14[2]\rangle$, we have that $|H|=\frac{220}{\gcd(220,14)}=55$. Therefore, by Lagrange's theorem, $|\mathbb{Z}_{220}/H|=\frac{|\mathbb{Z}_{220}|}{|H|}=\frac{220}{55}=4$. So, I know that $\mathbb{Z}_{220}/H$ has four elements and one of them is $[0]+H$. The problem I encounter is that, for example, $[0]+H$ is the same as $[28]+H$. Because of this, I have to be careful when writing the other three elements to make sure that I am not making the mistake of writing twice the same element because it is written in two ways that "look different". If I wrote explicitly all $55$ elements of each element (maybe I should call it class or coset) of the quotient group then I would be sure I am not making that mistake. But this does not look very efficient. I was wondering if there might be some clever way of choosing the representative of each class so as to make sure there are no hidden repetitions. Thanks in advance.


Proving that: $\lim\limits_{n\to\infty} \left(\frac{a^{\frac{1}{n}}+b^{\frac{1}{n}}}{2}\right)^n =\sqrt{ab}$

Let $a$ and $b$ be positive reals. Show that $$\lim\limits_{n\to\infty} \left(\frac{a^{\frac{1}{n}}+b^{\frac{1}{n}}}{2}\right)^n =\sqrt{ab}$$


I recently installed version 14.04 on ubuntu laptop and sadly regretted it. Is it possible to downgrade back to 12.04 and if so, how?  Thanks


Triangle Inequality Proof: Show that:$||z_1|-|z_2||\leq |z_1+z_2|$

I've been puzzled by this deceptively simple-looking complex number modulus inequality proof.     Show that:$$||z_1|-|z_2||\leq |z_1+z_2|.$$ State the condition for the equality to hold.   I tried  $\because|z_1|\leq |z_1+z_2|+|z_2|$, by triangle inequality  $\therefore|z_1|-|z_2|\leq |z_1+z_2|$  but then I do not factor the modulus on LHS and my proof is insufficient. I thought I could simply take the modulus both sides, but then I realised that for say $5>-6$, applying modulus in this manner yields $5>6$ which is obviously wrong.  I feel like perhaps I need to express $z_1$ and $z_2$ as $r_1cis\theta_1$ , etc but I am unsure in how to approach this method.  Any help  would be greatly appreciated. Thanks in advance.


Does Immerwolf's bonus stay after it leaves the battlefield?

A little while ago I was playing two of my friends. One of my friends was playing a wolf/werewolf deck with  and a few other creatures out on the battlefield.  I was playing an enchantment deck and cast  on the Immerwolf. Once the spell resolved my friend didn't remove the +1/+1 from his other creatures (from Immerwolf's ability).    I reasoned that since they weren't actual +1/+1 counters, they would no longer affect his creatures, since Immerwolf was in exile.  He disagreed, saying that the +1/+1 would stay, whether or not Immerwolf was in play.    I didn't really feel like pushing the issue since it was just a kitchen table game and it also didn't really affect the outcome of the game.  I'm just curious as to who was correct.


A Mathematical Paradox About Probabilities

So - I am no math genius but I do have shower thoughts. And there is one thought about normal distribution that I just couldn't let go. I converted it into a little story to visualize it a little better. Let's see if it makes sense and if it really is a paradox I came up with. Here is the story:  A man is in court. He is said to have murdered someone. There is evidence that stats that he did it - but chances are it is all a coincidence. The judge comes up with a simple solution:  "Tomorrow at 8am on market square - you are to toss a coin. Head and your head comes off - tails and you go home a free man. Let the gods decide whether you are to die or not."  The man gladly accepts this offer. You must know - even though it is the middle ages, he is a mathematican - not one to believe in gods. And he also knows probabilites and thinks he has a way of how to manipulate those.  The man takes his fate deciding coin home with him and begins tossing it all night.  The morning comes and everyone is waiting on market square. It is 8 am sharp and the man, as promised shows up with his coin in his hand. He is very confident, because he knows - his chances of dying are at about 0.1 %.  In front of everybody, he tosses the coin and: tails. Then man is free to go. Not even the tiniest bit nervous about his fate.  How was that possible?  He must have known that his chances where 50 - 50 (assuming the coin cannot land on its edge and will always be tossed and flipped randomly).   Well, here is the thing that I cannot explain:  Last night, the man was home - as I said - flipping his coin over and over again. Since this is a normal distribution, in within the first 10 tosses, the coin showed head 5 times, and tails 5 times. But, after many, many tosses - the coin finally showed head 9 times in a row. This happening comes with a likelihood of 0.2% (according to one of those tree-diagrams). Now - for the 10th time, the chances of head again would be only 0.1% percent if I am not mistaken. Now - in my eyes: All the man had to do was to NOT throw that coin again until his fate was about to be decided - because heads again? That would be insanly unlikely - wouldn't it be?  So, that is my paradox. A random coin toss cannot be manipulated only by waiting for it to be unlikely to show a certain outcome over and over again - or can it?   Thanks for reading my little story :) I hope you guys understand what I am trying to convey here :)


He wasn't human, nor did he feel any affection towards anyone. Now that we know his body was human enough for him to reproduce, why did he do it? If he just wanted to carry his bloodline forward, why then and not earlier? If it was a mistake, why was he fooling around in the first place? Bellatrix was a married woman, so I can't imagine him wanting to indulge in shenanigans with her when he could've easily Imperiused anyone in to being with him, because he didn't necessarily require a partner that loved him. The above applies even if he was just feeling curious or missed the sexual activity.


Trouble in installing 3rd party software in ubuntu 16.10

trouble to install 3rd party software in ubuntu 16.10. I recently download the Teamviewer .deb file and try to install through package installer ... it denied to install ... I don't know why ... and second thing is that while update the software it suggest to off the 3rd party software .


Trying to prove that $\lim_{N \rightarrow \infty} \frac{1}{N} \Sigma_{n=1}^N f(n\alpha) = \int_0^1 f(x) dx$

Let $\alpha$ be an irrational number. Let $f: \mathbb{R} \rightarrow \mathbb{C}$ be a continuous periodic function with period 1. Show that $\lim_{N \rightarrow \infty} \frac{1}{N} \Sigma_{n=1}^N f(n\alpha) = \int_0^1 f(x)\,dx$  The beginning (but probably not the end) of my confusion with this problem has to do with the irrational inputs. Why would that be necessary? Any help is appreciated!


I downloaded Ubuntu 18.04 and a bunch of folders are seen. What do I click on to install it after I download it?


I know that there are closed forms for $\sum_{k=0}^n \binom{n}{k}^2 = \binom{2n}{n}$ and a similar one for $\sum_{k=0}^n k \binom{n}{k}$.  Is there a known closed form for $\sum_{k=0}^n k\binom{n}{k}^2$?


Were the orcs of Minas Morgul created by the Witch King?

In the Return of the King, there are the orcs that come from Minas Morgul. Were they produced in Mordor and transferred there, or were they actually created in Minas Morgul by the Witch King?


Is a URL with a query string better or worse for SEO then one without one?

I want to know, is there a huge difference in terms of SEO between these URLs:  example.com/ontario/toronto/listings   or  example.com/listings.php?p=ontario&c=toronto   Will one URL rank higher than the other? Is there a huge difference here?


prove Eckart-Young-Minsky theorem for Frobinius norm.

I was following the proof on :  $\| A-A_k \|^2_F = \| \sum_{i=k+1}^n \sigma_iu_iv_i^{\top} \|_F^2= \|U \Sigma V^{\top}\|_F^2= \| \Sigma \|_F^2=\sum_{i=k+1}^n \sigma_i^2$.  Notice that applying triangle inequality to the spectral norm of $A$, we get that   if $A=A'+A''$ then $\sigma_1(A) \leq \sigma_1(A')+\sigma_1(A'')$  \ We then have  $\sigma_i(A')+\sigma_j(A'')=\sigma_1(A'-A'_{i-1})+\sigma_1(A''-A''_{j-1}) \geq \sigma_1(A-A'_{i-1}-A''_{j-1}) $  Then they said: $\sigma_1(A-A'_{i-1}-A''_{j-1}) \geq \sigma_1(A-A_{i+j-2})$. I got lost here.


Computing $\lim_{n \to \infty} \int_0^{n^2} e^{-x^2}n\sin\frac{x}{n}\,dx$?

I am trying to compute this integral/limit, I don't feel like I have any good insight...   $$\lim_{n \to \infty} \int_0^{n^2} e^{-x^2}n\sin\frac{x}{n} \, dx.$$  I have tried to make a change of variable to get rid of the $n^2$, I changed to $X=\frac{x}{n^2}$ but got something even worse, I've tried to reach a situation where I could use a convergence theorem for Lebesgue Integrals,... I'm not sure I'm even on the right track!  Could you give me a hint on how to start this?  Thank you very much!


Conflict between TikZ and university thesis class file

When compiling a document using my university's thesis class file and the TikZ package I receive an error message (missing number, treated as zero). Would someone know how I can solve this problem?   \documentclass[phd,bottom,nosig]{usbthesis} \usepackage{tikz} \begin{document} Test 1-2-3 \end{document}   The class file can be found here:


How to test for if all players of a particular team are on a particular area?

I'm making a minigame map in Minecraft and I cant figure out how can I test if all players from a particular team are in a particular area using Command Blocks (with a radius of 8 blocks, if all players are present the Command Block should give a Redstone output). Can someone help me by providing the correct Minecraft command?


I got a new computer (Dell inspiron 3000 series) was a system of Ubuntu I turned it on Windows 7 . I want to have again the old system what to do. ?


Should Schema.org Organization data about my company be on every page?

We have added JSON-LD structured data to our website, so Google knows information about our company (company name, url, logo, address, etc.). We worked from the template on Google's .  One thing I couldn't find an answer to is where exactly should this JSON-LD snippet be included on our website? Right now, I only have it on our home page. I didn't know if it would look bad to search engines to have the Organization markup on every single page. But is there any recommendation?  Should Organization markup about our company be included on every page or only on certain pages?


Finding a clear difference between truth and fact

I have been starting back in school after a long hiatus.  In one of my classes, a discussion of Truth began.  The problem I have had is that no one seems to have a solid definition between the two.   My earlier training and schooling left me with this definition, and I would like some feedback.  Fact - A point of data that can be directly qualified/quantified through confirmed, standardized measurement.  Truth - A point of data not directly qualified/quantified through confirmed, standardized measurement.  So fact would be that ice cream is cold, as we can place a measurement of the temperature.  Ice cream being tasty would be truth, as it is impossible to accurately measure "tasty".  Please let me know your thoughts.


my menu material is different from most people's menus on the internet, how to replace it?

This is my material menu look like    meanwhile this is most people material menu look like in most youtube tutorials


I am working on a program that needs a high level of accuracy. Unfortunately when I run a simple code such as this:  65.2805151+66.5374849  the result is 131.81799999999998  Instead of a 131.818  How can I go about addressing this issue?


Example of a group $G$ such that $G = N_1\cdots N_n$ and $N_i \cap N_j = \{e\}$ for all $i \neq j$ but $G$ is not the internal direct product of them.

I was trying to find an example of a group $G$ and normal subgroups $N_1 , \ldots , N_n$ such that $G = N_1\cdots N_n$ and $N_i \cap N_j = \{e\}$ for all $i \neq j$ and yet $G$ is not the internal direct product of  $N_1, \ldots , N_n$ .  It is easy to show that G is the internal direct product of normal subgroups $N_1 , \ldots , N_n$ iff  (i) $G = N_1\cdots N_n$  (ii) $N_i\cap (N_1 \cdots N_{i-1}\cdots N_{i+1} \cdots N_n) = \{e\}$ for $i = 1, 2, \ldots, n$.  So I guess the question boils down to produce an example of a group $G$ and its normal subgroups  $N_1 , \ldots , N_n$ such that   (1) $G = N_1\cdots N_n$  (2) $N_i \cap N_j = \{e\}$ for all $i \neq j$   but     (3) $N_i \cap (N_1 \cdots N_{i-1} N_{i+1} \cdots N_n) \neq \{e\}$ for at least one $1 \le i \le n.$ Thanks in advance for help....


What is the tense of "I would have been happy to..."?

I would have been happy to let you use the money, if you would give me a date to leave.   Is this a past present tense?  I need to explain this statement I made, correctly.


Can ssh (agent) work with two separate identities?

I use an Ubuntu 14.10 distribution, and two private keys, one encrypted (~/.ssh/E.key), and one not encrypted (~/.ssh/NE.key), which I use for accessing two github repositories, respectively, repoE and repoNE.  I use the common trick of aliasing gitbhub.com to two different domains, which are mapped to the respective ssh keys.  Content (only relevant) of ~/.ssh/config:  Host github.com-E   Hostname github.com   IdentityFile ~/.ssh/E.key  Host github.com-NE   Hostname github.com   IdentityFile ~/.ssh/NE.key   Content (only relevant) of local repository configurations:  # /path/to/repoE/.git/config:  [remote "origin"]   url = git@github.com-E:organizationE/repoE.git  # /path/to/repoNE/.git/config:  [remote "origin"]   url = git@github.com-NE:organizationNE/repoNE.git   I use ssh-add, so that I don't need to type the passphrase for any access to repoE.  The problem is that apparently, only the first key I add is used (I can see the offer from the ssh client log).  This is for example a sample run:  $ ssh-add ~/.ssh/E.key  # I can now access repoE, but not repoNE  $ ssh-add ~/.ssh/NE.key  # Still the same (I can access repoE, but not repoNE)  $ ssh-add -D  $ ssh-add ~/.ssh/NE.key  # I can now access repoNE, but not repoE  $ ssh-add ~/.ssh/E.key  # Still the same (I can access repoNE, but not repoE)


Cannot change password for local account

I have a non-root, local account where I have been unable to use 'passwd' as user root to change that password.  The system is an AWS instance running Ubuntu 14.04 bound to Active Directory using both kerberos and LDAP.  I can become root on the instance.  The account had a UID above 10000.  Initially I received the error below from passwd:  Current Kerberos password: passwd: Authentication token manipulation error passwd: password unchanged   After reading some posts, I used usermod to change the UID for the account to 601 - a value below the minimum set in /etc/pam.d/common-password.  After the change I am no longer prompted for the Kerberos password, however I still receive an error.  The new error message occurs after I have entered the new password and confirmed.  Enter new password: Retype new password: passwd: Authentication token manipulation error passwd: password unchanged   Unfortunately, removing LDAP or Kerberos packages are not options.  A snippet for the configuration in PAM for /etc/pam.d/common-password related to UIDs and unix/krb5/ldap is below.  password        [success=3 default=ignore]      pam_unix.so obscure use_authtok try_first_pass sha512 password        [success=2 default=ignore]      pam_krb5.so minimum_uid=1000 password        [success=1 user_unknown=ignore default=die]     pam_ldap.so use_authtok try_first_pass   I have confirmed that the account only exists locally.  It is not present in Active Directory.  Ideally I would prefer not to hack around the problem by generating the password via mkpasswd or similar tool and would prefer /usr/bin/passwd to manipulate the correct account in the correct database.    Suggestions are welcome.


Every element of $S_n$ can be written as a product of transpositions of the form $(1 i )$, for various $i$

Let $n \geq 2$. Show that every element of $S_n$ can be written as a product of transpositions of the form $(1 i )$, for various $i$.  I have proved by induction that if $n \geq 2$, then every permutation in $S_n$ is a product of transpositions. Using the following, if $\sigma=(123\cdots k ) $ then $(123\cdots k )= (1k)(1(k-1))\cdots(12)$. But I don't know how to relate what I have to this exercise.  How could I finish the proof?


Why is my object updating when its source variable changes?

I am still leaning Javascript and I encountered twice a behavior I didn't expect. I would like to understand why it happens and what I should learn to understand it better. : I tried to call a function using a file input filelist as argument. Right after I call my function, I set to null the file input value. In my function, I use a callback that can't get back my fileList since the file input is reseted. What I don't understand: I expected the file list object to be somehow "copied" once it was sent to the function. Why changing the original object affects the callback? Second case: I use a JSON object called values to store, well, values. I iterate on a collection and update a name field of my values object using the iteration index before inserting the values object inside another JSON object. See the code: var myBaseName = "file" _.each (myCollection, function(file, i){     values.name = myBaseName  + " - " + i     console.log(values.name); //here the name appears correctly,                                //i.e. "file - 0", "file - 1"...     values.size = file.size,     values.type = file.type,     allFiles[i]=values;  }); console.log (allFiles);//here the name appears as the last set,                         //i.e. if my collection has 2 objects;                         //they both appear as "file - 1"  What I don't understand: Why is it updating and not simply copied? This is, I expect, the same kind of mechanism than in my first case. I used to code in .net and I never encountered such a behavior. I expected a json object to be some kind of enhanced string.


How to make all number combinations of numbers below a certain numpy array of integers

I have a certain numpy array of integers and I want to make an array of arrays that contains all combinations of numbers below it. As an example, [2,3] would yield   [[1,1],[2,1],[1,2],[2,2],[1,3],[3,3]]    because that would be all the combinations of arrays with numbers less than or equal to [2,3].


How can I show that if the second fundamental form of a surface is identically equal to zero, then the surface is a plane?

This is my question:  Let P be a plane considered as a surface in 3-space. Show that its second fundamental form is zero. Conversely, show that if the second fundamental form of a surface is identically zero then the surface is a plane.  So far I have that the general equation of the plane is $$ax+by+cz+d=0.$$ Then $$M(u,v)=(u,v,\alpha u + \beta v + \gamma),$$ where $a,b,c,d,\alpha,\beta, \gamma$ are all constants and $c\not=0$. Then $M_u=(1,0,\alpha)$ and $M_v=(0,1,\beta)$. I know that $\vec{n} =\frac{M_u \times M_v}{|M_u \times M_v|}$ which gives $$ \vec{n}=\frac{(-\alpha,-\beta, 1)}{\sqrt{\alpha^2+\beta^2+1}}.$$ Hence, the unit norm is a constant. $$ M_{uu}=M_{uv}=M_{vv}=0$$ Hence $l=m=n=0$, so the second fundamental form is $$ ldu^2+mdudv+ndv^2=0.$$  Now I need to show the converse, but I don't know how. Please help :)


How do I design a screen which works for multiple cross devices

nowadays there are too many devices with different height and different aspect ratio, should I make the design for a smaller device and top of that I add a percentage respectively? or there is any other way to look at?


How to draw a line between observation and minds?

When talking about quantum mechanics, a lot of people make the (pseudo-scientific?) argument that minds are required to collapse the wave function (and therefore, minds are important, we are back on the center of the universe, etc, etc)  Then, people who do study quantum mechanics say it has nothing to do with mind (wherever that is), it has to do with observation, even if mechanical observation.  OK. What I don't understand is: what if we consider the "mechanical observation device" to be part of the experiment? Just a lot of pieces of matter that are also the object of study of the experiment. Then what is happening? What is exactly causing the collapse? Doesn't that bring minds back into the game, or I am just being naive, new-age, etc?


How to enable or disable -updates, -security, -backports, -proposed repositories from commandline?

Let's assume that we are using Ubuntu 18.04 LTS (Bionic Beaver).  I know GUI ways to enable or disable the following repositories:   Important security updates  (bionic-security) Recommended updates (bionic-updates) Pre-released updates (bionic-proposed) Unsupported updates (bionic-backports)    In KDE user may want to open Software & Updates (or software-properties-kde) and navigate to Updates tab. In GNOME, MATE, Xfce user should open Software & Updates (or software-properties-gtk) and navigate to Updates tab for -security, -updates and -backports and Developer options tab for -proposed.   But how to enable or disable -updates, -security, -backports, -proposed repositories from commandline?  Note: I need a solution without direct editing of /etc/apt/sources.list.  Update: I created .


Functions Which are non differentiable on a Given Set.

I have recently read the famous Weierstrass Non differentiable function which is continuous everywhere but nowhere differentiable.     But now my question is:    Given a countable set $S (\subset \mathbb{R})$ , can we construct a function which is continuous everywhere but non differentiable only at points of S..?    My Attempt: If $S$ finite say, $S=\{c_1,c_2,...,c_n\}$ Then the following function is the desired one:$$f(x)=\sum_{i=1}^{n}|x-c_i|$$   But I cannot construct the function for a arbitrary Enumerable set $S.$     Can we generalize the question for an arbitrary set $S$? Please Help.  Thank you...!!


What happened to the comments section on the blog?

The most recent  seems to have lost its comment section at the bottom. What happened to it?


need help finding the name of a series - human character with the ability to dissolve and impersonate others

There was a series of novels about humans fighting against machines where one of the characters had the ability to take the place of other humans by dissolving them and taking their place.  At one point, a human controlled ship took out a machine ship by catching it in some kind of scoop used to convert matter into energy.


This is a Q&A so I answer it myself. I searched for an answer to this question for ages and didn't find anything so I'll add this here if anybody else struggles with the same issue.  So, how can I merge two edge loops to one? I do not want to connect them (I have seen many answers that suggest to just bridge the edge loops), nor do I want to merge each vertex by hand. I just want each vertex to be merged with the closest opposing vertex.  Also, I find it highly unpractical and in most situations useless to remove doubles after moving the vertices to overlap each other by scaling and moving the edge loops. This is another common suggested answer.


char *pear = ""; int f=0;  while(f != 20) {     pear[f] = 'a';     f++; }   So I want to append a's to the char string Why is this causing a buffer problem And I can't use the strcat I have don't like this.


variable is claimed to be undefined in error message, yet the variable works just fine

I created a program to change the greyscale value of the background by tracking the mouseX position and mapping it unto the greyscale range, so that when I move the mouse left and right the color changes from black to white respectively. I want to track the greyscale value as I move the mouse about, by calling the print() command upon clicking the mouse using function mousePressed() When I run the program, the background color changes exactly as intended, meaning that the variable z is being calculated just fine, yet upon mouse click nothing prints and an error message is received: "p5.js says: There's an error due to "z" not being defined in the current scope." WHAT I KNOW:  tracking mouseX by printing it to console with print(), upon mouse click using function mousePressed() works fine, as I had used it successfully in a different program I made. even just switching the variable z inside the print() command to mouseX works.  WHAT ELSE I TRIED:  I created a new variable, set its value to z and tried printing the new variable... didnt work. I mapped the size of the canvas to the greyscale range (0-255) manually by division of the two numbers,  and multiplied that by mouseX variable name - ratio. when I tried to print ratio the same problem occurred.  WHAT DO I WANT AN ANSWER TO?:  Why does this error occur upon calling either the mapped variable, and the manually calculated one? How can I make this idea of clicking at any given mouse position, to receive the current greyscale value work? (preferably without calling any straightforward function like background.color or something) This is my first question on this website and I tried to make it as readable as possible. I would like to receive some feedback on my question, was it easy to understand? was it too descriptive? and whatever else you might see appropriate and helpful for further question uploading.  CODE:    var frame = {  //this is used to save the canvas size and use it   x: 600,   y: 400 }   function setup() {   createCanvas(frame.x, frame.y); }  function draw() {   var z = map(mouseX, 0, frame.x, 0, 255) // first attempt. doesnt work   //var ratio = mouseX*255/frame.x; //manual mapping attempt. doesnt work   background(z);   rectMode(CENTER)   rect(mouseX,200,10,60) }  function mousePressed() { print('greyscale value is: ' + z) } <script src="https://cdnjs.cloudflare.com/ajax/libs/p5.js/1.0.0/p5.min.js"></script>


I'm using a tabular inside a basedescript enviroment from the mdwlist package. I need to have "normal paragraph"-like behaviour on both sides — so LaTeX will wrap lines and break words.  The vertical alignment of the table doesn't fit the one of the label. I worked around it using \vspace{} trying to approach the same height.  Is there a proper way to achieve this?    Problem (red circle) and workaround solution:    MWE:  \documentclass{scrartcl} \usepackage{mdwlist} \usepackage{lipsum}  \begin{document} \begin{basedescript}{% \desclabelstyle{\multilinelabel} \desclabelwidth{3cm}} \item[some label]    dummy text      \item[another label ]     \begin{tabular}{lr}       line 1 & row 2 \\       line 2 & row 2 \\     \end{tabular} \end{basedescript}   \hrule \subsubsection*{workaround with \\vspace }  \begin{basedescript}{% \desclabelstyle{\multilinelabel} \desclabelwidth{3cm}} \item[some label]    dummy text      \item[another label ]     ~\vspace{-1.3em}      \begin{tabular}{lr}       line 1 & row 2 \\       line 2 & row 2 \\     \end{tabular} \end{basedescript}  \end{document}


How do you actually select colleges for Ph.D. application

If I have to pick 5 to 6 colleges to apply for a Ph.D. program, how do I go about it? If I find the work that a CS professor at let's say UC Davis to be interesting. How do I actually know if I have a realistic chance of getting in? I cannot reach out to the professor and ask him if he will let me be a Ph.D. student in his lab because he hasn't seen my transcripts, read my LORs, or doesn't know me at all. If I write him an email, in all likelihood, he will just ignore my email. At the same time, I cannot ask my recommenders if I have a chance of being accepted at UC Davis. Because (a) They don't know what the other recommenders will write in their letter. (b) They might not know exactly, what sort of profile gets admitted at UC Davis. (c) It's been 3.5 years since I graduated with a Master's degree and 6 years since I graduated with a Bachelors. People might not even recognize who I am, let alone write me a letter of recommendation. Applying to colleges costs money. Also, people who write me a LOR, have to upload their LOR to each place where I am applying to. If I am applying to colleges way out of my league, I will be wasting my time as well as the time of the people who would write me a LOR. So my question is, how do you find colleges that are in your league.


which version should I install for intel atom CPU 230 @ 1.6 GHZ, 1G Ram acer aspire revo?

I have an Acer Aspire Revo R3600 , intel atom CPU 230 @ 1.6 GHZ, 1G Ram, 120G hard disk and currently running window xp (but in the system properties, it says 895 ram only).  it is slow and so I would like to install ubuntu os on it to improve the performance but not sure what version of ubuntu I should install.  I only found previous literature that people installed Ubuntu version 9.x in this machine written in 2009.  now that ubuntu has higher version.  Can someone advise what is the ubuntu version I should install given this machine spec? anyone tried it?  also, does this version support other lanugage (chinese)?


Long ago I learnt that normal distribution was necessary to use a two sample T-test. Today a colleague told me that she learnt that for N>50 normal distribution was not necessary. Is that true?  If true is that because of the central limit theorem?


If $f: N\rightarrow N $ be such that $f(f(n))+f(n+1)=n+2$ for all $n\in N$ find $f(1)$ and $f(2)$.

Putting $n=1$, we get $f(f(1))+f(2)=3$. Thus there are two possibilities. Either $f(f(1))=1, f(2)=2$ or $f(f(1))=2, f(2)=1$. Also, we observe that $f(f(n))=n+2-f(n+1)\leq n+1$ and $f(n+1)=n+2-f(f(n))\leq n+1$. How do we get the values of $f(1)$ and $f(2)$?


I am making a program where you enter in the student's grade, and it counts who passes and fails, then Z is supposed to mean the program should end. But whenever I type in "Z", it just prints out:  <Z is NOT an acceptable grade.>   So something is preventing the while loop from realizing I am trying to move on. Any ideas? Full code is below.  import java.lang.reflect.Array;  import java.util.Scanner; import java.util.Arrays; import java.util.List;  public class GCDProgram { public static void main(String args[]){ Scanner sc = new Scanner(System.in); int numberOfGrades = 1; System.out.println("Enter grade #" + numberOfGrades + ":"); String inputLetter = sc.nextLine();  int passed = 0; int failed = 0;  String[] letterGrade = {"A", "B", "C", "D", "F"}; boolean result = Arrays.stream(letterGrade).anyMatch(inputLetter::equals);    while (inputLetter != "Z"){   if (result) {      numberOfGrades++;     System.out.println("Enter grade #" + numberOfGrades + ":");     inputLetter = sc.nextLine();     result = Arrays.stream(letterGrade).anyMatch(inputLetter::equals);     if ((inputLetter == "D") || (inputLetter == "F")){         failed++;     }else{         passed++;     } }else{     System.out.println("<" + inputLetter + " is NOT an acceptable grade.>");      System.out.println("Enter grade #" + numberOfGrades + ":");     inputLetter = sc.nextLine();     result = Arrays.stream(letterGrade).anyMatch(inputLetter::equals); } } System.out.format("%-20s %3s", numberOfGrades + " students total", ""); System.out.format("%-20s %3s", passed + " students passed:", ((passed / numberOfGrades) * 100) + "%"); System.out.format("%-20s %3s", failed + " students failed:", ((failed / numberOfGrades) * 100) + "%");  }   }


If I download a .gem file to a folder in my computer, can I install it later using gem install?


I have this expression with indexing that I would like to understand: logic  [15:0] mem [3:0]; for(int i=0; i < 2; i++) begin       if (wea[i])         mem[addra][8*i+:8] <= dia[8*i+:8];     end  What value has the expression "8*i+:8" on each iteration ? How works that i+ in the indexing?


How can I find $\gcd(a^m+1,a^n+1)$ with $a,m,n$ positive integers?    I have this idea:  Let $d=\gcd(m,n)$. Then there exist positive integers $x,y$ such that $mx-ny=d$ (WLOG). We shall find $G=\gcd(a^m+1,a^n+1)$.  If $m,n$ are odd, then $d$ is odd, therefore one and only one of $x,y$ is even. We have:  $$a^{ny}(a^d+1)=a^{mx}+a^{ny}=(a^{mx}-1)+(a^{ny}+1)=(a^{mx}+1)+(a^{ny}-1).$$  If $x$ is even and $y$ is odd, then $a^{m}+1\mid a^{mx}-1$ and $a^{n}+1\mid a^{ny}+1$, therefore $G\mid a^{ny}(a^d+1)$. If $x$ is odd and $y$ is even, then $a^{m}+1\mid a^{mx}+1$ and $a^{n}+1\mid a^{ny}-1$, thus $G\mid a^{ny}(a^d+1)$. However, since $\gcd(a^m+1,a^{ny})=\gcd(a^n+1,a^{ny})=1$, so $\gcd(G,a^{ny})=1$, hence $G\mid a^d+1$. We also have $a^d+1\mid a^{m}+1$ and $a^d+1\mid a^{n}+1$, so $a^d+1\mid G$. Thus $G=a^d+1$.  If $v_2(m)=v_2(n)=v_2(d)=k>1$, then there exist some odd numbers $m_1,n_1,d_1$ such that $m=2^km_1,n=2^kn_1,d=2^kd_1$. We shall have $m_1x-n_1y=d_1$, so one and only one of $x,y$ is even, and we can use the same argument when $m,n$ are odd, so $G=a^d+1$.  However, if $v_2(m) \neq v_2(n)$, I cannot find any solutions for this. I think that $G \in \{1,2\}$, but I cannot prove or disprove it. How can I find $G=\gcd(a^m+1,a^n+1)$ if $v_2(m) \neq v_2(n)$ ? Moreover, is there anything from my arguments that can be improved ?


I want to store symbols like █ ▄ in my mysql db and show them with php. I tried to use ord and chr but it shows this symbol after: â  How can I do that?  Kind regards, Damon


UnboundLocalError: local variable referenced before assignment eventhough globals() was used pandas

def datapreperation(x):     x_names = x.columns.values.tolist()     x_names.pop(0)     for i in range(len(x_names)):         globals()[x_names[i]] = json_to_df(x[~x[x_names[i]].isnull()][x_names[i]])     df = pd.DataFrame()     df[['x','y','z']] = xx     dd = awards.pivot_table(index = ['f'], aggfunc ='size')  When I run this function I get this error: <ipython-input-5-f8036b34e06e> in datapreperation(x)       6     df = pd.DataFrame()       7     df[['x','y','z']] = xx ----> 8     dd = awa.pivot_table(index = ['f'], aggfunc ='size')       9     dd = pd.DataFrame(dd)  UnboundLocalError: local variable 'awa' referenced before assignment  To explain the code a little, xx part of the column list of x. Json to df is a function that converts json to df. F is a id and awa is another collumn of x. I do not understand why I get this error even-though I made xx and all other members of the list a global variable. How would I fix this error using pandas?


Weird shading after using solidify modifier

I'm making a simple cuboidal room, but as soon as I solidify my mesh it gets weird black patches around the corners.  If I turn fill rim to off it looks good, but obviously I want to fill the rims. I guess the normals are flipped or something leading to a lighting issue. It also persists in final rendered version   From outside  Notice the dark shade just above the 3D cursor    From inside  Again above the 3d cursor    .


Is this an inversion? To V should S be . .

As always, while reading through I found a sentence whose structure confused me.  What I want to know is whether the first sentence is the inversion form of the second sentence.      1. If the reason was to avoid bad publicity should his error be discovered, then . . .      2. If the reason was his error be discovered to avoid bad publicity, then . . .   If not, how should I interpret the first sentence?  Thanks.


Is there a proper subfield $K\subset \mathbb R$ such that $[\mathbb R:K]$ is finite? Here $[\mathbb R:K]$ means the dimension of $\mathbb R$ as a $K$-vector space.  What I have tried:   If we can find a finite subgroup $G\subset Gal (\mathbb C/\mathbb Q)$ such that $G$ contains the complex conjugation, it will be done by letting $K$ be the fixed field of $G$. But I don't know whether such a group exists. Maybe we can start with finding a suitable subgroup of $Gal(\bar{\mathbb Q}/\mathbb Q)$ and then lift it to $Gal(\mathbb C/\mathbb Q)$, where $\bar{\mathbb Q}$ denotes the algebraic closure of $\mathbb Q$. By isomorphism extension theorem, we can find many automorphisms of $\mathbb C$, none of them carries $\mathbb R$ to itself except for the identity. This is because $Gal(\mathbb R/\mathbb Q)$ is the trivial group. For example, now suppose $\{x_\alpha\}\subset \mathbb R$ is a transcendence basis over $\mathbb Q$. Let $\sigma$ be a permutation of $\{x_\alpha\}$, then by the isomorphism extension theorem, $\sigma$ extends to an automorphism of $\mathbb C$, which we still denote by $\sigma$. Then $L=\sigma(\mathbb R)$ is a copy of $\mathbb R$ and $\mathbb R$ is algebraic over $K=\mathbb R\cap L$. How large can $K$ be? Is it possible that $[\mathbb R:K]$ is finite?   Does anyone has some ideas?  Thanks!


How to create List of dictionaries from two list

x = ['a', 'b', 'c'] y= [[1,2,3],[4,5,6],[7,8,9]]  I want to create a list of dictionaries so the x and y values would correspond like this: output: [{'a':1, 'b':2, 'c':3}, {'a':4, 'b':5, 'c':6}, {'a':7, 'b':8, 'c':9}]


Embarking on a Schengen-bound flight on the night before my visa is valid

I have my visa to a Schengen country from 20th October(Thursday), so I'm booking a flight with a transit at Abu Dhabi airport.  Would it be fine to board the plane on 19th Octobers at 22:00, or I can pass through immigration in India only if the Schengen visa is valid?


I have that $x_1, x_2,...,x_n$ are from a rv $X$ that has the density function $f_X(x)=\frac{2x}{\theta^2} \quad$ for $0 \le x \le \theta  \quad$ and $f_X(x)=0 \quad$ otherwise. Ihave to determine the MLE of $\theta^*$ of $\theta$  Here is how I have done it:  $L(\theta)= \frac{2}{\theta^{2n}}\prod_{i=1}^nx_i$  $\frac{\partial L(\theta)}{\partial \theta} =...=\frac{-4n}{\theta^{2n+1}}\prod_{i=1}^nx_i + \frac{2}{\theta^{2n}}\frac{\partial(\prod_{i=1}^nx_i)}{\partial \theta}$  Is this correct? and also how do I calculate the CDF $F_{\theta^*}$, the pdf $f_{\theta^*}$ and the expectation $E[\theta^*]$ of the maximum likelihood estimator $\theta^*$?


Syntax for accessing elements of a multidimensional array

I am not able to understand how the computer is able to access an element in the multidimensional array with the following code.  I have tried searching on net for the possible syntax of accessing an element in a multidimensional array in c.  int main()  {      int A[][2]={{23,22},{12,13},{16,178}};     printf("%d",1[A][2]);     return 0; }   The result is 16.


Yesterday, suddenly my touchpad on my MSI Laptop started to not respond. In other words, in Login screen, touchpad is working as expected. However, in Desktop screen, after I have logged in, touchpad is not working.  How can I enable touchpad in Desktop?


Why would a server not send a SYN/ACK packet in response to a SYN packet

Lately, we've become aware of a TCP connection issue that is mostly limited to mac and Linux users who browse our websites.  From the user perspective, it presents itself as a really long connection time to our websites (>11 seconds).  We've managed to track down the technical signature of this problem, but can't figure out why it is happening or how to fix it.  Basically, what is happening is that the client's machine is sending the SYN packet to establish the TCP connection and the web server receives it, but does not respond with the SYN/ACK packet.  After the client has sent many SYN packets, the server finally responds with a SYN/ACK packet and everything is fine for the remainder of the connection.  And, of course, the kicker to the problem: it is intermittent and does not happen all the time (though it does happen between 10-30% of the time)  We are using Fedora 12 Linux as the OS and Nginx as the web server.  Screenshot of wireshark analysis    Update:  Turning off window scaling on the client stopped the issue from happening.  Now I just need a server side resolution (we can't make all the clients do this) :)  Final Update:  The solution was to turn off both TCP window scaling and TCP timestamps on our servers that are accessible to the public.


Is there any word for "small hand written note/letter" in English?

In some languages there is a name for a amicable note that you hand write to a lover or to someone to show appreciation, it's not as long and less formal than a letter. does english have an equivalent for that?


Querying Landsat 8 night images in Google Earth Engine?

Apparently, Landsat 8 occasionally acquires images at night-time during ascending passes. However, in the Google Earth Engine data catalogue (), there is no parameter like "orbit" or "pass".   Is there any other way to filter the Landsat 8 image collection for those night images?