I want to sort about 2500 images every day into folders with a timestamp. So far I have this script but it's not working....  for x in *.jpg; do d=$(date -r "$x" +%Y-%m-%d) mkdir -p "$d" mv -- "$x" "$d/" done   The error is:  /home/pi/BRAVO/sort.sh: line 1: syntax error near unexpected token `$'do\r'' 'home/pi/BRAVO/sort.sh: line 1: `for x in *.jpg; do   Any solution to this problem or a similar script?

When I try to run the following script in zsh, via the command /bin/zsh ~/.set_color_scheme.sh I get the following error:  command not found: ^M   The script has u+x permissions and it used to work on another machine that also had zsh. Any clues why?   Note: This question is related to  (where I am trying to adapt the script for tcsh)  #!/bin/zsh # Contents of set_color_scheme.sh  export LS_COLORS=$( \ ( grep '\w' | grep -v '^#' | sed 's/#.\+//' | perl -lane 'printf "%s=%s:", shift @F, join ";", @F;' ) <<< "  # HUMAN_FORMATTED_DATA # list one per line  # these are basic filesystem items no 00          # normal fi 00          # file di 01 34       # directory ln 00 36       # link pi 40 33       # pipe so 00 35       # bd 40 33 01 cd 40 33 01 or 01 05 37 41 mi 01 05 37 41 ex 00 91       # executable ow 01 34       # other writables   *.cmd 00 32 *.exe 00 32  # archive, compressed things etc *.gz  00 90 *.bz2 00 90 *.bz  00 90 *.tz  00 90 *.rpm 00 90 *.rar 00 90 *.zip 00 90 *.iso 00 90   *.cpio 00 31    # perl & CODE *.c      33 *.h      33 *.sh     33 *.t      33 *.pm     33 *.pl     33 *.cgi    33 *.pod    33 *.PL     33 *.js     33 *.php    33 #*.xs  # strikethrough *.off 00 9 *.bak 00 9 *.old 00 9   # documents misc, html webstuff # really TEXT *.htm    94 *.html   94 *.txt    94 *.text   94 *.css    94   # MOVIE *.avi    96 *.wmv    96 *.mpeg   96 *.mpg    96 *.mov    96 *.AVI    96 *.WMV    96 *.mkv    96  # images & pdf *.jpg    96 *.jpeg   96 *.png    96 *.xcf    96 *.JPG    96 *.gif    96 *.svg    96 *.eps 00 96 *.pdf 00 96 *.PDF 00 96 *.ps  00 96  *.ai  00 91 # adobe ill *.doc 00 91 # msword   # data, such as .db, .csv *.csv    95 *.dsv    95 *.db     95 *.sql    95 *.meta   95 # CONFS *.xml    95 *.yaml   95 *.yml    95 *.conf   95 # [a-z0-9]*rc ")


I am trying to make a roundish pipe for my project. I am not very experienced in Blender yet and this project is very ambitious for me. Basically, I am trying to make  from , and I am still at the head part. He has two pipes going around his eye (I will show the image below). To make a pipe, I followed this video tutorial:

I'm wondering how to approach duct work, piping, and wiring? In the past, I have used the spin tool to make corners, but I find it very cumbersome. How do you do duct work and piping? I have seen people use curves, but I find it's hard to get straight 90 degree angles or just uniform angling across the whole model. It's also hard connecting piping together if they started from different locations. Here's some reference:


Why do I get an error with this command in KDE:  qdbus org.kde.klipper /klipper getClipboardContents qdbus: could not exec '/usr/lib/x86_64-linux-gnu/qt5/bin/qdbus': No such file or directory   ?

When I run followind command: qdbus I get following error:  qdbus: could not find a Qt installation of ''  I've read alot of old questions with same error but not one helps me.  I've tried execute following commands sudo apt-get install qt5-default + same for for qt4, etc. but still have same error.  If any additional information required for this issue - please add comment and I'll provide info.


I would like to know, in  $1/0.5 =2$ why does $1/0.5$ yield $2$.   I want to know a conceptual explanation, not merely a method how to get the answer.   If you are able to explain this in example using image that would be super helpful!  My understanding is if you divide one whole pizza we get $2$ halves slice of pizzas which is $1/2$. So, $1/0.5 = 2$ mean you will get $2$ whole pizza?

Can someone help me understand in basic terms why $$\frac{1}{\frac{1}{X}} = X$$  And my book says that "to simplify the reciprocal of a fraction, invert the fraction"...I don't get this because isn't  reciprocal by definition the invert of the fraction?


I have positiones the Right hand side of my rigify Armature, and not I don't want to go through positioning my left hand side. I know there is a way to do that but I do not remember how.    Never mind people my PC crushed and all the data is now gone, I actually can't even get in, because it says that I don't have an operating system

I can't find the bone mirror option.  When I used Blender about two years ago the mirror option was tucked away in the rig/object panels, but now I see no obvious options.  How can I mirror bones in 2.7+?


I'm generating a random number from 1 to 100 and showing it to user and then I will get 20 chances to to guess that random number. The response should be either YES or NO but right now when I run this program it just takes input from user and end the execution it is not visiting the if else if loop    Code  public static void main(String args[]) {     Random rand = new Random();     int rand_int1 = rand.nextInt(100);     System.out.println("Random value is = " + rand_int1);      int n = 20;      Scanner userinput = new Scanner(System.in);      System.out.println("is your number is form 0 to 50 ?");     String ans1 = userinput.nextLine();     System.out.println("ans : " + ans1);      if (ans1 == "yes") {         System.out.println("number is more then 50");     }     else if (ans1 == "no") {         System.out.println("number is less then 50");     } }   Example Output  Random value : 23  is your number is more then or equal to 50? ans : No   Later, I will add more code so this will also be in the output:  is your number is less then or equal to 25? ans : Yes

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


In my main function (Form1_Load) i'd like to call 3-4 functions to initially setup the program. Problem is that im getting an error when trying to do this (one function is not running properly). I am able make a button for each function call and press them in the right order using the Windows Form and the program works fine. So i'm thinking that the program is not connecting properly to the server , execution of functions are too fast or something causing problems with threads, so I need to add some delay between the function calls. How do i do this the best way in C#? Idea:    Form1_Load(object sender, EventArgs e) {          callfunction1();          add_delay();          callfunction2()          add_Delay();          etc.  }   This is one of my first times programming in C# so im sorry if the answer is obvious.

How do I get my C# program to sleep for 50 milliseconds?  This might seem an easy question, but I'm having a temporary brain failure moment!


My textbook, Introduction to Probability, by Blitzstein and Hwang, provides the following problem:     Let $X = V + W$ and $Y = V + Z$ where $V$, $W$, and $Z$ are independent $\text{Pois}(\lambda)$ random variables.   I want to then find the joint distribution of $X$ and $Y$ so that I can calculate $P(X = 3, Y = 0)$ in terms of $\lambda$.   However, I am confused about how to proceed here. I would greatly appreciate it if people could please take the time to show how to do this. I would really appreciate it if people could explain the reasoning behind the steps taken, so that I can understand what's going on in the solution process.

I've recently encountered the bivariate Poisson distribution, but I'm a little confused as to how it can be derived.  The distribution is given by:  $P(X = x, Y = y) = e^{-(\theta_{1}+\theta_{2}+\theta_{0})} \displaystyle\frac{\theta_{1}^{x}}{x!}\frac{\theta_{2}^{y}}{y!} \sum_{i=0}^{min(x,y)}\binom{x}{i}\binom{y}{i}i!\left(\frac{\theta_{0}}{\theta_{1}\theta_{2}}\right)^{i}$  From what I can gather, the $\theta_{0}$ term is a measure of correlation between $X$ and $Y$; hence, when $X$ and $Y$ are independent, $\theta_{0} = 0$ and the distribution simply becomes the product of two univariate Poisson distributions.  Bearing this in mind, my confusion is predicated on the summation term - I'm assuming this term explains the the correlation between $X$ and $Y$.  It seems to me that the summand constitutes some sort of product of binomial cumulative distribution functions where the probability of "success" is given by $\left(\frac{\theta_{0}}{\theta_{1}\theta_{2}}\right)$ and the probability of "failure"  is given by $i!^{\frac{1}{min(x,y)-i}}$, because $\left(i!^{\frac{1}{min(x,y)-i!}}\right)^{(min(x,y)-i)} = i!$, but I could be way off with this.  Could somebody provide some assistance on how this distribution can be derived? Also, if it could be included in any answer how this model might be extended to a multivariate scenario (say three or more random variables), that would be great!  (Finally, I have noted that there was a similar question posted before (), but the derivation wasn't actually explored.)


So I have a table that includes lists written with tabularx, however the lists have rather excess padding at the top and on the left. Is there a way to reduce this only for the space of this table?  Code:  % PRO CON TABLE FOR DIFFERENT TOOLKITS \begin{table}[h] \centering \begin{tabularx}{\textwidth}{|c|X|X|} \hline \textbf{Name} & \textbf{Advantages} & \textbf{Disadvantages} \\ \hline QuTiP & \begin{itemize} \item Supervisor is one of the lead developers on the project, so can ask questions and get advice as needed. \item Widely used, with 371 citations at time of writing, meaning tool may have more value \end{itemize} &  \begin{itemize} \item Con \item Con \end{itemize} \\ \hline (... other lines ...) \end{tabularx}% \end{table}

I want to produce the first two rows of this 5-column table in LaTeX:      As you can see it is a special type of tables where we see:   itemized lists inside but inconsistently, ie. column 4 all rows have itemizes lists inside, columns 2,3, and 5 do have itemized lists in some but not all rows, column 1 has no itemized lists at all. the nice alignment of the table the candy-eye appearance like that what booktabspackage  was created for it is a compact table that contains no unpleasant spaces   the lists have square bullets   Code:  \documentclass{scrartcl} \usepackage{graphicx} \usepackage{booktabs} \usepackage{array} \usepackage{lscape} \begin{document} \begin{landscape}   \thispagestyle{empty}           % hide page number   \begin{table}     \centering     \setlength{\belowcaptionskip}{\abovecaptionskip}% Correct skip for caption on top     \caption{Wide Itemized Mixed Table}     \label{tab:wide-item-tbl}       \begin{tabular}{lp{2in}p{2in}p{2in}p{2in}}         \toprule         \textbf{BSL} & \textbf{Agents} & \textbf{Practices} & \textbf{Primary barriers} & \textbf{Secondary barriers} \\         \midrule         1 & Not known to consistently cause diseases in healthy adults & standard microbiological practices & no primary barriers required, PPE & bench and sink required \\         2 & - Agents associated with human diseases  - Routes of transmission include per-cutaneous injury, ingestion, mucous membrane exposure & BSL-1 practice plus: - limited access - Biohazard warning signs - ``Sharps'' precautions - Biosafety manual defining any needed waste decontamination or medical surveillance polices & Primary barriers: - BSCs or other physical containment devices used for all manipulations of agents that cause splashes or aerosols of infectious materials - PPE: Laboratory coats, gloves, face and eye protection, as needed & BSL-1 plus: - Autoclave available\\         \bottomrule       \end{tabular}%   \end{table} \end{landscape} \end{document}   The nearest answer I found was , but unfortunately this answer assumes that all rows have itemized list and not some of them, so please for your kind attention to this point before labeling this post as duplicate.


