I joined stackoverflow the other day with the ID . Could these two accounts be merged, preferably the newer one being preserved and the questions from this one being migrated?
I accidentally posted a question without being logged in. Is there a way to associate that question with my account?   For more information, visit &quot;&quot; in the .   a.k.a. How can you link a registered account to a cookie-based account? a.k.a. How do I merge an unregistered account with a registered account a.k.a. Merging users a.k.a. How do I associate anonymous questions I’ve asked with my registered account? a.k.a. Is there a way to claim an unregistered user? (in case anyone searches with those terms)
How to use early stopping properly for training deep neural network? I have a deep neural network model and I need to train it on my dataset which consists of about 100,000 examples, my validation data contains about 1000 examples. Because it takes time to train each example (around 0.5s for each example) and in order to avoid overfitting, I would like to apply early stopping to prevent unnecessary computation. But I am not sure how to properly train my neural network with early stopping, several things I do not quite understand now:   What would be a good validation frequency? Should I check my model on the validation data at the end of each epoch? (My batch size is 1) Is it the case that the first few epochs might yield worse result before it starts converging to better value? In that case, should we train our network for several epochs before checking for early stopping? How to handle the case when the validation loss might go up and down? In that case, early stopping might prevent my model from learning further, right?   Thank you in advance. I am currently facing a "performance problem" while using grep. I am trying to locate the occurrences of many (10,000+) keywords in many (think Linux kernel repository size) files. The objective is to generate a kind of index for each keyword:   keyword: my_keyword filepath 1 filepath 2 ------ keyword: my_keyword2 ...   Being fairly new to shell scripting, I have tried a few naive approaches:  while read LINE; do     echo "keyword: "$LINE &gt;&gt; $OUTPUT_FILE     grep -E -r --include='Makefile*' "($LINE)" . &gt;&gt; "$OUTPUT_FILE"     echo "-----" done &lt; $KEYWORD_FILE   This takes about 45 minutes to complete, with the expected results.  Note: all they keywords I search for are located in a file ("KEYWORD_FILE", so fixed before anything starts), and the files in which to search can be determined before the search starts. I tried to stored the list of files to search in before the search like that:  file_set=( $(find . -name "Kbuild*" -o -name "Makefile*") )   and then replace the grep call by  echo {$file_set[*]} | parallel -k -j+0 -n 1000 -m grep -H -l -w "\($LINE\)" &gt;&gt; "$OUTPUT_FILE"   It takes about an hour to complete&hellip;  Question: considering I can use whatever technique I want, provided it's sh compliant, how can this be done "faster" and/or more efficiently ?  Perhaps grep is not the tool to use, and my use of parallel is wrong&hellip; any ideas are welcome! I’ve had a good look and can’t seem to find out how to select all elements matching certain classes in one jQuery selector statement such as this:  $('.myClass', '.myOtherClass').removeClass('theclass');   Any ideas on how to achieve this? The only other option is to do  $('.myClass').removeClass('theclass'); $('.myOtherClass').removeClass('theclass');   But I’m doing this with quite a few classes, so it requires much code. I don't understand how to use Fermat's little theorem to find remainders e.g if we are asked to find remainder of $50^{50}$ on division by $13$, what is a and what is $p$ in the formula?  Also I wanted to check can we use both congruence classes as well as Fermat's little theorem to find such remainders? How would be write $50^{50}$ on division by $13$ in terms of congruence classes to find the remainder?  I don't exactly understand what a congruence class is, what does it tell us and how is it related to this? I would like to label an equation with an arbitrary symbol, rather than a number, or letter.  Is this possible? Is it possible to run Snow Leopard on a LATE 2011 MacBook Pro? I want to buy a new MacBook Pro, from Apple. However I want to run Snow Leopard instead of Lion.  I did some Google searches and found a few success stories of people who got SL to run on their early-2011 MBPs. I didn't find much of any experiences of people doing the same on a late-2011 MBP though, so I'm wondering (and really hoping!) if it's possible? I gave a scammer my telephone number, address, and name. How bad is it? Updated question because old one was embarassing: I saw a spam email from "PayPal" and I didn't realize that it was a phishing attempt. I gave the phishing site my name, telephone number, and email. What could he do with them?  Old question: Well, I saw a spam email, but I didn't realize that it's really a scam at first. I gave him my telephone number, address, and name. What would he do with them? Could he ruin ALL of my reputation with it? Getting attributes of Enum's value Can I move the Unity launcher? Are features that allow −5 to attack to get +10 to damage mathematically sound? Some class features, monster traits, and feats allow you to take a −5 to your attack roll in order to gain a +10 to your damage roll. At first glance this looks really good, but when will it deal more damage than not using it on average?  For instance if you have a total attack bonus of +8 and you deal 1d12 damage. You have to roll a 7 to hit an AC of 15. If you take the −5 that makes it where you have to roll a 12. That's going to reduce your average damage by a lot. Style every four posts differently Does $\pi$ contain all possible number combinations? I came across the :    Which states:     $\pi$ Pi      Pi is an infinite, nonrepeating $($sic$)$ decimal - meaning that   every possible number combination exists somewhere in pi.  Converted   into ASCII text, somewhere in that infinite string of digits is the   name of every person you will ever love, the date, time and manner    of your death, and the answers to all the great questions of    the universe.   Is this true? Does it make any sense ? In the last episode of season 7, The Doctor goes into his timeline to save Clara. It ends when they see his war regeneration and Clara faints. Did I miss a special episode between that one and the 50th anniversary special? Because they never explained how they escaped his timeline. Can we clarify to the OP that their question is not yet closed and the duplicates are only suggestions? I keep seeing custom flags in the queue from question askers who are incredibly irritated because there is a big, prominent box at the top of their question. It's just a list of other questions which may have the answer they desire, and is only even displayed to them because the question is not closed yet.  This question may already have an answer here: [list]  But to an ordinary user, it is not at all clear that the box is only shown to them, or that it will go away on its own if their question never actually gets closed. Could the text for this notice be altered to make it more clear that:  They are just suggestions for the person to view. Potentially if they agree with one, they should vote to close their own question as a duplicate of it.  Their question is not closed yet. If they disagree with the duplicates suggested, they should clarify their question and explain why it's not a duplicate.   I was thinking of an altered wording such as:  You might be able to find an answer to your question here: [list] If those answers do not fully address your question, please [edit your question] to clarify your exact problem.  I went with a more direct wording for the bolded title. Since the notice is only displayed to the asker, it makes more sense to talk directly to them in the message rather than making it feel like it's supposed to be addressing the entire audience of the site. Emphasize that only that person is seeing it by talking to them. It would also be helpful to append a &quot;More info&quot; link at the end of the message that links them to some further documentation about duplicates, and explains how the notice works - particularly that it will go away eventually or change to a proper duplicate notice if the question does get closed. Seeking GeoServer tutorials? What are sources where I can learn how to use GeoServer?  I know of these two sites:    - which in fact is not working (at least at the moment)  - not only (tutorials) for GeoServer   But I am interested in more complex information, and not to read only documentation. Im trying to run the following code  \documentclass[border=10pt]{standalone} \usepackage{pgfplots} \pgfplotsset{width = 7cm, compat = 1.8} \begin{document} \begin{tikzpicture} \begin{axis}[domain = -2:2, domain y = 0:2*pi] \addplot3[contour gnuplot = {output point meta = rawz, number=10, labels=false}, samples = 41, z filter/.code=\def\pgfmathresult{-1.6}] {exp(-x^2) * sin(deg(y))}; \addplot3[surf, samples = 25] {exp(-x^2) * sin(deg(y))}; \end{axis} \end{tikzpicture} \end{document}   and I'm getting the error  Package pgfplots Error: sorry, plot file{Utitlled_contourmp0.table} could not be opened   through a quick search I found out that contour maps require pgfplots and gnuplot to talk to each other. In theory the way to make them interact is adding  !TEX option = --enable-write18   or   %!TEX option = --enable-escape   at the top of the file. Unfortunately this has not worked for me. Any suggestions? What does Use an Object cover? Unix epoch time to Java Date object I have a string containing the , and I need to convert it to a Java Date object.  String date = "1081157732"; DateFormat df = new SimpleDateFormat(""); // This line try {   Date expiry = df.parse(date);  } catch (ParseException ex) {   ex.getStackTrace(); }   The marked line is where I'm having trouble. I can't work out what the argument to SimpleDateFormat() should be, or even if I should be using SimpleDateFormat(). Show that quotient rings are not isomorphic I've been given a homework problem that requires me to show that the rings $\mathbb{C}[x,y]/(y - x^2)$ and $\mathbb{C}[x,y]/(xy-1)$ are not isomorphic.    This is my attempt at a solution:  For $\mathbb{C}[x,y]/(y - x^2)$, we can parametrize in the following way: $x = t$ and $y = t^2$. Then this ring is isomorphic to $\mathbb{C}[t]$.  For $\mathbb{C}[x,y]/(xy-1)$, we can parametrize $x = t$ and $ y = 1/t$. Then this is isomorphic to $\mathbb{C}[t, 1/t]$.   But $\mathbb{C}[t, 1/t]$ is not isomorphic to $\mathbb{C}[t]$.  Am I on the right track? If not, any helpful hints? What is the difference between a neural network and a deep neural network, and why do the deep ones work better? I haven't seen the question stated precisely in these terms, and this is why I make a new question.  What I am interested in knowing is not the definition of a neural network, but understanding the actual difference with a deep neural network.  For more context: I know what a neural network is and how backpropagation works. I know that a DNN must have multiple hidden layers. However, 10 years ago in class I learned that having several layers or one layer (not counting the input and output layers) was equivalent in terms of the functions a neural network is able to represent (see Cybenko's ), and that having more layers made it more complex to analyse without gain in performance. Obviously, that is not the case anymore.  I suppose, maybe wrongly, that the differences are in terms of training algorithm and properties rather than structure, and therefore I would really appreciate if the answer could underline the reasons that made the move to DNN possible (e.g. mathematical proof or randomly playing with networks?) and desirable (e.g. speed of convergence?)