I'm planning on setting a dual-boot machine with Windows (8.1) and Debian sitting on different partitions of an SSD.  The problem here is my 1.5TB storage drive. I'm planning to use Windows and Debian equally, so I need to format this drive in a way that it works as good as possible on both systems. There's also an additional requirement: Windows should be able to flawlessly work with user folders moved to the storage drive.  So far I'm only looking to the following options:  1) FAT32 is not actually an option, but worth mentioning for others to see, if your storage partition is 32GB or smaller than this is perfect;  2) NTFS. Both Windows and Linux can work with this filesystem, but Linux will probably show very high CPU usage while working with NTFS partitions;  3) Ext4 seems to be the best option, but I can't find any info about how well does Windows handle it. Ext2sd, as well as Paragon software, don't have any information on performance, I'm afraid of it being worse than NTFS in Linux. Also I have no idea how well does it combine with Windows user folders.  Are there any other options I've overlooked? Perhaps, NTFS isn't that bad on a fairly powerful machine? Is EXT4 perfect for this scenario, or it's going to a huge pain to make it work decently on Windows?
What is the best filesystem to use cross-platform (Linux, Windows, OS X) which supports disk sizes of at least 2TB and file sizes >4GB?  I'm planning to use it on a USB drive on different computers.  Are there any filesystems that can be used on all the named OSes without installing additional drivers?
How do I disable administrator prompt in Windows 8? Let $f:\mathbb{C} \rightarrow \mathbb{C}$ be a entire function. Suppose that there are $M$, $r&gt;0$ and $n\in \mathbb{N}$ such that $\left|f(z)\right|&lt;M\left|z\right|^n$ for all $z \in \mathbb{C}$ with $\left|z\right|\geq r$.  Show that $f$  polynomial of degree at most $n$.  Remark: I tried to follow the proof of Liuville's Theorem but I have complications with the condition  $\left|z\right|\geq r$.. So I wish to create and object and set it's shading to 'smooth' using python. It seems simple enough but after trying every method I could find on the internet none of them worked for me. Here's a short example script where the object needs to have smooth shading:  import bpy from mathutils import Vector  verts = [(0,0,0),(0,5,0),(0.25,5,0),(0.25,0,0),(0,0,5),(0,5,5),(0.25,5,5),(0.25,0,5)] faces = [(0,1,2,3), (4,5,6,7), (0,4,5,1), (1,5,6,2), (2,6,7,3), (3,7,4,0)]  grat1mesh = bpy.data.meshes.new("grat1") grat1obj = bpy.data.objects.new("grat1", grat1mesh) grat1obj.location = (5, -5, 0) bpy.context.scene.objects.link(grat1obj) grat1mesh.from_pydata(verts,[],faces) grat1mesh.update(calc_edges=True)  grat2obj = grat1obj.copy() grat2obj.data = grat1mesh.copy() bpy.context.scene.objects.link(grat2obj) grat2obj.location += Vector((-0.125, 1.25, 1.25)) grat2obj.scale = (2, 0.5, 0.5)  bm = grat1obj.modifiers.new("Chop", 'BOOLEAN') bm.object = grat2obj bm.operation = 'DIFFERENCE' bpy.context.scene.objects.active = grat1obj bpy.ops.object.modifier_apply(modifier=bm.name) bpy.context.scene.objects.unlink(grat2obj)   I found this online and tried to place it at the end of the script:  smoothings = [] smoothings.append(face.use_smooth) me_ob.faces.foreach_set("use_smooth", smoothings)   However this just returned an error on the second line, perhaps as it was from an older website. Obviously using a simple bpy.ops.object.shade_smooth() didn't work and I'm kind of stumped as of what to do here! Find four groups of order 20 not isomorphic to each other. "You're too clever a man" How can I uninstall software? Seeing there are various ways to install on Ubuntu. What are the various ways to uninstall items?  Which ways always work? How can I be sure something was uninstalled? How can I get more of this macro photo in focus? I want to make a full focus on the body, for example: I need to have a clear focus on the each balls in the photo. I used just single point focus.    In this picture I used:   shutter speed: 8 aperture: F/4 ISO: 200 2 flashes, one in the right and one on the top of project camera: nikon d300s lens : 105mm micro 2.8   Thanks Does low disk space affect SSD performance? I was wondering if having less than 5-10GB of free space on an SSD would affect performance. Is it specific to SSD or is it more of an operating system aspect?  For example, on an Intel X-25 G2 that has TRIM support (on Windows 7). php - insert a variable in an echo string Sometimes I hear people say something like the example below. Is it correct to use the word since in this manner?     Mosquitoes are surviving on earth since millions of years. What is the exact reason that normal matter can not exist within an event horizon?  I can understand how a super-dense object like a neutron star could accrete mass until its physical radius is less than its Schwarzschild radius and an event horizon forms around it.   But why can't the neutron star remain inside the event horizon as it was before the event horizon formed? Aside from the escape velocity at the surface reaching $c$, what actually changed?  Why must all matter within an event horizon undergo complete physical collapse to a point? Name of the book/series based on magicians who tap into computer grid? 16.04 new installation gives grub-efi-amd64-signed failed installation /target/ ubuntu 16.04 at the end Does anyone have an intuitive explanation (no formulas, just words! :D) about the "$n-1$" instead of "$n$" in the unbiased variance estimator $$S_n^2 = \dfrac{\sum\limits_{i = 1}^n \left(X_i-\bar{X}\right)^2}{n-1}?$$ Hi I have to proof that for $\Omega$ a nested family of odd subsets of $V$ with $V$ finite, we have that $|\Omega|\leq\frac{3}{2}|V|$. I can prove that for certain constructions of $\Omega$, it is satisfies $|\Omega|\leq \frac{3}{2} |V|$, the problem I encounter is that I have to proof that my construction of $\Omega$ is optimal. (Since I have to prove that this holds for every family of odd subsets) Can anyone give me a hint on how to proof that every $\Omega$ satisfies this equation.    $\Omega$ is nested if for all $A,B\in\Omega$ either $A\subseteq B$, $B\subseteq A$, or $A\cap B=\varnothing$; a set is odd if its cardinality is odd. How to Expand , Resize "extended partition"? How far can/should one press philosophical doubt? Should we keep on questioning until nothing is left to question or is there a point on which we need to stand (which we often tend to do)? Descartes used 'I think' as this fixed point where the skepticism abates, there may be others. But what is a rational way to find one, if any? How is this question addressed in modern philosophy? Java's Virtual Machine and CLR As a sort of follow up to the question called , what is the (major) differences or similarity in how the Java Virtual Machine works versus how the .NET Framework Common Language Runtime (CLR) works?  Also, is the .NET framework CLR a "virtual machine" or does it not have the attributes of a virtual machine? What are Harry, Ginny, Ron and Hermione's professions? After the end of the Second Wizarding War Harry Potter later married Ginny Weasley, and the couple had three children of their own: two sons James Sirius, Albus Severus, and one daughter Lily Luna. What are Harry and Ginny's professions? I heard that Harry became an Auror, but what about Ginny, Ron, and Hermione? In .NET, which loop runs faster, 'for' or 'foreach'? In C#/VB.NET/.NET, which loop runs faster, for or foreach?  Ever since I read that a for loop works faster than a foreach loop a  I assumed it stood true for all collections, generic collections, all arrays, etc.  I scoured Google and found a few articles, but most of them are inconclusive (read comments on the articles) and open ended.  What would be ideal is to have each scenario listed and the best solution for the same.  For example (just an example of how it should be):   for iterating an array of 1000+ strings - for is better than foreach for iterating over IList (non generic) strings - foreach is better than for   A few references found on the web for the same:               [Edit]  Apart from the readability aspect of it, I am really interested in facts and figures. There are applications where the last mile of performance optimization squeezed do matter.