Our old camera broke, so we decided to buy a new one, but we can't choose between similar models from Fujifilm, Canon, and Nikon. Many people advised me to get the Canon, but in my opinion the Fujifilm looks better. What's the difference between these brands, and in general is there a particular reason I should pick one over another?
I need a P&amp;S camera for my family. They would probably use it for family functions,trips etc. I want a camera with flash for taking good night photos with a decent quality. They are not technically inclined and I dont want much manual features apart from the normal modes (potrait,sports,landscapes). Decent picture quality for normal conditions is the criteria I am looking for. If the camera looks little big, it is an added advantage.  I have looked at few models like Fujifilm Fine Pix F800 EXR, the Panasonic Lumix DMC series and a Nikon P510. But I am confused with all the options and the different reviews on different sites. My thinking is that for a point and shoot camera, it is better to consider brands other than Nikon and Canon since they may provide better value for money.   Can someone recommend some good resources for analysis and what kinds of cameras I should consider - a bridge camera, a basic point and shoot, or some other type?
Why must the eigenvalue of the number operator be an integer? My apologies if this question has already been answered. Using the notation of Sakurai, we have an energy eigenket N and an eigenvalue n.  $$N | n \rangle = n | n \rangle$$  For the number operator $N = a^\dagger a $. My question is precisely why does n have to be an integer. I do understand that it must be positive definite due to the norm condition on $ a | n \rangle $:  $$\langle n | a^\dagger a | n \rangle \geq 0$$  I can see that we can show:  $$ a | n \rangle = \sqrt{n-1} | n-1 \rangle $$ and similarly for $a^\dagger | n \rangle$  Sakurai argues that the sequential operation of $a$ operators leads to the form which he does not write, but I will write here for clarity:  $$ a^k | n \rangle = \left(\sqrt{n}\sqrt{n-1}...\sqrt{n-k+1}\right) | n - k + 1 \rangle $$   Since  $$ a|0 \rangle = 0 $$  the sequence must terminate, but can only terminate if n is an integer. How can we make that jump? Is there a formal mathematical proof that the sequence $\left(\sqrt{n}\sqrt{n-1}...\sqrt{n-k+1}\right)$ will terminate if and only if n is an integer? Why am I not able to shutdown, log-off and restart after an upgrade to Ubuntu 13.10? After the update neither my desktop (Asus) nor my laptop (HP) respond to the shut-down, log off or restart commands in the right top tool bar.  How do I fix the issue? VBA array sort function? I'm looking for a decent sort implementation for arrays in VBA. A Quicksort would be preferred. Or any other  other than bubble or merge would suffice.  Please note that this is to work with MS Project 2003, so should avoid any of the Excel native functions and anything .net related. Send file using POST from a Python script Suppressing addition of blank page before figure when wrapping long JPEG image I have the following LaTeX file, whose sole purpose is to wrap a JPEG file. This file does not convert well to PDF, so I'm using this unorthodox technique to convert it.  \documentclass{article} \usepackage[pdftex]{graphicx} \pagenumbering{gobble} \begin{document}  \centering\includegraphics[height=650pt]{foo.jpg} \end{document}   This produces a PDF file including the document, but it first includes a blank page, and thus produces a 2 page document, rather than a 1 page document. How do I get rid of this blank page? Using \textheight instead of 650pt as an argument to \includegraphicsmakes the  problem go away, but I'd prefer the larger size I get from using 650pt.  Here is the relevant information from the log file.  &lt;foo.jpg, id=1, 162.6075pt x 1165.35374pt&gt; File: foo.jpg Graphic file (type jpg)  &lt;use foo.jpg&gt; Package pdftex.def Info: foo.jpg used on input line 14. (pdftex.def)             Requested size: 90.6998pt x 650.0pt.  [1  ] Overfull \vbox (100.0pt too high) has occurred while \output is active []   [2 &lt;./foo.jpg&gt;] (./foo.aux) )    I'd prefer to not make the actual document public. Therefore the code above is not a MWE. However, if anyone has tips on how to create a dummy JPEG of the same size, let me know. How can I determine accuracy of past probability calculations? I do not study statistics but engineering, but this is a statistics question, and I hope you can lead me to what I need to learn to solve this problem.    I have this situation where I calculate probabilities of 1000's of things happening in like 30 days.  If in 30 days I see what actually happened, how can I test to see how accurately I predicted?  These calculations result in probabilities and in actual values (ft).  What is the method for doing this? Thanks, CP What is the origin of "a cut above/below the rest"? Where did the phrases "a cut above the rest" and "a cut below the rest" come from? I'm supposing they came from the same source. I feel it something very obvious, but I don't know what. While working in a Java app, I recently needed to assemble a comma-delimited list of values to pass to another web service without knowing how many elements there would be in advance. The best I could come up with off the top of my head was something like this:  public String appendWithDelimiter( String original, String addition, String delimiter ) {     if ( original.equals( "" ) ) {         return addition;     } else {         return original + delimiter + addition;     } }  String parameterString = ""; if ( condition ) parameterString = appendWithDelimiter( parameterString, "elementName", "," ); if ( anotherCondition ) parameterString = appendWithDelimiter( parameterString, "anotherElementName", "," );   I realize this isn't particularly efficient, since there are strings being created all over the place, but I was going for clarity more than optimization.  In Ruby, I can do something like this instead, which feels much more elegant:  parameterArray = []; parameterArray &lt;&lt; "elementName" if condition; parameterArray &lt;&lt; "anotherElementName" if anotherCondition; parameterString = parameterArray.join(",");   But since Java lacks a join command, I couldn't figure out anything equivalent.  So, what's the best way to do this in Java? I'tm trying to show in SQLcmd window the results of these queries:  SELECT SYSDATETIME() AS "date";  PRINT 'EXTRAÍDO POR:' SELECT SUSER_NAME() AS "Owner"  PRINT 'PASSWORD SETTINGS'; exec xp_loginconfig;  PRINT 'PASSWORD SETTINGS'; select * from sys.sql_logins;   And using this command in SQLcmd:  sqlcmd -S myServer -i inputpath -s, -o outputPath(like C:\log.xls) -e   So the sqlcmd output the file and does not show nothing in sqlcmd screen. How can i print these "Print" commands in the sqlcmd screen? (command promt).  When I run it on SSMS works well, like:  (1 row affected) OWNER:  (1 row affected) PASSWORD SETTINGS  (8 rows affected) PASSWORD SETTINGS  I would like to show in the prompt command this, like in the SSMS.  Thanks! How do I make a WinForms app go Full Screen I have a WinForms app that I am trying to make full screen (somewhat like what VS does in full screen mode).  Currently I am setting FormBorderStyle to None and WindowState to Maximized which gives me a little more space, but it doesn't cover over the taskbar if it is visible.  What do I need to do to use that space as well?  For bonus points, is there something I can do to make my MenuStrip autohide to give up that space as well? Let $x,y,z&gt;0$: Prove that:   $\frac{1}{(x+2y)^2}+\frac{1}{(y+2z)^2}+\frac{1}{(z+2x)^2} \geq\frac{1}{xy+yz+zx}$  I tried to apply Cauchy - Schwarz's inequality but I couldn't prove this inequality! I would like to search my table having a column of first names and a column of last names.  I currently accept a search term from a field and compare it against both columns, one at a time with       select * from table where first_name like '%$search_term%' or      last_name like '%$search_term%';   This works fine with single word search terms but the result set includes everyone with the name "Larry". But if someone enters a first name then a space, then a last name, I want a narrower search result. I've tried the following without success.         select * from table where first_name like '%$search_term%' or last_name      like '%$search_term%' or concat_ws(' ',first_name,last_name)      like '%$search_term%';   Any advice?  EDIT:  The name I'm testing with is "Larry Smith".  The db stores "Larry" in the "first_name" column, and "Smith" in the "last_name" column.  The data is clean, no extra spaces and the search term is trimmed left and right.  EDIT 2:  I tried Robert Gamble's answer out this morning.  His is very similar to what I was running last night.  I can't explain it, but this morning it works.  The only difference I can think of is that last night I ran the concat function as the third "or" segment of my search query (after looking through first_name and last_name). This morning I ran it as the last segment after looking through the above as well as addresses and business names.    Does running a mysql function at the end of a query work better than in the middle? How do I get rid of the noise on my Hayes Stroker Trail brakes No hats on the mobile version? Is the following correct, or is there more to it?  "I forgot his name" — I knew his name, but I forgot it.  "I forget his name" — I keep forgetting his name. Where using "forget" basically means that you tried to remember this information before as well, but you couldn't then either. It seems to me that we could change all the current spin values of particles by multiplying them by two. Then we could describe Bosons as even spin particles and Fermions as odd spin particles. Is there some consequence or reason why we can't simply change 1/2 as the smallest unit of spin into 1?  It just seems prettier this way. In fact, there's almost an interesting relation to even and odd functions in that if you switch any two bosons around the wave function stays the same while if you switch any two fermions around the wave function becomes negative. Determinant of a specially structured matrix ($a$'s on the diagonal, all other entries equal to $b$) I have the following $n\times n$ matrix:  $$A=\begin{bmatrix} a &amp; b &amp; \ldots &amp; b\\ b &amp; a &amp; \ldots &amp; b\\ \vdots &amp; \vdots &amp; \ddots &amp; \vdots\\ b &amp; b &amp; \ldots &amp; a\end{bmatrix}$$  where $0 &lt; b &lt; a$.  I am interested in the expression for the determinant $\det[A]$ in terms of $a$, $b$ and $n$.  This seems like a trivial problem, as the matrix $A$ has such a nice structure, but my linear algebra skills are pretty rusty and I can't figure it out.  Any help would be appreciated. You can't see the question owner's special color Flow to get all site collections in a tenant Created a Flow by using the below REST call and stored the title and Urls in another list  /_api/web/lists/getbytitle('DO_NOT_DELETE_SPLIST_TENANTADMIN_ALL_ SITES_AGGREGATED_SITECOLLECTIONS')/items?$select=Title,SiteUrl   Here the problem is it is returning only 100 items but I have 360 site sollections.   Not sure what I am doing wrong Why is dark matter the best theory available to explain missing mass problems? Why is dark matter the best theory to explain the missing mass problem?    Why is dark matter mathematically necessary to explain the missing mass problem?    On a side not I believe dark matter is definately intuitive the next logical step in physics is to accept the fact the direct observations can not always be the determining factor in the acceptance of a theory.  Positivism is not going to be the only driving force in physics forevermore.    One theory that seems almost as good is the supersymmetric particle. What determination which are actually detectible and how would we distinguish the differences between the two?    References:   .