I am trying to make a priority queue without using the Queue module. I have made a class PriorityQueue() and I am trying to create a mk function that takes no arguments and returns an empty queue but can't seem to figure out how. my task function is here:  class Task():      __slots__ = ('name', priority)  def mkTask(myName, myPriority):     t = Task()     t.name = myName     t.priority = myPriority     return t   What I have so far for my PriorityQueue class and a function to check if the queue is empty is this:  class PriorityQueue():     def __init__(queue):         queue.length = 0         queue.first = None         queue.last = None  def is_empty(queue):     return(queue.length == 0)   I can't seem to figure out how to create an instance of the Queue and insert elements of a specific Task into the Queue.

I need to use a priority queue in my Python code, and:   am looking for any fast implementations for priority queues optimally, I'd like the queue to be generic (i.e. work well for any object with a specified comparison operator).   Looking around for something efficient, I came upon , but:   I'm looking for something faster than heapq, which is implemented in native Python, so it's not fast. It looks good, but seems to be specified only for integers. I suppose it works with any objects that have comparison operators, but it doesn't specify what comparison operators it needs.  Update: Re comparison in heapq, I can either use a (priority, object) as Charlie Martin suggests, or just implement __cmp__ for my object.


I am using asp.net C# 4.0 as may server side script and jquery as my client side script. Our client provided us a SharePoint URL (aspx) to access. SharePoint machine different from my web application server. They want us to read/write to its SharePoint list.  Is there any way I can do the requirement using the current setup(remote access) without installing any on the SharePoint machine? Our client doesn't want to install or do anything on the SharePoint machine.  Sorry for duplicate question  Here some additional information.   I am using jquery 1.9.1 I need to perform read/write from the browser. Using Sharepoint 2013

I currently use the   to retrieve data from several SharePoint lists.  This is my current preferred method of coding my way from ASP.NET and WinForms to retrieve this data.   My only issue with this project:  I have to manually generate the SPML file and add this to the development environment, compile it in the project, and only then I am able to use it to connect to the List.  This is great for projects that require connecting to the one and the same list always.  But I am having users creating new workspaces (sites) with each its own List from which I want to retrieve data automagically (same as linq to sharepoint does, but not statically).  Can you recommend your preferred way of accessing data from several SharePoint Lists and sites in C# WinForms and/or ASP.NET outside an actual SharePoint environment where I can specify the a new source site and list at run time?


For a certain dataset, I am finding the k closest points in my dataset to the centroid of the dataset. Are these k points the k medoids or are medoids something completely different. If so, is there any mathematical term for the points that I'm finding? I use 2 distance metrics, one is the Mahalanobis distance and the other is a weighted average of Euclidean and cosine distances.

I understand the difference between k medoid and k means. But can you give me an example with a small data set where the k medoid output is different from k means output.


i have created two classes A and B so i have 5 files , main.cpp , A.h , A.cpp , B.h , B.cpp   i have included all headers as it should be and im trying to create a object of class A in class B and i get the following error : error: A doesn't name a type  and if i to it repeated like i define object B in class A it works ,,, whats wrong?  this is how my B.h looks like >  #ifndef B_H #define B_H  #include <iostream> #include "A.h"  using namespace std; class B {     public:         B();     protected:     private:         A instance;  };  #endif // B_H   and now A.h  #ifndef A_H #define A_H  #include <iostream> #include "B.h"  using namespace std; class A {     public:         A();     protected:     private: };  #endif // A_H

I often find myself in a situation where I am facing multiple compilation/linker errors in a C++ project due to some bad design decisions (made by someone else :) ) which lead to circular dependencies between C++ classes in different header files (can happen also in the same file). But fortunately(?) this doesn't happen often enough for me to remember the solution to this problem for the next time it happens again.  So for the purposes of easy recall in the future I am going to post a representative problem and a solution along with it. Better solutions are of-course welcome.     A.h  class B; class A {     int _val;     B *_b; public:      A(int val)         :_val(val)     {     }      void SetB(B *b)     {         _b = b;         _b->Print(); // COMPILER ERROR: C2027: use of undefined type 'B'     }      void Print()     {         cout<<"Type:A val="<<_val<<endl;     } };       B.h  #include "A.h" class B {     double _val;     A* _a; public:      B(double val)         :_val(val)     {     }      void SetA(A *a)     {         _a = a;         _a->Print();     }      void Print()     {         cout<<"Type:B val="<<_val<<endl;     } };       main.cpp  #include "B.h" #include <iostream>  int main(int argc, char* argv[]) {     A a(10);     B b(3.14);     a.Print();     a.SetB(&b);     b.Print();     b.SetA(&a);     return 0; }


I have an SSIS package that use to use an FTP connection manager. However I have to update the package using SFTP connection now. I know there exists a WinSCP option but the server which it will be hosted on will not have WinSCP, and from my knowledge the SSIS package can not have a bin folder with WinSCP. Any work arounds?

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!


Is there any way to express $$\sum_{k=1}^\infty \frac{1}{k^k}.$$ without a sum? I know this converges to ≈ 1,2913 by calculating it, by how can you express this another way? Also, is this number transcendental?

Earlier today, I was talking with my friend about some "cool" infinite series and the value they converge to like the Basel problem, Madhava-Leibniz formula for $\pi/4, \log 2$ and similar alternating series etc.  One series that popped into our discussion was $\sum\limits_{n=1}^{\infty} \frac{1}{n^n}$.  Proving the convergence of this series is trivial but finding the value to which converges has defied me so far. Mathematica says this series converges to $\approx 1.29129$.  I tried Googling about this series and found very little information about this series (which is actually surprising since the series looks cool enough to arise in some context).  We were joking that it should have something to do with $\pi,e,\phi,\gamma$ or at the least it must be a transcendental number :-).  My questions are:   What does this series converge to? Does this series arise in any context and are there interesting trivia to be known about this series?   I am actually slightly puzzled that I have not been able to find much about this series on the Internet. (At least my Google search did not yield any interesting results).


Check whether or not $\sum_{n=1}^{\infty}{1\over n\sqrt[n]{n}}$ converges.    I tried few things but it wouldn't work out. I would appreciate your help.

Does the following series converge? $$\sum_{n=1}^\infty \frac{1}{n\sqrt[n]{n}}$$   As $$\frac{1}{n\sqrt[n]{n}}=\frac{1}{n^{1+\frac{1}{n}}},$$ I was thinking that you may consider this as a p-series with $p>1$. But I'm not sure if this is correct, as with p-series, p is a fixed number, right ? On the other hand, $1+\frac{1}{n}>1$ for all $n$. Any hints ?


Normally we use the past simple instead of present perfect when an action happened at a specific time in the past and is not linked with the present.   Why is this sentence grammatically correct?      How many points have you scored this season?   Don't the words "this season" indicate a specific time here? Why can't I use past tense instead? As in, "How many points did you score this season?"  Why is the latter wrong?

If I seem tired, can I say: "I haven't slept last night"? If not, why have I been told that we use present perfect for actions that have present effects?


I created on recursion program to find of sum of all values till the number via recursion(with return values). Then I thought of making same program by passing the total as argument. this one didnt work. When I tried debugging i found that last else(when n==1) takes the porgram to loader.js. I am new and couldn't understand what is happening here. Looking for your expert feedback.  function sum(n, total = 0) {   console.log(n, total);   if (n !== 1) {     console.log("insie IF");     total += n;     sum(n - 1, total);   } else {     console.log("inside ELSE");     total += 1;   }   return total; }

The primitive types (number, string, etc.) are passed by value, but objects are unknown, because they can be both passed-by-value (in case we consider that a variable holding an object is in fact a reference to the object) and passed-by-reference (when we consider that the variable to the object holds the object itself).  Although it doesn't really matter at the end, I want to know what is the correct way to present the arguments passing conventions. Is there an excerpt from JavaScript specification, which defines what should be the semantics regarding this?


Is there a way to prevent Dropbox, or any other cloud service, from synchronizing those ._ and .DS_store files, although they exist in the Dropbox folder?

I am using different operating systems on different machines on different locations. I am using a USB flash disk to keep my files (source codes etc.).  I am new to Mac OS X and now I realize there are lots of files created with a dot underscore ._ prefix.  Questions  Why are ._ files created?   What are their purpose?   How can I avoid them?


