I got minor revision in the first round of review. The main concern of the reviewer was to add the details in methods section and some amendments in the text. I re-submitted the paper after incorporating these changes in the manuscript (I work in Biology field). But the status of the paper is showing  "under review" again. Does it mean the manuscript will go through peer review again? what are the chances of the paper being accepted? Please help..

What steps does a manuscript typically go through from submission to publication (or rejection) in a typical journal? How are these steps referred to, in particular by editorial systems, and how long do they each typically take?  Note that this question is about the typical situation and hence not about:   Journals with an atypical workflow, e.g. those that allow for an instantaneous reviewer–author interaction. Exceptional steps or rare occurrences such as withdrawal or .   This is a canonical question on this topic as per . Due to its nature, it is rather broad and not exemplary for a regular question on this site. Please feel free to improve this question.


Say I have the following Function  function FooController (){   this.foo = function () {     alert('foo');   } }  FooController.prototype.bar = function () {   alert('bar'); }   Is there a difference between these two syntaxes? Why would I use one over the other? Is there a performance hit?

What's the difference between  var A = function () {     this.x = function () {         //do something     }; };   and  var A = function () { }; A.prototype.x = function () {     //do something };


I have the following character string   test <- "Mr Flowerpower discusses the challenges for the flower economy\r\nSpeech given by the Head of the Bank   of Flowerland, Mr Yellow Flowerpower, at the Flowerland meeting\r\non 27 July 2089.\r\n     *    *    *\r\nI.         Introduction\r\nIt is a great day to talk to all these flower investors.  "   which is an input from a pdf text. My aim would be to extract everything up to the stars *    *    *.   Use gsub - match everything after the pattern of the stars an replace it by blank space   gsub("\\s\\s\\s\\s\\*\\s\\s\\s\\s\\*\\s\\s\\s\\s\\*.*","",test) [1] "Mr Flowerpower discusses the challenges for the flower economy\r\nSpeech given by the Head of the Bank   of Flowerland, Mr Yellow Flowerpower, at the Flowerland meeting\r\non 27 July 2089.\r"     Use str_extract: I would like to extract everything (.*) before the pattern:   str_extract(test, ".*\\s\\s\\s\\s\\*\\s\\s\\s\\s\\*\\s\\s\\s\\s\\*") [1] "\n   *    *    *"   However, the second option does not work. I think it does not work because . does not match "/n". However, what would be the right approach here to extract everything before the *    *    *  pattern? Thanks for your help!

For example, this regex  (.*)<FooBar>   will match:  abcde<FooBar>   But how do I get it to match across multiple lines?  abcde fghij<FooBar>


I have been experimenting with 2D Simplex noise for a mini-project and while I cannot say I understand the maths behind it, I begin to feel quite confident with how I can manipulate it to get different types of output.  While noise generation/algorithms/manipulation are quite easy to find, I am having trouble finding any good resources on the next step, i.e. placing 2D tiles based on the noise output (for the purpose of making some kind of 2D terrain).  I realize a crude and simple way would be to just loop through my array and place a tile on every coordinate where the noise value is above a certain point, but the output would look very rough, tiles would be overlapping each other, etc.  Does anyone have any good resources or information to share on this subject?  Thanks,

I am programming a tile based game and I have some basic tiles (grass, dirt, etc..), but I can't figure out how to make good random map generation, because when I do some really random selection, if the tile should be grass/dirt, I get this:    I understand why this is happening, but what I want is to create some random continuous areas of grass or dirt. Something that would make more sense, like this:


The following steps to rebuild TikZ's pgfmanual.pdf fail on Windows 7 64 bit using MikTex and bash shell:      1) cp -iar /c/opt/miktex_2.9/doc/generic/pgf  .   2) cd  pgf/version-for-luatex/en   3) Modify line 10 in both files pgfmanual-test.tex      and pgfmanual.tex so that it becomes:        \documentclass[letterpaper]{ltxdoc}    4) mkdir plots   5) make   6) The command "grep gnuplot *log" shows lines such as:       runsystem(gnuplot plots/pgf-x.gnuplot)...disabled.    7) Run gnuplot on each of the 8 files in plots/*gnuplot,      which results in 8 files plots/*table    8) make; make; make; make       The last make reports that there was nothing to do for 'all'.    However,   Page size continues to be A4 (rather than letter) Built document has only 1142 A4 pages (pre-built manual has 1165 A4 pages)   So question:  how to build the TikZ manual in letter size with all the information present?

I am attempting to finish my LaTeX project, and I can't seem to get the PDF to compile to the right size no matter what I do.  In my .cls file I have this set:  \paperheight 11in \paperwidth 8.5in   But no matter what I change it to, it compiles to about 8.25x11.7".  I can post my .cls files or anything else for that matter if someone knows hat I am doing  Here is my .cls file:  - I am using BakomaTex Word for my editor.  When I compile my PDF, I am still getting strange dimensions.  I really appreciate this, thank you.


I have deleted all of my cookies, cache is disabled, I don't have any saved passwords in chrome.  Yet I still have the dummy email username/password I used previously autofilling every single time I click to fill out log in/password info on any react app I make.   Does someone know how to get rid of this?  All I get is the option to click "Manage Passwords" which leads chrome to showing me I have no saved passwords!   It's really irritating.

How do you disable autocomplete in the major browsers for a specific input (or form field)?


I am planning to travel to Bali during the month of July. I have a driving license of India, but I don't have an International Driving Permit. Is it fine to drive a motorcycle in Bali with out it? What are the alternatives that I can look out for in this case?

When I first started travelling internationally about 20 years ago I was young and naive and bought an international driver's license for my trip to the United States.  Then I discovered that it was not at all needed. All that was needed was a licence from my own country with a photo. At that time photo licences were relatively new in Australia.  So my question is, is this the case everywhere or are there some countries which really do not permit foreigners to drive without an international licence?  (I don't need a full list of countries as an answer, just a yes or no with a couple of examples is fine)


So I was playing a game of LoL when it suddenly says that "Your team scored an Ace!" I have never seen an Ace before, is this new in 4.20?

Sometimes, during a League of Legends match, it happens to see on screen and heard a message that says a particular champion did an ace. But what does it mean?


So below we have the code from the first of my two files, titled Game (keep scrolling down to see the second file + the issue)   public class Game {     private static final int PLAYING=0;     private static final int RED_WINS=1;           private static final int BLACK_WINS=2;         private static final int DRAW=3;             private static final int RED=4;             private static final int BLACK=5;             private static final int EMPTY=6;         private static final int WALL=7;     private static int board[][];  public Game() {       int board[][]={{WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL},                 {WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL},                 {WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL},                 {WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL},                 {WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL},                 {WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL,EMPTY,WALL}};   } public  void draw() {     for(int r= 0; r< board.length; r++)         {              for(int c= 0; c<board[0].length; c++)                 {                     if(board[r][c]==WALL)                     {                         char Wall='|';                         board[r][c]=Wall;                     }                         if(board[r][c]==EMPTY)                     {                         char Empty=' ';                         board[r][c]=Empty;                     }                     if(board[r][c]==BLACK)                     {                         char Black='B';                         board[r][c]=BLACK;                     }                     if(board[r][c]==RED)                     {                         char Red='R';                         board[r][c]=RED;                     }                     System.out.print(board[r][c] + "");                 }                 System.out.print("\n");        } } }      And Below is the code from the second file, MainFile   import java.util.Scanner; public class MainFile {     public static void main(String[]args)     {         Game a=new Game();         a.draw();     } }      When I press compile, the output says Process completed and everything seems fine at first, but when I press run file I get the following runtimerror,could I know what I'm doing wrong and how can I fix it?   Exception in thread "main" java.lang.NullPointerException     at Game.draw(Game.java:28)     at MainFile.main(MainFile.java:7)

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


ISO C++ says...  Fred * p = new Fred();  // No need to check if p is null   No need to check p for null why is that so ?

I usually never see test for new in C++ and I was wondering why.  Foo *f = new Foo;  // f is assumed as allocated, why usually, nobody test the return of new?


I'm stumped by the following question. Can anyone help me out. Clearly the answer is l but I can't work out how to prove this  Suppose that $\{x_n\}$ is a sequence converging to a limit $l$. Define a new sequence $\{y_n\}$ by setting $y_n := x_{2n}$ for all $n \geq 1$. Determine the limit of $y_n$, giving a rigorous proof.  Thanks

I need some help understanding this proof:  Prove: If a sequence converges, then every subsequence converges to the same limit.  Proof:  Let $s_{n_k}$ denote a subsequence of $s_n$. Note that $n_k \geq k$ for all $k$. This easy to prove by induction: in fact, $n_1 \geq 1$ and $n_k \geq k$ implies $n_{k+1} > n_k \geq k$ and hence $n_{k+1} \geq k+1$.  Let $\lim s_n = s$ and let $\epsilon > 0$. There exists $N$ so that $n>N$ implies $|s_n - s| < \epsilon$. Now $k > N \implies n_k > N \implies |s_{n_k} - s| < \epsilon$.   Therefore: $\lim_{k \to \infty} s_{n_k} = s$.   What is the intuition that each subsequence will converge to the same limit I do not understand the induction that claims $n_k \geq k$


How can I get rid of fonts I'll never use, for locales I'll never need?  Ubuntu's Font Viewer comes with tons of fonts for every locale imaginable - Chinese, Korean, Japanese, Arabic, Urdu, a bunch of fonts called Kacst, some called Qran etc.  With all due respect for those folks, probably even they are only going to need ONE of those regional fonts on their machine, tops. As for the rest of the world, we'll be fine with Latin.  BleachBit cleans up unused localizations, but .  I don't care about the disk space, but these fonts pollute the font space and make selecting the fonts I really want a mess:

There are a lot of extra fonts that all seem to look alike and just annoy me in the drop down list. Is there anyway I can erase them from the system?


My receipe calls for 3 sheets of crushed graham cracker. I bought pre-crushed graham cracker. What is the cup measurement for 3 crushed sheets?

I have a recipe that calls for one cup of graham cracker crumbs.   How many crackers am I going to need to crush?  I'm having trouble finding an answer partly because different people consider a "cracker" to be of various sizes.  I would consider a cracker to be a full sized sheet like this:   ()  It would also be helpful to know what a cup of graham cracker crumbs weighs.   My box of crackers is 14.4oz.   I could estimate what portion of the box to use if I know how much a cup of crumbs weighs.


The number of solutions of the equation $a+2b=k$ is $\left\lfloor\frac{k}{2}\right\rfloor+1,$ where $a,b\in \mathbb{N}\cup\{0\}\mbox{ and fixed }k\in\mathbb{N}.$ More general what is the number of solutions of the equation $a_{1}+2a_{2}+3a_{3}+\ldots+(r-1)a_{r-1}+ra_{r}=k,$ where $a_{i}\in\mathbb{N}\cup\{0\}\quad 1\leq i\leq r \mbox{ and fixed }k\in\mathbb{N}?$

