How do you use tags in git to manage software versions
Automatic tagging of releases
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?) I am trying to prove the following statement.     If a field $K$ is not algebraically closed, then any $K$-variety $V\subset\mathbb{A}^n$ can be written as the zero set of a single polynomial in $K[X_1,X_2,...,X_n].$     Suppose $V=V(f_1,f_2,...,f_n)$, and I would want to find a polynomial $g\in K[X_1,X_2,...,X_n]$ such that $V=V(g)$.  I know that if I can find a polynomial $\phi\in K[X_1,X_2,...,X_n]$ whose only zero is $(0,0,...,0)$, then it is done, since we could take $g=\phi(f_1,f_2,...,f_n)$.  For $n=1$, then I would just choose $\phi=X$, but I do not even know how to proceed to the case $n=2$. Maybe we could choose an irreducible polynomial of degree $&gt;1$.  Any help will be appreciated. fsck error on boot: /dev/sda6: UNEXPECTED INCONSISTENCY; RUN fsck MANUALLY I dual boot Ubuntu and Windows 7. I was browsing on FireFox in Ubuntu and all of a sudden I get some error message, so I rebooted.  Now when I try to boot into Ubuntu I get this message:  fsck from util-linux 2.26.2 /dev/sda6 contains a file system with errors, check forced. /dev/sda6: Inodes that were part of a corrupted orphan linked list found.  /dev/sda6: UNEXPECTED INCONSISTENCY; RUN fsck MANUALLY.         (i.e., without -a or -p options) fsck exited with status code 4 The root filesystem on /dev/sda6 requires a manual fsck  Busybox v1.22.1 (Ubuntu 1:1.22.0-15ubuntu1) built in shell (ash) Enter 'help' for a list of built-in commands.  (initramfs) _   How can I fix this? I'm subscribed to the Ubuntu Security Notes, so everytime that I receive an e-mail, a new update is avalable.  But in the last update, they wrote something in the end that I coudn't undertand much, so can anyone please tell me what does that means?  ATTENTION: Due to an unavoidable ABI change the kernel updates have been given a new version number, which requires you to recompile and reinstall all third party kernel modules you might have installed. If you use linux-restricted-modules, you have to update that package as well to get modules which work with the new kernel version. Unless you manually uninstalled the standard kernel metapackages (e.g. linux-generic, linux-server, linux-powerpc), a standard system upgrade will automatically perform this as well.   I tried to ask to my friend (who also uses Linux), but he don't know much about kernel. Big-O proof showing that t(n) is O(1) Let t(n) = $\sqrt{n^2+100n} - n$  Show that $t(n)$ is $O(1).$  I tried solving this using the formal definition of O( ) but am not getting anywhere. Quite confused on how to tackle this question. Is there any way of making a snow golem survive in hot biomes? Snow golems won't survive in the Nether (neither spawned in nor built ones). Is there a way to make a snow golem survive in the Nether and other hot biomes in vanilla Minecraft (i.e., without using mods)? Is there a way in Java to determine if a path is valid without attempting to create a file? The result set has no current row while using JDBC I am using the following code in selenium, but I am not able to retrieve data from database. I am getting the errors "The result set has no current row"  My code is   public class Auto {      public static void main(String[] args) throws InterruptedException, SQLException, ClassNotFoundException, InstantiationException, IllegalAccessException     {           Class.forName("com.microsoft.sqlserver.jdbc.SQLServerDriver");         System.out.println("Driver loaded");           Connection con=DriverManager.getConnection("jdbc:sqlserver://192.168.*****\\SQLEXPRESS/*****_DW/EPS:****;user=******;password=******; ");          System.out.println("Driver loadedd");       java.sql.Statement stmt= con.createStatement();     ResultSet rs=stmt.executeQuery("select * from [*****_DW].[dbo].dim_grantee ");      System.out.println("Query executed");      while (rs.next());     {         String Name=rs.getString("NAME");          System.out.println("Name is");     }   } I'm a British citizen travelling from London Heathrow (LHR) to the Hartford, Connecticut airport, and have a two hour stopover in Newark, New Jersey (EWR) on my itinerary. At what stage would I clear immigration and customs on arriving in the USA? persist port routing from 80 to 8080 I use amazon EC2 instance which works via ubuntu. By default according security restrictions I can't bin my application to port 80, so I just bind it port 8080 and then set routing redirect from port 80 to 8080 via the following command:  iptables -t nat -A PREROUTING -p tcp --dport 80 -j REDIRECT --to 8080   But I found that when I reboot the server this settings no longer active untill I invoke this command again.  So my question is how to enable port's redirect work even if system was rebooted? Currently, Stack Exchange’s Markdown parser only allows four-space indents to represent code blocks:      // some code     // another line of code    and other Markdown implementations allow for an alternative syntax, that doesn’t require indenting each code line:  ``` // some code // another line of code ```   This is much more convenient to type out. It would be super useful if Stack Exchange could support this syntax.    By extension, this syntax also allow you to specify the source language right after the opening ```:  ```js // some code // another line of code ```   …which would then enable syntax highlighting for that specific language. Although it’s interesting metadata, I don’t think this feature is needed on Stack Overflow, as the syntax highlighting library works pretty well for various languages.  So, even if you would allow this syntax but ignore the ```language, this would greatly improve my productivity on Stack Exchange.  What do you think?  The moderators are currently collecting feedback regarding this feature, so please post a comment with your thoughts. Good idea? Bad idea? Don’t really care? What do you think are the benefits/drawbacks? Experiences? Let them know! Thanks! Is there a way to scale up the bevel object on one end of a curve, a little bit over each point?  I notice the vertex "weight" slider will tweak how much influence each vertex has on the others, is there something like this that can scale the bevel object up a little bit?  Preferably with the option to constrain X,Y,Z independently I want to describe my business and want to refer to it in a sentence.  I am trying to say:      "In 2015 we established a business (that is) named X".   Intuitively, the "that is" part is redundant, and makes the sentence more cumbersome. But I cannot think of a reason why we should be able to drop the verb.  Is the version without the "that is" part grammatically correct? How can it be explained? I am doing an animation. The images I have attached show 2 different render layer view node results.    Image one shows a cube on layer 1, and 2 icosphere on layer 2. I have layer 2 set to fast blur. I have to use transparent film and therefore I use the Alpha over nodes in composition.  Image two shows a cube and 1 icosphere. Image 1 should not be showing 2 icospheres, as the left most one is behind the cube.    Image 2 is from the same render result, and is correcting showing only 1 icosphere. However, that icosphere should be blurred as it is on layer 2. It seems for whatever reason I can not have both the correct composition effect and also have every object's visibility render correctly. I can only either have everything work fine, with no composition, or composition with every emission object showing through every other object in the scene.   I am aware that masks would solve this problem, but because of the complicated setup of object materials and particles, masking produces these very strange and suddenly appearing artifacts. Material Indexing also produces odd artifacts and does not consistently effect the appropriate materials.   This is also a new problem, I did not have this issue in the last blender version. So, material indexing is out, masking is out, object indexing is out.       I want to use the compositor to blur certain layers, but every emission object in the scene shows through. It shows through as though it was on x-ray, regardless if it is behind another or inside another object. The first image is an example of this, the left icosphere is behind the cube, and should not be visible. That is the problem. Why is it visible when it shouldn't be? Problem with sudo apt get update: The repository cdrom... does not have a Release file Solve recurrence relation $a_n = 3 a_{n - 3} + a_{n-1} + 2 n$ I am not able to solve the above recurrence relation which involves $n$. The initial conditions $a_0 = 1, a_1 = 2, a_2 = 3$, for $n \geq 0$. Please try to give closed form in terms of arbitrary $a_i \geq 1 $ for $i \geq 0$ Brokerage accounts are seen as relatively tax-inefficient, since you invest with post-tax dollars, and growth is taxed upon realizing gains. The traditional IRA allows you to deduct contributions and defer taxes until you take distributions in retirement ...  Unless you are covered by a retirement plan from work and make over   $71,000/year if single, or $118,000/year if married filing jointly.   The numbers above come from . Above those thresholds, you can still make contributions to a traditional IRA, but those contributions will be post-tax. Distributions are taxed as ordinary income, excluding post-tax principal.  Similarly, eligibility to make direct Roth IRA contributions phases out to zero according to a :   $131,000 if single, or $193,000 if married filing jointly.   Looks to me that someone who cannot make direct Roth IRA contributions also cannot deduct traditional IRA deposits from income.  Assume   investment period is 20 years, is some garden variety ETF (VTI/VXUS/etc), those investments return 5%, the current marginal tax rate is 28%, the expected marginal tax rate at retirement is 25%, the long term capital gains rate is 15%, the entity is not eligible to make Roth IRA contributions, and 401k contributions are already maxed out.   A $5000 of gross income contribution into a traditional IRA at retirement might grow to an after-tax sum of:  (5000) * (1 - 0.28) * (1 + (1.05 ** 20 - 1) * (1 - 0.25)) = $8064   Instead, since contributions were going to be taxed anyway, why not put it in a brokerage account? Then you could claim the favorable long-term capital gains rate.  (5000) * (1 - 0.28) * (1 + (1.05 ** 20 - 1) * (1 - 0.15)) = $8659   All I found was , and the accepted answer says to still make a traditional IRA contribution, but I still don't see why that would be a good idea. What am I missing here? Why the interior of $\mathbb{Q}$ in $\mathbb{R}$ is empty? i have a table like this  +--------+------------+-----------+ | id     | volume     | price     | +--------+------------+-----------+ |      1 | 1.0000     |  14250.00 | |      2 | 0.2500     |  14251.10 | |      3 | 0.2500     |  14250.00 | |      4 | 0.0050     |  14200.00 | |      5 | 0.5000     |  14255.01 | +--------+------------+-----------+   Simply if volume 1.7500, how to select like bellow by ordering(highest price)  +--------+------------+-----------+ | id     | volume     | price     | +--------+------------+-----------+ |      5 | 0.5000     |  14255.01 | |      2 | 0.2500     |  14251.10 | |      1 | 1.0000     |  14250.00 | +--------+------------+-----------+   And if volume 1.5000 it also select the least amounts of records needed to calculate to the input volume  +--------+------------+-----------+ | id     | volume     | price     | +--------+------------+-----------+ |      5 | 0.5000     |  14255.01 | |      1 | 1.0000     |  14250.00 | +--------+------------+-----------+   some guys say i cant do this with sql Back when the first discussion about deleted questions came up, I  building an official unofficial read-only archive for good deleted SE content.  I had a plan to build something like this:    Each link would point to a 1:1 scraped StackOverflow (or other SE network) deleted question (of course with a big fat disclaimer to the top, historical data, legal stuff, yada yada yada - and of course after asking Stack Exchange for permission, seeing as this would go far beyond what the CC license allows.)   I also registered a domain name that would (IMO) suit nicely, overflown.org.  However, when thinking about it, I realized doing this properly is a lot of work. You would have to:   build a scraper that can use a 10k+er's OpenID to fetch the deleted question (using the API or the data dump is for wusses. If we go through all this trouble, we want a historical document of what the site looked like "back then", right?) edit the page's DOM to remove dynamic elements, remove the "deleted" CSS classes, remove all the voting abilities from the buttons, and add the "this is historical data" disclaimer fetch - this is the biggest part and applies even if you use the API or data dump - all linked image resources (even those from imgur - even images used only in deleted questions could be purged one day), store them, and link them fetch all associated CSS style sheets and store them intelligently - preferably in a way that you don't fetch a copy of each file for each page (as normal page scrapers do), but also in a way that doesn't break if SE update their style sheets   long story short, I won't be in a position to build this any time in the foreseeable future - with old work, new work, and studying, I really have enough on my plate already.  Of course, if somebody else in the community feels like giving this a try, cool! But what I was really thinking is - maybe this is something Stack Exchange should build after all?   I know Jeff's  on these questions is used to be     @system I did think about a sweet place for them, in the bitbucket. – Jeff Atwood♦ Dec 29 '10 at 1:54   but come on. Think about it:     Future deletion discussions and changes in on-topicness policy would become way more relaxed because the popular and loved stuff has a place to go. A site for "overflown" questions could be curated by selected community members, who decide whether a contribution deserves to be archived or not.  A separate domain name (I'm happy to donate overflown.org for the purpose if desired) and the separate site design would create enough distance to the Stack Exchange network: it would be crystal clear that this read-only archive is for historical purposes only, and the existence of a question there does not mean you can ask something similar on one of the live sites. The pages would be 1:1 scrapes of what the site looked like at the time of the scraping, making it a general historical archive as well. These questions traditionally drive a lot of traffic. The possibility of continuing to show ads in the usual places would allow Stack Exchange to take advantage of that traffic without endangering content quality on the SE network. Hosting an archive like this is a job for a business, not us regular joes. A private project hosted by some community member can go down once they forget to pay a bill, or decide they want to password protect their private blog or photo album. The ideal place to host a site like this is at a company with professional admins that intends to stay online for a long time.    How about it?