This is not a duplicate of  because the main point of that is to allow for a process in Area 51 to "reopen" a closed site, while this one merely asks for closed sites to remain alive and read-only, without a special procedure for "reopening".  When a beta site is closed, the questions that can be migrated are given to other sites. But what about the questions that aren't relevant on other sites?   Let's say you have a question, that was fairly high voted, and has an accepted answer. That question may be useful to someone else in the future, even if it will not be useful to as many people as a StackExchange site requires. If that question is deleted, than in the future, people who are searching for answers on a question that happened to be covered by a closed beta, will not be able to get it.  What I propose, is that when a beta site dies, instead of deleting it, it should be turned into an "archive site".  The archive site would basically be the same as the regular site, except there would be a big "Archive" at the top of the site (it would look just like the meta site, except with "archive" instead of "meta", and it would be colored even more gray), and it would be read-only. People would be able to view the questions and answers, but no one would be able add anything, or vote.  Also, I would suggest that Stack Exchange keep track of the traffic that comes into that site. If, for some reason, the topic of that dead beta become of interest to enough people, the site could be recreated.  Any questions, comments, suggestions?

At the moment, when a site is closed to due to insufficient activity, it's taken offline and archived.  I'd like to propose an alternative approach.   Let's keep all the content online. Keep the "link" functionality active, so that people can create links to it. But put all activity that's user-generated content, into suspended animation, so that when anyone tries to ask, to answer, to edit, to upvote, downvote, or otherwise contribute to the site, they get a message telling them that the site is in suspended animation, but will be resurrected once a certain number of people (200, or whatever), have committed to contributing to it once it reopens. Manage the commitment / reopening process through Area 51, with the usual rewards for getting other people to commit to reopening, just as they're rewarded for getting other people to commit to opening a beta site in the first place. Have a banner on every page in the site, stating that the site is in suspended animation, pending sufficient commitment to reopen it - and offering a link to the right place in Area51 to allow them to commit to reopening the site. When a site is suspended, send all contributors who've given SE an email address, an email with a link to Area51 and telling them how they can help re-open the site. Don't do any reputation-recalculating or badge-awarding while the site is suspended. Apply all this to a site's Meta-site too. Exclude the reputation on suspended sites from users' Exchange-wide all-site flair. Or include it. I can see benefits either way. It's a side-issue. Can we ignore it for now, until the above points have been agreed or declined?   Advantages:   all the content stays on the web for people to link to and benefit from; no new broken windows: the suspended animation prevents anyone adding spam or other bad content; StackExchange can continue putting advertisements on the content, bringing in some revenue. Beta contributors don't feel like all their hard work has gone to waste: thus they won't be deterred from contributing to other betas.   Oh, and please could this be trialled on the Economics site first?


I saw this video and was amazed by seeing this incredible balance. I wanted to know how is this thing balanced and what are other things that can be balanced using physics.

I've seen another variation where the whole match stick turned to ash.  What's going on in this trick?


I'm quite new to GIS and have only done a few small tasks for Projects at University and the required data has always been provided. I am now struggling to find the specific DEM I need. Also other terrain data such as presence of glaciers (or former glaciers) and river networks would be useful.

Where can I find free elevation data for Europe?   The available resolutions and terms of use are important details that I also seek.


It seems like the identities of curl of gradient, divergence of curl, and the simple derivations of electromagnetic waves from Maxwell equations all rely on the symmetry (interchangeability of their order) of partial derivatives.  But mathematically speaking, this tacitly assumes that the electric/magnetic fields in question are continuously double differentiable, something which needs justification.  Why do we assume that in the real world, the fields are smooth enough for the identities to work, atleast almost everywhere?

We have notions of derivative for a continuous and differentiable vector fields. The operations like curl,divergence etc. have well defined precise notions for these fields.  We know electrostatic and magneto static fields aren't actually well behaved. They blow up at the sources, have discontinuities and yet we use the same mathematical formulations for them as we would have done for continuous and differentiable vector field.  Why is this done ? Why are laws of electromagnetism(maxwell's equations) expressed in the so called differential forms when clearly that mathematical theory is not perfectly consistent with the electromagnetic field. Why not use a new mathematical structure ?  Is there a resource which can help me overcome these issues without handwaving at particular instances when the methods seem to give wrong results?  Also one of the major concerns is that, given a charge distributions, the maxwell equations in differential form, will always give a nicely behaved continuous and differentiable vector field solution. But the integral form (alone, not satisfying the differential form) can give a discontinuous solution as well. Leading to two different answers for the same configuration of charges. hence there is an inconsistency. Like there is an discontinuous solution for the boundary condition of 2D surface, the perpendicular component of the electric field is discontinuous. ( May be it is just an approximation) and actually the field is continuous but due to not being able to solve the differential equation we give such an approximation, but this isn't mentioned in the textbooks.


I accidentally deleted the theme presets in user preferences and I would like to be able to restore them. How can I do this?

Even though I am relatively new to Blender I am recording a tutorial for a Blender exporter. I have been advised that I should use the Default colour scheme (for the UI). I have no idea which one that is. Can anyone tell me?


I have this MATLAB code:     After sysms the variables turn purple and I cannot make that in the MATLAB script I have in Latex:   \documentclass{article}  \usepackage[T1]{fontenc} \usepackage{bigfoot} % to allow verbatim in footnote \usepackage[numbered,framed]{matlab-prettifier}   \begin{filecontents*}{sample.m}  %Parcial Computacion Cientifica (Punto 1)  %Solucion del sistema de Ecuaciones para a2 y a3     %Se definen los variables simbolicas del sistema. syms h a2 a3 f0 df0 f1 df1   eqn1 = f0 + df0*h + a2*(h^2) + a3*(h^3) == f1; %Ecuacion 7 eqn2 = df0 + 2*a2*h + 3*a3*(h^2) == df1; %Ecuacion 9    %Solucion del sistema de Ecuaciones. solution = solve([eqn1, eqn2],[a2 a3]);   a2 = solution.a2; %Solucion de a2  a3 = solution.a3; %Solucion de a3  \end{filecontents*}    \let\ph\mlplaceholder % shorter macro \lstMakeShortInline"  \lstset{   style              = Matlab-editor,   basicstyle         = \mlttfamily,   escapechar         = ",   mlshowsectionrules = true, }  \lstinputlisting[caption = {Sample code from Matlab}]{sample.m}      If someone could tell me how to turn any of text to purple MATLAB-like it could be really helpful, also I would like to know how to  make the number of lines and the font of the code look like this:

I've found that the matlab-prettifier does not highlight all the syntax compared to the original file.  For example, here is a snapshot of part of the file I am trying to include in my document from MATLAB:    As you can see, the "syms" variables show up like how a text command in MATLAB would look like.  However, from my code below, this MATLAB command is not colored typeset like the original.  How I can get this "sys" syntax in MATLAB to show up correctly in my LaTeX document?   Here is my code:  \documentclass{book} \usepackage{amsmath,amsfonts,amssymb,amsthm} \usepackage{xcolor} \usepackage{listings} \usepackage{filecontents} \begin{filecontents}{mat1.m} %% Variables to solve syms r2s r3s th1 th2;  % arm1 x1 = [0 0]; y1 = [0 1]; x2 = [0 1]; y2 = [1 1]; x3 = [1 1]; y3 = [1 2];  % Size figure and draw arms figure('position', [800, 300, 600, 550]); hold on plot(xcirc, ycirc,'m','linewidth', 1); \end{filecontents}  \renewcommand{\lstlistingname}{\textbf{\textcolor{blue}{Matlab Algorithm}}} \renewcommand{\lstlistlistingname}{List of \lstlistingname s}  \usepackage[numbered,framed]{matlab-prettifier}  \begin{document}  \lstinputlisting[ backgroundcolor=\color{blue!05}, style=Matlab-editor, basicstyle=\mlttfamily\small, caption={Draw a simple Fig.}, label={mat1} ]{mat1.m}  \end{document}


I want to prove that Gal($\mathbb{Q}^{ab}/\mathbb{Q}$) $\rightarrow$  $\hat{\mathbb{Z}}^×$ is an isomorphism by using the statement of class field theory Gal($L/K$)$^{ab}$ $\rightarrow$  $I_K/N_{L/K}I_L$ is the isomorphism where $I_L$ is the idele class group with respect to L.  I think that $L=\mathbb{Q}^{ab}$ and $K = \mathbb{Q}$ and want to prove $I_K/N_{L/K}I_L$ $\cong$ $\hat{\mathbb{Z}}^×$. $I_K$ = $\prod_{p\ is\ prime}^{'}\mathbb{Q}_p$ for $\prod^{'}$ is restricted product. But I don't know how to prove from here. Please tell me how to prove! Thanks in advance.

Algebraic class field theory tells us that $\text{Gal}(\mathbb{Q}^{ab}/\mathbb{Q})$ is isomorphic to the group of connected components of the quotient $\mathbb{Q}^{\times}\backslash \mathbb{A}_{\mathbb{Q}}^{\times}\cong \prod_p \mathbb{Z_p}^{\times}\times \mathbb{R}_{>0}$, where $\mathbb{A}_{\mathbb{Q}}$ is the ring of adèles of $\mathbb{Q}$.   It's then said that the group of connected components is given by $\prod_p \mathbb{Z_p}^{\times}$, how can I see this?  Thank you very much in advance!


In the list of the psychic's  is Force Field, which says:     You must be at least 3rd level to select this discovery.   Does this mean Psychic level 3 or character level 3?

Forgive me for not being good at game terminology, but there is one concept that I simply have been unable to fully grasp after reading the core rulebook.  In the book, there are mentions of Character Level, Class Level and Level (just being mentioned as level or "your" level).  Are we talking character level or class level when I'm asked "What's your level?"  Could anyone make a solid explanation that I can remember? The rest of my party are rules- and character-building nuts, and they often get sidetracked with potential combinations when trying to explain even simple things.


I have tried with many (working) 230V - 9V DC wall adapter power supply (of different brands, some of them coming with an electronic Yamaha device, etc.):    they all show a higher voltage when measured in "DC mode" by my multimeter, like 12V - 14V they even show a higher voltage when measuring in "AC mode" of the multimeter: ~ 30V! This doesn't really make sense: the output of the power supply should be DC, so a theoretic AC voltage should be 0V. Ok, I understand the output of such an adapter is never "perfectly" DC, and there might still be a small sinusoidal component... However, why 30V?   What could be the reason of this higher than normal voltage?  Could it be a ripple after the ?  PS: I don't own a oscilloscope to test the output of the wall adapter, but I will try to borrow one!  PS2: if it was only with 1 such adapter, it could just be a faulty one. But now I've tested about 6 different (working) adapters of different brands...  PS3: it's a cheap multimeter () but efficient. All other voltages that I measured have always been correct.