Suppose $n$ be a given positive integer. Then the Diophantine equation $x=n$ has only $1$ solution. Just by inspection, I found that the Diophantine equation $x+2y=n$ has $\left\lfloor \dfrac{n}{2}+1\right\rfloor$ non-negative solutions for $(x,y).$ Also, according to  the Diophantine equation $x+2y+3z=n$ has $\left\lfloor \dfrac{n^2}{12}+\dfrac{n}{2}+1 \right\rfloor$ non-negative solutions for $(x,y).$  Is there any closed form for the number of non-negative integer solutions for $(x_1,x_2,\cdots,x_k)$ of $$x_1+2x_2+3x_3+\cdots+kx_k=n$$ for a given $k\in\Bbb{N}$? How can I prove these formulas rigorously?  EDIT After a very tedious calculation I found that the equation $w+2x+3y+4z=n$ has  $\left\lfloor \dfrac{n^3}{144}+\dfrac{5n^2}{48}+\dfrac{(15+(-1)^n)n}{32}+1 \right\rfloor$ solutions. This solution completely agree with the approximation given by Rus May. However still I believe that we can do something more than this.


Here is my code:  \documentclass[a4paper,twoside]{book}  \usepackage[utf8]{inputenc}  \usepackage[titletoc]{appendix} \usepackage[english]{babel}  \usepackage{csquotes} \usepackage{lmodern}  \usepackage{comment} \usepackage{makeidx}  \usepackage{bm}  \usepackage[usenames,dvipsnames]{xcolor} \usepackage[protrusion=true,expansion=true]{microtype}  \usepackage{graphicx}  \DeclareGraphicsExtensions{.pdf} \usepackage[font=small,labelfont=bf]{caption}  \usepackage{wrapfig}  \usepackage{float}  \usepackage[bottom]{footmisc}  \usepackage{multirow} \usepackage[multidot]{grffile} \usepackage{subcaption}  \usepackage{geometry} \geometry{a4paper,top=2.5cm,bottom=2.5cm,left=2.5cm,right=2.5cm}  \usepackage{lipsum}  \usepackage[24hr]{datetime}  \usepackage{titlesec,titletoc} \usepackage{hyperref} \usepackage{amsmath}  \usepackage{amsfonts}   \graphicspath{{graphs_folder/}}  \usepackage[      backend=biber,       natbib=true,      style=numeric,      sorting=none  ]{biblatex}  \addbibresource{biblio.bib}   \begin{document}  Hello.I want to cite \cite{braitenberg2013anatomy} and   \cite{hebb2005organization}   \backmatter  \cleardoublepage   \printbibliography   \end{document}   I'm on Ubuntu 14.04, I'm using TexMaker 4.1 and I did what suggested   However:  when I try to run the compiler with PDFLaTeX option, I obtain  line 50: Empty bibliography line 1: There were undefined references line 1: Please (re)run Biber on the file:(biblatex) and rerun LaTeX afterwards    I think is important to tell you that when I run quick build it should go through the whole process and showing me the pdf. Instead, it ends with  Error:could not start the command   and doesn't show anything. The same message appears if I use the BibTeX option of the compiler.   If I open the pdf manually, I can't find the bibliography and the citations are like     [braitenberg2013anatomy] and [hebb2005organization]    while what I need is      [1] and [2]    (note that I need them to be sorted as they appear).  What is wrong with my code?  Thanks in advance.

I'm trying to switch from BibTeX to biber and ran into the problem that biber does not produce any output file. I noticed several questions about problems with biber e.g.,            ,                       But none of them helped me in my particular situation (which was actually just an old version of biber somewhere in the path of my OS). Since I also noticed that several questions regarding problems with biber were closed as too localized since the underlying problem was due to formatting of a bib resource or similar simple issues, I would rather like to ask for a general troubleshooting guideline for using biber (since I saw many hints like "check/delete the cache", "check versions of this and that" etc.).  What steps are to be taken and what things (in particular files) to be checked if biber does not produce an output file (and its output on the command line does not directly give you the advice what to do)?


I was trying to learn java and when I went through access specifiers I had a doubt. What is the difference between the default one if none is specified and the protected access specifier in java?

In Java, are there clear rules on when to use each of access modifiers, namely the default (package private), public, protected and private, while making class and interface and dealing with inheritance?


Why can't I use "with" instead of "to"?  For example: "Did you talk to Maria?" instead of "Did you talk with Maria?"

What are the differences between these two phrasal verbs and what are the best situations to use each?


I posted .  And wanted to provide a link to a comment. I can find a solution to provide a .   Apart from going to the user's profile and their activity, finding the comment and obtaining a link from there,  I there an easier way to a specific comment?

The increase in the character limit of comments has led them to become as important as the questions and answers that spawn them. On several occasions (especially on meta) I've found reason to want to link to a comment directly. I'd imagine something as simple as making the date / time stamp an anchored link which mimics the behavior of the question link.


I need Java 1.4.2 on a up-to-date Amazon Linux 2015.09 server. I've tried to install j2sdk-1_4_2_19-linux-ia64-rpm.bin. When I execute this file, I get an error message:  line 442: ./install.sfx.12314: cannot execute binary file   Maybe I'm doing this the wrong way. I downloaded the binary from Oracle, where I see that the most recent Linux (non Solaris) version is Java SE Development Kit 1.4.2_19:     Java SE Development Kit 1.4.2_19  31.69 MB    j2sdk-1_4_2_19-linux-ia64-rpm.bin Java SE Development Kit 1.4.2_19  32.64 MB    j2sdk-1_4_2_19-linux-ia64.bin   Uname -a shows this:  Linux 4.1.17-22.30.amzn1.x86_64 #1 SMP Fri Feb 5 23:44:22 UTC 2016 x86_64 x86_64 x86_64 GNU/Linux   I've tried both bin files, and both report the same error.   How can I install Java 1.4.2 on this machine?

I want to install Java JRE 1.4.2 or JDK 1.4.2 on a recent Amazon Linux server. The best option so far seems to install from source. However - where can I download this? I believe 1.4 is still from the Sun era, but I can't find it on the  site, and the sun site is gone.  has no 1.4 download afaik.   Where can I download Java 1.4.2 source code?   As the goal is to get the installation working, other options are welcome. I tried to install the bin file, but got an error: cannot execute binary file.


I need to validate an email pattern which starts with an alphabat and ends with @gmail.com. Following is my code.   public static boolean isValidEmail(String email)  {     String endPattern = "@gmail.com";      if(null == email){         return false;     }        if(email.length()<10){         return false;     }        if(!email.endsWith(endPattern)){         return false;     }     String[] strArr = email.split(endPattern);       String mailId = strArr[0];       if(!Character.isLetter((mailId.charAt(0)))){         return false;     }        return true;   }   Is there a better way to acheive this? A regex or a better code?

Over the years I have slowly developed a  that validates MOST email addresses correctly, assuming they don't use an IP address as the server part.  I use it in several PHP programs, and it works most of the time.  However, from time to time I get contacted by someone that is having trouble with a site that uses it, and I end up having to make some adjustment (most recently I realized that I wasn't allowing 4-character TLDs).  What is the best regular expression you have or have seen for validating emails?  I've seen several solutions that use functions that use several shorter expressions, but I'd rather have one long complex expression in a simple function instead of several short expression in a more complex function.


$$\sum_{0 \le k \le a}{a \choose k}{b \choose k} = {a+b \choose a}$$  Is there any way to prove it directly?  Using that $\displaystyle{a \choose k}=\frac{a!}{k!(a-k)!}$?

How can we prove that     $$\sum_{k=0}^{n}\binom{R}{k}\binom{M}{n-k}=\binom{R+M}{n}?$$   (Presumptive) Source: Theoretical Exercise 8, Ch 1, A First Course in Probability, 8th ed by Sheldon Ross.


Is there a definitive answer to the problem of free will as follows: How can free Will exist while physics laws tell us (as well as causality) that every state at any given time is the result of the previous states and governed by unchangeable physics laws of nature? I understand in the field of quantum mechanics, there exists uncertainty principle, but it, at best, results in unpredictable states and still does not give us a proof for freewill. Also, some scholars have pointed out “chaos theory” to address this problem and justify the co-existence of freewill and predetermined physics states, but I have seen some good criticisms on this reasoning as well. I am not sure if I am lost in these arguments or there is no definitive accepted answer yet. Thank you all

Libertarian freewill is the position that we have some measure of metaphysical freewill. Per this position, a free agent at a given point in time is able to  freely select a course of action among several possible courses of action, i.e. given the exact same set of initial conditions, a system with agency has more than one possible course of action. Libertarian freewill thus implies indeterminism.   This is in opposition to compatibilism, which defines freewill as the ability to act according to ones own motivations, but that physically speaking, there is still only one possible outcome for one given set of initial conditions. Based on this definition, freewill is compatible with determinism.   Per libertarian freewill, if I am at an intersection, I am free to turn either left or right, and this independently of my past history and my mental state at the time. However, even a libertarian would concede that if I am falling from the 20th floor of a high rise, I'm not free to go anywhere besides down. Whatever circumstance led up to the point where I fell off the building have put constraints on my freedom to move in whichever direction I want to.   This shows, that even for those that accept metaphysical freewill, they are still bound by the laws of physics in some situations, and they would need to define the boundary between those situations where the laws pf physics limit their freedom and the situations where they don't.     How do those who subscribe to metaphysical freewill define those boundaries?  Doesn't the fact that metaphysical freewill requires such a boundary between what is constrained by physics and what is not imply a form of dualism? Does metaphysical freewill necessarily imply dualism?


