I have a trouble with nested for-loop breaking.   The further code suppose to find pixels of certain color, which example contains in opened file with step 50 along x and 20 along y:   im1 = Image.open("C:\\Users\\Poos\\Desktop\\G\\green_pixel.bmp") A = list(im1.getdata())  x = 0 y = 0  im2 = ImageGrab.grab() B = list(im2.getdata())  for x in range(0,1024, 50):     for y in range(0,600, 20):       if(B != A):          im3 = im2.crop((x,y,x+1,y+1))          B = list(im3.getdata())          print(x, y)        else:          print("hooray!")          break        break   As soon as the pixel is detected the both loops should break, printing some text.   But the x-loop won't break wherever the outer break is placed, printing my text multiple times.   It seems that I've tried all possible variants for outer break position, but nothing works.   What is the problem here?


When I type:   whereis boost   it shows:  /usr/include/boost   Now I want to list all the files in this directory, so I type:  whereis boost | ls   But it only shows the files in the current working directory. Is there anyway to list all the files more quickly following the idea above (the way can be different but the idea is I want to quickly have a glimpse at a directory which I find with whereis, locate or something like that).


I'm talking about the mount option. What is it used for? What is the purpose behind preventing device nodes from being created in a filesystem?


What does it mean for a map $\phi$ to be $\mathbb R$-linear or $\mathbb{C}$-linear? I have tried to look for this definition on Google but I cannot find it.


Confidence bands in case of fitting ARIMA in R?

I want to look at the acf and pacf of my data, to identify the model for my mean equation, so I want to fit an ARMA for my mean equation and later on model the conditional variance by a ARCH/GARCH (I know I have to do jointly model estimation). In the first step I want to look at the ACF and PACF for identifying, I used the standard Acf of the forecast library, but I noticed, that the confidence bands in these plots are given for testing randomness and not for fitting a ARMA.  As  says:     Correlograms are also used in the model identification stage for   fitting ARIMA models. In this case, a moving average model is assumed   for the data and the following confidence bands should be generated:   $   \pm z_{1-\alpha/2}\sqrt{\frac{1}{N}\left(1+2\sum_{i=1}^{k} y_i^2\right)} $ How can I get these confidence bands, which increase as the lag increases?


Error wire transfer into intermediary bank

I want to know how many days does it take for a cancelled wire transfer to be  reversed into my account.


I've recently begun to use iTerm2 instead of the macOS Terminal application and I'm really happy with it. I'm very used to use to exit command to close the instance that currently has focus. With instance I mean one of the following: Tab, Window or Split Panel.   How can I write a function exit that closes the instance that is currently running? The following workaround works for windows but neither for tabs nor for split panels:  function exit {     osascript -e 'tell application "iTerm2" to close first window' }   The solution should work with either zsh or bash.


A book about teenagers who live in the "real" world when they fall asleep in their "fantasy" world

I'm looking for the title of a book that I read sometime in 2004-05. What I remember about the book is that it focuses on a group of teenagers who live in a fantasy type world with monsters, mages, and knights. However, when they sleep in this fantasy world they wake up back in the real world, even though they hadn't been sleeping in the real world they just immediately remember what they are doing and why they are doing it.   I'm quite sure the book I had read was part of a series. I do remember one scene from it where the characters fall asleep in a barn and the main character "wakes up" in the middle of a grocery store with a list from his mother of what to pick up. He then goes about his normal life for a bit before being woken up back in the fantasy word by his friend as they're being surrounded by an enemy. The main character reaches for his axe but fumbles with it.  I hope thats enough detail. I'd love to find and read this series again.


Uninformative error message when using AUCTeX

I often have this error when using AUCTeX:  TeX-error: Error occured after last TeX file closed  However, when running for instance pdflatex on the command line, I have a proper error message. But the line number information is not always useful, especially if multiple files are included. I'd like to be able to see the error in Emacs.


What is an effective way to level smithing?

Leveling smithing to 100 seems like a difficult task. Is it more effective to craft cheap things such as iron daggers, or to craft expensive items such as Elven weapons?


How to determine where an environment variable came from?

I have a Linux instance that I set up some time ago.  When I fire it up and log in as root there are some environment variables that I set up but I can't remember or find where they came from.     I've checked ~/.bash_profile, /etc/.bash_rc, and all the startup scripts.  I've run find and grep to no avail.   I feel like I must be forgetting to look in some place obvious. Is there a trick for figuring this out?


LookupOrderedRows with variable WHERE clauses

As the title suggests is it possible to run LookupOrderedRows with a @variable in the WHERE clause.  SET @getAccounts = LookupOrderedRows(@AccountDE, 25, @orderByClause, "location_id", @AccountLocationId,"column1","true","column2","false")   I have a requirement where the field matches need to be dynamic, and may not be a fixed number of columns to do the match on. Has anyone got a workaround for this?


latest update windows search engine not working

After the latest update of windows the the windows search is not working tried resetting the computer but the after few minutes again search engine stopped working again.


Is it legally allowed to pursue an MBA while pursuing a PhD in Sweden?

The title says it all. To elaborate, In Sweden Ph.D. is being considered a formal job and students receive a monthly salary and pay taxes. Therefore, the question is specifically about whether applying and pursuing an MBA in parallel with pursuing Ph.D. is legally feasible or a special type of permission is required from the university? Update 1: I'm aware that it's not recommended to pursue these two demanding degrees together. The question is whether in Sweden it's technically possible or not. Update 2: It's a question related to Sweden, only!


I have plotted my predictors versus my response variable in order to be able to fit a good Poisson model to my data. However i am getting  those scatter plots for nearly all predictors which make me rather worried since including these predictors is making my residual deviance a value of 575 on 571 df(high enough) Thanks


How can I find a rogue alias declaration?

I'm trying to find where a specific alias has been declared. I've searched all the usual places I know to look for aliases:   ~/.bashrc ~/.bash_profile /etc/bashrc /etc/profile   With no luck.  I know it's an alias because when I do which COMMAND, I get:  alias COMMAND='/path/to/command'     /path/to/command   Is there a way to find what file declares an alias only knowing the alias name?


grep for all the lines that doest not have a particular word

I have a file fileA.txt  Batman.plist Green Arrow.plist Hawkgirl.plist EOPrototypes.plist Person.plist EOPrototypes.plist EOJavellinPrototypes.plist Sinestro Slomon Grundy.plist Batman Beyond.plist EORedRobin EORavenPrototypes.plist   Now if I want to get all the lines that end with plist and does not contain the word Prototype. So far I have   grep -v "Prototype" fileA.txt | grep -E "*plist$"   And the output is   Batman.plist Green Arrow.plist Hawkgirl.plist Person.plist Slomon Grundy.plist Batman Beyond.plist   Which is exactly what I want,  But is there a better way to do this?


I've got this message from my friend: "I'll be pretty busy basically up until the 8th November." In this case, which is correct, he will be pretty busy including 8th or he will not be pretty busy from 8th anymore?


I got this information regarding Riemann matrix: RIEMANN is a N-by-N matrix associated with the Riemann hypothesis, which is true if and only if:  DET(A) = O( N! N^(-1/2+epsilon) ) for every epsilon>0 ('!' denotes factorial).  where, A= Riemann matrix  with,  A = B(2:N+1, 2:N+1),   where  B(i,j) = i-1 if i divides j and           -1 otherwise.  Properties include, with M = N+1:  Each eigenvalue E(i) satisfies ABS(E(i)) <= M - 1/M. i <= E(i) <= i+1 with at most M-SQRT(M) exceptions. All integers in the interval (M/3, M/2] are eigenvalues.  Reference:  F. Roesler, Riemann's hypothesis as an eigenvalue problem, Linear Algebra and Appl., 81 (1986), pp. 153-198.  Now, I have a Matlab Function which creates a 3-by-3 Riemann matrix as:   R=riemann(3)   R =  1    -1     1 -1     2    -1 -1    -1     3  eig(R) ans = 0.5858 2.0000 3.4142  Questions:  What is "O" factor in the meaning of determinant ? How do the 3-by-3 Riemann matrix "R" created by my function concur with properties stated above ? (1st property holds good but other two ??)  P.S.: If u need to take a look at my function,please tell me.


Automatically answer 'Yes' when using apt-get install

Is there a way to make apt-get install answer "yes" to the "Do you want to continue [y/N]?"?


When can Eisenstein's Criterion never be used?

If $R$ is a UFD and $f \in R[x]$, then we can't always use Eisenstein's Rule directly to show that $f$ is irreducible in Frac$(R)[x]$. However if we have $\phi$, an automorphism of Frac$(R)[x]$, then $f$ is irreducible if and only if $\phi(f)$ is irreducible. In order to apply Eisenstein to the resulting polynomial, you need $\phi(f) \in R[x]$, then you can deduce that your original $f$ was irreducible (we are using a 'shifted' version of the rule).  For example, for the cyclotomic polynomials $x^{p-1} + \dots + x + 1$, you cannot use Eisenstein directly, however if you consider $\phi : \mathbb{Q}[x] \rightarrow \mathbb{Q}[x]$ which sends $x$ to $x+1$ and does nothing on $\mathbb{Q}$, then using the binomial the resulting polynomial is Eisenstein at $p$.      What I am wondering is given an irreducible polynomial, can you always find an automorphism such that you can apply Eisenstein to show it's irreducible?   If not in general then what about the case where $R = \mathbb{Z}$ and $\phi$ is an automorphism of $\mathbb{Q}[x]$?


notify-send not working, seems many bugs

i'm trying to create notification script but it doesnt work.  When i click for example "control+alt+m" it should pop notification which it does, but its like default and i cant change anything.   I tried to use some of commands for notify-send but its just not working.   And one more huge problem is its not working in full screen like i'm in-game and i want to click "control+alt+m" and its not showing up.   I cant do anything, i tried to write -critical still not working. need help with notifications.    here is my script:  #!/bin/bash notify-send "Dota2 Heroes" -t 10000   P.S default is 5sec time, -t 10000 = 10sec but its not working, notification disappears in 5sec


Can someone explain to me how symbolic style permissions work in Linux? And help me set the permissions of r--r-x-wx in symbolic style on a file? Thanks


I compile C++ codes and get a problem. The problem shows as following:  The following are my codes:  Stack.h     #ifndef _STACK_H    #define _STACK_H    namespace myAlgo    {      namespace STK     {     template<typename T>     struct Stack_Node     {          T data;         Stack_Node<T>* next;          Stack_Node() {};         Stack_Node(const T& item, Stack_Node<T>* next) :data(item), next(next) {};          T add(T a, T b);     };   }  }  #endif   Stack.cpp  #include "Stack.h" using namespace myAlgo::STK; template< typename T> T Stack_Node<T>::add(T a, T b) { return a + b; }  main() function is in the following file:  AlgoStack.cpp  #include <iostream> #include "Stack.h"  using namespace std; using namespace myAlgo::STK;  int main() {    Stack_Node<int>* p = new Stack_Node<int>(67, nullptr);    std::cout << p->data << " " << p->next << endl;    int res = p->add(3, 4);    std::cout << res << endl;     system("pause");     return 0; }  So anyone who can help me, thank you!


Where are you supposed to put user-specific programs?

Say I'm a non-admin user who wants to put an executable somewhere in his path so that he can run it like a regular program.  What is the "proper" accepted location for that path? is it ~/bin? ~/.local/bin? Elsewhere?


