I use a Nikon d750, shooting in both RAW and JPEG. My pictures look fine on my camera lcd screedn, but when I download to my computer, about 5 to 10% of my files are damaged. I have used both Adobe Lightroom and Branch to download pictures. For example, a photo that looks fine in Branch is damaged when I call it up in Adobe Camera RAW or Photoshop to edit it. How can I fix damaged files? How can I prevent the damage in the first place?
I had some NEF files in a folder that I didn't do anything with. When importing them in Lightroom, no previews and a "file unsupported or damaged message" So I tried with Nikons ViewNX, nothing. Even not in DxO or PhotoMechanic.  I had a look with EXIFTool and the corrupt file prints me only this:  ExifTool Version Number         : 8.39 File Name                       : _DSC5559.NEF Directory                       : /Users/tunafish/Desktop File Size                       : 12 MB File Modification Date/Time     : 2010:11:29 12:46:56+01:00 File Permissions                : rwxrwxrwx Error                           : File format error   I saw another question on photo.stack  and tried to copy over the makernotes from a good file (_DSC5556.NEF) with  exiftool -tagsfromfile _DSC5556.NEF -makernotes _DSC5559.NEF   but EXIFTool gives me this error  Error: Not a valid TIFF - _DSC5559.NEF 0 image files updated 1 files weren't updated due to errors   I have uploaded 2 NEF's, with _DSC5559.NEF being the corrupt one here:
I'm using a 5 V / 2 A voltage regulator () without a heatsink. I'm testing the circuit with a microcontroller (PIC18FXXXX), a few LEDs and a 1 mA piezzo buzzer. The input voltage is aprox. 24 VDC. After running for a minute, the voltage regulator starts to overheat, meaning it burns my finger if I keep it there for more than a second. Within a few minutes it starts to smell like it's burnt. Is this a normal behavior for this regulator? What could cause it to heat that much?    Other components used in this circuit:  L1:   R2:   F1: I'm taking Calculus II next semester so I don't have all the tools from it to back me up but something came up in a discussion this evening that asked me to prove that the following sequence converges. As I'm new to formal math I'm hoping someone can verify my proof, especially step $6$. I must prove that $$\lim_{n\to\infty}P_n=b$$ where $$P_{n+1} = P_n + \frac{b-P_n}{2}$$ $$P_0 = a$$ and $a,b \in \mathbb{R}$ such that $a&gt;b$ My proof goes as follows:   We must prove that $$\lim_{n\to\infty}P_n=b$$  That is, $\forall\epsilon&gt;0$ there exists a $\delta$ such that there exists an $n$ satisfying $$n&gt;\delta \iff b-P_n&lt;\epsilon$$  First, let us prove that $P_n$ is bounded by $b$ by contradiction. Let us choose an $i$ such that $P_i &lt; b$ and $P_{i+1}&gt;b$. Then we have $P_{i+1} = P_i + \Delta P$ where $\Delta P &gt; b-P_i$. but this is impossible because by the definition of the recurrence $\Delta P = \frac{b-P_i}{2} &lt; b-P_i$. Therefore, $P_i$ is bounded from above by $b$.  Additionally, it is trivial to show that $P_{i+1} &gt; P_i$.  With this in mind, choose an arbitrary $\epsilon$. We need to show that there exists an $n$ such that $P_n &gt; b-\epsilon$. Assume the contrary, that $P_n$ is bounded by $\epsilon$.  Using a similar argument to what which was used before, assume $P_n$ is bounded by $\epsilon$ and then there exists a $P_i$ such that $P_{i+1}\not &gt; P_i$. But this results in a contradiction with (4)  Therefore, $P_n$ is not bounded by $\epsilon$ and we have proved what we want to prove. We have the matrix: $$\left[\begin{array}{rrr} 0.8&amp;0&amp;0\\ 0&amp;1.2&amp;0\\ 0&amp;0&amp;1\\\end{array}\right]$$ Finding the eigenvalues and eigenvectors are easy. But finding ${\bf M}^n$ when $n \rightarrow \infty$ is the hard part. Any suggestions? addtocontents not working with certain other packages This is a follow up question on   How do I change the toc dept mid document while using packages (in this case only mathtools).  An example:  \documentclass[a4paper,10pt,oneside]{book}  \usepackage{mathtools}  \begin{document}   \frontmatter             \chapter{hello}  \section{hello}  \subsection{hello}  \subsubsection{hello}   \setcounter{tocdepth}{3}  \tableofcontents   \mainmatter   \chapter{hello}  \section{hello}  \subsection{hello}  \subsubsection{hello}   \chapter{hello}  \section{hello}  \subsection{hello}  \subsubsection{hello}   \appendix   \addtocontents{toc}{\setcounter{tocdepth}{0}}   \chapter{hello}  \section{hello}  \subsection{hello}  \subsubsection{hello}   \chapter{hello}  \section{hello}  \subsection{hello}  \subsubsection{hello}  \end{document}   This example generates an error and very strangely puts an exclamation mark in the ToC as you can see here   however when I comment out the \usepackage{mathtools} it suddenly works again or replacing it with a different package such as \usepackage[T1]{fontenc} also generates no errors.  But this is not limited to just this specific package, certain other packages also introduce the same behavior (I just took this package to keep the example small). Equivalent conditions for a preabelian category to be abelian Let's fix some terminology first. A category $\mathcal{C}$ is preabelian if:  1) $Hom_{\mathcal{C}}(A,B)$ is an abelian group for every $A,B$ such that composition is biadditive,  2) $\mathcal{C}$ has a zero object,  3) $\mathcal{C}$ has binary products,  4) $\mathcal{C}$ has kernels and cokernels.  A category $\mathcal{C}$ is abelian if it is preabelian and satisfies:  5) every monomorphism is a kernel and every epimorphism is a cokernel.  Define the coimage of a map to be the cokernel of its kernel, and the image to be the kernel of its cokernel. We have the following commutative diagram:    where $\overline{f}$ is the only existing map (because of universality of kernel and cokernel).  I'm having trouble proving the following:     A preabelian category $\mathcal{C}$ is abelian iff $\overline{f}$ is an isomorphism.   The converse is easily shown, I'm having trouble proving $\Rightarrow$... Is it time for Stack Exchange, Inc and the community to legally separate amicably? Union of a finite set and a countably infinite set is countably infinite System.ListException: Before Insert or Upsert list must not have two identically equal elements - Deep Dive I had the following exception thrown at me when trying to process more than one selected records via a custom button in the list view.    Class Code  global class MerchandiseInventoryClass {      webservice static void ConverttoInventory(String[] merchandise_id)    {        //Convert Merchandise collection into Inventory Collection...         Merchandise__c[] merchandise_collection = [SELECT ID,Author__c,Book_Title__c,Edition__c,Publisher__c,Total_Merchandise_QtyTotal_Qty__c,Status__c FROM Merchandise__c WHERE ID = :merchandise_id];          Inventory__c i = new Inventory__c(); //Line 1        List&lt;Inventory__c&gt; newInventory = new List&lt;Inventory__c&gt;();        for(Merchandise__c m : merchandise_collection )        {            if(m.Status__c !='Fully Converted')            {            i.Author__c = m.Author__c ;            i.Book_Title__c = m.Book_Title__c;            i.Edition__c = m.Edition__c;            i.Publisher__c = m.Publisher__c;            i.Qty_Available__c = m.Total_Merchandise_QtyTotal_Qty__c;            i.Merchandise__c = m.Id;            m.Uninventoried_Qty__c = 0;            m.Status__c = 'Fully Converted';            newInventory.add(i);            }        }        insert newInventory;        update merchandise_collection;    }  }   By moving the Line 1 to within the for loop solved the issue for me.  Thanks to this post (refer the Best Answer in that post)    What puzzles me is that WHY i have to instantiate "i" for every iteration within the loop.  Why the list collection ("newInventory") is complaining that are duplicate elements and why should it even confuse in the first place when I am performing an "insert" even ? How can an int be cast to an enum in C#? GNOME 2 allows one to either save the session automatically or manually (i.e. save the session as it looks right now). This is a nice feature because it restores the various desktop states between logins (and system restarts):   which apps were open where (physically) on the desktop were they open what specific window sizes were these apps set to   Looking around, I can't find the feature in GNOME 3? Did I not look hard enough? How can I identify what application is using a given file? I'm trying to delete some folder but this error is preventing from doing it:     Cannot delete [FileName]: It is being used by another person or program.      Close any programs that might be using the file and try again.   How can I identify what application is using the file?   I want to end the application using a Task Manager, but I didn't know what application is using it.  The folder is not shared and my user account is an administrator. So, I know that there is a race in Lord of the Rings of Peredhil  (half elf). Also, in the Hobbit (film trilogy, not book), there is a romance between a dwarf and an elf.  My question is, how do man/elf or dwarf/elf offspring work? Can they not be born? Are they born infertile because they are from parents of two different species? Are elves, dwarves, and men only different "races" of one single primordial species, and can thus reproduce any number of ways? To my knowledge, this isn't addressed in the books or films. I remember coming across this fact a while ago in a pdf somewhere, but I haven't been able to find it again. Can someone show me how to prove it? I would appreciate easier proofs.  EDIT: I'm very sorry, I forgot to actually state it.  Prove that $-1$ is not a quadratic residue modulo primes of the form $4k+3$.  Thanks! Normed vector spaces over finite fields Normed vector spaces are typically defined over the reals or complex numbers.  Is there any "standard," well-behaved construction that generalizes this to a vector space over a finite field, such as $\Bbb F_2$?  I'm looking for something kind of like the class of $\ell_p$ norms, except designed with finite fields in mind.  Ideally, something that has deep fundamental properties making it well-behaved in the same way that the Euclidean norm is. How can I find out which process is locking a file or folder in Windows?  For instance, when trying to delete a folder, Windows reports this:     The action can't be completed because the folder is open in another program   Happens the same with a file, but how do I find out what program or application is currently using it and preventing me from deleting the file or folder? I know there must be something unmathematical in the following but I don't know where it is: \begin{align} \sqrt{-1} &amp;= i \\\\\ \frac1{\sqrt{-1}} &amp;= \frac1i \\\\  \frac{\sqrt1}{\sqrt{-1}} &amp;= \frac1i \\\\  \sqrt{\frac1{-1}} &amp;= \frac1i \\\\  \sqrt{\frac{-1}1} &amp;= \frac1i \\\\  \sqrt{-1} &amp;= \frac1i \\\\  i &amp;= \frac1i \\\\  i^2 &amp;= 1 \\\\  -1 &amp;= 1 \quad !!? \end{align} Asking distant cousins for DNA? In my family we have a DNA contradiction – two cousins (at about the 4th cousin level) took a Y-DNA test, but did not match and had two completely different haplogroups.   Since then, I have traced living cousins with the same surname – the only ones left living that I am aware of – and I would love to pay to have them tested to see if we can figure out where the non-paternity event (NPE) or other event happened (i.e. this new cousin could help us determine which line the NPE occurred in depending on which cousin he matches).   Does anyone have a sample letter, or know the best way to go about asking a distant cousin for DNA?   I have their address and am planning to write a letter, but I can't imagine receiving such a letter, so I am not quite sure how to ask without scaring them off. Generating a unique machine id static variables in an inlined function I have a function that is declared and defined in a header file. This is a problem all by itself. When that function is not inlined, every translation unit that uses that header gets a copy of the function, and when they are linked together there are duplicated. I "fixed" that by making the function inline, but I'm afraid that this is a fragile solution because as far as I know, the compiler doesn't guarantee inlining, even when you specify the "inline" keyword. If this is not true, please correct me.  Anyways, the real question is, what happens to static variables inside this function? How many copies do I end up with? Why is my ASCII art all wonky? Nothing looks right in the ASCII art.  It looks wrong and nothing is proportional, how do I fix this? I have tried fiddling with my font size, but nothing still looks right!