I'm getting a message that says I have unchecked and unsafe operations when I try to compile this binary search program. I looked at other posts on stackoverflow, but I couldn't figure out how to fix my code. Thanks!  public binarySearch() {     ArrayList<Integer> list = new ArrayList<Integer>();     for (int i=0;i<10;i++)     {         int rand = (int)(Math.random()*10);         list.add(rand);         System.out.print(list.get(i)+"\t");         if ((i+1)%10==0) System.out.println();     }        System.out.println("\n"+search(sort(list),0)); }  public ArrayList sort(ArrayList<Integer> listNum) {     for (int i=0;i<listNum.size()-1;i++)     {         int min=10000;         int index=0;         for (int j=i;j<listNum.size();j++)             if (listNum.get(j)<min)              {                 min=listNum.get(j);                 index=j;             }         int temp = listNum.get(i);         listNum.set(i,listNum.get(index));         listNum.set(index,temp);     }     return listNum; }     public boolean search(ArrayList<Integer> listNum, int num) {     //need to sort list     int low = 0;     int high = listNum.size()-1;     while (low<=high)     {         int mid = (low+high)/2;         int midValue = listNum.get(mid);         if (num<midValue)             high = mid-1;         if (num>midValue)             low = mid+1;         if (num==midValue)             return true;     }     return false; }  public static void main (String args[]) {     binarySearch app = new binarySearch(); }

For example:  javac Foo.java Note: Foo.java uses unchecked or unsafe operations. Note: Recompile with -Xlint:unchecked for details.


I have just installed ubuntu 16 along with window 7 and also new for ubuntu. I have downloaded some software with .zip, .tar and .exe format which are in downloads folder. Kindly suggest me how to install them from command line.

I have downloaded tar.gz files. But I don't know how to install it. How do I install this kind of file?


I have recently installed Ubuntu 14.04 alongside with Windows 7 which was previously installed. After log-in into Ubuntu, it freezes totally (no keyboard nor mouse interaction). This happens all the time and it gets faster when I try to install a new app. Any help?

All operating systems freeze sometimes, and Ubuntu is no exception. What should I do to regain control when...   just one program stops responding? nothing at all responds to mouse clicks or key presses? the mouse stops moving entirely? I have an    In what order should I try various solutions before deciding to pull the power plug?  What should I do when starting up Ubuntu fails?  Is there a diagnostic procedure I can follow?


The boot files of [The OS now in use - Ubuntu 16.04.6 LTS] are far from the start of the disk. Your BIOS may not detect them. You may want to retry after creating a /boot partition (EXT4, >200MB, start of the disk). This can be performed via tools such as gParted. Then select this partition via the [Separate /boot partition:] option of [Boot Repair]. (  I got that message after using boot repair. My issue is that on powering up my pc and selecting "windows 10 loader" it boots ubuntu.

I installed Windows on my computer, followed by an installation of Ubuntu. However, now I'm unable to boot into my Windows install.  What can I do to fix this?


How to calculate the integral $\int\limits_0^{\pi} \ln(1-2\alpha\cos{x}+\alpha^2) dx$ by Fourier Series? I have $\dfrac{q\sin{x}}{1-2q\cos{x}+q^2}=\sum\limits_{n=0}^{\infty} q^n\sin{nx} (q<1)$ now, I tried term wise integration but I cannot figure it out.   The answer is $0$ if $|\alpha|\leqslant 1$, $2\pi\ln|\alpha|$ if $|\alpha|<1$.

For $a\ge 0$ let's define $$I(a)=\int_{0}^{\pi}\ln\left(1-2a\cos x+a^2\right)dx.$$ Find explicit formula for $I(a)$.   My attempt: Let  $$\begin{align*} f_n(x) &= \frac{\ln\left(1-2 \left(a+\frac{1}{n}\right)\cos x+\left(a+\frac{1}{n}\right)^2\right)-\ln\left(1-2a\cos x+a^2\right)}{\frac{1}{n}}\\ &=\frac{\ln\left(\displaystyle\frac{1-2 \left(a+\frac{1}{n}\right)\cos x+\left(a+\frac{1}{n}\right)^2}{1-2a\cos x+a^2}\right)}{\frac{1}{n}}\\ &=\frac{\ln\left(1+\dfrac{1}{n}\left(\displaystyle\frac{2a-2\cos x+\frac{1}{n}}{1-2a\cos x+a^2}\right)\right)}{\frac{1}{n}}. \end{align*}$$ Now it is easy to see that $f_n(x) \to \frac{2a-2\cos x}{1-2a\cos x+a^2}$ as $n \to \infty$. $|f_n(x)|\le \frac{2a+2}{(1-a)^2}$ RHS is integrable so $\lim_{n\to\infty}\int_0^\pi f_n(x)dx = \int_0^\pi \frac{2a-2\cos x}{1-2a\cos x+a^2} dx=I'(a)$. But  $$\int_0^\pi \frac{2a-2\cos x}{1-2a\cos x+a^2}=\int_0^\pi\left(1-\frac{(1-a)^2}{1-2a\cos x+a^2}\right)dx.$$ Consider $$\int_0^\pi\frac{dx}{1-2a\cos x+a^2}=\int_0^\infty\frac{\frac{dy}{1+t^2}}{1-2a\frac{1-t^2}{1+t^2}+a^2}=\int_0^\infty\frac{dt}{1+t^2-2a(1-t^2)+a^2(1+t^2)}=\int_0^\infty\frac{dt}{(1-a)^2+\left((1+a)t\right)^2}\stackrel{(*)}{=}\frac{1}{(1-a)^2}\int_0^\infty\frac{dt}{1+\left(\frac{1+a}{1-a}t\right)^2}=\frac{1}{(1-a)(1+a)}\int_0^\infty\frac{du}{1+u^2}=\frac{1}{(1-a)(1+a)}\frac{\pi}{2}.$$ So $$I'(a)=\frac{\pi}{2}\left(2-\frac{1-a}{1+a}\right)\Rightarrow I(a)=\frac{\pi}{2}\left(3a-2\ln\left(a+1\right)\right).$$  It looks too easy, is there any crucial lack?  $(*)$ — we have to check $a=1$ here by hand and actually consider $[0,1), (1,\infty)$ but result on these two intervals may differ only by constant - it may be important but in my opinion not crucial for this proof.


I was wondering whether it is possible to highlight the contour of the characters with tex like in the following picture:    Or like in Allen Hatcher's 'Algebraic Topology':   Any idea is will be very useful. Thank you very much!

How could I produce characters which are outlined when the character itself is in some color. A picture to illustrate what I'm after:   The problems with the above are that:   the outline is of no consistent width around the letter. the way I've done it (using tikz with a upscaled black node below the colored one), there is no easy way to control the width of the outline.   Do you know of a way to accomplish this with TeX? I am using plain-format with XeTeX, but I'm interested in all ways to accomplish this.


I meet the problem in Hungerford's Algebra, page 282 as follows:  If $n>2$, then the polynomial $x^{2^n}+x+1$ is reducible over $Z_2$ .  I have no any idea on this. But I really want to know how to prove this.  Thanks!

Prove that each irreducible factor of $f(x)=x^{2^n}+x+1$ in $\mathbb Z_2[x]$ has degree $k$, where $k\mid 2n$.   Edit. I know I should somehow relate the question to an extension of $\mathbb Z_2$ of degree $2n$, say $GF(2^{2n})$. By this way I will be able to correspond each irreducible factor of $f(x)$ to a subfield of $GF(2^{2n})$ that obviously has degree $k$, where $k\mid 2n$.


I have a text file :  20160906000001     // header with dateTime = 20160906 and code = 000001 name0100000152255  // body with name = name01 and reference = 00000152255 name0200000152256  // body with name = name02 and reference = 00000152256 name0300000152257  // body with name = name03 and reference = 00000152257   and class :  public class file {     public header header { get; set; }      public List<body> body { get; set; } }  public class header {     public string dateTime { get; set; }      public string code { get; set; } }  public class body {     public string name { get; set; }      public string reference { get; set; } }   I want to create a instance of my class file from the text file :    property datetime in header have always 8 chars property code in header have always 6 chars property name in body have always 6 chars property reference in body have always 11 chars   What is the best way to do this?

I've got a text file full of records where each field in each record is a fixed width.  My first approach would be to parse each record simply using string.Substring().  Is there a better way?   For example, the format could be described as:  <Field1(8)><Field2(16)><Field3(12)>   And an example file with two records could look like:  SomeData0000000000123456SomeMoreData Data2   0000000000555555MoreData       I just want to make sure I'm not overlooking a more elegant way than Substring().    Update:  I ultimately went with a regex like Killersponge suggested:  private readonly Regex reLot = new Regex(REGEX_LOT, RegexOptions.Compiled); const string REGEX_LOT = "^(?<Field1>.{6})" +                         "(?<Field2>.{16})" +                         "(?<Field3>.{12})";   I then use the following to access the fields:  Match match = reLot.Match(record); string field1 = match.Groups["Field1"].Value;


I am trying to create File drop automation when the file will get drop on client FTP and automation will import that data into Data Extension.  As of now client FTP credential is yet to come, so I made my laptop as a FTP server(one of the folder in my laptop named "FTP_Folder"). After that I added a file location in which I specified Location Type:External FTP site, url:, username, port no:21 and password.  I select File Drop as entry source and can see only two folder as Import and Triggered. Unable to see FTP folder, please suggest.

Setting up an automation to occur on file drop but it appears the only options for directory choice are in the import folder or the legacy triggered automations folder.    The file that I'm dropping is actually dropping to a different business unit's FTP (the parent).  Is there any way to select a different FTP directory for the File drop starting source?


The answer is  $$\lim_{n \to \infty} \frac{n\ln(n)}{\ln(n!)}=1$$ but I have no idea how to solve it. I tried to apply the L'hospitals rule since top and bottom tend to infinity, but $$\frac{d}{dn}\log(n!)=\frac{1}{n}+\frac{1}{n-1}...$$  and I don't know if that helps or not. Thanks for any hints/answers.  UPDATE: Thank you all for the answers, I am currently working through them to see if I understand it. I don't know why you all have been downvoted. It wasn't me!

I can't seem to find a good way to solve this.  I tried using L'Hopitals, but the derivative of $\log(n!)$ is really ugly. I know that the answer is 1, but I do not know why the answer is one.  Any simple way to go about this?


I was poking around my performance settings tabs and clicked on one that showed users. It has the single account that was set up (as Admin) and a Default user account.  I am curious to know why it is there. Does it serve some purpose?

I'm a linux user and don't really know all that much about Windows stuff. I'm changing the default \Users directory and I see that there's a Default user profile at \User\Default that's a hidden link or something. What's the point of this?


package teeeeeee; public class Hah {     public static void main(String[] args) {                     int  x = 0;                 while (x == 0){                     int[][] array = {{0,0,0},{0,0,0},{0,0,0}};                 array = fillMatrix();                   if (sumRows(array)&& sumColumns(array)&& sumDiagonals(array)){                 System.out.println("you have a magic square");                 x = 1;              }                 else                     System.out.println("not a magic square");                  }             }              public static int[][] fillMatrix(){                  int[][] array = new int [] []                 {                         { 2 , 7 , 6 },                         { 9 , 5 , 1 },                         { 4 , 3 , 8 }                 };                 for (int i = 0; i < array.length; ++i){                     System.out.println(array[i]);                 }                 return array;             }              public static boolean sumRows(int [][] array){                 for (int r = 0; r < 3; r++){                     int sum = 0;                     for (int c = 0; c < 3; c++)                         sum += array[r][c];                     if (sum != 15)                         return false;             }             return true;             }              public static boolean sumColumns(int [][] array){                 for (int c = 0; c < 3; c++){                     int sum = 0;                     for (int r = 0; r < 3; r++)                         sum += array[r][c];                     if (sum != 15)                         return false;             }                 return true;             }             public static boolean sumDiagonals(int [][] array){                  if (array[0][0] + array[1][1] + array[2][2] != 15)                     return false;                  if (array[0][2] + array[1][1] + array[2][0] != 15)                     return false;                  return true;             }     }   how do i print out this array without it being random numbers and letters i have tried many ways but every time it just come out in the randomness and not the array i want it to print any help would be nice. the array i want to rint is in the method fill matrix.

In Java, arrays don't override toString(), so if you try to print one directly, you get the className + '@' + the hex of the  of the array, as defined by Object.toString():  int[] intArray = new int[] {1, 2, 3, 4, 5}; System.out.println(intArray);     // prints something like '[I@3343c8b3'   But usually, we'd actually want something more like [1, 2, 3, 4, 5]. What's the simplest way of doing that? Here are some example inputs and outputs:  // Array of primitives: int[] intArray = new int[] {1, 2, 3, 4, 5}; //output: [1, 2, 3, 4, 5]  // Array of object references: String[] strArray = new String[] {"John", "Mary", "Bob"}; //output: [John, Mary, Bob]


Let the Hamiltonian $H$ be invariant under the symmetry $U$ such that: $$U H U^\dagger = H \, .$$ Consider a bias of ground states $\{\left|GS,n\right>\}$. It is often said that if $\left|GS,n\right>$ are not invariant under the symmetry $U$ then the system chooses one of these and hence spontaneous breaks the symmetry (e.g. ferromagnets and the Higgs).   But why do we emphasis a specific bias and which basis do we emphasis in general? Would it not be possible to write a basis consisting of a superposition of the states $\{\left|GS,n\right>\}$ which is invariant under the symmetry - would this not be a natural choice?

The simplest account of spontaneous symmetry breaking goes like this.   Take a potential $V(\phi)$ with symmetric minima that are not at $\phi = 0$, like the Mexican hat potential shown in this site's logo. Since variations in the field cost energy due to the $(\partial_\mu \phi)^2$ term, minimum energy configurations have constant $\phi$. Therefore, the lowest energy states have $\phi$ equal to one of the minima of $V(\phi)$. Thus we have symmetry breaking, because the vacuum state (whichever one we choose) does not have the symmetry that $V$ had. In the quantum case, everything works the same, except the classical solution $\phi = c$ becomes $\langle \phi \rangle = c$. Then we have multiple vacuum states, each of which break the symmetry.   I'm suspicious about the last assertion. Suppose $V$ has two mimima, giving two degenerate vacuum states, $|+\rangle$ and $|-\rangle$.  Quantum mechanics allows superposition, so can we not take $(|+\rangle + |-\rangle)/\sqrt{2}$ as our vacuum? This state does not break the symmetry at all.


Is there a non-empty subset of $\mathbb{R} $ like $A$ such that the set of accumulation points of $A$ is $A$ and $A\cap\mathbb{Q}=\emptyset\,$?

Give an example of a perfect set in $\mathbb R^n$ that does not contain any of the rationals.  (Or prove that it does not exist).


I have a very basic understanding of heat and noise, but I was wondering if the oscillations of particles when hot can generate noise at extreme temperatures. It sounds crazy, but you never know.

In other words, given a magical room with walls that produce no vibration and transmit zero vibration from the outside, and nothing on the inside except room temperature air, what would be the noise level in dB SPL () from the  of the air itself?  (Similar to the  of electronics being determined by  in the conductors.)  What is the quietest possible anechoic chamber?  What is the noise floor of air?  For reference: Sound pressure is defined as the root-mean-square value of the instantaneous pressure, measured in pascal = N/m².  SPL is the same number, but expressed in decibels relative to 20 µPa.  (I assume that it has a white spectrum, but I could be wrong.  Thermal noise in electronics is white, but other types of electronic noise are pink, and blackbody thermal radiation has a bandpass spectrum.)   in the context of underwater acoustics.  Not sure how this applies to air:     Mellen (1952) developed a theoretical model for thermal noise based on classical statistical mechanics, reasoning that the average energy per degree of freedom is kT (where k is Boltzmann’s constant and T is absolute temperature). The number of degrees of freedom is equal to the number of compressional modes, yielding an expression for the plane-wave pressure owing to thermal noise in water. For non-directional hydrophones and typical ocean temperatures, the background level due to thermal noise is given by:      NL = −15 + 20 log f (in dB re 1 µPa)      where f is given in kHz with f >> 1, and NL is the noise level in a 1 Hz band. Note that thermal noise . There are few measurements in the high-frequency band to suggest deviations from the predicted levels.    Citation is R. H. Mellen, The Thermal-Noise Limit in the Detection of Underwater Acoustic Signals, J. Acoust. Soc. Am. 24, 478-480 (1952).


Why do some commands like   \titlespacing*{\section}{0pt}{5.5mm plus 1mm minus .2mm}{4.3mm plus .2mm}  have this strange adding and subtracting for length. I.e. why not write 6.3mm instead of 5.5+1-.2?  The prototype for this command is \titlespacing*{<command>}{<left>}{<before-sep>}{<after-sep>}  So the numbers clearly represent spaces.  Thanks so much!

I had a question about dynamic vspaces () and there was a hint I should use a stretchable glue. Searching with Google didn't give me a helpful answer.  I would be glad, if someone can explain it and give me a simple example to understand how it works.


I just got the Solstice Winterbash hat here on Meta Stack Exchange. Checking my activity, I have not posted or commented yesterday (the 21st). I do, however, have an upvoted comment today. That comment was posted on the 22nd in UTC.  I'm happy to have gotten Solstice here, but it wasn't really deserved. Is this a bug, or is Stack Exchange being generous?

During Winter Bash, users can earn hats. But sometimes it seems that a hat was awarded even though its requirements weren't (yet) met, or vice versa.  What could be the reason for this?


If I have an article that was already accepted and presented in a conference, and I would like to present it as an extended article to a journal, I was wondering two things:   How much paraphrasing should I use in my journal article? How much "new" material should be added to the journal article?   I have found some articles in my field of Computer Science in which the quantity of added material from the original article was too scarce; and that the paraphrasing was also mostly nonexistent. It just looked like if they have added some parts only to make it to the journal. Or is it that in an extended article should I put what it was missing from the original one, i.e., limitations of space because of restrictions imposed by the conference regarding article's length.  By the way, I am considering the situation in which I submit to a journal not related to conference in which my article was previously submitted.

I have been approached to submit an extended version of a research paper in a journal. The original paper is already published in a conference proceedings by publisher A.   What "degree of extension" do I have to provide so that publisher B will (legally?) be able to publish my work?  Also, does "extended version" in this case mean additional results, or purely textual extension?


I've recently bought a new laptop with 8GB of RAM in it. It has 4 slots inside so I want to put the RAM from my old laptop in it as well. However, they have different frequencies. So if I put the old RAM in there as well, would it have any adverse effects on the system?

I have two PC3200U modules and two PC2700 DDR modules. My mainboard supports both types and has 4 slots which are each color coded. So if I put each pair in the slots of the same color I'm good right? Would there be a performance increase if I used the exact same RAM modules like 4x PC3200 or 4x PC2700?


I have used custom code. I want to remove duplicate value using distinct, how can I do this? My code is like this.  $media_query = db_select('node','n');     $media_query->innerJoin('field_data_field_media_room_type','mtype','mtype.entity_id = n.nid');     $media_query->fields('n',array('nid'));     $media_query->fields('mtype',array('field_media_room_type_tid'));     $media_query->condition('n.type','media_room_page','=');     $media_query->condition('mtype.field_media_room_type_tid',$media_id,'=');     $media_res = $media_query->execute();            while($media_fetch = $media_res->fetchObject()){      $media_year = '';         if(isset($media_node->field_year['und'][0]) && $media_node->field_year['und'][0] !=''){             $media_year = $media_node->field_year['und'][0]['value'];         }       echo'<pre>';print_r($media_year);     }   Output like this:  2011  2011   2011   2011   2011   2011   2012   2012   2013   I want to remove duplicate values so how can I remove it?

I'm trying to create a query like this:  SELECT DISTINCT ON (field1, field2) field1, field2, field3 FROM table1   But can't figure out how to get DISTINCT ON narrowed down to a few fields in Drupal like that. Calling $query->distinct() just seems to structure the query like this:  SELECT DISTINCT field1, field2, field3 FROM table1   I did figure out a hacky way to add what I want by adding an expression before I add any fields like this:  $query->addExpression('DISTINCT ON (field1, field2) field1', 'field1');   Which creates:  SELECT DISTINCT ON (field1, field2) field1 as field1, field2, field3 FROM table1   I'm looking for a better way to this ?


In the sentence 'John weighed the letter', the letter is the direct object of the predicate weighed. In the sentence 'The letter was blue', blue is a predicative nominal.  In the sentence 'The letter weighed 2 oz.', what function does 2 oz. have?   I wouldn't say it is a predicative nominal, because weighed is not a linking verb. I wouldn't say it is a direct object, because weighed, here, is used in a detransitivized  verb: this sentence has a different structure than 'John weighed the letter'.     This problem arises, in my view, because weighs appears in the middle voice here. Hence my question: what is the name for the 'object' of a middle voice?  Examples were taken from R.C. Benton, 2009: , p. 162.

In this sentence:     This book cost me 20 dollars.   Is 20 dollars a direct object or a predicative complement?


I would like to make a frame, with a piece of text, then the appearance of a picture and after that another line of text appearing. I am using the code below, but if I click for the picture to appear, the first line of text jumps to a higher position in the slide. How to resolve this?  \subsection{} \begin{frame}{Title} \begin{itemize} \item<1-> Text \begin{figure}[h!] \centering \includegraphics<2->[]{file.pdf} \end{figure} \item<3-> Text \small \begin{eqnarray} \nonumber *formula* \end{eqnarray} \end{itemize} \end{frame}

Sometimes I want an element on a frame to change in steps. I do this by  \only<2>{   ...   }   \only<3>{   ...   }     etc.  But this causes the frame to jump due to different sizes of the included content. How can this be avoided?


I'm on Kubuntu 16.04, all packages up to date.  Yesterday, out of the blue (not after a reboot or anything), my WiFi stopped working. The hardware is still working, I am able to connect over Ethernet, and all the local WiFi networks are listed in the NetworkManager widget. But when I try to connect to my WiFi network, it says "Configuring interface...", asks for a password, stalls for a moment, asks again, and so on, over and over again, never connecting.   I have already rebooted many times, installed all updates, and tried deleting and adding the connection, marking the connection as "Available to all users", and disabling kwallet.  EDIT: Here's the output of lspci -knn | grep Net -A3:  02:00.0 Network controller [0280]: Intel Corporation Centrino Wireless-N 2230 [8086:0887] (rev c4)     Subsystem: Intel Corporation Centrino Wireless-N 2230 BGN [8086:4062]     Kernel driver in use: iwlwifi     Kernel modules: iwlwifi   The fix from , suggested by user68186, works for me (I'm able to connect to WiFi, thank you!).  So here's my updated question: is there a way for me to make WiFi work without disabling 802.11n speeds?

The Problem  My WiFi network disconnects itself randomly and starts asking for password. The password is already stored, I just have to click on connect. When I click on connect, it remains connected for some time then again disconnects and sometimes it even does not connects. The speed while being connected is very low and torrents are not downloading. When I sometimes connect to WiFi I get System encountered a error dialogue box  What did I do  I go to Edit connections and make sure that All users can connect is ticked. I also deleted config file of connection from /etc/NetworkManager/system-conncections  I still can't connect to WiFi sometimes and it disconnects automatically if I'm ablee to get connected after some time. So what should I do? After googling I found that this problem has been encountered in earlier versions, I'm using Ubuntu 16.04 so if there is a permanent solution which can help everyone that will be the best. P.S.- I have already tried these links:     .  Also the WiFi network works fine with my mobile.If more information is needed than let me know and how I can find it. Also after seeing this  i found that no card was soft or hard blocked and rest info I found after using commands are on  Output of lspci -knn | grep Net -A2  02:00.0 Network controller [0280]: Intel Corporation Centrino Wireless-N 130 [8086:0896] (rev 34) Subsystem: Intel Corporation Centrino Wireless-N 130 BGN [8086:5005]   Kernel driver in use: iwlwifi  New Update: I can't connect to my WiFi network, I have to use USB tethering in mobile to use internet on my laptop.


you can see how applying the difference modifier only results in merging the object into the other object.  I tried doing the thing in  but it didnt help.

I'm trying to model an , but it's not going so well when it comes to the magazine of the weapon.   Next to the magazine is a mesh. I want to cut holes in the mag with that mesh. But the magazine just goes invisible or connects with the mesh when trying to execute the Boolean Modifier. I have tested to invert the normals and some other stuff, but it isn't working.


For SQL Server Enterprise's Always On availability groups in Synchronous Commit mode, is there some amount of latency that can't be exceeded?  For example, can it work between very distant data centers, such as between the US and Europe?

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


Harouni of course became familiar with this   ubiquitous man, who not only accompanied him on   his tours of inspection, but morning and night could   be found standing on the master bed rewiring the   light fixture or in the bathroom poking at the water   heater. Finally, one evening at teatime, gauging the   psychological moment, Nawab asked if he might say   a word. The landowner, who was cheerfully filing his   nails in front of a crackling rosewood fire, told him   to go ahead.      “Sir, as you know, your lands stretch from here to   the Indus, and on these lands are fully seventeen tube   wells, and to tend these seventeen tube wells there is   but one man, me, your servant. In your service I have   earned these gray hairs”—here he bowed his head to   show the gray—“and now I cannot fulfill my duties   as I should. Enough, sir, enough. I beg you, forgive   me my weakness. Better a darkened house and proud   hunger within than disgrace in the light of day.   Release me, I ask you, I beg you.”      The old man, well accustomed to these sorts of   speeches, though not usually this florid, filed away at   his nails and waited for the breeze to stop.   “What’s the matter, Nawabdin?”   This excerpt from the SAT practice test is questioned. It asks for the purpose of the second paragraph. The choices are as follows:  A) flatter Harouni by mentioning how vast his lands are. B) boast to Harouni about how competent and reliable Nawab is. C) emphasize Nawab’s diligence and loyalty to Harouni. D) notify Harouni that Nawab intends to quit his job tending the tube wells.   The answer is C. But, why is it not D. Can anyone please explain? Thank you for your help