Running FindBug I got an alert on the following code:  public select(List<T> elements) {     if (elements == null)         throw new NullPointerException();   With the following explanation:     Avoid throwing a NullPointerException - it's confusing because most   people will assume that the virtual machine threw it. Consider using   an IllegalArgumentException instead; this will be clearly seen as a   programmer-initiated exception.   However, I always thought throwing null pointer exceptions for null parameters was correct. And I look for example at the implementation of ArrayList, I can find something similar:      public boolean tryAdvance(Consumer<? super E> action) {         if (action == null)             throw new NullPointerException();   So, is it really incorrect? And why? Why is Findbug telling me that is wrong?

I have a simple setter method for a property and null is not appropriate for this particular property. I have always been torn in this situation: should I throw an , or a ? From the javadocs, both seem appropriate. Is there some kind of an understood standard?  Or is this just one of those things that you should do whatever you prefer and both are really correct?


I know number of ways to remove old kernel versions manually. Is there any way to remove old kernel versions automatically? Automatically, in the sense i don't have to do the same thing each time the kernel gets updated.

Every time I install a new Linux kernel, it gets left in the grub_config, making the boot menu longer each time.    I know I can manually search through the installed packages and remove them.  Does Ubuntu provide any easier way to clean them up or keep them from showing in the boot list?


We have two sets: set No.1 and set No.2 as in this picture:    The observer is fixed to set No.1 . He sees set No.1 motionless and observes set No. 2 approaching with velocity 100,000 m/s.  Each set has one lamp and two, so called, touchers. The ends of the lamp on set No. 1 is connected directly to the touchers. One end of the lamp on set No. 2 is connected to one end of a battery and the other end of the battery is connected to the other toucher.  Set No. 2 is approaching set No. 1 so that each toucher in each set will be touched twice by the touchers of the other set. There is no friction between touchers and nothing else slowing down the movements.  The observer on set No. 1 observes the distance between touchers in each set 10 meters. It seems the lamp on Set No. 1 will light up. But the lamp on set No. 2 will not light up. And an observer on No. 2 will be be sure that the energy of the battery is not used because there has been no closed circuit.  My question: Will set No. 2 slow down?  Note 1: the numbers in the picture is what an observer on set No. 1 calculates.  Note 2: ignore friction, interaction of wires (including magnetic field. electric field, etc), and so on. Only consider the energy that a lamp needs to light up and if it may slow down the movement to get the energy. Do not ignore the mass of the sets so  slowing down needs or produces energy.  Note 3: The experiment is designed such that an observer in set No. 1 will see the circuit is closed (because its touchers will be connected to the battery of set No. 2 simultaneously). But for an observer in set No. 2 the circuit will remain open. This is the main situation the experiment tries to create. So  yu can change the numbers (like 10 and 100000) if they are not good.  Note 4: The core of the question is the circuit part of which is moving. I think if lamp 1 lights up it cannot use the battery. It can only use the kinetic energy of set No. 2. This is why I'm asking if set No. 2 will slow down.  Note 5: the touchers are not like a sharp point. So electricity will have enough time to turn on the lamps.    explanation: It seems from comments I have to explain the situation more carefully:   For set No. 1 the distance between (the centers of) the touchers in both sets is 10. So lamp 1 will feel the ends of a battery connected to its ends. So lamp 1 has to light up. Because the circuit is closed for it. For set No. 2 the distances between (the centers of) the touchers in both sets are not the same. So the battery will never feel a closed circuit. So for sure, it will not release energy at all. the lamp of set No. 1 will light up and the battery will not be used. So what is the source of energy which helps the lamp to turn on? There remains no other source of energy except the kinetic energy stored in set No. 2 (for Set. 1). So I think the lamp will hinder the motion of set No. 2 to gain some energy to light up. So it will slow down set No. 2.   Is this correct? if no how do you explain (1), (2) and (3) all holding together?

We have two sets: set No.1 and set No.2 as in this picture:   The observer is fixed to set No.1 . He sees set No.1 motionless and observes set No. 2 approaching with velocity 100,000 m/s.   Each set has one lamp and two, so called, touchers. Each set is designed so that if both touchers are touched simultaneously the lamp is turned on otherwise it remains off.  Set No. 2 is approaching set No. 1 so that each toucher in each set will be touched twice by the touchers of the other set.  The observer on set No. 1 observes the distance between touchers in each set 10 meters. He thinks the lamps on set No. 1 will be turned on because touchers in it will be touched simultaneously.  My question: Will the lamp on set No. 2 be turned on? How if an electrical current flowing from one toucher in a set to the other proves simultaneous touching?


I'm trying to understand why the empty set is a subset of every set and this is my reasoning (please correct me if I'm wrong):  By definition of a set S is a subset of a set A if all it’s elements are in A. ∅ has no elements if ∅ is not a subset of A then there is an element in ∅ that is not in A but ∅ as not elements. So ∅ is a subset of A by contradiction.  does it really follow that because the empty set has no elements it is a subset of every set? I mean imagine this: I have a box with nothing in it (the empty set). then I have a box with something in it (3 balls if you will). how is "nothingness" (if I may call the element of the empty set that) be in a box that has something in it already (the three balls).

Recently I learned that for any set A, we have $\varnothing\subset A$.  I found some explanation of why it holds.     $\varnothing\subset A$ means "for every object $x$, if $x$ belongs to the empty set, then $x$ also belongs to the set A". This is a vacuous truth, because the antecedent ($x$ belongs to the empty set) could never be true, so the conclusion always holds ($x$ also belongs to the set A). So $\varnothing\subset A$ holds.   What confused me was that, the following expression was also a vacuous truth.     For every object  $x$, if $x$ belongs to the empty set, then $x$ doesn't belong to the set A.   According to the definition of the vacuous truth, the conclusion ($x$ doesn't belong to the set A) holds, so $\varnothing\not\subset A$ would be true, too.  Which one is correct? Or is it just a convention to let $\varnothing\subset A$?


I use the LaTeX wikibook a lot and found this  to preserving capitalization in titles, which is to wrap letters (or whole titles) in curly braces. The phrase "In the event that BibTeX has been set to not preserve all capitalization within titles" suggests that I can fix this with a setting, instead of going back into my .bib files and wrapping titles in {}. Is this true?  FWIW, I use natbib and cite mostly journal articles, which tend to have full capitalization except for articles. Thanks!

Titles of articles I'm about to cite contain upper case letters and when using BibTeX it converts them to lower case ones. This happens only in the title and only the first letter conserves its case. For example, when I cite an article about HF, the reader won't know if it is about Hafnium (Hf) or fluorine acid (HF).  I know that I can fix it manually in the .bbl file but I would like to avoid it, or fix it automatically.


If I have Windows 7 Pro in a partition and Ubuntu 14.04 in a other partition, I can emulate the windows in my partition using Ubuntu? and if not, when windows software become available for Ubuntu? (Platform switching)??? TY all also if my question has no answers!

Can .exe and .msi files (Windows software) be installed in Ubuntu?


Let $A$ be a set of subsets of $\Omega$. Then, the $\sigma$-algebra generated by $A$ is defined as  $$\sigma(A):= \cap \{\mathcal{F}\; |\; \mathcal{F}\text{ is a }\sigma\text{-algebra and }A\subseteq \mathcal{F} \}$$  From the definition it is clear that $\sigma(A)$ is the smallest $\sigma$ algebra containing $A$.   Now, let $D_1$ and $D_2$ be two non-empty family of subsets of a nonempty set $\Omega$ such that $D_1\subseteq D_2$.  I want to prove that $\sigma(D_1)\subseteq \sigma(D_2)$.  I observed that   $A\in D_1$  $\implies A \in D_2$  $\implies A\in \sigma(D_2)$  $\implies D_1 \subseteq \sigma(D_2)$  From here, I don't know how to proceed. I am new to Probability Theory so please be gentle.

$\mathcal{C}_1$, $\mathcal{C}_2$ are collections of subsets of $X$,then Im having hard time seeing why the  following is true. Can someone explain them to me?  $\mathcal{C}_1 \subseteq \mathcal{C}_2 \implies \sigma( \mathcal{C}_1) \subseteq \sigma( \mathcal{C}_2) $  $\sigma(\sigma( \mathcal{C} )) = \sigma( \mathcal{C} ) $  where $\sigma( \mathcal{F} ) $ is the sigma field generated by the collection $\mathcal{F}$ of subsets of $X$  thanks


How can I remove Thumbs.db files from Window 7 without affecting any other files? I have already turned off indexing as I use a program called Everything for searches.

How do I delete album art, desktop.ini, and thumbs.db from my music folder in Windows 7? I can see all of these files because I took the hard drive from my old computer and put it in my new one. It now has all of these junk files that the OS does not use, so I want to delete them and get them out of my sight.


It is clear that the meaning of the collocations is: slayer of giants hunter of witches  But, why do they stay in singular when they are in a juxtaposition? What is their grammatical funticion? Which case is that?

Is it correct to say user accounts or users account when referring to the accounts any user has on a site like this one?  In general, in the case of a noun that is used as adjective for the noun that follows, is it better to use <plural-noun> <singular-noun> or <singular-noun> <plural-noun>?


Prove that $$\sum_{k=0}^{n}{\binom{2k}{k}\binom{2n-2k}{n-k}}=2^{2n}$$  I was having trouble with this one because all four of the indexes are varying here. So I tried to think of a combinatiorial argument, but wasn't quite able to tie everything together. I was thinking along the lines of imagining $2n$ elements which were separated into $n$ pairs, and then partitioned into two subsets (total $2^n$ subset combinations possible). How should I proceed? (PS no proofs using induction please)

It's not difficult to show that  $$(1-z^2)^{-1/2}=\sum_{n=0}^\infty \binom{2n}{n}2^{-2n}z^{2n}$$  On the other hand, we have $(1-z^2)^{-1}=\sum z^{2n}$.  Squaring the first power series and comparing terms gives us  $$\sum_{k=0}^n \binom{2k}{k}\binom{2(n-k)}{n-k}2^{-2n}=1$$  that is,  $$\sum_{k=0}^n \binom{2k}{k}\binom{2(n-k)}{n-k}=2^{2n}$$  My question: is there a more direct, combinatorial proof of this identity?  I've been racking my brains trying to come up with one but I'm not having much success.


Let $R$ be a commutative ring with unity which is not an integral domain. Let $P$ be any minimal prime ideal of $R$. How can I show that $P⊆Z(R)$, where $Z(R)$ denotes the set of zero-divisors of $R.$

Let $A$ be a commutative ring. Suppose $P \subset A$ is a minimal prime ideal. Then it is a theorem that $P$ consists of zero-divisors.  This can be proved using localization, when $A$ is noetherian: $A_P$ is local artinian, so every element of $PA_P$ is nilpotent.  Hence every element of $P$ is a zero-divisor. (As Matt E has observed, when $A$ is nonnoetherian, one can still use a similar argument: $PA_P$ is the only prime in $A_P$, hence is the radical of $A_P$ by elementary commutative algebra.)  Can this be proved without using localization?


I have called and mailed different offices including the UK embassy in Greece concerning this question, I have one office directing me to another in circle. Anyway, I have a 5years Greek resident permit, I'm travelling to Lagos, Nigeria using the British airways, I'm a Nigerian passport holder. Now some people say I need a transit visa and some say I do not, does anyone have an idea to give me a correct answer? I'm not getting out of the airport as it's just few hours in transit.

Is there a website or some other way to find out if I need a transit visa for a short stop in the UK on my way somewhere else? Ideally this should give me the answer for all nationalities, and take into account any other visas I may have.


Let $X$ be a topological space and $\sim$ be an equivalence relation on $X$ such that the quotient space $X/\sim$ is connected and each equivalence class of $\sim$ is connected (as a subspace of $X$ ). Then how to prove that $X$ is connected ?   I was trying to go by contradiction assuming $X$ has a non-trivial cl-open subset say $A$  and then trying to get a non-trivial cl-open subset of $X/\sim$ from that, but with no luck. Please help.

