I'm new to photography and just starting to take photo in RAW format. I haven't found a difference in quality of color adjustment editing between ViewNX (free software coming with my Nikon d5100) and Picasa, perhaps because of my inattentiveness. So I've decided to ask here what is the best free software to get most from RAW (Nikon NEF) photo editing?
I'm looking for a free RAW editor/converter on Windows. Can you tell me some strong/weak points of them comparing with Capture NX and/or Adobe Photoshop Elements?       - conversion &amp; EXIF  - white balance  - registration not possible anymore   EXIF editing would be a nice bonus.  Related:
Counter with 4 flip flops jk synchronous from 3 to 13! I have to create a counter with 4 flip flops jk synchronous. The counter shall count in this order: 3 to 13 and then to 3 to 13 and so on..  I have to use logisim simulator.   Ok. So i think its solved. I realized that the circuit needs to start at 0 ou 1 and stabilize after the 13 and then it goes to 3. Thanks for your help.  Hope this will help for somebody else too.  Thank you all for your help! What is the next perfect square of the form 14444... in decimal notation? We know that $12^2 = 144$ and that $38^2 = 1444$. Are there any other perfect squares in the form of $\frac{13}{9} (10^n - 1) + 1$ (i.e. $1$ followed by $n$ $4$'s), and how would we prove it? Multiple submit buttons in an HTML form Let's say you create a wizard in an HTML form. One button goes back, and one goes forward. Since the back button appears first in the markup when you press Enter, it will use that button to submit the form.  Example:    &lt;form&gt;   &lt;!-- Put your cursor in this field and press Enter --&gt;   &lt;input type="text" name="field1" /&gt;    &lt;!-- This is the button that will submit --&gt;   &lt;input type="submit" name="prev" value="Previous Page" /&gt;    &lt;!-- But this is the button that I WANT to submit --&gt;   &lt;input type="submit" name="next" value="Next Page" /&gt; &lt;/form&gt;     I would like to get to decide which button is used to submit the form when a user presses Enter. That way, when you press Enter the wizard will move to the next page, not the previous. Do you have to use tabindex to do this? Why directory with large amounts of entries does not shrink in size after entries are removed? Close vote notice: While the linked duplicate asks same question, the comments and the only answer do not provide an answer which draws from authoritative source. The , does in fact provide the answer I've been seeking. Thus the proposed duplicate isn't helpful, however Thomas's answer here is proper.  According to the  and personal account , directories that have large amount of entries get to a size over 4096 bytes (which can be seen with ls -l output), but once the entries are removed - the number never goes down.   The question is "why" ? Is it due to how ext4 filesystem configured to retain directory metadata ? Obviously removing the directory and recreating it isn't a solution, since it deletes original inode and creates a new one. What can be done to decrease the number manually ? Does SOQL join not respect OWD /sharing settings? A->B are two objects connected using lookup relationships. If somehow, I get read only access to child record but do not have access on parent record then still i am able to see data from parent record through formula fields. Similarly will SOQL in Apex also allow me to fetch fields from parent record regardless of using 'WITH Sharing ' keyword at class level? Explicit bijection between the successor of $\alpha$ and $\alpha$ (infinite ordinal). I would like to construct an explicit bijection from $\alpha^*$ to $\alpha$, where $\alpha$ is an infinite ordinal. I have been told a possible bijection would be:  \begin{equation} f(\beta) = \begin{cases} 0 &amp; \text{if } \beta = \alpha \\ \beta^* &amp; \text{if } \beta \text{ is finite} \\ \beta &amp; \text{otherwise} \end{cases} \end{equation}  I don't understand how this is constructed, or why it is a bijection. Find count of all combination of numbers whose sum is x I want to find the sum of all combination of numbers whose sum is x, for e.g.  when x = 3 f(x) = countOf(111,12,21,3) = 4 I've just recently started playing D&amp;D 4e through the Red Box, and I am confused about how to fill in the power cards.  So, take Nimbus of Holy Shielding for instance. I understand the Target and Hit components as well as the effect, but my question is about the Attack component. It reads:     Attack: Wisdom vs Will.   Does the mean whatever my Wisdom score is, without the modifier, is compared to the Will score of the enemy? Would I then not even have to roll a d20 to see if it works? I play with some serious board gamers, but we have neglected Monopoly for a number of years, so our knowledge is mostly based on high school &amp; house rules.  We played last week and enjoyed it, but there was a piece of contention. There are times where we decide that we don't like one of our friends for some reason and don't want them to win (i.e. we landed on their property a bunch, or they refused to make a deal, etc.).  So when player 1 has some property and player 2 lands on it and cannot pay the rent their assets (houses/hotels get liquidated), their property gets transferred to the other player. (Please correct me if I'm wrong.) In this case, though, player 3 "traded" the amount of money owing for a piece of property (way overpaid). In this case they did it so that player 1 would not get the properties. Player 2 had no chance of winning the game (all properties mortgaged, no cash to speak of and many of the other properties with 3+ houses/hotels on them).  To summarize: Is it OK for a third player to purchase/trade property or cash to/from a player who is about to lose? if $x_i$ are IID  continuous random variables, with $E[x_i]=μ$, is the following correct?   $E\left[\prod_{i=1}^n(1+⍺\space x_i)^i\right] = \prod_{i=1}^nE\left[(1+⍺\space x_i)^i\right] =  \prod_{i=1}^n(1+⍺\space E\left[x_i\right])^i = (1+⍺\space μ)^n$  thanks! Why is the copy-constructor argument const? Visual design changes to the review queues I've just upgraded to Windows 10 from Windows 8.1 on my partitioned laptop that has Ubuntu 14.04 installed. Grub no longer appeared on boot so I ran boot-repair from an Ubuntu liveUSB. This didn't seem to have any effect. I've checked and secure boot is still disabled. Log from boot-repair:  So what's next?  Update: I've attempted to use chroot to update grub from my Ubuntu partition. update-grub runs successfully finding both linux and windows boot manager but the process still doesn't have any effect. grub-install complains that it cannot find EFI directory (but I have mounted everything correctly).  Update2: Just discovered that running efibootmgr after chroot into ubuntu shows ubuntu as not being in the boot order at all. I manually changed the order and rebooted to discover that the bootorder was reset. I run in windows: bcdedit /set {bootmgr} path \EFI\ubuntu\shimx64.efi But this has no effect either even after reporting 'Operation Successful'. Given a recurrence relation:   $$ x_{n+2} = px_{n+1} + qx_n + r $$   Find the general term $x_n$ given initial conditions $x_1 = a$ and $x_2 = b$, where $a,b,p,q,r$ are some given numbers, $n \in \mathbb N$.   Since this is a non-homogeneous linear recurrence relation i've started with solving for $x_n^h$ which is a solution for homogeneous relation:  $$ x_{n+2} - px_{n+1} - qx_n = 0 \\ \lambda^2-p\lambda - q = 0 $$  I'm assuming here that two distinct roots $\lambda_{1,2}$ exist for this equation (single root case is handled similarly). So the general term is in the form:  $$ x_n = C_1\lambda_1^{n-1}+C_2\lambda_2^{n-1} $$  With the initial condition it's possible to find the values for $C_1$ and $C_2$:  $$ C_1 + C_2 = a \\ C_1\lambda_1 + C_2\lambda_2 = b $$  After solving the system of equation with respect to $C_1$ and $C_2$:  $$ C_1 = \frac{b-a\lambda_2}{\lambda_1 - \lambda_2} \\ C_2 = \frac{b-a\lambda_1}{\lambda_2 - \lambda_1} \\ $$  Which eventually results in:  $$ x_n^h = \frac{(a\lambda_2 - b)\lambda_1^{n-1} - (a\lambda_1-b)\lambda_2^{n-1}}{\lambda_2 - \lambda_1} $$  Final solution consists of a sum of particular and homogeneous solutions, but that is where I got stuck. What is the way to find the particular solution for the given problem? I'm pretty new to such kind of problems so any details are very much appreciated.  upd:  Based on the technique in @rtybase answer here are my findings:  $$ \begin{align} x_1 &amp;= a \\ x_2 &amp;= b \\ x_3 &amp;= pb - qa + r \end{align} $$  Writing the system for $c_1, c_2, c_3$:  $$ \begin{align} a &amp;= c_1 + c_2 + c_3 \\ b &amp;= c_1\lambda_1 + c_2\lambda_2 + c_3 \\ pb+qa+r &amp;= c_1\lambda_1^2 + c_2\lambda_2^2 + c_3 \end{align} $$  Now solving for the coefficients gives a huge formula. The answer to this problem suggests that:  $$ x_n = \frac{(\lambda_2(a+\gamma) - b -\gamma)\lambda_1^{n-1} - (\lambda_1(a + \gamma) - (b-\gamma))\lambda_2^{n-1}}{\lambda_2 - \lambda_1} - \gamma $$  Where:  $$ \gamma = \frac{r}{p+q-1} $$  Unfortunately I was not able to arrive at exactly the same result, but testing my solution (not posting since it's monstrously big) using SameQ in Mathematica with the given answer shows that they are equivalent. Those transformations are not very obvious to me, so i skipped them since the answer matches the given one (yet the symbolic expressions are different) Prove that $\mathbb{Z}$ is not isomorphic to additive group of any vector space over any field. Vertical alignment in table: m-column, row size - problem in last column Eigenvalues of the rank one matrix $uv^T$ I want to use the get_option() function of wordpress in one of my theme's files, which is not related to WP, it is just located in the same directory of the other theme files. I need this file because of some extra IPN paypal related actions, but I need some values from the options table that exists in WP to be called in this page in order for it to work. I know I can't just use get_option() as this file is overlooked by wordpress. Is there any approach by including some parts of wordpress in my theme to make this functionality only work? Let $1\leq p &lt; \infty$. Suppose that    $\{f_k\} \subset L^p$ (the domain here does not necessarily have to be finite),  $f_k \to f$ almost everywhere, and  $\|f_k\|_{L^p} \to \|f\|_{L^p}$.    Why is it the case that $$\|f_k - f\|_{L^p} \to 0?$$   A statement in the other direction (i.e. $\|f_k - f\|_{L^p} \to 0 \Rightarrow \|f_k\|_{L^p} \to \|f\|_{L^p}$ ) follows pretty easily and is the one that I've seen most of the time. I'm not how to show the result above though. How do I get my arrow keys working in the at> prompt