The lesser rings were forged by the elves as essays in the craft of ring making. These rings were made sometime between S.A. 1200, when Sauron came in disguise to Eregion, and 1500, when they began crafting the greater Rings of Power.  Tolkien's essay "Of the Rings of Power and the Third Age" in The Silmarillion gives the background of the making of the rings. Midway through the Second Age Sauron came in disguise as Annatar ("Lord of Gifts") to the Elven smiths of Eregion, who were led by Celebrimbor, and taught them the craft of forging magic rings. Tolkien writes that the Elves made many lesser rings as essays in the craft, but eventually with Sauron's assistance they forged the Seven and the Nine. The Three were made by Celebrimbor himself without Sauron's assistance; they remained unsullied by his touch.  What became of these lesser 'essay' rings?

In the Lord of the Rings it is said     "In Eregion long ago many Elven-rings were made, magic rings as you   call them, and they were, course, of various kinds: some more potent   and some less. The lesser rings were only essays in the craft before   it was full-grown, and to the Elven-smiths they were but trifles — yet   still to my mind dangerous for mortals. But the Great Rings, the Rings   of Power, they were perilous.”   [LotR I 2 (60)]   There is a clear distinction here between the 20 Rings of Power in the Ring Rhyme (the 7,9,3,and 1) and these other rings. What happened to the "lesser rings"?


How can I find the continued fraction expansion for the square root of 5. Do this without the use of a calculator and show all the steps.

If I want to find the continued fraction of $\sqrt{n}$ how do I know which number to use for $a_0$? Is there a way to do it without using a calculator or anything like that? What's the general algorithm for computing it? I tried to read the wiki article but was overwhelmed and lost. I tried Googling but couldn't find a website that actually explained this question.  If anyone has a good site that answers these questions either, please let me know. Thanks!


Bad value:      http://fonts.googleapis.com/css?family=Lato:100,300,regular,700,900|Open+Sans:300|Indie+Flower:regular|Oswald:300,regular,700&subset=latin,latin-ext   for attribute href on element link:       Illegal character in query: not a URL code point.   How to solve the above error and why does this error occur?

Enqueuing Google Web Fonts the usual way, i.e., using the wp_enqueue_style function like so...  function wpse_google_webfonts() {     wp_enqueue_style( 'google-webfonts', 'http://fonts.googleapis.com/css?family=Ubuntu+Condensed|Open+Sans:400italic,700italic,400,700' ); } add_action( 'wp_enqueue_scripts', 'wpse_google_webfonts' );   ...results in a link tag placed in the header like so:  <link rel='stylesheet' id='google-webfonts-css'  href='http://fonts.googleapis.com/css?family=Ubuntu+Condensed%7COpen+Sans%3A400italic%2C700italic%2C400%2C700&#038;ver=3.5' type='text/css' media='all' />   As you can see, the resultant URL is encoded.  I am pretty sure it poses no problems, but to keep things clean and clear, I would like to go ahead and ask -- Is there a way to enqueue Google Web Fonts (via functions.php and not a plugin) in a way that the URL output is not encoded?  That's like so:  <link rel='stylesheet' id='google-webfonts-css'  href='http://fonts.googleapis.com/css?family=Ubuntu+Condensed|Open+Sans:400italic,700italic,400,700?ver=3.5' type='text/css' media='all' />   Reason For Bounty  @webaware's answer is near perfect, especially because it's similar to the method employed in  theme.  The only problem in the output is that it's like this:  <link rel='stylesheet' id='twentytwelve-fonts-css'  href='http://fonts.googleapis.com/css?family=Ubuntu+Condensed|Open+Sans:400italic,700italic,400,700&#038;subset=latin,latin-ext' type='text/css' media='all' />   Notice the &#038;? It should be &, otherwise the font-files served only have the latin glyphs (i.e. the subset parameter in the URL is neglected unless you use & and NOT its HTML entity).  Anyone who can help modify @webaware's answer so that the output's looks like this...  <link rel='stylesheet' id='twentytwelve-fonts-css'  href='http://fonts.googleapis.com/css?family=Ubuntu+Condensed|Open+Sans:400italic,700italic,400,700&subset=latin,latin-ext' type='text/css' media='all' />   ...wins the bounty.


How to get the Country,State,City Pick list in Visual force. By selecting the country , it needs to show the states in the selected country in dropdown , by selecting the state it needs to display the cities in the state. How to achieve this in Visual force page>

I am using Below code to get the Country and State picklist on Account.   <apex:inputfield value="{!Account.Billingcountrycode}" ></apex:inputfield>  <apex:inputfield value="{!Account.Billingstatecode}" </apex:inputfield>   is it possible to use BillingCity based on selected Billingstatecode. I have tried with Billingcitycode but its is not working.


I am about to renew my Irish passport, and want to know if the passport number that I have will change? I have the newer type of passport that can be renewed online.

I'm travelling soon but need to renew my passport.  Given that I have to provide my passport number to the airline to book a flight, I was wondering if my passport number would change if I renew it.  Or would the number stay the same and the expiry date just change?  I'm asking specifically as an Australian citizen, although I suspect a 'common' answer (if there is a general way this works) might be useful too.


In my mac, if there is a xxx.txt file, I can use Space key to perview it. but if there is other expanded-name, such as xxx.go, xxx.mod, this way is not work.  so, is there any other way to preview the custom expaned-name file as text in macOS?

I'm a programmer, and I find Mac's QuickLook a really great feature for quickly becoming familiar with a particular code base.  Basically, I open up a Finder window in the directory where my code files are, I push the spacebar (to evoke QuickLook), and then I arrow key up/down/left/right through all the files and scroll within QuickLook as needed.  The problem that I run into are files with no extension and files with unknown extension.  How can I convince the Mac to attempt to QuickLook these files as text files (which they usually are).  Also, it's really nice how QuickLook automatically colors the code based upon the type of code it thinks it is.  How can I extend the types of code files that the Mac recognizes?  For instance, I want to be able to QuickLook the code in a *.html.erb file or a *.js.erb file.


If I have a group $G$ and a complex irreducible representation $g:G\rightarrow GL_n(\mathbb{C})$.  I am trying to use schur's lemma to show that for $x\in Z(G)$ we have that $g(z)=\lambda_z I_n$.  Now if we define a map $f_z:\mathbb{C}\rightarrow \mathbb{C}$ to be a homomorphism of represenations from $(g,\mathbb{C})$ to $(g,\mathbb{C})$ given by $f(c)=g(z)c$  Then from Schur's Lemma we have that this is an isomorphism.  Am I on the right track? Where do I go from here?

Let $\rho: G \to GL_n(\mathbb{C})$ be an irreducible representation, and $g\in Z(G)$. Show $\rho(g)$ is a scalar multiple of the identity matrix $I$.   I think I have it, here is my solution:  Since $\rho(g) \in Hom_G(\mathbb{C}, \mathbb{C})$ and $\rho$ is irreducible, consider a nonzero eigenvalue of $\rho(g)$, say $\lambda$, we have $\rho(g) -\lambda $ is a zero map by Schur's lemma, as the map contains a non-trivial kernel (i.e. the eigenvectors associated to $\lambda$ are in the kernel).  But I didn't use the condition that  $g\in Z(G)$, so are there something wrong with my solution?


I want to know the difference between sympathy and empathy. I read that sympathy is understanding how one's feeling, and expressing sorryow, where as empathy is understanding how one's feeling. However, I came across this in a movie: Person A's parent just died. Person B is Person A's friend. Person B goes to Person A and talks to him. Person A: "You don't know what I'm going through!" Person B: "You're right, I've never lost a loved one, but I still am sympathetic." isn't sympathetic the wrong term? Because to be sympathetic you have to understand what they're feeling?

I typically use "empathize" to mean: "to see or understand something from the other person's perspective." In my use, one needn't have actually experienced the problem in question to empathize with someone who is experiencing it. E.g. I've never had a child of mine die, but I like to think I can empathize with the Mom who has.   However, some've told me that that one can't empathize with someone's condition without experiencing it. This perspective seems counter-intuitive to me. Using it as a guide suggests "sympathize" is the more correct term. "Sympathize" has connotations of "pity", which in turn suggests, "to feel sorry for."  I am a hospice nurse, and I've always seen myself as empathizing -- thoughtfully understanding -- with those in my care, not sympathizing.  What is the correct definition and usage of both "empathy" and "sympathy"?


I am trying to create an unordered Linked List and the textbook that I am using says that a linked list iterator class is needed before creating the linked list ADT. Ultimately it will be a functional linked list that can print in reverse, split at a node and merge with another. I have only started the linked List iterator class and the code has been copied from the text, yet does not build. I assume this is a header / forward declaration issue yet I have tried that and still nothing. Any ideas?  //.h file - linkedListIterator.h     #include "stdafx.h" #include <iostream> #include <iomanip> #include <string> #include <cmath> #include <cstddef>  using namespace std;  #ifndef LINKEDLISTITERATOR_H #define LINKEDLISTITERATOR_H  template <class Type> class linkedListIterator {     public:         //Default COnstructor         linkedListIterator();      //Constructor with parameter, *curretn = *ptr     linkedListIterator(nodeType<Type> *ptr);      //overload deref operator - return info in node     Type operator*();      //Overlaod pre inc operator - adv iterator to next node     linkedListIterator<Type> operator++;      //Overload equlaity operator - return true if iterator is eq to iter on right     bool operator==(const linkedListIterator<Type>& right) const;      //Overload not equal to operator- return true iter is not eq to iter on right     bool operator!=(const linkedListIterator<Type>& right) const;  private:     //ptr to current node in linked list     nodeType<Type> *current; };  #endif   //.cpp file - linkedListIterator.cpp    #include "stdafx.h" #include "linkedListIterator.h"  #include <iostream> #include <iomanip> #include <string> #include <cmath> #include <cstddef>  using namespace std;  template <class Type> linkedListIterator<Type>::linkedListIterator() {     current = nullptr; }  template <class Type> linkedListIterator<Type>::linkedListIterator(nodeType<Type> *ptr) {     current = ptr; }  template <class Type> Type linkedListIterator::operator*() {     return current->info; }  template <class Type> linkedListIterator<Type> linkedListIterator<Type>::operator++() {    current = current->link;    return *this; }  template <class Type> bool linkedListIterator<Type>::operator==(const linkedListIterator<Type>& right) const {     return (current == right.current); }  template <class Type> bool linkedListIterator<Type>::operator==(const linkedListIterator<Type>& right) const {     return (current != right.current); }   //main file - CH16_Q4Q6Q7_OrderedandUnordered.cpp      /nothing here yet/  #include "stdafx.h"  #include <iostream> #include <iomanip> #include <string> #include <cmath> #include <cstddef>  using namespace std;  int main() {     return 0; }   I am receiving errors C2061 - syntax error: identifier 'nodeType' C2535 - 'linkedListIterator::linkedListIterator(void)': member function             already defined or declared' C2143 - syntax error: missing ';' before '<' C4430 - missing type specifier - int assumed. Note C++ does not support default-int C2238 - unexpected token(s) preceding';' C2988 - unrecognizable template declaration / definition C2059 - syntax error '(' C2649 - 'typename': is not a 'class' C1004 - unexpected end-of-file found