The problem says this:  Let $\sim$ be an equivalence relation in $X$ and consider the quotient space $X/\sim$. Prove that:   $X$ connected $\Rightarrow$ $X/\sim$ connected. If $X/\sim$ is connected and every equivalence class $[x] = \left \{ y\in X : y \sim x \right \}$ is connected then $X$ is connected.   Proof 1) is easy and I know how to do it. But I'm stuck in the proof 2). That's what I have tried:  Let's suppose $X$ isn't connected. Then, $X=U\sqcup V$ with $U$ and $V$ open.   Let $\pi : X\rightarrow X/\sim$ be the application that sends every $x\in X$ into his class. I want to see that $\pi (U)$ and $\pi(V)$ are open and that $\pi (U)\cap\pi (V)= \varnothing$ to conclude that $X/\sim$ isn't connected (because $\pi$ is surjective). But that is absurd, so $X$ must be connected.  I know how to prove that $\pi (U)\cap\pi (V)= \varnothing$, but I don't know how to show that $\pi (U)$ and $\pi(V)$ are open. Any advice?  Thanks!


If there was a perfect environment, and something was able to continue to heat up indefinitely, what would happen?.. What would be the outcome of something continuously heating up?

If heat is the measure of how fast the atoms are moving in an object, than isn't there a limit to how hot that object can get as nothing can go as faster than the speed of light. So because the atoms can't vibrate that fast, will there be a limit to how hot the object can get?


Please help me. I need gambas3-gb-qt4-webkit (>=3.8) very badly! It is required by Estru3D software for installation. I have installed gambas3-gb-qt5-webkit_3.8.4-2ubuntu3_amd64, but Estru3d won't recognize it at all!! I can't find that file anywhere!

I had problems installing Estru3D. It requires Gambas3 to be installed as a prerequisite. But it doesn't work with the newest Gambas3 installed in Ubuntu 16.04.


From the about me section of my profile:    When I go to my network profile's flair tab () I get following code:           which is broken (as can be seen when I paste this right below:    Manually navigating to the link given gets me to "Oops! Something Bad Happened!"  now... is it just me, or is the network-wide flair currently borken?  And if it's just me, could that be because I hid some of my "top communities" with the new feature?

My question is the same as . I put my stackexchange flair at the bottom of my sites:     And get a "profile for Ninsuo on Stack Exchange, a network of free, community-driven Q&A sites" link instead of my nice flair. By opening Firebug, I can read the following error:  Or as text:  NetworkError: 500 Internal Server Error -   I did not tried to update a new picture - just in case you want to get further first. Good luck!


I wonder if any users have thoughts about using TeX for documents that need to be editable in the future. I doubt, for instance, that I could build documents even from a few years ago:   Packages change, develop new conflicts, etc. Supporting technologies change (e.g., BibLaTeX has replaced BibTeX in recent years)   For many applications, this is irrelevant. But I have some materials that I would like to update in the future. I've run into a few situations where I return to a document after a year or two, and have to spend half a day debugging the code because the packages have changed.  Is there anything that can be done to address this within TeX, or would I need to look at an alternate format?

I was looking through some old files recently, and it occurred to me that they might be obsolete in the future.  Are there any steps that I should take for "archiving" my documents so that they will compile properly on later versions of LaTeX?  I once went to a seminar where it was indicated that the .dvi file can be converted back into a plain TeX file, so would it be the best "archival" document?


I was trying out some code of Scott Meyers Effective C++, item 3 in particular.  The code in his book should be very similar to this (he left out the constructor)  #include <iostream>   class TextBlock { public:     TextBlock(char* ptr) : ptrText(ptr)     {}      char& operator[](std::size_t pos) const {         return ptrText[pos];     } private :     char* ptrText; };  int main(int argc, char* argv[]) {     const TextBlock block("Hello");     std::cout << block[0] << std::endl;     char* ptr = &block[0];     *ptr = 'J';     std::cout << block[0]; }   At the point where I change the contents in the pointer ptr (*ptr = 'J';), I get a segmentation fault (which normally happens when dereferencing an uninitialized or freed pointer).  This is not happening here, what is going wrong at *ptr = 'J';

The following code receives seg fault on line 2:  char *str = "string"; str[0] = 'z';  // could be also written as *str = 'z' printf("%s\n", str);   While this works perfectly well:  char str[] = "string"; str[0] = 'z'; printf("%s\n", str);   Tested with MSVC and GCC.


I am trying to find the determinant of the following  $4\times 4$ symmetric  matrix $A$ given as $$A= \begin{pmatrix} a & b & c & d \\   b & c & d & a \\   c & d & a & b \\   d & a & b & c \end{pmatrix}$$ Any solution and help would be appreciated. Thanks.

Find the determinant of the following matrix in the terms of $a_1,a_2,\cdots,a_n$ explicitly, $$ \begin{bmatrix} a_1 & a_2 & a_3 & \cdots & a_n\\ a_2 & a_3 & a_4 & \cdots & a_1\\ a_3 & a_4 & a_5 & \cdots & a_2\\ \vdots & \vdots & \vdots & \ddots & \vdots\\ a_n & a_1 & a_2 & \cdots & a_{n-1}\\ \end{bmatrix} $$ When the determinant is zero?


I confess, I didn't jump on the Stackoverflow bandwagon when everyone else did. I've recently signed up and I have a reputation of 176 on stackoverflow.com. To my surprise, I now find that I need 20 to be able to participate in Chat. Is this 20 regarding meta.stackoverflow.com? I find it odd that when signing up it detects my Stackoverflow account and associated me yet ignores reputation.   What happens if I have absolutely zero interest in meta? I understood the chat is irrelevant of meta itself or was I wrong?

I get the point of having a minimum reputation to use the new chat feature. However, I was hoping my 2K reputation from Stack Overflow would be enough - but it looks like I need to acquire 20 rep here on Meta Stack Exchange.  So my question is - should this restriction be moved?


I am having Hp Pavilion 15 ab522TX. I have recently Installed Ubuntu 16.0.4 along with Windows 10 (Duel Boot). I am not able to access wifi in the system. It shows no wifi driver. See the .  $ ip link 1: lo: <LOOPBACK,UP,LOWER_UP> mtu 65536 qdisc noqueue state UNKNOWN mode DEFAULT group default qlen 1     link/loopback 00:00:00:00:00:00 brd 00:00:00:00:00:00 2: eno1: <BROADCAST,MULTICAST,UP,LOWER_UP> mtu 1500 qdisc pfifo_fast state UP mode DEFAULT group default qlen 1000     link/ether dc:4a:3e:f5:02:f1 brd ff:ff:ff:ff:ff:ff  $ lshw -C network WARNING: you should run this program as super-user.   *-network UNCLAIMED             description: Network controller        product: BCM43142 802.11b/g/n        vendor: Broadcom Corporation        physical id: 0        bus info: pci@0000:03:00.0        version: 01        width: 64 bits        clock: 33MHz        capabilities: cap_list        configuration: latency=0        resources: memory:94100000-94107fff   I tried sudo apt-get install --reinstall bcmwl-kernel-source:  Reading package lists... Done Building dependency tree        Reading state information... Done The following package was automatically installed and is no longer required:   signon-keyring-extension Use 'sudo apt autoremove' to remove it. 0 upgraded, 0 newly installed, 1 reinstalled, 0 to remove and 10 not upgraded. Need to get 0 B/1,515 kB of archives. After this operation, 0 B of additional disk space will be used. (Reading database ... 248596 files and directories currently installed.) Preparing to unpack .../bcmwl-kernel-source_6.30.223.248+bdcom-0ubuntu8_amd64.deb ... Removing all DKMS Modules Done. Unpacking bcmwl-kernel-source (6.30.223.248+bdcom-0ubuntu8) over (6.30.223.248+bdcom-0ubuntu8) ... Setting up bcmwl-kernel-source (6.30.223.248+bdcom-0ubuntu8) ... Loading new bcmwl-6.30.223.248+bdcom DKMS files... Building only for 4.4.0-47-generic Building for architecture x86_64 Building initial module for 4.4.0-47-generic Done.  wl: Running module version sanity check.  - Original module    - No original module exists within this kernel  - Installation    - Installing to /lib/modules/4.4.0-47-generic/updates/dkms/  depmod....  DKMS: install completed. modprobe: ERROR: could not insert 'wl': Required key not available update-initramfs: deferring update (trigger activated) Processing triggers for shim-signed (1.19~16.04.1+0.8-0ubuntu2) ... Processing triggers for initramfs-tools (0.122ubuntu8.5) ... update-initramfs: Generating /boot/initrd.img-4.4.0-47-generic   Still there is no sign of Wifi.  Then I tried, dkms status and I got the output:  bcmwl, 6.30.223.248+bdcom, 4.4.0-47-generic, x86_64: installed   I had tried varies method posted in the community. Nothing worked.

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.


Let $A$ be a square matrix. Prove that $A$ and $A^t$ have the same eigenvalues.    The solution my lecturer uses is: Consider the characteristic polynomial  \begin{align} P_{A^t}(x) &= \det{\left(xI-A^t\right)} \\ &= \det{\left((xI-A)^t\right)} \\ &= \det{(xI-A)} = P_{A}(x). \end{align}  Since the characteristic polynomials are equal and the eigenvalues are the roots of the characteristic polynomial, the eigenvalues will be the same.  However some of the steps he has taken seem to have come out of nowhere. How do we know $(xI-A^t) = (xI-A)^t$, also how do we know $(xI-A)^t=(xI-A)$?

Let $ \sigma(A)$ be the set of all eigenvalues of $A$. Show that $ \sigma(A) = \sigma\left(A^T\right)$ where $A^T$ is the transpose matrix of $A$.


I have a problem with collision detection in a 2D Java game.  Normally, what I would do is create a getBounds() method for an object that can collide with other objects. This method would return a new Rectangle(x,y,width,height), where x and y are the coordinates for the top-left corner of the sprite, and width and height are the width and height of the sprite.  But in the game I'm currently working on, there is a "tank" controlled by the user. The sprite of this tank rotates as long as the player holds one of the left or right arrow buttons. In other words, it can rotate to any angle. The tank's sprite is a rectangle.  So I can't simply do what I always do in this case.  How can I detect collision with this kind of sprite? Thanks

Say you have two Bounding Box Objects each of them storing the current vertices of the box in a vector with all the vertices of the object rotated and translated relative to a common axis.  Here is an image to illustrate my problem:   How can I work out if the two OBB's are overlapping any links to help explain the solution to the problem would be welcome. Nothing too convoluted please...