I want to sell my old SSD on EBay. How do I prepare the hard drive to protect my personal data and get the hard drive in a good shape using an Ubuntu live cd?

I'm planning on selling a USB external hard drive that currently contains an old Ubuntu installation with stored passwords and banking information.  How can I securely erase the drive before selling it?


I had posted my first question. I got negative feedback and deleted it.    Request No. 1  User should be shown a pop-up message while deleting a post:       "This would be taken into account. So it is better to improve your question and convince people rather than deleting".     If I had gotten this I could surely have preferred this but I was happy after deleting that I had deleted my negative reputation.  I had deleted my own post thrice and got banned from asking more questions. But later I learned that it was being taken into account. On my third time post I was told by some good soul that I was wrong with my formatting, causing negative feedback  Request No. 2  During the posting of answers, the user should be warned/forced to properly format the contents. It should be asked as requirement while posting question if he/she does not do it him/herself.  I came to know the reason for getting negative feedback, when some good soul edited my post and just formatted it voluntarily and then I got positive voting rather than negative.  It was definitely my fault to not read all details from everywhere before posting a question. But I could have been guided better as well.  My ban was lifted (my luck/effort) but I think new users can be guided a bit better to avoid getting banned.

If a user is question banned  and the , how can the user fix this on their own?  Until recently, advice has been to improve their questions, but since they can't see the questions on their question screen, they can't improve them:     Feature request: Allow a question banned user to see their own deleted questions, or warn them that deleting questions could lead to a question ban.


I am all new to photography and about 3 weeks ago, I bought a Canon 7D Mark II body.  Up to now, I have been using a Canon 18-135 STM lens, which I borrowed from my friend.  I am thinking about buying a lens now, and since I mostly take landscape photos, I am thinking about buying a wide/normal angel prime lens.  So here are my criteria for the lens:   I need sharp images It should be wide, since I take photos of large scenes I take pictures at night or low light too   So, I really need your suggestions.  And here is what I came up with:   Canon EF 50mm f1.8 II Canon EF 50mm f1.8 STM Canon EF-S 24mm f2.8 STM Canon EF 40mm f2.8 STM   The fact that my camera has a crop factor of 1.6 pushes me more toward the latter two ones.

I am considering buying my first DSLR.  How do I know whether I need a 18-200 lens, 17-85, or 18-55? Or something else?


but:  derive wrt θ1 and not wrt z=∑θixi  show that: $$ \frac{\partial \sigma(z)}{\partial \theta_1} = \sigma(z)(1-\sigma(z)) \cdot x_1 $$ with: $$ z = \theta_0 x_0 + \theta_1 x_1 $$  Note that in general (because of symmetry) holds:  $$ z = \theta_0 x_0 + \theta_1 x_1 + \dots $$  $$ \frac{\partial \sigma(z)}{\partial \theta_j} = \sigma(z)(1-\sigma(z)) \cdot x_j $$  How should I do this?

In my AI textbook there is this paragraph, without any explanation.     The sigmoid function is defined as follows      $$\sigma (x) = \frac{1}{1+e^{-x}}.$$      This function is easy to differentiate because      $$\frac{d\sigma (x)}{d(x)} = \sigma (x)\cdot (1-\sigma(x)).$$   It has been a long time since I've taken differential equations, so could anyone tell me how they got from the first equation to the second?


Years ago I was taught a proof that there are more irrational numbers than rational numbers, i.e. that it is a bigger infinity, that went like this: Take the set of all rational numbers. Now construct a new number as follows: Take the first rational number, and choose a digit for the first digit of our constructed number that is different from the first digit of this number. Then make the second digit different from the second digit of the second number. Make the third digit different from the third digit of the third number. Etc. If you did this for an infinite number of digits, you would then have a number that is different from all the numbers in the original set. Therefore, there are numbers that are not in the set of rational numbers. Therefore, there are more irrational numbers than there are rational numbers. I see the proof up to the last sentence. How does this prove that there are more irrational numbers? Just because I can find a number in set B that is not in set A doesn't prove that set B is bigger than set A. I mean ... suppose I take the set of all even integers. There are an infinite number of such numbers. (I assume you agree with that and I don't need to go into a proof.) Now consider the set of all integers, odd and even. There are members of the set of all integers that are not in the set of integers. But there are not more integers than there are even integers. It is easily provable that there are the same number: I can establish a one-to-one correspondance between the two sets. So how does the diagonal proof prove that there are bigger infinities? I presume I'm missing something. What?

I'm having trouble understanding Cantor's diagonal argument.  Specifically, I do not understand how it proves that something is "uncountable".  My understanding of the argument is that it takes the following form (modified slightly from the  article, assuming base 2, where the numbers must be from the set $ \lbrace 0,1 \rbrace $):  \begin{align} s_1 &= (\mathbf{0},1,0,\dots)\\ s_2 &= (1,\mathbf{1},0,\dots)\\ s_3 &= (0,0,\mathbf{1},\dots)\\ \vdots &= (s_n \text{ continues}) \end{align}  In this case, the diagonal number is the bold diagonal numbers $(0, 1, 1)$, which when "flipped" is $(1,0,0)$, neither of which is $s_1$, $s_2$, or $s_3$.  My question, or misunderstanding, is: When there exists the possibility that more $s_n$ exist, as is the case in the example above, how does this "prove" anything?  For example:  \begin{align} s_0 &= (1,0,0,\mathbf{0},\dots)\ \ \textrm{ (...the wikipedia flipped diagonal)}\\ s_1 &= (\mathbf{0},1,0,\dots)\\ s_2 &= (1,\mathbf{1},0,\dots)\\ s_3 &= (0,0,\mathbf{1},\dots)\\ s_4 &= (0,1,1,\mathbf{1},\dots)\\ s_4 &= (1,0,0,\mathbf{1},\dots)\ \ \textrm{ (...alternate, flipped } s_4\textrm{)}\\ s_5 &= (1,0,0,0,\dots)\\ s_6 &= (1,0,0,1,\dots)\\ \vdots &= (s_n \text{ continues}) \end{align}  In other words, as long as there is a $\dots \text{ continues}$ at the end, the very next number could be the "impossible diagonal number", with the caveat that it's not strictly identical to the "impossible diagonal number" as the wikipedia article defines it:     For each $m$ and $n$ let $s_{n,m}$ be the $m^{th}$ element of the $n^{th}$ sequence on the list; so for each $n$,      $$s_n = (s_{n,1}, s_{n,2}, s_{n,3}, s_{n,4}, \dots).$$      ...snip...      Otherwise, it would be possible by the above process to construct a sequence $s_0$ which would both be in $T$ (because it is a sequence of 0s and 1s which is by the definition of $T$ in $T$) and at the same time not in $T$ (because we can deliberately construct it not to be in the list). $T$, containing all such sequences, must contain $s_0$, which is just such a sequence. But since $s_0$ does not appear anywhere on the list, $T$ cannot contain $s_0$.      Therefore $T$ cannot be placed in one-to-one correspondence with the natural numbers. In other words, it is uncountable.   I'm not sure this definition is correct, because if we assume that $m = (1, \dots)$, then this definition says that "$s_n$ is equal to itself"&mdadsh;there is no "diagonalization" in this particular description of the argument, nor does it incorporate the "flipping" part of the argument, never mind the fact that we have very clearly constructed just such an impossible $T$ list above.  An attempt to correct the "diagonalization" and "flipping" problem:  $$s_n = (\lnot s_{m,m}, \lnot s_{m,m}, \dots) \quad \text{where $m$ is the element index and} \quad\begin{equation}\lnot s_{m,m} = \begin{cases}0 & \mathrm{if\ } s_{m,m} = 1\\1 & \mathrm{if\ } s_{m,m} = 0\end{cases}\end{equation}$$  This definition doesn't quite work either, as we immediately run in to problems with just $s_1 = (0),$ which is impossible because by definition $s_1$ must be $ = (1)$ if $s_1 = (0)$, which would also be impossible because...   Or more generally, with the revised definition there is a contradiction whenever $n = m$, which would seem to invalidate the revised formulation of the argument / proof.  Nothing about this argument / proof makes any sense to me, nor why it only applies to real numbers and makes them "uncountable". As near as I can tell it would seem to apply equal well to natural numbers, which are "countable".  What am I missing?


can we build a solution in jquery where we can export excel data to existing sharepoint list number of column in excel will be 56 or more with 5000 rows , i have to use on JSOM

Is it possible to export data from excel to exisiting sharepoint list i do not want to create new one ,copy paste datasheetview is not working as expected and taking time do we have any options?


So I'm trying to prove the following:  $$ \sum\limits_{k=0}^{n} {k \choose a} {n-k \choose b} = {n+1 \choose a+b+1}$$  And I'm a little caught on how to get started. It doesn't seem like a straightforward manipulation of the binomial theorem, so I was wondering if there was a nice way to visualize this in a combinatorial way -- i.e. I see that we'd be multiplying the ways of finding a subset of size a from a set of size $k$ and the ways of finding a subset of size $b$ from a set of size $n-k$, and this should equal the ways of finding a subset of size $a+b+1$ from a set of size $n+1$. I was wondering if this type of story could be extended to prove this, or if another approach was more advantageous.   This is a homework problem, tried to put as much of my thought process down as possible.

Given two positive integers $a$ and $b$, prove that  $\sum_{k=0}^{n} {k \choose a} {n-k \choose b} = {n+1\choose a+b+1}$  I think there should be a good combinatorial proof for this, given the simplicity of the right-hand side... my hunch is to form all possible subsets of size $a+b+1$ by dividing the set into $k$ and $n-k$ elements, then choosing $a$ from the first, $b$ from the second, iterating over all values of $k$.  I can't quite make this work, so I've also been trying to rewrite ${n+1 \choose a+b+1}$ to make it clear.  Open to any proof method, all help appreciated.