Concerned paragraph:  [Background: a master and his servant (a water tubewell technician) have been living happily for several years. The master owns seven farms spread across a large river. The master "became familiar with this ubiquitous man, who not only accompanied him on his tours of inspection, but morning and night could be found standing on the master bed rewiring the light fixture or in the bathroom poking at the water heater". Now, on this one day, the servant has hesitatingly said this to his master]  [i've redacted the proper nouns for these people's names with "the master" and "the servant" to avoid confusion]     “Sir, as you know, your lands stretch from here to the Indus, and on these lands are fully seventeen tube wells, and to tend these seventeen tube wells there is but one man, me, your servant. In your service I have earned these gray hairs”—here he bowed his head to show the gray—“and now I cannot fulfill my duties as I should. Enough, sir, enough. I beg you, forgive me my weakness. Better a darkened house and proud hunger within than disgrace in the light of day. Release me, I ask you, I beg you.”   Question asked related to this quote     The servant's comments primarily serve to:    flatter the master by mentioning how vast his lands are. boast to the master about how competent and reliable the servant is. emphasize the servant's diligence and loyalty to his master. notify the master that the servant intends to quit his job tending the tube wells.     My question:  Notice the lines of the paragraph: "now I cannot fulfill my duties as I should" and "Release me". Don't they clearly indicate that the servant intends to quit his job? Hence, option 4 should clearly be correct.  However, option 3 has been given as correct by KhanAcademy, saying that option 4 is incorrect because "The servant doesn’t say he intends to quit his job, asking instead only for help doing it"  So, my question is:     Isn't the above a clear example of misinterpretation of the paragraph by KA?     All options with KhanAcademy's explanations - for reference   Even though it initially highlights the vastness of the master’s lands, it primarily focuses on the servant’s dedication and service to the master. This emphasizes not that the servant is competent and reliable but that the servant feels he is no longer able to adequately fulfill his duties. The main purpose of the servant’s comments is to highlight the labor and service he has provided for the master over the years. the servant says “there is but one man, me, your servant” to take care of the tube wells on all the master’s vast lands and that the extensive work has resulted in the servant earning gray hairs on his employer’s behalf. The servant doesn’t say he intends to quit his job, asking instead only for help doing it.