Quote from :     The only portable way of using templates at the moment is to implement them in header files by using inline functions.   Why is this?  (Clarification: header files are not the only portable solution. But they are the most convenient portable solution.)


I have a DUNLOP SPORT DS 26 Bike. Here is a similar bike:    I would like to add hydraulic disc brakes at both front and rear.  But the frame or forks do not have anywhere I can mount the Calipers, and the wheels I have are regular ones.   How can I convert my regular wheels to adapt to the Disc brake wheels, and how can I mount the calipers to the frame?

I just bought a used  and it comes with regular rim brakes. I'm perfectly happy with them so far, but have been wondering if disc brakes would come handy when it rains.  What is involved in converting a bike from rim brakes to disc brakes (mechanical or hydraulic)?   Is this something that is feasible, or am I better off buying another bike that already has disc brakes?


There is this question that I could not really find an answer to online. Let's say that we do a simple linear regression model with y and x1, and we compute the slope of x. Then, we make a multiple linear regression model with y, x1, and x2. But now the slope of x1 changed. Why is that?

I have a dataset where there is a high degree of multicollinearity, with all variables correlating positively with each other and the dependent variable. However, on some of the models I run I get a couple of significant negative coefficients. Basically there are two coefficients that depending on what variables I include in the model, I can manipulate their signs.  My understanding is that if the variance-covariance matrix only contain positive values, then all coefficients should also be positive. Is this correct?


Is it ever proper to use myself and when starting a sentence? Here is an example of what I mean:  Myself and some very successful people are building a team across the Globe!  or Myself and (Name) are going to be on the call tonight.

I have read answers to questions like  but I couldn't find a general rule for using "you" or "yourself", "him" or "himself" that could explain things I see in some examples.  For example, I think that one normally say (according to examples I see in ):   You bring something with you. You have something in you. You have something on you. You pressed her to you.   But on the other hand one would say:   You draw attention to yourself. He killed himself. You can try it out for yourself.   As a general rule, it seems that the reflexive pronoun is used when the object is the same as the subject of the verb. But for prepositional phrases, it seems more complicated. Do some prepositions (like "with", "in", "on") always come with the accusative form of the pronoun, and some other (like "for") don't? What about "to", that seems to be followed by both in different circumstances?


We are  trying to update few yum packages but need to ensure that the packages which need to reboot are to be excluded. Example : There are close to 500-1000 packages and I need to exclude kernel packages as we cannot update without security approval. Is there any option in yum to handle this scenario?

I'm using Fedora and wonder if there is some way I can exclude kernel updates when I run yum update, until I specifically want to update the kernel.    The reason why I am concerned about this is because sometimes it requires a lot of extra research finding patches for some programs and extra time spent recompiling them to work on the new kernel.  I am thinking VMWare specifically as one example.   I wonder if there is some way for yum update to NOT update the kernel and only notify me that a new one is available when it goes through its routine so that I can decide to put it off until a more convenient time.  Or is this thinking likely to cause other issues?


My hard drive partition has 323GB of total space and 154 GB of it is used by my files and pagefile.sys, So doing math, 323 GB - 154 GB = 169 GB, BUT the free space on my hard drive is shown as 110 GB which makes a deficit of exactly 59 GB. Can anyone please explain me what is happening here. I am attaching an image which shows the calculated size and the size of my drive as well as the size of all the files in this particular partition.

How can I visualize which folders and files are taking up all of the space on my hard drive?  I'm getting some conflicting reports on the size of hard drive contents. Namely what is and isn't there and what folders are actually using the space.   I need to know which of the files or folders the culprits behind all this hidden bloat. Also there should be a print option to get it on paper.


I was trying to look for information about the moderators of Stack Exchange Community, but I didn't find any. So can anyone please tell if there is any information available about the moderators in the data dump?  If not, how else can I download the data about it? I found some online sources like . But I want to download the data on my laptop.

Moderators are special, privileged users who should serve as an example to the rest of us.  Therefore, it is natural to want to query behaviors and statistics about these model users, Like I did, for example, when researching . Unfortunately, there is no way to determine moderators in the SEDE data set!  We are left with hand-coding the current mods like in .  This is hardly a good solution and does not port if we want to quickly switch the query from, say, SO to Super User. Please provide a Moderators table, listing the ID's of that site's moderators. (Or, alternatively, add a flag-column to the Users table, but this would be less efficient.) As nhinkle notes, .  Please add it to SEDE, as well.    For reference, the identities of the mods is by no means secret -- being posted on each site's . It's just very clunky to get this list inside a query.  Currently, you can kludge a list of moderators by navigating to an About page and executing this javascript: $("#mainbar-full div.content-page div a[href*='/users/']").map ( function () {     return parseInt (this.href.replace (/.+\/users\/(\d+)\/.+$/, "$1"), 10); } ).get ();  Alternatively, parse the return from .


Something is constantly eating my hard disk space.   This pattern happens very often:   I free some space by deleting stuff (5-8 GB) In about half an hour I have 0 (zero) free space   I have not downloaded anything.  I suspected that it is Google Chrome which eats my space because once when I cleared the cache and quit the browser it freed around 1GB of space. But this happened only once. After that clearing cache and quitting Google Chrome doesn't do much.  Last night I left my computer with free 7GB of space. When I wakened it (I do not turn off my computer – only close the lid) this morning there was 100MB left which very quickly became 0 (zero). Clearing cache and quitting Google Chrome just freed 20-30MB. When I log off and log on, the system freed 6,7GB.  I am not interested in solutions like:   restart the computer or log off delete files   because I am constantly being deleting files and restarting the computer in order to find free space.  I suspect that there is a process or service that is constantly writing on my hard drive but it is triggered on some conditions. For example   How to find what application or process is constantly writing on my hard drive?

Every few days I get notices on my MacBook that it's running or run out of hard drive space. Curiously, restarting the computer will enable me to recover gigabytes of space (this past time, it was able to recover about 2.2GB). However, I can't identify anything in my personal activity that consumed that space.  It's possible that it's a rogue iTunes podcast or a huge software update that my Mac is automatically downloading - would either of these reclaim the space upon a restart?  One possibility that I can think of is that FileVault has some sort of disk leak, allocating but not freeing files. Does this make sense? Is there a tool that I can run to determine where this space is going? Assuming it is FileVault, should I try to disable it? What's the best way to turn of FileVault on a nearly full computer?