I have a class structure like this:  public class OuterClass {      private static class InnerClass {          public void someMethod() {             OtherClass.otherMethod(<???>);         }  }   which refers to a static method of some other class OtherClass:  public class OtherClass {      public static void otherMethod(OuterClass) {         ....     }  }   I am trying to figure out what to put in place of the <???>. How do I refer to the instance of the outer class from within the inner static class? What I would like to do is to refer to the implicit this of the OuterClass.

What is the main difference between an inner class and a static nested class in Java? Does design / implementation play a role in choosing one of these?


So I just completed the chapter Conic Sections and the one thing I could not understand is what is the use of Latus Rectum? It is defined as " Line segment passing through the focus and parallel to directrix." I've done questions like what is the length of latus rectum when some values are given. Is it just a line with no significance? I mean there can be a line in parabola parallel to directrix with say 8 times the focus? Is it any less significant than Latus rectum?

I'm a maths teacher in Italian secondary school and I've been spending some time trying to construct "meaningful" problems about conic sections. I particularly like problems which focus on practical applications of the curves (in engineering, physics, finance, etc.), on their geometric properties, or both.  I know there's this really easy formula to find the latus rectum of a conic from its key parameters. It's quite nice and straightforward to derive it, but...  ... What's its use? Why should anyone be interested in knowing the latus rectum of a curve? Is there any physical phenomenon, any architectural trick, or anything else where its position and/or length plays a key role?   I know just the relation between angular momentum, standard gravitational parameter and latus rectum in an astronomical orbit ($l=\frac{h^2}{GM}$, where $l$ is half the latus rectum, and $h$ is the ratio between the angular momentum associated to the orbiting body and its mass). It's cool, but a bit tricky, and probably too far-fetched for secondary school students... Is there anything simpler? Or just anything else, at any difficulty level?  Many thanks!


I am quite new to latex, and am having some troubles in general with figure placementent. Take this as and example: ...  \section{First} Sample text: %\clearpage \begin{figure}[h!]     \centering     \caption{Sample caption}     \label{fig:sample_1}     \includegraphics[width=0.6\textwidth]{sample/1} \end{figure}  \section{Second} Some other text  ...  Now, if I compile the tex document and the image is too big to fit in the current page, it is often added below the Second section. So then, I have to uncomment the \clearpage to break the current page (up to Sample text:) so that the image is added on a new page and the Second section after that. This bothers me quite a lot. I would much rather waste some space and always insert the image on a new page, if it doesn't fit. Is it possible to do so? The main problem is that  if I add something above the code block above, then the \clearpage is used even if the image now fit, as Sample text: got moved on a new page by itself. The strange thing to me is that I should be forcing the placement with [h!], but it still doesn't work..

Often floats may land quite a bit later in the document than the point they are created, sometimes after a section break.  Is there a way to force a new section to start on a new page, after any unplaced floats?


I was wondering whether or not there is any non homebrew method other than multi-classing, for a druid character to get an animal companion. If not I would appreciate some advice for implementing the animal companion feature  to the druid class without breaking the game too much.   I am asking because the character I wish to play will be a fire genasi druid who was born to a highly religious family who thought he was a demon or other, and abandoned him in the woods, he was raised by wolves and then trained by a druid, and I want to be able to have a wolf that was different from the others in the pack (a genasi is the result of a genie and a mortal, so does a wolf count as a mortal?) as a companion.

I'm fairly new to DMing and so is my group, so we are all on a learning curve together. We're playing D&D 5e.  Last week a fighter in our group tamed a wolf with Animal Handling and then requested that he keep the wolf. I allowed this, but now I'm not sure about how to play the wolf.  Specifically, how can he train the wolf to perform certain actions such as attacking?  What other things might I need to be aware of with a PC owning a "pet"?


I'm trying to render and all I get is the same cached image, whether I choose Cycles or Blender Render. I can hide and move objects, but the cached image is all I get when I press the render button. If I remove the images in the output folder, I just get a blank render screen and no rendering happens at all. What do you think is going on here?

Blender is rendering an older version of my project, not the most recent one. I have made it using the Blender Render but it does not want to render in cycles either. A black and grey screen is rendered as if everything is transparent. Checked general camera, lighting and compute devises in case I messed something up but I can't find anything. All my textures and objects look normal, does anybody know what is wrong or what to check?  Ok added link:


Say we've got a logistic regression model $M$ used as a classifier in a binary case. Now we take a test set $\tau=\{(x_1,y_1),...,(x_n,y_n)\}$, each test sample is assigned with $\hat{\pi}_i=P(y_i=1|x_i)$ and then, assuming naive threshold of 0.5, a prediction is made: $\hat{y}_i=\left\{\begin{matrix}1 & \hat{\pi}_i\geq 0.5\\ 0 & \hat{\pi}_i< 0.5\end{matrix}\right.$.  We can then $M$'s discuss accuracy rate as $\frac{1}{n}\sum_{i}{I\{\hat{y}_i=y_i\}}$ or maybe its certainty rate $\frac{1}{n}\sum_{i}{max(\hat{\pi}_i,1-\hat{\pi}_i)}$.  Wherever I've looked, a logistic regression classifier is assessed either by information criteria or by cross-validation, both eventually relating to the degree of fit to the train dataset.  It might look a total stranger's question, but are there are known methods using accuracy or certainty? it might be just me missing this info somehow.

I know some well-known measures are $c$ statistic, Kolmogorov-Smirnov $D$ statistic. However, as far as I know, those statistics take into account only of the rank order of the observations, and is invariant under changing the intercept of the logistic regression model (e.g. in oversampling-correction exercise).  In my current application, I need to depend on the accuracy of the logistic regression to predict probability of event. I know only of qualitative way of assessing models for probability prediction ability, namely by plotting "QQ-plot" of the actual vs predicted probability of event:   Score the validation dataset using the developed model. Rank the observations according to the predicted probability and group into $n$ buckets according to their rank of predicted probability. (First 1/n would go to the first bucket, next 1/n would go to the next ...) Calculate the average predicted and actual probability of Event for each bucket. Create a scatter plot of Predicted vs Actual - one point for each bucket.   I am wondering:   Is the "Q-Q plot" I mentioned above a legitimate way to assess predictive performance of models developed from logistic regression? If so, where may I find more reference for that? Is there any known quantitative way to assess the probability prediction ability of this kind of model?


I am trying to learn Linux by creating a CTF as a hobby project, and I see that an enthusiast before me have been using Ubuntu server 16.04.4 (that i have been using to analyze and get ideas from) and i am only having Ubuntu server 16.04.7 available from my office desk. What does typically this last digit indicate? And if you have time to explain the whole "release-tree"-structure to me i would be very grateful! Thank you for for attention, Best regards, Tom

What's the meaning of the numbering for different versions? Do they signify something?


I am migrating a Drupal 7 site to Drupal 8.  I have a custom block (visible only on the home page) that has some tabs on it.  Currently, the tabs are implemented using jQuery UI tabs and it would be nice (but not necessary) to keep them using that.  In order to get this to work, I need to use the jQuery and jQuery UI JavaScript files.  However, everything I have seen online talks about module and theme dependencies.  There doesn't seem to be any way to tell Drupal 8 that a specific block (or page, etc.) needs specific JavaScript files loaded in order to work correctly.  I know that I can just import the javascript files directly with script tags, but that doesn't seem to be the preferred method, especially considering all of the various optimizations that are part of Drupal (to make sure that a file is only included once, for example).  How do I include the required JavaScript files (available in core) on a specific page or as part of a specific block?  I don't really want to create a custom module for every time that I need to do this, but all of the references I have found online talk about dependencies for themes or modules, nothing for specific content.  EDIT: Multiple suggested answers involve PHP, custom modules, YML, etc.  These are not what I am looking for.  I am looking for a solution for front-end content creation (pages, nodes, blocks for the "custom block library", and so on), not requiring back-end coding and development.  Modules on Drupal.org that allow this to be done generically are perfectly acceptable.  Maybe I need to create one and put it up there, but I would think there should be an existing solution by now.  It seems strange to me that there isn't, but maybe I'm missing something.

I am developing a custom module in Drupal 8. My custom module include many JavaScript and CSS files which make the site really slow and I don't want them in all pages. I have developed some custom blocks and each JavaScript and CSS library correspond to a block. I want those files on those pages of the site where my custom blocks are visible.  In my last Drupal 8 project, I have done something like the following.  function HOOK_page_attachments(array &$attachments) {     $user = \Drupal::currentUser()->getRoles();      if(in_array("administrator", $user)){         $attachments['#attached']['library'][] = 'module/library';     } }   I am not sure how to check which blocks are visible in the page.


Pi is the ratio of circumference of a circle to its diameter.  Okay. Got that, easy enough. Now, why does the following equality hold true?  $$ \frac{\pi}{4} = 1 - \frac{1}{3} + \frac{1}{5} - \frac{1}{7} + \ldots$$  Why do we get closer to Pi from summing up many rational fractions? Granted, we can do a little bit of calculus here, find out that it all comes down to either fundamental theorem of calculus or Taylor series. Either route you pick the key here is the fact that derivatives of inverse trigonometric functions are rational or at least non-trigonometric.  If we dig deeper, it becomes clear that it all depends on our choice of units for trigonometry. Why are radians the right way to measure angles? It all boils down to the well-known limit:  $$\lim\limits_{x \to 0} \frac{\sin x}{x} = 1 $$  The above equality is true if and only if $ x $ is measured in radians. Why does sine have to be $ 2\pi $-periodic for that limit to equal 1?  My guess is that period of sine is $ 2\pi $ because it's the only value "makes" that limit equal 1. That's the only sane explanation I could devise. Isn't there a more obscure mathematical connection here? Resolving the problem via falling in a virtuous circle is the only way to go here?  Still, why is it $ 2\pi $ and not, say, $ \sqrt{42} $? I apologize in advance for insufficient clarity of my writing, English is not my mother tongue.

I am hoping to find out where the formula  $$\frac{\pi}{2}=\sum_{k=0}^{\infty}\frac{k!}{\left(2k+1\right)!!}$$ comes from. I can't see how one could begin to prove it.


To whom it may concern (Stackoverflow programmers, probably): Possible bug. I answered a question on SO this afternoon and my reputation points jumped by 110.  I went from 198 to 308 just by getting one up-vote.

When I visit the reputation tab of my profile, I see a lot of stuff. I can make out some of it, but not all.   What do all the event types mean? Why do some events show an odd reputation gain or not show any reputation change at all? Why are some events sometimes highlighted in yellow? My reputation suddenly dropped, but I don't see anything. What happened? Why do some events disappear from my reputation history?


Does there exist a continuous surjection $f:(0,1]\to (0,1)$?  My try: Let $f(1)=a\in (0,1)$. So the map could not be monotone. Is that mean the image set must contain the maximum?

Is there any continuous function defined on $(0, 1]$ whose range is $(0, 1)$?


Let $x > 0$. Prove that the value of $$\int^{x}_{0} \frac{1}{1+t^2}dt + \int^{\frac{1}{x}}_{0} \frac{1}{1+t^2}dt$$ does not depend on $x$.  I really have no idea how to start this problem. How do I show something doesnt "depend" on something?

Let $x > 0$. Prove that the value of the following expression doesn't  depend on x  $$\int_{0}^{x} \frac{1}{1+t^2} dt + \int_{0}^{\frac{1}{x}} \frac{1}{1+t^2}dt$$  Attempt:  Left: f'(x) = $\frac{1}{1+x^2}$  Right: f'(x) = $\frac{1}{1+(\frac{1}{x})^2} -\frac{1}{x^2}$  $= \frac{1}{(1+\frac{1}{x^2})} - \frac{1}{x^2}$  $=\frac{x^2}{1+x^2} - \frac{1}{x^2}$  $=\frac{x^4 - x^2 - 1}{1+x^2}$  Yeah I don't know what I am doing, I tried to remove the integral but failed miserably


I am at my wits end, and google wont give me any new answers.  Could you please help.  My wants and needs   Installation does not look like the guide. I want to overwrite Windows 10. (Initially along side it) I have disabled all the fast and secure etc. boot goodies. That is my technical jargon. There is no drive to choose from in the installation process except for my bootable usb, and yes it is UEFI.   My laptop   Toshiba Satellite U840W-F747 Intel(R) Core(TM) i5-317U CPU @ 170GHz 10 GB RAM x64-based proccessor   So can you guys help?  More info:  ;

Having some issues installing Ubuntu 14.04.3 LTS 64bit next to Windows 10.  This is what I did:  1) Created a bootable usb with ubuntu on it using Universal-USB-Installer-1.9.6.3  2) Changed the boot mode  3) Boot from USB - It showed the option to test drive or install - I chose install  4) Choose Language  5) Setup Wireless - I didn't choose anything here  6) Then it showed me the preparing to install  7) After that a message popped up saying:      Unmount partitions that are in use The installer has detected that the following discs have mounted partitions /dev/scd Do you want the   installer to try and unmount these partitions before continuing? If   you leave them mounted, you will not be able to create, delete, resize   partitions on these discs, but you may be able to install on an   existing partition there.   So obviously I said yes.  8) Installation type - I chose something else - This looked nothing like the screen shots I saw on the installation guide.    9) Then it only gave me the option to choose my bootable usb for the installation. With a bunch of options to choose, so I got scared and quit.     Can any one please help?  Keep in my mind I do not know a lot, so please dumb it down. Why can't I choose to run it along side Windows 10? Why doesn't the installation pick up my hard drives?  If you need any other info, please ask. But I think I put everything in here.