What are some pros and cons of each? I use a Nikon D600 and am looking for my 50mm. I shoot a lot of video, so a smooth manual control is important to me. Besides that, I am unsure of what exactly I want. Are there any significant performance differences? Any differences in the way you would use them? Weight? Thanks so much!

Recently, Nikon announced their , as revamp of the old 50mm f/1.8D. :     The main difference between this new   "nifty fifty" and the almost   decade-old ƒ1.8D is that it has an   autofocus motor inside. This means you   can use it with any current or recent   Nikon SLR. The older lens lacks this   motor and is instead driven by one in   the camera, which cheaper bodies don't   have.   I currently use a Nikon D80 (and I don't plan on changing that any time soon), and I've been considering getting such a lens. Is there any difference between the D and the G lenses when used on a D80? I believe that the D one works just as well, since D80's have internal autofocus motors - is that right?  Besides the autofocus motor aspect, is there any other big difference between them? Since the D is priced at around $120 and the G at $220, should I just get the D?


I wanted to have a 3D desktop on my Windows XP, and I did try some applications out of which BumpTop and Real Desktop are very good, but there were some issues in their usage/behavior that I had to uninstall them.  So then I thought I can put a 3D looking 2D wallpaper on my desktop and arrange icons manually. This works great (I always wanted to have a cupboard/container on a corner of desktop), but now the problem is when a new file is downloaded/copied to the desktop it will place it randomly. Thus I have to look here and there every time I download a new file.  So is there any solution to fix some certain items on that left side container and provide a fixed area for new downloads etc, or just auto arrange only the new items on the desktop?  I have no experience with graphics programming or tools, but I am willing to do so if it solves the cause.

I want to organize my Windows desktop icons by categories. Multimedia, system tools, editors, etc. I need to define rectangular areas of the desktop, then place the shortcut icons. They would stay locked into place forever in the category until I moved them. The standard windows desktop won't do this, and folders aren't going to do what I want either.   How can I set this up on my desktop on Windows?


I have a problem with a method that generates numbers that do not repeat. Everything goes fine, but I would never want to get a result like: 1,2,3,4 or 4,3,2,1 . The idea is not to receive the numbers in ascending order or in descending order.  Below is the method implemented if someone can help me. Thank you!  public static List<int> GenerateNumbers(int mn, int mx) {     List<int> source = new List<int>();     for (int i = mn; i <= mx; i++)         source.Add(i);     List<int> randomNumbers = new List<int>();     while (source.Count != 0)     {         int randomIndex = UnityEngine.Random.Range(0, source.Count - 1);         randomNumbers.Add(source[randomIndex]);         source.RemoveAt(randomIndex);     }     return randomNumbers; }  public static bool IsSorted(List<int> arr) {     for(int i=0;i<arr.Count - 1; i++)     {         if (arr[i] < arr[i + 1])             return true;         else             return false;     }     return true; }

What is the best way to randomize the order of a generic list in C#? I've got a finite set of 75 numbers in a list I would like to assign a random order to, in order to draw them for a lottery type application.


SE mobile app shows wrong tag points whereas mobile and desktop site shows correct points.  SE app for android      Javascript tag have 79 points (wrong)  SE site      Javascript tag have 92 points (correct and Full site also produce the same)  Update :  I tried clearing cache, but no use.  I installed this app 3 or 4 days but I am holding 92 points in Javascript for more than a week.

I checked yesterday and today the new homepage in the Android app. Very surprised I saw that I would almost reach a silver tag badge, that confused be because I always take a look on possible badges I can get. However I compared the score with the website and I got a total different results. See this two screenshots:


My understanding of focal length is that it is the distance from the lens to the sensor; in my observations: higher focal lengths make for longer lens.  Then I started thinking about how a lens focuses. If my previous notion of focal length was true, how does focus work? Does the lens move in or out to focus? Doesn't that also change the focal length? What about in a prime lens?  When I rotate the zoom ring I can clearly see the inner lenses moving back and forth. Also, there is a clear start and stop point where I can't rotate the ring any further.  When I rotate the focus ring I can't notice the lenses moving at all unless it's just so tiny that it's hard to see. Also, I can rotate my focus ring endlessly; although, it doesn't seem to have an effect past certain points. Let's say I go 1 turn past focus on my subject, it takes 1 turn to get back in focus. If I go 30 turns past focus, it still only takes 1 turn back to get back in focus. So if focus if the focus ring only actually does something within a certain range, why does the design let you turn it endlessly?  Thanks.

I have a canon 700d. I have seen other 700d's, and when they focus the lens automatically moves in and out. My one doesn't. Why would that be?