I have serious problem with my ubuntu system. Yesterday, I installed gdm and set it default display manager, when I rebooted grub menu display I boot to normal boot but only black screen show.Please help I want my system up and running.


I have a 2 GB Kingston  card which is about three years old. I put it in a reader today in my Windows Vista computer, wrote a 32 MB file onto it, safely removed it, and then tried to read it elsewhere. Nothing. Putting it back in the Windows Vista computer it now says:     You need to format the disk in drive F: before you can use it.   What should I do? I have access to many computers and OSes if your recommendations need that. I would be very sad if I lost all the contents of the card. Most of the data is backed up, but there are a few things that aren't. :(  Doing a   # dd if=/dev/sdg of=~/tmp/sd.bin   gives me a 2 GB file, and  the file it seems like lots of my data is still there. How can I put it back together?


I want to find the color group of blue removed from Image 2 compared to Image 1.   and


I have this simple script which redirects the output and append it to a file.  filename="/home/ronnie/tmp/hello"  date=$(date) echo "$date" >> $filename   Now, lets suppose I change date=$(date) to date= $(date) which will generate an error.   My modified script:  filename="/home/ronnie/tmp/hello"  date= $(date) echo "$date" >> $filename 2>> $filename  #Also tried echo "$date" >> $filename 2>&1   I was thinking that above script will redirect the error test.sh: line 5: Fri: command not found to the file hello but it just enters a new line into the file and the error gets printed on my stdout.  My bash version:  ronnier@ronnie:~/tmp$ bash --version GNU bash, version 4.2.24(1)-release (i686-pc-linux-gnu)   So, where am I going wrong.


Is it possible to mark designated entries in a bibliography with an asterisk?