I'm wondering what the general opinion on "list" questions in the trilogy - example:    Are these good questions? I certainly think so, as they help Stack Overflow and the like become central repositories of information. They're also very Googleable.  On a slightly related note, is it OK to edit answers to these questions into the question itself, as in the example? Or should answers be answer and have it left at that.

There are absolutely loads of payment gateways out there, and I'd like a comprehensive list of them. There's already a question asking for the "best" ones,  and another asking for ones suitable for a charity .  Would such a question be on topic? And would it need to be CW? The obvious way to do it is to have one CW answer and edit all other answers into it. I don't know whether the question itself should be CW, or just the main answer.


Can who you pick as "faculty members of interest" make-or-break your PhD application? Question I:  If one happens to pick only faculty who aren't taking in PhD students will that doom ones application? If-not, will the PhD acceptance board try to pair you with a faculty member you did not list – assuming the applicant is of high-quality?  I applied for a PhD program in Computer Science. I will be funded through a Think-Tank/Research-Institution – to which I am a full-time employee. I put this on my application. I did not think too deeply about the faculty of interest. I considered also applying PhD program in Computer Science & Engineering. However, here's the catch. If I apply using the same "faculty members of interest" as the PhD in Computer Science application, I believe my chances of acceptance do not increase. I believe if those faculty members would not have accepted me into their labs as a PhD in Computer Science, they also would not have accepted me into their labs as a PhD in Computer Science & Engineering. However, filling out two Question II:  Is filling out two PhD applications in similar domains with the same "faculty members of interest" somewhat pointless?  Question III:  Is it worth reaching out to admissions to ask to change your "faculty members of interest" after submission if a better fit is found?

I am writing my statement of purpose for my Ph.D. and I want to work in a specific field with a specific professor in the department that I am going to apply for and I have a very good experience in this field. I sent an email for that professor asking if he/she is accepting Ph.D. students and he/she did not respond. I built my whole statement of purpose based on my previous achievements and future plan for that specific area. I also mentioned that I am willing to work with that professor. My statement of purpose tells that I am very passionate about this field and I am only willing to work with that professor (if there were more than one professor working on the same area, I would mention all of them). if that professor doesn't accept new Ph.D. students, will I risk my admission to that school?   Will the committee response be something like this:  "the applicant really knows what he/she is going to do and there is a specific future plan and he/she also got a good experience in this field, but he/she sounds very strict to his plan and doesn't show any flexibility...REJECTED"?


I'm trying to free up some space on my Ubuntu partition, and I've already deleted huge redundant resources such as caches and log journals. Now two directories on /snap have grabbed my attention: /snap/intellij-idea-community and /snap/pycharm-community. In each of them there are two folders with almost identical sizes, and a shortcut named "current":   As seen in the photos, these two programs take up 3.8 Gigabytes of space combined. I thought they are two different versions of the same program (because of the size similarity) but when I tried to move one of them to another directory using the sudo mv command, it said: mv: cannot move '249' to '/home/esra/Desktop/249': Device or resource busy  The same happened for the two directories in /pycharm-community. Do they really belong to the same version and I'm going to screw up my IDEs if I delete one of them? If not, why can't I move any of them to somewhere else?

When I open Ubuntu Software, and check the installed software, I found that there are 2 different versions of GNOME runtime (3.26 and 3.28).   How to check which one of them is running? Is it OK to uninstall one of them (the one that is not used)?  INFO:  I am using Ubuntu 18.04 gnome-shell --version gives: GNOME Shell 3.28.4


I have a shape file with Stockholms road network and a raster image with elevation data from the same area.   Is there any way to merge the two somehow, either by adding the slope direction as positive or negative numeric values through an extra column in the attribute data or in any other magic way?  The purpose would be to calculated shortest path with regard to the elevation, to be able to avoid unnecessary uphill climbs.  I work with QGIS and pgRouting so an answer compatible with that would preferable, but other solutions are welcome as well!

I am working on a road network for routing operations using postgis and QGIS.    I am new to both of these tools and need to calculate the slope for each edge (by retrieving the Z value for the start and end node for the edge from a raster). Any ideas of the best approach to this?   I know postgis can dump points and get the value from a raster, but can I get the slope attribute to the edge without breaking the network topology (with edges that have corresponding start/end nodes) using this method?   thanks


I tried sqv byohhousefalkreath but that only showed things like hold and hold city not the rooms in my house. Is there any other commands I can try to change my house wings??

I currently have Windstad Manor and built it all. Now I regret some choices and I'd like to rethink and rebuild it.  Is there any console way to "nuke" the manor and rebuild it from ground up?


I migrated my hard drive to a different laptop and I am having trouble getting my WiFi to work. lshw shows that the drivers are installed but ifconfig  only display ethernet and loopback. I've been looking for solutions for over a week now.  Can anyone suggest something I can do? Thanks

I'm having serious problems installing the Broadcom drivers for Ubuntu. It worked perfectly on my previous version, but now, it is impossible.   What are the steps to install Broadcom wireless drivers for a BCM43xx card?  I'm a user with no advance knowledge in Linux, so I would need clear explanations on how to make, compile, etc.    lspci -vnn | grep Network showed:   Broadcom Corporation BCM4322 802.11a/b/g/n Wireless LAN Controller [14e4:432b]      iwconfig showed:  lo        no wireless extensions. eth0      no wireless extensions.   NOTE: Answer below is updated every time new information is added and confirmed working.


I have two domains PRIMARY and DEV. These both contain matching service accounts for various applications. PRIMARY also contains user accounts  We have a one way trust relationship such that DEV trusts PRIMARY so that users do not need matching accounts to log into DEV machines. However, we want to prevent DEV service accounts from trying to hit resources in PRIMARY (and because password is different, it causes the service account in PRIMARY to become locked).

My Administrator user once in a while is getting locked-out by the workstations in our lab, due to failed logon attempts. (While this is a problem that should be addressed, because this means there is something wrong with the techies process, it's a small and less important at the moment)  My main problem is that the Administrator can authenticate from anywhere in the network. I've tried using GPO ("Deny log on through Remote Desktop Services"), ADUC ("Log On To" list). While he can't actually logon, the authentication is performed first and only then the system checks if there's a GPO or an ADUC block, thus allowing the Administrator user to get locked-out.  Of course this problem can apply to any user. My Domain\Forest level is 2008r2, and I don't have a firewall between my LAN and my DC.  So, in short, I want to allow authentication attempts of the Administrator only from a certain computers. Any suggestions?


I'm attempting something which I feel should be fairly obvious to me but it's not.  I'm trying to match a string which does NOT contain a specific sequence of characters.  I've tried using [^ab], [^(ab)], etc. to match strings containing no 'a's or 'b's, or only 'a's or only 'b's or 'ba' but not match on 'ab'.  The examples I gave won't match 'ab' it's true but they also won't match 'a' alone and I need them to.  Is there some simple way to do this?

I know it's possible to match a word and then reverse the matches using other tools (e.g. grep -v). However, is it possible to match lines that do not contain a specific word, e.g. hede, using a regular expression?   Input:  hoho hihi haha hede   Code:  grep "<Regex for 'doesn't contain hede'>" input   Desired output:  hoho hihi haha


When a user not in sudoers tries to elevate privileges to root (in Ubuntu 18.04 for example) the OS displays this alert: "Username is not in the sudoers file. This incident will be reported".  Now, where can the admin see this report? How can admins detect an invalid sudo attempt?  I'm specifically interested in CentOS 7.

Along side the question "" that explained the programical aspects of the error and suggested some workarounds, I want to know: what does this error mean?   X is not in the sudoers file.  This incident will be reported.   The former part of the error explains, clearly, the error. But the second part says that "This error will be reported"?! But why? Why the error will be reported and where? To whom? I'm both user and administrator and didn't receive any report :)!


I'm using Puppet and I need to create symlinks between two folders. I have around 10 folders with the same structure and I always want to execute my link command in xx/yy/zz.  Something like this:  ln -s aa/bb/folder_to_link  folders_1_to_x/yy/link_name   I tried following  directions but had no success.  Is there an easy to write command that can accomplish this?

If you have a series of subfolders (like from a to z) and want to run a command on each one of them (like rm *.pdf or ls *.pdf), how do you do that? The "manual" approach would be cd a, rm *.pdf, or ls *.pdf, cd .., cd b, ... That seems too complicated, so I believe there must be an easier approach.


The phrase "to break a butterfly on a wheel" is very evocative, but I can't bring myself to use it: I find the "wheel" too disturbing.  So: what are some good alternatives?  (For those who are unfamiliar with this expression, Brewer's Dictionary of Phrase and Fable defines it as "to employ superabundant effort in the accomplishment of a small matter". [])