I’m searching for a word (a noun, ideally) that means someone who manages to make a little go a long way, or who manages to do a remarkable job given very little resources.    Specifically, I am envisioning someone who is teetering on poverty but can still put together a feast on short notice, or who can make a fancy dress out of rags, etc.  If the word exists, it may actually be a loanword to English from immigrant and diaspora communities, but if so I’m not aware of it.  Sample sentence:     Camille was on a fixed income, and a small one at that, but she was a ????, and with a keen eye for things no one else wanted and an ingenuity for making the most of very little, she sewed herself stunning dresses and once a month managed to throw a banquet for her friends and neighbors.   (Not a great sentence, but conveys the sense of the word I’d want.)

Is there a word (or words) for a person who uses all resources to the maximum; for example, a person who keeps on using pencils even if they are very small?


I have a question about for loop in js, here are examples:  In this part, child is object (what I want).  for (var i = 0; i < element.childNodes.length; i++) {         var child = element.childNodes[i];         console.log(typeof(child)); }   But when change the code, child become to String, valued 0, 1, 2 ...  for (var child in element.childNodes) {         console.log(typeof(child)); }   Why the two types of for loop got different results? Thanks..

I've been told not to use for...in with arrays in JavaScript. Why not?


How to prove that $a^{x}\leq b^{y}$ for any cardinal number a,b, $x,y$ with a$\leq$b , $x\leq y$?  First, I want to show that $p^r\leq\ q^r$ and $r^p\leq\ r^q$ for any cardinal number $p,q,r$ with $p\leq q$.  If $P,Q,R$ are sets such that $cardP=p, cardQ=q, cardR=r,$ it is easy to show that $p^r\leq\ q^r$ because $P$ is equipotent with some subset of $Q$  But I don't know how to show that $r^p\leq\ r^q$  Could anyone help me?


Is carrying a passport mandatory, to travel from Germany to Czech Republic and back for a non-European citizen? The persons have with them a valid Blaue Karte with them issued by Germany which they intend to carry.  If it is important, the persons in question are Indian citizens whose passports are currently not with them though they will be getting them back after a few days. The intended mode of travel is Deutsche Bahn and Flixbus.

I am currently located in the Netherlands and have lived here for 4 years. I have a working visa for the Netherlands and would like to go on vacation to another country in Europe. I however do currently not have my passport as i sent it to an embassy for a visa application. Will I still be able to travel inside of Europe without a passport if I have my residency ID?  I have a resident permit, not a true Dutch ID. And I own a passport that is currently in transit.  I have called with the KLM and the service employee's conclusion was that I do need to carry my passport with me when i am going to fly, so it seems all I can do is wait and hope my passport is returned to me in the next few days as the amsterdam US consulate (who currently holds my passport) is incredibly difficult to contact for urgent matters.


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

I have a Page that contains two views one that list the latest news and the other list the latest event  The problem now is that each view has a pager but when I change the page of one of them both view will change. i.e If I want to see page number 3 in news view,the event view will also change to page number 3  Is there is a way to make that even programmatically also I don't want to make it ajax because I need to share the url  Thanks


I'm using Python 2.7 on Windows and I need a way to calculate how much free space is left on the disk, as well as total disk space if possible. I know in Python 3 there's shutil.disk_usage, and I've tried replicating that code in 2.7, but to no avail. Unfortunately, os.statvfs doesn't work on Windows (not in 2.7 anyway). Using another version of Python isn't an option, I'm afraid. Any way to make this work?

I need a way to determine the space remaining on a disk volume using python on linux, Windows and OS X. I'm currently parsing the output of the various system calls (df, dir) to accomplish this - is there a better way?


I have written some software which outputs .tex files and uses a custom .cls file. I have a makefile for this software but I don't know what to do with the .cls file.  Is ~/texmf/tex/latex/ the only location to store these files? I would prefer not to be creating directories in the users home directory. When I install other .cls files what location are they installed in? I can't find this information anywhere.

I know that I can check from where one particular package would be called, using  kpsewhich <packagename>.sty   and that if I want a custom package, I usually have to put it in the same folder as my document.   I assume that similar to a $PATH, LaTeX checks a list of paths in an attempt to find my package.   Which paths are those? In what order are they checked? If this is system-specific, how can I find out the configuration for my system?   Related questions:    , the answers to which contain some paths that  LaTeX apparently checks.  mentions    >    /usr/local/texlive/2009/texmf >    /usr/local/texlive/2009/texmf-dist >    /usr/local/texlive/texmf-local > > as well as other directories.   (Neither of those lists is complete).


In "The Crimes of Grindelwald" it answers :  NEWT: But you were supposed to have been Obliviated! JACOB: I know! NEWT: So . . . But . . . JACOB: It didn’t work, pal. I mean, you said it, the potion only erases bad memories. I didn’t have any. I mean, don’t get me wrong, I had some weird ones. But this angel . . . this angel over here, she filled me in on all the bad parts, and here we are, I guess, huh?  But why did Jacob seemingly forget Queenie until they were reintroduced? If it's completely true that the potion only erases bad memories, why would he be confused at the end of the first Fantastic Beasts? He should have immediately remembered Queenie?

At the end of Fantastic Beasts and Where to Find Them,      Newt send up the  with the short-term memory eraser.   After they do that,      Jacob Kowalski goes out into the rain to forget what happened.   But then      Queenie goes out and conjures up an umbrella, in addition to the fact that he was under cover for most of the time.   Then Jacob goes and wanders off, bumping into Newt along the way.  But when     Queenie goes into his new bakery, he appears to recognize her.   This is in addition to that     His confections are magical-beasts shaped.   This would imply that he still remembers things.  So, the question is:  Did Jacob not lose all of his memories? If he did, what happened at the end with Queenie?


I'm having some trouble showing these two equal each other. I was doing some research and apparently this is not always true in a topological sense but I think that's out of the scope of this class.  $(A \cup B)' = A' \cup B'$  $A'$ is the set of all derived points of A.

I'm trying to prove $(A \cup B)' = A' \cup B'$ where $S'$ denotes the derived set of some subset $S$ of a topological space $X$.  A derived set $S'$ of a set $S$ is the set of $x \in X$ such that $x$ is in the closure of $S-\{x\}$.  I'm having troubling showing that $(A \cup B)' \subseteq A' \cup B'$.   What I've done so far: Suppose $x \in (A \cup B)'$.  Then for any neighborhood $U$ of $x$ it follows that $U$ intersects $(A \cup B)-\{x\}$ so $U$ intersects $A-\{x\}$ or $B-\{x\}$.  But I don't see why we couldn't have one neighborhood of $x$, $U_{1}$, which intersects $A-\{x\}$ but not $B-\{x\}$ and another neighborhood $U_{2}$ which does the opposite.  In this case $x$ would be in neither $A'$ nor $B'$.  We can say that $U_{1} \cap U_{2}$ is not only $\{x\}$ because then $\{x\}$ would be open contradicting $x \in (A \cup B)'$.


What's the number of significant digits for error bars? For example, the Particle Data Group lists the ,  $$938.2720813 \pm 0.000058$$  Should I take $0.000058$ as having 2 significant digits or 10, the same as that for $938.2720813$?

On , $N_A = 6.022\;141\;29 \times 10^{23} \text{ mol}^{-1}$ has 9 significant figures and a standard uncertainty of $0.000\;000\;27 \times 10^{23} \text{ mol}^{-1}$.  First, can it be written as the following?  $$ N_A = 6.022\;141\;29 \times 10^{23} \pm 0.000\;000\;27 \times 10^{23} \text{ mol}^{-1} $$ If yes, consider the following quote from  (emphasis added):     Whenever you make a measurement, the number of meaningful digits that you write down implies the error in the measurement. For example if you say that the length of an object is 0.428 m, you imply an uncertainty of about 0.001 m. To record this measurement as either 0.4 or 0.42819667 would imply that you only know it to 0.1 m in the first case or to 0.00000001 m in the second. You should only report as many significant figures as are consistent with the estimated error. The quantity 0.428 m is said to have three significant figures, that is, three digits that make sense in terms of the measurement. Notice that this has nothing to do with the "number of decimal places". The same measurement in centimeters would be 42.8 cm and still be a three significant figure number. The accepted convention is that only one uncertain digit is to be reported for a measurement. In the example if the estimated error is 0.02 m you would report a result of 0.43 ± 0.02 m, not 0.428 ± 0.02 m.   and the following quote from  (emphasis added):     The absolute error places bounds telling you that the actual value is expected to fall between x - D x and x + D x. The absolute error is an easy way to report the error and makes it easy to check that you are not reporting too many significant figures. For example, suppose you had a measurement that was reported to be 10.02 ± 0.3 m. Because the reported value is uncertain in the tenths place, it is wrong to report it to the hundredths place. It should be reported to the same decimal place as the absolute error: 10.0 ± 0.3 m. Another point is that the absolute error and the reported value must have the same units.   If there is such a convention (cf. Rice's lab guide) and it is wrong to report more significant figures than is warranted by the absolute error (cf. the joint project's guidelines), and NIST should have adhered to such convention and striven to be correct, is it true that NIST adheres and is correct because the standard uncertainty has two least significant digits (i.e., $27$)?  Had the standard uncertainty been $0.000\;000\;2\text{ mol}^{-1}$, would NIST have reported Avogadro's Number as $N_A = 6.022\;141\;3\times 10^{23}$ with 8 significant figures?


The Hamiltonian of a system is defined as $$H=\sum_ip_i\dot{q_i}-L$$ where $L=T-V$.  I have read thatin the cases where the Hamiltonian doesn't explicitly depend on time, we have $$H=E_{total}=T+V$$ But try as I might, I can't figure out how to prove it. Any help?

In classical mechanics, the Hamiltonian is well defined by the Lagrangian. Whereas, energy is a very ambiguous term. We just say $E=T+U$, and usually it equals to Hamiltonian. Does there exist a way that, by just looking at the Lagrangian mathematically, we immediately know the relationship between the Hamiltonian and the energy of the system?  And if we have a system, the Hamiltonian of which does not equal to energy, what is the physical meaning of that difference?


I used the method pcls in order to make a simple regression (price ~ livingArea) with constraints. I set the constraint for b0 > 1000 but the result I got is very bad.     y = price and X = livingArea  And I think that if the result is bad for a regression with only one explanatory variable, then the result will be worse for a model with one dependent variable and more explanatory variables.  Is it possible that the result was bad because of the constraint I set?  If there is no value for the intercept, can I assume that the value for it is 0?

I would like to solve a linear regression (in R) with weights $w$ and a constraint.  In other words, I would like to find $x$ that minimizes the sum of squares $$\sum_i w_i(b_i-Ax_i)^2$$  On top of that I have an external vector $d$, which I would like to use in a constraint, such that $d \cdot x \le 5$.  Is this something that would be possible to do in R with solve.QP or perhaps some other R script?  Edit: I am adding a bounty for a solution that doesn't require any other custom software except the cran packages. While rstan works perfectly unfortunately I am unable to install it on my production servers due to old versions of some libraries.


