Way to copy/recover data much larger than any storage medium I have? I have a 3 TB LDM Windows partition that was from a Windows 8 install that hibernated and I have since lost the hiberfil.sys or ability to boot into that install (through my own stupid actions, but that's beside the point).   The partition has ~ 1.6 TB of data that I would like to keep and use. The only problem is that I can't figure out a way to mount the partition in readwrite mode, only read-only.   The procedure I used to get it to mount at all was the following:    Installed ldmtool ldmtool create all Attempted mounting with mount /dev/mapper/ldm_vol_JDPHENIX-01-Dg0_Volume1 ~/mnt/hdd/, failed with The disk contains an unclean file system (0, 0). Successfully mounted with -o ro as suggested by the error message.    The question is how do I go about getting the data from this partition to a usable state (I define as mounted in some storage medium as read-write)?   I had considered purchasing sufficient cloud storage somewhere to temporarily hold the data, but that would exceed my bandwidth cap by a factor of 6.   I do consider "purchase an HDD capable of holding the data" as a valid solution, so if that's the ideal way to do this, don't refrain from posting exactly that.   Edit:  I chose to purchase a new hard drive. I'm still interested in others' takes on how to best handle this.
Unable to mount Windows (NTFS) filesystem due to hibernation 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
Problem working fontspec, babel and datetime with cyrillic I have discovered that fontspec with russian babel settings doesn't work with datetime package. I tried to compile such code:  \documentclass[a4paper,11pt]{article} \usepackage[T2A]{fontenc} \usepackage[utf8]{inputenc} \usepackage[main=russian,english]{babel} \usepackage{datetime} \usepackage[cm-default]{fontspec}  \begin{document} \today \end{document}   with a xelatex and got an error: Command \cyri unavailable in encoding EU1.  Is there any way to handle it?  UPDATE: I really bungle with charset in XeLateX. Thanks to egreg. I have removed fontenc and inputenc and used some cyrillic font, so my MWE now looks this way:  \documentclass[a4paper,11pt]{article} \usepackage[main=russian,english]{babel} \usepackage{fontspec} \setromanfont{PT Sans} \usepackage{datetime}  \begin{document} \today \end{document}   and I've got another error, if I used russian as a main language in babel: Undefined control sequence. \\monthnamerussian ...cyrm \cyra \cyrya \or \cyri  \cyryu \cyrn \cyrya \or \c...  Is it still because of XeLaTeX? I just installed Ubuntu 18.04 and one of my first negative impressions is the long animation of flying-in icons when opening the app menu.  Can I speed this up or disable it? Convergence of sequence of real numbers and (sub)subsequence Let $(x_n)_{n\in \mathbb{N}}$ be a sequence of real numbers. A well known result is:     The sequence $(x_n)_{n\in \mathbb{N}}$ converges to $a\in \mathbb{R}$ if and only if every subsequence $(x_{n_k})_{k\in \mathbb{N}}$ converges to $a\in \mathbb{R}$.   Now, I'm working on an exercise which essentialy asks to prove the following:     The sequence $(x_n)_{n\in \mathbb{N}}$ converges to $a\in \mathbb{R}$ if and only if for every subsequence $(x_{n_k})_{k\in \mathbb{N}}$ there is a (sub)subsequence $(x_{n_{k_j}})_{j\in \mathbb{N}}$ which converges to $a$.   Now, one direction is trivial. If in fact $(x_n)_{n\in \mathbb{N}}$ converges to $a$, then by the result I've mentioned, every subsequence of $(x_{n})_{n\in \mathbb{N}}$ converges to $a$. Let then $(x_{n_k})_{k\in \mathbb{N}}$ be an arbitrary subsequence. In that case, we know that it is a subsequence of itself, and hence we've found a (sub)subsequence which converges to $a$.  The other way around seems quite complicated for me. The reason is as follows: I must assume that every subsequence $(x_{n_k})_{k\in \mathbb{N}}$ has a (sub)subsequence which converges to $a$ and the proof that the original one converges to $a$.  My problem is exactly that "a". If it had all (sub)subsequences converging to $a$, then by the result i've mentionted, the subsequence $(x_{n_k})_{k\in \mathbb{N}}$ would converge to $a$. In that case, we would have every subsequence converging to $a$ and the result would follow.  My idea to prove the claim was then:  First remember that a subsequence is the restriction of the original one $x: \mathbb{N}\to \mathbb{R}$ to an infinite subset $\mathbb{N}'\subset \mathbb{N}$. In that case a (sub)subsequence is the restriction of $\tilde{x} = x|\mathbb{N}'$ to an infinite subset $\mathbb{N}''\subset \mathbb{N}$. But since $\tilde{x}$ is the restriction of $x$ to $\mathbb{N}'$ and since $\mathbb{N}''\subset \mathbb{N}'$, the restriction of $\tilde{x}$ to $\mathbb{N}''$ is itself the restriction of $x$ to $\mathbb{N}''$.  In other words, every (sub)subsequence can be viewed as a subsequence of the original one. Considering this, by hypothesis every subsequence has a (sub)subsequence which converges to $a$. But by this argument, this means that we can replace every subsequence with a convergent one. And then we can use the result I stated.  Is my idea correct? Is this really the way to prove the claim? My only doubt is that I need every subsequence converging to $a$ to use the result. In this case I can't see how I can argue that this implies every subsequence converges to $a$.  How can I finish this proof? Razr Maxx HD, How to wipe data with broken screen My screen is totally destroyed, it's black and unresponsive. The phone turns on just fine, though. I just got my new phone and I have to send this one back now.  I want to wipe the phone before I send it back, but I'm not sure how. I don't care too much about sending back a rooted phone, it seems Asurion doesn't really care about that from what I've read, but I don't want my personal data on the phone when I send it in.  What are my options to wipe the phone without a screen? I've already read a lot of threads on other forums and here on the subject, but everyone seems to say to wipe through ADB shell. Well, I can see the phone in ADB, but I am unable to enter SU through ADB shell. I assume it's because the screen is locked, and I have no way to unlock it. Others have also said to wipe through fastboot in ADB, but I am seeing conflicting recommendations and I'm not sure how to proceed. I'm not that proficient with ABD, so I want to make sure I don't mess this up.  Any advice would be greatly appreciated. What is the order of $(\mathbb{Z} \oplus \mathbb{Z})/ \langle (2,2) \rangle$ and is it cyclic? Evidently, $(\mathbb{Z} \oplus \mathbb{Z})/ \langle (2,2) \rangle$ has order $4$, but I think it's infinite.   The four cosets are listed as $(0,0) +  \langle (2,2) \rangle$, $(0,1) +  \langle (2,2) \rangle$, $(1,0)+  \langle (2,2) \rangle$ and $(1,1) +  \langle (2,2) \rangle$. However, $(2,0)$ doesn't appear to be in any of these cosets. Maybe the answer I'm being told is wrong. Reading Chapter 2 of Koblitz's Introduction to Elliptic Curves and Modular Forms, I got stuck on the following question. I would like to proceed my reading, so I would appreciate any hint to this. I have no background in Algebraic Number Theory, but if someone explains in that language, I would like to see it and learn it as much as I can at this moment. References will also be appreciated!  Let $q$ be a power of prime $p$ such that $q \equiv 1 \mod 4$ and $p \nmid 2n$.  Question. Let $\chi_{4} : \mathbb{F}_{q}^{*} \rightarrow S^{1}$ be the character of order $4$, show that $\chi_{4}(-4) = 1$.  The hint in the book says we may show that $\chi_{4}(4) = \chi_{4}(-1) = 1$ for $q \equiv 1 \mod 8$ and $\chi_{4}(4) = \chi_{4}(-1) = -1$ for $q \equiv 5 \mod 8$.  If $q \equiv 1 \mod 8$, then $\chi_{4}(4) = \chi_{4}(2)^{2} = \chi_{2}(2) = \pm 1$, where $\chi_{j}$ denotes the character of order $j$. So I think $2$ must be quadratic residue in this case, but I cannot figure out why. How to vertically center content with variable height within a div? See all my questions across all Stack Exchange sites? How to transfer minecraft pocket edition world between iPads? My daughter has built a minecraft world on our iPad. As of Christmas 2013 she has an iPad mini of her own. Is there any way to transfer her world from the old machine?   Even better...is there any way to synchronise the 2 machines? Creating your own Tinyurl style uid I added two planes in Cycles with Image Texture in png with some transparency. I covered one by the other but transparency doesn't work, I mean it is impossible to see the one which is under despite transparency in the one which is above. What could be the problem? How do I call one constructor from another in Java? Is it possible to call a constructor from another (within the same class, not from a subclass)? If yes how? And what could be the best way to call another constructor (if there are several ways to do it)? INC instruction vs ADD 1: Does it matter? I want to generate some formatted output of data retrieved from an MS-Access database and stored in a DataTable object/variable, myDataTable. However, some of the fields in myDataTable cotain dbNull data. So, the following VB.net code snippet will give errors if the value of any of the fields lastname, intials, or sID is dbNull.     dim myDataTable as DataTable    dim tmpStr as String    dim sID as Integer = 1     ...    myDataTable = myTableAdapter.GetData() ' Reads the data from MS-Access table    ...     For Each myItem As DataRow In myDataTable.Rows      tmpStr = nameItem("lastname") + " " + nameItem("initials")      If myItem("sID")=sID Then         ' Do something     End If      ' print tmpStr     Next   So, how do i get the above code to work when the fields may contain dbNull without having to check each time if the data is dbNull as in ? I am not talking about miracles, religious revelation, or artistic expression, but something more mundane. There is a lot of "empirical" evidence that the Riemann hypothesis is true, the scare quotes indicate that the source of the evidence is "mathematical intuition". In psychology there are mental states that no one sees, touches, hears, smells or tastes, qualia with their perceptual fullness that can not be conceptualized or directly communicated, and abilities/skills "know how" with the same problem. In linguistics Kripke's theory of reference relies on "modal intuitions" to decide the truth of counterfactuals. But an empirical counterfactual is an oxymoron, especially when it is embedded into an entire "possible world".  Freudian psychoanalysis and Husserlian phenomenology are attempts to deal with some of them systematically, but they are traditionally confined to the fringe of science at best. The mainstream approach is empirical second hand, but behaviorism in psychology and linguistics, and nominalism in mathematics, were not very productive.   According to the naturalized epistemology there is no a priori "first philosophy" of science, methodology is subject to the "tribunal of experience" and revision, just as the science itself. Should it apply to non-empirical experience? Sense empiricism has served science well for centuries, and was fully embraced by Quine.  takes him to task for it:     "Cognitive science is an empirical science working to unearth the mechanisms through which natural language constitutes itself. That account has had to recognize the indispensability of mental states, of beliefs, if it is ever to become adequate to the problem... There is still too much "first philosophy" in Quine. We must rescue naturalized epistemology from its own founder".    Note the use of "empirical" together with "mental states".  Questions: Does naturalized epistemology dictate that natural science should relax sense empiricism, and approach non-empirical phenomena partly first hand? If so, how can the scientific method be adapted to introspective/intuitive phenomena that are not readily reproducible, manipulable, measurable, and/or publicly accessible? What would play the selective role of empirical testing? Can there be non-empirical (more likely, not entirely empirical) natural science? For some reasons my brush stroke suddenly looks like this:     As the picture showed, the edges are jagged and pixelated. It doesn't happen before and it's just one of the built-in inking brush.  I know there are a lot of similar questions here but please don't mark this as duplicate. I double checked all the thing the other answers suggested: It's brush tool, not pencil, and my mode of brush and layer is Normal, not Dissolve. It's pixelated even if I draw with mouse so it's not tablet driver issue. I disabled GPU render but nothing changed. How do I fix this? How to search for only folders in Windows 7 instead of folders AND files I've had some issues with the new search function in Windows 7. The Search in Windows XP was packed with so many more options. The only option I can access now are Date Modified and Size.  Any pointers to how to get more options in the Windows 7 Search, or links to external programs that can make my life easier? Is it common for native speakers to put a question mark at the end of declarative sentence? Generating a unique machine id Determining the default Method used in optimization and root-finding algorithms