So I know I've heard this saying in American English before but I just can't quite find the original.  I have come up with several made up variations like:   I don't send the Navy (or whole army, or a battalion) when all you need is a diplomat. Don't buy the whole cow when all you need is milk.   What's the more commonly heard saying/phrase for this of expression?


I have a file called ttsql in linux and windows machine. But that ttsql file builded separately for windows and linux. The windows file is working properly. But In linux , Which is not working. How Can i convert .exe into linux excutable file.

I have an executable program (no source code, just the compiled executable) that was made in windows (.exe extension).  It doesn't use any graphics... it simply reads and writes files.  I want to be able to run it in a linux shell script so that I don't have to switch operating systems to get my output.  Is there a way to use or convert the executable for linux operating systems?


Show by combinatorial arguments that:   $$\sum_{k = 0}^m \binom{m}{k}\binom{n}{r + k} = \binom{m + n}{m + r}$$  Hello ,  I want to prove this argument by double counting method, i kinda have an idea of proving by comb args. but not by double counting... Can someone give any clues or ideas? thanks :)

Prove that $$\sum\limits_{k=0}^m\binom{m}k\binom{n}{r+k}=\binom{m+n}{m+r}$$ using combinatoric arguments.   I prefer you to answer using an analogy to a combinatoric problem or else I'll have trouble understanding.  I tried:  Let $m$ represent a group of boys and $n$ represent a group of girls. We want to form a committee with the condition that there must be $r$ more girls than boys on the committee. There's two ways of doing this. (I'm having trouble with the right-hand side.)  The left-hand side is one way of doing this. So we split the problem to different cases. One such case is where there are no boys on the committee, and so, there's $\binom{m}0\binom{n}{r+0}$ ways of forming a committee. Next, we can have 1 boy on the committee. There's $\binom{m}1\binom{n}{r+1}$ ways to do this. We repeat this process until we have $\binom{m}k\binom{n}{r+k}$ ways of forming a committee. Summing up the cases will result in the right-hand side. However, as stated before, I don't really know how to explain the right-hand side. Maybe I used the wrong analogy?


I have the following code:  \documentclass[11pt]{article} \usepackage{tikz} \begin{document} \newcount\x \x=-1 \begin{tikzpicture}   \foreach \percentA in {33}   {     \if \percentA \empty \else     \global\advance\x by 1      \draw (\x,0) circle (0.2cm);      \fi   }; \end{tikzpicture} \end{document}   If I use \if instead of \ifx, this code compiles to an empty document. If I would use 66 instead of 33, it would compile to an empty document as well. But if I would use any other value (like 32 or 34 or 65), it would work just fine, and would draw a circle.  Could somebody tell me why 33 equals to \empty? I know that I should have used \ifx, but I'm wondering why 33 and 66 are so special in this case, because I would expect the same behavior for every number.

I try to understand the subtleties of TeX programming, but it is not always easy. For example, in the following code :   \def\first{abc} \def\second{abc} \ifx\first\second OK!\else false \fi   I understand why the output is OK!.  But I do not understand why the output is false with this code :  \if\first\second OK!\else false \fi


If a creature I control without flying has a coin counter from  dies, and I have  and Athreos on the field.  What happens?    Do I only get the original creature back? With or without flying counter? Does this cause me to get a copy of the creature since both cards say return to battlefield?

The situation is my  has been enchanted with .  The creature has      when it dies, return it to his owner’s hand   The enchantment says     When enchanted creature dies, return that card to the battlefield under your control with a +1/+1 counter on it.   Who gets the creature? Me or my rival?  Does the creature ability trigger before or after enchantment?


I'm training an LSTM (using the Keras python library) to generate sequences. My X training data is a list of sequences, and the Y training data is a list of the final values of those sequences.   The training X (padded_training_seqs) data looks something like this (only much larger):   [ [[43.103, 27.092, 19.078], [43.496, 26.746, 19.198], [43.487, 27.363, 19.092], [44.107, 27.779, 18.487], [44.529, 27.888, 17.768]],  [[44.538, 27.901, 17.756], [44.663, 28.073, 17.524], [44.623, 27.83, 17.401], [44.68, 28.034, 17.601], [0,0,0]], [[47.236, 31.43, 13.905], [47.378, 31.148, 13.562], [0,0,0], [0,0,0], [0,0,0]] ]   and the training Y (training_final_steps) data looks like this:  [ [44.652, 39.649], [37.362, 54.106], [37.115, 57.66501] ]   and here is where I build the model:   in_dimension = 3 hidden_neurons = 300 out_dimension = 2  model = Sequential() model.add(BatchNormalization(input_shape=((max_sequence_length, in_dimension)))) model.add(Masking([0,0,0], input_shape=(max_sequence_length, in_dimension))) model.add(LSTM(hidden_neurons, activation='softmax', return_sequences=False)) model.add(Dropout(0.2)) model.add(Dense(out_dimension, activation='linear'))  model.compile(loss="mse", optimizer="sgd") model.fit(padded_training_seqs, training_final_steps, nb_epoch=5, batch_size=1)  The problem is when I try and generate new sequences:  ``` seed_lat = 42.966 seed_long = 39.869 seed_temp = 25.066  current_generated_sequence = np.array([[[seed_lat, seed_long, seed_temp]] + [[0,0,0]] * (max_sequence_length - 1)], dtype=np.dtype(float))  for i in range(0, max_sequence_length - 1):     next_step = model.predict(current_generated_sequence, batch_size=1, verbose=1)[0]     current_generated_sequence[0][i + 1] = loc_with_temp(next_step, i)   I build the new sequence step by step, each time using model.predict to get the next step of the current_generated_sequence. (Then I add in a 3rd dimension to that predicted value so it can be inputted in the next iteration) Problem is, it converges on predicting a single value, so the total generated sequence looks like this:  [[[ 42.966       39.869       25.066     ]   [ 41.38308716  37.68268204  10.387     ]   [ 41.38308716  37.68268204  10.387     ]   [ 41.38308716  37.68268204  10.387     ]   [ 41.38308716  37.68268204  10.387     ]   [ 41.38308716  37.68268204  10.387     ]   [ 41.38308716  37.68268204  10.387     ]   [ 41.38308716  37.68268204  10.387     ]   [ 41.38308716  37.68268204  10.387     ]   [ 41.38308716  37.68268204  10.387     ]]]   Anything i'm doing clearly wrong? I've done some research and read that this might be a sign of a saturated hidden layer. Or overfitting. My sample size is not exactly enormous.  UPDATE: I changed the batch size to 10 and was able to get a sequence where there was two unique values.   [[[ 41.36413574  37.32749557  10.607     ]   [ 41.36413574  37.32749557  10.607     ]   [ 41.36413574  37.32749557  10.607     ]   [ 41.36413574  37.32749557  10.607     ]   [ 41.36413574  37.32749557  10.607     ]   [ 41.36413574  37.32749557  10.607     ]   [ 41.36413574  37.32749557  10.607     ]   [ 41.36413574  37.32749557  10.607     ]   [ 41.39291382  37.15774536  10.644     ]   [ 41.36413574  37.32749557  10.607     ]]]   P.S. The full code and data is at

I'm training a neural network but the training loss doesn't decrease. How can I fix this?  I'm not asking about overfitting or regularization. I'm asking about how to solve the problem where my network's performance doesn't improve on the training set.    This question is intentionally general so that other questions about how to train a neural network can be closed as a duplicate of this one, with the attitude that "if you give a man a fish you feed him for a day, but if you teach a man to fish, you can feed him for the rest of his life." See this Meta thread for a discussion:   If your neural network does not generalize well, see:


I am attempting to write code to traverse a collection of type InstallationComponentSetup:  java.util.Collection<InstallationComponentSetup> components= context.getInstallationComponents(); Iterator it = components.iterator(); while (it.hasNext()) {     if (((InstallationComponentSetup)it).getName() == "ACQ")     {          return true;        } }   The cast in the if-statement fails, but I don't really know why (I am a C++ programmer!).  If someone could give me some pointers as to what I am doing wrong I would be grateful.

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


I didn't see any change in rep when I got upvoted on Board and Card Games meta; how does the system work?

I noticed that the reputation from the main site carried over to meta on Gaming (at least the first upvote), I guess that doesn't work the other way around, right?  Is it then impossible to have a meta reputation higher than the site reputation?


I have a Western Digital (WD) My Passport WDBYNN0010B external hard drive and I accidentally deleted some important media files (mostly wmv format). I have tried many recovery programs e.g. Recuva, easeuse, and stellar. All of these programs say that these files are not overwritten and can be recovered but I can not open the recovered files. All of these programs works well for my ADATA external drive. I have not stored any more files in the external drive after this accident. My PC has Win 10 and has USB 2 ports unlike the external drive that has USB 3. Does anyone know 1) how I can recover these files and 2)what is the reason of the above problem?

What steps can I take to try to recover lost or inaccessible data from any storage device?  Answers:   This applies to any computer storage device, e.g. internal/external hard drives, USB sticks, flash memory. The most important thing is to STOP using it, any type of I/O can ruin your chances of a recovery.     We have separate questions covering common problems with USB flash drives in greater detail:


I am after Italian GIS data - administrative boundaries such as:     Regions (Regioni) Provincies (Provincie) Municipalities (Comuni) Districts (Quartieri) City quarters (Contrade o Rioni) Zones (Zone) Suburbs (Frazioni)  and Postcodes.  I can find data some data to download - for example     But I want to make sure I have the most up to date data.  Who is the official supplier of this data? Which government department manages this GIS data? When the data is updated how will I know?  In Australia  there is a government department that manages this data and every 3 months we are are sent updates if we pay some $. I am not sure if there is an equivalent in Italy

After learning about the  datasets I've working with the following layers, from the USA data   Country boundaries State boundaries County boundaries City boundaries ZipCode/Postcode boundaries   What I am trying to find is the equivalent (where appropriate) of the same data for various countries.  Is there any free administrative boundaries available as shapefiles for other countries?


It has been established that a character cannot willingly . But can they willingly fail an ability check contest?  While most spells say that the target must succeed to fail a Saving Throw,  states:     You can try to move a Huge or smaller creature. Make an ability check with your spellcasting ability contested by the creature's Strength check   I wanted to cast this on the party rogue so they could get up to the second story window to sneak in; a rich man's Levitate spell. Alternately, cast it on a fighter and help him chase around the flying monsters.  The obvious work around is to have them stand on an object that cannot contest the spell and lift them up, but then there is a chance of balance failing.  In the PHB, it talks about :     Sometimes one character's or monster's efforts are directly opposed to another's. This can occur when both of them are trying to do the same thing and only one can succeed, such as attempting to snatch up a magic ring that has fallen on the floor. This situation also applies when one of them is trying to prevent the other one from accomplishing a goal — for example, when a monster tries to force open a door that an adventurer is holding closed. In situations like these, the outcome is determined by a special form of ability check, called a contest.   This assumes that the two efforts are at odds. However in this case a contest would not be required as the characters are working together. But the spell description bypasses that and flat out says there is a contest; no mention of willing or unwilling.  So can my warlock give a boost easily, or is there a chance of failure?