I was wondering if would be possible to show comment votes when viewing comments we've left in the activity tab.  For example, I often go to my profile and click on the Activity sub-tab (now 'All Actions') to find comments I've recently left. If I want to see how many upvotes the comment got, or any responses (ones that don't tag me specifically), I have to click the comment and go to the question. Since comment "scores" don't affect reputation, I'm not aware of any other way to check them.  While I realize there's no easy way to show comments that follow (is there?), I think it would at least be possible to show the number of upvotes beside each comment, just like when viewing the question/answer on its own page. Granted, that's the least of the two uses but still. Seeing your comment get voted up is a great feeling if nothing else.  Would this be a possible and/or useful feature to add?

It would be helpful if we could see the number of upvotes cast for our comments, or other people's comments in response to us directly in the user profile in either the activity tab or the response tab respectively. It should be quite easy to implement (e.g. sharing a single partial view for displaying comments).  It could be useful, since we can evaluate the legitimacy of the comment and address horrible mistakes sooner.


When I divide 1/5e-5 it gives the correct answer but 1/5e-6 gives an answer close to the correct one.  >>> 1/5e-5 20000.0 >>> 1/5e-6 199999.99999999997 (should be 200000) >>>   How can I get it to show the exact value. I tried importing decimel, numpy and scipy but none of them change the result.

Consider the following code:   0.1 + 0.2 == 0.3  ->  false   0.1 + 0.2         ->  0.30000000000000004   Why do these inaccuracies happen?


I'm struggling to understand how the geo projections work in practice.  The info a the CRS is as follows: {'ellps': 'WGS84', 'no_defs': True, 'proj': 'longlat'}  Does it mean that the coordinates are planar? if so,    how do I know what it was projected from (I need areas preserved, so this is important)  do I need to do something to displayed it on a map?   My region is South Africa-   - how do I choose the best coordinate system?

What are the principal datums and projections used in South Africa including the names of geodetic datums and their projections?


If bacteria are subject to a biocide and then that biocide is removed from the population, how quickly will they lose that gene that encodes for resistance?

I would imagine the bacterial genome is highly conserved and limited in its space, but maybe I am wrong.  If you were to take a strain of antibiotic resistant bacteria and kept them isolated, but fed well and so forth, how long would it take for them to lose their resistance? A year? A decade? 100 years? 1000 years? At some point it seems like that trait would disappear, but I have no feeling for how long. Please support your answer with a relevant citation.  EDIT:  My purpose is simple: I am thinking about a strategy for dealing with antibiotic resistance. If we were to ban them across the entire world (could be impossible) how long would we need to wait before they would be usable again. If it was a matter of years, then we could almost do a rotation of existing antibiotics (if we had enough) because I would rather not live in post-antiobitic world.


The default is to open up with up to four whole pages showing with tiny text.  Can I change the default view/zoom to be Page Width instead?

Every time I open a document in Word 2007 or Word 2010 on a wide-screen display I get the two-page view (which is actually very annoying for me). I would like to make Word display the one-page view, preferably with a specific zoom factor, by default and hence never display the two-page view. Is there a way to achieve that in 2007 or 2010 version?  Acceptable solutions include writing macros or using a 3rd party utility.


I’m struggling to find a way to represent a kernel density estimation with a nonnegative random variable. I have read a couple of articles tackling this issue; however I couldn’t implement it in R. I also tried a log transformation and a Box-Cox transformation without success.   With the log transformation I found serious problem at the 0 border.   This is my script:  K<-function(x){   return(1/sqrt(2*pi)*exp(-x^2)/2) };  x<-seq(min(y),max(y),0.001);x; nucleo2<-function(x,h,y){   nx=length(x)   n=length(y)   fhat=rowMeans(K(outer(x,y,"-")/h))/h   return(fhat) }; ind0<-(y==0); ind0; y[ind0]=0.000001; bw.SJ(log(y)); windows(); hist(y,freq=FALSE,breaks="Sturges", main="",xlab="King's inbreeding coefficient",ylab="Density"); rug(y); ftx<-nucleo2(log(x),h=0.3,log(y))/x; lines(ftx~x,col=4,lwd=2)   However, this script is not very useful; I found many problems at the border. Someone could help me!!?? Thanks a lot

plot(density(rexp(100))   Obviously all density to the left of zero represents bias.  I'm looking to summarize some data for non-statisticians, and I want to avoid questions about why non-negative data has density to the left of zero.  The plots are for randomization checking; I want to show the distributions of variables by treatment and control groups. The distributions are often exponential-ish.  Histograms are tricky for various reasons.    A quick google search gives me work by statisticians on non-negative kernels, e.g.:  .    But has any of it been implemented in R?  Of implemented methods, are any of them "best" in some way for descriptive statistics?  EDIT:  even if the from command can solve my current problem, it'd be nice to know whether anyone has implemented kernels based on literature on non-negative density estimation


is a similar and helpful question for any with the same as this, but they are different. In that thread they discuss custom options and building their own. This question is about what exists already (i.e. nothing need be custom.)  Another newbie here. Very limited EE education but experienced in software development trying to get started with CPLDs and FPGAs.  Any help with my terminology would also be appreciated.  From what I can tell there are two major manufacturers, Altera(Intel) and Xilinx. They both provide full IDEs for working with their chips. From drivers to design to testing and deployment (Is this Synthesis or is that another thing entirely?)  I've also noticed there are open source simulators around such as GHDL and Icarus Verilog. However, to get the designs you simulate with these onto the chip, it seems you still need the Altera/Xilinx solutions above. Is this correct?  Ultimately it would be nice to be able to develop the Verilog / VHDL in a text editor. Launch it in a simulator. Then if it seems good, deploy it to the chip via terminal (i.e. using a usb blaster.) Even better using all open source and free tools. Is this possible?  I do realize the IDEs provide a lot of good things and pro projects and the like will need all that, but for someone coming from a software background wanting to play around as a hobby, a short simple workflow would be very nice.  All pointers appreciated. Thanks for reading.

Is it possible to write your own tool to program FPGA boards, or are they locked down to only be programming by the manufacturer's tools?  In other words, can I write my  own tool to program/flash a FPGA board which I purchase from a large vendor (say Intel, or Xillix).


Find a $3 \times 3$-matrix $A$ such that $A^2=\begin{pmatrix}         13 & 9 & -9 \\         0 & 4 & 0 \\         12 & 12 & -8 \\         \end{pmatrix}$ and $a_{11}, a_{22}>0$  I noticed that $A^2-4I$ is somewhat simpler form but don't know how to find $A$. How can I find it?

Problem is simple.  Given $$A^2=\begin{bmatrix}13 & 9 &-9 \\ 0 & 4 & 0 \\ 12 & 12 & -8 \end{bmatrix}$$ How find $A$?  I think a method using eigenvalues and I find them. But I can't find an actual $A$. Is it right to use eigenvalues?


I was trying to change a folder owner user from root to jenkins, and accidently did chown on ALL of the filesystem recursively. now I ended up without any permission.  root@vps412690:/# ls -bash: /bin/ls: Permission denied   I can't even use the command chmod, no permission to use it.  I can't even log in to my server.   /bin/bash: Permission denied   Any idea?

I just ran this a few seconds ago. I managed to do Ctrl - C as soon as I realized what I started doing.  So far the only directory it's started going through is /bin.  I'm afraid to do anything else. So far I realized I can't use su as my normal user anymore.  Luckily I still have another root terminal open. What do I do?


It says The Java ArrayList clone() method makes the shallow copy of an array list. But when I delete the value from the original list it is not reflected in the cloned list. import java.util.*;    public class Test{        public static void main(String args[]){             ArrayList<String> list=new ArrayList<String>();           list.add("Mango");               list.add("Apple");               list.add("Banana");               list.add("Grapes");                    ArrayList<String> list2;               list2=(ArrayList)list.clone();           list.remove(0);           System.out.println(list); //[Apple, Banana, Grapes]           System.out.println(list2); //[Mango, Apple, Banana, Grapes]      }   }  When I compile this program it shows Note: Test.java uses unchecked or unsafe operations. Note: Recompile with -Xlint:unchecked for details

What is the difference between a deep copy and a shallow copy?


Team, I am trying to solve a problem which involves taking some actions the moment a new Case Team Member is added to the case with role as "Manager" or updating an existing team member's role as "Manager". Trigger on CaseTeamMember object is not allowed. Any idea how can I capture this scenario? Thanks.

I have a requirement to add user to case team and need to validate that user should be skilled resource and should have specific skills otherwise do not allow to add that user to case team. I was expecting that trigger on caseTeamMember will work but it seems we can not write trigger on it. Any thoughts, how we can achieve it?  Thanks in Advance !!


As a beginner, I wanted to know, what UV unwrapping is and how it works.  What is it used for? Is UV unwrapping necessary or can we cheat it?  What do the different unwrap options mean and in what situations do we need to use them in?

I am trying to learn how to make small games, and every time I watch a video it says that we need to unwrap it, but they never fully explain what unwrapping does or why we do it.  Is it necessary when exporting to UDK?


I understand that rpc_completed is defined as the completion of a remote procedure call and sql_batch_completed is the completion of a t-sql batch.  However can anyone explain in concrete terms what the difference is?  When should I use one and when should I use the other?  Will most/all SQL commands trigger both events?

What is the difference between SQL batch, T-SQL statement and Remote Procedure Call? How can I tell if part of the T-SQL code is a batch or statement?


I see there is no option for importing 3ds files in the File -> Import menu in Blender 2.80.  Does this mean importing 3ds files will no longer be supported in Blender?

I need to import and specially export in 3DS format. I know that I can import a file in 2.79 and the copy-paste to 2.8, but then when I copy-paste it back to 2.79 I'm having problems with textures missing. Is there any way to import/export 3ds in 2.8 without using any other version or software like we did in 2.79? The extension is missing in the add-ons repository either.


Let $p$ ∈ $\mathbb N$ be a prime number. Show that $\mathbb Z/p\mathbb Z$ contains no zero-divisors except $0$, hence ($\mathbb Z/p\mathbb Z$)$^∗$ = {$1, 2, . . . , p − 1$}, and $\mathbb Z/p\mathbb Z$ is field. Where ($\mathbb Z/p\mathbb Z$)$^∗$ is the set of units.   My attempt:  I showed this by contradiction:  Let $a$ be a zero-divisor in $\mathbb Z/p\mathbb Z$, then there exists $b$ $\not=$ $0$ in $\mathbb Z/p\mathbb Z$ such that  $a.b = 0$ mod $p$.  We know that $\mathbb Z/p\mathbb Z$ = {$0,1,2, ... , p-1$}.  Without loss of generality, let $a = 1$, and $b = p-1$. Then $a.b = 1.(p-1) = p-1 = 0$ and hence $p=1$, which contradicts the fact that $p$ is a prime number since $1$ is not prime. And hence $\mathbb Z/p\mathbb Z$ contains no zero-divisors except $0$.  Is my proof correct? Do you have any other suggestions or alternatives? And how do I show the other parts of the problem?   For instance, I know that an element $a$ is said to be a unit if there is $b$ such that $a.b = 1$ and so $b$ is the inverse of $a$.  And a field ($F,0,1,.+$) is a commutative ring where for all $x$ in $F$ {$0$}, there exists $x^{-1}$ such that $x.x^{-1} = 1 = x^{-1}.x$

The proof is already given in the textbook but I tried other way around.   Proof by contradiction: Let's assume that $p$ doesn't divide $a$ and $p$ doesn't divide $b$, but $p$ divides $ab$. So $\gcd(p,a)=1$ and $\gcd(p,b)=1$. Given that we can construct linear combinations   $sp+ta=1$ together with $up+wb=1$. Multiplying the left and the right sides of the equations we get  $spup+spwb+taup+tawb=1$ or $p(sup+swb+tau)+ab(tw)=1 \implies \gcd(p,ab)=1$. This is a contradiction.   Is it rigorous and sound proof?


What's the difference between     reason for x   reason why x   reason that   Some examples are:   The police asked her the reason for her visit.    The reason why so many people caught the disease is still not clear   The reason these cars are so expensive is that they are largely built by hand

The complementiser that is the first word in a complement of a noun♦. When can it be omitted? Do 1 and 2 below differ?   I am asking in general, but I exemplify with  modified by me:        1. He concealed the reason that he had robed.   2. He concealed the reason he had robed.   Please exclude and omit , about which I ask not because 'why' is redundant.  ♦See [5][vi], p 176, A Student's Introduction to English Grammar (2005) by Huddleston, Pullum.


I was wondering if it is possible to apply the method of hypothesis testing to real life. For example if someone can use it for decision making. I have always used this method for homework problems but maybe we can use this method as an aid in decision making. Therefore we could somehow know for example the probability of rejecting wrongly an alternative decision. What do you think on that? And it would be nice if someone can give an example if he thinks that this can be done.

Why continue to teach and use hypothesis testing (with all its difficult concepts and which are among the most statistical sins) for problems where there is an interval estimator (confidence, bootstrap, credibility or whatever)? What is the best explanation (if any) to be given to students? Only tradition? The views will be very welcome.


All the sources i checked arent offering historical flight status as far back as im looking (thats free).  Anyone able to help out and let me know what the issue/reason was for the delay?  TP1947 on June 28, 2018 from POT to LIS

Where can I find historical data on flights, specifically Delta international flights?  I need to find out about cancellations, diversions and any other flight data pertaining on particular route at a given time.  This source has to be official and stand up to legal scrutiny.


I have problems to show that if $A$ is a $2 \times 2$ matrix and if there exists some positive integer such that $A^{n}=0$ then $A^{2}=0$. I only showed that $A$ is a singular matrix but nothing else. Thanks any help will be appreciated.

I want to find all nilpotent $2\times 2$ matrices.   All nilpotent $2 \times 2$ matrices are similar($A=P^{-1}JP$) to $J = \begin{bmatrix} 0&1\\0&0\end{bmatrix}$  But how do I find all of these matrices?  I do think that the only such cases are $J$ and $J^ T$


She is at the beach. She is on the beach.   My teacher once told "at" , I have my doubts if "at" is correct.

At first I thought it is "at the beach" then after a quick Google search I found out that it is flat out "on the beach". However, I have found one instance where a woman, presumably a native speaker, uses "at the beach". I have not done a thorough search to check for more.  What I want to know is whether you consider "at the beach" wrong, or acceptable but uncommon? I am asking you because the  a slightly growing trend of using "at the beach" since around 1947.


I am an android developer working with my office mac. But now I want to migrate the projects to Ubuntu.   I installed Android studio and trying to run project on my device ASUS Zenfone 5 (Kitkat).  But the device list is showing as ?????????????????[null]   I tried to run in Nexus 7, its working fine and no issues found.   Is there any issues in my device settings ? Or any settings change in my Android studio.. ?

I'm using Ubuntu 12.10 and I have installed Android SDK, set it's path in my user .bashrc and it works.  The problem is that my phone requires adb to be ran by root for permissions, but running adb with sudo I get the following error:  sudo: adb: command not found  I tried to simply use sudo -E adb start-server, but it doesn't work. Tried to add the export path line to /root/.bashrc and (after realizing it didn't help) to /etc/bash.bashrc.  I remember I could set it on my Arch Linux, but I guess my problem now is connected to Ubuntu root account not behaving like I expect it.    What I don't understand is the following:  These don't work:  martin@alyx:~$ sudo adb devices sudo: adb: command not found   This does (typing the full path):  martin@alyx:~$ sudo /opt/android-sdk-linux/platform-tools/adb devices * daemon not running. starting it now on port 5037 * * daemon started successfully * List of devices attached  CM7-Blade   device   This doesn't work (using -E with sudo):  martin@alyx:~$ sudo -E adb devices sudo: adb: command not found   This works (as root):  martin@alyx:~$ sudo su root@alyx:/home/martin# adb devices List of devices attached  CM7-Blade   device   I'm totally confused now and I'd appreciate some clarifying on how to set a path for sudo or how else I could solve my problem.  (And please, don't say adb shouldn't be ran as root.)  Thanks in advance!  Edit: By requiring root permissions I mean that I need them because otherwise I get:  $ adb devices  List of devices attached  ????????????    no permissions   which doesn't occur as superuser. Sorry if it was misunderstanding.


When I selecting features to merge in QGIS 2.14.3-Essen using "merge selected features", I sometimes get "dirty" results with redundant polygon vertices. Is there an ex-ante or an ex-post way to get rid of them? Using Mac OS 10.11.6 El Capitan

It's quite common to find these topology errors when dissolving data:   Census tracts dissolved by neighborhood using ST_Union (PostGIS)  It's quite simple to understand the concept of a polygon donut hole in these cases: when the geometry really had a gap. But when your resulting holes are lines or points, my logical thinking get stuck.   What exactly makes this happen or not?  If the polygons share the same boundary lines without gaps, how does it create a line hole?  A point feature within this 'line hole' wouldn't intersect with the polygon feature?  I'm looking for a more detailed explanation, rather than the general and common "This happens when working with bad quality data"


I'm using Vim and editing Python scripts.  Autoindent works pretty well in general, but when I start a new line and type '#' to type a comment, Vim unindents that line for me.   For example, if have  def foo():   and I press enter, Vim will indent properly  def foo():     pass   but, if instead of typing pass, I type #, it unindents automatically  def foo(): # comment  class Thing():     def __init__(self):          pass # comment line gets unindented all the way   my .vimrc file follows.  anyone know why this is happening?  set tabstop=4 set smartindent set shiftwidth=4 set expandtab set backspace=indent,eol,start set scrolloff=3 set statusline=%f%m%r%h%w\ [%Y\ %{&ff}]\ [%l/%L\ (%p%%)] set laststatus=2

When I add a # in insert mode on an empty line in Vim while editing python files, vim moves the # to the beginning of the line, but I would like the # to be inserted at the tab level where I entered it.  For example, when writing this in vim  for i in range(10):     #   the # does not stay there where I entered it.  It is moved like so, by vim.  for i in range(10): #   Does anyone know of a configuration item in vim that would change this?  If it helps, I am using Ubuntu 8.10.


I was preparing for Olympiad then I got this question and I don't understand how to solve.  $a,b,c$ are real no such that $a-7b+8c=4$and $8a+4b-c=7$ find$$a^2-b^2+c^2$$

Let $a$, $b$, and $c$ be real numbers such that $a − 7b + 8c = 4$ and $8a + 4b − c = 7$. What is the value of $a^2-b^2+c^2$ ?


I have an HTML table with an id of custom_report_announcements_table that I dynamically add table data to via jQuery after an AJAX call completes.  That part is working, the AJAX call returns the announcementId and I insert that into the table and when I view the page source the table looks correct.  The problem is that I want to then setup an event that triggers on blur for the new table data after it's been added which is not working.  A user should be able to edit the content of the newly added table data which should trigger the blur event but currently nothing happens.  report.html.erb -  There is an id of custom_report_announcements_table where the new table data is added.

                                Announcements

                 Title

   reports.js  After the AJAX call the table is then appended with a new row.  The table data has an id of custom_report_announcements_title that I would like to use to trigger on blur.  The  has contenteditable set to true so that an inline edit can take place, when the user is done editing the blur event should trigger.  $.ajax({   type: "POST",   contentType: "application/json",   url: "/custom_report_announcements.json",   data: json }).then(function (response) {   console.log(response.data.custom_report_announcement_id)   // return the announcement id then insert it into the html   if (response.data.custom_report_announcement_id) {     var announcementId = response.data.custom_report_announcement_id;      var rowCount = $('#custom_report_announcements_table tr').length;     if (rowCount == 1) {       $("#announcements_section").css("display", "");     }      $("#announcements_section").removeClass('hidden');      $('#custom_report_announcements_table > tbody:last-child').append('
' + customReportAnnouncement.title  + '

[message here]
');    } });     I've tried this to trigger the blur but nothing happens.      $("#custom_report_announcements_title").on("blur", "td", function() {       console.log('inside custom_report_announcements_title function.......');     });   and this...  $("#custom_report_announcements_title").blur(function () {   console.log('inside custom_report_announcements_title function.......'); });   UPDATE  @Rory thanks for pointing me in the right direction, works with the below.   $('#custom_report_announcements_table').on('blur', '#custom_report_announcements_title', function () {   console.log('inside custom_report_announcements_title function.......');      });

I have a bit of code where I am looping through all the select boxes on a page and binding a .hover event to them to do a bit of twiddling with their width on mouse on/off.  This happens on page ready and works just fine.  The problem I have is that any select boxes I add via Ajax or DOM after the initial loop won't have the event bound.  I have found this plugin (), but before I add another 5k to my pages with a plugin, I want to see if anyone knows a way to do this, either with jQuery directly or by another option.


In old exams, I've encountered the two following similar exercises:  (1) Classify, up to isomorphism, all the unitary $\mathbb{Z}[i]$-modules with 10 elements.  (2) Classify, up to isomorphism, all the unitary $\mathbb{Z}_2[x]$-modules with 4 elements.  My thoughts on (1):  I use the following fact: "An abelian group $V$ admits an unitary $\mathbb{Z}[i]$-module structure iff there exists a group homomorphism $\varphi:V\to V$ such that $\varphi\circ\varphi=-\mathrm{Id}$". First of all, as an abelian group of order 10 $V$ must be $\mathbb{Z}_{10}$. Then, I look at $\mathrm{Hom}_{\mathbb{Z}}(\mathbb{Z}_{10},\mathbb{Z}_{10})\cong \mathbb{Z}_{10}$ and I found that $n^2\equiv-1\,(10)\Rightarrow n\equiv 3,7$ so there are two $\mathbb{Z}[i]$-modules with 10 elements.   PROBLEM: How to distinguish if that two structures are isomorphic or not? Anyway, I'm following the correct approach? I thought of using fundamental theorem of modules over PID but I stuck following that way.  My thoughts on (2):  I know that the unitary $\mathbb{Z}_2[x]$-modules correspond with the vector spaces over $\mathbb{Z}_2$ with a fixed linear transformation $T$.  We have to look at two non-isomorphic cases:   $V=\mathbb{Z}_2\oplus\mathbb{Z}_2$, then the representation of $T$ must be a matrix $\begin{pmatrix} a&b\\ c&d \end{pmatrix}$ with $a,b,c,d\in\mathbb{Z}_2$ and we can classify the structure modules by looking at Rational Canonical Form: if $m_T$ denotes the minimal polynomial of $T$ then $\mathrm{deg}\, m_T=1,2$. If it's 1 then $T=\lambda\mathrm{Id}$, i.e. the null matrix or the identity matrix. If it's 2 then $T$ is similar to $\begin{pmatrix} 0& -a_0\\ 1& -a_1\end{pmatrix}$ then there are 3 structure modules in this case. Is it ok??   PROBLEM: If $V=\mathbb{Z}_4$ I don't know how to approach the classification in this case.  I apprecciate any hints/suggestions/comments, sorry for the long question. Thanks!

$\textbf{Question:}$ How many isomorphism classes of $\mathbb{Z}[i]$-modules with exactly $5$ elements are there?  $\textbf{My Attempt:}$ Since $\mathbb{Z}[i]$ is a P.I.D and any module with $5$ elements is finitely generated we can use the structure theorem. In the case of a finite abelian group, the isomorphism classes determined by the prime factorization of the order and then listing all invariant factors.   In this case we have that $5 = (2-i)(2+i)$, but I don't know how to use the ideal $(2-i)$ and $(2+i)$ in the structure theorem...  Any help working this problem or showing an example of a similar problem is appreciate.d


I'm new to Ubuntu.  I'm trying to install a new application but unmet dependency errors have arisen.  After entering the command sudo apt-get install, I get this error:   You might want to run 'apt-get -f install' to correct these: The following packages have unmet dependencies: linux-image-extra-4.4.0-87-generic : Depends: linux-image-4.4.0-87-generic but it is not going to be installed linux-image-extra-4.4.0-92-generic : Depends: linux-image-4.4.0-92-generic but it is not going to be installed linux-image-generic : Depends: linux-image-4.4.0-92-generic but it is not going to be installed Recommends: thermald but it is not going to be installed   However, after I had run the command sudo apt-get -f install, it still has the same unmet dependencies error:  dpkg: error processing archieve/var/cache/apt/archives/linux-image-4.4.0-92-generic.dpkg: erro processing archives /var/cache/apt/archieves/linux-image-4.4.0-92-generic_4.4.0-92.115_amd64.deb (--unpack): cannot copy extracted data for './boot/abi-4.4.0-92-generic' to '/boot/abi-4.4.0-92-generic-new': failed to written because the error message indicates a disk full error dpkg-deb: error: subprocess paste was killed by signal (Broken pipe) ^[[BExamining /etc/kernel/postrm.d run-parts: executing /etc/kernel/postrm.d/initramfs-tools 4.4.0-92-generic /boot/vmlinuz-4.4.0-92-generic run-parts:executing /etc/kernel/postrm.d/zz-update-grub 4.4.92-generic /boot/vmlinuz-4.4.0-92generic Errors were encounted while processing: /var/cache/apt/archives/linux-image-4.4.0-92-generic_4.4.0-92.115_amd64.deb E: Sub-process /usr/bin/dpkg returned an error code (1)

My /boot partition is nearly full and I get a warning every time I reboot my system. I already deleted old kernel packages (linux-headers...), actually I did that to install a newer kernel version that came with the automatic updates.  After installing that new version, the partition is nearly full again. So what else can I delete? Are there some other files associated to the old kernel images?  Here is a list of files that are on my /boot partition:  :~$ ls /boot/ abi-2.6.31-21-generic         lost+found abi-2.6.32-25-generic         memtest86+.bin abi-2.6.38-10-generic         memtest86+_multiboot.bin abi-2.6.38-11-generic         System.map-2.6.31-21-generic abi-2.6.38-12-generic         System.map-2.6.32-25-generic abi-2.6.38-8-generic          System.map-2.6.38-10-generic abi-3.0.0-12-generic          System.map-2.6.38-11-generic abi-3.0.0-13-generic          System.map-2.6.38-12-generic abi-3.0.0-14-generic          System.map-2.6.38-8-generic boot                          System.map-3.0.0-12-generic config-2.6.31-21-generic      System.map-3.0.0-13-generic config-2.6.32-25-generic      System.map-3.0.0-14-generic config-2.6.38-10-generic      vmcoreinfo-2.6.31-21-generic config-2.6.38-11-generic      vmcoreinfo-2.6.32-25-generic config-2.6.38-12-generic      vmcoreinfo-2.6.38-10-generic config-2.6.38-8-generic       vmcoreinfo-2.6.38-11-generic config-3.0.0-12-generic       vmcoreinfo-2.6.38-12-generic config-3.0.0-13-generic       vmcoreinfo-2.6.38-8-generic config-3.0.0-14-generic       vmcoreinfo-3.0.0-12-generic extlinux                      vmcoreinfo-3.0.0-13-generic grub                          vmcoreinfo-3.0.0-14-generic initrd.img-2.6.31-21-generic  vmlinuz-2.6.31-21-generic initrd.img-2.6.32-25-generic  vmlinuz-2.6.32-25-generic initrd.img-2.6.38-10-generic  vmlinuz-2.6.38-10-generic initrd.img-2.6.38-11-generic  vmlinuz-2.6.38-11-generic initrd.img-2.6.38-12-generic  vmlinuz-2.6.38-12-generic initrd.img-2.6.38-8-generic   vmlinuz-2.6.38-8-generic initrd.img-3.0.0-12-generic   vmlinuz-3.0.0-12-generic initrd.img-3.0.0-13-generic   vmlinuz-3.0.0-13-generic initrd.img-3.0.0-14-generic   vmlinuz-3.0.0-14-generic   Currently, I'm using the 3.0.0-14-generic kernel.


Please note that myself Aniket Patki (Indian Citizen) having Italian one year valid Visa form 24-07-2016 to 07-08-2017 (Category D) with all Post office receipts and status of Italy Permesso di soggiorno. (Permesso di soggiorno already applied on 10th Oct 2016 and in the process to receive within DEC 2016). Attached for your reference  I am traveling to India on 2nd Dec 2016 and returning on 11th  Dec 2016.  02 Dec 2016 Travel  Depart: Linate Arpt (LIN) Milan 6:50 PM to  Arrive: Heathrow (LHR) London Terminal 5 7:55 PM .  Depart: Heathrow (LHR) London Terminal 5 9:00 PM to Arrive: Chhatrapati Shivaji (BOM)  Mumbai Terminal 2 11:15 AM Transit time in London Heathrow is 1:05 hrs.  (Ticket Attached)  11 Dec 2016 Travel ( Ticket Attached) Depart: Chhatrapati Shivaji (BOM) Mumbai Terminal 2 1:15 PM to Arrive: Heathrow (LHR)  London Terminal 5 5:45 PM. Depart: Heathrow (LHR) London Terminal 5 8:20 PM to Arrive: Malpensa Airport (MXP) Milan Terminal 1 11:20 PM.  I will not change Heathrow airport (Terminal-5) during my both journeys. Also my baggage will be transferred by British airline.  Moreover I checked as per exemptions part for Transit visa and I found out that I am exempted from transit visa requirement, as I am carrying EEA (Italy) valid D category visa.

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.


I'm looking at the Plan Cache in SQL Server. I've got a simple stored procedure:  CREATE PROC [dbo].[CountDescriptions](@Description varchar(1)) AS     SELECT ID      FROM MyTable      WHERE Description = @Description GO   If I execute it and immediately check the cache it's generally there, but it seems to expire very quickly and get removed.  This is making it a bit of a pain to play with.  Is there a way to artificially change a plan's details to stop the garbage collector (not sure if that's the right word for it) from deleting it so quickly?  Maybe increasing it's cost to compile or something?

I am reading SQL Server Execution plans by Grant Fritchey, He mentions:      SQL Server does not keep execution plans in memory forever. They are   slowly aged out of the system using an "age" formula that multiplies   the estimated cost of the plan by the number of times it has been   used. The lazywriter process, an internal process that works to free   all types of cache (including the plan cache), periodically scans the   objects in the cache and decreases this value by one each time.      If the following criteria are met, the plan is removed from memory:         more memory is required by the system    the "age" of the plan has reached zero   the plan isn't currently being referenced by an existing connection.      He also mentions earlier in the book the following:      Once the optimizer arrives at an execution plan, the estimated plan is   created and stored in a memory space known as the plan cache –   although this is all different if a plan already exists in cache.   I would assume that the plan could theoretically reach zero if the actual and estimated plan differ. This would give the estimated plan execution count zero even though it was stored in the cache.   My question is What are the different scenarios that a plan age could reach zero? And am I correct in my assumption?  Fritchey, G. (2012). SQL Server Execution Plans. Springfield, USA: Simple Talk Publishing.


I would like to know which would be the correct form:         a major two-day auction   a major two days auction      The duration of the auction is two days. Which form is the right one to use?

Why are year, pound and mile in the singular form in the phrases below?   five-year-old children  20 pound note 10 mile run   Is that because they're acting as adjectives, which are always invariable in English?  Is it incorrect to say...   five-years-old children? 20 pounds note? 10 miles run?


I'm a new user for latex, I would be grateful if you could help me to force a figure to appear in a particular place in report, my code I've already used is:  \usepackage{graphicx} \begin{figure} \centering \includegraphics[scale=0.3]{fig_ch1} \caption{Types of DG} \label{fig_ch1} \end{figure}

I have a problem when a lot of figures are in question. Some figures tend to "fly around", that is, be a paragraph below, although I placed them before that paragraph. I use code:  \begin{figure}[ht] \begin{center} \advance\leftskip-3cm \advance\rightskip-3cm \includegraphics[keepaspectratio=true,scale=0.6]{slike/visina8} \caption{} \label{visina8} \end{center}\end{figure}   to place my figures. How can I tell latex I REALLY want the figure in that specific place, no matter how much whitespace will be left?


I want to render a scene where light shines through a ball with holes so I get a dot-pattern similar to a disco ball. (see pictures) The problem I have at the moment is that my render is very noise and I just can't find a way to get rid of it. I tried quite a lot of different "solutions" that are supposed to fix it but with no success. Using more samples also doesn't really help. (I'm using 500 samples) I hope someone can help me with it.  I uploaded the pictures here:  and the .blend file here:   (I couldn't use blend-exchange because the file was to big)

I know that this question is a bit old or maybe overdone, but I'm running the latest edition of Blender and when I use the Cycles engine I get really fuzzy results and I can't find a simple, non-compromising solution to the quality.  I don't know exactly what I'm doing wrong here, but I'm sure others share my frustration.  Leaving everything in default settings, I started a new project and switched to the Cycles render.  I duplicated the cube and set colors for two Diffuse BSDF shaders, then went ahead and made walls and a floor all sharing the same diffuse shader.  I made two windows to emit blue light.  The screenshot has gaps between the walls because of the setup:  I'm aware that it's considered very incomplete and many have come to terms with some amount of noise, but is this normal?  Furthermore, with default settings or not, I can't change the amount of noise produced.  Supposedly, using "progressively refine" in the rendering tab should make it refine itself indefinitely, however Cycles only counts to 10 refines and then stops, creating a render which is a pixel-perfect match of the ordinary rendering method when it's completed.  I understand that there are tricks that can be used to reduce noise, but at the cost of extra processing time and usually small quality conflicts, like blurring.  My question essentially boils down to is this Cycles' current limit?


Given $X_1...X_n\stackrel{iid}{\sim} N(\mu,\sigma^2)$ and  $U=\sum_{i=1}^n (X_i-\overline{X})^2$, why is $U\sim\sigma^2 \chi_{n-1}^2$ ?  And what would be the distribution of $V=\sum_{i=1}^n (X_i-\mu)^2$ ?

The statement  The sampling distribution of the sample variance is a chi-squared distribution with degree of freedom equals to $n-1$, where $n$ is the sample size (given that the random variable of interest is normally distributed).    My intuition  It kinda makes intuitive sense to me 1) because a chi-square test looks like a sum of square and 2) because a Chi-squared distribution is just a sum of squared normal distribution. But still, I don't have a good understanding of it.  Question  Is the statement true? Why?


I'm using fuser with options -uv and I'm getting following output:  $fuser -uv ~/sh/test_script.sh                       USER        PID ACCESS COMMAND /home/abc/sh/test_script.sh:                      abc        3501 f.... (abc)test_script.sh   However, when I try to redirect the output of the command I'm only getting PID in the file:  $fuser -vu ~/sh/test_script.sh >> t2.txt                       USER        PID ACCESS COMMAND /home/abc/sh/test_script.sh:                      abc       f.... (abc)test_script.sh  $cat t2.txt 3501   Why is it not including all the information during output redirection?  Also, how to include all the information during output redirection?   Using lsof I'm able to redirect all the information to a file.

Is it possible to redirect all of the output of a Bourne shell script to somewhere, but with shell commands inside the script itself? Redirecting the output of a single command is easy, but I want something more like this: #!/bin/sh if [ ! -t 0 ]; then     # redirect all of my output to a file here fi  # rest of script...  Meaning: if the script is run non-interactively (for example, cron), save off the output of everything to a file.  If run interactively from a shell, let the output go to stdout as usual. I want to do this for a script normally run by the FreeBSD periodic utility.  It's part of the daily run, which I don't normally care to see every day in email, so I don't have it sent.  However, if something inside this one particular script fails, that's important to me and I'd like to be able to capture and email the output of this one part of the daily jobs. Update: Joshua's answer is spot-on, but I also wanted to save and restore stdout and stderr around the entire script, which is done like this: # save stdout and stderr to file  # descriptors 3 and 4,  # then redirect them to "foo" exec 3>&1 4>&2 >foo 2>&1  # ...  # restore stdout and stderr exec 1>&3 2>&4


I tried using A.M. $\ge$ G.M. and Mathematical Induction, but couldn't get anywhere.

If $n$ be a positive integer greater than $1$, then prove that $$2^n>1+n\sqrt{2^{n-1}}$$    I found this problem under $AM \ge GM$ chapter. Help me to solve this problem using  $AM \ge GM$. Thanks in advance.


I have a bunch of factory reset MacBooks. I want to know the CPU, memory and storage configuration for each of these machines. What is the fastest way to get this information without to go through the initial setup and resetting the machines again?  I have a USB installer of macOS 10.13 and a macOS installation on an external hard drive, which needs unusually long to load on each machine.  What are my options?

I have a Mac that someone asks me to help them sell.  They already wiped the hard drive and put a fresh installation of macOS on it. Upon boot, it's at the "Welcome" setup with no users intialized yet.   Is there an easy way to see the System Information and version of macOS currently installed on this machine without creating a new user? I'd like to leave this machine in a clean state without having to re-wipe the hard drive with a new installation.


I want to install the latest LTS Xubuntu version (16.04) on an external SSD hard drive. This is what I'm planning to do:   Prepare a Xubuntu boot stick  Install the Xubuntu version on the new external hard drive   So now the question: Can I use this installed version as a boot stick on my laptop and on my tower PC as well?

I have been trying for a week to install (not live cd) Ubuntu on an external drive.  I am totally new to Linux and would love to try it out. That's why I want to install it on an external drive and not dual boot.   I used two USBs, one with a live Linux system, and another to install it onto. I chose the boot location as the external hard drive when installing Linux. But when I boot the PC (without the drive inserted)  GRUB appears and stays there. However when the drive is inserted and I boot the PC GRUB appears and gives me the option to go to Ubuntu.   So it seems as if Ubuntu is installed on the USB, but something important for booting seems to be installed on the PC and therefore when I use the drive on a different PC it doesn't boot (which is the main reason I'm installing Linux).   Please help me fix this!


since there isn't any useful How-To for beginners of PyQt5,   I'm stuck with a little problem       。  @pyqtSlot() def on_pushButton_17_clicked(self):      """     Slot documentation goes here.     """     A=self.lineEdit_22.text()     B=self.lineEdit_23.text()     print(A + B)   Show 12 instead of 3（1+2=3）  I want to enter the number in the lineEdit inside the calculation by PushButton, and get the value.

In Python, how can I parse a numeric string like "545.2222" to its corresponding float value, 545.2222? Or parse the string "31" to an integer, 31?  I just want to know how to parse a float str to a float, and (separately) an int str to an int.


Why does my Dewalt power drill only have a 2 pin plug rather than a 3 pin with a ground?

I have recently purchased a Makita 2100W angle grinder. It has just the live (L) and neutral (N) connectors unlike the one I previously used, which had a third protected earth (PE) connection.   Would it be better if I changed the connections to a 3 pin connector?


I understand how to only download a package with:  apt-get download blah   ...but how do I download all of its dependencies easily as well for an offline install later? Specifically I'll be placing all of this in a custom ISO to be installed at system install/setup without internet.

I have a friend who has got a computer that is not connected to the Internet. Is there any way to install software offline easily?


I encountered a bug in my code today, highlighting the fact that apparently I don't understand polymorphism as well as I thought. Here's some sample code that illustrates my error:  internal class Startup{     interface IInterface{         bool SomeProp{get;}     }     class ClassA:IInterface{         public virtual bool SomeProp{get{return true;}}     }     class ClassB:ClassA{         public override bool SomeProp{get{return false;}}     }     public static void Main(String[] args){         IInterface test=new ClassB();         bool prop=test.SomeProp;         Console.WriteLine("result="+prop);     } }   This shows a result of false, exactly as I'd expect. But consider this code:  internal class Startup{     interface IInterface{         bool SomeProp{get;}     }     class ClassA:IInterface{         public virtual bool SomeProp{get{return true;}}     }     class ClassB:ClassA{         public virtual bool SomeProp{get{return false;}}     }     public static void Main(String[] args){         IInterface test=new ClassB();         bool prop=test.SomeProp;         Console.WriteLine("result="+prop);     } }   In this code, I accidentally typed the word "virtual" instead of "override" in ClassB. This was a typeo, but still, I would've expected one of the following things to happen:  (1) Compiler error, telling me that if I really wanted to create a new virtual property called SomeProp at the level of ClassB, I should've used the 'new' keyword.  or  (2) Complete passthrough of functionality: false would be returned by way of ClassB.  ... the one thing I would NOT have expected is for true to be returned. Could someone explain what's happening in the second example with the typeo? Should I be using the virtual keyword at all in Class A? I would've though I had to, if I wanted its descendent ClassB to be able to override it.

What are differences between declaring a method in a base type "virtual" and then overriding it in a child type using the "override" keyword as opposed to simply using the "new" keyword when declaring the matching method in the child type?


Let us define $\mathbb{P}=\mathbb{R}\backslash\mathbb{Q}$. Find all path-connected components of $\mathbb{P}^n\cup\mathbb{Q}^n$  I tried solving this question but I'm out of luck. Any help, please?  It is not a duplicate of  because they prove connectivity of the set and not path-connectivity.  In the paragraph above there is an explanation of why this is NOT a duplicate of an existing post, please look closely at the questions asked...

Is the set of points in the plane whose coordinates are either both irrational, or both rational connected?


My home directory is c:\Users\phi as a user phi, and I made a directory at c:\Users\abc. I need to symbolic link from c:\Users\phi\hello to c:\Users\abc\hello.   I run the following command    mklink c:\Users\abc\hello c:\Users\phi\hello   But I get the Access is denied error. User phi is Administrator, so I have no problem writing files in c:\Users\abc.   Why is this? How to mklink?

How can I grant a particular user the permission to create symlinks in Windows 7?  I've searched through "Group Policy" and Google, but haven't found anything.  On a side note, is there a way to search through everything in Group Policy Editor? The filters only seem to work on particular subtrees. I never actually found anything using the filters.


Is there a way to remove the option items, including the arrow on the left, without removing the suggestion bar completely? I use the suggestions for words, but have no use for accessing things like themes and stickers. I've provided a photo of the offending items, since I'm not sure how to properly describe them. I'm using a Pixel 5.

How do I get rid of this bar above the Gboard keyboard?  I checked all of its settings, cannot seem to find it.  OnePlus One - Android 6.0.1


I'm from India, got my acceptance in German university. In all my study documents and passport my father name is :RAMA, but while filling out Visa application there is column for Father's surname. Is it necessary to fill out the application with my father's surname or should I leave it blank.

I have a binomial name - Sammy Kumar, name of my father is monomial - Rajiv (no surname)  Will there be any problem in applying for visa to western countries(EU & USA) ?


I started with Python today (and I am only familiar with R). I tried to write a random loop, but I really have no idea, what the problem is: hello = ["hi!"]  def idea(a):     for i in range(a):         if i == 1:             hello = hello + ["!"]             print(hello)         elif i == 2:             print(":-)")         else:             print(":-/")  idea(4)  the result is the error message  local variable 'hello' referenced before assignment  I expected sth like :-/ hi!! :-) :-/ :-/

The following code works as expected in both Python 2.5 and 3.0:  a, b, c = (1, 2, 3)  print(a, b, c)  def test():     print(a)     print(b)     print(c)    # (A)     #c+=1       # (B) test()   However, when I uncomment line (B), I get an UnboundLocalError: 'c' not assigned at line (A). The values of a and b are printed correctly. This has me completely baffled for two reasons:   Why is there a runtime error thrown at line (A) because of a later statement on line (B)? Why are variables a and b printed as expected, while c raises an error?   The only explanation I can come up with is that a local variable c is created by the assignment c+=1, which takes precedent over the "global" variable c even before the local variable is created. Of course, it doesn't make sense for a variable to "steal" scope before it exists.  Could someone please explain this behavior?


Here's the screenshot:    sda7 is /home partition in my case. I want to extend it using unallocated space of 95+GB, but I can't seem to do that.

Previously, I have installed Windows 7 on my 320 GB laptop with three partitions 173, 84 and 63 GB each. The 63 GB partition was where the Windows was installed. The rest were for file containers.  Now I changed my OS to Ubuntu 12.04 LTS. I installed Ubuntu by replacing the entire Windows 7 on the 63 GB partition. The rest of the partitions remain as an NTFS Windows partition and I can still access them both (the 173 and 84 GB partitions).  Now I want to change the two partitions of Windows into an Ubuntu format partitions plus most importantly, I want to extend the 63 GB partition to more than a 100 GB because at the moment I am running out of disk space. Whenever I try to install any application, especially using wine, it always complains for a shortage of disk space.  How do I do the extending activity before I entirely format my laptop again and lose all the important files on my partitions?


I chanced upon this lemma when studying differential geometry which seems to depend on Taylor's theorem, but I have never seen it before, could someone explain how the proof works? I am not sure how this follows from Taylor's theorem, if at all. It seems to me like some kind of linearization, and hence perhaps related to Taylor's theorem.  Lemma: Let $h\in C^{\infty}(U)$, where $U$ is an open neighbourhood of $0$ in $\mathbb{R}^{n}$. Then there exists smooth functions $h_{i}\in C^{\infty}(U)$ such that  \begin{equation} h(u)=h(0)+\sum_{i=1}^{n}u^{i}h_{i} \end{equation} where $u=(u^{1},...,u^{n})\in\mathbb{R}^{n}$. Note that $h_{i}(0)=\frac{\partial h}{\partial u^{i}}|_{u=0}$.

Let $f:\mathbb R^n\to\mathbb R$ differntiable and $f(0)=0$. Prove exist $g_i$ s.t for $x=(x_1,\dots,x_n):f(x)=\sum\limits_{i=1}^nx_i\cdot g_i(x)$. hint:$f(x)=\int\limits_0^1f\prime(tx)dt$.   I dont have any idea how to solve it. maybe we can build $g_i=f(x_i\cdot x)$ but im not sure it may help since I cannot take one time $\int f(x_1\cdot x)dx_1$ and in another $\int f(x_n\cdot x)dx_n$).  how can I build the sequence of functions and furthermore, what is the intuition for this type of questions involves building functions $\varphi:\mathbb R^n\to\mathbb R^m$ based on given condition with sums or diffrentiablity or partial derivatives?


I have a String like that : Sun Jul 21 02:51:39 +0000 2013  i want to convert it to a date with PHP, it's possible ??

How do I get timestamp from e.g. 22-09-2008?


I have a Windows HDD attached to an external docking bay on my Ubuntu System, but the HDD brings up an error message:     Error mounting: mount exited with exit code 14: Windows is hibernated, refused to mount.   Failed to mount '/dev/sda5': Operation not permitted   The NTFS partition is hibernated. Please resume and shutdown Windows   properly, or mount the volume read-only with the 'ro' mount option, or   mount the volume read-write with the 'remove_hiberfile' mount option.   For example type on the command line:           mount -t ntfs-3g -o remove_hiberfile /dev/sda5 /media/92441EC8441EAF4B      I am at a loss for exactly how to remove the hiberfile, or even mount it as read-only or read-write. I tried directly copy and pasting that exact command into my terminal, but it said:  mount:only root can do that   I do not know what to do at this point. I do need to get the information off of this drive, but I do not have a computer to put it in. Does anyone know what I should do from here?

Whenever I boot Ubuntu, I get a message that it cannot mount my windows partition, and I can choose to either wait, skip or manually mount.  When I try to enter my Windows partition through Nautilus I get a message saying that this partition is hibernated and that I need to enter the file system and properly close it, something I have done with no problem so I don't know why this happens.    Here's my partition table, if any more data is needed please let me know.     Device Boot      Start         End      Blocks   Id  System /dev/sda1            2048    20000767     9999360   83  Linux /dev/sda2        20002814   478001151   228999169    5  Extended /dev/sda3   *   478001152   622532607    72265728    7  HPFS/NTFS/exFAT /dev/sda4       622532608   625141759     1304576   82  Linux swap / Solaris /dev/sda5        20002816   478001151   228999168   83  Linux


My php project reported error: unable to write file. I found that might be caused by permission guaranteed for directory containing my project files.  I did this:  sudo chown [username]:[username] -R [directory location]   and then restarted apache but nothing got changed even my /WWW is in home. Any help is appreciated :)

I want to stop having to use sudo everytime I work in /var/www. How can I do that? I simply want to put all of my sites into this directory and work with them without too much pain.


How do you keep a cheesecake from absorbing water baked in a waterbath? I put four sheets of aluminum foil around my springform pan and it still leaks onto the crust.

I have never found a spring-form pan that does not leak.  I have never been able to wrap a spring-form pan so that some of the water doesn't get into the pan.  I can wrap it so that a lot of the water doesn't come into the pan.  But it seems to me that there must be a method that works to keep the water out entirely.  I just haven't figured it out.  How can I wrap a spring-form pan in foil so that water from the bath doesn't leak into it?


Let $X_1,X_2,\dots,X_n$ be a random sample from distribution with pmf $p(x;θ)=\theta^x(1−θ),x=0,1,2,…;0$ elsewhere, $0≤θ≤1$. I know that $Y_1=\sum_1^n X_i$ is a sufficient statistic for $θ$ because this pmf itself comes from family of exponential distribution. The expectation for sufficient statistic is $$E[Y_1]=n\frac{1−θ}{θ}$$ How do I find a function of Y1 that is an unbiased estimator for $θ$? I tried algebraically solving it and the function is $\varphi(Y_1)=\frac{n}{Y_1+n}=\frac{1}{\frac{Y_1}{n}+1}$. Is this correct? I'm not sure how to find the $\mathbb{E}[\varphi(Y_1)]$ though.

I believe that the MLE of parameter $p$ in the geometric distribution, $\hat p = 1/(\bar x +1)$, is an unbiased estimator for $p$ and would like to prove it. So far, I have:  $E[\bar x + 1] = E[\bar x] + 1 = \frac{1}{p} - 1 + 1 = \frac{1}{p}$  I can see that the relationship is likely there, but I don't know how to work with the $(\bar x + 1)$ being in the denominator.


This issue has been driving me crazy for the past 10-20h. I have a group plot (pgfplots) where I have 2 plots one under another. I'd like to draw a vertical line (e.g. a helpline at x=150e-6) that would go through all of them.  When drawing inside the axis or rather nextgroupplot environment I can use something like this: \draw[thin] (axis cs:150e-6,\pgfkeysvalueof{/pgfplots/ymin}) -- (axis cs:150e-6,\pgfkeysvalueof{/pgfplots/ymax}); but this allows me to draw only on one of the subplots. If I go outside the axis environment I am able to draw on the entire {tikzpicture}, but I can't use the axis reference.  \begin{figure*}[h] \centering \begin{tikzpicture}  \begin{groupplot}[       group style = {group size=1 by 2, x descriptions at=edge bottom, vertical sep=0.2cm},       ytick={0, 1.8},       ymin=0,       ymax=3,       xmin=0,       xmax=550e-6,       change x base=true,       x SI prefix=micro]  \nextgroupplot \addplot table [x index = {0}, y index = {1}, col sep=comma] {plots/plot1reduced.csv};  \nextgroupplot[x unit=s] \addplot table [x index = {0}, y index = {3}, col sep=comma] {plots/plot1reduced.csv};  \draw[thin] (axis cs:150e-6,\pgfkeysvalueof{/pgfplots/ymin}) -- (axis cs:150e-6,\pgfkeysvalueof{/pgfplots/ymax});  \end{groupplot} \end{tikzpicture} \caption{Case 1} \label{fig:case1plot} \end{figure*}


Trying to understand how the Algebraic Bethe Ansatz works, I'm actually reading some papers and trying to apply for XXZ or XYZ model. But my problem is that I don't know how to find the R-matrix describing the considered model without using vertex models (their classical equivalent). I know that it is somehow related to quantum groups, but this is a little bit confusing, can someone tell me if starting from the Hamiltonian of XYZ/XXZ spin chain I can get the corresponding R-matrix?

In algebraic Bethe ansatz procedure, one of the central objects is the R-matrix satisfying the Yang-Baxter equation, but all the papers/books give directly its expression without deriving it, so my question is How can i derive the R-matrix for XYZ/XXZ Heisenberg model?


I can not understand that how it is proved, so please somebody help me.I approch by logarithimic test but I unable to find out the convergency or divergency.

Could I have a hint for testing the convergence of the following series please?  $$\sum_{n=2}^\infty\frac{1}{(\ln n)^{\ln n}}$$  Edit  The integral test does not work because $\int_1^n\frac{1}{(\ln x)^{\ln x}}dx$ has not an elementary primitive.  Thank You.


This is a problem from Hoffman & Kunze book on linear algebra: Let V  be a finite dimensional inner-product vector space.  Let U be a self-adjoint unitary linear operator over V. Show that U(α)=β−γ, where  α=β+γ, β is in W and γ is W⊥. Here, W is a subspace of V.  Sorry for my english.

This problem is from Kunze Hoffman book. I think I go in the right direction to solve this but I miss some point to finish it. Can anyone help me?          Suppose $U$ is a self-adjoint unitary linear operator on a finite-dimensional inner product space $V$. Prove that we can find a subspace $W$ such that, if we express every $\alpha$ in $V\,$ in the form $\alpha = \beta + \gamma$, here $\beta$ in $W$ and $\gamma$ in $W^{\bot}$, then we have $U(\alpha) = \beta - \gamma$      If we denote $W = range(U+I)$, $W' = range(U - I)$,then must have $W \subset null(U-I)$ and $W \subset W^{'\bot}$. We can finish the proof if we can prove that $W' = null(U+I)$ or $W' = W^{\bot}$. But I can't prove this...  Thanks


Prove that $A - (B \cap C) = (A - B) \cup (A - C)$   How do I go about solving this proof? I've tried a few things but I'm stuck. I don't need the exact proof step by step, just a few hints on how to solve it would really help me.  edit: I tried to solve considering $3$ cases.  If $x$ is an element of $A−(B\cap C)$, then $x$ belongs to $A$ and $x$ doesn't belong to $B\cap C$.  Then, there I considered $3$ possibilites:   $x\in A$ and ($x\in B$ or $x\in C$) $x\in A$ and ($x\notin B$ or $x\in C$) $x\in A$ and ($x\in B$ or $x\notin C$)   After that I found that all of these cases satisfied the definition of set difference which states that $A-B$ is equal to the elements of $A$ that are not in $B$. In that case my $B$ is "($B\cap C$)". After that I tried to prove the other side "$(A−B)\cup (A−C)$" but I got lost and didn't know what to do.

First part :  I want to prove the following De Morgan's law :  ref.(dfeuer)  $A\setminus (B \cap C) = (A\setminus B) \cup (A\setminus C) $    Second part:  Prove that $(A\setminus B) \cup (A\setminus C) = A\setminus (B \cap C) $    Proof:  Let $y\in (A\setminus B) \cup (A\setminus C)$     $(A\setminus B) \cup (A\setminus C) = (y \in A\;  \land y \not\in  B\;) \vee (y \in A\; \land y \not\in C\;)$      $\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;= y \in A\ \land (  y \not\in B\; \vee \; y \not\in C ) $      $\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;= y \in A \land  (\lnot ( y\in B) \lor \lnot( y\in C) )$   According to De-Morgan's theorem :  $\lnot( B \land C) \Longleftrightarrow (\lnot B \lor \lnot C)$ thus     $y \in A \land (\lnot ( y\in B) \lor \lnot( y\in C) ) = y \in A \land y \not\in (B \land C)$   We can conclude that  $(A\setminus B) \cup (A\setminus C) = A\setminus (B \cap C)$


I have an old gateway420gr that I was hoping to use as my computer crashed. I been unable to get past authenticity issues as I don't know the original owners passwd. I can't access the internet via a wired connection. I have tried to access the Grub via recovery mode to attempt to change the user passwd but to only get " Manipulation Token error" message. While waiting for someones response to this question, I will try to read other comments! also, is there a way to get a live bootable dvd? William

I'm working on a Ubuntu system, and my client has completely forgotten his administrative password. He doesn't even remember entering one; however it is there.  I've tried the suggestions on the website, and I have been unsuccessful in deleting the password so that I can download applets required for running some files. Is there a solution?


The  is a bit off.  On June 15th, a user was deleted who (presumably) cast the final 'approve' vote on two suggested edits. On that day, SmokeDetector's reputation decreased from 299 to 295, but the reputation tab makes it look like a -8 change.

I am aware that . But now there is an extraneous "reverted" event to go along with user removal:     Source: .   The edit was not reverted, it's . In any case, I should not lose 2 points twice for the total of -4. And indeed, my reputation only dropped from 131 to 129 despite what the history suggests.   So the line with "-2 reverted" is a bug.     A more extreme example:  got 21 "reverted" events on 2017-06-30, none of which should be there. His rep loss is 42, not 84 as the reputation history says.


Can I move my Xbox 360 account to my PS4?

I used to play gta 5 online on my ps3 but it ended up breaking and I can't use it anymore I purchased the game for xbox 360 and started playing the game all over again and some of you know how hard that can be specially online.. So I was wondering if I could somehow transfer my old ps3 social club account to my xbox an use it on xbox from now on?


We have submitted our manuscript for publication on June 18, 2020. Until now, we haven't heard any decision from the journal. The status of the manuscript on the online system is 'under review' since July 09, 2020 (this was updated twice). According to the journal's website, the review speed is 5.0 weeks for the first decision and 7.1 for the final decision. I am a bit confused if I should contact the editor or if I should wait until I receive an answer without contacting them. Do you recommend me contacting the editor in order to follow up on our manuscript? Most importantly, if yes, when should we contact the editor to follow up on our submitted manuscript? Thank you in advance

What steps does a manuscript typically go through from submission to publication (or rejection) in a typical journal? How are these steps referred to, in particular by editorial systems, and how long do they each typically take?  Note that this question is about the typical situation and hence not about:   Journals with an atypical workflow, e.g. those that allow for an instantaneous reviewer–author interaction. Exceptional steps or rare occurrences such as withdrawal or .   This is a canonical question on this topic as per . Due to its nature, it is rather broad and not exemplary for a regular question on this site. Please feel free to improve this question.


Background: , there is debate on which ones among the following are correct English:  the fruit is the fruits are the fruit are *?  Other questions on this site are about the regular mass noun (the fruit is) vs the regular count noun (the fruit are), but using the singular form "fruit" also as the plural form is only tangentially touched on once that I can see. I'm looking for a canonical answer on this specific point. Do dictionaries, English grammars, or style guides list "fruit" as its own plural? Is it considered correct or incorrect? If it's a nonstandard usage, where is it used? American English? Just some areas? It sounds wrong to me as a native Australian English speaker. Is it correct to say "two fruit"?

I've always understood the plural of fruit to be fruit, not fruits.  I was looking at some marketing material and they used the word "fruits" in the following context:      A unique infusion made with ... strawberry, raspberry and cranberry fruits    In discussion with someone about this sentence, he described that the  is not necessarily always people, and could be persons. Therefore it's possible that fruits could be a legitimate plural form.  Is fruits used correctly in this context, or could it be used correctly in ANY context?


Is this the most natural way to put it:     I work in a big company. At 12 o'clock I have an hour break.   Or should we better say:     I work in a big company. At 12 o'clock I have an hour's break.   Or even     I work in a big company. At 12 o'clock I have a one-hour break.   I would go for the last version, being unsure in how widely the first two are used, under the "" principle; but still I'm curious.   P.S. My question is different from  because I'd also want to know whether  "an hour break" is okay. I was , chanced upon this expression, decided to inquire whether it was okay, but in the end added some alternative formulations.   I'd like to know which is more widely used and whether there are differences in meaning.

Are these expressions syntactically correct and semantically equivalent? What is general rules for "number-time noun" and "number time' noun" from semantic point of view?    "a day's work" vs "one-day work" "two days' notice" vs "two-day notice" "one year's pay" vs "one-year pay"     also see .


Let $A_1,A_2,...,A_n$ be subgroups of $G$ and $H=A_1A_2...A_n$.  Is there any sufficient and necessary condition for $H$ to be subgroup ?  When $n=2$, $H$ is a subgroup if and only if $A_1A_2=A_2A_1$. I do not know if there is any generalization of this principle ?  Note: if necessary you may assume $G$ is finite.  Edit: This question seems to be already asked  with not accepted answer.

Let $G$ be any group. It's a well-known result that if $H, K$ are subgroups of $G$, then $HK$ is a subgroup itself if and only if $HK = KH$.  Now, I've always wondered about a generalization of this result, something along the lines of:  Theorem: If $H_1, \ldots, H_n$ are subgroups of $G$, then $H_1H_2\dots{H_n}$ is a subgroup if and only if ($\star$) holds, where $(\star)$ is some condition on $H_1, \ldots, H_n$, preferably related to how the smaller products $H_{m_1}\ldots{}H_{m_k}$, for $k < n$, behave.  Question 1: Is there such a theorem?  I do know, and its easy to prove, that if $H_iH_j = H_jH_i$ for every $i, j$, then the big product is a group, but this is not satisfying since it's far from necessary (just take one of the groups to be $G$, and you need no commutativity at all). Also, I've been told that there is no really satisfactory answer; if that is indeed the case, then my question would be why? In particular:  Question 2: Are there really problematic counterexamples where you can see that the behavior of the smaller products has nothing to do with the big product, so that no such a theorem can ever exist?  I would appreciate even an answer for the particular case $n = 3$.  Thanks.


I have a text file as follows:  test1,test2,test3 test4,test5 test6,test7,test8,test9,test10 test11,test12,test13,test14   How can I replace commas with semicolons, starting with the second one (and continuing to the last one)?  I want to get output as follows:  test1,test2;test3 test4,test5 test6,test7;test8;test9;test10 test11,test12;test13;test14

I have a file containing lines:  india;austria;japan;chile china;US;nigeria;mexico;russia   I want to replace all the occurences of semicolon on each line with e.g. ;NEW;, but starting from the 2nd occurence only. The result should look like this:  india;austria;NEW;japan;NEW;chile china;US;NEW;nigeria;NEW;mexico;NEW;russia   I tried this with gsub, but it replaces all the occurences:  awk '/;/{gsub(/;/,";NEW;") }{print}'


If you state "Jack Hare" will die at precisely 15:00 12/03/14 without stating the location, and you write this without knowing where they will be at the time, and the person goes to work as per normal, can this be used to kill more than one person?

in the Death Note states:        Whether the cause of the individual's death is either a suicide or accident, if the death leads to the death of more than the intended, the person will simply die of a heart attack. This is to ensure that other lives are not influenced.      However,  states:        Even though only one name is written in the Death Note, if it influences and causes other humans that are not written in it to die, the victim’s cause of death will be a heart attack      Besides the fact that I find these 2 rules to be contradicting (correct me if I'm wrong), it still made me curious: Is it possible to kill people indirectly with the Death Note?  For example, writing a heart surgeon's name during a operation, or a pilot's name while mid-flight.


I want to make it so that the text I enter into the JTextField fruit is read on button press, and prints "apple" if the entered text is apple, and "not apple" if the entered text is not. However, even when I enter "apple" it runs through the else statement and prints "not apple" and I cannot figure out why this is happening. My code is below: submit.addActionListener(new ActionListener() {             @Override             public void actionPerformed(ActionEvent actionEvent) {                 String enter = fruit.getText();                 String fruit2 = enter.toUpperCase();                  if (fruit2 == "APPLE") {                     System.out.println("apple");                 } else {                     System.out.println("not apple");                 }             }         });

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?


I want to hide negative reputation which appears in the reputation history. I want to know the   settings do so.  Edited:    This was the answer i needed at last i found by my own, this is the mistake of stack overflow, really fedup of dwonvotes..!!!! annoying..!!

Currently, when a moderator deletes a user all of the user's votes are removed along with the user themselves. I was pretty surprised at this behaviour when I first heard about it, and I don't think it is a good idea to throw away all of the votes just because the user is deleted.  Votes are locked after a short while and you can't change your vote unless the post is edited. This is a precedent that shows that users don't have complete control over their old votes, their ability to change or remove their votes is restricted for the benefit of the whole site. I don't understand why users that get deleted are suddenly exempt from this restriction.   The drawback of removing the votes is that we throw away valuable information. Voting plays an important role on SE sites, and every time an active user is deleted we throw away some of that information.  I also don't see why rage-quitting users get to remove one kind of contribution (votes) while we stop them if they try to remove their other contributions to the site (posts). We stop users from deleting all their posts because they still provide value to the site, I don't see why we shoud treat votes any different. They might have less value than posts, but they are useful to the site as a whole.  I'm ignoring any vote invalidation in connection with vote fraud or sock puppeting for the purposes of this post. Those votes should certainly be invalidated, but that doesn't usually happen by deleting users.  To prevent abuse of user deletion for vote fraud, there could be some minimum requirements on account age and reputation, below those requirements any votes would be discarded on deletion. Any suspicious voting patterns of the user should automatically block the deletion until they have been checked manually. This is of course more effort for the moderators, but account self-deletion doesn't happen so often that this would be a problem in my opinion.  The recent change to counting reputation from deleted questions if they are old enough and have at least three upvotes moves the whole reputation system further into a direction where reputation can't be taken away after some time. The reasoning for this change was that even though certain questions are off-topic now, they used to be on-topic and therefore the reputation earned had some meaning then. This provides further precedent that reputation shouldn't be removed retroactively on a large scale.


I have been working an hour for this.  Taken from their official documentation :  curl -sL https://deb.nodesource.com/setup_4.x | sudo -E bash - sudo apt-get install -y nodejs   However, its never working for me. I have tried to clear the npm cache, even uninstall it and run both command again. Its still not working. I keep getting version 0.10.25  I run :  grep -h ^deb /etc/apt/sources.list /etc/apt/sources.list.d/*    And this is what i get :  deb http://id.archive.ubuntu.com/ubuntu/ trusty main restricted deb-src http://id.archive.ubuntu.com/ubuntu/ trusty main restricted deb http://id.archive.ubuntu.com/ubuntu/ trusty-updates main restricted deb-src http://id.archive.ubuntu.com/ubuntu/ trusty-updates main restricted deb http://id.archive.ubuntu.com/ubuntu/ trusty universe deb-src http://id.archive.ubuntu.com/ubuntu/ trusty universe deb http://id.archive.ubuntu.com/ubuntu/ trusty-updates universe deb-src http://id.archive.ubuntu.com/ubuntu/ trusty-updates universe deb http://id.archive.ubuntu.com/ubuntu/ trusty multiverse deb-src http://id.archive.ubuntu.com/ubuntu/ trusty multiverse deb http://id.archive.ubuntu.com/ubuntu/ trusty-updates multiverse deb-src http://id.archive.ubuntu.com/ubuntu/ trusty-updates multiverse deb http://id.archive.ubuntu.com/ubuntu/ trusty-backports main restricted universe multiverse deb-src http://id.archive.ubuntu.com/ubuntu/ trusty-backports main restricted universe multiverse deb http://security.ubuntu.com/ubuntu trusty-security main restricted deb-src http://security.ubuntu.com/ubuntu trusty-security main restricted deb http://security.ubuntu.com/ubuntu trusty-security universe deb-src http://security.ubuntu.com/ubuntu trusty-security universe deb http://security.ubuntu.com/ubuntu trusty-security multiverse deb-src http://security.ubuntu.com/ubuntu trusty-security multiverse deb http://extras.ubuntu.com/ubuntu trusty main deb-src http://extras.ubuntu.com/ubuntu trusty main deb http://ppa.launchpad.net/cpug-devs/ppa/ubuntu saucy main deb http://ppa.launchpad.net/cwchien/gradle/ubuntu saucy main deb http://ppa.launchpad.net/dominik-stadler/subversion-1.7/ubuntu trusty main deb http://ppa.launchpad.net/dominik-stadler/subversion-1.7/ubuntu trusty main deb http://ppa.launchpad.net/dominik-stadler/subversion-1.8/ubuntu trusty main deb http://linux.dropbox.com/ubuntu saucy main deb http://dl.google.com/linux/chrome/deb/ stable main deb http://dl.google.com/linux/chrome/deb/ stable main deb http://dl.google.com/linux/chrome/deb/ stable main deb http://ppa.launchpad.net/plushuang-tw/uget-stable/ubuntu saucy main deb [arch=amd64,i386] http://repo.steampowered.com/steam/ precise steam deb-src [arch=amd64,i386] http://repo.steampowered.com/steam/ precise steam deb [arch=amd64,i386] http://repo.steampowered.com/steam/ precise steam deb-src [arch=amd64,i386] http://repo.steampowered.com/steam/ precise steam deb http://ppa.launchpad.net/ubuntu-wine/ppa/ubuntu trusty main deb http://ppa.launchpad.net/ubuntu-wine/ppa/ubuntu trusty main deb http://ppa.launchpad.net/webupd8team/java/ubuntu trusty main deb http://ppa.launchpad.net/webupd8team/java/ubuntu trusty main   It seems the nodejs is not on the list.  What should i do? Please kindly help me

I have installed nodeJS on Ubuntu with following code   sudo apt-get install nodejs   Since I am a new user for ubuntu I also ran this code too  sudo apt-get install npm   Now when I type    nodejs --version   It shows   v0.6.19   I checked and saw latest nodeJS version is 0.10.26   How can I update my version of nodeJS to 0.10.26?  I tried with    sudo apt-get install <packagename>  sudo apt-get install --only-upgrade <packagename>   but no luck.


Is there any possible way to calculate the integral of $\frac{1}{(x^2+1)^2}$ by partial fraction decomposition? I do not know the formulas for the trigonometric method. Thank you!

I am in the middle of a problem and having trouble integrating the following integral:  $$\int_{-1}^1\frac1{(1+x^2)^2}\mathrm dx$$  I tried doing partial fractions and got:  $$1=A(1+x^2)+B(1+x^2)$$  I have no clue how to solve this since it is obvious there is no way to cancel out either $A$ or $B$ to get the other variable. Please guide me.  Thank you.


I saw an example recently that looks like the following:  const size_t NDim = 3;   double coords[NDim];   My question is straight forward. When does one use size_t vs an int or unsigned int? In this particular case, wouldn't the following be the equivalent as the above:  const unsigned int NDim = 3;   double coords[NDim];

I notice that modern C and C++ code seems to use size_t instead of int/unsigned int pretty much everywhere - from parameters for C string functions to the STL.  I am curious as to the reason for this and the benefits it brings.


So I know this is a beginner question, but I got confused, because from what I understand is that protected is only accessible to sub-classes / classes that extend the super class .. but I'm working on a project and weirdly enough, I was able to access a protected instance variable from class A , in class B (class B does not extend class A). Can someone please explain this?

In Java, are there clear rules on when to use each of access modifiers, namely the default (package private), public, protected and private, while making class and interface and dealing with inheritance?