Debugging a DNSmasq server using it's logs, I find a LOT of:  dnsmasq: query[ANY] . from RANDOM-IP dnsmasq: query[ANY] . from RANDOM-IP dnsmasq: query[ANY] . from RANDOM-IP dnsmasq: query[ANY] . from RANDOM-IP   All legitimate queries seem to be more specific, like:  dnsmasq: query[A] specificdomain.com from KNOWN-IP   EDIT: This is NOT intended as a public DNS service  We want to create a white-list DNS filter, it should ONLY answer to a list of specified domains. Typical amplification attacks would only affect our server, nobody else. We just want a cleaner log to be able to operate better.  The intended operation is:   Client uses this DNS for their internet connection. Client requests domain resolution If the domain is in the white-list, we resolve, if not, we don't reply.   How can we achieve this? Only process request that match our white-list, discard anything else.

This is a  about securing public DNS resolvers   Open DNS servers seem pretty neat and convenient, as they provide IP addresses that we can use consistently across our company regardless of where they are located. Google and OpenDNS provide this functionality, but I'm not sure that I want these companies to have access to our DNS queries.  I want to set up something like this for use by our company, but I hear a lot about this being dangerous practice (particularly in regards to ) and I want to make sure that we do this right. What things do I need to keep in mind when building this type of environment?


I am doing multivariable calculus, and specifically double integrals. I am facing difficulties finding the domain of the integal, however i am given the following equations: $$1≤2x+y≤2$$ $$0≤x−2y≤1$$ Through these two equations i am supposed to find the area of integrals for each of the variables i.e $x$ and $y$ I set them as simultaneous inequalities but it doesn't seem to help because i get the boundary for xx to be $$2/5≤x≤1$$ and for $y$ to be $$4/5≤y≤0$$  which is obviously WRONG because how can the lowest boundary for the integral possibly have higher value than that in the higher.   please don't get me wrong, I am thankful to all the lovely & helpful people who tried to help (Henning Makholm, Shardulc, AlphaGo) and for the up-voting, its just i was new to this community and i thought they wanted my email to spam me, so i logged in as a guest.  Anyways, i just don't get how all these people arrived at their solution, is there a known way to solve such problems? Thank you all for everything.

I am doing multivariable calculus, and specifically double integrals. I am facing difficulties finding the domain of the integal, however i am given the following equations: $$1 ≤ 2x+y ≤ 2$$ $$0 ≤ x-2y ≤ 1$$  Through these two equations i am supposed to find the area of integrals for each of the variables i.e $x$ and $y$  I set them as simultaneous inequalities but it doesn't seem to help because i get the boundary for $x$ to be $2/5 ≤ x ≤ 1 $ and for $y$ to be $4/5 ≤ y ≤ 0 $ which is obviously WRONG because how can the lowest boundary for possibly have higher value than that in the higher.   Guys, I really appreciate you help, it means the world to me.


I needed to find a good Perl module to do HTML parsing.  The good thing about Perl is the CPAN (module library) with gazillions of modules to do everything, the bad thing is that it's hard to find the right module.  So I though, let's ask Stack Overflow: “What is a good Modern Perl way to parse HTML documents?”  I quickly got one great answer and several good comments.  I would have gotten at least one more good answer, but then the question was put on hold because it's “subjective”, and it couldn't be added anymore.  In spite of protests, it was then closed and later deleted.  I've got the answers that I needed, but now other people will be deprived of this useful information.  Is it really so important to stick to the rules that this question had to be removed? Yes, it's subjective.  By definition.  I want people's opinions about what module I should use, after all. The question got 8 plus-votes and 2 minus-votes, so others thought it was useful too.  The URL was  , but I think it only works when logged in as me.  Do I need to start looking for another site to ask such questions?  If so, too bad, I really liked Stack Overflow until now.

Recommendations are a recurring topic on multiple Stack Exchange (SE) sites. Some sites allow recommendations (ex: ), some do not (ex: ). There are many reasons for that and I can still remember animated discussions on this subject on the Gaming meta. Then there is that existential problem with Sci-Fi SE, "What problems does answering a question on this site solve?"  The only common problem I can think of is What to read/watch next?, which obviously led to a big number of recommendation questions, later slightly disguised as list question. And the main trouble with these questions isn't objectivity at all, some of them aren't even subjective. It's the fact that they don't have an answer - they are open ended. -  Those questions are monstrously popular because:  There's an actual problem to be solved,  or  This problem is quite common.  In view of the  blog post, a recommendation question fails the "real questions have answers, not items or ideas or opinions." criteria. But it's still a "practical, answerable questions based on actual problems that you face. " and it requires expertise to answer. The problem is that there are multiple acceptable answers, and the asker is not the best person to evaluate the best answer because he doesn't know which one is the best compared to the others, and he cannot test it in short term. Even the need to accept an answer is questionable. So, is a recommendation question an acceptable kind of list-type question or should it be closed just like any other list-type questions?


char[] Char = {'a','b'}; String str = "ab";  String c = new String(Char);  if(str == c){     System.out.println("working!"); }   I've converted the array "Char" to a String "c" but when i try to use it in the if-statement it's nor working. Nothing prints out and no erors.  Help please!

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?


As Donna notes in The Doctor's Daughter:     He saves planets, rescues civilizations, defeats terrible creatures, and runs a lot. Seriously, there's an outrageous amount of running involved ..."   I've been an huge Doctor Who fan since the relaunch in 2005 and I've often heard it mentioned that there's a lot of running in newer episodes (, , many more).  However, I've seen only a couple of the older episodes (a couple of Tom Baker episodes a long time ago and the Paul McGann movie in the 90s).  I'm just curious: can someone who was a avid watcher of the older episodes (pre-2005) tell me, has a lot of running always been a recognized characteristic of Doctor Who episodes or has it become more prevalent in episodes since the 2005 relaunch, perhaps because of the recent writers or the recent actors that have been playing the Doctor?

Thanks to Netflix Streaming, I've been watching some random classic Doctor Who stories.  One thing that strikes me as different between the modern Who and old Who was that in modern Who, they do an awful lot of running.  It's become a sort of running gag that they've referenced in-universe.  In the classic Who I've seen, he tends to drive around quite a bit instead.  In addition, The Doctor in modern Who is incredibly reliant on his sonic screwdriver, which I often don't see at all in classic Who stories.  Did the Doctor running and the sonic screwdriver get introduced over time in classic Who, or were they both added as part of the modern Who revival?


I want to uninstall Windows and install Ubuntu on my laptop. For now I have Windows 7 Professional and the version of Ubuntu that I want is Ubuntu 13.04. My question is:     What should I do to uninstall Windows 7 and install Ubuntu 13.04 on my laptop?   Thanks.

My laptop is filled with viruses and Windows XP is just becoming impossible to work with.   I've been interested in Ubuntu for a while, so, would I be able to use something like Debian to clear my HDD and OS and then install Ubuntu and start fresh?


I want to turn some verts, but I wan't them to be still in the original x and y cooridanetes. Is there a way which doesn't need the boolean cut?  So I wan't the result from B with, and not from A.

I'll try to explain in this gif. I am doing this manually in 2 steps - rotate, scale. And I select all vertexes. Is there instrument rotate them in one step or can I move one and make other move too?


If I'm currently on salesforcedx 47.15.0 as shown from sfdx plugins --core, is there a way to install/update the salesforcedx plugin to version 47.09.0?  I originally installed the sfdx-cli from the .pkg file from the .  Would it be possible via npm?  Thanks in advance!

I'm wondering whether it's possible to downgrade sfdx-cli to use an earlier version?  I'm trying to debug an issue with using it in pipeline scripts.  When I run sfdx version --core I get sfdx-cli 7.28.7 (core) .    If I run  sfdx version I get  sfdx-cli/7.28.7-7bceba6f24 darwin-x64 node-v10.15.3 .  If I do cat package.json inside the actual package dir for sfdx-cli after doing npm install sfdx-cli@7.26.0 I get  "sfdx-cli": "^7.26.0"  Why does it then show that the version is 7.28.7?  How can I force the lower version to have preference?  I do understand that this question is not really salesforce specific but hopefully someone has run into the same problem.


Running Ubuntu 12.04, while in a terminal, I type ls and see list of folders, including the downloads folder. I then type cd downloads, press Enter. I get:  bash: cd: downloads: No such file or directory   I tried each folder, on two computers. What am I missing?

How do I change directories to downloads, from the home folder, in the latest version Ubuntu 12.10? I tried cd /downloads, but it gave an error saying that there is no such directory.


I am a newbie in JavaFX and I try by clicking on one imageview (ImageView1)get its image and set another imageview (ImageView2) with that image.  BufferedImage actualBufferedImage= SwingFXUtils.fromFXImage(ImageView1.getImage(), null); WritableImage actualImage= SwingFXUtils.toFXImage(image, null); ImageView2.setImage(actualImage);   But I got NullPointerException. This exception happens in setImage line. I can not find out why actualImage is null after toFXIamge.

What are Null Pointer Exceptions (java.lang.NullPointerException) and what causes them?  What methods/tools can be used to determine the cause so that you stop the exception from causing the program to terminate prematurely?


Give a counter example to show that a sentence of the form $\forall x (F \vee G) \rightarrow (\forall x F) \vee (\forall x G)$  I know that I should use two particular formulas $F$ and $G$ from some language and also a particular structure interpreting that language in such a way that $\forall x (F \vee G) \rightarrow (\forall x F) \vee (\forall x G)$ is not true in that structure, not sure where to go with this though.

I know that a universal quantifier can be distributed over conjunction and not disjunction, but I'm having a hard time wrap my head around it. Why is this the case? Is there an example of a statement that would demonstrate this principle?


I wonder if this is a bug, or if I missed something... When a light hits tangentially convex surfaces with "smooth shading", the shadow on this surface seems to "partially ignore" the smoothness of the surface. Here is an example with a simple cylinder :    On the left, a cylinder with "flat shading". Everything's ok. On the right, the same with "smooth". We can see an edge, bad shadowed.  With or without the "Edge split" modifier, no matters, the edge is still there. The shader is a simple white diffuse shader with no texture nor displace.  I have to add a subsurf modifier with at least 2 levels, which will insanely increase the vertex count... And I can't do that for my project.  I hope someone already saw it, and have a little tip to share. Or if someone already know it's a bug, or a limit of the current Cycles renderer ?


My website has seen a dramatic drop in search engine traffic (over 50%) since swapping to https 2 months ago.   I have .htaccess rules for 301 redirects and since it is a Wordpress site, I also have a SSL plugin to change URLs on the website.   What could be causing this slump?