I am using biblatex to produce a bibliography with several sections like this:  \defbibheading{cvpubs}[List of Publications]{\section{#1}} \defbibheading{subbibliography}{\noindent\bfseries\itshape{#1}} \printbibheading[heading=cvpubs]  \printbibliography[env=nolabel,sorting=ydnt,keyword=peer,heading=subbibliography,title={Peer-reviewed articles}] \printbibliography[env=nolabel,sorting=ydnt,keyword=chapter,heading=subbibliography,title={Book chapters}]  % and so on ...   Now I need to mark certain entries with an asterisk left of the entry. Something like this:  * Besserwisser, John (2007). "Whatever you say, you're wrong". In: Journal for Know-it-alls. (1)1. pp. 1-19.  Is this possible?  P.S. If you are wondering why anyone would want to do such a thing: In my case it is simply demanded by a funding agency to mark certain publication in my publication list with an asterisk. But you could also use this to mark the mandatory readings or the recommended readings or so in a reading list.


Does anyone knows which are these systems that manages paid wifi networks and some hotels and airports?  Even better, would anyone know a open/free project that would do or could be adapted to that end?  The idea is simple, I want to let the network open at physical level so anyone can connect. After connected however, the clients would have access only to a specified page where they can logging in, and doing the necessary validations the router would allow these of those ports (or even everything) for his IP.


Morita equivalence between right and left ideals of a ring

I would like to know whether Morita equivalence is a useful tool when dealing with right and left ideals of a ring. If so, could someone illustrate it on the example of $2\times 2$ matrices?  Thanks


im creating an android app, to link and transfer socket packets to the server through wifi. In order for this, the IP address of the connected server has to be defined. I used the below function to get the IP address. When i hardcode the SERVER_IP = "0"; the app runs normally. Please help!      private final String SERVER_IP = getIpAddr();      public String getIpAddr() {     WifiManager wifiManager = (WifiManager) getApplicationContext().getSystemService(WIFI_SERVICE);     WifiInfo wifiInfo = wifiManager.getConnectionInfo();     int ip = wifiInfo.getIpAddress();      String ipString = String.format(             "%d.%d.%d.%d",             (ip & 0xff),             (ip >> 8 & 0xff),             (ip >> 16 & 0xff),             (ip >> 24 & 0xff));      return ipString; }   After Setting up the above, I ran the below codes on the OnCreate function.  class ClientThread implements Runnable {      @Override     public void run() {         try {             InetAddress serverAddr = InetAddress.getByName(SERVER_IP);             socket = new Socket(serverAddr, SERVERPORT);         } catch (UnknownHostException e1) {             e1.printStackTrace();         } catch (IOException e1) {             e1.printStackTrace();         }     } }   As soon as that happens, my android application will stop working.   This is the error that appears:  Java.lang.NullPointerException: Attempt to invoke virtual method 'android.content.Context android.content.Context.getApplicationContext()' on a null object reference


What is the best tool to manage several Ubuntu stations over network?

Wich are the options for Ubuntu Desktop management over network?   Not installation deployment over network. Management of more than 1000 Ubuntus desktop over network.  Something like Red Hat Satellite... to generate reports about updates, memory usage, disk usage, install software and other management tasks.


Strange problem with pythontex in TeX Live on Mac

When I launch  tlmgr update --self in a terminal, I obtain the following error message :   Unknown docfile tag:  texmf-dist/doc/latex/pythontex/pythontex_quickstart.pdf details=""Quick start" documentation" at /usr/local/texlive/2013/tlpkg/TeXLive/TLPOBJ.pm line 127, <TMP> line 129108.   How can I fix this problem ?


How can I display a still image / short video loop through a webcam?

I need to sneak away from my desk without the person I'm video chatting realising.  I am staying pretty still, and she's working so not that observant. I think a still image would fool her for long enough.  I'm currently trying hanging an image in front, but she caught onto that when my sister drew on the image:                                          Before                                                                             After    How can I "pause" what my webcam is sending to her, so I can leave it. If she thinks I've frozen that's fine - although maybe playing a loop of me moving slightly would be even better.  I'm using Google Chrome and Hangouts, so if something can be done at the software level, to trick it, that would be good.  Is there some way I can use the terminal to create a "phantom" webcam, that simply displays an image I've got saved on my computer?  Could /dev/video1 or whatever just be an image?  I'd also be interested if I could cannibalise an old webcam to do this and trick the computer, and her.  P.S. I was in trouble when she realised.


How can I see all versions of a package that are available in the archive?

Is there a way I can see all the versions that are in the archives that I have configured in sources.list. I can see the last version of each archive withapt-get policy, but how can I see them all?  Is there any way that this can also include PPA and anything in sources.list.d?


Chrome is unable to connect to the Internet

I'm getting the error code: DNS_PROBE_FINISHED_NO_INTERNET in Google Chrome. The thing is, I have a working internet connection. I am posting this using that connection, using Internet Explorer. It's only Chrome doing this.  What happened was my laptop was refusing to go to sleep mode, so it ended up running out of battery power. I charged it, and when I subsequently booted the computer, Chrome stopped working. I don't see the connection...  I added Firewall rules (inbound/outbound) to allow Chrome to connect...so unless I'm missing something.  UPDATE: Chrome portable is working for me...just not the regular chrome.  UPDATE 2 Now I realize it had to do with Covenant Eyes which I have installed. See the accepted answer


I am unable to locate the sign in element on HTTPS.  This code     WebElement signin =driver.findElement(By.xpath(".//*[@id='mc_mainWrapper']/header/div[1]/div/div[2]/div[2]/div[4]/a/strong"));   causes this error  java.lang.NullPointerException


How could the "Big Bang" singularity have actually expanded?

We have mountains of evidence about singularities and how they work, and we have mountains of evidence that the "Big Bang" was the origin of the universe as we know it. But if compressing enough matter into a small space causes an inescapable singularity (i.e., a black hole), why does compressing all matter into a small space lead to a sudden expansion?


I am making a retrofit POST request using Paging library.  When the first page is loaded the next page is automatically called.  But when it comes to the last page (assume page 5), it requests for page 6, then on response the app crash with error  java.lang.NullPointerException: Attempt to invoke interface method 'int java.util.List.size()' on a null object reference  when it queries for page 6, from my LogCat, an HTTP response is OK with Content length 0. But when i do checking it crashes          //...code         private final ReplaySubject<Rating> ratingReplaySubject;          //...code         @Override         public void onResponse(Call<ArrayList<Rating>> call, Response<ArrayList<Rating>> response) {             if (response.isSuccessful()) {                 callback.onResult(response.body(), Integer.toString(page.get()+1));                 mutableLiveData.postValue(NetworkState.LOADED);                  //First i tried this,                 //response.body().forEach(ratingReplaySubject::onNext);                  //Then I tried this,                 //ArrayList<Rating> ratingArrayList = new ArrayList<>();                 //ratingArrayList = response.body();                 //if(ratingArrayList == null && !ratingArrayList.isEmpty()){                 //    for(int i=0; i<ratingArrayList.size(); i++){                 //        ratingReplaySubject.onNext(ratingArrayList.get(i));                 //    }                 //}              } else {                 mutableLiveData.postValue(new NetworkState(NetworkState.Status.FAILED, response.message()));                 Log.e("API CALL", response.message());             }         }


Why does Boolean.ToString output "True" and not "true"

true.ToString()  false.toString();  Output: True False   Is there a valid reason for it being "True" and not "true"? It breaks when writing XML as XML's boolean type is lower case, and also isn't compatible with C#'s true/false (not sure about CLS though).  Update  Here is my very hacky way of getting around it in C# (for use with XML)  internal static string ToXmlString(this bool b) {     return b.ToString().ToLower(); }   Of course that adds 1 more method to the stack, but removes ToLowers() everywhere.


Illustrator: rotating back to perfect angles

I am wondering: After I rotate an element in Illustrator to an un-even angle, is there a simple way to rotate it back to an even angle later?  Whenever I try to get a shape back to 0 degrees or 90 degrees, it always seems to be off by a smidgen.  Any solution?


How to install Pantheon on Ubuntu 15.04?

is it safe to install elementary OS DE Pantheon on Ubuntu 15.04 without doing any damage to the system? if so how?


My pc attacked by Mbed ransomware virus and all files get encrypted.    To kill this virus, I have scanned my full system with bootable anti-virus and used Emsisoft Decryptor to decrypt files.    But this tool, can't able to decrypt even a single file.  So what are other ways that exist for me to decrypt my PC files?


May I use SQL Server in a Google Compute Engine instance?

Does google computte engine offer SQL Server 2012 licensing? Web Edition to be more specific.  I have not found any documentation on this matter here:


I'm trying to compile my tex file but it keeps giving me this error. Overfull \hbox (11.0894pt too wide)  Someone who can help me out?


Is the total enthalpy of the universe constant?  It would seem like the answer would have to be yes, since (1) enthalpy change represents the heat exchange between the system and the surroundings, and there is nothing "outside" the universe, and (2) in the equation $H = U + PV$, the matter in the universe is surrounded by a vacuum so $P = 0$ and that term disappears, so the enthalpy is just the internal energy $U$ of the universe, which never changes by the law of conservation of energy.  But I can't find a reliable source confirming this explicitly.  (The only place I can even find this question posted, is on Quora:  and the only yes/no answer says: "No, if this was the case, our school books would have ended up with another law of conservation of enthalpy", and that's why I don't read Quora.)


Is there a way to organise a house style guide in LaTeX?

I am looking to write a 'house style' guide for my organisation.  As a house style we want to continually be updating and maintaining it (perhaps with a new edition every year or so).  I want to write it in LaTeX (of course!), but I am having trouble finding out how to organise it.  (I could do this by hand, but then where's the fun of LaTeX in automation?). As many organisations and universities have a house style guide these days, I hope this question is of general use. A style guide  (at least as I write one) is organised first by theme, and then alphabetically.  The theme sections I can do as ordinary chapters, but I am having trouble figuring out how to organise my sections alphabetically.  glossaries and similar aren't really for writing a style guide—they are designed to be additional matter to a main text, rather than (as I want) the main text is itself alphabetised.   Perhaps a package for making a dictionary could be adapted? To give a concrete example, I would like to find a way to organise the  'sections' below alphabetically automatically.  (Of course, there's no reason they have to be 'sections' \documentclass{book}  \begin{document}  \chapter{Spelling and Punctuation} \section{Commas} \section{Full Stops} \section{Exclamation marks}   \chapter{Names} \section{Universities} \section{Surnames} \section{Cities}  \end{document}


This picture is on my windows 10. I would like to know where it is.  thank you


$ \int \frac{\sin^{a}x}{\sin^{a}x+\cos^{a}x}dx$ and $ \int \frac{\cos^{a}x}{\sin^{a}x+\cos^{a}x}dx$

I tried solving this integral:  $$\int^{\pi/2}_{-\pi/2} \frac{1}{2007^x + 1}\frac{\sin^{2008}x}{\sin^{2008}x+\cos^{2008}x}dx$$  I took a while before aptly applying the following identity I had noted down in my notebook before.. $$\int^m_{-m}\phi(x)dx=\int^m_0\phi(x)+\phi(-x) dx$$  And my hunch was right; I managed to get it to a 'manageable' form: $$I_1=\int^{\pi/2}_0\frac{\sin^{2008}x}{\sin^{2008}x+\cos^{2008}x}dx$$    This got me wondering..  Does there exist a closed form for the following integrals?  $$ I_2=\int \frac{\sin^{a}x}{\sin^{a}x+\cos^{a}x}dx$$$$ I_3=\int \frac{\cos^{a}x}{\sin^{a}x+\cos^{a}x}dx$$


How can I print background images in FF or IE?

Is there any way to set ff and ie to print background images?   I am using stars image to classify some skills and I set it as a background image and positioning to either set one start, two, three, etc. When I try to print the page the images disappear.   So is there any way to make them appear when I print the page or at least have a way of replacing the images with * or something that would be visible?


Convert â€™ to apostrophe in PHP and display to webpage

this is stored in my mysql database
it&acirc;&euro;&trade;s the best
   I am fetching this from database and displaying to webpage. But "it's the best" is displayed as "itâ€™s the best".  How can i show apostrophe on the webpage?  I want everyone who access my website see the apostrophe irrespective of browser and os.


Can we say "guys" to a group of people, that group possibly including women?  Example sentence: I am looking forward to see you guys then!


when i enter the command:  sudo apt-get install libboost-all-dev libx11-dev libx11-dev:i386 libxtst-dev libconfig++-dev build-essential qt5-default   i get this:  Reading package lists... Done Building dependency tree        Reading state information... Done build-essential is already the newest version (12.4ubuntu1). libx11-dev is already the newest version (2:1.6.4-3). Some packages could not be installed. This may mean that you have requested an impossible situation or if you are using the unstable distribution that some required packages have not yet been created or been moved out of Incoming. The following information may help to resolve the situation:  The following packages have unmet dependencies:  libboost-all-dev : Depends: libboost-iostreams-dev but it is not going to be installed                     Depends: libboost-mpi-dev but it is not going to be installed                     Depends: libboost-mpi-python-dev but it is not going to be installed                     Depends: libboost-regex-dev but it is not going to be installed  libxtst-dev : Depends: libxext-dev but it is not going to be installed                Depends: libxi-dev but it is not going to be installed  qt5-default : Depends: qtbase5-dev but it is not going to be installed E: Unable to correct problems, you have held broken packages.   how do i fix this?  RESULT OF APT-CACHE:  edit:all of the packages have missing dependencies


Camera app that can use hardware buttons for making photo

I am searching for either a camera app with hardware button support, or for some other solution that would make it possible to use hardware buttons for making photo (shutter) in a camera app.  My phone, Samsung Galaxy S III mini doesn't have separate camera button, only power button, home button, back and menu buttons, and volume rocker.  It is IMHO much easier to use hardware button than to try to hit software button on camera screen.  I think this should be possible, because built-in Phone Call app can be configured to accept call with Home button, and end / cancel the call with Power button.    This question can be considered to be continuation of  which is about using hardware button (e.g. Home) to start camera.


Integral in math messes up copy-and-paste of text

For a document like  \documentclass{article}  \usepackage[T1]{fontenc}  \input glyphtounicode.tex \input glyphtounicode-cmr.tex \pdfgentounicode=1  \pagestyle{empty} % for quick CTRL+A \begin{document}   Some text and then $x$.    Some text and then $\int_0^1 x$. \end{document}   Trying to copy-paste yields  Some text and then x. Some text and then ∫ 1 0 x.   Now, I guess the interval isn’t really properly expressible in plain text (unless it can be done through some funky Unicode composition), but I would not expect the result to be that bad – maybe ∫0 1 x? Is there something I can do for better results?


Sequences in $C(X)$ converging uniformly implies uniform boundedness and equicontinuity

Let $X$ be a metric space and let $\{ f_n \}_{n \geq 1}$ be a sequence in $C(X)$. Show that if $\{ f_n \}_{n \geq 1}$ converges uniformly on $X$ then $\{ f_n \}_{n \geq 1}$ is both uniformly bounded and equicontinuous.  Could I get a hint?


I know this is a recurring and sensitive issue.  I am not against the downvote the contrary, I sincerely believe that it is useful. But I think it should be constructive. We all have the right to error, among other things because English is not the native language of all and some times there are misunderstandings. This site is intended to find answers and also to progress. But sometimes, it's hard to understand the reason for the downvote.  This morning I had 2 downvotes for 2 answers was accepted one of which had this comment:     "That's exactly what i was looking for, thank you"   In this case, the response was good and was perfect for the user who had asked the question.  I suggest implementing a system for downvotes, like for using flags. For example, using a list of justifications such as:   Wrong answer  Off topic  Incomprehensible  ... Other (please specify)   Besides, if there was a downvote for my question, I would delete it.


Let $M$ be a closed, orientable, and bounded surface in $\mathbb{R}^3$.  (a) Prove that the Gauss map on $M$ is surjective.  (b) Let $K_+(p) = \max \{0, K(p)\}$.  Show that $$ \int K_+dA \ge 4\pi. $$ in the area of $M$.  Do not use the Gauss-Bonnet Theorem to prove this.


The map $f:\mathbb{Z}_3 \to \mathbb{Z}_6$ given by $f(x + 3\mathbb{Z}) = x + 6\mathbb{Z}$ is not well-defined

By naming an equivalence class in the domain that is assigned at least two different values prove that the following is not a well defined function.     $$f : \Bbb Z_{3} \to \Bbb Z_{6} \;\;\;\text{ given by } f(\overline x) = [x]  $$      In this case we represent an element of the domain as an $\bar x$ and use the notation $[x]$ for equivalence classes in the co-domain.   $f(\overline0) =  [0] \;,$  $ \Bbb Z_{3}  \quad (3x+0)\;\; \overline 0 = \{ ...-6,-3,0,3,6...  \}, \; \Bbb Z_{6}\;  (6x+0)\; \overline0 =\{ ...-12,-6,0,6,12...\}$   $f(\overline1) = [1], $ $\qquad   \; (3x+1) \; \;\;\;\overline   1 = \{ ...-5,-2,1,4,7 ... \},\; \;  (6x+1)\;\overline1 =\{...-11,-5,1,7,13.. \}$  $f(\overline2) = [2], $ $\qquad  \qquad \qquad \;\overline 2 = \{ ...-4,-3,2,5,8 ... \},\;\;\overline 2 = \{ ...-10,-4,2,8,14  ...\},\;$  $f(\overline3) = [3] ,$  $\qquad \qquad \qquad \qquad \qquad \qquad,\; \quad \quad \quad \; \; \; \;\overline 3 = \{ ...-9,-3,3,9,15 ... \},$  $f(\overline4) =  [4],\qquad \qquad \qquad\qquad \qquad\qquad \; \quad \quad \quad \quad \; \;\overline 4 = \{ ...-8,-2,4,10,16...  \}, $   $f(\overline5) = [5], \qquad \qquad \qquad\qquad \qquad\qquad \; \quad \quad \quad \quad \;\;\overline 5 = \{ ...-7,-1,5,11,17...  \},  $  $f(\overline6) = [6] ,$  So my main question for this problem is how to find out if this question is not a function. From the information I have gathered here I still cannot see why this is not a function any help on showing how this is not function would be much appreciated.     The set of equivalence classes for the relation $\cong_{m}$ is denoted $\Bbb Z_{m}$   The $ 3x+0 \text{ and } 6x+0$ are just showing how I got $\overline 0 $


Resizing Ubuntu ext4 partition using Gparted live dvd fails

I'm trying to shrink my ext4 ubuntu partition using a gparted live dvd by 50 gb for a windows NTFS partition. It's failing as shown below:     My problem is different from the other one because I've already tried to shrink it, but I get a certain error.  Here is the output of e2fsck -fy /dev/sda1:      e2fsck 1.42.9 (4-Feb-2014)     Pass 1: Checking inodes, blocks, and sizes     Pass 2: Checking directory structure     Pass 3: Checking directory connectivity     Pass 4: Checking reference counts     Pass 5: Checking group summary information     /dev/sda1: 661890/38690816 files (0.6% non-contiguous), 86694031/154733568 blocks     Okay so on a whim I shrunk it by 10 GB and it worked. I did it 4 more times and now have a 50 GB ntfs drive, so the issue is solved. Thanks.


Advice for an 18 year old about Investing?

I'm currently 18, I already have investments in a variety of conservative mutual funds through the Stash app, however I want to get into actually investing for extra income. I currently have a steady cashflow along with expenses settled. Any advice helps! I have Robinhood downloaded but haven't really tried it yet.


What does proving the Riemann Hypothesis accomplish?

I've recently been reading about the Millenium Prize problems, specifically the Riemann Hypothesis. I'm not near qualified to even grasp the entire problem, but seeing the hypothesis and the other problems I can't help wonder: what is the practical use of solving it?  Many researchers have spent a lot of time on it, trying to prove it, but why is it so important to solve the problem?  I've tried relating the situation to problems in my field. For instance, solving the $P \ vs. NP$ problem has important implications should it be shown to be either $P = NP$ or $P \neq NP$: for instance, cryptographic algorithms, but it's hard to say WHY the Riemann Hypothesis, or other problems, are so important.  Perhaps a partial answer could be made by seeing which solutions proof of the Poincaré Conjecture has lead to.


How to find the missing dependencies for all packages?

I think I have accidentally messed up my Ubuntu, I wanted to remove TOR so I did sudo apt-get remove tor* That selected a lot of files, which I think is unrelated to the anonymity network. So I ended up deleting files that other packages need. How can I make a scan for the missing dependencies I have removed?


The set of limit points of the sequence $1,\frac12,\frac14,\frac34,\frac18,\frac38,\frac58,\frac78,\frac1{16},\frac3{16},\ldots$

I came across the following problem that says:     The set of limit points of the sequence $1,\dfrac12,\dfrac14,\dfrac34,\dfrac18,\dfrac38,\dfrac58,\dfrac78,\dfrac1{16},\dfrac3{16},\dfrac5{16},\dfrac7{16},\dfrac9{16},\ldots$ is which of the following?   (a) $[0,1]$   (b) $(0,1]$   (c) the set of all rational numbers in $[0,1]$   (d) the set of all rational numbers in $[0,1]$ and of the form $m/2^n$ where $m$ and $n$   are integers.   Please help. Thanks in advance for your time.


X, Y are independent normal random variables. What is the pdf of Z = X/(X+Y)?

This is a question on one of final exam at my school...:  X and Y are independent Gaussian random variables with zero mean and unit variance. Z=X/(X+Y). Find the pdf of Z.  After some struggles, I think I can solve this question by letting W = X+Y first and derive the pdf of W. Then I can find the pdf of Z = X/W.  However, after reading these two wikipedia articles:    .  I realized that the whole answer is going to be very long.   Meanwhile, I came across this posting - , which is similar in nature.   It appears that what are shown on the wikipedia articles are the only way to go.  However, considering this is a final exam question, given a short time limit, there should probably a much shorter way to reach my answer. Can anyone please show me the "easier" way?


Can someone explain the output of this fiddle?

I have this code. I have written the value of 'i' (in comments) that I expected as the correct output. But the outputs/alerts are different.  Fiddle:  Code:  var i = 10;  function outer() {     alert(i); // 10     var i = 5;     alert(i); // 5     function inner() {         var i = 20;     }     inner();     alert(i); // 5     if (1) {         var i = 30;     }     alert(i); // 5     setTimout(function () {         alert(i); // 5     }, 100); }  outer();   Can someone let me know the reason for the output? Or just the pointers where the specific concepts are explained?


How can I create this color effect in Photoshop?

I'm curious how I can recreate these effects in Photoshop ?  examples:    specifically this


If not using virtual-box for 5 min, it goes automatically in standby. How do I increased the time for it to stay a bit longer. Is my VM goes into standby


For this simple code snippet why is the floating point precision showing 0.30000000000000004 instead of 0.3 and how do I fix this?  prog.py  marker = 0 interval = 0.1  for i in range(10):          marker += interval     print(marker)   output  0.1 0.2 0.30000000000000004 0.4 0.5 0.6 0.7 0.7999999999999999 0.8999999999999999 0.9999999999999999


German way of saying numbers found in Dickens

Reading "Great Expectations", I noticed that numbers (I don't remember if this refers to all numbers, but I'm sure it was used when age was concerned) were given in the German way, namely, for instance:     one-and-twenty for twentyone   I'm asking why and when did the two languages split in this sense, that is, when did English start to tell numbers in the reversed order with respect to German.  Google N-grams does not shed any light on the topic.


What does 'Ign' , `Get` or 'Hit' mean when running an apt-get update?

I had a bunch of errors in the output of sudo apt-get update:  duplicate entries and 404 not found errors.  Figured those out, I hope: I removed PPAs that didn't have any packages associated with them, then I removed out a duplicate entry in /etc/apt/sources.list.  It seems I have royally buggered it up.  Now most of the lines say Ign when I do sudo apt-get update.  How do I go about straightening out what I have screwed up?  I need to get rid of these Igns that are all over the place.  There are about 50% (eyeball guess) Igns!


Problem with utf-8 encoded in MySQL database

I was using a server that has PHP 5 on it, and now I migrated to a different server, but it only has PHP 7. The problem is that when I did a backup on the old database server, everything was UTF-8 encoded. When I inserted a row, in the database it stored like this: cafÃ© But now, when I insert something, it stores it like this: café The problem is that now, when I select anything old, it doesn't decode back. I tried set the meta tag and headers in PHP to UTF-8, but it didn't work. I don't mind store it decoded, but I need to be able to read correctly the old data that is stored encoded, but I can't use utf8_encode in every query. Thank you.


I was born in Yemen, but to British parents and never had Yemeni citizenship. Can I travel to the USA under the Trump ban?

Always been British and left Yemen as a young child many decades ago. But I was born there and it says so in my passport. Can I travel to the USA?  Same question applies to children born in any of the 7 countries banned by Trump.


Calculate the determinant of the following $n \times n$ symmetric matrix:

Let $n$ be a positive integer and $A = (a_{ij})_{n\times n}$, where $a_{ij} = |i-j|$, for $i = 1, 2, \dots, n$ and $j = 1, 2, \dots, n$. Calculate $\det A$. I noticed that $a_{ii} = 0$ and $a_{ij} = a_{ji}$, so A is a symmetric matrix. Also, I saw that, if we make the notation $A_n$ for the A with n elements, $A_n$ is constructed from $A_{n-1}$ with $n-1, n-2, \dots, 0$ as elements for the last line and last column. I tried to use Laplace expansion but with no result. This is how $A_n$ looks like: $A_n=\begin{bmatrix} 0&1&2& .&.&. &n-1\\ 1&0&1&2& .&.&n-2 \\ 2&1&0&1&.&.&. \\ .&.&.&.&.&.&. \\ .&.&.&.&.&.&2 \\ .&.&.&.&.&.&1 \\ n-1&n-2&.&.&2&1&0 \end{bmatrix}$ I calculated for a few small numers: $\det A_1 = 0$, $\det A_2 = -1$, $\det A_3 = 4$, $\det A_4 = -12$, $\det A_5 = 32$, but I didn't figure out a rule such that I could find the determinant through induction. Can you help me on this one?


How to set a random value for multiple shape keys?

My question is related to my previous asked one:   I have about 300 shapekeys and want to set the random value for all of them . How to do it using scripting?


My error checking method for a certain user input is not working

I have a method here that is supposed to check if a user has entered a "y", pertaining to the answer yes; or an "n" pertaining to the answer no. It reads in the letters entered by the user correctly, however it keeps saying that the user has not entered a "y" or an "n". If someone could let me know what I'm doing wrong that would be great. Here is the code I'm using :   String answer = ""; do {  while (answer.equals("")) {   answer = sc.nextLine();  }  if (!answer.equals("y") || !answer.equals("n")) {   System.out.println("Please enter a y, meaning yes; or an n, meaning no.");   answer = "";  } } while (!answer.equals("y") || !answer.equals("n"));


I recently installed Ubuntu 14.04 on my Dell XPS 15 9530.  Now, everything except the wireless connection works fine. I've googled, and found  solution, but it didn't change anything for me (i.e. I added "options iwlwifi 11n_disable=1" to "/etc/modprobe.d/iwlwifi.conf").  I'm not sure what next steps I should take to solve this problem. I've read somewhere that updating the kernel might help I ran the command "uname -r" and got "3.13.0-24-generic" back, which implies i have the kernel version 3.13 and not the newest 3.18 according to .  If anyone has an idea what to try next or can point me somewhere, that would be awesome.


How to add /usr/bin to path after I mistakenly removed it (sudo and nano are no longer in path)

Lets get this out of the way, I did something stupid. Yes, stupid. Very stupid. I am well aware of how stupid this is. I am embarrassed and I regret doing it. Please help. I was installing a program, while also watching TV, and somehow managed to remove /usr/bin from path. NOOOOOO.  I'm using ubuntu 16.04. I added the new program bin to path by typing:  sudo nano ~/.bashrc   The new path was added, but then I tried to update using sudo and I got this error:  The command could not be located because '/usr/bin' is not included in the PATH environment variable.   However, the bin still exists:   Command 'sudo' is available in '/usr/bin/sudo'   nano in available, ls is available - its all available - but not in path. So, simply trying:  sudo nano ~/.bashrc   and trying to add /usr/bin to path is not an option. Without sudo I dont have permission to open  bashrc. I can cd into /usr/bin, but I cant ls anything, and I have no idea how to access sudo or nano once I'm in there. ./sudo, sudo.sh ./sudo.sh all returns "command not found".   How do I add /usr/bin to path in the event I remove it?  EDIT  I found the solution here:   I replaced the PATH with the path of the program I added to my path. So, typing this into a terminal gave me access to sudo and nano again:   export PATH=$PATH:/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin


How can I change only the higher bit of byte in masm32? Assume I have 00101111 byte and want to get 10101111.


When installing Linux, everything went fine until I restarted to go back to windows. GNU GRUB came up and didn’t let me boot to windows. I tried resetting the computer and going to the bios to change boot order. But when I do that everything is locked up and I can’t change anything in it. The only way to get to windows is by going through Linux bootloader first.  How do I remove Linux, GRUB and everything from that so I can boot to windows and access my BIOS again.  MOBO: ASUS Z73e (I think)


Why my addon does not show up in user preferences?

I am very new to Blender add-on development and having some trouble getting mine to actually show up and or enable    I want it to show-up here:    import os import bpy bl_info = {     "name" : "CudaParticals",     "author" : "Max Oltersdorf",     "description" : "Enables the use of NIVIDA CUDA for Large realistic Particle Simulations",     "blender" : (2, 80, 0),     "version" : (0, 0, 1),     "location" : "Properties", # This is a new tab in the "properties section"     "warning" : "IN EARLY DEVELOPMENT",     "category" : "SYSTEM"     #"wiki_url": "'https://github.com/OltersdorfTechnology/CudaParticals/wiki'",     #"tracker_url": "https://github.com/OltersdorfTechnology/CudaParticals/issues",     "support": "Testing", } from bpy.types import (     Operator,     Panel,     PropertyGroup, ) from bpy.props import (     BoolProperty,     EnumProperty,     Pointe # Define the interface class CudaParticlePanel(bpy.types.Panel):     bl_idname = "CudaParticle_Panel"     bl_label = "CudaParticle"     bl_category = "SYSTEM"     bl_space_type = 'PROPERTIES'     bl_region_type = 'WINDOW'    # bl_context = "CudaParticle"      def draw(self, context):             layout = self.layout          #scene = context.scene          layout.label(text= "CudaParticals Properties:")          #row = layout.row()         #row.operator("view3d.print_text", text = "Print text", icon='WORLD_DATA')         global custom_icons         self.layout.label(text="CudaParticle", # end define interface icon_value=custom_icons["custom_icon"].icon_id) # global variable to store icons in custom_icons = None classes = (     CudaParticlePanel, ) def register():     global custom_icons     custom_icons = bpy.utils.previews.new()     script_path = bpy.context.space_data.text.filepath     icons_dir = os.path.join(os.path.dirname(script_path), "Icons")     custom_icons.load("Tool_Icon", os.path.join(icons_dir, "Tool_Icon.png"), 'IMAGE')     from bpy.utils import register_class     for cls in classes:         register_class(cls) def unregister():     global custom_icons     bpy.utils.previews.remove(custom_icons)     from bpy.utils import unregister_class     for cls in classes:         unregister_class(cls)


Add a created group in a node tree exploiting python

I have created a node tree in a different blend file, and I just need to add it as a group exploiting a script. In the following figure there is the "manual" procedure. I have tried to add it simply using nodes.new(type='ShaderNodeGroup') but I get an empty node and not the "Asteroid_mat" group that I need.


What's the best way to use matching methods with multiple treatment groups? I'm assessing the impact of an intervention on an outcome. For my first analysis, I used the MatchIt package (see code below) to match treatment and control groups and to compare outcomes for the treated vs control. The Treat variable is 0 or 1.  nn_match <- matchit(treat ~ cov1 + cov2+ cov3 ,                      method = "nearest", data = df)   In my second analysis, I'd like to assess the effect of different treatment levels (for example, I have Treatment A, Treatment B, and Treatment C) on the outcome, but I'm stuck on the best way to proceed. Does it make sense to run separate matching analysis for each treatment group while excluding the observations from the other treatments groups?   nn_treatA_match <- matchit(treat_A ~ cov1 + cov2+ cov3 ,                      method = "nearest", data = df_minus_other_treatBC) nn_treatB_match <- matchit(treat_B ~ cov1 + cov2+ cov3 ,                      method = "nearest", data = df_minus_other_treatAC)   Or is there a way to run the analysis with the entire dataset and match controls to each treatment at the same time? Other posts have mentioned the twang package, but I'm not sure if that's what I should go with as I'd like to compare outcomes for each treated group to the control and not just across treated groups.


For roleplaying reasons I would like to make a NPC appear weaker than it actually is. When the players first fight it, it should seem to have a very low AC and miss many attacks. Is this possible in RAW or in RAI? Failing a saving throw on purpose seems to be RAI:  On March 10, 2016, Jeremy Crawford tweeted, "No rule lets you opt to fail a save. As DM, I might allow it, assuming you aren't incapacitated or dominated." Mike Mearls also said that he would allow it (as a DM).   Can I choose to let a punch hit me, or to attack weaker or slower than 100% of my skills would allow?


MyClass[] array; List<MyClass> list;   What are the scenarios when one is preferable over the other? And why?


GTA V online multiplayer: I know two consoles are needed but can they be different? xbox360 and xbox one

I want to play in the same house against friends in GTA online. I have an Xbox one and xbox 360 but only have game for xbox 360. If I get the game for xbox one can we play together using same wifi and in same channel with people and complete races, deathmatches, missions, etc. together?


How to Run an app as Administrator without the prompt?

When I start SQL Server Management Studio 2008, I get an error that's been around forever and is documented .  One of the suggestions to fix it that actually worked was to start SSMS with Run as Administrator. So I modified the properties of the shortcut to always run it as the administrator.  The only annoyance is that I get a prompt every single time asking whether I really want to do it. Is there a way to tell just this one program (SSMS) to not pop up the prompt, while keeping this behavior for other apps?


Does the full quarantine period have to be observed for short trips of less than 14 days to England?

I am planning to go to England for 2 days in preparation of moving (I already have a place rented and would be staying there) a few weeks later. I am coming from a country where I would need to do a 14 day quarantine as soon as I enter England. Does this mean that I have to stay in England for 14 days or can I leave the country before the end of the 14 day quarantine without facing a penatly? I have found no information about what the rules are for planned stays of less than 14 days on the , while  seems to say that short trips are OK. Official sources would be appreciated.


Macbook pro boot with kernel panic - can't perform kext scan

I was trying to swap command and option key for my external keyboard following the instruction in  .  When I'm done with change and I restarted, my mac booted with Kernel panic message. I'm sure I've messed the info.plist file. Now I cannot boot in safe mode as well.  I know if I get a way to change the file it should be fine.  The message shown in screen is   panic(cpu 0 caller 0xffffff80002c4794): Kernel trap at 0xffffff80005eae1e, type 14=page fault, registers: ... Debugger called: <panic> Backtrace (CPU 0), Frame : Return Addressd ... ... can't perform kext scan: no kext summary BSD process name corresponding to current thread: Unknown  Mac OS version: Not yet set  Kernel version: Darwin Kernel Version 11.4.2: Thu Aug 23 16:25:48PM Kernel UUID: ... System uptime in nanoseconds: 11...   The error specifies the problem in kext as well.  Thanks.


Is the following question grammatically correct?

'Which president is Barack Obama in USA?' I would like to know whether or no the question tag `which' is correct in the above question.


If $f(x) \in C(-\infty+\infty)$, $\;g(x)=f(x) \int_0^x f(t)\,dt\,$ and $\;g(x)$ is monotone-decreasing in $(-\infty,+\infty),$  Prove:$f(x)\equiv 0$.  It is easy to get $g(0)=0$,and I'm thinking about proving $g(x)\equiv 0$,then $f(x)\equiv 0$ follows.  But I havn't any ideas to prove $g(x)\equiv 0$.


Stop Mail from previewing pdfs and images in the body of an email

Is there a way in the Mail.app to prevent it from previewing pdfs and images in the body of an email.   So that instead you just a get a normal file attachment ?


Conditionally include a pipe stage in a bash script

I've got a script like the following:  flag=false # Do a bunch of stuff that might set flag to true. if [[ "$flag" == "true" ]]; then    command \        | pipe_command_a \        | pipe_command_b \        | pipe_command_c \        | pipe_command_d \        > "${output_path}" else    command \        | pipe_command_a \        | pipe_command_c \        | pipe_command_d \        > "${output_path}" fi   The only difference between flag being true or false makes is that pipe_command_b may not be run. Is there a way to collapse this so that I don't have to repeat all of the common stuff?


What does ${1+"$@"} mean in a unix shell script?

I came across this construct while reviewing some older unix shell scripts, what does it mean, and why is is used?  ${1+"$@"}


Orthogonal matrix and orthonormal columns

Show that the columns of orthogonal matrix are always orthonormal. Hint: $A^TA=I$  Can't really get even started, I thought that it has to be orthonormal since the result is $I$ and not only a diagonal matrix with other numbers in them?


Calculate the value of the following integral: $ \int^{\frac{\pi}{2}}_0 \frac{\sin^n(x)}{\sin^n(x) + \cos^n(x)} $

The question is show that $$ \int_0^{a} f(x) dx  = \int_0^{a} f(a-x) dx $$          Hence or otherwise, calculate the value of the following integral           $$ \int^{\frac{\pi}{2}}_0 \frac{\sin^n(x)}{\sin^n(x) + \cos^n(x)} $$        What I have done for the first part   $$ \int_0^{a} f(x) dx  = \int_0^{a} f(a-x) dx $$   $$ \left[F(x) \right]^a_0  dx  = \left[-F(a-x) \right]^a_0 $$  $$ F(a) - F(0) =  \left[-F(a-a) - -F(a-0) \right] $$  $$ F(a) - F(0) =F(a) - F(0)   $$  $$ LHS =  RHS $$    Now I am stuck applying this to the integral. I have attempted this:  $$ \int^{\frac{\pi}{2}}_0 \frac{\sin^n(x)}{\sin^n(x) + \cos^n(x)} $$  Because $ \int_0^{a} f(x) dx  = \int_0^{a} f(a-x) dx $ The integral is transformed to   $$ \int^{\frac{\pi}{2}}_0 \frac{\sin^n(\frac{\pi}{2}-x)}{\sin^n(\frac{\pi}{2}-x) + \cos^n(\frac{\pi}{2}-x)} $$  Which then becomes   $$ \int^{\frac{\pi}{2}}_0 \frac{\cos^n(x)}{\cos^n(x) + \sin^n(x)} $$  Now I am stuck...


Lofting between two different shapes along a path

I want to model a tube-like structure, which slowly changes from rectangular to circular along a pre-defined path. Below is an example created with bridge:    There are two problems here. The first is that the tube does not have consistent thickness, and the second is that it is not possible to control the exact path of the tube this way.  Is there a technique, or an addon, that can help me out with this? I do not want to lay lots of manually half-morphed shapes along the way and use skin modifier. I have already tried lofting with LoopTools and did not get any usable results.


I am trying to write a simple RSS Reader. I think i done but I get exception with "null" message. JavaDoc said that it is possible to get this value so it's nothing strange. But how could I find out what is wrong with my code?   and main:   public static void main(String[] args) throws MalformedURLException {     URL url = new URL("http://facet.wp.pl/rss.xml");     Feed feed = new Feed();     RSSParser parser = new RSSParser(url);     parser.RSSFeed();      for(String wejscia : feed.entries){         System.out.println(wejscia);     } }   @EDIT The exception is at RSSParser.RSSFeed(RSSParser.java:28) and i have already know that it's a NullPointerException


When will question's last_activity_date be updated?

I use  to get information of questions, I noticed that some comments' last_activity_date is later than the question's last_activity_date, so my question is: when will the question's last_activity_date be updated?  If a comment is submitted, will the question's last_activity_date be updated? If a question is solved, will the question's last_activity_date be updated with the timestamp when it is solved?


In the book Harry Potter and the Prisoner of Azkaban, Sirius Black does have a wand in the episode at the Shrieking Shack. But he himself tells Harry that he had no chance of chasing  the Dementors away in Azkaban without a wand. How would Sirius have acquired his wand after his escape from Azkaban?


In Google webmaster, I set a preferred domain as www but my subdomain is non www. Will these cause any negative effect?


This is an example from Linear Algebra Done Right by Axler:  Suppose that $U = \{(x, x, y, y) \in F^4 : x, y \in F\}$ and $W = \{(x, x, x, y) \in F^4 : x, y \in F\}$ Then $U + W = \{(x, x, y, z) \in F^4 : x, y, z \in F\}$  I don't understand how $U$ and $W$ sum to that. Can someone explain how this conclusion came about? Thank you!


I'm having trouble in QGIS with the symbology. I can classify and categorized my data, but I cannot with the graduated symbology?   I've try different format in Excel, and I can't find the problem here.


Understanding Euler's Totient Rule in RSA

I'm trying to understand the use of Euler's Totient Theorem in RSA. It is defined as : if $a$ is coprime with $n$ then $$ a^{\phi(n)}\equiv{1 modn} $$ I am unable to understand how the above implies that for any integers $m$ and $k$ the following statement holds :  $$m^{k*mod\phi(n)}\equiv m^{k}mod n $$


Segmentation Error for Implementation of toUpper() in C

I am attempting my own implementation of the toupper() function in C; my function should work for strings of any length. I am not sure why my compiler is throwing a segmentation error when I attempt to change the contents of the string as seen below. Is there any way around this error? (I have tried using arrays as opposed to pointers, but to no avail.) Note: isLetter() is a function I wrote that determines whether a character is an alphabetical character.   void toUpper(char *s){ while(*s != '\0'){     if(isLetter(*s)&&(*s> 90)){              *s += ('a' - 'A');     }     s++; }   I call the function like this:  char *s = "Hello"; toUpper(s);


I'm replacing a light fixture, but upon removing the old light I discovered the wires are not in a box. Can I just anchor the mounting plate to the drywall or is a box mandatory?


Maximum likelihood estimate for $\frac{3x^2}{\theta^3}I(0\le x \le \theta)$

I am trying to find the MLE for $\{X_i\}_{i=1}^{n}$ that  have the following pdf  $$\frac{3x^2}{\theta^3}I(0\le x \le \theta)$$  I tried solving it directly by taking the log of the likelihood and then through the derivative solve for $\theta$, but the indicator function  gives me issues.  Intuitively, to maximize the mle I need a very small $\theta$ by the restriction $X_{(1)}$ is the MLE. Is this correct or is there a way to  solve this directly?


MS SQL Server Cumulative Updates - Best Practices

I'm trying to get an idea of what recommended best practices are for the .  Currently, we run on the idea of "do nothing unless an issue fixed by the CU is one we experience".  That works from an "if it ain't broke, don't fix it" approach, but I'm wondering if that's really a good idea since so many of the CUs have performance enhancements.  We're looking at perhaps adding the CU to the patches applied during our periodic maintenance cycles a month or two after the CU is released.  What do others do, and why?    As an update to the question that affects the answers below, on March 24, 2016, Microsoft's SQL Server team announced they were .  Microsoft is recommending that all users install all CUs released after January 2016:     As of January CU releases, these caution messages have been updated,   we now recommend ongoing, proactive installation of CU’s as they   become available. You should plan to install a CU with the same level   of confidence you plan to install SPs (Service Packs) as they are   released. This is because CU’s are certified and tested to the level   of SP’s. Also, Microsoft CSS data indicates that a significant   percentage of customer issues are often previously addressed in a   released CU, but not applied proactively.  More so, CU’s contain added   value over and above hotfixes. These also may contain supportability,   logging, and reliability updates enhancing the overall experience.      In addition to messaging and guidance updates, we have made updates to   the CU acquisition model.      Acquisition changes:         CUs, of course, have traditionally been made available on the “Hotfix” server (accompanied by the “cautionary language” associated   with a ‘QFE’ or ‘Hotfix’). The inconsistency here is that CUs are not   really simple quick hotfixes anymore.  The encompassed updates are   well tested at individual as well as full system integration levels   today.   Therefore, we are now placing the latest CU per mainstream supported baseline (2012 SP2/SP3 and 2014 RTM/SP1 today) on   microsoft.com/downloads, just as is done for Service Packs today   Additionally, we will soon release, and maintain, all CUs into the Windows Update Catalog to facilitate acquisition and distribution   Only interim CU ‘On-Demand’ fixes will be placed on the hotfix server moving forward   To reduce friction, downloading CUs from the microsoft.com/downloads will not require providing/receiving an email and URL   We are also evaluating offering the latest CU as an Optional update on Microsoft Update, just like Service Packs today


How do I convert between big-endian and little-endian values in C++? For clarity, I have to translate binary data (double-precision floating point values and 32-bit and 64-bit integers) from one CPU architecture to another.  This doesn't involve networking, so ntoh() and similar functions won't work here.  Note: The answer I accepted applies directly to compilers I'm targeting (which is why I chose it).  However, there are other very good, more portable answers here.


When someone refers to a detective or police officer, they sometimes use the term 'gumshoe'. Where did this term originate from?


/admin/recently-self-deleted is not showing a self-deleted question

I'm a moderator on . I recently was surprised to find a question I had ‘helped with’ vanish without a trace from the site (including any references to my actions on it). Now, of course, questions can be deleted, but deletions are of interest to moderators, right?  As part of my search, I found the /admin/recently-self-deleted page and went there. The question was not listed even though, afterward, I determined that it had been self-deleted (at the time) two hours ago. It is now days since the deletion and the question is still not showing up, even though other questions have. This seems like a bug.  For any moderators/SE staff wishing to investigate:  and .  The question has no votes, no answers, and was deleted one day after it was posted.


How do I ensure that the date wrongly introduced by user (ex. 20222, or month 15, or day 44) doesn't translate into a later date

I have the program below which takes the user input from a string, parses into another format and then prints it again in another format. How can I prevent the user from introducing a wrong format that would cause the date either to be displayed erroneously (ex. year 20222) or to cause a forward roll of the date (ex. introducing day 31 for a 30 day month causes to roll the month and set day to 01 of next month.). ex. 2020-10-33 => 2020-11-3 I hope it makes sense! public class Solution { public static void main(String[] args) throws Exception {     BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));     SimpleDateFormat dateFormat = new SimpleDateFormat("yyyy-MM-dd");      String dater = reader.readLine();      Date newDate = dateFormat.parse(dater);     SimpleDateFormat dateFormat2 = new SimpleDateFormat("LLL dd, yyyy");      System.out.println(dateFormat2.format(newDate).toUpperCase());     reader.close(); }  }


How do I create a light streak like this?

I am trying to figure out how to make these light streaks inside a tube, I have been trying to make a light follow a path inside a glass tube but it doesn't look anywhere near this. Any advice?


What is, here on the Stack Exchange platform, the difference between an answer and a comment? I answered a post (first post) and somebody told me it was a comment not an answer, even though it sounded like an answer to me.


$\Delta U$, $C_p$, $C_v$ for an ideal gas process

Is there any way to generally demonstrate $C_p=C_v + R$ using thermodynamic cycles?


I recently read an article on dark matter and I could understand this things given as follows  All the ordinary matter we can find accounts for only about 4 percent of the universe. We know this by calculating how much mass would be needed to hold galaxies together and cause them to move about the way they do when they gather in large clusters. Another way to weigh the unseen matter is to look at how gravity bends the light from distant objects. Every measure tells astronomers that most of the universe is invisible.   I want to say that the universe must be full of dark clouds of dust or dead stars and be done with it, but there are persuasive arguments that this is not the case. First, although there are ways to spot even the darkest forms of matter, almost every attempt to find missing clouds and stars has failed. Second, and more convincing, cosmologists can make very precise calculations of the nuclear reactions that occurred right after the Big Bang and compare the expected results with the actual composition of the universe. Those calculations show that the total amount of ordinary matter, composed of familiar protons and neutrons, is much less than the total mass of the universe. Whatever the rest is, it isn't like the stuff of which we're made. But what actually is dark energy ? How should I connect dark energy with dark matter ?


How to find the money for an Open Access publication fee, if you're a postdoc and you don't have any funds?

Last year I finished my PhD in Europe and now I'm a postdoc in North America. I work on computer science.  An year ago I wrote a paper with my former Europen supervisor and a former colleague, and submitted it to a conference. My former supervisor presented the work at the conference.  Now we just discovered that the steering committee selected our paper for a post-conference supplement in a Open Access BMC journal. We're very happy for this selection (they chose 5 papers out of 52) but there's a problem: we don't have funding to pay the ~2,000 euros publication fee for the journal.  My former supervisor has no funding at the moment; my former colleague is still a PhD student and he's broke; myself I'm a postdoc with no research funding and I'm not going to ask to my current supervisor to pay (because I don't think it's fair and anyway he'd refuse).  What should I do?  That journal publication would be very important for my career, and quite useful for our scientific community. This supplement is a very unique occasion.


How to set the fully qualified hostname on CentOS 7.0?

How do I set the fully qualified hostname on CentOS 7.0?  I have seen a few posts online for example using:  $ sudo hostnamectl set-hostname nodename.domainname   However, running domainname returns nothing:  $ domainname (none)   Also:  $ hostname nodename.domainname   However,  $ hostname -f hostname: Name or service not known $ hostname -d hostname: Name or service not known   Some debug output:  $ cat /etc/hostname nodename.domainname  $ grep ^hosts /etc/nsswitch.conf hosts:      files dns


Enable to recover data and linux partition after windows 10 upgrade

I have a dual-boot windows 8 and Ubuntu with a NTFS data partition on my laptop.  After a forced migration to windows 10, my computer restarted on grub rescue mode and i was enable to boot on ubuntu or on windows.  error: no such partition. Entering rescue mode... grub rescue>   So i have tried to reinstall grub with boot-repair on live USB but it didn't work and my computer now boot directly on windows ...  Current partition info (bootInfo):  Disk /dev/sda: 512.1 GB, 512110190592 bytes 255 heads, 63 sectors/track, 62260 cylinders, total 1000215216 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 4096 bytes  Partition  Boot  Start Sector    End Sector  # of Sectors  Id System  /dev/sda1    *          2,048       718,847       716,800   7 NTFS / exFAT / HPFS /dev/sda2             718,848   208,764,927   208,046,080   7 NTFS / exFAT / HPFS /dev/sda3         826,302,464 1,000,214,527   173,912,064   5 Extended Invalid MBR Signature found. /dev/sda5     ? 1,524,864,998 5,236,647,937 3,711,782,940  c0 CTOS /dev/sda6     ? 5,092,567,351 8,619,976,874 3,527,409,524  c5 DRDOS secured Extended /dev/sda4         208,764,928   826,302,463   617,537,536   7 NTFS / exFAT / HPFS  /dev/sda5 ends after the last sector of /dev/sda the logical partition /dev/sda5 is not contained in the extended partition /dev/sda3 /dev/sda5 overlaps with /dev/sda6 /dev/sda6 ends after the last sector of /dev/sda the logical partition /dev/sda6 is not contained in the extended partition /dev/sda3   /dev/sda1 -> MBR (partition correctly reconized)  /dev/sda2 -> OS windows (partition correctly reconized)  /dev/sda3 -> Extended partition  -> /dev/sda5 Logical Ubuntu partition (proably /)  -> /dev/sda6 Logical Ubuntu partition (probably /home)  On gparted, i see /dev/sda3 but logical partition isnt displayed  /dev/sda4 -> NTFS data partition  On gparted, got following error when i try to mount this partition (can't mount this partition on windows too ...) :  Unable to detect file system! Possible reasons are: - The file system is damaged - The file system is unknown to GParted - There is no file system available (unformatted) - The device entry /dev/sda4 is missing   Full BootInfo =>   Current partiton info (fdisk):  Invalid flag 0x3261 of EBR (for partition 5) will be corrected by w(rite). label: dos label-id: 0x8858596d device: /dev/sda unit: sectors  /dev/sda1 : start=        2048, size=      716800, type=7, bootable /dev/sda2 : start=      718848, size=   208046080, type=7 /dev/sda3 : start=   826302464, size=   173912064, type=5 /dev/sda4 : start=   208764928, size=   617537536, type=7 /dev/sda5 : start=  1524864998, size=  3711782940, type=c0   Scan with gpart : =>   What i have to do now to recover my NTFS data and linux partition ?  Thx for help (and sorry for my english).


Prove that $X>Y>0 \Rightarrow Y^{-1}>X^{-1}>0$

Let $X,Y$ be some invertible positive definite matrices such that $X>Y>0$, how do we prove that $Y^{-1}>X^{-1}>0$?  Any hint is greatly appreciated! I just need some initial directions.  Thanks a lot!!


Is there a browser add-on that imposes a cooldown period for websites?

I'd like to prevent myself from opening a given site (e.g. facebook.com) too soon after the last time it was opened. Is there a browser add-on (ideally - for Firefox) that does that? Or I should write it myself...


I can't alert or can't do anything with this code. I want to run a function when f5 or exit page but firefox always return this messages: "This page is asking you to confirm that you want to leave - data you have entered may not be saved". How to fix this.    <!DOCTYPE html>
Close this window, press F5 or click on the link below to invoke the onbeforeunload event.
  Click here to go to w3schools.com


Can I access two different dropboxes from one computer?

We have a situation where a worker is using a Dropbox shared with many people in different companies to work on a collaborative project. She cannot figure out how to use our company's Dropbox now, to work on a different project. She needs access to both Dropboxes, at different times. We're using Windows 7. Thank you for any help.


If the image is B&W can i make it 12mp and 300dpi in lightroom?

Hello soo im having a problem, i shot in raw a picture for a contest, days ago i asked a question about this. However, now that I finally took the shot and it was in B&W with the camera and also edited in lightroom B&W the image when i export it and set it to 300resolution dpi and 12.0mp it comes out getting 5MB or 6mb and thats not enough for the contest since 9MB = 12 MP. I appreciate any help guys please.


How can I change color of background and marked text in TexStudio

As default, the background color in the TexStudio editor is white and the text you have marked to work on (i.e. were the cursor is) is light blue/gray. Is it possible to reverse that?  EDIT: I am seeking a solution for non-techies.


JavaFX - Comparing StringBuilder to String

I have the following code which is attached to my window. Whenever the user presses a keyboard, that character is saved to a 8 character long array in a StringBuilder class.  When the user types "somecode" then the something() method should be called.  static StringBuilder    s   = new StringBuilder("aaaaaaaa");  public static void listen() {       Main.sc.setOnKeyPressed(new EventHandler<KeyEvent>() {             @Override             public void handle(KeyEvent event) {                 {                     for(int i=0; i<7; i++) {                         s.setCharAt(i, s.charAt(i+1)); // the characters move 1 position backwards                     }                         char c = event.getText().charAt(0);                     s.setCharAt(7, c);                      System.out.println(s.toString());                      if(s.toString()=="somecode") {                         System.out.println("--------------------------");                         something();                     }                 }             }         }); }   My output is:  aaaaaaas aaaaaaso aaaaasom aaaasome aaasomec aasomeco asomecod somecode   However the something() method is never called, nor is the "-----------------" displayed.  EDIT: This has been tagged as duplicate, however .equals() is not working either  if(s.equals("somecode")) {                         System.out.println("--------------------------");                         something();                          }


Prove or disprove the following: If a,b are nonzero integers with gcd(a,b) = d, then there exist integers m and n such that am+bn=d.

So I tried a bunch of values for a and b and got integers m and n to exist so I believe this conjecture to be true. Can someone please help me formulate a proof.


Fully remove PlayOnLinux and any files left behind

I recently installed PlayOnLinux with:  sudo apt-get install playonlinux   But then decided that I wanted to remove it so I did:  sudo apt-get purge playonlinux sudo apt-get autoremove sudo apt-get autoclean   And I thought that this would have removed all the files associated with PlayOnLinux, but I see that there is still a folder called .PlayOnLinux in my ~/ directory, so I will remove this too, but is there anything else which PlayOnLinux would have left behind that I can remove, or reset? And anyway, what is this hidden folder which it left behind in my home area?    OS Information:  Description:    Ubuntu 15.04 Release:    15.04


Let $(X,d)$ is metric space. Let $d(y_n,z_n)\to r$. And let $(y_{m_k})$ and $(z_{m_k})$ be subsequences of $(y_n)$ and $(z_n)$ respectively, with $(y_{m_k})\to y\in X$ and $(z_{m_k})\to z\in X$. (Yes, the indices of subsequences are same.)     How to show that $$d(y,z)=d(\lim\limits_{k\to\infty} y_{m_k},\lim\limits_{k\to\infty} z_{m_k})=\lim\limits_{k\to\infty}d(y_{m_k},z_{m_k})=r?$$   I am having trouble deriving second of equality above (obviously).   I went line this: $d(\lim\limits_{k\to\infty} y_{m_k},z)=\lim\limits_{k\to\infty}d(y_{m_k},z)$ by continuity of $x\to d(x,a)$ for fixed $a$. But But I can't take out lim for both the $x$ and $y$ simultaneously.


Markers of \usetikzlibrary{plotmarks} in nodes shifted compared to \addplot

MWE:  \documentclass[]{standalone} \usepackage{pgfplots} \pgfplotsset{compat=1.12} \usetikzlibrary{plotmarks} \begin{document} \begin{tikzpicture} \begin{axis}   \addplot[mark=*] coordinates   {(0,0)};   \node[blue] at (0,0) {\pgfuseplotmark{*}}; \end{axis} \end{tikzpicture} \begin{tikzpicture} \begin{axis}   \addplot[mark=pentagon*] coordinates {(0,0)}; \node[red] at (0,0) {\pgfuseplotmark{pentagon*}}; \end{axis} \end{tikzpicture} \end{document}     As you can see in the first picture both markers are at the same position, but not in the second. What do I have to do to get the same positioning of the marker in the node as the one which is plotted with \addplot?  Update: Version numbers from log file:  Package: pgfplots 2015/05/02 v1.12.1 Data Visualization (1.12.1) Package: pgf 2013/12/18 v3.0.0 (rcs-revision 1.14) File: pgflibraryplotmarks.code.tex 2013/07/20 v3.0.0 (rcs-revision 1.13)   Other questions (this is more or less a duplicate):      (see most importantly this one!)


R Code with minted, "¡-" instead of "<-" and underscores are omitted

I am using overleaf to write a LaTeX document. I want to include some R code blocks with minted, but minted displays my arrows in the code "<-" like this: "¡-". How can I fix this? I encoded both the code and my LaTeX document in utf8. It also omits underscore symbols "_" and brackets "{}. It does not work if I include the code directly \begin{minted}[linenos,breaklines,bgcolor=myLightGray]{r} check_create_dir <- function(path) {     print("using existing folder") } \end{minted}  And if I load a file: \inputminted[linenos,breaklines,bgcolor=myLightGray]{R}{code/test.R}


I need to alter the MAC address for eth1 ethernet device on my embedded system permanently so it retains this MAC address on every boot.  The OS I'm using:  VERSION_ID="v2015.12" NAME="Angstrom" ID="angstrom" PRETTY_NAME="The Ångström Distribution v2015.12" ANSI_COLOR="1;35" HOME_URL="http://www.angstrom-distribution.org"   The version of Linux I am using is:  Linux arria10 4.1.33-ltsi-altera #1 SMP Mon Oct 30 10:14:22 PDT 2017 armv7l GNU/Linux   I am able to set the MAC address for eth0 by altering the following bootarg:  setenv ethaddr 00:11:22:33:44:55 save run bootcmd   Once booted, eth0 takes this MAC address as expected.  When I try to do the same for eth1, using eth1addr a random MAC address is defined when I boot.  I can however alter the MAC address of eth1 once booted by using the following:  ifconfig eth1 down ifconfig eth1 hw ether 00:11:22:33:44:56 ifconfig eth1 up   This is not a permanent solution for me as I would need to set the MAC every time I have booted the device.  Is there a way to set the MAC address of eth1 from the bootargs? Also any ideas on why I wouldn't be able to set the MAC address using setenv eth1addr?  Edit: eth0 is RGMII, eth1 is SGMII


Align does not align equation vertically correct


I downloaded  (web development environment) and tried to compile it, but after running ./configure  I get this error.  checking for SCREEM... configure: error: Package requirements (         gtk+-2.0 >= 2.6.0                       glib-2.0 >= 2.6.0                       libgnome-2.0 >= 2.2.0                       libgnomeui-2.0 >= 2.6.0     libxml-2.0 >= 2.4.3                     libglade-2.0 >= 2.3.0                       gconf-2.0 >= 2.2.0gnome-vfs-2.0 >= 2.8.3                        gdk-pixbuf-2.0 >= 2.2.0                     gthread-2.0 >= 2.2.0                        libgtkhtml-2.0 >= 2.2.0                     gmodule-2.0 >= 2.2.0            libgnomeprint-2.2 >= 2.2.0                  libgnomeprintui-2.2 >= 2.2.0                    gtksourceview-1.0 >= 1.1.90                     libstartup-notification-1.0                                     libgnome-menu >= 2.9.2      ) were not met:  No package 'libgtkhtml-2.0' found No package 'libgnomeprint-2.2' found No package 'libgnomeprintui-2.2' found No package 'gtksourceview-1.0' found No package 'libgnome-menu' found  Consider adjusting the PKG_CONFIG_PATH environment variable if you installed software in a non-standard prefix.  Alternatively, you may set the environment variables SCREEM_CFLAGS and SCREEM_LIBS to avoid the need to call pkg-config. See the pkg-config man page for more details.   I tried to find the missing packages using apt-cache search but no luck with the exception of libgnome-menu  How do I install screem in Ubuntu 12.10(amd64)


When I was trying to open  I just added using the iOS app I received this error:     Error The question could not be loaded   Reproduction scenario:   add a question; in my case it didn't open it directly; it doesn't show up in the list yet; I opened my profile and clicked the question; bang!


Prove that $f(x)=d(x,A)=\inf_{y\in A}d(x,y)$ is continuous on $M$

Let $(M,d)$ be a metric space, $A\subset M$. Prove that $$f(x)=d(x,A)=\inf_{y\in A}d(x,y)$$ is continuous on $M$.   I have tried the following  Let $\epsilon>0$, $x_0\in M$. I have to find $\delta>0$ such that if $d(x,x_0)<\delta$, then $|f(x)-f(x_0)|<\epsilon$.  For that,   $$|f(x)-f(x_0)|<\epsilon\iff \big|\inf_{y\in A}d(x,y)-\inf_{y\in A}d(y,x_0)\big|<\epsilon \iff \big|\inf_{y\in A}\{d(x,y)-d(y,x_0)\}\big|<\epsilon$$ and I do not know how to continue.  Note: My teacher has not defined Lipschitz continuity.


simple repeated measures syntax - lme vs. lmer

I'm trying to look for significant effects on "similarity" (of "isinpair" and controlling for time effects) using repeated measures with an in group sample. The intervention "isinpair" occurs after a short period of time (time intervals aren't equivalent, but there are many occuring with in a relative short time).  The question seems a variation of   Unfortunately, I am quite hazy about the syntax (and underlying statistical differences) of lme vs. lmer. I've seen both recommended for similar tasks.   Are these two examples accomplishing what I intend? How equivalent / different are they? Which is better illustrating what I'm hoping to examine?  lmer(similarity ~ 1 +time*isinpair +(time*isinpair|user1), data=nozeros)   lme(similarity ~ isinpair*time, random=list(user1=pdBlocked(list(~1,                     pdIdent(~isinpair-1), pdIdent(~time-1)))), data=nozeros)  How does this compare to:  aov(simscore ~ isinpair * time + Error(user1), data = nozerosdemo))


Let $X_1,X_2,...,X_n$ be independent normal distributions with a common variance $\sigma^2$. The usual definition of sample variance is $S^2:=\frac{\Sigma_{i=1}^{n} (X_i-\bar{X})^2}{n-1}$.   I want to show that $E[S^2]=\sigma^2$, i.e. the population variance.  My attempt at proof:  $\frac{n-1}{\sigma^2}E[S^2] = E[\frac{(n-1)S^2}{\sigma^2}] = E[\frac{\Sigma_{i=1}^{n}(X_i-\bar{X})^2}{\sigma^2}]=n$,  This is because for each $i$, $\frac{(X_i-\bar{X})}{\sigma}$ has a $N(0,1)$ distribution, so $\frac{(X_i-\bar{X})^2}{\sigma^2}$ has a Chi-squared distribution, each has an expected value of $1$.  But then $E[S^2]=\frac{n}{n-1}\sigma^2\neq 1$.


finding the functions satisfying $f(xy)=f(x)f(y)-f(x+y)+1$

Define a function $f\colon\mathbb{R}\to\mathbb{R}$ which is continuous and satisfies $$f(xy)=f(x)f(y)-f(x+y)+1$$ for all $x, y \in\mathbb Q$. With a supp condition $f(1)=2$. (I didn't notice that.) How to show that $f(x)=x+1$ for all $x$ that belong to $\mathbb{R}$?i got the ans from Paul that it is true for all rationals x but I still cannot show that for $x, y \in\mathbb R$ is correct.


Which one is correct use of "each", "each may contribute what he can" or "each may contribute what they can"?

I read a sentence stated as:     "The voluntary organisation come forward to help the victims and said that each may contribute what he can."    In that sentence I'm confused which one is correct , each may contribute what he can or each may contribute what they can?


Why are authors not made anonymous during the review process?

During the review process of an article, the reviewers are (almost always) anonymous by default for obvious reasons.  Why are not authors also made anonymous?  It could help remove the weight that established authors carry in certain fields (which can tilt the scale in their favor), as well as the stigma associated to research coming from non-developed countries.  Are there any good reasons why this is not done? I can not think of any.


how to create an incident in serviceNow from salesforce(Case)?

I'm trying to integrate salesforce and serviceNow. If I create a new case in salesforce, that should be saved as incident in serviceNow.  Here I developed some code but I'm stuck at mapping the salesforce case fields with serviveNow incident fieds.  Public with sharing class OutboundMsg {       public static void servicenowPost(){            Http http = new Http();         HttpRequest req =  new HttpRequest();         HttpResponse res = new HttpResponse();           String username = 'admin';          String password = '$Test12345';          Blob headerValue = Blob.valueOf(username + ':' + password);         String authorizationHeader = 'BASIC ' +         EncodingUtil.base64Encode(headerValue);         req.setHeader('Authorization', authorizationHeader);            req.setEndpoint('https://dev23577.service-now.com/');         req.setMethod('POST');         req.setHeader('Content-Type', 'application/x-www-form-urlencoded');             //Id caseId = req.requestURI.substring(req.requestURI.lastIndexOf('/')+1);       //  Case c = new Case(subject='',status='new',origin='web');         //insert c;        // req.setBody('c');         // Create a new http object to send the request object        // A response object is generated as a result of the request             res = http.send(req);         System.debug(res.getBody());      } }   How can I establish the mapping between salesforce and serviceNow?


What is a good focal length for street photography?

With a long lens you don´t disturb people but you are left "out of the scene", while with a short focal lens you are "inside the scene" but you may disturb people. What is a better alternative for street photography?


Is use of negative sign in faraday's law a convention because of using right hand thumb rule?

We use right hand thumb rule to relate $dS$ and $dl$ like if $dS$ points in the direction of thumb then direction of $dl$ is taken in the direction of fingers but if we use left hand thumb rule to relate $dS$ and $dl$ then there is no need of negative sign in the equation? $$\oint\vec{E'}\cdot\vec{dl'}=-\frac{d\phi_B}{dt} $$


chacha20-poly1305 padding and length encoding

The AEAD construction for chacha20-poly1305 described in the  encodes message lengths into the text that is to be hashed. The  goes further and pads associated data and plaintext to multiples of 16 bytes.  Can anyone explain what the purpose of that is? The chacha20-poly1305 implementation found in OpenSSH doesn't do anything like that, and as far as I can see, neither does NaCl. Those are still considered secure so I wonder what's going on.


Should I send a follow up mail to my potential supervisor

Last friday I received an email from my potential supervisor that my application was positively reviewed and that they will further progress with my application if I'm still interested. I replied that I'm happy to hear that and that I'm still interested. However, up until now, I didn't hear from them anymore. Is this normal? I though they would invite me for an interview as soon as possible. I know I might be panicking, but I'm afraid they forgot me. Can I send a second email to ask what the next steps are? Or should I just be patient...


Suppose f is a function from X to Y and g is a function from Y to Z. Prove the following: g o f is one-to-one, then f is one-to-one.  How would I start such a problem.


Standard Basis and Change of Basis Matrix

Find the matrix of transformation $ \mathbb{R}^3 \to \mathbb{R}^4$ taking $v_1 = (1,2,3)^T$ to $w_1 = (1,0,0,2)^T$, $v_2 = (2,3,4)^T$ to $w_2 = (1,2,3,4)^T$ and $v_3 = (1,1,2)^T$ to $w_3 = (0,5,1,7)^T$ by first finding the change of basis matrix from the basis ${v_1,v_2,v_3}$ to the standard basis and then multiplying it by the matrix which takes the standard basis to $w_1, w_2$ and $ w_3,$ respectively. Explain why this gives you the right answer.     Just really not sure where to begin, other than by forming the 3x3 matrix out of $v_1, v_2$ and $v_3$.


Find all solutions of the equality $y^2=x^3+23$ for integers $x,y$   I guess, that x cannot be even. because we can apply mod 4 test  say $x=2k$ then $y^2=8k^3+23\equiv3\mod(4)$   but, this is not possible, since the square of an integer is congruent to $0$ or $1$ $\mod (4)$  so $x$ is of the form $4k+3$ or $4k+1$  $x=4k+3$ is also not possible for the same reason but for the last case the test fails.  any hints ?


Cannot Kill a process that has a thread started

I have a python script that starts a process using multiprocessing Process class. Inside that process I start a thread with an infinite loop, and I simulate an exception on the main thread by doing exit(1). I was expecting exit to kill the process, but it doesn't, and the main thread reports it as alive.  I have tried with both raising exception and calling exit, but none work. I have tried waiting for the process to finish by waiting for is_alive, and by calling join. But both have the same behavior.  from multiprocessing import Process from threading import Thread from time import sleep   def infinite_loop():     while True:         print("It's sleeping man")         sleep(1)  def start_infinite_thread():     run_thread = Thread(target=infinite_loop)     run_thread.start()     exit(1)  def test_multi():     x = Process(target=start_infinite_thread)     x.start()     sleep(5)     assert not x.is_alive()   I am expecting the process not to be alive, but the assert fails.


Confused about Electorate badge criteria

How can I vote on 600 questions but only 25% of them are on questions?  Did it originally mean "600 posts"?


If I have a .class file, how do I open it/view the source code? I think I have to decompile it first, but how the heck do I do that?


Calculating $\lim_{x\to\infty} (\sin\frac{1}{x}+\cos\frac{1}{x})^x$ without l'Hopital

Calculate $\lim_{x\to\infty} (\sin\frac{1}{x}+\cos\frac{1}{x})^x$  without using l'Hopital's rule.   I attempted pulling something out to get a limit that resembles $e$, this gave me:  $$\sin^x\frac{1}{x}(1+\frac{1}{\tan\frac{1}{x}})^x=\sin^x\frac{1}{x}\bigg[(1+\frac{1}{\tan\frac{1}{x}})^{\tan\frac{1}{x}}\bigg]^{\frac{x}{\tan\frac{1}{x}}}$$  But then the first part goes to $0$ and the exponent goes to infinity, and I'm kinda stumped.


Traveling to France before date of the long sejour visa

I would like to travel to France before the starting date of my long sejour visa. I thought it will be no problem since I can travel to the Schengen only with my passport without asking any permission for three months as tourist, but now I was told I have to enter France exactly the date that my long sejour visa says. Is it true?  I have read  but I am not sure I found the answer.  Note: I have been calling the French consulate in my country since last Thursday but no one is answering the phone. I suppose they are  in holidays, but my flight is very soon so I have to know what to do as soon as possible.


Finding the simplest rational in a closed interval

Given a closed interval [a,b], how would you find the "simplest rational", p/q, contained in that interval. By simplest, I mean the rational with the smallest denominator q. You may, if you wish assume that the interval is very small. We can already construct a rational contained in the interval, but in general our constructed rational does not have the smallest q. Thank You.


I have below operation. "result" always return null pointer exception. How to resolve this issue where if "anotherMap" contains null values, I want to return empty string. I do not want to modify newMap since that is dependent data.  I want handle null cases in the last operation below. import java.util.HashMap; import java.util.Map; import java.util.List; import java.util.ArrayList; import java.util.stream.Collectors;   public class Class1 {       public static void main(String []args){         Map<String, String> newMap = new HashMap<>();          List<String> keys = new ArrayList<>();         Map<String, String> anotherMap = new HashMap<>();          newMap.put("key1", "1");         newMap.put("key2", "2");         newMap.put("key3", "3");                  keys.add("key1");         keys.add("key4");         String value = newMap.get("key4");         anotherMap.put("key4", value);         Map<String,String> result = keys.stream()                 .collect(Collectors.toMap(key -> key, key -> anotherMap.getOrDefault(key, "")));         System.out.println(result);      } }  Stack Trace: Exception in thread "main" java.lang.NullPointerException     at java.util.HashMap.merge(HashMap.java:1224)     at java.util.stream.Collectors.lambda$toMap$58(Collectors.java:1320)     at java.util.stream.ReduceOps$3ReducingSink.accept(ReduceOps.java:169)     at java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1374)     at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481)     at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471)     at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708)     at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234)     at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499)     at Class1.main(Class1.java:23)


Let $z_n$ be a sequence of nonzero complex numbers such that $z_{n+1}=z_n^2+z_n$ for all $n\in\mathbb{Z}$.  Can such a sequence satisfy $\lim_{n\to +\infty}z_n=\lim_{n\to -\infty}z_n=0$ ?    A friend from the university showed me this question saying it's a student competition problem from the 90's. None of us and our colleagues was able to solve it, nobody had even an idea how to start the solution.  =======================  It is NOT a duplicate. There is a big difference between real and complex numbers and sequences, especially when one wants to use the fact that being bounded and monotonic implies convergence, which was the main observation in the linked question!


Karn, the Great Creator - Does "from outside the game" have to be Standard if we're playing casual?

So my sons and I are having a debate about 's ability to use a "card from outside the game" and its format. The way I interpret the text is that in a casual, non-tournament game, I can choose any artifact outside the game from my collection and put it in my hand. Does that chosen card have to be within the format we are playing? In other words, if I'm playing standard, does my "chosen card" have to be within the standard format or can it be from any set? And if so, can it be one that's on the banned play list?


fractions.Fraction() returns different nom., denom. pair when parsing a float or its string representation

I am aware of the nature of  but I still find the following surprising:  from fractions import Fraction  print(Fraction(0.2))       # -> 3602879701896397/18014398509481984 print(Fraction(str(0.2)))  # -> 1/5  print(Fraction(0.2)==Fraction(str(0.2)))  # returns False print(0.2 == float(str(0.2)))             # but this returns True!   From the  I could not find anything that would explain that. It does state:     ...In addition, any string that represents a finite value and is   accepted by the float constructor is also accepted by the Fraction   constructor...   but to me this implies a similar behavior to float() which I just do not see as shown above.  Is there any explanation for this?    It is important to note that the behavior shown above is not specific to the value (0.2) but rather general; everything I tried behaved the same way.    Interestingly enough:  from fractions import Fraction   for x in range(1, 257):     if Fraction(str(1/x))==Fraction(1/x):         print(x)   prints only the powers of 2 that are smaller than the selected upper bound:  1 2 4 8 16 32 64 128 256


Question:$\forall A,B \in M_n(\mathbb F),AB=BA,\exists C \in M_n(\mathbb F),f(x),g(x)\in \mathbb F[x],A=f(C),B=g(C)?$ Or:$\forall \sigma,\tau \in L(\mathbb F),\sigma \tau=\tau \sigma,\exists \upsilon \in L(\mathbb F),f(x),g(x) \in \mathbb F[x],\sigma = f(\upsilon),\tau=g(\upsilon)?$  I find if $A=f(C),B=g(C)$,then $AB=BA$. I wonder if the converse is true,but I don't know how to proove it. Help please~