When I measure a 9V DC wall adapter power supply with a multimeter it shows 11.8V. When connected to my board this voltage lowers to 10V. Is this normal? Should I be afraid of toasting my  supplied board when using this adapter?  Edit: This regulator accepts up to 12V inputs. So that will be no problem. A second "9V" adapter yields 15V to the multimeter. Will this one burn my circuit?


Definitions  Occidental: "1: relating to the countries of the West"  Oriental:  "1. of, relating to, or characteristic of the Orient, or East; Eastern."  So, occidental is effectively a word that is a synonym to western, and oriental is a synonym to eastern.  Do similar words to these exist for northern and southern?

How does one correctly form the "north" and "south" forms for which occident and orient are "west" and "east"?  I found boreal and austral, but those look like adjectives and I'm after the nouns.  Bonus: what about "up" and "down"?


I have a laptop which I've dual-booted with Ubuntu and Windows 10.  My goal is to use a bash shell inside windows to access the linux partition.  Inside Windows, I've installed the Linux subsystem and also used Ext2Fsd to create a D:// drive for the Linux system.  In the Bash shell, though, I can only see the C:// drive. How can I access the D:// drive?  I tried creating a shortcut in windows, but it makes .lnk file that I'm not sure how to follow in Linux.

I'm using Windows 10's Ubuntu Bash shell. It maps the C drive fine as /mnt/c.  I have other local physical hard drives, mounted in Windows as E: and F:  How do I tell Bash to mount these drives too (ideally automatically at /mnt/e and /mnt/f, but manual mounting is fine)? "sudo fdisk -l" doesn't seem to work (cannot open /proc/partitions), so I'm not sure how to find their names, otherwise I'd just use a regular mount command.


In India we frequently use this term as a substitute for 'By the way'. Is the usage as popular in other countries? Can someone throw some light on the etymology?

What is the origin of the phrase 'By the by...'?


In granulometry, say I have a tube with an heterogeneous mix of particles of different sizes (sand and stones, by instance). The tube is vertical in the usual gravity field and is placed in the air. If I randomly  shake the tube, the smallest particles will eventually be at the bottom, and the largest ones at the top. So the particles are now sorted by size. Why?  A friend of mine considers a volume of the bottom part of the tube has a greater density (or mass) than of the top's. And denser things go downward.  I consider however, by shaking the particles, small ones can fall through the space left between larger ones.  What is the correct explanation?

Most of the time when I mixed different nuts in a bowl, I observed that the big Brazil nuts were always on top while the small peanuts settled near the base. No matter how you take it, if the big nuts are put at the bottom and then the small nuts are poured, then also after some time the big ones will come to the top. Will not the gravity attract those big nuts more and eventually will they not remain at the base? But it doesn't happen!   I googled it and found the term Brazil-nut Effect but couldn't find any proper explanation. What is the physical explanation for this effect?


I am trying to create a footnote symbol * in a tcolorbox environment and the result is not the symbol nor at the bottom of the page instead within the box!  \usepackage[most]{tcolorbox} \usepackage[symbol]{footmisc}  \begin{document} \begin{tcolorbox}[colback=yellow!20!white,colframe=green!40!gray] \color{green!40!gray}{\large {\bf Definitions}}\color{black} \ \ \ {\bf  Strategy  for Sketching Graphs}\footnote[1]{This strategy is refined further, for  rational  functions, in Section 2.3.}  \begin{enumerate} \item[{\bf a)}] \item[{\bf b)}] \item[{\bf c)}] \item[{\bf d)}] \item[{\bf e)}] \item[{\bf f)}] \end{enumerate}  \end{tcolorbox} \end{document}   This outputs:    First of all tcolorbox is not reading the correct symbol for '1' in the footmisc package nor is the footnote at the bottom of the page. Please advise!