Currently look after 3 websites. I changed one of them to be HTTPS as it's ecommerce, however have seen a huge drop in organic traffic since this was implemented. Went from around 800 impressions to 400.   Any ideas as to why?   Very concerning as I expected it to improve if anything!  I set up 301 redirects to carry through to old pages to http://www.example.com/product1 would go to https://www.example.com/product1  I also set up a separate webmaster account for the HTTPs version as our integration wasn't working well with Google Merchant Centre, and data is flowing correctly but unsure why/if this would cause conflict.  Very confused!


The recent question  made me realize that I don't have any understanding of why one would upload to a preprint site.  (I don't work in a field where they seem to be common.)  Why would one be concerned about getting a manuscript on arXiv, if it's already under review with a journal?   Is it because of the long publishing timeline of journals?  (That could explain why computer science — which publishes much more in conferences — doesn't seem to do much with them.)

Some fields like Economics and Maths have their work in progress published as "working papers" with notes like "work in progress, do not cite or quote without the author's permission."Sometimes they upload these to their own websites or to their universities websites. I don't see much of this going on in my own field (sociology). I have heard from people that are afraid of having their work scooped or that fear that work published in this way will not be considered as "unpublished" by journals and conferences.  What are the advantages of making work in progress available in this way?


I have a domain name at GoDaddy and have forwarded it to an external domain, using the settings 301 with mask.  However, when I go to my GoDaddy domain and press view source code then I only get that the page is embedded in a frame. Like this:  <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN"    "http://www.w3.org/TR/html4/strict.dtd"> <html>  <head>   <title>TITLE HERE</title>   <META name="description" content="DESCRIPTION HERE"><META name="keywords" content="KEYWORDS HERE"> </head> <frameset rows="100%,*" border="0">   <frame src="MYGODADDYDOMAIN.COM" frameborder="0" />   <frame frameborder="0" noresize /> </frameset>  <!-- pageok --> <!-- 04 --> <!-- --> </html>   How can I prevent this and get a normal redirect?

I am trying to configure my domain to forward to my app engine application.  For the forwarding I can choose from "forward only" and "forward with masking". Assume my domain is called "myDomain.com" and my app  is located at myApp.appspot.com. If I choose "forward only" and I go to myDomain.com, I get redirect to myApp.appspot.com (myApp.appspot.com also showing in the address bar -> But I want to show myDomain.com of course).  If I choose "forward with masking", "myDomain.com" is always shown in the address bar, even if I navigate to some subpage. The URL then should look like e.g.: "myDomain.com#!page:xyz", but still shows "myDomain.com".  Is there some way in the middle?


On my web application that is built using Yii 2 PHP, We send out emails using Swiftmailer  It is configured to connect to an SMTP server to send the email - to avoid problems.   The Emails are in HTML and do have a link in the body of the mail. On gmail accounts these emails go straight to the spam folder.  Any advice on how to fix this problem would be great please!  My Swiftmailer is configured as follow:      'mailer' => [         'class' => 'yii\swiftmailer\Mailer',         'useFileTransport'=>false,         'transport' => [             'class' => 'Swift_SmtpTransport',             'host' => 'mail.domainhere.com',             'username' => 'address@domainhere.com',             'password' => 'PASSWORDHERE',             'port' => '465',             'encryption' => 'ssl',         ],     ],   When i send emails to my own gmail account i get this warning on the email:  Be careful with this message. Many people marked similar messages as phishing scams, so this might contain unsafe content  Thanks! Jason

I have the following arrays:  $artist = array("the roots", "michael jackson", "billy idol", "more", "and more", "and_YET_MORE"); $count = array(5, 3, 9, 1, 1, 3);   I want to generate a tag cloud that will have artists with a higher number in $count enclosed in h6 tags and the lowest enclosed h1 tags.


Is there a method to check whether a function is integrable?  Of-course trying to solve it is one but some questions in integration may be so tricky that I don't get the correct method to start off with those problems. So, is there a method to find correctly whether a function is integrable?   Clarification: I am asking about indefinite integrals which have no elementary anti derivative.

In the past, I've come across statements  along the lines of "function $f(x)$ has no closed form integral", which I assume means that there is no combination of the operations:  addition/subtraction multiplication/division raising to powers and roots trigonometric functions exponential functions logarithmic functions  which when differentiated gives the function $f(x)$. I've heard this said about the function $f(x) = x^x$, for example. What sort of techniques are used to prove statements like this? What is this branch of mathematics called?  Merged with "" by : Sometimes we are told that some functions like $\dfrac{\sin(x)}{x}$ don't have an indefinite integral, or that it can't be expressed in term of other simple functions. I wonder how we can prove that kind of assertion?


When I open the file explorer it only shows the home directory. It doesn't show any of my hard drives of computer.  How can I make the file explorer show available hard drives?

When I open nautilus does not open the left bar where it says computer and down markers such as music, documents, videos, downloads. I reinstalled nautilus from the synaptic package manager but nothing happened. What I can do to make that bar visible again?


There can't be over 50k current close votes. :     Close votes age away harmlessly after 4 days if the threshold is not reached.    for instance . It has no visible close votes when I open the question which means the close votes aged away.   But why is that question still in the review queue? It should be removed.

