Would doing so go against the declaration many journals require that the author has not submitted the work anywhere else?
I've read  about how some publishers (e.g., Springer) allows authors to submit to arXiv before journal submission, but they make authors wait for a year after acceptance to submit to arXiv.   My question is: Is it okay to submit to arXiv during the time when the paper is under consideration by the journal, for example after it has been "revised and resubmitted" but before final decision?
My Area51 account crossed 200 rep today, but still other accounts don't reflect the change in reputation. When will the changes be applied? or is there no association bonus for Area51 account? Apex REST API - Unable to set StatusCode to 429 I am trying to set the status code to 429 for Too many request using the code below:  if(Limits.getQueries() &lt; Limits.getLimitQueries()){               upsert UpdateData;               }               else if((Limits.getQueries() &gt;= Limits.getLimitQueries()))               {                   RestContext.response.statusCode = 429;                   UpdateError[] err = new UpdateError[]{                    new UpdateReturnError(UpdateData.Id, 'Too many Requests', 'Error updating MessageID ' + msg.MessageId)                 };                 RestContext.response.responseBody = Blob.valueOf(JSON.serialize(err));                 RestContext.response.addHeader('Content-Type', 'application/json');                 break;               }             }   I am getting the following error in the raw response:    Can someone help me out with this? Polynomials vanishing on an infinite set I'd like some help making this argument complete and rigorous (if it's correct - if not, help with that would be nice).  Here $k$ is a field.     Let $A_1,\ldots,A_n \subseteq k$ be infinite subsets. Then any polynomial in $k[x_1,\ldots,x_n]$ that vanishes on $A_1\times\cdots\times A_n\subseteq k^n$ must be $0$ (as a polynomial).   This is what I have ...  For the case $n=1$, a non-constant polynomial can only have as many roots as its degree, and in particular, it must have a finite number of roots. The only polynomial in one variable that has an infinite number of roots is $0$, so if a polynomial in $k[x_1,\ldots,x_n]$ vanishes on an infinite subset then it must be $0$.  For the inductive step, suppose the proposition is true for less than $n$ subsets and variables. Let $p\in k[x_1,\ldots,x_n]$ vanish on $A_1\times\cdots\times A_n$. Fix $x_n$ as some $a\in A_n$, and we have a polynomial in $n-1$ variables that vanishes on the set $A_1\times\cdots\times A_{n-1}$, so by the inductive hypothesis it must be identically $0$.  (Now it gets sketchy). Since this is true for any of the infinite values in $A_n$, and , $p$ must be $0$. Newbe Ubuntu installer - Ubuntu 14.04.3 LTS 64bit - Windows 10 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. What is the name of a squircle with three, five, six or more corners? I know that the second shape is a squircle, but what are the other shapes called? Is there an actual name for them?    The shapes do not simply have rounded corners, but the sides have a "circularity". Here is a triangle with rounded corners next to the shape that I do not know the name of:    "Trircle", "Triarcle", and "Pentircle" do not seem to be used for them, at least Google's image search does not provide any results. How do I change file permissions on a FAT32 drive? A rearrangement of an absolutely convergent complex series is also absolutely convergent I just completed the following proof.  Is it valid?   Let $\sum_{k=1}^{\infty} a_k$ be an arbitrary convergent series that also converges absolutely.  Then $\sum_{k=1}^{\infty} a_k \in \mathbb{C}$ and $\sum_{k=1}^{\infty} |a_k| \in \mathbb{R}$. Let $\{b_k\}$ denote a rearrangement of the $\{a_k\}$.  That is, we have that $\{a_k\} = \{b_k\}$ yet $a_i = b_i$ needn't hold. We will first show that $\sum_{k=1}^{\infty} b_k$ converges absolutely (immediately implying it converges non-absolutely).  We will use the Cauchy Criterion on the partial sums of $\sum_{k=1}^{\infty} |b_k|$ to demonstrate this. First let $\epsilon &gt; 0$. Consider that since $\sum_{k=1}^{\infty} |a_k| \in \mathbb{R}$, we have that $\exists N_1 \in \mathbb{N}$ s.t. for all $N_1 &lt; m &lt; n$ we have   $$ \sum_{k=m}^n |a_k| \le \epsilon. $$ Now let $0 &lt; N_2$ be large enough s.t $\{a_1, \ldots , a_{N_1}\} \subseteq \{b_1, \ldots , b_{N_2}\}$.  Let $M &gt; max\{N_1, N_2\}$.  Let $M &lt; m' &lt; n'$.  Then since $\{b_k\} - \{b_1, \ldots , b_{m'}\} \subseteq \{a_{N_1}, a_{N_{1}+1},  a_{N_{1}+2} \ldots\}$, we will have that   $$ \sum_{k=m}^n |a_k| \le \epsilon \implies \sum_{k={m'}}^{n'} |b_k| &lt; \epsilon. $$ Then we have that   $$ \left| \sum_{k={m'}}^{n'} |b_k| \right| = \sum_{k={m'}}^{n'} |b_k| &lt; \epsilon $$  so that since $\epsilon$ was arbitrary, we have obtained that   $$ \left| \sum_{k=1}^n |b_k| - \sum_{k=1}^m |b_k|  \right| = \left| \sum_{k=m}^n |b_k|  \right| \rightarrow 0 $$  so that via the Cauchy Criterion for Convergence  we have that $\sum_{k=1}^{\infty} |b_k|$ converges to some  value in $\mathbb{R}$ as desired. Then it follows that $\sum_{k=1}^{\infty} b_k$ is absolutely convergent (and hence also just convergent).   $\square$ Yes, it's time for me to complain about plagiarism again.  We already have Suggested Edit audits, but I would like to see Tag Wiki and Tag Wiki Excerpt audits that specifically introduce copied content for that tag without including the appropriate source(s), and warn people who approve it that they just approved a tag with plagiarized text.  For example, an audit for the  tag could be:     Microsoft SQL Server is a relational database management system developed by Microsoft. As a database, it is a software product whose primary function is to store and retrieve data as requested by other software applications, be it those on the same computer or those running on another computer across a network (including the Internet). There are at least a dozen different editions of Microsoft SQL Server aimed at different audiences and for different workloads (ranging from small applications that store and retrieve data on the same computer, to millions of users and computers that access huge amounts of data from the Internet at the same time). Its primary query languages are T-SQL and ANSI SQL.   Anyone who spends 15 seconds Googling this will see where it came from -- the problem is, most people don't.  I know with Suggested Edit Audits, it's just random text to catch the most egregious reviewers; for this, you would have to most likely select a small sample of tags, and then create their copy-and-paste entries for audits.    The whole point of this would be to raise awareness for people who have figured out how to recognize and pass Suggested Edit audits, but still don't understand the finer nuances of reviewing. Using mask as a garbage matte to hide an object Selecting all files in directory for merging in QGIS Processing? I'm writing a generic script which involves writing shapefiles to a directory which are then merged together. After writing the files out to the Output folder, I'm trying to get the saga:mergeshapeslayers algorithm to merge all the files in the Output folder. I have used the Model Builder and although it is helpful to an extent, I find that it is used for specific purposes whereas I am attempting to make a script for generic purposes.   Code:  ##Test=name ##Select_folder=folder ##Result=output vector  import os import glob  path_1 = Select_folder path = path_1 os.chdir(path)  def function():      output = glob.glob(path_1 + './*.shp')     x = 0      while output[x]:         for fname in glob.glob("*.shp"):             outputs_1 = processing.runandload("qgis:fieldcalculator", output[x], 'Number', 1, 10, 0, True, 1 , "C:\Users\Me\Desktop\Output\\"  + fname)             multiple_0 = glob.glob("*.shp")             x = x + 1          if x + 1 &gt; len(output):             processing.runalg("saga:mergeshapeslayers", output[0], ";".join(multiple_0) , Result)             break         else:             continue  if path_1:     function() else:    pass Complex differential equation How do I solve $$x'=e^{it}\overline{x}?$$  This is a complex differential equation, but I don't see how to solve it.  Edit: the original ODE is given by $$(x', y')=\begin{pmatrix}\cos t&amp; \sin t\\ \sin t&amp;-\cos t\end{pmatrix}(x,y)$$ I want to show that solutions of this ODE do not remain bounded for all $t$, and the idea was to solve the complex equation. How to transfer minecraft pocket edition world between iPads? My daughter has built a minecraft world on our iPad. As of Christmas 2013 she has an iPad mini of her own. Is there any way to transfer her world from the old machine?   Even better...is there any way to synchronise the 2 machines? Is there implementation of tri-planar mapping in Cycles renderer? Is it possible to have tri-planar mapping in cycles?  Like in corona renderer or fstorm? How to factor a fourth degree polynomial I'm working on a math problem but I am having a hard time figuring out the method used by my textbook to make this factorization:  $$x^4 + 10x^3 + 39x^2 + 70x + 50 = (x^2 + 4x + 5)(x^2 + 6x + 10)$$  I've tried to see if this equation can be factored by grouping or by long division to no avail. Any help would be greatly appreciated. All of a sudden, Safari on my Mac has started misbehaving. I can't select the text in the address bar, and so I can't go to any new websites. When it redraws, it goes all weird:    I've tried deleting the cache, clearing all cookies, disabling all plugins and rebooting. These things didn't help. I've had to switch to Chrome for the time being. Can anyone suggest some other possible remedies? How To quickly do derivatives with respect to matrices Whats a quick way to work the below (and problems similar) out?   For me to take this derivative it involves a lot of time and boring calculation, there has to be a better way.    This is taken from the solutions to Chris Bishop's Pattern Recognition and Machine learning: What invisible flicker do different types of light bulbs have? What waveform does the light coming off different types of artificial light sources have and (of course) what are the underlying physical reason for them?    I was inspired to ask this question because of several things I have been hearing lately.  Firstly, there was a recent TED talk about how .  Researchers have been working on the problem for a little while now and they've made a fairly impressive product, but it was only recently made possible by the LED technology, which has such a fast response that it can easily compare to the transfer rates of electric information condiuits that we normally use.  My understanding is that incandescent bulbs flicker because they have 60 Hz AC power being pulsed through them.  In fact, I think 60 Hz was chosen in the first place because it was a threshold that was unnoticeable to humans.  Looking at a  demonstrates that it has a very significant lag time responding to both the normal electrical phasor and being turned off.  In other words, it flickers but it doesn't go dark at any point in the AC waveform.  Looking for more information, however, I was a little disappointed, since nothing seemed to give a graph of lumens emitted over time for all different kinds of bulbs.  Of course, there isn't just one relevant time scale.  A light could flicker with 60 Hz and also flicker with 2000 Hz (I just made that up).  I'm interested in the complete picture of what lights exhibit what patterns. Show that $\frac 1{1+x+y^{-1}}+\frac1{1+y+z^{-1}}+\frac1{1+z+x^{-1}}=1$ if $xyz=1$ Smoothing/interpolating across images in an ImageCollection to remove missing data I have some code that is working properly to calculate the monthly NDVI averages for the previous two years from a date but I sometimes have missing data in some of the months and I would like to get an average based on the mean of the previous two months. I suppose I could also interpolate from the closest geographic data point but it seems like it would be better to interpolate across time than distance given that sometimes the clouds cover reasonably large areas.   But I'm certainly open to other opinions, I just want to fill these holes as accurately as possible. Is there an efficient way to do this.  and here is the code itself:  // pick a landsat tile footprint to use as my geometry var wrs2_descending = ee.FeatureCollection('ft:1_RZgjlcqixp-L9hyS6NYGqLaKOlnhSC35AB5M5Ll'); // use a manually defined point to pick the WRS2 tile var wrs2_filtered = wrs2_descending.filterBounds(roi); var layer1 = ui.Map.Layer(wrs2_filtered, {}, 'WRS2 filtered'); Map.layers().set(1, layer1);  var imageCollection = ee.ImageCollection('LANDSAT/LC08/C01/T1_SR').filterBounds(wrs2_filtered); var monthCount = ee.List.sequence(0, 11);  // Function to cloud mask from the pixel_qa band of Landsat 8 SR data. function maskL8sr(image) {   // Bits 3 and 5 are cloud shadow and cloud, respectively.   var cloudShadowBitMask = 1 &lt;&lt; 3;   var cloudsBitMask = 1 &lt;&lt; 5;    // Get the pixel QA band.   var qa = image.select('pixel_qa');    // Both flags should be set to zero, indicating clear conditions.   var mask = qa.bitwiseAnd(cloudShadowBitMask).eq(0)       .and(qa.bitwiseAnd(cloudsBitMask).eq(0));    // Return the masked image, scaled to reflectance, without the QA bands.   return image.updateMask(mask).divide(10000)       .select("B[0-9]*")       .copyProperties(image, ["system:time_start"]); }  // run through the image collection and generate monthly NDVI median images var composites = ee.ImageCollection.fromImages(monthCount.map(function(m) {   var startMonth = 1; // thinking that I should always start from Jan so the series are similar   var startYear = ee.Number(2017-1); // number is one year before the current one    var month = ee.Date.fromYMD(startYear, startMonth, 1).advance(m,'month').get('month');   var year = ee.Date.fromYMD(startYear, startMonth, 1).advance(m,'month').get('year')    // filter by year and then filter by month to get monthly mosaics   var filtered = imageCollection.filter(ee.Filter.calendarRange({     start: year.subtract(1), // we want an average of the last two years     end: year,     field: 'year'   })).filter(ee.Filter.calendarRange({     start: month,     field: 'month'   }));   // mask for clouds and then take the median   var composite = filtered.map(maskL8sr).median();   return composite.normalizedDifference(['B5', 'B4']).rename('NDVI')       .set('month', ee.Date.fromYMD(startYear, startMonth, 1).advance(m,'month')); })); print(composites);  Map.addLayer(composites, {min: 0, max: 1}, 'check');  // stack the ImageCollection into a multi-band raster for downloading var stackCollection = function(collection) {   // Create an initial image.   var first = ee.Image(collection.first()).select([]);    // Write a function that appends a band to an image.   var appendBands = function(image, previous) {     return ee.Image(previous).addBands(image);   };   return ee.Image(collection.iterate(appendBands, first)); }; var stacked = stackCollection(composites); print('stacked image', stacked);  // Display the first band of the stacked image. Map.addLayer(stacked.select(0).clip(wrs2_filtered), {min:0, max:1}, 'stacked'); Ring isomorphism (polynomials in one variable)