The footnote is printed inside the box. I want it to be below the box. See my code:  \documentclass{beamer} \usepackage[most]{tcolorbox} \usepackage{multirow} \useinnertheme{rounded}  \usetikzlibrary{matrix, arrows.meta, calc, positioning} \tikzset{myarrow/.style={-Latex, rounded corners},}  \newtcolorbox{mybox}[2][]{%     colback=bg,      colframe=blue!75!black,     fonttitle=\bfseries,     coltitle=blue!75!black,      colbacktitle=bg,     enhanced,     attach boxed title to top left={yshift=-1.2mm, xshift=2mm},   title=#2,   #1}  \begin{document}  \begin{frame}{Parameterization of Graph Isomorphism Problem}  \begin{mybox}[colframe=green!75!black,coltitle=green!75!black, ]{GI parameterized by degree}  \begin{itemize}     \item Given : $G$ and $H$, a parameter $d$ ( maximum degree ) \\~\\     \item Decide : Is $G \cong H$?\\~\\     \item $n^{O(d)}$ running time\footnote{This result is taken from paper titled " lsomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time" by E M Luks} algorithm by E.M Luks \end{itemize} \end{mybox}  \end{frame} \end{document}   See the compiled output:


I started making apple cider vinegar using the second method listed on   It's been little over 4 months and my mix is looking really weird. There's some white fluff on top of what looks like a vinegar mother. The more was to be expected (it's part of the reason why I went with this method, so I could get a mother for use in future batches). But the white fluff is worrying me a little bit.   Is it mold? If so, are the batch and mother salvageable?  There's also some odd, brown, tree like organism growing in the middle. That one is really throwing me off.       (click for full size)

About 2-3 months ago I decided to start my own batch of vinegar.  I started with some Braggs apple cider vinegar which contains the mother, and I added some old wine and some fruit juice to the mix.  I kept it in a dark and warm place, as per instructions online.  A few layers of cheesecloth were placed on top to allow it to air, without letting anything else get into it.  When I recently opened it, I found a layer of what appears to be a yellow-orange mold on top.  There are also some small worms or maggots living on the top, but that doesn't seem as problematic to me.    As you can (sort of) see in this picture above, there is definitely a mother at the bottom.  The mother has grown since I last saw it.  I am not sure what to think about that top layer though.  Is the vinegar batch completely spoiled?  Picture #2 (a closer look at the top)


Pretty much what the title says. To be more general, try to solve $x! = n$. I have tried for many hours and only ended up with a headache, is there any good/decent/practical way of solving such an eqation? I could not find anything about this on the internet.   Tl;dr What would be an exact solution for x, when x! = n?

I'm interested in algorithms to quickly compute the inverse factorial. I've noted that large factorials have a unique number of digits. How can I use this fact to quickly compute the factorial? Is there a formula,  n = f(n!) = #digits( (n!) )?  I'm mostly interested in the case where we know our input is correct. But, error checking for values that are not factorials would be a bonus. (Perhaps, someone has thought of a way to do the inverse gamma function quickly?)  I'm interested in inputs that have over a million digits, so simply dividing 1,2,3,...,n will not work.


The Package system is broken The message I get when trying to run the software updater is as follows:  If you are using third party repositories then disable them, since they are a common source of problems. Now run the following command in a terminal: apt-get install -f Transaction failed: The package system is broken  The following packages have unmet dependencies: libc6-dbg: Depends: libc6 (= 2.27-3ubuntu1.4) but 2.27-3ubuntu1.3 is installed libc6-dev: Depends: libc6 (= 2.27-3ubuntu1.4) but 2.27-3ubuntu1.3 is installed Depends: libc-dev-bin (= 2.27-3ubuntu1.4) but 2.27-3ubuntu1.4 is installed  I disabled all third party repositories and ran the command: Sudo apt-get install -f  and I got:  debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable (Reading database ... 310312 files and directories currently installed.) Preparing to unpack .../libc6_2.27-3ubuntu1.4_amd64.deb ... De-configuring libc6:i386 (2.27-3ubuntu1.3) ... debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable dpkg: error processing archive /var/cache/apt/archives/libc6_2.27-3ubuntu1.4_amd64.deb (--unpack): new libc6:amd64 package pre-installation script subprocess returned error exit status 1 Preparing to unpack .../libc6_2.27-3ubuntu1.4_i386.deb ... De-configuring libc6:amd64 (2.27-3ubuntu1.3) ... debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable dpkg: error processing archive /var/cache/apt/archives/libc6_2.27-3ubuntu1.4_i386.deb (--unpack): new libc6:i386 package pre-installation script subprocess returned error exit status 1 Errors were encountered while processing: /var/cache/apt/archives/libc6_2.27-3ubuntu1.4_amd64.deb /var/cache/apt/archives/libc6_2.27-3ubuntu1.4_i386.deb E: Sub-process /usr/bin/dpkg returned an error code (1)  So I am stuck. How can I recover from this serious crash? I am using Ubuntu 18.04.5 LTS Many thanks

I'm trying to install the flashybrid but when I enter the apt-get install flashybrid command, I get this error:  root@user-desktop:/home/user# apt-get install flashybrid Reading package lists... Done Building dependency tree Reading state information... Done flashybrid is already the newest version. 0 upgraded, 0 newly installed, 0 to remove and 0 not upgraded. 1 not fully installed or removed. After this operation, 0B of additional disk space will be used. debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable Setting up flashybrid (0.15+nmu2) ... debconf: DbDriver "config": /var/cache/debconf/config.dat is locked by another process: Resource temporarily unavailable dpkg: error processing flashybrid (--configure): subprocess post-installation script returned error exit status 1 Errors were encountered while processing: flashybrid E: Sub-process /usr/bin/dpkg returned an error code (1)   I also tried this one to find what is already using that file:  root@user-desktop:/home/user# lsof | grep /var/cache/debconf/config.dat lsof: WARNING: can't stat() fuse.gvfs-fuse-daemon file system /home/user/.gvfs Output information may be incomplete. dpkg-prec 4672 root 4rW REG 8,6 39658 1697827 /var/cache/debconf/config.dat   But I don't know how to fix this.


I have a string in C named buff. It is defined as char *buf = malloc(size);. I'm new to C but think this means that the values of the bytes of data allocated is stored in buf. All code is below When I run sizeof(buf) it gives a size of 8 despite it clearly being full of more than 8 characters. I also have problems with taking the returned pointer and putting it through strlen which gives a value double what I expect. This is a function to create an array of characaters read from a file. The comments below used an example file of input.txt with contents ()()(()()( const char* readFile()  {     FILE* fp;     int c;     int nch = 0;     int size = 100;     fp = fopen("./input.txt","r");     //allocates a block of 100 bytes and sets buf as the values associated with those values     char *buf = malloc(size);     if(buf == NULL)         {         fprintf(stderr, "out of memory\n");         return NULL;         }     while((c = fgetc(fp)) != EOF) //sets c to the next character of fp and checks it isn't the end         {         if(nch >= size-1) //size-1 as need an extra character for '\0'             {             /* time to make it bigger */             //printf("size: %d \n",size);             size += 50;             buf = realloc(buf, size);             //size_t n = arraySize(buf);             //printf("buf is %zu chars long \n",n);             if(buf == NULL)                 {                 fprintf(stderr, "out of memory\n");                 return NULL;                 }             }          buf[nch++] = c; //steps nch and stores c         }     buf[nch++] = '\0';     printf("size: %d\n",size); //output 100      printf("nch: %d\n",nch); //output 11     buf = realloc(buf, nch); //sets the buf to the size it actually needs      printf("buf is %d long\n",sizeof(buf)); //outputs sizeof(buf) as 8.     printf("buf[0] is %d long\n",sizeof(buf[0])); //outputs sizeof(buf[0]) as 1.     printf("\"%s\"\n", buf); //shows it reads the file properly. outputs "0123456789"     return buf; }  int main(){     const char *fileContents = readFile(); //defines it as the address of the first character     printf("\"%s\"\n", fileContents); //outputs the file contents correctly     int count = 0;     printf("strlen: %d\n",strlen(fileContents)); //outputs 10     int i, lenStr = strlen(fileContents);     for(i = 0; i < lenStr; i++){          char c = *(fileContents+i); //sets character at position i to c         printf("character: %c  i: %d\n",c,i); //outputs expected value         switch(c){ //this works sort of and correctly identifies values         case '(':             printf("increasing count\n");             count++;             break;         case ')':             printf("decreasing count\n");             count--;             break;         default:             printf("things are going wrong \n");             break;         }         fileContents++;     }     printf("go up %d floors",count);     getchar();     return 0; }  output of for loop with select statment character: (  i: 0 increasing count character: (  i: 1 increasing count character: (  i: 2 increasing count character: )  i: 3 decreasing count character: )  i: 4 decreasing count character:    i: 5 things are going wrong character:    i: 6 things are going wrong character:    i: 7 things are going wrong character: e  i: 8 things are going wrong character: s  i: 9 things are going wrong  For some reason the output is in the wrong order before it starts breaking. It feels like the problem is I don't fully understand pointers. I'm just not sure how I am misunderstanding them.

First off, here is some code:  int main()  {     int days[] = {1,2,3,4,5};     int *ptr = days;     printf("%u\n", sizeof(days));     printf("%u\n", sizeof(ptr));      return 0; }   Is there a way to find out the size of the array that ptr is pointing to (instead of just giving its size, which is four bytes on a 32-bit system)?


I need to pull a U-Haul down the Alaskan Highway from Anchorage to Seattle.  I want to know when that road is likely to be clear of winter's snow and ice.

Me and a friend are going to be driving from Anchorage, Alaska to Seattle, Washington in mid-September. Will we be encountering snow at that time of year, or should we be safe?


If someone just gained the  (which will give access to the Suggested Edits queue) while they are suspended from reviewing, they are able to see a pending review on a post but still can't review it, neither edit the question until that suggested edit is handled, neither access the suggested edit queue that was just unlocked for them.  When clicking on edit, the suspension message will appear in addition to the suggested edit differences, without the ability to do anything.  You’ve been suspended from reviewing. You will be able to review again on...Your review on ... wasn't helpful. Please review the history of the post and consider which action would achieve that outcome more quickly.  Feature suggestion On this specific scenario (more or less some conditions like current suspension duration...), lift the review suspension for that user for all queue reviews or at least for . This can be see as an extra bonus with the privilege that may give users (talking about a relatively small reputation user, ~2000 rep only) a chance to learn and improve their reviews. Related question :

I'm blocked from reviewing for some time, but I'm not blocked from editing. I would like to edit someone's question, but there is another suggested edit review pending. I can't approve it because of the review ban, but also I can't do any other edit as when I click "edit" it redirects me to approve the edit. Is that expected or this is a bug?


I've been reading  and wondering how to exclude the 2 lines, or any number after the match using sed or any other practical tools.  user@linux:~$ cat -n file.txt       1  SomeTestAAAA      2  Random String      3  EndTest      4  SomeTestABCD      5  Random String      6  EndTest      7  SomeTestDEFG      8  Random String      9  EndTest     10  SomeTestAABC     11  Random String     12  EndTest     13  SomeTestACDF     14  Random String     15  EndTest user@linux:~$    1st Question  I was able to accomplish this using grep -P as follows; unfortunately there is unwanted -- character in the output.  How to remove this?  user@linux:~$ grep -P -A 2 'SomeTest(?!AA)' file.txt SomeTestABCD Random String EndTest SomeTestDEFG Random String EndTest -- SomeTestACDF Random String EndTest user@linux:~$    Question 2  I've also managed to do this with awk as shown in previous answer. However this is only working on this case because of the similar EndTest pattern. What if EndTest is some random word and doesn't have pattern.   Could we do something similar as grep -v -A 2 SomeTestAA? I know this won't work, but the desired output would be similar as follows.  user@linux:~$ awk  'BEGIN{ RS=ORS="\nEndTest\n"} !/'"^SomeTestAA/" file.txt  SomeTestABCD Random String EndTest SomeTestDEFG Random String EndTest SomeTestACDF Random String EndTest user@linux:~$

Consider a text file with the following entries:  aaa bbb ccc ddd eee fff ggg hhh iii   Given a pattern (e.g. fff), I would like to grep the file above to get in the output:  all_lines except (pattern_matching_lines  U (B lines_before) U (A lines_after))   For example, if B = 2 and A = 1, the output with pattern = fff should be:  aaa bbb ccc hhh iii   How can I do this with grep or other command line tools?    Note, when I try:  grep -v 'fff'  -A1 -B2 file.txt   I don't get what I want. I instead get:  aaa bbb ccc ddd eee fff -- -- fff ggg hhh iii


I'm trying to solve this exercise.  If $\phi, \psi$ are propositional formulas, prove $\vdash (((\phi \to \psi) \to \phi) \to \phi)$.  I was wondering if there was a "simple" proof to this (I'm aware of the proof ), and most importantly, how to motivate a proof to this exercise. (For me, the motivation is the most important bit! I already have a proof) I asked such a question before, with a much simpler exercise, and the answer was "try it out in words first, and then write it symbolically!" which worked very well until coming across this example.  Currently I have a proof to this, which I brute forced; to me it feels extremely mechanical and non-replicable but for luck. I'm not sure if this is relevant to the question, but I'll attach it as a picture.  Edit: I actually don't know what the expression "proof system" means. Sorry; I was only told that this was "natural deduction", and the rules for $\land, \lnot, \rightarrow , \leftrightarrow, \perp$, etc were given.

Using the Fitch system, how do I prove $((p \implies q) \implies p)\implies p$? I started with the hypotheses $(p \implies q) \implies p$ and $\sim p$. However, from these hypotheses I did not get the desired contradiction to solve the question.  Thanks sb45


I just found out yesterday I am 4 weeks pregnant, I am a regular weed smoker I usually smoke once a day at night right before bed just a couple hits out of my pipe so I basically smoked every night for the first 4 weeks of my pregnancy because I did not know. I'm just wondering how much it would have hurt the fetus? I'm really freaking out.. I feel so guilty. Please help.

My wife and I didn't know we're pregnant and in a weekend fun with friends we smoked a bit of weed - we don't usually smoke weed or cigarettes.  This is not something we're regulary doing as I said, but how bad to the fetus can it be ?


As in the title, I'm conflicted whether to use the former or the latter. Logically speaking, I'd rather choose "hearts" since we're talking about everyones', but some quotes found on the internet make me wonder.

In a situation where say a group (or at least a plurality) of men is being addressed — for example on a sign passed by many married men — which is correct?  "Remind your wife."  or  "Remind your wives."


Languages like Ruby, Python, Lua, PHP, Node.js, etc. have a simple "shell" where you can type simple one-liners and see the result. Does Perl has something similar? I'm not looking for something fancy that does pretty printing (I'll use print()) or accepts multiline input.  The story is this:  I need to experiment with some regexps. I know I can do perl -e "..." but then I need to shell-escape the code and this complicates matters. If I had a Perl shell I wouldn't need to worry about escaping.

How can I start an interactive console for Perl, similar to the irb command for Ruby or python for Python?


Edwin Hubble discovery of redshift of distant galaxies make me wonder why is this phenomenon only occurs when object is further away, is it possible that redshift happens in short distance too such as a millimetre, nanometer etc? Is it more prominent the larger the distance or the flatter the spacetime curvature?

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


Doing my homework, got stuck on the template function part. I have the following main() in my .cpp file:  int main()  { Pair<char> letters('a', 'd'); cout << "\nThe first letter is: " << letters.getFirst(); cout << "\nThe second letter is: " << letters.getSecond();  cout << endl;  system("pause"); return 0; }   I need to use template to make the class exchageable, and here is what I have in the .h file:   template <class T> class Pair { private:       T letters; public:   T getFirst();   T getSecond(); };   now, in my VS, it says both getFrist() and getSecond() are not found. How am I supposed to pass T as a class in template?

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


Lets consider the set  $$ A = \{R\subset\mathbb{N}^2:R \text{ is a well-order of } \mathbb{N}\} $$ Now, it's clear that $\aleph_1\leq|A|\leq2^{\aleph_0}$(Since all the well-orders of $\mathbb{N}$ are isomorphic to some $\alpha<\aleph_1$ which gives $\aleph_1\leq|A|$ and every well-order of  $\mathbb{N}$ is a subset of $\mathbb{N}^2$, of which there are $2^{\aleph_0}$, giving $|A|\leq2^{\aleph_0}$)  If we were to assume the  then it clearly follows $|A|=\aleph_1=2^{\aleph_0}$(By Cantor-Berstein theorem)  However in ZFC, I'm not sure how to procced, I think that $|A|=2^{\aleph_0}$, but I do not know how to prove this or if this is right. Any idea on what to do?

Given a well-orderable infinite set $A$, can we always say that the set $$\left\{R\subset A\times A:\langle A,R\rangle\, \text{is a well-ordering}\right\}$$ has cardinality $2^{|A|}$? How much Choice is required for the proof of this? I believe that where $A$ is countably infinite, we can proceed without any use of Choice. Is that correct?


I accidentally ran sudo chown -R -v myuser:myuser /, essentially transferring sudo to my own user by mistake. I meant to only take the current directory.  How do I recover from this? I stopped it after a few seconds, but running anything with sudo now gives me:  sudo: /usr/bin/sudo must be owned by uid 0 and have the setuid bit set

I needed to edit a .config file (which I know for a fact is not creating these problems, just to clear that up) and it wouldn't let me save it, so I took ownership of /etc and all contents with the command chown -hR username /etc and that let me edit the .config file but now whenever I try to install any packages or use any sudo commands, it doesn't work  (I've checked for errors in the sudo file in sudoers.d and there was nothing wrong with that).   So how do I return it to the previous owner?


I am writing a program that uses GPS lat and long coordinates and a time change to determine speed with the output in units of m/s (precise to 0.1 m if feasible, but 1 m is sufficient).  When researching the distances associated with a change in latitude and longitude, however, I saw just how variable it was.  When continuing my research to find the distances associated with the general location I'm interested in, I could not find such a resource.  I know what area this program will be used in (Boston, Massachusetts) and the distance travelled during each time step is short enough that I can assume it moved across a plane.  As such, I am not looking for a formula to use in the general case over long distances but a look-up table or data base that has the relevant distances I need.  Where should I look online (or elsewhere) for this information?

I'm confused about the following basic points:    Do lat/long points have a projection or are they projection agnostic? Do these points live in a sphere or a plane?   I understand that projections are used to transform a spheroid into a plane while attempting to minimize artifacts along desired attributes (e.g. distance).    Is a lat/long measurement agnostic to projections in the sense that it captures some sort of "absolute position" on Earth? If it is in fact agnostic (if the point lives in the spheroid), is this the reason why we use havesine to calculate distances? How do CRS come into play when dealing with lat/long coordinates?   I seek feedback on misconceptions and pointers to material to learn about this stuff.


I have a question regarding Excel. We generate automatically a CSV file everyday, containing stuff looking like :  column1;column2;...;columnx text;date;text;249316479917397279   The issue is that the number 249316479917397279 is too long now to be displayed by Excel entirely. Excels shows "2,49316E+17" and even when I go edit the cell I see 249316479917397000.   The number is rounded by Excel and I lose the three last numbers, which are important for me since these numbers are IDs. I would Excel to display it as a text, without no rounding. I tried to generate my csv with quotes "249316479917397279" but dosn't change anything.  Is it possible?

Excel converting value 0503E000 to 5.03E+02 in any cell automatically in CSV I tried to convert it to text number and general but after i save it and reopen it again it goes back to 5.03E+02  How do I stop this from happening?


Help? I am stuck on this homework question and finding very difficult to answer

What is the distribution of $Y = e^X$ when $X$ is normally distributed?  Am I supposed to use characteristics function of normal random variable ?


So I've done extensive research on this and I've realized that GetDirectories will stop returning folders at the point it gets an UnauthorizedAccessException even if you have a try...catch block.  try {     foreach (DirectoryInfo directory in parent)     {         subDirectories = directory.GetDirectories();     } } catch (Exception e) { }   All the sub-directories will get into sub-directories until we hit the exception and then stop. Are there any solutions to this for my specific code? Thanks!

I am trying to display a list of all files found in the selected directory (and optionally any subdirectories). The problem I am having is that when the GetFiles() method comes across a folder that it cannot access, it throws an exception and the process stops.  How do I ignore this exception (and ignore the protected folder/file) and continue adding accessible files to the list?  try {     if (cbSubFolders.Checked == false)     {         string[] files = Directory.GetFiles(folderBrowserDialog1.SelectedPath);         foreach (string fileName in files)             ProcessFile(fileName);     }     else     {         string[] files = Directory.GetFiles(folderBrowserDialog1.SelectedPath, "*.*", SearchOption.AllDirectories);         foreach (string fileName in files)             ProcessFile(fileName);     }     lblNumberOfFilesDisplay.Enabled = true; } catch (UnauthorizedAccessException) { } finally {}


I have two physical servers - Dell Power Egde R710. I installed vCenter Server in order to manage both of them, I have created a cluster and added my 2 ESXi (servers) hosts.   I created a virtual machine but Im wondering if its possible that this single machine use resources of both servers? I mean, my servers have 2 CPUs (one server - 2 CPUs, two servers - 4 CPUs). Is it possible to create a virtual machine and if, how) to be able to use 4 CPUs, two from one server + two from the second server?

by now I have 10 servers for hpc, power computing oriented. My users need to launch several processes using qmake. The users are used to work with ubuntu 9.10, and the software from the repositories is switable for them.  I've deployed ubuntu 9.10 to all 10 servers (pxe rocks).  By now we work with parallel-ssh and cluster-ssh, which allows as to launch the same process to all servers. With this tools this tools the servers remain as independent but with the same software and the same launched command.  Now we would like to go to next step and see all the servers as a single one with all the resources from the other 9 as if was its resources.   The difference would be substantial in time to process and also time to design the command to launch.  Any advice on wich software to use will be very useful?  Thanks


This is the second time I am seeing something like this. This sentence is written by a native English speaker:     It looks like it's worked. I thought you must of fixed it.   1- It seems wrong to me, please correct me if I am wrong.   2- If it is wrong, why do they use of rather than have?  3- If it is informal language, is it ok to use it in emails, etc...?

Recently I've seen many people on Twitter use "of" instead of "have". Eg. Ben Stokes tweeted after the world cup final, " So proud to of represented my country in a world cup final"  I don't want to generalise, but I think I've seen this used by primarily British people. Is it slang or are my basics weak?


I want to replace my full phone interface with Sony z2 I have both the phones right now. So I was thinking to make a full cwm recovery of my z2 and flash it my xolo.  I know might be it won't work like that but if suppose I download the stock ROM of z2 from internet and correctly flash that to my Xolo will it work. (Can one run another other companies stock ROM on other phone)  Plz advice me the most correct method.  hardware specification of both the phone are approximately same

I own a MicroMax A100. I want to install the latest version of a different ROM (Samsung or Nexus).  Is it possible? If so, can you tell me how?  If not, can I install a ROM made for a different device, but from the same manufacturer? For example, could I install a ROM for the MicroMax A110, which is the successor of A100?


I want to prove that \begin{align}  \int_0^x O(t^n)dt  \neq O(x^{n+1})  \end{align} At first I tried to partially integrate but it did not work. Thanks, Axel

I have some big O()'s in an integral. How can i compute or estimate such an integral?


Let $A\in M_{n \times n}$ such that rank of $A$ is $1$. Prove that $\operatorname{trace}(A) = 0$ if and only if $A^2 = 0$.

(a) Prove that a square matrix $T$ of rank one has $\text{tr}(T)=0$ if and only if $T^2=0$.       (b) Consider a matrix $A$ of the form $A=aI+T$, where $a\ne0$, $I$ is the identity matrix,   and $T$ has rank one and zero trace. Find the inverse and the determinant of $A$.       (c) Find the inverse of $A$ as above when $T$ has rank one but nonzero trace $\text{tr}(T)=b$.      For which value of $b$ is $A$ not invertible?    I'm still stuck on part (a), but campus buildings are closing soon, so I'll be working from home but would love to get some hints / comments on this question.  I'll have limited access to this site - on my phone.  For part (a), I've been trying to look at the SVD of matrix $A$, since one can read off the rank very easily - by looking at the number of non-zero singular values of $A$.  Then I am trying some block matrix multiplication to see whether $T^2 = 0$, from assuming that $\text{tr}(T) =0$.  So far, no luck.  Do you think I should stick with this SVD approach, or is it better to play around with the definition and properties of nilpotent operators?  Any other hints for the other parts of the question would be greatly appreciated.  Thanks!


Today I installed a fresh copy of Windows 7 Home Premium x64 SP1. For some reason, it will just not update. I try to run Windows Update but all it does is hangs at "Checking for updates". I even let it sit there for 4 hours and it didn't do anything.  I looked for multiple solutions and none of them worked. I've reset windows update, I've done sfc /scannow, I've done the dism.exe command, I installed "Windows6.1-KB947821-v34-x64", but nothing seems to fix it.  I downloaded a windows diagnostic tool for windows update, and it did come up with an error that which it failed to fix: "0x800f08".  I don't know what to do at this point. Any help would be greatly appreciated. Thanks

I installed Windows 7 fresh and installed SP1. Now, when I try to check manually for Windows Updates it just hangs on the Checking for updates screen.    I tried running the tools in , but this did not fix the issue either:  No matter what I do it just hangs on the "Checking for updates..." screen and goes no further.


If you float two coffee beans in a cup of water that is being vibrated by your subwoofer (go to a sin wave generator online), the two beans will either be attracted to the sides of the cup or if positioned right will be attracted to each other in an accelerating manner.  What phenomenon is this, and could it be related to gravity in space?

Why does a cork ball float to the side of a glass as illustrated in the following GIF? What is the physical phenomenon behind this observation and why does it happen?


Ok here is the situation, there are few pc in my house, so I want to share files from one file to others. Samba is not an option, it finally broke on host ubuntu pc. before today only windows 10 pc couldn't connect to this pc now it is fully broken.  So i want an open-source app (some other way) that will allow me sharing files from one pc to another

I have a desktop (Ubuntu 13.04 & Win 7 Home Premium) and a Laptop (Ubuntu 12.04), both having WiFi adapters. I also have a WiFi router connected to internet which both my computers can access.  I want to share files between my desktop and my laptop using WiFi (similar to Homegroup on Windows 7 but without using Ethernet cables).  How do I set-up that?  I want to share files using both OSs, if anyone have have information about sharing files with any of the OS please answer!


I am running Windows 10 Pro on an Intel ComputeStick (Mod # STK1AW32SC). Ideally, I would like to automatically log into a standard user account (an Assigned Access account for running just one app) whenever it restarts or boots, such as when there is a power outage.   I have found , however, I am confused about step 3. In \Winlogon I see two more directories GPExtensions and VolatileUserMgrKey, as well as two files?: AlternateShells and AutoLogonChecked.   I do not see the ones the documentation says: AutoAdminLogon, DefaultUserName or DefaultPassword.   I've never done this before so I don't want to screw anything up, thanks!  For reference I'm pretty sure this Windows version is 32 bit.

The TweakUI powertoy for Windows XP had an option to auto-login. It stored your password and did the login for you. This was useful, since you kept password protection, but had login programs loaded when you first booted.  When you switched users or hibernated, it would still ask for a password, which is the desired behavior.  Is there a way of doing this in Windows 7?


Imagine a code like this:  vector<string> lsLineNumbers;     lsLineNumbers.push_back("9, 0xbaadf00d, 3, 4");     lsLineNumbers.push_back("0xcoffee99, 4, 7, 1, 3, 5, 0xdeadbeef, 78");   When you look in the debugger it looks like string array lsLineNumbers[0] = "9, 0xbaadf00d, 3, 4" and lsLineNumbers[1] = "0xcoffee99, 4, 7, 1, 3, 5, 0xdeadbeef, 78"  How to extract these number strings out so that I can do string to integer conversion? I can do it manually but I am sure there is a function for this. I would imagine a something like this ...  for (i = 0; i < lsLineNumbers.size(); i++) [     while((str = getstring(lsLineNumbers[0])) != '\0') {         num = _atoi64(str);         cout << num;     } }

I'm trying to iterate over the words of a string.  The string can be assumed to be composed of words separated by whitespace.  Note that I'm not interested in C string functions or that kind of character manipulation/access. Also, please give precedence to elegance over efficiency in your answer.  The best solution I have right now is:  #include <iostream> #include <sstream> #include <string>  using namespace std;  int main() {     string s = "Somewhere down the road";     istringstream iss(s);      do     {         string subs;         iss >> subs;         cout << "Substring: " << subs << endl;     } while (iss); }   Is there a more elegant way to do this?


Can anyone explain to me the advantages of defining an anonymous function and assigning to a variable, contrary to defining by function name. Ie.  var add = function(a, b) { return a+b}; var result = add(1, 2);   Contrary to  function add(a, b) { return a+b }; var result = add(1, 2);   BTW I'm new to javascript but done a lot of C-style coding.  Best regards Ben

I've recently started maintaining someone else's JavaScript code. I'm fixing bugs, adding features and also trying to tidy up the code and make it more consistent.  The previous developer used two ways of declaring functions and I can't work out if there is a reason behind it or not.  The two ways are:  var functionOne = function() {     // Some code };     function functionTwo() {     // Some code }   What are the reasons for using these two different methods and what are the pros and cons of each? Is there anything that can be done with one method that can't be done with the other?


I have posted questions about how to deal with scraping sites here: .  At the time I was helpfully redirected to this question here:      The answers there give a process for how to report scraping sites. I've used this. It's slow and works after several months. This question here isn't a question about how to currently report sites that steal content without attribution. It's about how to deal with the deluge of scraping that's happening. It's also an enquiry to find out what processes SE has to protect SE users' copyright outside of the site-reporting mechanism.   Recently, I've seen more and more sites scraping content off SE EL&U and SE ELL. There are now so many that I can't keep up with them. I think we need a public ongoing page accessible on Meta where people can list websites that are nicking content without the full proper attribution, and where TPTB (the powers that be) can get back to us once the situation has been resolved.   I'm sure this problem is affecting other SE sites too.  I am now more interested in what SE is doing to ensure that it isn't neglecting its users. I'm a bit surprised that users seem to have to find this stuff and report it. I kind of feel that it's SE's responsibility to check on a regular basis who is scraping its members' (and its own) material. Shouldn't this be a routine practice on their part? If not, the agreement that they put forward to users is kind of useless. It amounts to - anyone can scrape your content without attributing it to you under the terms set out here on SE - so long as you don't report them to us. This seems unacceptable to me.  Some scraping sites seem to be worse than others. Some link to SE, but not to the page they scraped the content from. Some list the username from here on SE but don't link to the page or mention SE or the specific SE site. There is definitely a range of violations going on. But it seems to me that SE has a duty of care towards its users - at least a moral one - to try to ensure that the terms set out on the site actually apply in a meaningful way.  What is the policy for checking up on who's nicking what from users here and from SE in general?  I have been advised that the answer will probably be that users need to take their own measures to protect their copyright. Is this correct?

of Stack Overflow, all content posted on Stack Exchange sites by their users (i.e. you wonderful people) has been provided to the whole universe under . For my fellow non-lawyers, that license basically means:   Anyone can use any Stack Exchange posts at any time without having to ask for permission Making money off of the copied content is permitted You don't even have to copy stuff from here verbatim; you can just use it as a starting point and make whatever edits you want There are just two rules you have to follow:   You have to provide . Simple links to the original post and author info are just fine. You have to  and allow other people to use your content, as long as they follow these very same rules. How meta!    (If you ever forget any of that, and want to refresh your memory, the license info is linked to in the footer of every page.)  There are, in fact, a lot of people who republish varying amounts of our content for assorted reasons. Unfortunately, there are some Stack Content Republishers Attributing Poorly and/or Excelling at Ranking (SCRAPERs, for short).  In this context, "attributing poorly" means any use that doesn't follow our attribution rules or make any other reasonable attempt at give credit. This can get pretty egregious; I've seen SCRAPERs that not only don't link back to SE originals, but also use fake author info and post dates to make it harder to find originals. By "excelling at ranking," I'm referring to copycat sites that end up higher in Google results than the original SE sites do for the same content. That's not necessarily wrong, but in some cases, it indicates inappropriate SEO hackery.  So, the question is: what can you do if you spot a SCRAPER?


I am sitting on a pile of data concerning wages at a local company and other information, such as the gender, whether the person in question belongs to a minority group etc. What I would like to investigate is whether an additional year of education gives the same relative increase in wages for lower and higher education. For this purpose, I have divided the original data into two subcategories; one group with at most 12 years of education and the other with 13 or more years of education. What I would like to perform is a Chow test of structural change of the form  \begin{equation} F=\frac{\frac{(RSS-(RSS_{\text{lower}}+RSS_{\text{higher}}))}{2}}{\frac{RSS_{\text{lower}}+RSS_{\text{higher}}}{n-2k}}=\frac{(n-2k)((RSS-(RSS_{\text{lower}}+RSS_{\text{higher}}))}{2(RSS_{\text{lower}}+RSS_{\text{higher}})} \sim F(k,n-2k) \end{equation} where $n$ is the total number of observations and $k$ is the number of explanatory variables.  Clearly, I could simply calculate the $RSS:$s directly and then construct $F$ explicitly.   total<-lm(SALARY~EDUC+GENDER+MINORITY)     lower<-lm(SALARY1~EDUC1+GENDER1+MINORITY1)     higher<-lm(SALARY2~EDUC2+GENDER2+MINORITY2)     RSStot<-sum(residuals(total)^2)     RSSlow<-sum(residuals(lower)^2)     RSShig<-sum(residuals(higher)^2)     ((576-6)((RSStot-(RSSlow+RSShig)))/(2(RSSlow+RSShig))      Nevertheless, I am sure there must be a way to do this directly in R. How exactly would that be? I would truly appreciate any enlightenment from any kindhearted spirit. Cheers to all!

I have found somewhere a mention to the possibility of using dummies variables instead of the Chow test to test whether the coefficients in two linear regressions on different data sets are equal.  Could someone please direct me to a reference where I could study the details?


How to set value for in clause in a preparedStatement in JDBC while executing a query.  Example:  connection.prepareStatement("Select * from test where field in (?)");   If this in-clause can hold multiple values how can I do it. Sometimes I know the list of parameters beforehand or sometimes I don't know beforehand. How to handle this case?

What are the best workarounds for using a SQL IN clause with instances of java.sql.PreparedStatement, which is not supported for multiple values due to SQL injection attack security issues: One ? placeholder represents one value, rather than a list of values.  Consider the following SQL statement:  SELECT my_column FROM my_table where search_column IN (?)   Using preparedStatement.setString( 1, "'A', 'B', 'C'" ); is essentially a non-working attempt at a workaround of the reasons for using ? in the first place.    What workarounds are available?


Can anyone solve 1b?         Find the derivatives of each of these functions.   b. $y = \frac{\sqrt[3]{4x^3+8}}{(x+2)^5}$      I am really confused, I used the quotient rule for differentiation of the chain rule and keep getting stuck.After the $y′=\frac{f′(x)g(x)−g′(x)f(x)}{g(x)^2}$.   so far this is what I have done

How can we find the derivative of  $y= \frac{(4x^3 +8)^{\frac{1}{3}}}{(x+2)^5}$?  so far this is what I have done, and am confused about what to do after?    sorry for the messy handwriting


I have a blender animation where I have used the trim text feature of the animation nodes add-on of blender. However, when I upload it to the render farm, those parts don't render out. I've been told, on blender stack exchange, that it's because the render farm does not have the animation nodes add-on installed. I would however appreciate it if someone suggested a workaround to this.

I have this 1000 frames animation where I had the text animated using the animation nodes add-on. However, when I put it on sheepit, the online render farm, none of the text animations showed up. Is there a fix for this?


I'm trying to setup HAProxy as an highly available reverse proxy. We're running it on a cluster of 3 nodes, where all nodes are identical. When a service is down on one of the node, any of the other nodes can handle the http request.  Therefore, I'm trying to setup HAProxy as such:  frontend main     bind *:80     default_backend back  backend back     server node01 localhost:8080 check fall 1 rise 1     server node02 node02:80 backup     server node03 node03:80 backup   This works, however, there's a window where HAProxy will return a 503 Service Unavailable when service is down and HAProxy is in the process of doing the failover towards node02.  Is there any way to setup HAProxy to detect that the request sent to service will not be handled, and to forward it to node02 without any interruption of service?  TLDR: Is there any way to setup HAProxy for transparent failover to backup servers?

Let's say I have web01 in my list of backend servers, and web01 goes down.  It will take a few seconds for HAProxy to notice the server is down (depending on the health check interval and how long the timeout is) and take it out of rotation.  If a request comes in before that's happened, the client will end up receiving a 503 Service Unavailable error.  What I'd like to happen is to have HAProxy automatically re-try that same request again on another server.  I realize the request would end up being really slow, but it would end up resulting in a success rather than an error.  Is there a way to configure HAProxy to retry the HTTP request on another server instead of erroring out?  Ideally, I don't ever want a client to receive an error if there's any working servers in the cluster.  Here's my haproxy.cfg:  global         maxconn 4096         debug  defaults         mode    http         contimeout      5000         clitimeout      50000         srvtimeout      50000  frontend http-in         bind *:80         acl service1 path_reg ^/service1/         acl service2 path_reg ^/service2/         use_backend service1 if service1         use_backend service2 if service2  backend service1         server web01 127.0.0.1:85 check         server web02 127.0.0.1:86 check         reqrep ^([^\ :]*)\ /service1/(.*)     \1\ /\2  backend service2         server web03 127.0.0.1:87 check         server web04 127.0.0.1:88 check         reqrep ^([^\ :]*)\ /service2/(.*)     \1\ /\2


When we apply a force, there's always a reaction force too. Why do forces always come in pairs?

I've never understood why the conservation of momentum law is taught in schools as "every force has an equal opposite reaction".   To me a gun's recoil is self explanatory; the explosion sits in-between the bullet and the back of the barrel and the gun and bullet fly in opposite directions (as would be expected). The bullet has a much higher velocity than the gun because of its lower comparative mass. Am I wrong here?  Same with stepping off a boat. You push against the boat and the mass differential between your body and the boat as well as the friction in the water enables you to jump off the boat onto the ground without falling on your face. The boat comparatively moves in the opposite direction minimally, but not because of some weird law, simply because you pushed it back!  To tell kids in school "every force has an equal and opposite force" is misleading I think. It makes it seem as if an equal mysterious force manifests out of thin air to keep the universe happy.   Just thinking - "direction of application" is only relevant to perspective, there really is no direction of application since the force and its counterpart occur simultaneously… so more accurately:   The total force can never be propagated along a single vector?


As far as I know all badges being earned once will be never retracted, e.g. when votes are changed on vote dependent badge like “great answer” etc. But what if the badge was earned by serial voting of unrelated to the badge owner user and when that user(s) is(are) suspended for creating sock puppet accounts. Should the badge be retracted? I think it should. Looking for the community opinions.

In  (not feature request), :  ... if we find that people are abusing the system their accounts may get suspended. I would consider that kind of behavior abuse.  Well  sure qualifies. He has 11 Stack Exchange accounts and has in the last day spammed at least 8 of them to gain the Suffrage and sometimes Vox Populi badges. That's over 250 votes† in just a few hours! (And  -- while voting on other user's posts too.) I guarantee that he's not voting on those posts for/by their merits. Here's when he scammed the Suffrage badge per site (while also gaming the Vox Populi on some sites):                      - 2017-03-11 16:23:15Z                     - 2017-03-11 17:41:41Z                     - 2017-03-11 18:08:13Z                           - 2017-03-11 19:25:10Z                  - 2017-03-11 19:55:16Z                               - 2017-03-11 20:00:49Z               - 2017-03-11 20:03:13Z  - 2017-03-11 21:11:40Z  Note that he got the badge on three sites within an 8 minute span (but that might just be job run times). Please revoke badges gained through improper voting. And, maybe also warn/suspend such abusive voters.   † His account vote totals don't show all votes as some serial voting was reversed -- but none of the ill-gotten badges were.


Search results on  may contain questions which have tags.         These tags are clickable, but .  Seems related to old one:

If you search for something on "all sites" (using the searchbox at the top of , you'll reach the search results, e.g.  .  If you click directly on a tag on that page, e.g.        You get 404 Page Not Found error, e.g.     Steps to reproduce   Go to  and enter e.g. "keyforge" into the "Search all sites" field. Arrive at  Click on the "keyforge" tag below a search entry. Reach  (404 page not found)   Expected behaviour  Reach   System Info  Happens in both Firefox and Vivaldi browsers on Windows 10.


I am trying to convert a python list into a 2d matrix without numpy library.   However, in doing so, my code is not working as expected.   n=3 arr = [16,13,4,16,13,19,23,8,11]   mat=[[0]*n]*n                    #initialising a 3*3 matrix  for a in range(n):     for b in range(n):         mat[a][b]=arr[b]         print(mat)               #To understand the result of each iteration     if len(arr) >n:         arr=arr[n:]  print(mat)   The obtained output is:     [[16, 0, 0], [16, 0, 0], [16, 0, 0]]   [[16, 13, 0], [16, 13, 0], [16, 13, 0]]   [[16, 13, 4], [16, 13, 4], [16, 13, 4]]   [[16, 13, 4], [16, 13, 4], [16, 13, 4]]   [[16, 13, 4], [16, 13, 4], [16, 13, 4]]   [[16, 13, 19], [16, 13, 19], [16, 13, 19]]   [[23, 13, 19], [23, 13, 19], [23, 13, 19]]   [[23, 8, 19], [23, 8, 19], [23, 8, 19]]   [[23, 8, 11], [23, 8, 11], [23, 8, 11]]        finally:                               [[23, 8, 11], [23, 8, 11], [23, 8, 11]]   instead of:     [[16,13,4], [16,13,19], [23, 8, 11]]   Why is the value of the entire column changing after each iteration instead of just that cell?  What possible change in the code can give the desired result(i.e- converting the list of 9 elements to a 3x3 matrix)?

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


Let $\mu :\mathcal{B}(\mathbb{R}) \to [0,\infty]$ be a measure such that for all $h\in \mathbb{R}$ and $A\in \mathcal{B}(\mathbb{R})$, $\mu(A+h) = \mu(A)$. Let $c= \mu((0,1])$.  I want to prove the property that $\mu((0,x]) = cx$ for any $x\geq 0$.   I have already proven that $\forall x\geq 0, \forall q\in\mathbb{N}: \mu((0,qx]) = q\mu((0,x])$.  As well as $\forall p,q\in \mathbb{N}: \mu((0,\frac{p}{q}]) = c\frac{p}{q}$.   However now I'm stuck. I know that $\mu$ is a measure and therefore $\sigma$-additive, however I am not quite sure how to use this because $x$ is now a real number instead of an integer or a fraction.

What are all the translation invariant measures on $\mathbb{R}$?  Except Lebesgue measure on $\mathbb R$ I didn't find any translation invariant measure. So I put this question?  I know that if $\mu$ is a measure then $c \times \mu$ is again a measure where $c>0$.


I have searched for getting an information to select textbook for abstract algebra by myself. Now I have three candidates for my abstract algebra text.  (So far, I have learned one-year linear algebra and undergraduate level analysis)  I really appreciate for you to help me select a nice textbook.   Stephen Lovett, Abstract Algebra: Structures and Applications  P.B. Bhattacharya, S.K. Jain, S.R. Nagpaul, Basic Abstract Algebra David S. Dummit, Richard M. Foote, Abstract Algebra   Could you give me an recommendation for choosing textbook with the reason why you recommend that book?(If you have another nice textbook, tell me your another recommended book.)

Last semester I picked up an algebra course at my university, which unfortunately was scheduled during my exams of my major (I'm a computer science major). So I had to self study the material, however, the self written syllabus was not self study friendly (good syllabus overall though).  The course was split up into 3 parts, group theory, ring theory and field theory. As a computer science major we only had to study the first 2.  Now that I passed the exam for this course I want to study the field theory part ( which covers Galois theory, etc).  So, now I want to ask whether any of you know any good books on abstract algebra, which lift off at basic ring theory and continue to more advanced ring theory and to finite fields, Galois theory, ...  Please keep in mind that I am not a math major, and that I would like books which are suited for self study (thus a lot of examples and intuition).  Thanks in advance!


Googling I mainly get hits on Travel, relating to transporting airguns. But I want to ask about their operation and usage and maintenance. Anyone know where would be best?   (I know there are also many local legal restrictions but that's not my main query here)

I spend most of my time on the Writing Beta SE, because I'm a writer.  I have a question about how to refer to and explain gun mechanics in my novel, as I am not experienced with guns, but these types of questions usually are closed as asking "what to write".  Is there a weaponry SE, or another relevant SE to post this question to?


I am trying to connect to a PHP page in my Android app. I have the permissions set. However, I keep getting Invalid ip address. It seems I need . However, I don't know how to set it up, maybe a class that runs separately like this:  , but on that link I have no idea why they are returning the RSSFeed   The actual website link works. It is just my app throwing this error.  ArrayList<NameValuePair> nameValuePairs = new ArrayList<NameValuePair>();  nameValuePairs.add(new BasicNameValuePair("id", "123")); nameValuePairs.add(new BasicNameValuePair("name", "test name")); nameValuePairs.add(new BasicNameValuePair("family_memb_id", "456");  try {     HttpClient httpclient = new DefaultHttpClient();     HttpPost httppost = new HttpPost("http://mysite/insert.php");      httppost.setEntity(new UrlEncodedFormEntity(nameValuePairs));     HttpResponse response = httpclient.execute(httppost);     HttpEntity entity = response.getEntity();     is = entity.getContent();  }   catch(Exception e)  {      Log.e("app", "Failed 1: " + e.toString());  }   try  {      BufferedReader reader = new BufferedReader(new InputStreamReader(is,"iso-8859-1"),8);      StringBuilder sb = new StringBuilder();       while ((line = reader.readLine()) != null)          sb.append(line + "\n");       is.close();      result = sb.toString();  }   catch(Exception e)  {      Log.e("app", "Failed 2: " + e.toString());  }   try  {      JSONObject json_data = new JSONObject(result);      code=(json_data.getInt("code"));       if(code==1)      {          Toast.makeText(getBaseContext(), "Inserted Successfully",                         Toast.LENGTH_SHORT).show();      }      else      {          Toast.makeText(getBaseContext(), "Sorry, Try Again",                         Toast.LENGTH_LONG).show();      }  }  catch(Exception e)  {      Log.e("app", "Failed 3: " + e.toString());  }   Error Log:     Failed 1: android.os.NetworkOnMainThreadException   Failed 2: java.lang.NullPointerException: lock == null   Failed 3: java.lang.NullPointerException: Attempt to invoke virtual  method 'int java.lang.String.length()' on a null object reference   This is not a duplicate of null pointer exception; although my log shows a null pointer exception, my problem happens before that. The null pointer is a side effect of what the real issue is.

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


In a custom REST API method, I would like to identify the user (typically get_current_user_id() then retrieve their data from database (things like they're role and some custom permission).  But so far get_current_user_id() returns 0 (which is not the current user ID).  Is it possible to identify user in REST API?  Otherwise, a solution I see is using a page as "sort of" API ... but I think that would be an ugly solution.

Consider the following class.  <?php class MCQAcademy_Endpoint extends WP_REST_Controller {      /**      * Register the routes for the objects of the controller.      */     public function register_routes() {         $version = '1';         $namespace = 'custompath/v' . $version;         $base = 'endpointbase';          register_rest_route(             $namespace,             '/' . $base,             array(                 array(                     'methods'         => WP_REST_Server::READABLE,                     'callback'        => array( $this, 'get_items' ),                     'permission_callback' => array( $this, 'get_items_permissions_check' ),                     'args'            => array(),                 )             )         );     }      /**      *      */     public function get_items( $request ) {         $rs = array(             'data' => array(),             'request' => array(                 'lang' => 'en',             ),         );          $args = array();         $items = get_posts( $args );          foreach( $items as $item ) {             $itemdata = $this->prepare_item_for_response( $item, $request );             $rs['data'][] = $this->prepare_response_for_collection( $itemdata );         }          $rs['wp_get_current_user'] = wp_get_current_user(); // Does not output as expected          return new WP_REST_Response( $rs, 200 );     }      /**      * Check if a given request has access to get items      */     public function get_items_permissions_check( $request ) {         return true; // to make readable by all     }       /**      * Prepare the item for create or update operation      */     protected function prepare_item_for_database( $request ) {         return $request;     }      /**      * Prepare the item for the REST response      */     public function prepare_item_for_response( $item, $request ) {         $data = array(             'ID' => $item->ID,             'post_content' => wpautop($item->post_content),             'post_title' => $item->post_title,         );          return $data;     }      /**      * Get the query params for collections      */     public function get_collection_params() {         return array(             'page'     => array(                 'description'        => 'Current page of the collection.',                 'type'               => 'integer',                 'default'            => 1,                 'sanitize_callback'  => 'absint',             ),             'per_page' => array(                 'description'        => 'Maximum number of items to be returned in result set.',                 'type'               => 'integer',                 'default'            => 10,                 'sanitize_callback'  => 'absint',             ),             'search'   => array(                 'description'        => 'Limit results to those matching a string.',                 'type'               => 'string',                 'sanitize_callback'  => 'sanitize_text_field',             ),         );     }      // Register our REST Server     public function hook_rest_server(){         add_action( 'rest_api_init', array( $this, 'register_routes' ) );     } }  $myEndpoint = new MCQAcademy_Endpoint(); $myEndpoint->hook_rest_server();   Everything is going well except calling the wp_get_current_user() function in the get_items() function return empty user even though the user is logged in in the website.


I am translating an academic paper to English. However, most of the sources cited at the end, are in other languages (e.g. Russian). Do I need to translate the list of references into English as well?

Assume one wants to cite a paper written in a different language than the article citing said paper (e.g., ones own article is written in English, but the source is French).   How to properly handle citation in such a case?  Do I cite the original (French) title or a translated title? If I use a translated title, people might have a hard time to find the source; if the original (French) title is cited, people might have a hard time understanding it.


So I have a fairly large polyline network covering a decent chunk of North America, containing just shy of 900,000 table records. I want to do some very simple "GIS 101" kind of processing to it -- I want to buffer everything with the "Dissolve" parameter set to "ALL".  Well, unsurprisingly, this is way more than ArcGIS is ready to take on, even w/ 6 GB RAM & with everything in a geodatabase. I know the "Dissolve" operation is more prone to running out of memory in such cases than "Buffer", so I tried to run "Buffer" without "Dissolve = ALL", but even that will not generate a usable output (the file exists but won't draw or reveal its attribute table). And, in any case, I am sure the subsequent "Dissolve" would hang.  Here's what I've tried:   Breaking up the network into smaller pieces. Well, this seems like a non-starter, because I need to make sure I don't cut any line segments apart in doing so. Of course selecting polyline segments sequentially from the attribute table will just select random pieces of polylines all over the place, shredding the integrity of the network.  I'm not sure how to break it up programmatically such that no connected pieces are broken apart. Running the buffer & dissolve in QGIS, based on some hearsay that it was better at handling large datasets. Like ArcGIS, it also just hung there forever. Importing everything into R with the "maptools" package and seeing if I could do it there. The data is so huge I couldn't even read it in within a reasonable time span.   There's a whole lot of talk out there about this kind of situation, but it always ultimately ends with "you need to find a way to break up your large dataset." I'm not really sure how this can be done cleanly with a huge network of stream polylines, barring some crazy Python script that can tell, for each polyline segment, which ones it's connected to, and select those only, until the entire spatially discrete sub-network is selected, write that to a single feature, & then move on to the next such sub-network.  This seems absurdly complex as a workaround for very simple processing on a not-even-all-that-big dataset (though I'll try it if I have to), but can anyone tell me how I can get this thing buffered?? Other software / workarounds / magic incantations / human sacrifice?? (And there'll be yet more steps after the buffer/dissolve, which would be no sweat with smaller data but will probably cause a minor earthquake if I try them with this beast).  EDIT :  After exploring this much more in-depth, I feel this question hasn't been adequately addressed by the duplicate question or the main suggestions here. Here's why:    The Dice tool appears to be for reducing the number of vertices in individual features? I don't have individual streamlines with >3,000 vertices, but in any case, I've used Dice with a vertices limit of 100, and still cannot run the dissolve.  Breaking the streams into 100 pieces and dissolving each one requires an "uber-Dissolve" at the end to combine the pieces, which will have buffers overlapping with one another. This "uber-Dissolve" experiences the same memory failure as the original approach, even though there is much less to dissolve after the 100 pieces have been processed. So this approach indeed doesn't seem to work, though for a completely different reason than what I stated earlier.   It seems PostGIS has implemented an approach called "cascaded unions" that addresses this general problem, which will be fun to explore, but in the meantime I was hoping for an ArcGIS-/Python-/QGIS-based solution.

Using ArcGIS 10.1.  I have a large polygon feature class (130,000 records).  I need to do an inside/outside buffer (+5 then -5 to fill in some gaps)... the process takes so long, I'm looking for a way to speed it up.  Dissolving?  Splitting into smaller chunks. Any tips are appreciated.


If $f_1:X_1\to Y_1$, $\ldots$, $f_n:X_n\to Y_n$ are maps, is there a term for the map $\left(x_1,\ldots,x_n\right)\mapsto\left(f_1\left(x_1\right),\ldots,f_n\left(x_n\right)\right)$ from $X_1\times\cdots\times X_n$ to $Y_1\times\cdots\times Y_n$? Thanks.

Some simple vector fields have components that are just a function of their own variable. for example, $$F(x,y,z)=\begin{bmatrix}x^2+1\\\sin y\\3\end{bmatrix}$$ as opposed to: $$F(x,y)=\begin{bmatrix}5x+y^2\\4\sin x\end{bmatrix}$$ They feel somewhat special, and they are easier to work with in general. Is there a formal name for these? How would I refer to such a vector field concisely?


What is the best way to make a deep copy of a Dictionary?  I can use one of Jon Skeet's answers (), but those answers are 8 years old.  So nearly a decade later, is that still the best approach, or is there a better way?

I've got a generic dictionary Dictionary<string, T> that I would like to essentially make a Clone() of ..any suggestions.


I'm trying to figure out how to make certain features stick out of a cropped circle image. For example, I have a portrait of someone that I have cropped into a circle, but I would like to have her hand that is waving be on top of he circle outline/outside of cropped circle to show some dimension. Is there a way to do this?

I’m looking for a non-destructive way of allowing an image to be partially "clipped" by a clipping mask, like so:    I view the above image as having three parts…   a Person (top layer; being clipped) a Pattern (background layer; being clipped) a Shape (bottom layer; does the clipping)   The Person and Pattern represent the crux of the matter, since the pattern should be clipped entirely, whereas the person is only partially clipped.    Here’s an example of how I achieved this (in an undesired manner):  #1  Here is my Shape, accompanied by the Pattern and Person that will eventually be "clipped" by said Circle:     (This is where my process becomes convoluted)   #2  First, I create a Duplicate Layer of my Person and horizontally align this layer with my Shape. Like so:    #3  Next, I use the magic wand to select my Circle.  #4  After which, I use the Magnetic lasso tool to add the top of my duplicate Person to the same selection.  #5  I then use this selection to create a Layer Mask for my Person.  #6  Finally, I merge these two layers into one shape. Here is what I have thus far:     (From here on it becomes simple)   #7  I used my (now rasterized) shape to as a clipping mask for Pattern…    #8  and finally my original Person…     (Fin)   Is there straightforward way to allowing my Person to "escape" my clipping mask and move around freely without Steps #2 through #6, which is limiting due to obvious disadvantages.   For example: If I decided I wanted to offset my Person, after my "clipping" shape had already been rasterized, I would have to start from the beginning since it would look like this…    Thanks for reading this far.


I have an older laptop that has Windows XP and Ubuntu 7.04 installed with no network connection currently. I can boot either partition using GRUB to select which to load. Since the Ubuntu version is so old I would like to upgrade or install Ubuntu 14.10. There is nothing on the Ubuntu 7.04 installation that has any value, but I don't want to mess up the Windows XP partition.  I've used Universal USB Installer to create a bootable USB with Ubuntu 14.04 using ubuntu-14.04.2-server-amd64.iso. I am able to boot with the USB flash drive and see a Ubuntu menu. One of the options is to install Ubuntu Server. I tried that option initially, but apparently it needs to download packages over the Internet to perform the install.  Without a network connection the install won't continue.  I assume that there must be a way of including the required packages on the USB flash drive so that network connectivity is not required, but I'm not sure where these setup packages can be found or even where to put them on the USB flash drive.  How can I create a bootable USB flash drive that contains all of the required install packages?  Once I've created the USB flash drive without networking requirements, how do I install to the partition containing my existing Ubuntu 7.04 partition without messing up my Windows XP partition? I am using GRUB. The installation help page has so many different options. One of them is close to what I think I need, but I don't see instructions specifically for installing to an existing Ubuntu partition in a multiple boot scenario.

I dual booted ubuntu 11.04/11.10 a while ago with a USB stick and i want to uninstall it.   I would like to completely uninstall the old version and get 12.04.  I have a 64 bit laptop. Please help!


I am trying to create a dropdownlist and a increment/decrement button in my custom UI Panel. I can't seem to find how to do this. Does anyone know how?  Here are visual Examples      Thank you in advance for your help and have a nice day! :)

I was watching this  on making a custom UI tab using Python, and in the line from bpy.types import Menu, Panel, UIList, I see the names of objects that look like they can all be used to make different UI elements. Does bpy.types contain all the objects that people use when they want to make custom UI elements?


I have this code, and Underfull \hbox (badness 1783) in paragraph at lines 42--44 error. Can anyone help me fixing this error?  \begin{IEEEkeywords} Decomposition Algorithm, Net Nodal Electricity Demands, Robust Optimization, Transmission Switching, Uncertainty Handling. \end{IEEEkeywords}

I'm coding a TeX file and although the .pdf is correctly rendered, I'm using "stone age" tools to code it. As some examples, I use \\ to leave a line space between two paragraphs, or \noindent in every paragraph I start. Basically, I'm just using the basic TeX data I have to code a paper, but I'm sure there are things that can be replaced with much better and appropriate codes, since I get badness 10000. This is the console:  *geometry* detected driver: pdftex ("C:\Archivos de programa\MiKTeX 2.9\tex\latex\amsfonts\umsa.fd") ("C:\Archivos de programa\MiKTeX 2.9\tex\latex\amsfonts\umsb.fd") Underfull \hbox (badness 10000) in paragraph at lines 10--11 [1{C:/Documents and Settings/All Users/Datos de programa/MiKTeX/2.9/pdftex/conf ig/pdftex.map}] Overfull \hbox (10.8009pt too wide) detected at line 49 \OML/cmm/m/it/14.4  [] \OT1/cmr/m/n/14.4 + 1 = [] [] \OML/cmm/m/it/14.4 x \OT1 /cmr/m/n/14.4 + [] [] \OML/cmm/m/it/14.4 x [2] Overfull \hbox (26.66542pt too wide) in alignment at lines 80--82  [][][] [] [3] Overfull \hbox (23.60692pt too wide) detected at line 90 \OML/cmm/m/it/14.4  [] \OMS/cmsy/m/n/14.4 ><C:/Archivos de programa/MiKTeX 2 .9/fonts/type1/public/amsfonts/symbols/msbm10.pfb>   How could I clean up these errors, which I'm guessing are basic?


Every time I try to connect it says invalid name. Could you give me some tips to help fix that? I have tried restarting my game but that didn't work. I also tried a different server but that also did not work. Does anyone know what my problem is?

I am having trouble getting onto a server in Minecraft PE on iOS. When I tap on the person's server it just says invalid name:    I have tried turning off and restarting the iPad, going to home screen and logging back into the server but I have had no luck and no change. Is there a reason why this is so?


I have a client in the forestry sector that would like me to run some maps with criteria that I’ve never managed for. These maps will delineate (using polygons) areas of slope (0-20%,20-40%,>40%), distance from road centreline (0-125m, 125-250m, 250-350m, >350m) and “adverse” and “favourable” skids for a given “block area”.  The slope polys and distance buffers are easy enough to produce; I do this all the time.  The challenge for me will be figuring out how to identify the skid conditions. To give more insight on that, a “favourable” skid is defined as an area where harvested wood will be moved “downhill” to a road for decking. An “adverse” skid would be an area where the machine has to skid wood uphill. So this ultimately comes down to the location of the road, the +/- condition of the slope, and the aspect of the slope relative to the road.  It’s a fairly complex condition to analyze, but I’m sure it can be done. My client is asking me to replicate another GIS contractor’s version of this product… which I am fairly certain is generated with some sort of model or script.  Has anyone done anything similar, or have any insight on how I could achieve these results?   I am running ArcGIS 10.3 and use anything from 1m-20m DEM and LiDAR datasets, but each block has its own constraints.

Is there a possibility to determine the surface area above the road and the surface of the terrain below the road or between two or more roads? I want to pull the trees down the hill and up the hill to the roads. The price of skidding trees is different so I would like to know what the surface (ha) is above and below the road?    Here is an example, orange is uphill and red is downhill. I think this is solved with a raster calculator    Here is the method, but I do not know how to solve it in ArcGIS Desktop


What I'm doing is working with a text document that I'm pulling numbers from a saved text document, each line has its own number, and it ignores any lines starting with a !, so, when using these codes, I am getting a NullPointerException and I'm not sure why, Its not filling the ArrayList because of this, how come?  try{                 File f = new File(extStorageDirectory+"/data.txt");                 FileInputStream fileIS = new FileInputStream(f);                 BufferedReader buf = new BufferedReader(new InputStreamReader(fileIS));                 String readString = new String();                 integers.clear();                char check;                while((readString = buf.readLine())!= null){                    check = readString.charAt(0);                   if(check == '!'){                    }                   else{                       //integers.add(0,Integer.parseInt(readString));                       if(check == 0){                           integers.add(0);                       } else {                           if(check == 1) {                               integers.add(1);                           } else {                               if(check == 2){                                   integers.add(2);                               }                           }                       }                   }                }             } catch (Exception e) {                 Toast.makeText(getApplicationContext(),"Find Data: "+e.toString(),Toast.LENGTH_LONG).show();             }

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


I have Win10 Home on my laptop in English (United States). Personally I need only two keyboard layouts: English (US) and Russian. But for some reason there appears a third one: English (INTL), which for example uses quotes etc to make symbols outside of standard English alphabet. This keyboard is not listed among those in Settings (I only see Russian and English US there). How do I removed it. Permanently. I never want for it to come back. Please.

Update: this is a lengthy post, you can     Note: The quick language list refers to the list in the screenshot below, accessible throught the shortcut Win + Space bar  I have two languages for windows spell check in my system, English (United States) and French (Switzerland), but despite both languages being properly configured with "Swiss French" input keyboard, US Keyboard input keeps appearing on this list:    Here's the settings for English (United States) language, you can see the only input is "Swiss French":    Same for Français (Suisse), the only input is "Swiss French":    In the Control Panel, both are also set as Swiss French:    All my settings are set to use "language list":     Here's a few things that I already tried:   I already managed to remove it by some language configuration gymnastics, by adding and removing languages, it always eventually comes back I have already done this:  There's no mention of US Keyboard in my registry settings either:     Please help, I'm desperate, this is my third computer with Windows 10 and they all do the same thing.


I need some module which can convert drupal 7 site into static HTML site. I tried with html export dev version but it wont work. please help me if there is any other way to create static site from Drupal 7.

I wonder if there is an existing  module that can help in the subject. I am not looking for a caching module (like Boost or Varnish), but a way to export my whole site (or only certain pages) into static.  The idea is that I want my web server will be a very simple and light and will only serve static files (html/css/js) - no database on production, no php engine will be installed on server. All the Drupal engine will be on another server, export will be done each time adding/editing/changing a node or view, and a new set of html files will be created in a directory structure.  These files will later on be copied to the production site that will serve always and only static files, no .htaccess that will check requests if file exist etc.   Is there a module for that, or a workaround that this can be achieved with Drupal?  Thanks


I want to do something inside the if statement. But i cant able to do it since one error is coming in the code saying "cannot read property of undefined".  I don't understand. How can it not read cid[j][1] as its value is clearly equal to a number stored.   function checkCashRegister(price, cash, cid) {     let sum=0;     let change=cash-price;     let myarr=[];     for(let i=0;i<cid.length;i++){       sum=sum+cid[i][1];     }     sum=Math.floor(sum*100)/100;      cid.reverse();     console.log(cid);      if(sum>change){       let arr=[["PENNY", 0.01], ["NICKEL", 0.05], ["DIME", 0.1], ["QUARTER", 0.25], ["ONE", 1], ["FIVE", 5], ["TEN", 10], ["TWENTY", 20], ["ONE HUNDRED", 100]];        for(let j=0;j<=cid.length-1;j++){         if(change>=cid[j][1] && change<=cid[j+1][1]){          }       }       }     }      checkCashRegister(3.26, 100, [["PENNY", 1.01], ["NICKEL", 2.05], ["DIME", 3.1], ["QUARTER", 4.25], ["ONE", 90], ["FIVE", 55], ["TEN", 20], ["TWENTY", 60], ["ONE HUNDRED", 100]]);

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


I have several watercolor swatches that have the shape I want to use in a design. But I want to adjust the overall color of the shape to be one of our brand colors. I know that you can use the Hue/Saturation tool and drag the different aspects, but what if I want to use one of my RGB/HEX numbers as a guide?   I'd like to change this so that the "main" color could be 6f9fcd or 96ad3e or eeba30 for example.

I have this graphic. I need to change the color of the graphic to hex color: 1485cc...is there a way to make this graphic match that particular hex color hue...without me having to have to re create the graphic.


Let $f,g:[a,b]\to\Bbb{R}$ integrable functions. Let's dot each partition $P$ in two different ways, choosing in all the interval $[t_{i-1},t_i]$ a point $\xi_i$ and a dot $\eta_i$. Show that: $$\lim_{|P|\to0} \sum_{i=1}^n f(\xi_i)g(\eta_i)(t_{i}-t_{i-1})=\int_a^b f(x)g(x)dx$$  I need something as accurate as possible, because i really need to understand this question and i'm stuck at the very beginning.

I'm studying the Darboux definition of integrability, which I completely explained . There's an exercise that asks me to prove that the Darboux Integrability is equivalent to Riemann Integrability, but this Riemann integral is defined as the following:  It first defines a 'pointed' partition (I don't know how to say it in ensligh) by the following: a 'pointed' partition $[a,b]$ is a pair $P^*=(E,ξ)$, where $P=\{t_0, t_1, \cdots, t_n\}$ is a partition of $[a,b]$ and $ξ = (ξ_1, \cdots, ξ_n)$ is a list of $n$ chosen numbers such that $t_{i-1}\le ξ_i\le t_i$ for each $i=1,\cdots ,n$.  Now, the Riemann Integral is defined as:  $$\sum(f,P^*) = \sum_{i=1}^n f(ξ_i)(t_i-t_{i-1})$$  (I didn't understand the notation for the left hand side of the equation, by the way)  Finally, I'm asked to prove the following: given $f,g:[a,b]\to \mathbb{R}$ integrable functions, for the entire partition $P=\{t_0, \cdots, t_n\}$ of $[a,b]$ let $P^* = (P,ξ)$ and $P^{\#} = (P, η)$ be pointed partitions of $P$, then:  $$\lim_{|P|\to 0}\sum f(ξ_i)g(η_i)(t_i-t_{i-1}) = \int_a^b f(x)g(x) \ dx$$  I guess here I need to prove that the Riemann Integral of the product of two functions if the darboux integral of $f(x)g(x)$, but it seems too obvious, I just need to verify that $f,g$ are integrable, then their product is too, isn't it? I'm pretty sure this should be a hard question. Is there another interpretation that I'm missing?