In the SO Review page , I see the following stats for questions awaiting review:   Close votes:  51.8k (and rising) Suggested edits: 10 (fluctuates, but rarely goes above 20) Everything else: 0 (occasionally see some if you're really lucky)   My question is: Why?  Why are there so many close votes waiting for review? Close votes should expire after four days. And even if there's a good reason for them hanging on longer (ie they're not being viewed), there surely has to be a cut-off eventually after which they can be safely dropped?  And yes, I saw , which is asking basically the same thing. But that was several months ago, and it seems that the queue has hardly moved since then. It seems to me that there's a massive backlog that will never be cleared, and apparently will never expire either. That's not good.  And on the flip side, why are there hardly ever any new user posts or low quality posts to review -- there are always new users posting things, and I recall before this new review system was launched that the list of low quality posts to review was always pretty big.


I have an Excel table. I want to highlight the rows in which at least one element is different from the others for a given row. How can I do that? An example:    PRODUCT         COLUMN 1   COLUMN 2     COLUMN 3  Product 1       2,080.30    2,070.00    2,080.30  Product 2       2,728.20    2,728.20    2,728.20  Product 3       3.50        3.50        3.50  Product 4       1,720.00    1,720.00    1,720.00  Product 5       513.50      513.50      513.50   Row 1 will be highlighted.  Thanks

I am comparing setting files between devices and have loaded all the settings into an excel sheet.  I want to see if any setting is deviating between the devices.  Example:  Setting1: ok   ok  ok  ok  ok  Setting2: 100  100 104 104 103  Setting3: no  yes  no  yes  yes   Setting4: 30  30  30  30  30  Now i want line 2 and 3 to be highlighted because  the values are not equal on those rows. How to do that? I tried a conditional formatting with "A1=B1=C1=D1" should be green, but that did not work


I am keep trying and trying to change my skin and i dont  want to buy mine craft again. Mine craft works fine but  just wont let me get a new skin.This is the first time it did this.I am on pc ASUS

I updated Minecraft PE so I can have custom skins. I clicked on 'restore skins' without selecting any particular skin, It is now stuck with a  message saying 'we're restoring your skins!' but it has been like that for 20 minutes. Is there a reason why it is like this?


Actually, I have to send a huge array of jsons to download a file. If we can do that, we can have huge array of jsons in request body.  I know 2 ways so far: 1. Using simple form submit POST request, which reloads page. 2. Using AJAX POST request, which makes us to hold whole file bytes formatted data from response.data at client side and then, save the file using BLOB, etc from third party js frameworks.  I have another approach, which can send huge json array in GET request using anchor tag or window.location. Is it reliable? where huge json array is appended to GET request URL. How much data, can URL hold?  Hope someone help me out. Thanks in advance.

What is the maximum length of a URL in different browsers? Does it differ among browsers? Is a maximum URL length part of the HTTP specification?


like i said i have a 27.5 inch by either 2.2 or 2.0 (rather 2.0 but i'm not 100% sure) width and there aren't many tires with size 2.0 in shops at my place. Probably will go with a different width and i want to Ask is that fine. For ex. 2.2 inches. Will that fit fine? I want to go tubeless too. Which tyre will be good for dry terrain and asphalt under 40€?

We are planning on doing some mountain biking in a few weeks time and we'd like to get some wider tyres for my wife's hybrid. I know there are similar questions and answers out there on this topic, but I need some specific help to make sure I buy the right tyres.  The bike is a Ladies Scott Sportster 50 2015, the best website I could find with a fairly accurate spec is     It's currently got Kenda K-180 700 x 38c / 30TPI tyres on it, which are fairly good all rounders and capable of running on clean forest paths but I don't think they would handle anything heavier.  It's got disk brakes so there isn't a clearance issue there, but I have noticed the frame is generally narrower than true MTBs, here are some photos i took of it.    Has anyone put larger, knobblier tyres on this kind of hybrid? whats the largest I can get away with? - I'm also slightly confused by all the tyre sizing, I'm sure someone told me this is a 27.5" tyre, but 700 seems to mean 29" on a lot of websites.  Any advice is very much appreciated, Thanks.


This would be an old science fiction short story, probably 90's or before... possibly decently before. It tells of a prince (or equivelant) who, before he can be confirmed as a prince, has to undergo a test on some primitive planet, or a primitive area of their planet. He has a servant or someone who goes with him for the test. The boy ends up dying on the test, or otherwise failing, and the servant, when he comes back to the king, is forced to say 'he was a coward'.

I read this short story around 1971.  The basic plot is for a steward to lead the king's son to another city state.  Along the way they have a number of interactions with people/subjects that demonstrate the immaturity of the son.  Last one involves the son beating up the suitor of a innkeeper's daughter.  When confronted by the steward, the son displays his contempt and chauvinistic regard of his future subjects and the steward kills him.  Turns out the trip was a test of his suitability to assume the crown and the steward explains to the king that he was not worthy.  Been looking in all the anthologies can seem unable to find it.  Thanks for your help


Let $F \subset G_i \subset E, (i=1,2)$ where $E$ is normal and finite dimensional over $F$.  Assume $E$ is separable over $G_1$ and $G_2$.  Prove $E$ is separable over $G_1 \cap G_2$  There is a hint to use this theorem that states that a finite dimensional field extension is Galois iff it is normal and separable. I think that this means we need to show that $G_i \subset E$ are Galois, which in this case is equivalent to showing that the extensions are normal.  I have a proposition that states that any intermediate field extension is normal so these extensions are normal and therefore Galois since we are given separable.  I do not see how $G_1, G_2 \subset E$ being Galois implies that their intersection is separable.  Is the intersection of two Galois extensions Galois or am I supposed to just use the definition of separable (in which case, why did I even find they are Galois), to show  that $E$ is separable over $G_1 \cap G_2$?

Let $E\mathop{/}F$ be a finite-degree normal extension of fields. Let $K$ and $L$ be intermediate fields (that is, $F\subseteq K\subseteq E$ and $F\subseteq L\subseteq E$) such that $E$ is separable over both $K$ and $L$. Show that $E$ is separable over $K\cap L$.   So I was thinking that if $f=\min_{K\cap L}(\alpha)$. Then $\min_{K}(\alpha)$ divides $f$. But if $f$ has repeated roots then I don't see what goes wrong.   Thanks!


I have an list of ordereddict of tuples   [     OrderedDict([('id', 7), ('info', 'info_data')]),     OrderedDict([('id', 5), ('info', 'info_data')]),     OrderedDict([('id', 6), ('info', 'info_data')]),     OrderedDict([('id', 8), ('info', 'info_data')]) ]   It is possible to sort by 'id' it and receive next list or ordereddict  [     OrderedDict([('id', 5), ('info', 'info_data')]),     OrderedDict([('id', 6), ('info', 'info_data')]),     OrderedDict([('id', 7), ('info', 'info_data')]),     OrderedDict([('id', 8), ('info', 'info_data')]) ]

I have a list of dictionaries and want each item to be sorted by a specific value. Take into consideration the list: [{'name':'Homer', 'age':39}, {'name':'Bart', 'age':10}]  When sorted by name, it should become: [{'name':'Bart', 'age':10}, {'name':'Homer', 'age':39}]


I went into my profile just recently and i saw this    as you can see, just the tabs for my profile are in portugese. i asked this in the chat room i'm always in to see if anyone else was getting the same thing and apparently not. i was told to check my language settings. since i have never touched the PC ones i checked my browser    and just to show it isn't just a Beta Site, Stack Overflow    However it's not happening here on Meta    I am wondering what's going on here and how can i fix it?

A few minutes ago, when I viewed profile pages on my phone, the tabs were all in Portuguese:   On the mobile interface:   On the full site     But it didn't happen on my desktop, and now it's back to normal.  Other users report that the site is normal, but  says it's still happening, so I've decided to post this bug report even though it seems to be working for me at the moment.   Perhaps it's some sort of intermittent problem.  I'm posting this on Meta.SE, since it seemed to happen on both Japanese.SE and ELL.SE, so it doesn't seem to be specific to a particular site.


When citing the K-means algorithm in a paper, what is the standard reference?  I ran into  paper through some digging around but I am not entirely sure if this one is still the correct one.  I could potentially cite ESL but I wanted to know if people here had any opinion on this.  I am not looking for a reference to a specific implementation of the algorithm, just a generic reference.

K-means is probably one of the most used algorithms for clustering. I was looking for bibliography for its first use, but it has been around a lot, so what's the first one?  Also, when was the algorithm first named "k-means"?


I am taking a Mooc on grammar and punctuation on Coursera, and have been asked a question during a lecture:  Do these two sentences have similar meaning or different meaning? Julie has studied French for two years. Julie has been studying French for two years.  I thought the answer was : different meaning. In the first case, Julie has studied French for two years, but may not be studying it still. In the second case, if she has been studying for two years, it means that she is still studying it. Weel, the answer was that the two sentences had the same meaning. It was not an error of correction in the quizz, as the teacher later explained:  These two sentences have pretty much the same meaning. A lot of times present perfect and present perfect progressive have the same meaning and can both be used.  And continued with:  Here is some other examples where the two sentences have about the same meaning. Bart has lived in Ireland for two years. Bart has been living in Ireland for two years. Sofia has worked at Apple for four months. Sofia has been working at Apple for four months.  Can someone explain this to me? Thank you!

I have studied "present perfect" and "present perfect continuous" for a week. I know forms, verb and helping verb I should use when I write them.  For me, they have nearly same definition because I can use them interchangeably in Thai language. (My native language)  For example, the sentences        I have learned English language in the past few weeks.    I have been learning English language in the past few weeks.       have no difference in meaning to me. They both mean "I began learning the English language in the past and I am still learning it"  Can I use them interchangeably in English? Or is there any difference between them? For example, when should I use present perfect but not present perfect continuous?


I'm trying to create a buffer around a feature in a polygon in QGIS. Trying to do 100m buffer, but when I run it, I just get a huge circle around what my shapefile was showing originally.  I have tried changing CRSs on the layer, and the project a million times. I always try to find one that uses meters (+vunits=m right?). I've saved the layer and opened it fresh to make sure the project  had the same CRS and it keeps doing the same thing. Is there something obvious I'm doing wrong?

I'm very new to the GIS world, so my problem could be very stupid, but I'm going to try anyway.  Objective  Given a list of coordinates in longitude/latitude, stored as a .csv file, I want to create a buffer with distance of x km around those coordinates. (In case this is relevant, these coordinates are locations of the societies in the . These societies scatter all around the world.)  Problem  I'm only able to create buffers with distance in radial degrees, but I want to do them in (kilo)meters. I'm aware of the following Q&A's, but following what's suggested therein doesn't seem to solve my problem:          What I have tried...   I start QGIS (v2.4), and Add delimited text layer  choose my .csv file and the x/y fields, click OK select WGS 84 as my CRS (also tried NAD83 but didn't make a difference), click OK right-click on layer and select Save As..., in the dialog box, choose the following and click OK:  add sccs_meter.shp as layer to the current project Select Vector > Geoprocessing Tools > Buffers > set buffer distance as 10   The result is a buffer with radius of approximately 1068km, which suggests that buffer distance is 10 degrees rather than 10 meters.  What did I do wrong here?


How can I integrate this:  $$\int_1^3 \frac{\ln(x)}{\ln(x)+\ln(4-x)}dx ?$$ I tried making a substitution $t=4-x$  but it doesn't help.  Are there any tricks to solve this integral easier?

How can I find the value of this following definite integral?     $$\int_2^4\frac{\sqrt{\log(9-x)}}{\sqrt{\log(9-x)}+\sqrt{\log(3+x)}}dx$$


Is there any difference between the two?     What do you see?       What are you seeing?

Are you seening family members arriving at the hospital to find some of the miners? ( exact quote from BBC presenter asking someone over the phone )  Do you see .......  Difference in meaning not grammar.


After having played with curl, a binary file has been dumped inside my terminal. For example, the horizontal lines: ─ I use to format my prompt are replaced by 'q', and it can be much worse.   Why does this happen, and how can you fix it without having to close the terminal ?

I'd tried command cat with an executable file:  cat /bin/ls   Now I can't read any word in this terminal (Linux console). How can I fix it?


For some reason when i render my scene in Blender my minecraft grass texture has a black background, not all the grass has the black background but most do and it is an annoyance. I just want to know how to fix it. I didn't change any settings, and I can't seem to find a solution anywhere after googling for an hour. There is a video how ever it is using Blender Render, and I am using Cycles.

Using v2.73, cycles and a very simple scene: an array of cubes, no big deal.   If I set the shader's material to transparent, the cubes in the foreground do become transparent but those far away in the back do not disappear completely and this strange dark things appear (visible in rendered mode and in final renders)    I've played with the clipping distance on the viewport and camera, but I can't figure out how to make those ghosts go away...


I have just started studying covariant and contra-variant vectors in special relativity. I am finding difficulty understanding this topic. Can anyone recommend a book (with a detailed chapter) or lecture series for the same?

I am looking for a textbook that treats the subject of Special Relativity from a geometric point of view, i.e. a textbook that introduces the theory right from the start in terms of 4-vectors and Minkowski tensors, instead of the more traditional "beginners" approach. Would anyone have a recommendation for such a textbook ?  I already have decent knowledge of the physics and maths of both SR and GR ( including vector and tensor calculus ), but would like to take a step back and expand and broaden my intuition of the geometry underlying SR, as described by 4-vectors and tensors. What I do not need is another "and here is the formula for time dilation..." type of text, of which there are thousands out there, but something much more geometric and in-depth.  Thanks in advance.


I recently did this exercise and I was hoping to get some feedback on my proof.     Given an real matrix $A$ such that $A^2=A$. Show that A is   diagonalizable.   Proof: Assume that $A \in R^{nxn}$, and assume that we have the linear map $V \longrightarrow V$ such that $x \mapsto Ax$, where $V$ is an arbitraty vector space with $\dim V = n < \infty$.  $A$ is diagonalizable if there exists a matrix $T$ such that $D = T^{-1}AT$, where $T$ is the matrix with $n$ linearly independent eigenvectors of $A$ and $D=diag(\lambda_1,...\lambda_k)$ if we assume $k$ eigenvalues to $A$.  Note that for any vector $x\neq0 \in V$ we have $Ax = \lambda x$ but also $Ax=A^2x=A(Ax)=A(\lambda x)=\lambda(Ax) = \lambda^2x$ and thus $(\lambda-\lambda^2)x=0$  and so the only eigenvalues to $A$ is $\lambda_0=0$ and $\lambda_1=1$.  Call the corresponding eigenspaces $E_0 = \{x\in V | Ax=0\} =: \ker(A)$ and $E_1=\{x\in V | Ax=x\}$  Thus, we can express $V = E_0 \bigoplus E_1$ and it follows that $\dim V = n =\dim E_0 + \dim E_1$ and thus we know that we have a set of $n$ linearly independent eigenvectors.  Therefore $A$ is diagonalizable. $\blacksquare$  The last step is where I'm a bit unsure. I'm thinking that because we only have two eigenvalues, the space $V$ must be a direct sum of the two corresponding eigenspaces, am I right? Also, am I right when I say that because the sum of the dimensions of the two eigenspaces is $n$, we know for sure that we have $n$ linearly independent eigenvectors? I think that makes sense.  Cheers

How to prove that any idempotent matrix is diagonalizable?


Please let us know how to cover the line oppID.add(convopp.ConvertedOpportunityId);  in below class.   public class sampleclass  {    public static void sampleMethod(List<Lead> convertLeads)    {       List<Opportunity> oppList = new List<Opportunity>();       Set<ID> oppid = new Set<ID>();        List<Lead> leadList = [Select Id,name,ConvertedOpportunityId from Lead where id =:convertLeads  ];        for(Lead convopp : leadList)       {           oppID.add(convopp.ConvertedOpportunityId); // this line is not covering       }      }   }      Test class   @IsTest  public class sampleClass_Test {     static testMethod void test1(){          Lead l1 = new Lead();         l1.LeadSource = 'Internal Referral';         l1.FirstName = 'test1';         l1.LastName = 'test2';          l1.Company = 'test';         l1.Status = 'Qualified';         insert l1;         test.startTest();          Database.LeadConvert Leadconvert = new Database.LeadConvert();         Leadconvert.setLeadId(l1.Id);         LeadStatus Leads= [SELECT Id, MasterLabel FROM LeadStatus WHERE IsConverted=true LIMIT 1];         Leadconvert.setConvertedStatus(Leads.MasterLabel);         Database.LeadConvertResult Leadconverts = Database.convertLead(Leadconvert);          System.assert(Leadconverts.isSuccess());          List<Lead> listLead = new List<Lead>();         listLead = [select id, ConvertedAccountId, ConvertedOpportunityId, IsConverted from lead where LastName = 'test2'];         System.debug('listLead ***'+ listLead);         sampleclass.sampleMethod(listLead);         test.stopTest();      }     }

This is a canonical question and answer developed by the community to help address common questions. If you've been directed here, or your question has been closed as a duplicate, please look through the resources here and use them to shape more specific questions. To browse all canonical questions and answers, including more unit test resources, navigate to the  tag.  This canonical question is intended to address several classes of common questions by providing a quick summary and links to comprehensive resources:   How do I start writing my first unit test?  How do I unit test this code?  I need help writing this unit test.   Salesforce Stack Exchange looks for detailed, specific questions that the community can help you with, and can't write tests on your behalf. We feel that working with the resources below can help you get started, and we encourage you to make an attempt to write your test and return to SFSE with your specific questions when you encounter challenges you can't resolve.


Lubuntu Raring Ringtail. I want to be able to execute my scripts with ./  I start my python script with #!/usr/bin/python and it says  bash : ./myscript.py: /usr/bin/python^M: bad interpreter: No such file or directory   If I use #!/usr/bin/env python it gives a similar error:  : No such file or directory   What am I doing wrong?  I absolutely have python installed, and can run the scripts as normal with python myscript.py

Trying to get casperjs running on Ubuntu 12.04. After installing it when I run I get:   09:20 $ ll /usr/local/bin/casperjs lrwxrwxrwx 1 root root 26 Nov  6 16:49 /usr/local/bin/casperjs -> /opt/casperjs/bin/casperjs  09:20 $ /usr/bin/env python --version Python 2.7.3  09:20 $ cat /opt/casperjs/bin/casperjs | head -4  #!/usr/bin/env python  import os import sys  09:20 $ casperjs : No such file or directory  09: 22 $ python Python 2.7.3 (default, Sep 26 2013, 20:03:06)  [GCC 4.6.3] on linux2   So Python is present and runnable, casperjs is pointing to the right place and it is a python script. But when I run it I get "No such file".   I can fix it by changing the first line of the casperjs python file from:    #!/usr/bin/env python   to:   #!/usr/bin/python   Result:   $ casperjs --version 1.1.0-DEV   I managed to fix it, but I'm wondering why it didn't work with #!/usr/bin/env python, since that seems to be a normal interpreter line. Do I have something configured wrong?   Here are the steps to get casperjs:   $ git clone git://github.com/n1k0/casperjs.git $ cd casperjs $ ln -sf `pwd`/bin/casperjs /usr/local/bin/casperjs $ casperjs : No such file or directory


Well I read the other topics similar to this but would like a fuller explanation on how to fix this problem if there is one. I have figured out how to load static Daz objects into Blender with the texture maps applied. Now that is good news.  But when I change from Blender Render to Cycles some of my excitement is gone as the textures disappear and the object turns white. With the new Blender 7.9 is there an easy way to fix this. I really don't want to unwrap ever model I bring into Blender so I can re-texture it.  How can I keep my materials from the Blender Render to Cycles?

How does Cycles work and how is it different from Blender Internal?  Which is better?


It would be more convenient than having the costumers manually filtering them, and it's useful too. Similar question websites supports such features after all.

I was going to make a filter for the "" by excluding some sites from it.  I noticed  which talks about "negative filtering" but does not explain how one can do it or if it is possible.  There does not seem to be a way to do this, though.  On the filter page, my only options are:  So how can I do "All sites except [list]"? It would also be nice if this could include similar functionality with the meta checkbox.  Something like "All main & meta sites except..."


Clearly, $\infty -\infty \not =0$ I have a feeling the squeeze theorem can be applied here, but I am not sure how to write the required terms separately. Can I get a hint?

Show $ (n+1)^{1/3}-n^{1/3} =O\left(n^{-2/3}\right) $ So we multiply both sides by $ n^{2/3}$ which should equal a constant, but I get $ (n^2(n+1))^{1/3}-n $ and when $n$ goes to infinity this equals zero?


Why is it that many packages in apt-get are outdated? For example, I would like to get the latest implementation of the clojure programming language onto my machine. However, running the command apt-cache search clojure I get the following:  clojure - a Lisp dialect for the JVM clojure-contrib - user contributed set of libraries for clojure clojure1.2 - Lisp dialect for the JVM clojure1.3 - Lisp dialect for the JVM leiningen - simple build system for Clojure libclojure-maven-plugin-java - Clojure plugin for Maven libclucy-clojure - Clojure interface to the Lucene search engine libjava-jdbc-clojure - Clojure interface to sql databases via jdbc librobert-hooke-clojure - Function wrapper library for Clojure libtools-logging-clojure - Logging macros for Clojure   All the clojure implementations are old (clojure is version 1.1). The newest release of the clojure programming language is 1.5.  Why is it that packages are not up to date? Do I need to reconfigure my apt-get program?

Why are packages in the official Ubuntu repositories older than the latest (upstream) versions from Debian Sid, PPAs, the authors, etc.?


I am starting to learn about proofs and I ran into this problem:  Prove that the product of 3 sequential numbers is divisible by 3  I am going to present my thoughts on how to prove that and any feedback about whether it is wrong or not would be very appreciated. Thank you in advance Lets fisrt prove that n³-n is divisible by 3 using Induction:  Constraints n ∈ Z - {-1, 0, 1} m ∈ Z  When n = 2,  n³ - n = 6 -> Proved for the base case  n = k Then k³ - k = 3m  Lets proof for (k + 1) (k + 1)³ - (k + 1) =  k³ - k + 3k² + 3k = 3m + 3k² + 3k = 3(k² + k + m) -> Proved  Now, lets prove the conjecture of this question by deduction, which is:  Prove that the product of 3 sequential numbers is divisible by 3  (n - 1)(n)(n + 1) = (n² - n)(n + 1) = n³ - n Because It was previously proved that n³ - n is in fact divisible by 3, then it is proved as well

If $8q,8q+1,8q+2$ are consecutive positive integers, then prove that at least one among them is a multiple of $3$.  One proof is that by expressing $8q=3m+r$. Is there any other way of doing it without taking $8q=3m+r$?


Given an integral domain $R$, we have that $R^n$ embeds in $R^{n+1}$ as free modules over $R$. Can we have a surjective $R$-homomorphism from $R^n$ to $R^{n+1}$? Or more so, given two free $R$-modules $A$ and $B$ where there is an injective homomorphism from $A$ to $B$ and also a surjective homomorphism from $A$ to $B$, can we conclude that $A \cong B$?

This is part of the exercise, I'm stuck with it.  $A$ is a commutative ring with unit.  1) Suppose we have an homomorphism $\phi : A^{m} \to A^{n}$ surjective. Is true that $m \geq n $ ?  2) Suppose we have an homomorphism $\phi : A^{m} \to A^{n}$ injective. Is true that $m \leq n $ ?


I am looking to move to Las Vegas to try and find work but I will initially go just on an ESTA. I realise I can stay in the states for a maximum of 90 days?  If I haven't found a job and need to leave, what countries can I go to before I can come back to Vegas? I was thinking Mexico or Canada for a week?  What time period would I have to be out of the states? Around a week?  Is is possible to get an extension visa?

I'm on a New Zealand passport.  From most US Embassy webpages:     The Visa Waiver Program (VWP) enables nationals of certain countries,   including Australia, New Zealand, and the U.K., to travel to the   United States for tourism or business for stays of 90 days or less   without obtaining a visa, if certain requirements are met. Under the   VWP, time spent in Canada, Mexico, and adjacent islands counts towards   the maximum of 90 days stay allowed under the program.   I'll be there on a 1-year working holiday visa starting when I arrive in Vancouver. I'm spending 3 days in Hawaii en route to Vancouver. This seems to imply that 90 days after landing in Hawaii, my time will be up and I won't be able to get back into the US, as my living in Canada will not reset the clock. What if after this time I want to say, pop across the border to Seattle? How can I restart the 90 days, without having to resort to say, flying to Japan and back just to reset it?


My text file is like:     mr,John Abrahm,USA,30,M   Mr,Harry,UK,40,M   Mr,Jack,USA,50,M     I want to do like:  title=mr   name=John Abrahm   country=USA   age=30   gender=M   So far my code is like:  ifstream inputFile("text.txt"); string line; while (getline(inputFile, line)) {     istringstream ss(line);      string title;     string name;     string country;     char gender;      ss >> title>>nam>>age>>country>>gender;     cout <<gender<< endl; }

Java has a convenient split method:  String str = "The quick brown fox"; String[] results = str.split(" ");   Is there an easy way to do this in C++?


Please evaluate the limit $\lim\limits_{n\rightarrow\infty} \prod\limits_{k=1}^{n}\left(1+\dfrac{k}{n^2}\right)^2$ if it exists.   I have a heuristic argument to solve this limit but cannot prove it rigorously. The idea is that for large $n$, $\left(1+\dfrac{k}{n^2}\right)$ can be approximated by $\left(1+\dfrac{1}{n^2}\right)^k$. So, essentially the limiting value is equal to $\lim\limits_{n\rightarrow \infty} \left(1+\dfrac{1}{n^2}\right)^{2\sum\limits_{k=1}^{n} k}$. This quantity can be easily computed to be $e$. Please help me out to make this argument rigorous.

I've got a limit which puzzle me several days. The question is  $$ \lim_{n\to+\infty} \prod_{k=1}^n\left(1+\frac{k}{n^2}\right).$$  Can you help me? Thank you in advance


There are two computers. The first one is the client, the second one is the server. The client needs access to some files on the server.  On the server it is possible for me to install any software (Ubuntu with root access). The client is WindowsXP and I cannot install anything. However there is an USB-port to which I can connect storage devices.  Is there a way (hardware and/or software) which I can use to connect the two computers with USB?  I could imagine a software for my server which uses USB to act as a simple storage device for the client connected to the other end of the USB cable.

USB is a popular standard and I was wondering whether there is some way to connect two or more computers using USB ports rather than the Ethernet ports.


I know that Palpatine used fixed recordings, first to portray the Jedi as staging an unprovoked coup, second to cover up his Sith identity, so that the Jedi can persuasively look like they are trying to seize power for themselves from helpless Force Muggles.  One point of contention I have is how Palpatine explained his survival, even in spite of the fact that he was "left scarred and deformed". The Senate should know better than most how formidable the Jedi are, especially if they have intent to kill, as the suggestion that they are taking over by force of arms, and going as far as to attack the head of state, would necessarily imply.  Is there any detailed account of the public version of the "Jedi coup"?

I mean, for the people of the galaxy, Palpatine was just a politician past his middle ages. How could this man have survived against four Jedi Council members in his office while “unarmed,” say that the attempt “left him scarred and deformed,” and people believe in this?


In office 365 I have 2 libraries with few columns same columns names in both libraries.  So right now I want to delete first library. I want to copy first document library documents with data to another library.  How to achieve this. I want in CSOM model.

I have two document libraries on the same web, and am wanting to move the files from one to the other using JSOM/CSOM.  Can anyone please shed some light on how to do this?  Thanks


I learnt about JAVA basic level. Then, I meet some problem... the inner class instance is not created.  public class example {     class book {          private String name = null;         private int page = 0;          book(String name, int page) {             this.name = name;             this.page = page;         }          String getName() {             return this.name;         }          int getPage() {             return this.page;         }      }      public static void main(String[] args) {         // TODO Auto-generated method stub         book b1 = new book("book1", 300);       // this line is making an error         System.out.println(b1.getName());         System.out.println(b1.getPage());         System.out.println();     } }

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?


I just downloaded 2.76 and successfully rendered a project yesterday. But today with a different project the Render fails to work correctly. The old (yesterday) project reappears and begins to render.  Wonder if it is a bug?   Thanks!

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:


In the home of thw StackOverflow in Portuguese I clicked in "Sem resposta" (unanswered) and the page show lot's of questions with answers how do you can see in the image.    PS: the page is:

Is it possible that I am not using this feature correctly?  Or perhaps I should be modifying my expectation, but when I click on the 'Unanswered' button I get a list of results that contain perhaps one or two unanswered questions at the top, followed by many more already answered questions.  Another strange thing is that interspersed with the results are random unanswered questions within and around the answered ones, so that we are not only seeing answered questions in with the unanswered ones, but they are not sorted so that the unanswered ones stack up at the top.  Am I the only one to be seeing this?  Am I not using the feature correctly or is there some way that I am supposed to sort the results on my own?


I have 1230 urls that have been submitted to google by previous webmaster that should have never submitted all these pages are is just a image and should not show in search, these pages are relevant to the site and need to stay in place but i need google to not crawl them.   what is the best plan in removing these pages from searches, would the best option be to remove from site map and wait for the site to eventually crawl?

I have used so many things like url removal request and deleted the pages etc., but still the errors are shown in my webmaster tools.  How can I remove the urls completely from Google?


Question: Let $\Bbb{F}_{27}$ denote the finite field of size $27$. For each $\alpha\in\Bbb{F}_{27},$ we define $$A_{\alpha}=\{1,1+\alpha,1+\alpha+\alpha^2,1+\alpha+\alpha^2+\alpha^3,\dots\}.$$ Then show that number of $\alpha\in\Bbb{F}_{27}$ such that $|A_{\alpha}|=26$ equals $12$. What I could conclude is, $0\in A_{\alpha}$ if and only if $ \alpha\neq0$. Then I thought that, $|A_{\alpha}|=26$ implies $A_{\alpha}=\Bbb{F}_{27}^*$, but I am not sure. Then some guess what I was making from the fact $\phi(26)=12$, but no progress. Help me with this, because I not getting any clue from the structure of $A_{\alpha}$.

Let $\mathbb{F}_{27}$ denote the finite field of size 27. For each $\alpha\in\mathbb{F}_{27}$ , define $ A_{\alpha}$ $=$ { $ 1, 1+\alpha , 1+\alpha+{\alpha}^2 , 1+\alpha+{\alpha}^2+{\alpha}^3 , .... $} . Then  prove that  the number of  $\alpha\in\mathbb{F}_{27}$ such that $|A_\alpha|$=26 equals 12.  $ 0\in A_\alpha $ if and only if $\alpha\neq 0$ For the first proof , the multiplicative group of the field $\mathbb{F}_{27}$ is cyclic and its order is 26  , so there are 12 generators in that group.   Now  I need  to  show  that  $ 1+\alpha+{\alpha}^2+.. {\alpha}^{25} $ =0  , where order of $\alpha$=26 . Since   $\alpha ^{26}$ =1 ($\alpha$-1)(1+$\alpha$+${\alpha}^2$+...+${\alpha}^{25}$)=0 , since $\alpha\neq 1$  , So $ 1+\alpha+...+{\alpha}^{25} $ =0 My question is , can I write these last two  lines?  I mean are those two lines alright to write? If those two lines are invalid then I need some help to show  $ 1+\alpha+{\alpha}^2+..+{\alpha}^{25} $=0  .Thanks


Is it true that you can unlock Mater Balls at the Poké Marts and how if possible? If not, where can I find more Master Balls?

I remember in previous generations that finding a Master Ball would typically come after a major Boss fight. You could have also gotten through some form of lottery (I think this was in Pearl).  If anything, where and when will I be able to find Master Balls in Pokemon X&Y?


I'm trying to find a single word to describe a communication style that is high volume, low information density that is more formal than windbag.   Loquacious is the best I've come up with so far but I don't feel like it captures the low information density by itself.  Basically trying to find a an eloquent way to capture Homer's "You take forever to say nothing."

I know many politicians that avoid interview questions by talking a lot but not really communicating anything.  You could say that what they were saying was full of banalities or canned answers or that they were waffling, but is there a better word for this behaviour?  I'd like to say some thing like That response was a _____ or he\she is ___ing?


So I have a database (on a SQL Server 2008 R2 SP2 instance) that is 2TB uncompressed, with a .bak file that is 500GB compressed. As I have been toying with the fastest way to restore this database after a series of tests, I've tried a couple of things:   Restoring after dropping the database Restoring with Replace   When I restore after dropping the database, the fastest I can get a restore going is 4 hours. This is when I put the .bak on a RAID 10 logical drive, with the data files being written to a separate RAID 10 logical drive on the same server. The log files go to yet another RAID 0 on the same server.  However, if I restore with Replace, the restore process only takes 56 minutes (similar setup). Did I find some sort of turbo button? This is so fast that I am worried.

What exactly does the restore argument "With Replace" do? I'm looking at needing to restore a database back to a beginning point on a regular basis, and I've been trying to figure out if there are any disadvantages to using Restore With Replace versus Dropping/Deleting the database entirely and restoring it.  Will "With Replace" wipe the log files and reset whatever bits might be left in system databases as well? It seems that it would be much quicker, as I don't have to wait for the database to finish dropping (the database in question is around 2TB). I've already checked the TechNet article on the Restore arguments, it doesn't go into this specific question.


W: Failed to fetch http://archive.ubuntu.com/ubuntu/dists/raring-security/restricted/binary-i386/Packages  404  Not Found [IP: 91.189.88.153 80]  W: Failed to fetch http://archive.ubuntu.com/ubuntu/dists/raring-security/universe/binary-i386/Packages  404  Not Found [IP: 91.189.88.153 80]

Recently I have installed an older version of Ubuntu on my old machine. Whenever I try to install any software, I get an error saying it couldn't be found:  $ sudo apt-get install vlc Reading package lists... Done                Building dependency tree        Reading state information... Done     E: Couldn't find package vlc


I'm very new to Blender. After creating this chair, I added a flat plain for the ground and have confirmed the my chair is snapped to the ground plain. When I added a light, I noticed the shadows are detached from the chair legs, as if it were hovering above the ground. Any idea what may be causing this?

In the images below, I have a cube that is sticking up about two thirds through a plane. But, despite the fact that the cube is not hovering over the plane, the shadow seems to indicate otherwise. How can I fix this shadow?


How can I get the domain without subdomain in JS without jQuery?   I saw a lot of solutions with split and regular expressions that doesn't work in all this cases:   http:// subdomain.domain.com.br  http:// subdomain.domaincom http:// www.domain.com http:// www.domain.com.br   The result may be: domain.com / domain.com.br

How can I fetch a domain name from a URL String? Examples: +----------------------+------------+ | input                | output     | +----------------------+------------+ | www.google.com       | google     | | www.mail.yahoo.com   | mail.yahoo | | www.mail.yahoo.co.in | mail.yahoo | | www.abc.au.uk        | abc        | +----------------------+------------+  Related:


I'm trying to estimate this model on immigration levels I found in a paper and I'm not sure if they used OLS or fixed effects, it says that its a simple OLS but then mentions adding the country fixed effects. can someone help?


I'm trying to format my hard drive, and at the same time change it to GPT. I'll replace ubuntu with windows so I'm okay with losing all the data :)   I searched disks, chose the main hard drive, format (GPT),  Fail.  Device is busy.  What to do?

I'm trying to install Windows 7 with a 4GB flash drive, but my error that comes up is that my hard drive I'm trying to install on is in ext4. I need to format it to read NTFS. I can't seem to find any topics on how to format an active hard drive. I found a topic that explains how to move Ubuntu to a new drive, but it's a bit confusing to me.