Here are the general guidelines regarding ability checks:     The GM calls for an ability check when a character or monster attempts an action (other than an attack) that has a chance of failure. When the outcome is uncertain, the dice determine the results.   In some cases, you could want to fail an ability check. If you are climbing a wall an want to drop off, you fail simply because you stop attempting to climb, but in other cases, success and failure are both tied to the actual action and may both have desirable outcomes.  Example 1: Spell scrolls  An evil adversary wants you to cast a spell scroll for him, but you have him figured out and want to destroy his spell scroll instead, seemingly by accident. The rules on spell scrolls read:     If the spell is on your class’s spell list but of a higher level than you can normally cast, you must make an ability check using your spellcasting ability to determine whether you cast it successfully. The DC equals 10 + the spell’s level. On a failed check, the spell disappears from the scroll with no other effect.   A failure means that you successfully destroy the spell scroll.  Example 2: Amulet of the Planes  You are in possesion of the Amulet of the Planes. Your party is being overrun by terrible monsters, and the only way to save your party is to sacrifice yourself by sending yourself and the monsters to another plane of existence.     While wearing this Amulet, you can use an action to name a location that you are familiar with on another plane of existence. Then make a DC 15 Intelligence check. On a successful check, you cast the Plane Shift spell. On a failure, you and each creature and object within 15 feet of you travel to a random destination. Roll a d100. On a 1-60, you travel to a random location on the plane you named. On a 61-100, you travel to a randomly determined plane of existence.   By walking up to the monsters and failing the check, you and the monsters would be sent to another plane of existence.  The question  The rules seem to assume that you always want to succeed when you perform an ability check. Sometimes, however, you could want to fail on purpose. A sensible DM would rule that if you are skilled enough to succeed the check, then you would undoubtly be able to fail it on purpose as well. What does the rules as written say -- if anything -- about this circumstance?  According to RAW, is it possible to attempt an ability check and intentionally fail?


So I've been wanting to jailbreak for about a good 3 years now (Yes, I am a failure) and have found it near impossible to jailbreak ios 6.1.6 . Now, I have an iPod4 with ios 5.1.1 (but it is my sisters) and I will be able to create the shsh blobs.    So after admitted defeat of trying to jailbreak ios 6.1.6, I thought of downgrading to ios 5.1.1 and jailbreaking. But this is not a great idea as most of my apps run on IOS 6.  To make a long stoy short, how do I downgrade to ios 5.1.1 then upgrade to 6.0 but not 6.1.6?  Thank you for your time and consideration.   BTW: I don't have SHSH blobs for IOS 6.0 BTW: If you could include a way to get the SHSH blobs off the Ipod4 it would be helpful.

I'm trying to downgrade my iPhone from the current iOS to an older one, as per .  But every time I try, I always receive this error:     The iPhone could not be restored. This device isn't eligible for the requested build.     I have tried many times with and without DFU mode. Any ideas regarding this?


This is the table containing hytags_hyobjects that are tagged with hytags_tags                                                 Table "public.hytags"        Column        |            Type             | Collation | Nullable |                  Default                   ---------------------+-----------------------------+-----------+----------+-------------------------------------------  hytags_id           | integer                     |           | not null | nextval('hytags_hytags_id_seq'::regclass)  hytags_datecreated  | timestamp without time zone |           | not null | CURRENT_TIMESTAMP  hytags_datemodified | timestamp without time zone |           |          |   hytags_usercreated  | text                        |           | not null | CURRENT_USER  hytags_usermodified | text                        |           | not null | CURRENT_USER  hytags_hyobjects    | integer                     |           | not null |   hytags_tags         | integer                     |           | not null |   hytags_description  | text                        |           |          |   I would like to get hytags_hyobjects having all of the tag integers, such as 1, 2, 3 in hytags_tags where those values come from multiple rows. Selecting those that have either one of the tags is easy. I am looking to select those hytags_hyobjects which have all of the tags assigned.

I've asked the same question on , but got no answer, so that's why I'm asking it here (I've read that simple sql questions should be asked at SO, but I have no choice).  Suppose I have 3 tables: posts, post_categories and categories. I'm implementing some kind of page with filters where I can filter posts by categories. User can select multiple categories. When he selects more than one, they should be summed. I can't get it working. What I have now is simple IN() SQL clause:  SELECT posts.id, post_categories.category_id FROM posts  JOIN post_categories ON posts.id = post_categories.post_id  WHERE post_categories.category_id IN (1,2,3) LIMIT 10;   But it is not matching all ids, it is OR and I need AND. What I need here is to find all posts that have categories with id=1 AND id=2 AND id=3, but instead this query returns posts that have at least one category from the IN() list.


I use an iMac as a nice large external display for a laptop on occasion. However swapping between the external input and the OSX desktop view means I can't view both at the same time (Cmd+F2).  I wonder if it is possible to have that external display viewed inside an app's window (sort of picture in picture, with the normal OSX desktop displayed at the same time).  Any ideas if this is even feasible, and if so, what solutions may exist?   Late 2009 27" iMac

Recently (less than one year ago) i bought an iMac 21,5". Now i would like to use it as secondary monitor for my laptop. (My laptop runs Windows 7).  Is it possible? (I found conflicting opinions on the web, even on the Apple forum).  What type of cable do I need? (I will appreciate also a link to the product on some online store: amazon, ebay etc.)  Thank you in advance.  UPDATE:  I tried air display... i'm not satisfied at all...  typical scenario: browser window on the main Windows laptop, dev tools/firebug on the secondary iMac screen. The mouse goes fast between the 2 screens (GOOD), but when i changed the selected tab nothing happens. I had to drag the dev tools window to the main screen to get an update of the selected tab.  My test is ended here.  I'm still waiting for other answers.   I will prefer an answer that suggest me what kind of cable i've to buy, and where i can find it on the web.


What does the symbol $\Bbb C\setminus\{0\}$ mean? Here, $\Bbb C$ is the domain of complex numbers and the context is showing complex numbers follow pretty much the same rules as real calculus.

I have a question that uses the following notation: the function $f: \mathbb{R} \setminus\{3\} \to\mathbb{R}\setminus\{2\}$ is defined by $$f(x)=\frac{2x-3}{x-3}.$$  I understand that the left side specifies the domain of the function, and the right side specifies the codomain of the function.  However, the notations "${}\setminus\{3\}$" and "${}\setminus\{3\}$" seem to me confusing.  Any help in clarifying this would be greatly appreciated.


Since the Triwizard Tournament is the biggest competition in the wizard world, why would it be so easy for someone to bewitch it?

We know that the Triwizard cup itself was Summonable. After all, Harry did Summon it in the graveyard.  So why didn't any of the contestants Summon it while in the maze?  Canonical answers, please.


What is this fallacy? I see it all the time. Someone will say something like “it’s so good to see these animals released from captivity” and then another will reply with a response along the lines of... “so you care about animals in captivity but not about the millions of slaves in Africa” or something. They reply like you can only care about one or the other and not both. But also, the initial comment is relevant to the context and so progresses the conversation while the response seems completely unrelated.

Wasn't really sure how to phrase this, but I'm thinking of an instance in which someone diminishes a problem by presenting one of larger scope - as a rather shoddy example, "x political problem in America doesn't matter because half the world's population is starving."  I honestly have no idea if this is considered fallacious or not, but for some odd reason I can't shake the feeling that someone has described it to me as a fallacy before. Am I crazy or is there something to this (or something similar)?


I am working on some basic problems involving rings and am getting confused.  If I have a ring $\mathbb{Z}_2 \times \mathbb{Z}_4$, would this just be all elements $(a,b)$ such that $a \in  \mathbb{Z}_2$ and $b \in \mathbb{Z}_4$ or am I mistaken?  I'm then trying to find zero-divisors and units in this ring.  How would I go about doing this?  Thanks

How do I exactly find the zero divisors and units of a ring in the form of $\mathbb{Z}_n \times \mathbb{Z}_m$? For instance, how does one calculate zero divisors and units of $\mathbb{Z}_6 \times \mathbb{Z}_2$? I understand that a zero divisor is a non-zero element of $R$ such that $rs = 0$ for some other non-zero element $s$ in $R$. But I don't really quite understand how to apply that to a ring of the form $\mathbb{Z}_n \times \mathbb{Z}_m$. Also, the units of $\mathbb{Z}_6 \times \mathbb{Z}_2$ would be elements that send some element $s$ in $\mathbb{Z}_n \times \mathbb{Z}_m$ to the multiplicative identity, right? (which would be 1)? How do I apply these concepts to "product" rings? Thank you.


I am having my machine installed with Ubuntu 14.04 LTS desktop version. but now I need Ubuntu server edition. can I integrate both or else should I replace my desktop version with server edition . please help me

Alright, so due to problems connecting to a wifi network on the ubuntu server distribution, i want to install the neccesary packages for a lamp, mail and ssh server on an ubuntu desktop 14.04 lte distribution(i am able to connect to the internet with the desktop version).  what should i install from the command line?  Thanks in advance!


In elementary school, I was taught the rhyme:     "i" before "e" except after "c", and in words like "neighbor" and "weigh"   Obviously this means that "ei" is used in "deceive" (it comes after "c") and "sleigh" ("gh" follows it).     The word "weird" does not follow this rule, and I have always thought that to be weird (please pardon the pun).  It has neither a "c" nor "gh", so why does it have this "ei" vowel combination instead of "ie"?    While writing this post, I noticed that "neither" also disobeys the rule, just like "weird".  At first, I thought that maybe the "English gods" thought it would be a funny meta-joke to let "weird" have a weird spelling (like how "awkward" awkwardly has a "k" surrounded by two "w"s), but apparently there are other words as well!

I almost hesitate to ask this, because it is hard to believe no one else asked it; but it isn't showing up in the "similar titles" list.  What is special about 'C' that switches the 'IE' immediately following it?


I know that if I know the marginal distributions, that's not enough to specify the joint distribution. But obviously it can't be "any" joint distribution, it still needs to respect its marginal requirements. So what do they look like?  For example, say I have the following "marginal requirements":   $X \sim N(0, 1), Y \sim N(5, 10)$ $\text{Corr}(X, Y) = 0.5$   Now, I know that 1 distribution for $(X, Y)$ satisfying these requirements is a multivariate normal distribution. But what are the other distributions? What is the "set" of distributions that can be used as a joint distribution for these marginal requirements? What do they look like? Do they have a specific "form"? What can I say about the density?  Are any of these questions answerable?

Somebody asked me this question in a job interview and I replied that their joint distribution is always Gaussian. I thought that I can always write a bivariate Gaussian with their means and variance and covariances. I am wondering if there can be a case for which the joint probability of two Gaussians is not Gaussian?


