long url problem with biblatex and hyperref

There were some hits for my problem but did not answer fully.  I found out the PassOptions... command to get rid of some options clash with url and hyperref packages here    I have the below MWE with two options where I am using biblatex.   One is with hyperref and the other without. The one without hyperref works fine and the url information is broken correctly but the one with hyperref does not work. It leaves the link as a one long line with the box. I could not really find a fix for this. What is missing from the implementation with hyperref?  \documentclass[10pt]{article} % % option 1 % % % % that works without hyperref % % and the links I used as in the rest of my thesis % % the long line is broken correctly without using % % hyphens option with the url package % \usepackage[backend=bibtex,backref,style=numeric, %             sorting=nyt,firstinits=true,maxbibnames=99]{biblatex} % \addbibresource{test.bib} % \usepackage{xcolor} % % the test % \title{Test document} % \begin{document} % this\cite{nvh_BK} is a test. % \printbibliography % % end of option 1  % option 2 % with hyperref package % I found out that I have to use the  % PassOptionsToPackage before the biblatex definitions %  \PassOptionsToPackage{hyphens}{url} % \usepackage[backend=bibtex,backref,style=numeric,             sorting=nyt,firstinits=true,maxbibnames=99]{biblatex} \addbibresource{test.bib} \usepackage{hyperref} \usepackage{xcolor} \hypersetup{    colorlinks   = true,    % Colours links instead of ugly boxes    urlcolor     = blue,    % Colour for external hyperlinks    linkcolor    = blue,    % Colour of internal links    citecolor    = red,     % Colour of citations    pdfborder = { 0 0 1 },  % Border for pdf    linkbordercolor = blue, % Border color    citebordercolor = red,    breaklinks = true } % test \title{Test document} \begin{document} this\cite{nvh_BK} is a test. \printbibliography % end of option 2 \end{document}   test bib file I used with one entry is as follows:  @online{nvh_BK,   author = {Bruel\&Kjaer},   title = {Vehicle noise vibration and harshness development},   year = 2019,   url = {https://www.bksv.com/en/Applications/vehicle-noise-vibration-and-harshness-development-test-test-test},   urldate = {2019-05-10} }


Did Hermione ever fix her parents' memories?

At the beginning of the 7th book, Hermione Granger Obliviates her parents' memories of her and themselves and makes them think they want to move to Australia.  Is there a fix for this type of spell?   Did Hermione ever recover their memories and return to them after Voldemort was defeated?


How do I install a program as a different user?

To be very specific:  Debian system:  I want to install Linuxbrew, when logged in as root, as a specific user.  Linuxbrew enjoys the niceness of being installed by the user, for the user's specific purposes. My goal is to, as root (definitely as root), execute the command:  ruby -e "$(curl -fsSL https://raw.githubusercontent.com/Homebrew/linuxbrew/go/install)"   as the user, so for all purposes, and intent, a specified user ran it.  the motivation is to run this command on behalf of, and as, the specified user so they may use Linuxbrew freely, but root user has provided it.  Note: I would like -simple- solutions for educational purposes.  I am sure there's a variety of esoteric ways, but the less obfuscated, the better.  this is a part of the solution.  Simplicity, and readability.


Where should multi-discipline questions go?

Some questions can be answered in more than one dimensions. For example, a social phenomena can be explained by mathematical modelling, sociology theories, and / or political / economic theories. Should I post it on each site, stating from which dimension I expect the answer to come, or is it not a good fit for SE (violation of real questions have an answer)?  The question is different from . People who cross-post questions often seek the same answer from larger audiences. For example, if somebody cross posted "How can I achieve this in SQL Server?" on both SO and DBA, he or she is expecting more PROGRAMMERS to see the post.  However, I would like to post some question like "Why did Clinton lose the campaign?", and I'm expecting answers from statisticians on why the polls failed, answers from political scholars on the election system of the US, and maybe also psychologist, etc. I'm not cross posting to reach a larger audience of the same group (e.g. programmers), I want answers from DIFFERENT audiences.


Beamer, page/frame numbers, buttons and Appendix slides

I am using beamer and I have a slide in an Appendix section. I hyper-reference it with a button. The Appendix does not appear as a section itself. The Appendix material is at the end of the code. I would like all of this to remain.      When I click on the button on Slide 2, it brings me to the Appendix slide. The Appendix Slide says p. 3. Even though the it is linked from Section 2.  Would it be possible to do either of the following two?   Have the appendix slide be the same from which it is buttoned. In this case, say 2/3. Have the appendix slide have no page number. Just be blank.    The following code should illustrate the point.  \documentclass[professionalfont]{beamer} \mode<presentation> \usetheme{Warsaw} \usetheme{CambridgeUS} \usepackage{booktabs} \begin{document}  \section{Section} \subsection{}  \frame { \frametitle{Slide Title} Slide 1 \hspace{0.01cm}\hyperlink{eaa<1>}{\beamergotobutton{Literature}} }  \frame { \frametitle{Slide Title} Slide 2 \hspace{0.01cm}\hyperlink{eab<1>}{\beamergotobutton{Literature}} }  \frame { \frametitle{Slide Title} Slide 3 }  \section*{}  \addtocounter{framenumber}{-1} \frame[label=eaa] { \frametitle{Appendix Material} Appendix Material here for Slide 1. { {\tiny  \hfill\Acrobatmenu{GoBack}{\beamerreturnbutton{}}  }} }   \addtocounter{framenumber}{-1} \frame[label=eab] { \frametitle{Appendix Material} Appendix Material here for Slide 2. { {\tiny  \hfill\Acrobatmenu{GoBack}{\beamerreturnbutton{}}  }} }  \end{document}   I would very much appreciate your help.


taking convex hull does not add extreme points

can anybody help me please? Is there a good way to prove that given a set of points, say $S = \{x_1, x_2, ..., x_n\}$, then show that the convex hull of $S$, that is, $conv(S)$ contains all the extreme points in $S$?   Is this equivalent to saying that taking the convex hull of the set does not add any extra extreme points?  Thanks a lot.


Google Sheets can not use Google form data in formulas

I have a Google Spreadsheet with two sheets. The first uses formulas to manipulate the second sheet row by row, and the second is fed by a Google form. My first sheet has formulas as such:  A2: int('Form Responses 1'!A2) B2: 'Form Responses 1'!B2&" and "&'Form Responses 1'!C2  This is copied down 100 rows, where each row references the same row in the second sheet. However, when I submit the Google form, the formulas point to the next row, skipping entirely over the form data.   If I submit the form once: A2: int('Form Responses 1'!A3) B2: 'Form Responses 1'!B3&" and "&'Form Responses 1'!C3  Each row points to the next row in the second sheet. This repeats for every form submition, so after three submitions, the formulas look like:  A2: int('Form Responses 1'!A5) B2: 'Form Responses 1'!B5&" and "&'Form Responses 1'!C5  I can also reproduce this problem if I insert a row above the row where the formulas point to. It seems they point to an actual row, and move their references when the row moves, rather than pointing to a certain row number and column number. How can I get out of this?


How to rigorously prove that 1/t does not have a Laplace Transformation

I know that $f(t)=\frac{1}{t}$ does not have a Laplace transformation but I don't know the right(formal) way to prove it.  Here is my way:  Using the fact:  $L[\frac{f(t)}{t}]=\int_{s}^{\infty}F(t)dt$,  I have:  $L[\frac{1}{t}]=\int_{s}^{\infty}\frac{1}{s}dt = \frac{1}{s}|^{\infty}_{s}$   this is divergent and therefore the Laplace transformation of $f(t)=\frac{1}{t}$ does not exist.  However, I think my way is not rigorous. I hope I can receive a explicit proof of it (Maybe by definition to integrate).  Thank you so much!    Edit:  Actually, I do not know how to actually prove that $\int_{0}^{\infty}e^{-st}\frac{1}{t}dt$ diverges. Please help me with this!


After changing my engine to biber from bibtex to ensure my bibliography worked, it no longer recognises my cross-references to labelled equations and theorems in my script. They are labelled and referenced as follows:  ...\label{equation}... ...\ref{equation}...   When I typeset in LaTeX the console reads as:  ...LaTeX Warning: Reference 'FactCor' on Page 28 undefined on input line 748... ...Package inputenc Error: Unicode char \u8:ï¿œ not set up for use with LaTeX


I Have  Div with a div and a p tag within it. I need the inner div (customImage) to be on the left while the text is next to it but centered. here is the HTML

WITH PAD


What form of the verb is used with compound subjects containing "or"?

We always get work done, regardless of what mood Bill or I is/am/are in.   Which form of 'be' would be used here?


C++: Performance of std::vector vs std::list

I have the following code to profile std::vector performance vs std::list for various N.  void vectorPerf(size_t n) {    std::chrono::high_resolution_clock::time_point t1 = std::chrono::high_resolution_clock::now();    std::vector<size_t> cache;    for (size_t i = 0; i < n; i++) {       cache.push_back(i);    }    std::chrono::high_resolution_clock::time_point t2 = std::chrono::high_resolution_clock::now();     auto duration = std::chrono::duration_cast<std::chrono::microseconds>(t2-t1).count();     std::cout << duration << " us." << "\n";     return; }  void listPerf(size_t n) {    std::chrono::high_resolution_clock::time_point t1 = std::chrono::high_resolution_clock::now();    std::list<size_t> cache;    for (size_t i = 0; i < n; i++) {       cache.push_back(i);    }    std::chrono::high_resolution_clock::time_point t2 = std::chrono::high_resolution_clock::now();     auto duration = std::chrono::duration_cast<std::chrono::microseconds>(t2-t1).count();     std::cout << duration << " us." << "\n";     return; }  int main(int argc, char** argv) {     if (argc != 2) {       return -1;    }    std::stringstream ss(argv[1]);    size_t n;    ss >> n;    vectorPerf(n);    std::cout << "\n";    listPerf(n);    std::cout << "\n"; }   For multiple runs of the same set of N, I get results where the results are consistently of the same order as the numbers below:  N       std::vector  std::list 1000    46           116 2000    85           217 5000    196          575 10000   420          1215 100000  3188         10497 1000000 34489        114330   What I am wondering is how come the performance of std::list is consistently worse then std::vector. For std::vector I would have expected the performance to be amortized O(N), because the internal object underpinning std::vector would need to be resized time to time. Since all I am doing is inserting an element to the end of the list I would have expected std::list to be O(1). So that would suggest that std::list would do better than std::vector but the opposite seems to be true.   I would appreciate if someone can shed some light on why this is happening. I am compiling on MacOS 10.12.6 using g++ on a 2015 MBP.  Thanks.   EDIT: I now understand that std::vector::push_back() is amortized O(1). However, what is not clear to me is why does std::list::push_back() perform consistently worse than std::vector::push_back()?


How to install Python 3.6 in virtual environment?

I am using Ubuntu 16.04 which comes with python 2.7 and python 3.5 pre-installed. I am currently working on a project where it requires to install python 3.6 and some additional packages. I have searched the Internet but i couldn't manage to get the comprehensive tutorial steps where I could follow. Please help me. Thanks in advance...


What are objective criteria to assess if a backlink should be banned with Google's Disavow Tool?

Google's Search Console gives the possibility to list all backlinks from other domains to your site, which are an important factor for search engines to determine your site's ranking, popularity and importance.    As we know, "linkspam" can threaten your site's authority. Using Google's Disavow Tool gives you a possibility to disavow low-quality links to your site, which can "potentially harm your site’s performance in Google’s search results" if used incorrectly. In the  Google gives "spammy, artificial, or low-quality links" as examples, which is pretty vague and not further explained in the .  Which objective criteria should be used to asses if a backlink is "spammy, artifical or low quality" and therefore be disavowed?  What is your workflow for assessing backlink quality?


I want to implement a image editing program, but I can not display the Bitmap in my WPF.  For the general editing I need a Bitmap. But I can not display that in a Image.  private void MenuItemOpen_Click(object sender, RoutedEventArgs e) {     OpenFileDialog openfiledialog = new OpenFileDialog();      openfiledialog.Title = "Open Image";     openfiledialog.Filter = "Image File|*.bmp; *.gif; *.jpg; *.jpeg; *.png;";      if (openfiledialog.ShowDialog() == true)     {         image = new Bitmap(openfiledialog.FileName);     } }   I load the Image with a OpenFileDialog into the Bitmap. Now I want to set the picture in my WPF. Like so:  Image.Source = image;   I really need a Bitmap to get the color of a special pixel! I need a simple code snipped.  Thank you for your help!


How do I get to know partitions' names?  I entered sudo fdisk -l, and I got:  Device Boot      Start         End      Blocks   Id  System /dev/sda1       156264318   273474494    58605088+   7  HPFS/NTFS/exFAT /dev/sda2       273474558   353670974    40098208+   7  HPFS/NTFS/exFAT /dev/sda3       390684798   507894974    58605088+   7  HPFS/NTFS/exFAT /dev/sda4       507895038   625105214    58605088+   7  HPFS/NTFS/exFAT   For example, which one is DSK_VOL5 or DSK_VOL2?


I'm new to the deep learning field and I've a question that I didn't get for it a clear answer or explanation in the course, I understand the tensors and the idea behind batches but I don't really get the concept of an optimizer like adam optimizer . why we are using them and for what , where is the purpose .  By the way I'm learning pytorch.


passing a variable from one class to another in Java keeps giving me a null error

For my university assignment i'm trying to pass an int as a parameter to another class. However I keep receiving a null error for some reason. I even printed out the integer to see if it was null but it wasn't. Now I don't know what the problem could be. I've been trying different stuff for a couple hours now and I thought I should post my issue here.  I created a field in this class called currentBuild so that I can call methods in the Build class.  private Build currentBuild;   This is my method that gets the integer from the user and sends it to another class called Build.  private void addFromCat(){     int partNo;      System.out.println("Enter catalogue number of the part: ");     partNo = In.nextInt();     System.out.println(partNo);     currentBuild.getNum(partNo); }   This is the method in the Build class that receives the integer. It's called getNum.  public class Build {  private List <Part> parts = new ArrayList <Part>();  /**  * Constructor for objects of class Build  */ public Build() {  }  public void getNum(int partNo){      int numberPart = partNo;     System.out.println("part number is: " + numberPart);     }    }


Find measure of required angle in isosceles triangle.

Triangle ABC is isosceles triangle with AB = AC. And angle A = 20°. Point D is on side AC such that angle CBD = 70°. Similarly, point E is on side AB such that angle BCE = 60°. Now, points D and E are joined. Then find measure of angle BDE. I found other angles. I tried using sine rule. But, its getting harder by applying sine rule. I don't know whether I am missing some important theorem.  Please help.  I'm sorry that I'm unable to provide diagram.


Nonexistence of an injective $C^1$ map between $\mathbb R^2$ and $\mathbb R$

I am getting bored waiting for the train so I'm thinking whether there can exist a $C^1$ injective map between $\mathbb{R}^2$ and $\mathbb{R}$. It seems to me that the answer is no but I can't find a proof or a counterexample... Can you help me?


I can't add Minecraft mulitplayer servers

I have recently bought the game and added lots of multiplayer severs that I love. One day I log in and they are all gone; I go onto direct connect and put in the correct IP and it says:  Outdated server, Still on {0}   How do I get my servers back?


Necessity of coprimeness in Carmichael numbers

From , Carmichael numbers are (1) "composite numbers $n$ which divide  $b^n  −  b$  for every integer  $b$ .   OR equivalently (2) Carmichael numbers have the property that  $b^{n  − 1}  ≡   1  \pmod n$  for all bases  $b$  coprime to  $n$."  So essentially my question is: why  does the second definition requires $b$ to be coprime to $n$ and the first doesn't?  I tried to go from $b^{n-1} \equiv 1 \pmod n$ (with $b$ coprime) to $b^n \equiv b \pmod n$ for ANY $b$  but I hit a lot of dead ends.


Linear algebra is a very well-behaved part of mathematics. Soon after you have mastered the basics you got a good feeling for what kind of statements should be true -- even if you are not familiar with all major results and counterexamples.  If one replaces the underlying field by a ring, and therefore looks at modules, things become more tricky. Many pathologies occur that one maybe would not expect coming from linear algebra.  I am looking for a list of such pathologies where modules behave differently than vector spaces. This list should not only be a list of statements but all phenomena should be illustrated by an example.  To start the list I will post an answer below with all pathologies that I know from the top of my head. This should also explain better what kind of list I have in mind.


Circle Imprinted on Photos - How to Get Rid Of?

Recently some photos I've taken have had a band of circles imprinted on the pictures. Is this caused by my filter or something with the lens itself? Attached a photo for reference. It only happens sometimes.


If $p,q$ are positive quantities and $0 \leq m\leq 1$ then Prove that $$(p+q)^m \leq p^m+q^m$$    Trial: For $m=0$, $(p+q)^0=1 < 2= p^0+q^0$  and for $m=1$, $(p+q)^1=p+q =p^1+q^1$.   So, For $m=0,1$ the inequality is true.How I show that the inequality is also true for $0 < m < 1$.   Please help.


The Winter Bash is back and the hats are listed below.  As always, there are only two answers: one for the secret hats, and one for the regular hats. The secret hat list will be updated as we learn them.  Only edit the secret hat answer with definitive and correct triggers. This is not the place to post guesses.    If you'd like to discuss Winter Bash, hats or just have a question about the WB please come over to the .  Please keep the comments here clean. As always comments are not meant for discussion, conversation, "I just got hat X", etc use the  for that (the remaining meta mods will periodically clean the comments). I know you are excited you just got a secret hat, but please instead of posting a comment come over to the  and tell us all there.  Provided that "It's important to know your history... in more ways than one"  again this year, here are the hats from prior years:


Need to count more than 50000 records but not able to do it even with ReadOnly annotation in apex class

I am getting too many query rows 50001 error while running this class method from execute anonymous.  I got same error when annotating execute method in scheduled class with readonly annotation as well. This is where i will be using this in real scenario.  I was expecting i should be able to count upto 1 million rows using readonly. I need to count more than 50000 records.  What am i doing wrong :  public class Test_Aggregate {     @ReadOnly     @RemoteAction     public static void TestAgg() {         List<Custom_Object__c> custList = [SELECT Id  FROM Custom_Object__c];         System.debug('No of records are: '+custList.size());     } }  Test_Aggregate.TestAgg();   why did the below not work as well and threw same SOQL row limit 50000 row error :  AggregateResult logResults = database.query('SELECT COUNT(id) result FROM Custom_Object__c'); integer recCount = Integer.valueOf(logResults.get('result')); System.debug('No of Log records are: '+recCount);   Why does salesforce documentation says : The @ReadOnly annotation allows you to perform unrestricted queries against the Force.com database. It appears misleading. I am not doing any DML etc.  All i am asking is for a simple statistic about my object which stores my data. These statistic seem to be gathered every 24 hours. Why platform does not provide any API so that it can be easily accessed. I have heard of hacks where people scan the html of setup page to get it. Why is platform so limiting that i cant get it without running into limits.


Why is a bound electron less massive than its free counterpart?

Does it means that almost half of its energy is lost as electromagnetic radiation?(I'm referring to hydrogen atom with 1 nucleus and 1 electron) I think that electron in an atom can only have a specific amount of energy so it can be kicked out of the atom by absorbing a photon equal to the missing energy? So as more and more electrons fill up the shells of an atom they will be increasingly less massive and thus would have to absorb photon equals to the missing amount of energy to be kicked out, is that right?


How did Linux load this exe compiled with C#?

I just discovered something really surprising. I can compile a simple C# hello world on my windows computer using csc (from Visual Studio), copy the resulting exe file to my Linux computer, and execute it with mono helloworld.exe. So far, everything makes sense to me: according to , on Windows, helloworld.exe is basically just a trick that ends up starting the C# runtime, and the CIL bytecode is just read from some data section later on in the exe file. Likewise, I imagine that, on Linux, doing mono helloworld.exe just starts the C# runtime and directly reads the bytecode without bothering with the exe trickery. For posterity, here is the source, which I got from : //--------------------------------------------- // FirstProgram.cs (c) 2006 by Charles Petzold //--------------------------------------------- class FirstProgram {     public static void Main()     {         System.Console.WriteLine("Hello, Microsoft .NET Framework!");     } }  But here's where things get interesting: on Linux (uname -r on my machine gives 4.14.188-1-MANJARO) I can simply do ./helloworld.exe and it works! I started doing some sleuthing, and here are the first few lines from running strace ./helloworld.exe: execve("./hw.exe", ["./hw.exe"], 0x7fffae8e6070 /* 61 vars */) = 0 [ Process PID=3381 runs in 32 bit mode. ] brk(NULL)                               = 0x7eedb000 arch_prctl(0x3001 /* ARCH_??? */, 0xffb19948) = -1 EINVAL (Invalid argument) readlink("/proc/self/exe", "/usr/bin/wine", 4096) = 13 mmap2(NULL, 8192, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0) = 0xf7faa000 access("/etc/ld.so.preload", R_OK)      = -1 ENOENT (No such file or directory) openat(AT_FDCWD, "/usr/bin/../lib32/tls/i686/sse2/libwine.so.1", O_RDONLY|O_LARGEFILE|O_CLOEXEC) = -1 ENOENT (No such file or directory) stat64("/usr/bin/../lib32/tls/i686/sse2", 0xffb18e00) = -1 ENOENT (No such file or directory) openat(AT_FDCWD, "/usr/bin/../lib32/tls/i686/libwine.so.1", O_RDONLY|O_LARGEFILE|O_CLOEXEC) = -1 ENOENT (No such file or directory) stat64("/usr/bin/../lib32/tls/i686", 0xffb18e00) = -1 ENOENT (No such file or directory) openat(AT_FDCWD, "/usr/bin/../lib32/tls/sse2/libwine.so.1", O_RDONLY|O_LARGEFILE|O_CLOEXEC) = -1 ENOENT (No such file or directory) stat64("/usr/bin/../lib32/tls/sse2", 0xffb18e00) = -1 ENOENT (No such file or directory) openat(AT_FDCWD, "/usr/bin/../lib32/tls/libwine.so.1", O_RDONLY|O_LARGEFILE|O_CLOEXEC) = -1 ENOENT (No such file or directory) stat64("/usr/bin/../lib32/tls", 0xffb18e00) = -1 ENOENT (No such file or directory) openat(AT_FDCWD, "/usr/bin/../lib32/i686/sse2/libwine.so.1", O_RDONLY|O_LARGEFILE|O_CLOEXEC) = -1 ENOENT (No such file or directory) stat64("/usr/bin/../lib32/i686/sse2", 0xffb18e00) = -1 ENOENT (No such file or directory)  I would have expected some error saying "this file is not a valid executable", since I only expect the Linux program loader to understand ELF files instead of Windows's PE format. Instead, it seems that somehow the system is smart enough to start looking for wine (in the strace output, you can see it start to look for wine libraries, and because I've installed wine on my Linux machine, it does eventually find them later on). So what's going on? Is the execve call smart enough to try using wine if it detects a PE file, or is this something that bash is doing? Or is it something else entirely different?


Given two regression lines, one for $x$ on $y$ and one for $y$ on $x$, but no actual data points (just the two lines with slopes and intercepts), can I compute Pearson's product moment coefficient $r$?


I have two functions: but calling like this: pack<int>(some_vector, something_else)  some_vector would be like this: std::vector<int> some_vector;  throws a compilation error:  LNK2019 Unresolved external symbol in main.obj  Both the functions are defined, and calling pack with an int instead of a vector compiles just fine. I want to add more pack functions to accept maps, tuple's etc (as first argument). Is this the correct way of going about this? (I am not that experienced with c++)  template <typename T> void pack(std::vector<T>& src, byte::container& dest, bool initial) {     size_t n = src.size();     size_t s = 0;     uint8_t prefix;     uint16_t post_prefix = n;     bool use_post_prefix = false;     if (n <= 15) {         prefix = fixarray_t(n);     }     else if (n <= max16) {         prefix = arr16;         use_post_prefix = true;     }     else if (n <= max32) {         prefix = arr32;         use_post_prefix = true;     }     if (initial) {         dest.clear_resize(int(n * 0.4));     }     dest.push_back(&prefix);     if (use_post_prefix) {         dest.push_back(&post_prefix);     }     for (uint32_t i = 0; i < n; i++) {         pack(src[i], dest, false);     } }  void pack(uint64_t src, byte::container& dest, bool initial) {     uint8_t prefix;     if (src <= max4) {         prefix = ufixint_t(src);         dest.push_back(&prefix);     }     else if (src <= max8) {         prefix = uint8;         dest.push_back(&prefix);         dest.push_back(uint8_t(src));     }     else if (src <= max16) {         prefix = uint16;         dest.push_back(&prefix);         dest.push_back(uint16_t(src));     }     else if (src <= max32) {         prefix = uint32;         dest.push_back(&prefix);         dest.push_back(uint32_t(src));     }     else if (src <= max64) {         prefix = uint64;         dest.push_back(&prefix);         dest.push_back(uint64_t(src));     }     else {         throw std::range_error(std::to_string(src) + " out of range!");     } }


What's in it for SE to launch new sites?

I remember hearing (can't find a link right now) that advertisements aren't shown on most sites - in fact, in my simple study, they were only shown on the Trilogy.  What is the motivation to launch more sites? All of SE's revenue seems to come from ads and Careers - which is targeted at programmers. Not gardeners.  It's awesome, of course, that there is a site for almost everything. But what's in it for SE? If you aren't showing ads, and your users probably won't use Careers, you're not making any money. So what's the plan for monetization? Is the idea just to expand web presence/reputation?  Of course, I don't expect an answer. Future plans are probably locked down tight. It just occurred to me, and I thought to post this out there. SE is awesome.


how to run wireless wifi adapter tl-wnb821N on virtualbox for ubuntu

maybe it was there discussed before but i have never ever found a solution for this and iam trying it for long time, I was trying many ways but it always didnt work.the problem is that my wifi adapter tl-wnb821N  is not working,when i plug other devices like standart usb it works,when i plug wifi adapter it doesnt work even it wont change a adapters color.


What is the upper limit for the size of an atom?

I read an article saying an Israeli scientist had discovered the heaviest nucleus with 122 protons and 170 neutrons, and found it in a sample of purified thorium, and I would like to know if there are any laws of physics that put a constraint on the size limit of atom? (By size, I mean the maximum number of protons and neutrons held together by nuclear force, so that pretty much rules out neutron star and the likes.)


I have a process I can't kill with kill -9 <pid>. What's the problem in such a case, especially since I am the owner of that process. I thought nothing could evade that kill option.


Blender did not run and shows some error

When I tried to run the blender it shows this I don't know how to solve this as I am new to coding. Anybody help me with that??


I've been watching BlenderGuru's tutorials, and his lines in edit mode are much thicker than mine.    You can see, his lines are solid 2-3 pixel wide, mine are only 1. They also seem to disappear when I zoom in really close. Any fixes?


Show that the set $A := \{x \in Q : x < 0 \text{ or } x^{2} < 2\}$ has no maximum. Does it have a supremum? If yes, what is it?

Show that the set $$A := \{x \in Q : x < 0  \text{ or }  x^{2} < 2\}$$ has no maximum. Does it have a supremum? If yes, what is it?


Is there a way to stop objects visually "clipping" through others at a distance?

Up close, they don't clip through each other, but the farther out you zoom the more they do.


How do you bypass having to manually save during Photoshop batch processing?

I have over 600 JPG images, and I need to apply the same action to all of them and then have them saved to a new folder. I tried batch, but after each image it brings up the JPG options dialog asking me to choose compression and what not. I want it to just save it automatically. How can I do this?  Note: I already tried "Override Save As Commands" and after it's done the destination folder is always empty.


How to tell if an object has the default value for its type?

I am examining an object via reflection, and I want to print those properties which have non-default values. Given a signature like this: public static bool IsDefaultValue(PropertyInfo prop, object o) {  //returns true if the given property's value on o is the default value for the property type }  How could this be implemented?


Correlation between binary data and ordinal data

In my study i have two groups of newborns: one group with Hemodinamically significant PDA(HSPDA)labeled 1 and one group with non-hemodinamically significant PDA(nHSPDA) labeled 0.   Each of these groups has a set of tests(like blood Ph, sugar blood levels etc) and the data is ordinal(ph of 7.27, sugar blood of 100 etc). The tests are dependent on wether the PDA is significant or not.   Which test do i apply to see if there is a correlation between the resuslts of a certain test and the presence of a significant PDA? Do i just compare the test results between the groups?


group rows based on ID and then return the row with the lowest date per ID grouping

suppose you have a data set having 3 columns: ID, user, date.  is it possible to filter the data based on the minimum date even if some of the rows have identical IDs?  sorry if the question is a bit unclear. hopefully the image below  will help clear things.  there are two records having ID=1, with different users as well as dates. what i want to retrieve is the record having an ID=1, USER=A, DATE=2013-01-20 because its date is earlier than that of the second record (ID=1, USER=A, DATE=2013-01-21)  i want to achieve the same effect for the three records having an ID=2. the desired record is ID=2,USER=C,DATE=2013-10-20  basically i want to group these records by their IDs and then from that grouping, get the one with the lowest date


How can run a bash script and inputs in one line

How can run a bash script and its inputs in one line instead of separate commands?  my code  #!/bin/bash read input1 input2 ...   In terminal:  bash file.sh input1 input2   instead of:  bash file.sh input1 input2


Get measurement values from point along the route Arcmap

I have two shape files, one is a route shapefile with polyline and have measurement values. The other one is point with coordinates but no measurement values. I am trying to snap the points to closest route and get measurement of the route that snapped in(please see picture).


Which configuration of armor enchantments gives maximum protection?

Prior to 1.4.6 it was a well known fact that the protection enchantment on armor was strictly superior to the other enchantments and that simply having a few pieces with protection III/IV would max out this protection, leading to the best possible set of armor.  Now that this has , however, I'm curious to see if anyone has analysed what the optimal armor configurations now are?  Presumably it will be some combination of protection enchantments and other enchantments, going by the description of how enchantments work now on the wiki.  Or, are we forced to choose one or more types of protection to max out?  (This would be the case if there are not enough total enchantments possible to max out all areas).  If this is the case, it would be great to see some analysis of how to optimise that choice as well.  I've looked around but haven't found any good mathcrafting on this question yet.  Furthermore, beyond protection against taking damage, can someone include some explanation of the hidden utility bonuses?  For instance, Blast Protection has been described in wiki sources as reducing the knockback effects from explosions, and Fire Protection is described as reducing burn time.  Do these effects scale and max out at some enchantment level, and does Projectile Protection similarly reduce the knockback effect from projectiles?


Not able to levitate magnet for magnetic levitation project

I am following a hackster project on magnetic levitation here -   However, I have followed everything but still, it's not working.   Here are changes to the circuit I made:   The electromagnet which I am using is that of 5V instead of 12V The transducer which I am using is ss8050 instead of TIP120 Hall sensor is tapped just at the bottom of the electromagnet   Electromagnet link -   Update:-  The best I can do is to make the magnet jump up and down fast but it never levitates. Have tried changing PID setting from the project as aggressive and mild but still didn't achieve the final result.  I need advice from an expert to tell me what I am doing wrong here. All components are in good condition and 5v electromagnet is strong enough.  So what am I missing here?


How do prime lens allow variance of focal length when focusing?

If the definition of prime lens says that their focal length is fixed, then how come you can still alter the focal length when focusing? (either MF or AF)


How to find the prime factorization of $100!$.

How can we find the prime factorization of $100!$. My only idea is to write it as,  $$(1)(2)(3)(\color{red}{2})(\color{red}2)...$$  And count the factors.  But that would take way to long. Any ideas?


Five bald men wearing hats go to a party, and when they arrived they put their hats in a dark closet. During the party, someone yells, “Fire!” and the men rush to the closet, grab a hat at random, and leave. What is the probability that  (a) exactly four get the right hats?  (b) all five get the wrong hat?  (c) more than one man gets the right hat?


Why does gcc create a new stack for each function?

I have been looking at disassembled c recently (all compiled with gcc). I noticed every function begins with  push rbp  mov rbp, rsp   And ends with  pop rbp   Or the equivalent registers. I’ve heard this referee to as setting up a new stack for the function, but how does this actually benefit the code. Wouldn’t the code work exactly the same without it, as rbp can’t be accessed or chanced in c (without inline assembly) and pointers and variables are all offsets from rsp


HTML two forms and two submit on same page

<form id = "msform" action = "" method = "POST"> <input type = "text" name = "name" /> <input type = "submit" name = "submit1" value "Submit" /> </form> <form id = "msform" action = "" method = "POST"> <b>Name:</b> <?php echo $_POST['name']; ?>  <input type = "submit" name = "submit2" value "Launch" /> </form>   I am using two HTML forms, I want to display one form's data to other any one can guide me that how it is possible??


Using both a firewall and vpn on android

Is there a way to use both a firewall and a vpn app on android. I have tried allowing the vpn through the firewall but one invaraibly goes off when I start the other. Is there some way around this -- to establish two tunnels at the same time.


Rep requirements impeading content quality

I noticed when posting a question, a new user can't post images or more than 2 links in a question. While this is sensible as bad things could happen, this doesn't prevent somethingbad dot com slash bad stuff from happening.  The issue is that censorship feels limiting, especially to users who have registered but haven't participated actively yet. What if the question is a graphics question dealing with layers? I feel that the rep-system is quite limiting for lurkers who view a lot of content but don't necessarily contribute much themselves. I can understand limiting anons, as this would be too much to monitor, but I feel like registered users should be more trusted, especially if they have accounts on other stack exchanges.  The question: Should we trust users who have rep on other SE sites with more posting abilities?


When to prefer the -ing ending over "which" / "who" / "to" / "that" etc. and vice versa?

It seems to me that in many English sentences the -ing ending can replace words like which / that / who / to etc. Some examples:  "I prefer to study in the library." OR "I prefer studying in the library." "I saw the car again which hit me when I crossed the street. OR "I saw the car again hitting me when I crossed the street. "I thing the man who is wearing the hat is wanted." OR "I thing the man wearing the hat is wanted."  When to prefer the -ing ending and when not? Are there rules? Does it depend on the tense or is either more common in certain regions or the target audience (official/colloquial)? I am looking for general laws rather than for the best choise to those stupid example sentences. (Feel free to edit, especially the tags) Whether duplicate or not: The linked question is just about the to and the -ing ending. I am not sure if this applies also do which, who, that etc. Also the linked question and answered doesn't say anything about regions and target audiences.


Determine the following limit as x approaches 0: $\frac{\ln(1+x)}x$

$$\lim_{x\to 0} \frac{\ln(1+x)}x$$  The process I  want to take to solving this is by using the definition of the limit, but I am getting confused. ( without l'hopitals rule)   $$\lim_{h \to 0} \frac{f(x+h) - f(x)}h$$  $$\lim_{h \to 0} \frac{\frac{\ln (1+x+h)}{x+h} - \frac{\ln(1+x)}x}h$$  $$\lim_{h \to 0} \frac{x\ln(1+x+h) - (x+h)\ln (1+x)}{hx(x+h))}$$  At this point I get confused because I know the answer is $1$, but I am not getting this answer through simplification of my formula.


Especially when you are a new user your vote doesn't count (yet). I found myself voting on questions at the beginning but quickly lost motivation for it because it always went something like this: Post has X votes I vote Post has quickly X+1 votes Gets reverted to X votes in the next instant  Now there's at least a notification that your vote gets saved. But when it is already saved, why not show the vote all the time in the first place? In some places I have enough points that my votes do count but I still don't use it because I'm used to it not making any difference. If you change it to show the vote from the start, users are maybe more interactive with the voting system. Because if you look at the views of question and the upvotes of the answers, only a fraction of them actually casts a vote.


Order of special linear group $SL_2 (F)$

In ex. 1.2.3 on p.21 of Diamond's A first course in modular forms, I was trying to show that $$|SL_2(\mathbb{Z}/N \mathbb{Z})|=N^3 \prod_{p|N}(1-1/p^2).$$  First of all, I knew that If $F$ is a field with $q$ elements, then $|GL_2(F)|=(q^2-1)(q^2-q)$. If we consider the surjective homomorphism $\det : GL_2(F) \rightarrow F^*$ with kernel $SL_2(F)$, then we have $|SL_2(F)|=(q^2-1)(q^2-q)/(q-1)=q(q^2-1)=q^3-q$. Therefore if we replace $F$ by $\mathbb{Z}/N \mathbb{Z}$, we get $|SL_2(\mathbb{Z}/N \mathbb{Z})|= N^3-N$, but thats' not agree with the book, so what's wrong with me...? In fact, in the part (a) of the problem, it asks us show $|SL_2(\mathbb{Z}/p^e \mathbb{Z})|=p^{3e}(1-1/p^2)$ for $p$ prime (that's already doesn't agree with my conclusion...), and uses chinese remainder theorem to conclude.


Lightning QuickAction background color change

On Case object, i have a quick Action "Assign Case" which looks as follows markup looks like this <aura:component implements="force:lightningQuickAction,force:hasRecordId" controller="AssignCaseController">     <aura:attribute name="record" type="Object"/>     <aura:attribute name="caseRecord" type="Object"/>     <aura:attribute name="recordError" type="String"/>     <aura:attribute name="isSpinnerVisible" type="Boolean" default="false" access="private" />      <force:recordData recordId="{!v.recordId}" layoutType="FULL" targetRecord="{!v.record}" targetFields="{!v.caseRecord}" targetError="{!v.LDSErrors}"/>
         <aura:if isTrue="{!v.isSpinnerVisible}" >
                 <lightning:spinner variant="brand" alternativeText="Loading"/>
         </aura:if>

 {!$Label.c.PF_AssignCase_DisplayMsg}

                 <button onclick="{!c.runAssignmentRules}" class="slds-button slds-button_brand">Submit</button>

 </aura:component>  From the picture, you can see that background is slightly colored, and i want background to be totally white (the way it is for standard quick Actions). I cant seem to achieve that. For the div where we have
  I added a class
  In CSS for component, the class whitebackground has background color of "white" This only covers a portion of the component, as shown below-  Seems like one.app creates a wrapper around the component, which continues to stay grey and i cant seem to make it all white. Any suggestions?


Don't show the edit option when I can't really edit (mobile apps)

Currently in both  and  when viewing a post on a site where you don't have full edit privilege  (and not your own post) you can still see edit option in the actions menu:        So I choose it, invest time in editing the post, click "Submit".... and greeted with the dreaded "Account is not allowed to suggest edits" message: (and the edit is lost for good, no draft)        Can the "Edit" option be removed from the menu if I don't have edit privilege on the post, at least until suggested edit will be supported in the apps?


How does the buoyant force on a cube at the bottom of a tank of water manifest itself?

Let's say a 10N cube (in air, on Earth) rests flat on a scale at the bottom of a tank of water, and the scale reads 8N, so there is 2N of buoyant force on the cube.  How does the buoyant force manifest itself on the cube?  I assume the force is normal to the surface of the scale, but if there isn't any water under the cube, how does the water push up on the cube?


how do i add swap memory to already installed ubuntu?

I recently installed Ubuntu and in the process of completion i realized that i had not dedicated a swap memory during installation. How can i go about adding the swap memory without reinstalling Ubuntu.


How can I change format of number of section and subsection in the list of contents?

Please consider the following codes:  \documentclass{report} \begin{document} \tableofcontents \chapter{TEST} \section{Introduction} \subsection{Test subsection} \end{document}   I want to appear statements "1-1-" and "1-1-1-" instead of "1.1" and "1.1.1" in the list of contents. Can you help?


I just stumbled upon  - it is not programming related, it is not about browsers and the tags are all wrong - it is not a question for SO. I obviously hit Close and it shows as failed audit.   Please downvote it / remove it from audits. I also flagged it for moderators, but don't know how much that helps.


Why is $\infty \cdot 0$ not clearly equal to $0$?

I did a bit of math at school and it seems like an easy one - what am I missing?  $$n\times m = \underbrace{n+n+\cdots +n}_{m\text{ times}}$$  $$\quad n\times 0 = \underbrace{0 + 0 + \cdots+ 0}_{n\text{ times}} = 0$$  (i.e add $0$ to $0$ as many times as you like, result is $0$)  So I thought an infinite number of $0$'s cannot be anything but $0$? But someone claims different but couldn't offer a reasonable explanation why. Google results seemed a bit iffy on the subject - hopefully this question will change that.


Conditional probability, $E[E(X\mid Y)\mid Y,Z]=?$

I know that $E[E(X\mid Y,Z)\mid Y]=E(X\mid Y)$.  What if $E[E(X\mid Y)\mid Y,Z]=?$ It has any meaning?


I have this command  \newcommand{\pdfappendix}[1]{     \includegraphics[scale=0.6]{pdf/#1.pdf} }   It works well when I have 1 page pdf but is not including the other pages. Now I decided to change the command to take a second argument which is the number of pages and will repeat \includegraphics that number of times.  I want something similar to (the following is not latex code):  \newcommand{\pdfappendix}[2]{     for index=1 to #2     {        \includegraphics[scale=0.6]{pdf/#1index.pdf}     } }   Example: MyPDF.pdf has 4 pages. I will split it in 4 pdfs with 1 page each: MyPDF1.pdf, MyPDF2.pdf, MyPDF3.pdf, MyPDF4.pdf. The output of the command will be:  Then I will write the command: \pdfappendix{MyPDF}{4}  And it will output:  \includegraphics[scale=0.6]{pdf/MyPDF1.pdf} \includegraphics[scale=0.6]{pdf/MyPDF2.pdf} \includegraphics[scale=0.6]{pdf/MyPDF3.pdf} \includegraphics[scale=0.6]{pdf/MyPDF4.pdf}   Is it possible to do that?  PS: I don't want to use \includepdf because I have some problems with section headers.


Sometimes I'm looking for date-sensitive information and don't want to see results more than a certain age.  Is there a way to specify this in a Google search?


Combine 2 json objects into a single one in node.js

I have 2 json objects in node.js  x= { '20': { length: '2', payload: [ '11', '22' ] } }; y= { '23': { length: '2', payload: [ 'ef', 'ab' ] } };   I want to combine them such that they become;  z=  {     '20': { length: '2', payload: [ '11', '22' ] },     '23': { length: '2', payload: [ 'ef', 'ab' ] }, };   How can this be done in node.js?    EDIT: I found an easy answer myself. Cannot answer as question has been marked as duplicate.  Use underscore module.   var _under = require("underscore");  z= _under.extend(x, y);


some user inputs to assign values to the query.   $builder_name    = $_POST['name'];     $builder_city    = $_POST['city'];     $builder_address = $_POST['address'];     $builder_contact = $_POST['contact'];     $builder_fax     = $_POST['fax'];   i have this insert query in my script .  $query = "INSERT INTO builders SET builder_name='".$builder_name."', builder_city='".$builder_city."',builder_address='".$builder_address."',builder_phone='".$builder_contact."',builder_fax='".$builder_fax."',builder_logo='".$targetfile."'";      i want to secure it with prepare statement.so how can i ?


How do I switch between console mode and GUI in 17.10 and newer?

After upgrading to 17.10 like a true pioneer, I found the old CtrlAltF1 no longer switches between console mode and GUI, and a quick Google search brought up nothing useful. Was this feature removed entirely?


Add bibliography with usepackage{biblatex}+addbibresource+printbibliography: not working in Texmaker, working in ShareLatex

I wrote the code:  \documentclass{article} \usepackage[utf8]{inputenc} \usepackage{biblatex} \addbibresource{bibliografia.bib}  \title{\textbf{Template}} \date{\vspace{-10ex}}  \begin{document}  \maketitle  Ciao\cite{sun2016multi}  \printbibliography  \end{document}   and the file bibliografia.bib:  @article{sun2016multi,   title={A multi-technique reconfigurable electrochemical biosensor: enabling personal health monitoring in mobile devices},   author={Sun, Alexander and Venkatesh, AG and Hall, Drew A},   journal={IEEE transactions on biomedical circuits and systems},   volume={10},   number={5},   pages={945--954},   year={2016},   publisher={IEEE} }   It works in ShareLatex, but not works in Texmaker. How can I fix it?  Before compiling file.tex, I clicked on strumenti->biblatex.    Texmaker shows me the following error message:  Process started This is BibTeX, Version 0.99d (MiKTeX 2.9.6350 64-bit) The top-level auxiliary file: Es bibliografia.aux I found no \citation commands---while reading file Es bibliografia.aux I found no \bibdata command---while reading file Es bibliografia.aux I found no \bibstyle command---while reading file Es bibliografia.aux (There were 3 error messages)  Process exited with error(s)   Thank you for your time.


When does a flying creature knocked prone fall and how far?

I understand according to the rules for flying that  If a flying creature is knocked prone, has its speed reduced to 0, or is otherwise deprived of the ability to move, the creature falls, unless it has the ability to hover or it is being held aloft by magic, such as the fly spell.  However, my question is when the flying creature is given the prone status when does it begin to fall, and how far does it fall? an example is as follows: A 3rd level Battlemaster Fighter confirms a hit on a Harpy flying 30ft above the ground. The Battlemaster then expends a superiority die to use their trip attack, the harpy then fails its strength save and is knocked prone.


URLs in references run-offs (using bibitem)

I'm using the simple method of \bibitem  for my references, and am using the \url command to add links, however, there is only one URL that runs off the page when I view the PDF:    This is what I have in the .tex file:  ` \bibitem{} Guillermo Peón, S., \& Rodríguez Brindis, M. (2014). Analyzing the Exchange Rate Pass-through in Mexico: Evidence Post Inflation Targeting Implementation. Revista Ensayos Sobre Política Económica, 32(74), 18-35. Recuperado 13 de febrero, 2015 de  \url{http://www.elsevier.es/es-revista-ensayos-sobre-politica-economica-387-resumen-analizando-el-traspaso-del-tipo-90339576}   If someone knows how to fix this run-off, I would appreciate the feedback!!


Is it better to walk or run when there is rain?

When I was coming from school to my house, there was heavy rain. Then one of my friends said  "Don't simply walk, run fast". Then the question came to my mind: how should I go so as to avoid wetting: walk or run?


Finding the generating pattern in an integer sequence

I got a problem to find the generating pattern of the following integer sequence:  $$1,3,8,20,48,126,...$$  This page helped me in finding the pattern:   What I am interested in is, how to find the generating pattern of an arbitrary infinite integer sequence on my own? The sequence can be monotonous or alternating. Is there a way instead of guessing it?  By any means, correct me if I am using wrong terminology, English is not the language that my math professors teach on.


Can't get iptables working in VPS - state and conntrack not possible

I've been browsing and reading documentations all night and I can't figure out any solution...  I'm trying to get iptables working on my VPS (Debian 7).   But I can't get established connections answered. The "-m state --state" and also "-m conntrack --ctstate" both don't work. Both result in iptables: No chain/target/match by that name.  As far as I figured out, state has been outsourced from iptables and conntrack isn't installed on my system and isn't possible to be installed because I ain't got Kernel-Access to the network interfaces system. I tried to install it from scratch but both tries (from packages and from source) failed. I changed the system to Ubuntu 14.04 for try but it didn't work either.  Is there any workaround or anything else I can do? I'm regulary using PF with OpenBSD as Firewall, so I'm not very familiar with iptables.  Here are the rules I'm adding - have I maybe forgotten something?  iptalbes -F iptables -A OUTPUT -j ACCEPT iptables -A FORWARD -j DROP iptables -A INPUT -m conntrack --ctstate ESTABLISHED,RELATED -j ACCEPT iptables -A INPUT -i lo -j ACCEPT iptables -A INPUT -p icmp --icmp-type echo-reply -j ACCEPT iptables -A INPUT -p icmp --icmp-type destination-unreachable -j ACCEPT iptables -A INPUT -p icmp --icmp-type time-exceeded -j ACCEPT iptables -A INPUT -p icmp --icmp-type echo-request -j ACCEPT iptables -A INPUT -m tcp -p tcp --dport 22 -j ACCEPT iptables -A INPUT -m tcp -p tcp --dport 80 -j ACCEPT iptables -A INPUT -m tcp -p tcp --dport 21 -j ACCEPT iptables -A INPUT -j LOG iptables -A INPUT -j DROP   All rules beside the mentioned one are working well!  I found this question asked here before but there were no helpful answers or solutions.  I'm thankful for any help in advance :)


Different results with post-increment operator in for loop

In Javascript, I'm having trouble understanding why these two sets of code provide different results:  for (var i = 0, a = []; i++ < 9;) {a.push(i);}   After running this code, the variable a is the following: [1, 2, 3, 4, 5, 6, 7, 8, 9].  However, this code returns something else:  for (var i = 0, a = []; i < 9; i++) {a.push(i);}   Instead, the variable a is the following after running this code: [0, 1, 2, 3, 4, 5, 6, 7, 8]  So, the major question: Why is this the case?  Thanks for any answers that explain this difference.


Proving that $A+A \not\subset 2A $ using a particular definition for sum of sets

Let $X$ de a vector space and $A\subset X$. If we define $A+B :=\{a+b|a\in A, b\in B\}$ I am trying to show that    $$ \begin{equation} 2A \subsetneq A+A, \end{equation} $$  i.e., it might happen that $2A \neq A+A$. I was able to show that $2A \subset A+A$, but I am not able to come up with a counterexample to show that the converse is not necessarily true. If I assume $A+A\subset 2A$ and let $x\in(A+A)$, then by its definition we have $x=a_1 + a_2$ for some $a_1,a_2\in A$ I guess I could naively say that $a_1+a_2 = 2(a'_1+a'_2)$ where $a_i=a_i/2$ for $i=1,2$ and I guess $(a'_1+a'_2)$ might not be an element of $A$ in some concrete case but I am not able to come up with anything and I've spent more time than I would like to admit. Any suggestions?  Thank you.


What is meant by the stationary states in quantum mechanics?

This question came up as an exercise in my quantum text? I typically find these "word" questions quite difficult. I want to answer: "What is meant by the stationary states?" as concisely as possible. I would say something along the lines of " Normalizable/(sufficiently smooth) solutions to the time- independent Schrödinger equation". But perhaps there is a better answer ( perhaps more physical)... Any suggestions? Many thanks!


Windows 7 is taking too long to boot and to open profile

It's taking some minutes until my windows 7 load. Then it asks for my password. After I enter the password it takes 1 minute or more to load the basic and some more minutes to start everything.  This is my Startup Services and Programs    Is there something wrong with it? It wasn't so slow a while ago.  I have run some cleans on registry and files with CCleaner.  Is my profile corrupted or something like it? What should I do?  My config: Quad Core 2.0 GHz, 6 GB RAM, 3 GB Video


I had no problem until the few last days. My phone was full and I couldn't download anything. Then I deleted the majority of my pictures and some apps and tried to download these apps back. But the icon that pops up when it starts to download, that circle, keeps rotating forever and it doesn't download the app.  I can't also update any app, because the app badge show that I have 4 updates but when I go to the updates there are none. Any solution?


Generating shapefile containing UTM grid (graticule)?

I'm looking for a shapefile containing an 1000m or 2000m UTM grid ("graticule"). All I was about to find on the web is a 10000m UTM grid (here: ) and I am aware that a 1000m UTM grid for the whole world might be quite big.  That's why I'm now wondering if and how it would be possible to generate such a shapefile for a part of the world. I would prefer to use open source tools like gdal. Others output formats than a shapefile might be ok too.   Has anyone an idea?


Can't ask question on Arqade because I've asked too many recently

I've just recently posted a question on Arqade, and I was going to post another one about a separate topic, when I got a message that I've "asked 2 questions recently." The last time I asked another question anywhere on Stack Exchange before the one on Arqade was in November 21. Why am I being limited even though I have not asked multiple questions on Arqade recently?  This isn't a long-term ban, it is just for 2 days because it thinks I have posted too much too recently or something.


Is there any offline (.deb) installer for "Educational Desktop for Ubuntu"?  I am using Ubuntu 14.04 LTS amd64   I have some problem with internet connection. An offline installer would help me :D


How to fix error "Driver does not appear to support OpenGL"

I just installed Minecraft on my pc and I got 1.14.4 installed. Then when I clicked the play in the launcher it disappeared and came back saying   java.lang.IllegalStateException: GLFW error 65542: WGL: The driver does not appear to support OpenGL   By the way,  My processor is Pentium(R) Dual-Core CPU E5200 @ 2.50GHz 2.50GHz   When I went online to get an answer I told me to update but I don't know what generation my processor is. Can somebody please help me out there as well :)   My Display Adapter is Intel(R) G33/G31 Express Chipset Family (Microsoft Corporation - WDDM 1.0)  The error log is here  ---- Minecraft Crash Report ---- // I let you down. Sorry :(  Time: 27/12/19 10:59 AM Description: Initializing game  java.lang.IllegalStateException: GLFW error 65542: WGL: The driver does not appear to support OpenGL     at cuo.b(SourceFile:199)     at cuo$$Lambda$1435/19110518.invoke(Unknown Source)     at org.lwjgl.glfw.GLFWErrorCallbackI.callback(GLFWErrorCallbackI.java:36)     at org.lwjgl.system.JNI.invokePPPP(Native Method)     at org.lwjgl.glfw.GLFW.nglfwCreateWindow(GLFW.java:1714)     at org.lwjgl.glfw.GLFW.glfwCreateWindow(GLFW.java:1897)     at cuo.<init>(SourceFile:81)     at dnr.a(SourceFile:19)     at cyc.au(SourceFile:464)     at cyc.b(SourceFile:394)     at net.minecraft.client.main.Main.main(SourceFile:155)   A detailed walkthrough of the error, its code path and all known details is as follows: ---------------------------------------------------------------------------------------  -- Head -- Thread: Client thread Stacktrace:     at cuo.b(SourceFile:199)     at cuo$$Lambda$1435/19110518.invoke(Unknown Source)     at org.lwjgl.glfw.GLFWErrorCallbackI.callback(GLFWErrorCallbackI.java:36)     at org.lwjgl.system.JNI.invokePPPP(Native Method)     at org.lwjgl.glfw.GLFW.nglfwCreateWindow(GLFW.java:1714)     at org.lwjgl.glfw.GLFW.glfwCreateWindow(GLFW.java:1897)     at cuo.<init>(SourceFile:81)     at dnr.a(SourceFile:19)     at cyc.au(SourceFile:464)  -- Initialization -- Details: Stacktrace:     at cyc.b(SourceFile:394)     at net.minecraft.client.main.Main.main(SourceFile:155)  -- System Details -- Details:     Minecraft Version: 1.14.4     Minecraft Version ID: 1.14.4     Operating System: Windows 10 (x86) version 10.0     Java Version: 1.8.0_51, Oracle Corporation     Java VM Version: Java HotSpot(TM) Client VM (mixed mode), Oracle Corporation     Memory: 186042904 bytes (177 MB) / 385875968 bytes (368 MB) up to 838860800 bytes (800 MB)     CPUs: 2     JVM Flags: 9 total; -XX:HeapDumpPath=MojangTricksIntelDriversForPerformance_javaw.exe_minecraft.exe.heapdump -Xss1M -Xmx800M -XX:+UnlockExperimentalVMOptions -XX:+UseG1GC -XX:G1NewSizePercent=20 -XX:G1ReservePercent=20 -XX:MaxGCPauseMillis=50 -XX:G1HeapRegionSize=16M     Launched Version: 1.14.4     LWJGL: 3.2.2 build 10     OpenGL: NO CONTEXT     GL Caps:      Using VBOs: Yes     Is Modded: Probably not. Jar signature remains and client brand is untouched.     Type: Client (map_client.txt)     Resource Packs:      Current Language: ~~ERROR~~ NullPointerException: null     CPU: <unknown>   Can someone help me? Thanks :)


correlation between categorical variables

I remember that Pearson correlation works for continuous variables and also if one is continuous and the other a dummy. For the latter, it does not provide a correlation but provides a portion. What is the best approach, when we have 2 dummy variables. Would you suggest to calculate correlation for them or what is a good way to look at the relationship between 2 dichotomous variables. Ex: gender and religious status.


Load entire page with redirect response in Ajax POST request

My POST request handler can either return content that I load into a div or the browser is redirected.  When I use jQuery's .post(), in the case of a redirect, instead of the entire page redirecting, the content returned from the redirect is loaded into the div:  var request = $.post('/my-post-url/');  request.done(function(response) {   $('#my-div').empty();   $('#my-div').append(response); // In case of redirect, response has new page's contents });   To get around this, I use the code from :  request.done(function(response) {   if(xhr.responseURL != window.location.href.match(/(^[^#]*)/)[0])   {     location.href = xhr.responseURL;     return;   }    $('#my-div').empty();   $('#my-div').append(response); });   This works fine, but I end up doing two GET requests for the same content: the first one is done automatically by the time I get inside the done handler, and the second is when I set location.href.  Is there a way to either prevent this extra GET request and/or redirect the ENTIRE page on a redirect?


How to reset my password in ubuntu 14.04

I recently installed Ubuntu 14.04. I am not able to install any software because it is not accepting my password.  However I am able to log in to my account using the same password on my pc.


Why do we use different prepositions for Morning and Night

Usually we use     In the morning      At night   Both of them represent time but why do we use different prepositions?


Why is the space of surjective operators open?

Suppose $E$ and $F$ are given Banach spaces. Let $A$ be a continuous surjective map. Why is there a small ball around $A$ in the operator topology, such that all elements in this ball are surjective?


I have a function in a controller, and I receive the information for a form. I have this code: public Actionresult functionOne(string a, string b, string c = "foo" )  I tried to convert this to a class like public class bar {     public string a {get;set;}     public string b {get;set;}     public string c {get;set;} }  and receive them as a object  public Actionresult functionOne(bar b)  Also I tried to put the defaultvalue in 'c' but is not working, I tried this: public class bar {     public string a {get;set;}     public string b {get;set;}     [System.ComponentModel.DefaultValue("foo")]     public string c {get;set;} }  Nothing happened with that, I receive it as null also I tried public class bar {     public string a {get;set;}     public string b {get;set;}     public string c      {         get         {             return  c;         }         set         {             c="foo"; //I also tried with value         }     } }  What should I do to write this default value?


Copying data to USB flash drive throws "Write Protect Error"

I have a USB flash drive, which I made bootable for use as an anti virus disk. After formatting the drive, whenever I copy some files to it, it shows an error:     The disk cannot be written to because it is write protected. Please remove the write protection from the volume in drive \Device\Harddisk3\DR13.


How can I show $U^{\bot \bot}\subseteq \overline{U}$?

Let $H$ be a Hilbert space and $U$ a subspace. Let $U^{\bot}$ denote its orthogonal complement.   I had no trouble showing $\overline{U}\subseteq U^{\bot\bot}$. But now I'm stuck for $\supseteq$.     Please could someone help me finish this argument?   This is what I am trying to do:  Let $x \in U^{\bot \bot}$. The goal is to construct a sequence $u_n\in U$ such that $u_n \to x$.   Since $\overline{U} \subset U^{\bot \bot}$ either $x\in \overline{U}$ or $x \notin \overline{U}$. If $x \in \overline{U}$ then we're done. If $x \notin \overline{U}$ I don't know what I can do.


Searching Gmail for messages without a particular label

I need to find, in Gmail, a list of all my unread messages — which I can get via is:unread or label:unread or l:^u — which do not have the label "ZDNet."  In other words, my requirement is this:  I have 185 e-mails which are "unread" in my Inbox. I have 174 "unread" e-mails which are labeled "ZDNet." I need to find the 11 e-mails in my inbox that are not part of the group of 174.  How can I do this?


How Can i Convert Below mysql script to mysqli or pdo?

Anybody pls Convert My below php + mysql search script to php + mysqli or php + Pdo Statement... I don't Know How to do this... Pls help Me... Tnx In Advance...  my form script is    <title>search engine</title>   <form action = 'ss.php' method ='GET'> <input type = "text"  name = "q"> <input type = "submit" name = "submit" value = "search"     And My Search Engine Script is   <?php  $k = $_GET["q"]; $con = mysql_connect("localhost", "root", ""); mysql_select_db("x"); $terms=explode(" ",$k); $i=0; $set_limit = ("9"); $subi = ""; foreach ($terms as $each)   {     $i++;      if ($i == 1 )         $subi.= " title LIKE '%$each%' ";     else         $subi.= " AND title LIKE '%$each%' ";      }  $query = "select SQL_CALC_FOUND_ROWS * from table WHERE $subi order by   rand() limit $set_limit";  $qry = mysql_query("$query");  $row_object = mysql_query("Select Found_Rows() as rowcount"); $row_object = mysql_fetch_object($row_object); $actual_row_count = $row_object->rowcount; $result = $actual_row_count; ?>   Diplaying Results  <?php if ($result>0) {     while ($row = mysql_fetch_array($qry)){ $title=$row['title'];  $href=$row['href']; $img=$row['img']; echo "

$title
<a href=\"$href\" target=_blank

\n"; }   } else {     echo "Sorry No Items Found For " .$k; }    ?>


What does the term depth of field mean?    How is it determined and how can it be changed?  Is it related to the aperture?


Don't count empty pages in twoside+openright documents

I'm working on a document that's a 300-page (scr)report, originally set up for one-sided printing. I'm currently preparing a second version of it that I want to be printed two-sided, naturally with the parts and chapters opening right. Its contents and layout are (and have to be) identical to the ›source‹ document except for the footer layout.  All this has been hassle-free, except for one thing: the blank pages that are inserted to make sure that parts and chapters start on recto pages only. Natively, TeX will count these pages as it does non-blank ones -- but of course this throws off the correspondence between the two document's page numberings.  compare:  \documentclass[twoside=true,open=right,paper=A5]{scrreprt} \usepackage{blindtext} \begin{document} \Blinddocument \Blinddocument \Blinddocument \end{document}    and  \documentclass[twoside=false,open=any,paper=A5]{scrreprt} \usepackage{blindtext} \begin{document} \Blinddocument \Blinddocument \Blinddocument \end{document}    Is there an elegant way to take those empty pages out of the ›official‹ numbering (i.e. the one that's printed as opposed to TeX internal one)? Maybe by establishing two different sequences of page numbers? I can certainly think of a way to fiddle with the page counter whenever an implicit \cleardoublepage is invoked, but I guess that'll do more harm than good.  I do see the problem: what I want, effectively, is going to question the unambiguous correspondence between recto/verso and odd/even -- which I'm sure TeX would prefer to preserve...


Is it possible to have a character walk cycle interact with an object(s) like grass or foliage in blender?   Example from unreal engine:


Getting java.lang.ClassNotFoundException: Didn't find class "com.qualcomm.qti.Performance"

i got  E/BoostFramework: BoostFramework() : Exception_1 = java.lang.ClassNotFoundException: Didn't find class "com.qualcomm.qti.Performance" on path: DexPathList[[],nativeLibraryDirectories=[/system/lib, /vendor/lib, /system/vendor/lib]] this error after being this the system crash.    10-05 13:45:25.466 7639-7639/com.example.sanjay.samelikeviber E/BoostFramework: BoostFramework() : Exception_1 = java.lang.ClassNotFoundException: Didn't find class "com.qualcomm.qti.Performance" on path: DexPathList[[],nativeLibraryDirectories=[/system/lib, /vendor/lib, /system/vendor/lib]]     10-05 13:45:25.466 7639-7639/com.example.sanjay.samelikeviber V/BoostFramework: BoostFramework() : mPerf = null     10-05 13:45:25.700 7639-7639/com.example.sanjay.samelikeviber D/ViewRootImpl@32bfe65[Viber]: ViewPostImeInputStage processPointer 1     10-05 13:45:26.341 7639-7639/com.example.sanjay.samelikeviber D/AndroidRuntime: Shutting down VM                                                                                --------- beginning of crash   After being crash i got the error  FATAL EXCEPTION: main                                                                                Process: com.example.sanjay.samelikeviber, PID: 7639                                                                                java.lang.NullPointerException: Attempt to invoke virtual method 'java.lang.Class java.lang.Object.getClass()' on a null object reference                                                                                at android.support.v4.app.BackStackRecord.doAddOp(BackStackRecord.java:380)                                                                                at android.support.v4.app.BackStackRecord.add(BackStackRecord.java:375)                                                                                at android.support.v4.app.FragmentPagerAdapter.instantiateItem(FragmentPagerAdapter.java:103)


Whats causing this garbled text below my pages?

Hoping someone might have experienced this and know the culprit code. This keeps appearing below some pages intermittently. Only on logged in members.


How to count the number of foreign keys in a SQL database using java. I have been given a database and there are many tables inside that. I have to count the total number of foreign keys present inside id. I am executing the queries via Java.


How to prove that $\lim\limits_{(x,y) \to (0,0)} \frac{\left | x \right |^{\frac{3}{2}}y^{2}}{x^{4} + y^{2}} \rightarrow 0$

How can I prove that  $$\lim_{(x,y)\to (0,0)} \frac{\left | x \right |^{\frac{3}{2}}y^{2}}{x^{4} + y^{2}} \rightarrow 0\;?$$  Thanks!


What would you call someone who imposes on other people's generosity?

What would you call someone who isn't afraid to ask for money or any kind of favor or who misinterprets someone's generosity for a consistent resource for what they need?


I am getting the error Paragraph ended before \@citex was complete. with elsearticle class. I am trying to shorten references of type [1,2,3,4,5] to [1-5] using the cite package but I got the above error.  MWE:  \documentclass[5p,times]{elsarticle} \usepackage{ecrc} \volume{00} \firstpage{1} \journalname{UVW} \runauth{} \jid{procs} \jnltitlelogo{Procedia Computer Science} \usepackage{amssymb} \usepackage{amsthm} \usepackage[cmex10]{amsmath} \usepackage{epstopdf} \usepackage{graphicx} \newtheorem{defn}{Definition} \usepackage{caption,subfig} \usepackage{multirow} \usepackage{cite} \usepackage{footnote} \makesavenoteenv{tabular} \makesavenoteenv{table} \usepackage{eufrak} \makeatletter \newcommand{\removelatexerror}{\let\@latex@error\@gobble} \makeatother \newtheorem{lemma}{Lemma} \usepackage[figuresright]{rotating} %\usepackage{subfig} \graphicspath{{images/}} \usepackage{algpseudocode,algorithm,algorithmicx}  \newtheorem{assumption}{Assumption} \newcommand{\argmin}[1]{\underset{#1}{\operatorname{argmin}} } \begin{document}  \begin{frontmatter}   \dochead{}  \title{XYZ }% and   Application to Anomaly Detection }  % use optional labels to link authors explicitly to addresses: \author[label1]{Chandresh Kumar Maurya, Durga Toshniwal }  %\author[label1]{ }  \author[label2]{Gopalan Vijendran Venkoparao}  \address[label1]{Department of Computer Science \& Engineering, Indian       Institute of Technology, Roorkee-247667, Haridwar, U.K., India} % \address[label2]{Department of Computer Science \& Engineering, Indian %     Institute of Technology, Roorkee-247667, Haridwar, U.K., India}  \address[label2]{Research \& Technology Center, RBEI, Bangalore}   \begin{abstract} xyz \end{abstract} \begin{keyword} ABX \end{keyword} \end{frontmatter} \section{Introduction}  \cite{Shuo:2015,ckm2015,Akbani04applyingsupport,He2009,Chawla2002,Liu2006}. It   aims to   \bibliographystyle{elsarticle-num} \bibliography{./TKDE} \end{document}


How can I bake a pizza without an oven (or any other fancy stuff, so no suggesting of charcoal, sun oven, and so on).  Just using a plain heating element on the bottom, like a burner, what are the alternatives? What is better than a pizza on the frying pan?  Can I put a pizza stone on a burner, or would the direct heat crack it?


Safe to use 4.5v 300ma rated 'universal' ac/dc adapter with kids alarm clock that requires 5v 500ma?

Have a kids alarm clock that requires 5v 500ma for power supply option (but can also run on 3x AAA batteries). I have a universal adapter that can supply 4.5 or 6v (with the correct polarity) but it rated at 300ma max.  I've tried it and it seems to work fine.  I understand that I may run into problems with the alarm clock funtionality / etc and you can't be totally sure - but is it "safe"?  Do I risk things catching fire for example?  If this is unsafe at all I will go spend the money!


How to reverse a user input without using array or any library function(any function for reversing)?

Let me clear you first that I'm not a college student and this is not my home assignment. I am just curious to know the solution of this question which was once asked to me. I think this is a nice and tricky question which I feel worth sharing.The question was--  How do you input a string(said in general sense, independent of programming) from a user and print reverse of it in C/C++ without using array or any library function for reversing the user input?  I am unable to break-into this. Help please  Note: Members are marking it as a duplicate for  question. But All answers to this are either using library functions or using a pointer to char array(char *). None of them is allowed in my case. Please review  it once again


Proof: Let A and B be two n x n matrices such that their product is invertible. Prove that both A and B are invertible...

Let A and B be two n x n matrices such that their product is invertible. (1) Prove that both A and B  are invertible,and (2) give their respective inverses.   Please do this without assuming what I am proving and without using determinants. Thanks


Intuition of definition of degree of function $\deg(f)=\widetilde f(1)$

Definition. Let $f:(I,\mathring I)\to(S^1,1)$ be a continuous function, the degree of the function $f$ is defined by $$\deg(f)=\widetilde{f}(1)$$ where $\widetilde f$ is the unique lifting of $f$ with $\widetilde f(0)=0.$  $\widetilde f$ is such that $\exp\circ\widetilde f=f.$ Could someone please explain  what this definition means intuitively? I have a lot of exercises that involve this definition and I do not see any idea on how to solve them, perhaps with the intuition of this definition would help me. Thank you. I did read the answer of the question  in which the definition is different and got the idea.


Condition of an integer divisible by $3$

Prove that an integer $n$ is divisible by $3$ if and only the sum of it's digits is divisible by $3$. This how I proceeded  $n=\overline{a_1a_2...a_k}$ Now we get  $$n=a_1\cdot10^k+a_2\cdot10^{(k-1)}+....+a_k$$ Then I find no clue.


Does there exist a side-rational triangle of area $1$?

A side-rational triangle stands for a triangle with each side rational.   We know, by cosine theorem and computing the area of the triangle, we can get that each angle of the triangle is of rational $\sin$ and $\cos$. Then consider ant height of one side, we have  $$S=h(h\cot \alpha+h\cot \beta)/2$$ Then it suffices to show that  $$t-\frac{1}{t}+T-\frac{1}{T}\notin \mathbb{Q}^2\quad t,T\in \mathbb{Q}$$ But i am stuck on it.


Finding the pmf of a r.v. S ~ Poisson's multinomial distribution.

Notation   # categories $= c$. # trials $= t$. Side $i$ = $si$. Random vector $= S = \left[S_1\;S_2\;\ldots\;S_c\right]^T$. # occurrences of $si$ vector $= s = \left[s1\;s2\;\ldots\;sc\right]^T$. Probability of occurrence of $si$ vector $= p = \left[p_{s1}\;p_{s2}\;\ldots\;p_{sc}\right]^T$. $p_{s1} + p_{s2} + \cdots + p_{sc} = 1$. $s1 + s2 + \cdots + sc = t$. Pmf of $S = P\left[S = s\right]$.   Games   g1: An ideal 2 sided die is simulated using a standard die by assigning faces w/ dots 1 through 3 & 4 through 6 to $s1$ & $s2$, respectively. The 2 sided die is tossed 7 times & the # times $s1$ & $s2$ occur are recorded. g2: Same concept as in g1, accept faces w/ dots 1 through 3 have micro holes etched into them s.t. $p_{s2} = 18/30$. g3: Same concept as in g1, accept w/ the standard die, i.e., $p_{s1} = p_{s2} = \cdots = p_{s6} = 5/30$. g4: Same concept as in g2, accept w/ the standard die, i.e., $p_{s4} = p_{s5} = p_{s6} = 6/30$. g5: Same concept as in g2, accept the micro holes are filled w/ $0.07$ kg of a material, which evaporates @ $0.01$ kg/s upon being sprayed w/ an activator, s.t. $p_{s2} = 15/30$ for the 1st toss. Immediately after being sprayed, the outcomes of the tosses are measured every second. g6: Same concept as in g5, accept w/ the standard die, i.e., $p_{s4} = p_{s5} = p_{s6} = 5/30$ for the 1st toss.   Questions   q1: Find pmf & evaluate when $s = \left[2\;5\right]^T$. q2: q1. q3: Find pmf & evaluate when $s = \left[0\;2\;1\;1\;0\;3\right]^T$. q4: q3. q5: q1. q6: q3.   Answers   a1: $S$ ~ Binomial distribution.   $P\left[S = s\right] = t!\prod_{k = 1}^c \frac{p_{sk}^{sk}}{sk!} = 7!\prod_{k = 1}^2 \frac{(15/30)^{sk}}{sk!} = \frac{7!(15/30)^2(15/30)^5}{2!5!}$ $\Longrightarrow P\left[S = s\right] = 21/128$.  a2: $S$ ~ Binomial distribution.   $P\left[S = s\right] = t!\prod_{k = 1}^c \frac{p_{sk}^{sk}}{sk!} = 7!\prod_{k = 1}^2 \frac{p_{sk}^{sk}}{sk!} = \frac{7!(12/30)^2(18/30)^5}{2!5!}$ $\Longrightarrow P\left[S = s\right] = 20412/78125$.  a3: $S$ ~ Multinomial distribution.   $P\left[S = s\right] = t!\prod_{k = 1}^c \frac{p_{sk}^{sk}}{sk!} = 7!\prod_{k = 1}^6 \frac{(5/30)^{sk}}{sk!} = \frac{7!(5/30)^2(5/30)(5/30)(5/30)^3}{0!2!1!1!0!3!}$ $\Longrightarrow P\left[S = s\right] = 35/23328$.  a4: $S$ ~ Multinomial distribution.   $P\left[S = s\right] = t!\prod_{k = 1}^c \frac{p_{sk}^{sk}}{sk!} = 7!\prod_{k = 1}^6 \frac{p_{sk}^{sk}}{sk!} =  \frac{7!(4/30)^2(4/30)(6/30)(6/30)^3}{0!2!1!1!0!3!}$ $\Longrightarrow P\left[S = s\right] = 224/140625$.  a5: $S$ ~ Poisson's binomial distribution.   $P\left[\left[S_1\;S_2\right]^T = \left[s1\;s2\right]^T\right] = P\left[S_1 = s1, S_2 = s2\right] = P\left[S_1 = s1\right] = P\left[S_2 = s2\right]$. $p_{s1}$ & $p_{s2}$ are vectors now: $p_{s1} = \left[p_{s1_1}\;p_{s1_2}\;\ldots\;p_{s1_t}\right]^T, p_{s2} = \left[p_{s2_1}\;p_{s2_2}\;\ldots\;p_{s2_t}\right]^T$. $P\left[S = s\right] = \frac{1}{t + 1}\sum_{i = 0}^t \left\{\exp\left(\frac{-j2\pi i s}{t + 1}\right) \prod_{k = 1}^t \left\{p_{s2_k}\left(\exp\left(\frac{j2\pi i}{t + 1}\right) - 1\right) + 1\right\}\right\}$ $= \frac{1}{8}\sum_{i = 0}^7 \left\{\exp\left(\frac{-j5\pi i}{4}\right) \prod_{k = 1}^7 \left\{\left(\frac{0.5k + 14.5}{30}\right)\left(\exp\left(\frac{j\pi i}{4}\right) - 1\right) + 1\right\}\right\}$ $\Longrightarrow P\left[S_2 = 5\right] = 53529/250000$.  a6: $S$ ~ Poisson's multinomial distribution.   I understand this enough to write a q about it, but not enough to solve it.  was the only 1 on SE that was relatable but the answer was incorrect. PLEASE help me find the exact solution; not an approximation.


Why does my forest plot say a study's result is statistically significant when it's not?

A large amount of computing resources is required to compute exact probabilities for the Kruskal–Wallis test. Existing software only provides exact probabilities for sample sizes less than about 30 participants. These software programs rely on asymptotic approximation for larger sample sizes. Exact probability values for larger sample sizes are available. Spurrier (2003) published exact probability tables for samples as large as 45 participants.[7] Meyer and Seaman (2006) produced exact probability distributions for samples as large as 105 participants.[8]


I have a list that holds a few strings(names). For this example. It will hold:   TeSt1 TeSt2 TeSt3   And I'm trying to check if that list has one of those. And I'm doing this like this at the moment:  if (list.Contains(test2)) {  }   But I need it to be case insensitive.. But how can I do that? in an if statement.


How to download all files of a GitHub project with wget (in raw form)?

How to download all files of a GitHub project with wget?  All files should be downloaded in their raw form.  Already tried:  wget -P ~/ https://raw.githubusercontent.com/u/p/b/* wget -P ~/ https://raw.githubusercontent.com/u/p/b/{*} wget -P ~/ --accept-regex urlregex https://raw.githubusercontent.com/u/p/b/* wget -P ~/ --recursive https://raw.githubusercontent.com/u/p/b/   This is opposed to wget -P ~/ https://raw.githubusercontent.com/u/p/b/{file1,file2...}  u=user,p=project,b=branch.


Does a for-each loop differ from a regular for loop in the way it iterates through lists?

Consider an ArrayList<String> list for the following examples.  I'm curious about how a for-each loop works "behind the scenes".  A traditional for loop accesses elements of a list by their numerical index, like so:  for(int i = 0; i < list.size(); i++)   Does the for-each syntax access the elements of the list in an essentially different way?  Or is it just a shorthand version for the same thing?  For example, in the following loop, is there implicitly a variable created (like i above)?  If there is, does it have a name?  If not, are the elements of the list still accessed sequentially?  for(String item : list)


I was trying to use sudo apt-get update to update the packages on my system but I kept encountering an error   W: Failed to fetch http://repo.mongodb.org/apt/ubuntu/dists/trusty/mongodb-org/3.4/Release   Unable to find expected entry 'multiverse/binary-i386/Packages' in Release file (Wrong sources.list entry or malformed file) E: Some index files failed to download. They have been ignored, or old ones used instead. Error executing command, exiting   I looked everywhere, did whatever was suggested but nothing seems to work. I freshly created my source.list file but it was all in vain. Can anybody please suggest me something?  In my case not only a single line of sources.list if malformed but the entrie file is showing as malformed and I have already tried the methods suggested here  but it is not working..


Newton's third law and General relativity

Is Newton's third law valid at the General Relativity?  Newton's second law, the force exerted by body 2 on body 1 is: $$F_{12}$$ The force exerted by body 1 on body 2 is: $$F_{21}$$  According to Newton's third law, the force that body 2 exerts on body 1 is equal and opposite to the force that body 1 exerts on body 2: $$F_{12}=-F_{21}$$


How do you determine the latest SVN revision number rooted in a directory?

I would like to start tagging my deployed binaries with the latest SVN revision number.  However, because SVN is file-based and not directory/project-based, I need to scan through all the directory's and subdirectory's files in order to determine the highest revision number.  Using svn info on the root doesn't work (it just reports the version of that directory, not files in subdirectories):  I was wondering if there is a shortcut using the svn command to do this. Otherwise, can anyone suggest a simple script that is network-efficient (I would prefer if it didn't hit the remote server at all)?  I also understand that one alternative approach is to keep a version file with the svn:keywords. This works (I've used it on other projects), but I get tired of dealing with making sure the file is dirty and dealing with the inevitable merge conflicts.  Answer I see my problem lied with not doing a proper svn up before calling svn info in the root directory:  $ svn info Path: . ... Last Changed Author: fak Last Changed Rev: 713 Last Changed Date: 2008-08-29 00:40:53 +0300 (Fri, 29 Aug 2008)  $ svn up At revision 721.  $ svn info Path: . ... Revision: 721 Last Changed Author: reuben Last Changed Rev: 721 Last Changed Date: 2008-08-31 22:55:22 +0300 (Sun, 31 Aug 2008)


Wrap MethodBase.GetCurrentMethod() in a help method/property?

private string MethodName {    get    {       MethodBase m = MethodBase.GetCurrentMethod();       return String.Format("{0}.{1}", m.ReflectedType.Name, m.Name);    } }   I'd like to do something like this but of course now the call is made from a different method to the one I want to describe. Is there a simple way around this or an obvious alternative?


Why does my SELECT query not return null values?

I have the following SQL script: CREATE temporary table if not EXISTS the_values (  key SERIAL,  value INTEGER NULL  );  insert into the_values(value) values (null),(1),(null),(2),(3),(4),(5),(6),(10),(null),(null);  select *  from the_values  where value not in (1,2,3,4,5,6,10);   And I noticed that the query: select *  from the_values  where value not in (1,2,3,4,5,6,10);   Does not return the rows having value NULL, and that caught my attention. Therefore, I want to know why that happens. I am interested more about the technical aspect of this phenomenon rather that the obvious solution: select *  from the_values  where value not in (1,2,3,4,5,6,10)     or value IS NULL;


The square $$\sqrt 2+ \sqrt{3} \approx 3.14$$ Is this a coincidence or is their some mathemtical significance?


What is a word that means "a person or thing which is small yet capable of defeating big giants"?

What can I call a person or a thing that is very small yet capable of defeating big giants?  I need different words that can be connected closely to this meaning.  It can be related to success,war, or anything else.


Insert both characters if a dead key combination is not recognized (e.g. 'a → á, 'b → 'b)

When I use any variation of English, US international (with dead keys,altGr dead keys or alternative) on my Linux Mint machine I always encounter this behaviour. When I press one of these keys: ' " and then follow them with a 'non-accentable' character like a [ or a b no output comes out at all.    Whereas in Windows US-International it would print [ or b. If I wanted to type this I would have to escape each dead key with a space instead of with any 'non-accentable' character. This is annoying when programming (not really, but I trained with the Windows 'Qwerty International' on typing.io and switching back and forth between the systems is irritating).    Is there any way to change that so it works like in Windows?


Delete LVM partitions and install ubuntu?

How do I delete LVM partitions and start installing ubuntu from scratch?


.xsession-errors file is huge. How can I disable?

I have visited over 30 different forum questions about this very same issue but none of them have been able to point me in the right direction.  I don't care what is causing the issue. I don't care what the error messages say.  I want to completely disable this from happening.  I don't want to disable all logging on my system just this .xsession-errors file.  I have tried the /dev/null thing it doesn't work. I made it read-only, just creates a new file .xsession-errors.jkhbjhjh. I even commented out the file generation in /etc/X11/xsession.  I'm running an ecommerce webserver that will be decommissioned in less than 90 days. I just need to keep the sites up long enough to get them all moved over to my new system. This log file is filling up my HDD 2 to 3 times a week rendering my webstores inoperable.  Just to be clear, I'd like to know how to disable .xsession-errors logging. I'm running Ubuntu 9.10 with gnome. I know it's no longer supported but again, this server is being decommissioned in less than 90 days it shouldn't matter.


Can ANOVA be significant when none of the pairwise t-tests is?

Is it possible for one-way (with $N>2$ groups, or "levels") ANOVA to report a significant difference when none of the $N(N-1)/2$ pairwise t-tests does?   In  @whuber wrote:      It is well known that a global ANOVA F test can detect a difference of means even in cases where no individual [unadjusted pairwise] t-test of any of the pairs of means will yield a significant result.   so apparently it is possible, but I do not understand how. When does it happen and what the intuition behind such a case would be? Maybe somebody can provide a simple toy example of such a situation?  Some further remarks:   The opposite is clearly possible: overall ANOVA can be non-significant while some of the pairwise t-tests erroneously report significant differences (i.e. those would be false positives). My question is about standard, non-adjusted for multiple comparisons t-tests. If adjusted tests are used (like e.g. Tukey's HSD procedure), then it is possible that none of them turns out to be significant even though the overall ANOVA is. This is covered here in several questions, e.g.  and . Update. My question originally referred to the usual two-sample pairwise t-tests. However, as @whuber pointed out in the comments, in the ANOVA context, t-tests are usually understood as post hoc contrasts using the ANOVA estimate of the within-group variance, pooled across all groups (which is not what happens in a two-sample t-test). So there are actually two different versions of my question, and the answer to both of them turns out to be positive. See below.


Should a suspended account be able to mark a question as a favourite?

Even though I got banned suspended, I'm able to mark a question as a favorite. Is this functionally correct?


Let $X_{k}$ be i.i.d random variables with $E[X_{k}]=\mu$ and $Var(X_{k})=\sigma^{2}<\infty$ and let $\bar{X}=\frac{1}{n}\sum_{k=1}^{n}{X_{k}}$. Let $$S^{2}=\frac{1}{n-1}\sum_{k=1}^{n}{(X_{k}-\bar{X})^{2}}(n\geq 2)$$ be the sample variance. Does $S^{2}$ converges almost surely and what is (if it exists) its limit?


I have been using SE sites (mainly SO) on my desktop computer and on my Samsung S4 mini mobile phone for years. It works well on of both devices. Recently I got a Samsung Galaxy Tab S2 9.7, and the SE App looks like this on it:    There are 2 columns, which is not my favorite, but okay. But the text in each entry in the columns is wrapped much more often than necessary. It does not only look ugly, it's actually hard to read this way.  Please fix that: make the actual column width adapt to the available width. And if possible, make configurable whether 1 or 2 columns are shown.  BTW: OS is LineageOS 15.1, but this should not matter.


Definition of neighborhood and open set in topology

I am a Physics undergrad, and just started studying Topology. How do you define neighborhood and open set in Topology.Wikipedia gives a circular definition.   An  is defined as follows.      In topology, a set  is called an open set if it is a neighborhood of every point    While a  is defined as follows:     If $X$ is a topological space and $p$ is a point in $X$, a neighbourhood of $p$ is a subset $V$ of $X$, which includes an open set $U$ containing $p$   which itself contains the term open set.  How do you define it exactly?


I'm using the following commands to produce a header and footer on all of the pages of my homework assignment:  \usepackage{fancyhdr} \pagestyle{fancy} \lhead{Math 185 Spring 2014} \chead{Problem Set 3} \rhead{Jacob Kent} \renewcommand{\headrulewidth}{0.25pt} \renewcommand{\footrulewidth}{0.25pt}   How would I remove the header/footer from just the first page of my document? I want it to be on all of the other pages, just not the first one.


Glitch in Java's Collections.sort? First time it runs takes up to 50x as long as following times

(Apologies in advance for any community-hated mistakes, this is my first post.)    I noticed something odd when writing a program for a class; the program would measure the time difference between a merge sort algorithm that I wrote and the merge sort performed by the Sort function in the Java Collections.    While testing the timer for Collections.sort() with multiple trials, I had some very strange output. The first "run" takes a notably longer time than any of the runs following it.    This is true whether I run multiple instances of the Sort class, or call the same instance multiple times.  It is true whether I repeatedly call a shuffled list, ordered list, reverse ordered list, or mix them up.  I've tried it on different computers/OSs, same results.  Trying smaller Linked Lists sometimes makes the results seem to steadily halve for a few runs until they plateau.  I've been searching for a possible reason for why this might be happening but can't find anything.  Any thoughts?  I don't think it's an actual glitch so much as something I'm not taking into consideration, but even my professor had no idea what the reason might be.  I've put some sample results and my relevant code below.  JDK MergeSort of shuffled list:  609 milliseconds 386 milliseconds 432 milliseconds 436 milliseconds 435 milliseconds 443 milliseconds 437 milliseconds 436 milliseconds 437 milliseconds 435 milliseconds 440 milliseconds   JDK MergeSort of ordered list:   42 milliseconds 34 milliseconds 34 milliseconds 35 milliseconds 33 milliseconds 37 milliseconds 34 milliseconds 38 milliseconds 34 milliseconds 35 milliseconds 34 milliseconds   JDK MergeSort of reversed list:   2312 milliseconds 42 milliseconds 43 milliseconds 76 milliseconds 40 milliseconds 40 milliseconds 46 milliseconds 67 milliseconds 40 milliseconds 40 milliseconds 44 milliseconds   Here's the relevant code:  import java.util.LinkedList; import java.util.Random;  public class Sort {  LinkedList test1 = new LinkedList();  public void jdkMergeSort(LinkedList test1){     Collections.sort(test1); }//end jdkMergeSort  public void fillLists(){     for(int i=0; i<1000000; i++){         Random j = new Random();         int k = j.nextInt(100000000);         test1.add(k );     }//end for loop         }//end fillLists  public void shuffleLists(){     Collections.shuffle(test1); }//end makeUnsortedLists  public void sortLists(){     Collections.sort(test1); }//end makeSortedLists  public void reverseSortLists(){     Collections.sort(test1);     Collections.reverse(test1); }//end makeReverseSortedLists  public void jdkSortTimer(){     long start,end;      shuffleLists();     start = System.currentTimeMillis();     jdkMergeSort(test1);     end = System.currentTimeMillis();     System.out.println("JDK MergeSort of random list: " + (end-start) + " milliseconds");       sortLists();     start = System.currentTimeMillis();     jdkMergeSort(test1);     end = System.currentTimeMillis();     System.out.println("JDK MergeSort of sorted list: " + (end-start) + " milliseconds");               reverseSortLists();     start = System.currentTimeMillis();     jdkMergeSort(test1);     end = System.currentTimeMillis();      System.out.println("JDK MergeSort of reversed list: " + (end-start) + " milliseconds");           }//end jdkSortTimer }//end class


Should the word A or An be used for this statement?

I am trying to create a letter and before hand I need to know rather or not to use a or an for a specific sentence. I know that U is a vowel, but because of the way the sentence sounds I re-framed from using an and used a.     while also ensuring a unique style.    Should I use the statement above or should I use this:     while also ensuring an unique style.


Is it possible to take a contact form and embed it into a page.html.twig or node.html.twig file? Or is the form only accessible via its contact/machine_name link?


I am trying to rank in the SERP's for the query "t-slot aluminum" or "t slot aluminum". I was beginning to see some progress and peaked at a position of 15.2 on August 11. Since that date, my ranking has incrementally reduced. I saw the biggest drop on August 15.   I have done nothing significant to reduce this ranking. The only thing I changed was adding/removing a Facebook pixel. Over the last three weeks the pixel is no longer in the page's file.  Does anyone see what could potentially be wrong? I have no errors in Search Console.  Update:  This has actually happened to several queries for my site. I was looking on SEMrush today and saw there was a Google change seven days ago. This is where the majority of my page ranks dropped.   The message shows that it has to do with page reviews. My site does not have any product/service reviews because it is not applicable.  Why would this affect me so much?


I'd like to suggest that the content of deleted answers, which is visible to 10k+ users, be hidden from view by default. Often times you'll see a user edit their deleted answer and replace it with something like this:  <! -- Replacing answer with comment so Jon Skeet won't see my ignorance -->   To clarify, I'm not suggesting that the answer be removed from the page altogether, just collapsed (for lack of a better word). Not only will this clean up the interface, it will hide those shameful moments that we've all had from public view.  Here's an example:


I have string type value like "e2ddfa02610e48e983824b23ac955632". I need to add - in this code means convert in Guid.  EntityKey = "e2ddfa02610e48e983824b23ac955632"; Id = (Guid)paymentRecord.EntityKey;


Correct me if I'm wrong, but if you have a proton that is in superposition, you don't know where exactly it is; it is everywhere but with different probability. Couldn't you measure the gravity field it creates? And if you could, you would know where it is and it wouldn't be in superposition. I'm new to superposition but this keeps confusing me.