Website disappeared suddenly from first page results -Background- A new webpage that we created for a Hungarian venue site in NodeJS has its 'SSO' behaving oddly. It's online for about two-three-ish weeks at the moment. (iranytiszababolna.hu) The SEO analysis seems alright even when we put it through various analysis tools. -Now the problem- A few weeks ago the page came up on the first pages when we typed 'Tiszababolna' (Name of the city), but it doesn't anymore unless we also type other keywords such as 'Irány' (Let's go to...) We know that Indexing takes quite a bit of time to pick everything up. However, when we search just the city name on Google it doesn't even show up on ANY page. This is especially odd behavior considering it worked just fine not long ago. I'd like to clear this up as the client is concerned. :(
How to diagnose a search engine ranking drop? There has been a significant drop (90%) in traffic from Google to one of my well-established sites (6+ years) in the last week. Searches show that the top 3 wide keywords all dropped 4 spots. Searches for other keywords do not show ANY results in the first 10 to 25 pages of results, while previously one 1st or 2nd page at most.  Since there are , the question really is:  What steps are necessary to figure out what caused such a drop?  There have been no major changes during this period or the last month on the site and certainly not in the homepage which has dropped in rank. Over all the years of running this site and plenty of others, I have never experienced this. There are is duplicate content on my site and I have rigorously used canonical links for the last few years to ensure it is not misinterpreted as such.
Best Method to SFTP or FTPS Files via SSIS This question originally asked which is the best method for uploading files via SFTP or FTPS in SSIS.  It now just lists the pros and cons of each solution.  I personally use CozyRoc's SFTP library these days, but I've used each of the below solutions at one point or another.  SSIS COMPONENT LIBRARY  Method: Install a SSIS component library from , , , , or some other vendor on each development and production server and use the SFTP task to upload the files.  Pros: Easy to use.  It looks, smells, and feels like a normal SSIS task.  SSIS also recognizes the password as sensitive information and allows you all the normal options for protecting the sensitive information instead of just storing it in clear text in a non-secure manner.  Works well with other SSIS tasks such as ForEach Loop Containers.  Errors out when uploads and downloads fail.  Works well when you don't know the names of the files on the remote FTP site to download or when you won't know the name of the file to upload until run-time.  Cons: With the exception of the Codeplex solution, this costs money to license in a production environment.  Requires installing the libraries on each development and production machine.  If it is the Codeplex solution, then you are using software that isn't supported by any specific vendor.  This also makes you dependent upon the vendor to update their libraries between each version.  For instance, before 2008 RTM'd, I was developing a new server on a CTP version of 2008 and the CozyRoc 2005 library was incompatible with it.  Eventually they released a 2008 compatible version, but I had to temporarily use the command line solution to work around this issue.    COMMAND LINE SFTP PROGRAM  Method: Install a free command-line SFTP application such as Putty and WinSCP and execute it either by running a batch file or operating system process task.  Instructions for doing this via WinSCP are listed .  Pros: Free, free, and free.  You can be sure it is secure if you are using Putty since numerous GUI FTP clients appear to use Putty under the covers.  You DEFINATELY know you are using SSH2 and not SSH.  Cons: The two command-line utilities I tried (Putty and Cygwin) required storing the SFTP password in a non-secure location.  I haven't found a good way to capture failures or errors when uploading files.  The process doesn't look and smell like SSIS.  Most of the code is encapsulated in text files instead of SSIS itself.  Difficult to use if you don't know the exact name of the file you are uploading or downloading.  A 3RD PARTY C# or VB.NET LIBRARY  Method: Install a SFTP or FTPS library and use a Script Task that references the library to upload the files.  (I've never tried this, so I'm going to guess at the pros and cons)  Pros: Probably easy to capture errors.  Should work well with variables, so it would probably be easy to use even when you don't know the exact name of the file you are uploading or downloading.  Cons: It's a script task combined with .NET libraries.  If you are using SSIS, then you probably are more comfortable with SSIS tasks then .NET code.  Script tasks are also difficult to troubleshoot since they don't have the same debugging tools and features as regular .NET projects.  Creates a dependency on 3rd party code that may not work between different versions of SQL Server.  To be fair, it is probably MORE likely to work between different versions of SQL Server than a 3rd party SSIS task library.  Another huge con -- I haven't found a free C# or VB.NET library that does this as of yet.  So if anyone knows of one, then please let me know! Existence of minimal prime ideal contained in given prime ideal and containing a given subset Let $R$ be a unital commutative ring, $P$ $\subseteq$ $R$ a prime ideal, $X\subseteq P$ a subset. Show there exists a minimal (inclusion minimal) prime ideal contained in $P$ which contains $X$.   My approach: Let $\langle X\rangle$ be the ideal generated by $X$. $P^c$ is a multiplicative set, as $P$ is prime. $\langle X\rangle\subseteq P\subseteq R$ and $P^c\cap\langle X\rangle=\emptyset $ so by Zorn's lemma there exist prime ideal $I_1$ satisfying $\langle X\rangle\subseteq I_1\subseteq P$. As $I_1$ is prime, it's complement is a multiplicative subset which does not intersect $\langle X\rangle$, hence I can find prime ideal $I_2$ satisfying $\langle X\rangle\subseteq I_2 \subseteq I_1$ and so on... I've got an infinite descending chain of prime ideals and I can't be sure that the process will stop.  Hints will be appreciated, thank you.   Edit: Can I conclude that every prime ideal contains a minimal prime ideal? Here are some tips for tagging questions. These guidelines will help you more accurately tag your questions, which in turn will help them get more attention and lead to better answers faster.     For more information, see "" in the . Floating point comparison Check if convergent in the end points of the convergence interval I have to find the radius of convergence for $\displaystyle\sum_{n=0}^{\infty}\frac{n}{n+1}x^n$, for x$\in$R. I think it is $r^{-1}=\lim_{n\to\infty}\frac{a_{n+1}}{a_n}=\lim_{n\to\infty}\frac{ \frac{n+1}{n+2} }{ \frac{n}{n+1}}=1$ so r=1. Then I have to find out if $\displaystyle\sum_{n=0}^{\infty}\frac{n}{n+1}x^n$ is convergent in  the end points of the convergence interval. I think I have to check for $|r|$. But we can't use ratio test (L=1) or integral test(not decreasing) for $\displaystyle\sum_{n=0}^{\infty}\frac{n}{n+1}$. How can I then check if it's convergent in the end points of the convergence interval? How do I enter a file or directory with special characters in its name? proving logical equivalence $(P \leftrightarrow Q) \equiv (P \wedge Q) \vee (\neg P \wedge \neg Q)$ I am currently working through Velleman's book How To Prove It and was asked to prove the following  $(P \leftrightarrow Q) \equiv (P \wedge Q) \vee (\neg P \wedge \neg Q)$  This is my work thus far  $(P \to Q) \wedge (Q \to P)$  $(\neg P \vee Q) \wedge (\neg Q \vee P)$ (since $(P \to Q) \equiv (\neg P \vee Q)$)  $\neg[\neg(\neg P \vee Q) \vee \neg (\neg Q \vee P)]$ (Demorgan's Law)  $\neg [(P \wedge \neg Q) \vee (Q \wedge \neg P)]$ (Demorgan's Law)  At this point I am little unsure how to proceed.   Here are a few things I've tried or considered thus far:  I thought that I could perhaps switch some of the terms in step 3 using the law of associativity however the $\neg$ on the outside of the two terms prevents me from doing so (constructing a truth table for $\neg (\neg P \vee Q) \vee (\neg Q \vee P)$ and $\neg (\neg P \vee \neg Q) \vee \neg (P \vee Q)$ for sanity purposes)  I can't seem to apply the law of distribution since the corresponding terms are negated.  Applying demorgans law to one of the terms individually on step 2 or 3 doesnt seem to get me very far either.  Did I perhaps skip something? Am I even on the right track? Any help is appreciated Given an alphabet of size $n$, how many strings of length $c$ contain every single letter of the alphabet at least once?  I first attempted to use a recurrence relation to work it out:  $$ T(c) = \left\{ \begin{array}{cr} 0 &amp;\mbox{ if $c&lt;n$} \\ n! &amp;\mbox{ if $c = n$} \\ T(c-1) \cdot n \cdot c &amp;\mbox{ if $c &gt; n$} \end{array} \right. $$  As there's no strings that contain every letter if c &lt; n, and if c = n then it's just all permutations. When c > n you can take any string of size (c-1) that contains all letters (of which there are $T(c-1)$ to choose from), you choose which letter to add (of which there are $n$ choices) and there are $c$ different positions to put it. However, this gives out results that are larger than $n^c$ (the total number of strings), so it can't be right, and I realised it was because you could count some strings multiple times, as you can make them taking different inserting steps.   Then I thought about being simpler: you choose n positions in the string, put each letter of the alphabet in one of those positions, then let the rest of the string be anything:  $$ {c\choose{n}} \cdot n! \cdot n^{c-n} $$  But again this counts strings multiple times.  I've also considered using multinomial coefficients, but as we don't know how many times each letter appears in the string it seems unlikely they would be much help. I've also tried several other methods, some complicated and some simple, but none of them seem to work.  How would you go about working out a formula for this? I'm sure there's something simple that I'm missing. Yesterday I was filming a scene with my phone but suddenly the application crashed and when I try to open the m4v generated it says that is corrupted.  I have downloaded the video files (around 36MB) on my PC and I am trying to open and repair it. Can you suggest me a way to do it?  FFMPEG info  As suggested in comments I try check what FFMPEG says me about that file with this command  ffmpeg.exe -i VID_20120425_144739.m4v -c:v copy -c:a copy out.mp4 2&gt; log.txt   Here it is the result:  ffmpeg version N-40126-ga4b58fd Copyright (c) 2000-2012 the FFmpeg developers   built on Apr 26 2012 03:29:50 with gcc 4.6.3   configuration: --enable-gpl --enable-version3 --disable-w32threads --enable-runtime-cpudetect --enable-avisynth --enable-bzlib --enable-frei0r --enable-libass --enable-libcelt --enable-libopencore-amrnb --enable-libopencore-amrwb --enable-libfreetype --enable-libgsm --enable-libmp3lame --enable-libnut --enable-libopenjpeg --enable-librtmp --enable-libschroedinger --enable-libspeex --enable-libtheora --enable-libutvideo --enable-libvo-aacenc --enable-libvo-amrwbenc --enable-libvorbis --enable-libvpx --enable-libx264 --enable-libxavs --enable-libxvid --enable-zlib   libavutil      51. 47.100 / 51. 47.100   libavcodec     54. 15.100 / 54. 15.100   libavformat    54.  3.100 / 54.  3.100   libavdevice    53.  4.100 / 53.  4.100   libavfilter     2. 72.100 /  2. 72.100   libswscale      2.  1.100 /  2.  1.100   libswresample   0. 11.100 /  0. 11.100   libpostproc    52.  0.100 / 52.  0.100 [mov,mp4,m4a,3gp,3g2,mj2 @ 003fc940] moov atom not found VID_20120425_144739.m4v: Invalid data found when processing input   Latest two lines are displayed in red. How to study/prepare for the Salesforce Developer Certification I am fairly new to Force.com development (less than a year). I did not learn it from the ground up. So I think it will be good to study for the developer exam to strengthen my basics and improve my overall knowledge of Force.com + it will be great to have this certification.  Now it's surprising that there is not a lot of great information on the web about how to go about obtaining this certification. Most other major certifications have dedicated study guide books available but there are few for Force.com and I don't think any of them are official.   The official page has little information. The Study guide gives a broad description of the topics in the test.   I see a lot of the esteemed members are here certified developers. I think if you guys could give us a little information, hints/tips and some advice on how to prepare for this exam, it will really be of great help. Also is DEV401 required/helpful?  Also if we could get recommendations for great resources(books, online training etc) and practice tests it will be awesome. This is a follow up question to . My reference database contains some DOI codes, but mainly normal URLs and some ISBN/ISSN codes. What I would like to achieve is extending the code from Herbert and hyperlink the title of the entry with the following priority: 1. DOI, 2. URL, 3. ISBN/ISSN. What I mean is, if both DOI and URL is available, use DOI. If URL and ISBN is available use URL. If only ISBN is available use that.  There are two further isses:    The URL field might contain several URLs, which are just seperated by a white space. In that case just the first URL should be used.  Herbert's code just extends to articles. I would like to extend this to all entry types.   The code from Herbert to Hyperlink the Title with DOIs is:   \newbibmacro{string+doi}[1]{%   \iffieldundef{doi}{#1}{\href{http://dx.doi.org/\thefield{doi}}{#1}}} \DeclareFieldFormat{title}{\usebibmacro{string+doi}{\mkbibemph{#1}}} \DeclareFieldFormat[article]{title}{\usebibmacro{string+doi}{\mkbibquote{#1}}}   This far surpasses my skill, so it would be great if someone could give me some guidance how to achieve that. The tilde operator in Python We often get questions on bicycles.stackexchange about identifying a bicycles manufacturer, model, make, and year.  Often these questions are downvoted or closed -- usually with a comment attached to them that it's not necessary to know the exact model/make/year of a bicycle if you want to fix, repair, or ride your bike. Why should owners not care about the model/make/year of their bicycle? Especially when it comes to less expensive bikes (aka BSOs) and BMX bicycles? This is intended as a canonical question that we can point closed questions to. Also see      (generally not helpful for identifying a brand/model) Proving a limit of a trigonometric function: $\lim_{x \to 2/\pi}\lfloor \sin \frac{1}{x} \rfloor=0$ How do I Uninstall Windows 10 or Windows 10 preview? I joined in the  and I don't like it. However, this question may also be relevant to those who install the full version of Windows 10.  How can I downgrade back to Windows 8/7 from Windows 10 or Windows 10 preview? If posed with the subject question, given that I will not do the action in question, then what is the correct answer     No, I will not do it.   or      Yes, I will not do it.   #1 sounds better to me, but #2 is more logical. #1 sounds somewhat paradoxical in context of the question. If $f(x)$ and $g(x)$ are two periodic functions, that is, $f(x+T_1)=f(x)$ and $g(x+T_2)=g(x)$ for every $x \in \Bbb R$. Now that $\displaystyle\lim_{x\to\infty}(f(x)-g(x))=0$.  Conjecture: $f(x) \equiv g(x)$. Cross-referencing between different files Show that $|f(z_1)|=|f(z_2)|≤|z_1|^2=|z_2|^2$. Let $f\in H(B(0,1))$, $f(0)=0$, $f(B(0,1))\subset B(0,1)$. Suppose there are 2 different points $z_1$,$z_2\in B(0,1)$, s.t. $|z_1|=|z_2|$, $f(z_1)=f(z_2)$. Show that $|f(z_1)|=|f(z_2)|≤|z_1|^2=|z_2|^2$.    I have used the Schwarz-Pick Proposition to prove that $|f(z_1)|=|f(z_2)|≤|z_1|=|z_2|$ directly, but that is not enough. Thank you for help! "Access is denied" JavaScript error when trying to access the document object of a programmatically-created  (IE-only)