I have a great script that I use to convert encoding in srt.files.  I also created an alias for that script so I can enter the directory where I want to run the script and use my alias konvert.  However, I have now the the following scenario: more then 20 directories with srt.files inside. What should I do in order to point my script to all those directories with just one command?  Luckily all these directories are together inside one main directory, so I believe there should be an easy way to do this.   Content of the script  #!/bin/bash for file in *.srt; do iconv -f CP1250 -t UTF-8 -o "$file".utf "$file" && mv "$file".utf "$file"; done

Trying to perform a recursive chmod on all the .sh files in a directory to make them executable


Often, there are only one or two items in the First Posts and Late Answers review queues. I open one queue, go through both items, and then go to the other queue. I am then confronted with the same answer I just reviewed. Is this intentional, or not often enough to matter, or a bug?

I have noticed it is not uncommon for new users to post short, sometime barely related, answers to questions that are more than a year old.    Obviously if it should be a comment, is spam, or is not related at all, it should be dealt with accordingly, but I'm more interested in getting feedback on answers that don't necessary address the question but might be related.  Had it been posted at the time the question was first asked, it would have received enough attention to be fixed or clarified at that time, but since it is on an old question, the OP may no longer be around and/or the question does not have enough attention anymore to have the community deal with it.  The best example I ran into today is .  So this question is barely related to the original question.  But I can make an argument that it might be helpful to someone in the future because it does suggest a potential solution to a similar problem.  However it doesn't address the OP's question, especially since the OP accepted an answer that is not related to this late answer.  What is the correct method for dealing with such a response:   Do we flag it as "not an answer" Should this be downvoted since it doesn't answer the OP's question, even though it might be technically accurate. Or is something like this perfectly acceptable as an answer?   To clarify, I'm trying to get some feedback/guidance on where is the line (or gray area) between "Not an Answer" and a bad (downvote worthy) answer.  How related (or unrelated) to the original question does it need to be before "Not an Answer" becomes a better option.


Let's say I have some of links that I want to add a javascript action to:       When my page loads I give them all a click event:  $('.test').click(function(){   alert("I've been clicked!") });   but let's say afterward I add another element and I want to give it the same event. I can't do this:  $('.test').click(function(){   alert("I've been clicked!") });   because then the first 3 will have 2 events on them. What's the best way to deal with this?

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


Java newbie here, I'm experimenting with some simple code using NetBeans. The program simply takes in a few strings into an Array of a predetermined length, while not allowing the previously used ones to be added.  String[] AnArray = new String[3];  for (int i=0; i<AnArray.length; i++) {     System.out.println("Insert a string:");     Scanner s = new Scanner(System.in);     String astring = s.next();     for (String AnArray1 : AnArray) {         if (astring.equals(AnArray1)) {   /* THIS IS WHERE I CHANGE astring.equals(AnArray1) TO astring == AnArray1   */              System.out.println ("String already used");              break;         }         else             AnArray[i] = astring;         }  }     for (String AnArray1 : AnArray) {     System.out.println(AnArray1); }   If the string was already used, it should print out a message "String already used" and not add it, leaving the field empty (null).   If I use .equals, it works correctly (well, as I expect it to). However, if I use '==' it prints out the message, but still adds the (already used) string to the Array.   Note: All advice is appreciated, but I'd be most grateful for an explanation as to HOW/WHY this IS happening (as opposed to what I should do to improve my code).  EDIT: I don't see how this is a duplicate. If someone can paste the relevant part of the answer to my question, I would be grateful. My question is: since the condition is True in BOTH cases (using == or .equals) why does the .equals() follow the break command while == triggers else AS IF it's ALSO false?

I've been using the == operator in my program to compare all my strings so far. However, I ran into a bug, changed one of them into .equals() instead, and it fixed the bug.  Is == bad? When should it and should it not be used? What's the difference?


Is this journal a legitimate one with impact factor or is it a fraud?

What are the best strategies for assessing if a journal is a "vanity" or "predatory" journal that should be avoided (both for publishing in and reviewing for)? For example, how would one go about determining if a journal/publisher belongs on ?


we want to tar.gz all the following jars files  2.6.4.0-91/spark2/jars/super-csv-2.2.0.jar 2.6.4.0-91/spark2/jars/univocity-parsers-2.2.1.jar 2.6.4.0-91/spark2/jars/validation-api-1.1.0.Final.jar 2.6.4.0-91/spark2/jars/xbean-asm5-shaded-4.4.jar 2.6.4.0-91/spark2/jars/xercesImpl-2.9.1.jar 2.6.4.0-91/spark2/jars/xmlenc-0.52.jar 2.6.4.0-91/spark2/jars/xz-1.0.jar 2.6.4.0-91/spark2/jars/zookeeper-3.4.6.2.6.4.0-91.jar   so I do the following   cd /var/tmp tar -czvf archive.tar.gz /usr/hdp/2.6.4.0-91/spark2/jars   but when I do  tar xvf archive.tar.gz   we get the usr folder  usr    while the expected results should be only the jars as ( without the sub folders )       super-csv-2.2.0.jar     univocity-parsers-2.2.1.jar     validation-api-1.1.0.Final.jar     xbean-asm5-shaded-4.4.jar     xercesImpl-2.9.1.jar     jxmlenc-0.52.jar     xz-1.0.jar     zookeeper-3.4.6.2.6.4.0-91.jar   what is wrong with my syntax   cd /var/tmp  tar -czvf archive.tar.gz /usr/hdp/2.6.4.0-91/spark2/jars

Under my current directory, I have two sub-directories:  dir_1/    - file1.png    - file2.png    ...    - fileN.png  dir_2/    - fileA.txt    - ...    - fileZ.txt   When I tar compress the two directories by :  tar -cvzf result.tar.gz dir_1/ dir_2/    I got result.tar.gz but it maintains the directory structure. I mean when I extract the result.tar.gz, I got dir_1 & dir_2 again.  How can I tar compress so that the directory structure is not remained, which means when I extract the tar.gz file, I only get files   result/    file1.png     ...     fileN.png     fileA.txt    ...    fileZ.txt


the below code had previously printed the fibonnacci using for loop at end.  I moved the print inside the function and then called it but no fibonacci nubers were printed out in spite of the print within the function.  Shouldnt they be?     def fibon(n):        a = b = 1        for i in range(n):            yield a            a, b = b, a + b            print(a)  # move here inside function but doesnt print?     fibon(20)   old code works as:     for x in fibon(100):         print(x)

What is the use of the yield keyword in Python? What does it do? For example, I'm trying to understand this code1: def _get_child_candidates(self, distance, min_dist, max_dist):     if self._leftchild and distance - max_dist < self._median:         yield self._leftchild     if self._rightchild and distance + max_dist >= self._median:         yield self._rightchild    And this is the caller: result, candidates = [], [self] while candidates:     node = candidates.pop()     distance = node._get_dist(obj)     if distance <= max_dist and distance >= min_dist:         result.extend(node._values)     candidates.extend(node._get_child_candidates(distance, min_dist, max_dist)) return result  What happens when the method _get_child_candidates is called? Is a list returned? A single element? Is it called again? When will subsequent calls stop?   1. This piece of code was written by Jochen Schulz (jrschulz), who made a great Python library for metric spaces. This is the link to the complete source: [Module mspace][1].


I am trying to investigate the convergence of the series: \begin{equation} \sum_{n=1}^{\infty} \bigg ( 1 -\frac{1}{\sqrt{n}} \bigg )^n. \end{equation} According to the Mathematica, the series converges, but I am unable to come up with a series with which I can compare the series above etc. Any leads would be appreciated.

I believe there are several ways to prove that $\sum\limits^{\infty}_{n=1}\left(1-\frac{1}{\sqrt{n}}\right)^n$ converges. Can you, please, post yours so that we can learn from you?  HERE IS ONE   Let $n\in\Bbb{N}$ be fixed such that $a_n=\left(1-\frac{1}{\sqrt{n}}\right)^n.$ Then, \begin{align} a_n&=\left(1-\frac{1}{\sqrt{n}}\right)^n \\&=\exp\ln\left(1-\frac{1}{\sqrt{n}}\right)^n\\&=\exp \left[n\ln\left(1-\frac{1}{\sqrt{n}}\right)\right] \\&=\exp\left[ -n\sum^{\infty}_{k=1}\frac{1}{k}\left(\frac{1}{\sqrt{n}}\right)^k\right]\\&=\exp\left[ -n\left(\frac{1}{\sqrt{n}}+\frac{1}{2n}+\sum^{\infty}_{k=3}\frac{1}{k}\left(\frac{1}{\sqrt{n}}\right)^k\right)\right]\\&=\exp \left[-\sqrt{n}-\frac{1}{2}-\sum^{\infty}_{k=3}\frac{n}{k}\left(\frac{1}{\sqrt{n}}\right)^k\right]\\&\equiv\exp \left(-\sqrt{n}\right)\exp \left(-\frac{1}{2}\right)\end{align} Choose $b_n=\exp \left(-\sqrt{n}\right)$, so that  \begin{align} \dfrac{a_n}{b_n}\to\exp \left(-\frac{1}{2}\right).\end{align} Since $b_n \to 0$, there exists $N$ such that for all $n\geq N,$ \begin{align} \exp \left(-\sqrt{n}\right)<\dfrac{1}{n^2}.\end{align} Hence, \begin{align}\sum^{\infty}_{n=N}b_n= \sum^{\infty}_{n=N}\exp \left(-\sqrt{n}\right)\leq \sum^{\infty}_{n=N}\dfrac{1}{n^2}<\infty,\end{align} and so, $\sum^{\infty}_{n=1}b_n<\infty\implies \sum^{\infty}_{n=1}a_n<\infty$ by Limit comparison test.


\documentclass{amsart}  \usepackage{graphicx}    %and others  \begin{document}  \title[short title]{Title}  %how to make the title^*  \author[Nguyen Thi Hong]{ Nguyen Thi Hong \textsuperscript{1**}}  \address{\textsuperscript{1}Faculty of Mathematics and Physics, Charles University. Prague, Czech Republic.}  \email{nguyenhonglove@gmail.com}  % i'd like to have the address placed here  \keywords{keyword1, keyword2, keyword3, ...}  \begin{abstract} Abstract..... \end{abstract}  \maketitle   %prints out Title, Author and Abstract (all in smallcaps)  %here is the contents, several pages of text  %introduction, main part, conclusion %in the first page, in footnotes I want to have before ** Email: nguyenhonglove@gmail.com  \begin{thebibliography}{99} %references \end{thebibliography}   \newpage \begin{appendix} %lots of figures \end{appendix} \end{document}