Constantly having a problem with my Home volume filling up. The problem is I don't know what to delete. Is there a utility that will search for files by size and allow easy deletion? On Ubuntu Mate 18.04.

I'm looking for an application which allows me to see what is consuming the most disk space and also to delete the files from there.


I have recently re-installed my Windows 8 Release Preview, and it has left a Windows.old folder in my C Drive.  I am trying to delete this folder, but I am getting lots of errors:          After restarting windows several times and trying to delete this folder, I still have:    What should I do? How can I go about deleting this folder and freeing the space?

I used to run Windows 7 32 bit, but installed the 64 bit version because of a RAM upgrade. During the installation I got this message:      The partition you selected might contain files from a previous Windows installation. If it does, these files and folders will be moved to a folder named Windows.old. You will be able to access the information in Windows.old, but you will not be able to use your previous version of Windows.   The C:\ drive now has two (2) Windows folders:   Windows (15.3 GB) Windows.old (15.7 GB)     Don't see why I need the Windows.old taking over 15GB of space on my hard drive so I tried to delete it. It didn't work.  How can I safely delete this folder?


How can I fix these errors I get when running APT?    Running ppa-purge gives error below  Updating packages lists W: The repository 'http://ppa.launchpad.net/chris-lea/libsodium/ubuntu xenial Release' does not have a Release file. W: The repository 'http://ppa.launchpad.net/fossfreedom/packagefixes/ubuntu xenial Release' does not have a Release file. W: The repository 'http://ppa.launchpad.net/mc3man/trusty-media/ubuntu xenial Release' does not have a Release file. E: Failed to fetch http://ppa.launchpad.net/chris-lea/libsodium/ubuntu/dists/xenial/main/binary-amd64/Packages  404  Not Found E: Failed to fetch http://ppa.launchpad.net/fossfreedom/packagefixes/ubuntu/dists/xenial/main/binary-amd64/Packages  404  Not Found E: Failed to fetch http://ppa.launchpad.net/mc3man/trusty-media/ubuntu/dists/xenial/main/binary-amd64/Packages  404  Not Found E: Some index files failed to download. They have been ignored, or old ones used instead. Warning:  apt-get update failed for some reason

When updating, I get the following error message:   W: The repository 'http://ppa.launchpad.net/mc3man/trusty-media/ubuntu xenial Release' does not have a Release file.   Here, I find another statement on this error:   This recommends removing certain PPAs; and, I'm not sure if I should do that since it might mean not getting the updates that I need.    Is this what I should do?


I checked a lot of examples of non-commutative rings that came to my mind, but they weren't helpful. In particularly it's not the case for ring of matrices because of the multiplicity of the determinant. Any hints?

Can I have a hint on how to construct a ring $A$ such that there are $a, b \in A$ for which $ab = 1$ but $ba \neq 1$, please? It seems that square matrices over a field are out of question because of the determinants, and that implies that no faithful finite-dimensional representation must exist, and my imagination seems to have given up on me :)


How to understand divergence physical significance?

What is ? I was learning about Maxwells equations and don't understand the divergence part of it. Can someone give an intuition of what divergence is in relation to maxwells equation. To give you a sense of language to use I'm 17 and don't do maths or physics at school (I've just recently started loving the two.)


Let f is differentiable on R. Following statement is true?  If $\lim_{x\to a}f'(x)=\alpha$, then $f'(a)=\alpha$ (where $\alpha$ and $a $ are real numbers)

I ran across this problem in my Analysis class and can't seem to come up with a good solution. Here's the question: Show that if $\lim_{x\to a}f'(x) = A$ then $f'(a)$ exists and equals $A$. $f$ is continuous on $[a,b]$ and differentiable on $(a,b)$.  I tried applying the Mean Value theorem like this: There exists a $c \in (a, x)$ st $f(x)-f(a)=f'(c)(x-a) \implies \frac{f(x)-f(a)}{x-a}=f'(c) \implies f'(a)=\lim_{x\to a}\frac{f(x)-f(a)}{x-a}=\lim_{c\to a}f'(c)=A$  However, I think this is wrong. I am pretty sure the Mean Value theorem is needed, but my application of it seems to be incorrect. Would somebody be able to point me in the right direction?


can anyone please help me out to make the two column form vertically at same page.i ve also attached the coding too.my issue is that how to write two forms in form.py and how to do changes in templates(login.html) to make the 2 forms to be displayed into two columns??please help me out.. Thanks in advance!  class Login(AuthenticationForm):      region = forms.ChoiceField(label=_("Region"), required=False)      username = forms.CharField(label=_("User Name"))     password = forms.CharField(l![enter image description here][2]abel=_("Password"),                                widget=forms.PasswordInput(render_value=False))     t= [('http:google.com','Google'),('http://kent.com','University of Kent')]     FederatedLogin = forms.ChoiceField(label= _("Select one of the third party "),choices= t)     tenant = forms.CharField(required=False, widget=forms.HiddenInput())   login.html    {% extends "horizon/common/_modal_form.html" %}  {% load i18n %} {% load url from future %}  {% block modal-header %} {% trans "Log In" %} {% endblock %} {% block modal_class %} login  {% if hide %} modal hide {% endif %} {% endblock %}  {% block form_action %}{% url 'login' %}{% endblock %} {% block autocomplete %}{{ HORIZON_CONFIG.password_autocomplete }}{% endblock %}  {% block modal-body %}   <fieldset>     {% if request.user.is_authenticated and 'next' in request.GET %}

{% trans "You don't have permissions to access:" %}

{{ request.GET.next }}

{% trans "Login as different user or go back to" %}         {% trans "home page" %}

     {% endif %}     {% if next %}<input type="hidden" name="{{ redirect_field_name }}" value="{{ next }}" />{% endif %}     {% include "horizon/common/_form_fields.html" %}   </fieldset> {% endblock %}   {% block modal-footer %}   <button type="submit" class="btn btn-primary pull-right">{% trans "Sign In" %}</button>  {% endblock %}

I can't figure out how to achieve the following layout with CSS (probably because I don't actually know CSS).  I have a bunch of divs like this:

1

2

3

4

5

6

   (not the real contents)  Now I want the layout to look like two equal columns of divs, with the "right" ones on the right, and the "left" ones on the left, thus:  2 1 3 5 4 6   [Edit: In a previous version of this question I had textareas inside the divs, and the divs all had different names like "one" and "xyz".] I tried something like  div.right { width:50%; float:right; clear:right; } div.left { width:50%; float:left; clear:left;}   but it doesn't quite work: It produces something like:  2 1 3  4 5   6   (without the "clear"s, it blithely produces   2 1 3 4 6 5   which is not what is wanted).  It is apparent that it can be made to work if the divs are ordered differently, but I'd like not to do that (because these divs are generated dynamically if the browser has Javascript, and I don't want to change the actual order that is displayed in the absence of Javascript, for semantic reasons). Is it still possible to achieve the layout I want?  [For what it's worth, I'm willing to have it not work on IE or older versions of other browsers, so if there is a solution that works only on standards-compliant browsers, that's okay :-)]


How do I calculate the height of a <header> tag from a <main> tag so that I can use the calc() function to calculate the rest of the screen space available to span a banner in its place.  HTML:  <body>   <header>     <!-- A Navigation Bar of some sorts -->   </header>   <main>     <div class="banner">       <!-- Some text on the banner -->     </div>   </main> </body>   And CSS:  .banner {   height: calc(100vh - /* Height of <header> */);   background-image: url(some image);   background-position: center;   background-size: cover; }   Just an FYI... I'm designing for a project for college and for mobile specifically so this formatting will not span to desktop as I will change the styling for desktop and tablets

I am working on a web application where I want the content to fill the height of the entire screen.  The page has a header, which contains a logo, and account information. This could be an arbitrary height. I want the content div to fill the rest of the page to the bottom.  I have a header div and a content div. At the moment I am using a table for the layout like so:  CSS and HTML    #page {     height: 100%; width: 100% }  #tdcontent {     height: 100%; }  #content {     overflow: auto; /* or overflow: hidden; */ }

...

...

     The entire height of the page is filled, and no scrolling is required.  For anything inside the content div, setting top: 0; will put it right underneath the header. Sometimes the content will be a real table, with its height set to 100%. Putting header inside content will not allow this to work.  Is there a way to achieve the same effect without using the table?  Update:  Elements inside the content div will have heights set to percentages as well. So something at 100% inside the div will fill it to the bottom. As will two elements at 50%.  Update 2:  For instance, if the header takes up 20% of the screen's height, a table specified at 50% inside #content would take up 40% of the screen space. So far, wrapping the entire thing in a table is the only thing that works.


I am having trouble with finding help on how to use  on Linux, it's always Windows all the time.

What I want is to create a bootable pen drive that shows GRUB menu and I can select any of the several bootable systems from there to install/run. I have several ISO images that I want to install in the USB like Ubuntu, Fedora, System Rescue CD, Windows XP and Windows 7 (The windows versions are optional, mostly am looking for a multi installer for Linux distros, specially Ubuntu version)  The default Startup Disk Creator only works with Linux Images and only 1 at a time (At least for the mean time. If it allows more systems and multiple ISOs it would be awesome)  What method exists that I can use step by step to create a bootable USB Drive with multiple images than can be booted from the USB and selected from GRUB. It must support Windows Images and Linux Images.  Alternatively, is there also a way to have multiple versions of the Ubuntu installation ISO on same USB Drive, such as, when booting from it, I get to choose what Ubuntu version and architecture to install, for example:     BOOT MENU   Ubuntu 12.04 32 Bit   Ubuntu 12.04 64 Bit   Ubuntu 12.10 32 Bit   Ubuntu 12.10 64 Bit   UPDATE: Wanted to add that the English version for the post mentioned by daithib8 is here:


So I am trying to make a castle defense map for minecraft 1.13 where you design a wall to keep mobs out. One central method I want to use for the map is to have mobs pathfind to a specific place. For example, if I have several mobs who are attacking, I want them to pathfind towards specific points. I have looked into several unsuccessful methods, which are:   First, I would have two teams that were angry at each other. I believe I thought this would work because of a video by SethBling that I only watched the first couple seconds of. However, after some testing, I concluded that that was not a thing. Secondly, I tried spawning zombies with a large follow range to pathfind to villagers. To prevent zombies from going to the wrong point I would use the fact that they don't attack villager on their own team. This method would work great if it were not for the fact that each mob can only be on one team. Finally, and this should work, would be to use the owner idea of snowballs to make mobs attack specific mobs. This should work, however it would be less than ideal.   Is there any more efficient/easier way of doing it, or is Method #3 the only way to do so?

I want to make an arena where mobs will fight each other and a player can bet on one side or the other. For example: There are 2 skeletons in dyed armor; red and blue. Each color representing a team. When they spawn I want them to fight each and then when one dies I want it to announce which team is the winner and give the player the "money" due. I'm just not sure how to get the skeletons to attack each other without a player instigating it.


Let $z^n=w$ where $w$ is a complex number. There will be $n$ solutions for this equation. Let the solutions  be $z_1,z_2,\ldots,z_{n-1},z_n$.  If  $arg(z_2)-arg(z_1)=d$, it is my observation that $arg(z_x)=arg(z_{x-1})+d$ where $x \in \mathbb{Z}$.  Further, plotting the solutions on an argand diagram divides the diagram into equally sized portions. For instance, if n=3, the plotted solutions will divide the diagram into 3 equal sections.  Is there some intuitive explanation as to why:  1) The solutions to $z^n=w$ form an arithmetic sequence?  2) When plotted, the solutions divide up the argand diagram into $n$ sections of equal size?

Suppose $z$ is a nonzero complex number, so $z=re^{i\theta}$. Show that there are only $n$ distinct complex $n$-th roots, given by $r^{1/n}e^{i(2\pi k+\theta)/n}$ for $0\leq k\leq n-1$.   My proof: Let $z=re^{i\theta}\in\mathbb{C}$ and $a\in\mathbb{C}$ s.t. $a^{n}=z$. Let $a=\rho e^{i\varphi}$. Then, $a^{n}=(\rho e^{i\varphi})^{n}$. Setting $\rho^{n}e^{i\varphi n}=re^{i\theta}$ and rewriting in polar form, we get $$\rho^{n}(\cos(n\varphi)+i\sin(n\varphi))=r(\cos(θ)+i\sin(\theta)).$$ Thus $\rho^{n}=r$ $\rightarrow$ $\rho=r^{1/n}$ and $n\varphi=\theta\rightarrow\varphi=\theta/n$. Thus the roots of $a\in\mathbb{C}$ have the form $$r^{1/n}(\cos(\tfrac{\theta}{n})+i\sin(\tfrac{\theta}{n}))=r^{1/n}(\cos(\tfrac{\theta}{n}+2\pi j)+i\sin(\tfrac{\theta}{n}+2\pi j))$$ for some $j\in\mathbb{Z}$ due to the periodicity of trig functions. Then, $$r^{1/n}(\cos(\tfrac{\theta}{n}+2\pi j)+i\sin(\tfrac{\theta}{n}+2\pi j))=r^{1/n}e^{i\left(2\pi j+\tfrac{\theta}{n}\right)}=r^{1/n}e^{i(\theta+2\pi k)/n}$$ for $0\leq k\leq n-1 ,j=nk\in\mathbb{Z} $.  I feel like there could be a more concise way to put this.


I have a mathematical expression (((a+b)(c+d))+p(q*2+r))/2 I am trying to write a C# code to match the groups as below  (((a+b)(c+d))+p(q*2+r)) ((a+b)(c+d)) (q*2+r)) (a+b) (c+d))  Unfortunately I am not able to find one. Can you please help me from this situation I have an expression "((.*?))" but this can match as below and it is not matching with my need  (((a+b) (c+d) (q*2+r)  NB: Expression can be changed. Looking for a generic regex pattern to parse any expression with BODMAS rule

I need a regular expression to select all the text between two outer brackets.  Example: some text(text here(possible text)text(possible text(more text)))end text  Result: (text here(possible text)text(possible text(more text)))


I am currently self reading " Spectral theory of Riemann zeta function" by Yoichi Motohashi. The example is in first chapter and of poincare series. I want to know how the Poisson sum formula on the last sum led to the final equation. I dont need any exact answer. Any help/hint would be appreciated. Edit 1:  This question I asked earlier today related to this topic.

I am currently self reading " Spectral theory of Riemann zeta function" by Yoichi Motohashi. The example is in first chapter and of poincare series. I am not able to justify from 1.1.5 to the next line. Actually I don't know what does mean by classifying summands according to h (mod l). Any help/Hint would be appreciated. I am stuck here since yesterday.


I've imported a .mp4 video as a plane in object mode so that I can point the camera at it and animate some 3D objects in front of the video. The image of the video won't show up though (it remains a black rectangle, and trying to play the animation doesn't change this.). I've tried tutorials but they all seem to be for older versions of blender and don't seem to track to today. Anything I can apply like adding a light source doesn't seem to do the trick. I'm trying to figure out how to change the viewing mode and material of the plane but I'm not sure I'm doing it right. Some of the lighting does seem to change the the black rectangle remains as such. Changing the engine from eevee to cycles doesn't seem to make any difference either.

In blender cycles render engine, how do I put a movie clip on a plane so it displays the video? I want the video to be on the plane if there is a way.


Real dumb question, but suppose a computer with Linux does not have an encrypted hard drive. If I generated a hash with "openssl passwd", couldn't I just run a live version of Ubuntu and add my hash to the /etc/shadow file? Or is /etc/shadow encrypted even if the hard drive isn't?

A Linux installation can be simply hacked by using a live USB/CD, gaining root access on the live distro, chrooting to the target filesystem and running passwd root. One can use grub . There may be some other methods as well.  What is the most efficient way of defending against hacking the installation from Live USB provided the system runs on an SSD drive (TRIM and encryption are said not to work well)?


I am trying to get some intuition regarding the U and V matrices in SVD ($M=UEV^T$). I think these are orthonormal basis vectors, but I am struggling to get an intuition if they represent anything more than matrix transformations. For example, in NMF, I understand that the decomposed matrices can be combined as a linear combination of basis vectors in one matrix with weights in the other matrix. In PCA, I understand that the eigenvectors have real significance in representing orthogonal axes of maximal variation, defined by the eigenvalues. But in SVD, I don't see any immediate connection. Could someone enlighten me?

I have read about singular value decomposition (SVD). In almost all textbooks it is mentioned that it factorizes the matrix into three matrices with given specification.   But what is the intuition behind splitting the matrix in such form? PCA and other algorithms for dimensionality reduction are intuitive in the sense that algorithm has nice visualization property but with SVD it is not the case.


I'm trying to pretty up my order list items and I'm now wondering how I can achieve the following effect, and if it's even possible in pure CSS:    Is it possible to change the number-points and style them like this in just CSS, and if so, how?

How can I left-align the numbers in an ordered list?  1.  an item // skip some items for brevity  9.  another item 10. notice the 1 is under the 9, and the item contents also line up   Change the character after the number in an ordered list?  1) an item   Also is there a CSS solution to change from numbers to alphabetic/roman lists instead of using the type attribute on the ol element.  I am mostly interested in answers that work on Firefox 3.


I needed to figure out how many requests could be made with 1000 GB of traffic if each request took 1MB on average. I quickly did the math on paper, and then as a second thought plugged it into Google. To my surprise, Google's answer is different than mine.  My way:  1,000 gigabytes = 1000*1024*1024*1024 bytes  Divide by 1 megabyte = 1024*1024 bytes to get:  (1000*1024*1024*1024)/(1024*1024) = 1,024,000    The Google Way:  1000 gigabytes / 1 megabyte  Output: 1,000,000    Am I wrong, or is Google wrong?

got me wondering about the differences between these three ways of measuring size: a kibibyte, a kilobit, and the conventional kilobyte.  I understand that these measurements have different uses (data transfer rate is measured in bits/sec), but I'm not quite sure if I can tell the difference between Mb and MB and MiB.  Here is a comment, reproduced below, taken from  (emphasis mine).     The C64 has 65536 bytes of RAM. By   convention, memory size is specified   in kibiBytes, data transfer rates in   kilobits, and mass storage in   whatever-the-manufacturers-think-of-now-Bytes. Harddrives use T, G, M and k on the   label, Windows reports the size in Ti,   Gi, Mi and ki. And those 1.44MB   floppys? Those are neither 1.44MB nor   1.44MiB, they are 1.44 kilokibibytes. That's 1440kiB or 1'474'560 bytes. –   Third


Unfortunately i was playing gta 5 story mode campaign and then i finished the "FROM BEYOND THE STARS" Achievement where you had to collect all 50 spaceship parts and after i finished it i noticed that i was disconnected from xbox live and i did not get the achievement but i completed it :(  i even checked my SocialCLub account and the achievement was still locked. So how can i sync it to xbox live? note that i DID completed the achievement. please help me out! thanks. also it happened to another achievement in gta 5! Thanks.

If you're offline when your game would normally assign you an achievement, what happens? Are you notified, and it syncs to your profile later when you are online? Do you just miss out on it?


So the goal is to prove that the $\operatorname{lcm}(a,b)$ divides any multiple of of $a$ and $b$. Suppose there is  some integer $c$ such that  $a|c$ and  $b|c$ but I want to prove $\operatorname{lcm}(a,b)|c$ also.  I got that $$\operatorname{lcm}(a,b)=\frac{(a\cdot b)}{\gcd(a,b)}$$ and I want to see how we could show $$\frac{(a*b)}{\gcd(a,b)}\bigg| \, c$$ Any help would be appreciated thank you.

Prove: If $a\mid m$ and $b\mid m$ and $\gcd(a,b)=1$ then $ab\mid m$  I thought that $m=ab$ but I was given a counterexample in a comment below.  So all I really know is $m=ax$ and $m=by$ for some $x,y \in \mathbb Z$. Also, $a$ and $b$ are relatively prime since $\gcd(a,b)=1$.   One of the comments suggests to use , i.e., $aq+br=1$ for some $q,r\in\mathbb{Z}$. Any more hints?  New to this divisibility/gcd stuff. Thanks in advance!


So i was following a "How to make a fire" tutorial on youtube and i have a render view problem now.   An when i change to render view it looks like this    How can i fix it?

When I render I see a solid cube which is Adaptive domain. But it shouldn't show up. I feel like I missed something. It is my first time simulating fire.  Candle with a solid domain blocking the fire    The material seems to be plugged in to the volume already :/  Node setup


How can I update an object with another object?  for example   master = { name: "John", email: "j@j.com" }  child = { phone: "888-333-3999" }   How can I  update master with child?  Output of master need to be   { name: "John", email: "j@j.com", phone: "888-333-3999" }   Also, this is a node.js JavaScript, I don't want to use jQuery.

I need to be able to merge two (very simple) JavaScript objects at runtime.  For example I'd like to:  var obj1 = { food: 'pizza', car: 'ford' } var obj2 = { animal: 'dog' }  obj1.merge(obj2);  //obj1 now has three properties: food, car, and animal   Does anyone have a script for this or know of a built in way to do this?  I do not need recursion, and I do not need to merge functions, just methods on flat objects.