When I use the following code for the title page of a paper (please see below), the authors' addresses and emails appear on the last page of the paper. However I need them to appear on the first-title page (after the authors' names before the abstract). How can I do this?  \documentclass [reqno, 12pt ]{amsart} ... \begin{document}  \title[paper]{Nice paper}  \author{Me} \address{University} \email{mmm@lala.com} \thanks{.} \author{my friend} \address{Institute} \email{kkk@lala.edu} \thanks{.}  \date{\today} \keywords{XXX }  \begin{abstract} Lalala \end{abstract}  \maketitle


I've got an odd problem with a machine that has a old windows XP installed on it (changing the OS is sadly not possible for that machine).  The hard drive is a 90 GB drive (84 useable). So far so good.  Now when I tried to clean up the contents I enabled seeing all hidden files in the windows explorer, made a clean hard drive command on the hard drive properties and then went through all the main folders in c:\ and noted down the sizes to see where I could best get started.  So far so good with only one exception......the hard drive says that 11,7 GB of space are used (properties) but I only come up to 9,52 GB including the pagefile in C:\ when I mark all in C:\ and use properties) as 72,3 of the 84,0 GB are empty.  So my question is where could those 2,18 GB of missing disk space be at? (already did a chkdsk but it came up inconclussive and I'm running out of ideas now because of that)

On my mother's Lenovo laptop, Windows XP claims that the hard drive is almost full. According to the properties window, 52.7 out of 55.2 GB is in use:    By deleting temp files from Internet Explorer, System Restore, Recycle bin, Windows Update, System Cleanup, I managed to free up about one GB. That's still > 50 GB in use, which still is a lot more than I expected. Hence, I gave good old  a spin, and here's the output:    It might be hard to read here, but the first line says that the total amount of disk space in use on drive C is 24.3 GB. So Windows claims usage of 52.7 GB and WinDirStat can only account for 24.3 GB. Where is the other half of that disk space being used?  I hope someone has an answer, or some tricks or tips to do further research.    UPDATE: The laptop in question has an SSD hard drive. I am aware that these disk (at least the earlier ones) have a limited life-time. Could the symptoms described be caused by wear and tear on the SSD?


It seems to me that although "plausible explanation" shares the same meaning with "reasonable explanation", the latter is a bit more positive than the former. What is my reason at this? Compare: "a plausible man" and "a reasonable man"(or "a man of reason") - the latter is positive while the former is tending to be negative, because the former just appears to be honest and telling the truth even if they are not. I am not absolutely sure. Though Oxford Dictionaries defines "plausible" as "reasonable" - which is statistically correct, one may feel quite differently when reading Cambridge Dictionary's definition "plausible: seeming likely to be true, or able to be believed" - which is much less positive than "reasonable." Is "plausible explanation" indeed a bit less positive than "reasonable explanation"?  plausible (of an excuse or explanation) reasonable and likely to be true Her story sounded perfectly plausible. The only plausible explanation is that he forgot.  Source: Oxford Dictionaries

He says, "It is plausible if you put all these things together, you will get a good result."   Can I use "reasonable" instead of "plausible"? Are there any significant difference between them?


Let $f: X\rightarrow Y$ be a map  Show that for any subset $C\subseteq Y$, one has  $f^{-1}(Y\setminus C) = X \setminus f^{-1}(C)$  In this case $f^{-1}$ refers to preimage  I started off with trying to show $f^{-1}(Y\setminus C) \subseteq X \setminus f^{-1}(C)$  Let $ x\in f^{-1}(Y\setminus C) \Rightarrow x \in f^{-1}(Y), x\notin f^{-1}(C)\Rightarrow x\in X, x\notin f^{-1}(C) \Rightarrow x\in X \setminus f^{-1}(C) \Rightarrow f^{-1}(Y\setminus C) \subseteq X \setminus f^{-1}(C) $  Then I tried to show $f^{-1}(Y\setminus C) \supseteq X \setminus f^{-1}(C)$  Let $ x \in X\setminus f^{-1}(C) \Rightarrow x \in X, x \notin f^{-1}(C)$ and since $ C \subseteq Y$ ,if $ x\notin f^{-1}(C)$ , $x$ must be in $f^{-1}(Y\setminus C)$ , so $f^{-1}(Y\setminus C) \supseteq X \setminus f^{-1}(C)$.  Could anyone tell me if this is the correct way to answer this question? It almost seems like I'm repeating the same argument and it looks too simple. Would appreciate if anyone could point out any mistakes or if i should be more vigorous in my working. Thank you!

Let $A,B,C$ be sets such that $C\subseteq B$. Let $f: A \to B$ be a function.  Prove that $f^{-1} (B\setminus C)=A\setminus f^{-1} (C).$   I really need help with this proof problem. I'm not sure where to begin or what strategy to consider using.


Yesterday I wanted to increase my home directory size as I constantly got notified about critical amount of space. Firstly, as suggested in many topics, I wanted to do external back up of my system, so according to  I did:  sudo tar czf /media/external-disk/backup.tar.gz --exclude=/backup.tar.gz --exclude=/dev --exclude=/mnt --exclude=/proc --exclude=/sys --exclude=/tmp --exclude=/lost+found --exclude=/media /   Unfortunetely, after an hour of creating a back up the process ended in some error (I don't remember the exact notice but it wasn't very informative). So I decided to gave it up for yesterday and try again today's morning. Unfortunetely, when I open my laptop today Ubuntu doesn't boot at all:  The second message is something that used to pop out earlier, but usually there wary many lines of this message - now it's a one line back and back again. The first message (recovering journal) is something new though. How can I check why my Ubuntu doesn't boot up now? What might have gone wrong while backing up? How can I fix it now?  @Edit: I also installed Nvidia 4.30 driver yesterday, although I had a newer one (4.40) already installed. After that I restarted computer and Ubuntu booted without any problems, but maybe this is a reason behind my issue?

dev/sda1: clean, 552599/6111232 files, 7119295/24414464 blocks   After I turn on my laptop this message appears. The system never boots, the message just stays there.


I have the sum $$\sum_{i=0}^n i\cdot a^i$$ and according to wolframalpha, the partial sum evaluates to  $$ \frac{a (n\ a^{n + 1} - (n + 1) a^n + 1)}{(a - 1)^2}.$$ How does one arrive at the above formula? The usual trick of expanding the sum and subtracting partial sums to arrive at a closed form doesn't seem to work here.

claims: $$\sum_{n=0}^m n x^n = \frac{(m x - m - 1) x^{m + 1} + x}{(1 - x)^2} \tag{1}$$ I know that one can differentiate the geometric series to compute $(1)$ when it is a series, i.e. $m=\infty$. However, I'm wondering how the closed form for the partial sum is obtained. Actually, WolframAlpha gives an explicit formula for $$\sum_{n=0}^m n(n-1)(n-2)\cdots (n-k)x^n \tag{2}$$ where $k$ is an integer between $0$ and $n-1$, so it seems that there are some differentiation involved. But already for $k=5$, the formula becomes .   My question: How to prove $(1)$ and how to build a similar formula for $(2)$ assuming $k$ is given?


I am wondering whether it is generally possible to change engineering specialisations after completing a bachelors degree.  I'm currently completing a bachelor of engineering with honours in chemical and materials engineering. I am interested in completing a master's in aerospace engineering as I have a significant interest in aspects of jet propulsion.  I feel there would be a lot of transferable skills which may help me - i.e. thermodynamics, fluid mechanics, pumps and turbines, heat transfer, and materials; although they would be applied in a different context.  I guess my question is, as long as there are some transferable skills to your field of research, can one change specialisation without significant difficulty at the postgraduate level?

Can I be admitted to graduate school in a different field from my degree?  Specific cases include:   If I've taken plenty of advanced courses in field X in the process of completing a degree in another field, can I apply to graduate school in X? What if I haven't taken many courses in X, but I have acquired a good grasp of X through self-study or working in a related field? What if I've never studied X, but I have done very well in an unrelated field?  Could I be admitted to graduate school in X on the basis of general intellectual promise, and then make up the missing background after enrollment?   Note that this question is an attempt to provide a comprehensive answer, to avoid the need for a profusion of field-specific questions on this topic (see the associated ). Please feel free to edit the question or answer to improve them.


Say, I want to publish a research paper. But, for some reason, I don't want to expose my identity. Is it possible to publish a research paper using an alias?

I would like to start publishing scientific papers soon. This issue pertains to the name I will use when publishing.   Basically, I would like to keep my personal and academic life separate and my question is "how can I do this?".   To make it clearer why I want to do this, I'll mention that my current legal name is associated with a certain subculture which is quite unconventional. I want people searching/Googling my professional name to only be exposed to my "academic identity", and people searching for my legal name to only be exposed to my "social identity". There is nothing illegal going on. I'll give an example which is close to reality but I'll refrain from giving exact information. The example is that my "social identity" is an author of erotic novels while my "academic identity" writes papers in mathematics. That's not too far from the reality. I would assume I am not the first one to have unconventional interests outside academia, the issue I guess is that my legal name is already tied to such an interest, which is a problem. And yes, this is quite amusing; feel free to laugh  I would be thankful for any ideas which would allow me to fulfill both my passions, despite their disharmony.  Basically, I don't want the names to mix together when someone searches for one of them, but I still want to be able to prove that I wrote the papers (in case I want to use them when applying for a job or for grad school). Hopefully there is some way to achieve this.  Other creative ideas to solve this issue are always welcome; maybe I am focusing too much on the name thing and there are other solutions.    I'll wrap this up with some ideas that I had:   I could just use a pen name for my academic papers I guess. I have finished my BSc lately. Problem here is that if I later want to apply to grad school, and I want to show that I have published papers, it could be hard to prove that I have written them (will it? maybe I'll have a pen-name on the papers but prove ownership by other means? like the email address on the paper?). I could use a different spelling of my legal name on the papers (my legal name is not in English anyway, though I graduated from an English speaking university so my BSc has my name in English). That seems like they could still be linked relatively easily though and one could potentially show up when someone Googles the other name. I could take on a new middle name (e.g. I could use a variation of my late grandfather's name, which I would gladly do) and use that as the first name in published papers (that seems like it could potentially work).   Some more comments   My last name is very common; my first name is very uncommon I am aware of course that if I go to grad school they'll probably Google my legal name as well, and of course people who know me personally would be aware of what I do. It would be nice to limit it to those scenarios though.  Yes, I know I should have thought of this before linking my legal name to unconventional topics. I did not tell the whole story though and there was a reason for that.


When I look at a glass block at an angle the edges appear green, but when I look at the edge sideways, so that is directly in front of my eyes it appears transparent. Why?

When I view most glass from the side it's green which I've found out is due to impurities in the glass specifically from iron oxide. Why is it when I view the larger face from an oblique angle, it isn't nearly as green? I cannot personally notice any different on the piece I have next to me even when I hold it at an angle that would be almost looking at the edge of the glass. It is pretty small (about 2.5" x 5" x .0625" or about 61mm x 127mm x 2mm, l x w x h) but I feel like it's big enough that I'd be looking through enough glass to get the green.