How to deal with big documents?
Splitting a large document into several files
Link2SD not working completely My Link2SD doesn't seem to be fully working. I noticed this when updating the Facebook application. Google Play prompted me of insufficient storage. I first uninstalled some apps but I got curious so I checked Link2SD's storage info, I got this:   (Click image to enlarge)  As you can see, the internal storage only has mere 70mb left. What's peculiar is, these are the only apps I have NOT linked:   (Click image to enlarge)  I tried moving one linked app (Amazing Alex) to the sd card (normal Android way) and sure enough, the free space on my internal storage got bigger by about an additional 20mb-ish.  Why is this happening? Why isn't Link2SD moving the data to my sdext2? How do I solve it? What amp rating of 24vac transformer for LM317T? I want to know what size transformer for LM317 at full 30 VDC. I know its a 24 VAC center tapped transformer but is 1 A or 5 A transformer best suited for a linear power supply of 1.5-30 VDC?  I will be using a standard LM317 variable power supply circuit with the 2200 uF 50 V smoothing and the 240 ohm drain resistor and potentiometer. I have a homemade oversized aluminum heat-sink that is quite large. I have to do some manual reordering or rows in Excel and cut/paste is too hard to use. I'm looking for something that would enable me to use drag'n'drop or to add some buttons to move-up/down move-top/bottom. Does C# optimize the concatenation of string literals? For instance, does the compiler know to translate  string s = "test " + "this " + "function";   to  string s = "test this function";   and thus avoid the performance hit with the string concatenation? Inner automorphisms form a normal subgroup of $\operatorname{Aut}(G)$ For an arbitrary group $(G,\cdot)$ let $\operatorname{Aut}(G) = \{f: G \to G \mid f \text{ is an isomorphism}\}$ be the set of all automorphisms of the group $G$. We assume that $(\operatorname{Aut}(G),\circ)$ where $\circ$ is composition of mappings is a group.  1) Prove that for arbitrary $a \in G$ there is an automorphism $p_a: G \to G;\quad p_a(x) = a^{-1}xa$.  2) Prove, that $\operatorname{Inn}(G) = \{p_a \mid a \in G\}$ is a normal subgroup of $(\operatorname{Aut}(G),\circ)$. Find all the numbers $n$ such that $\frac{4n-5}{60-12n}$ can't be reduced. Is $$d_1\mid n,d_2\mid n\iff [d_1,d_2]\mid n$$ true ? And if yes, how can I prove it ? I recall that $[d_1,d_2]$ is the least common multiple.  My tries  For the implication : Let $d_1\mid n$ and $d_2\mid n$. Then, $d_1d_2\mid n^2$. By the way, since $d_1,d_2\mid n$, we have that $(d_1,d_2)\mid n$ where $(d_1,d_2)=:\gcd(d_1,d_2)$  and thus $$[d_1,d_2](d_1,d_2)\mid n^2.$$  Question: How can I get $[d_1,d_2]\mid n$ from this?  For the converse, since $d_1,d_2\mid [d_1,d_2]\mid n$, the claim follow. A hidden process, what it is? [root@datacenteronline ~]# ssh root@192.168.1.172 Last login: Wed Apr 17 09:55:45 2013 from 192.168.1.187 [root@localhost ~]# ls /proc/ | grep 2266 [root@localhost ~]# cd /proc/2266 [root@localhost 2266]# ls attr             cpuset   limits      net            root       statm autogroup        cwd      loginuid    numa_maps      sched      status auxv             environ  maps        oom_adj        schedstat  syscall cgroup           exe      mem         oom_score      sessionid  task clear_refs       fd       mountinfo   oom_score_adj  smaps      wchan cmdline          fdinfo   mounts      pagemap        stack coredump_filter  io       mountstats  personality    stat [root@localhost 2266]# ls -al /proc/2266 total 0 dr-xr-xr-x   7 apache apache 0 Apr 17 09:45 . dr-xr-xr-x 266 root   root   0 Apr 17 09:11 .. dr-xr-xr-x   2 apache apache 0 Apr 17 09:45 attr -rw-r--r--   1 root   root   0 Apr 17 09:45 autogroup -r--------   1 root   root   0 Apr 17 09:45 auxv -r--r--r--   1 root   root   0 Apr 17 09:45 cgroup --w-------   1 root   root   0 Apr 17 09:45 clear_refs -r--r--r--   1 root   root   0 Apr 17 09:45 cmdline -rw-r--r--   1 root   root   0 Apr 17 09:45 coredump_filter -r--r--r--   1 root   root   0 Apr 17 09:45 cpuset lrwxrwxrwx   1 root   root   0 Apr 17 09:45 cwd -&gt; / -r--------   1 root   root   0 Apr 17 09:45 environ lrwxrwxrwx   1 root   root   0 Apr 17 09:45 exe -&gt; /usr/local/apache2/bin/httpd dr-x------   2 root   root   0 Apr 17 09:45 fd dr-x------   2 root   root   0 Apr 17 09:45 fdinfo -r--------   1 root   root   0 Apr 17 09:45 io -rw-------   1 root   root   0 Apr 17 09:45 limits -rw-r--r--   1 root   root   0 Apr 17 09:45 loginuid -r--r--r--   1 root   root   0 Apr 17 09:45 maps -rw-------   1 root   root   0 Apr 17 09:45 mem -r--r--r--   1 root   root   0 Apr 17 09:45 mountinfo -r--r--r--   1 root   root   0 Apr 17 09:45 mounts -r--------   1 root   root   0 Apr 17 09:45 mountstats dr-xr-xr-x   6 apache apache 0 Apr 17 09:45 net -r--r--r--   1 root   root   0 Apr 17 09:45 numa_maps -rw-r--r--   1 root   root   0 Apr 17 09:45 oom_adj -r--r--r--   1 root   root   0 Apr 17 09:45 oom_score -rw-r--r--   1 root   root   0 Apr 17 09:45 oom_score_adj -r--r--r--   1 root   root   0 Apr 17 09:45 pagemap -r--r--r--   1 root   root   0 Apr 17 09:45 personality lrwxrwxrwx   1 root   root   0 Apr 17 09:45 root -&gt; / -rw-r--r--   1 root   root   0 Apr 17 09:45 sched -r--r--r--   1 root   root   0 Apr 17 09:45 schedstat -r--r--r--   1 root   root   0 Apr 17 09:45 sessionid -r--r--r--   1 root   root   0 Apr 17 09:45 smaps -r--r--r--   1 root   root   0 Apr 17 09:45 stack -r--r--r--   1 root   root   0 Apr 17 09:45 stat -r--r--r--   1 root   root   0 Apr 17 09:45 statm -r--r--r--   1 root   root   0 Apr 17 09:45 status -r--r--r--   1 root   root   0 Apr 17 09:45 syscall dr-xr-xr-x  29 apache apache 0 Apr 17 09:45 task -r--r--r--   1 root   root   0 Apr 17 09:45 wchan   Cound anyone tell me what it is? Margin of caption different than text body in 2-column table (cas-dc) I have a master's degree in International Studies, and a double major with Computer Science from undergrad.  My transcripts suck.  There's no other way to dress it up.  I have pretty good teaching experience, and my GRE scores are awesome, and I suspect my recommendations are as bland as everyone else's.  Basically, to an admissions committee, I suspect I'm the model of a student who is probably smart enough but didn't work hard enough.  I want to do a Ph.D. in Political Science, but the response from my applications is looking pretty grim.  Am I permanently out of the running, or is there something I can do for the next few years which will help to counterbalance my unfavorable GPA? Is there a gender-neutral pronoun that can replace “his” or “her”? This post has two parts: (a) a question and (b) a proposal.   (a) Often, particularly while writing technical papers or user's manuals, I have come across a situation where I need to say:      A user of this software may not need to use it from his personal computer. He can use it from a phone or even from his tablet.   I have seen many authors use female pronouns (i.e. “she” and “her”), but lately this trend seems to have ebbed somewhat.   I, and (I suspect) many other authors, do not want to use passive voice to avoid this.   Is there a gender-neutral way to describe the same situation?   (b) If there is none, I would like to propose using “ze” (for “he” or “she”) and “zir” (for “his” or “her”, rhyming with “fir”) as gender-neutral pronouns. I want to know how you feel about these words. Performing multiple layer intersection in QGIS? Is acceleration relative in relativity? Suppose a box A is moving relative to a Box B, then by time dilation equation if I take 1 sec passed for an observer in A then for an observer in B will be little longer. Now if I suppose that the box B is moving while A is stationary under the same condition, then by the time dilation equation time passed in B must be shorter than A. How is this issue resolved? In the twin paradox problem my book says that it's due to acceleration, but in my opinion acceleration is relative (please correct me if I'm wrong), but here it is not the case. Proving if $a$ is not a multiple of prime $p$, then an integer $b$ exists such that $p^b - 1$ is a multiple of $a$ I tried many approaches but none of them really worked I treated $p^b-1$ as a Geometric progression but it didn't work and that is about as far as I have been able to go I have no clue how to move forward Flagging summary improvement: filters Node Package Manager got corrupted in some way, now it cannot be installed I just bought a house. Now I'm getting ads in the mail every day or two trying to get me to sign up to pay my mortgage bi-weekly (every two weeks) or weekly instead of monthly. In their words I could cut seven years and thousands of dollars off what I pay in long term. It seems like I would be paying the exact same amount of money, also.  I know "if something sounds too good to be true then probably it is". But I cannot figure out why in this case. What is the catch? Or is this something I should be signing up for ASAP? $X=(-\infty,0]\cup\left\{{1\over n}:n\in\mathbb N\right\}$ with subspace topology Then $X=(-\infty,0]\cup\left\{{1\over n}:n\in\mathbb N\right\}$ with subspace topology. Then   $0$ is an isolated point $(-2,0]$ is an open set $0$ is a limit point of the subset $\left\{{1\over n}:n\in\mathbb N\right\}$ $(-2,0)$ is open set.   $0$ is not an isolated point of $X$ as every nbd of $0$ contains a point of the form $1\over n$ so  $3$ is true and $1$ is false, $2$ is false as $0$ is not interior point, $4$ is true as every point is interior point. Am i right? I'm trying to make a command that creates a book that has many items with enchantments at level 1,000. However, I don't know why it keeps saying:     Data tag parsing failed: Unbalanced quotation:   {ench:[{id:0,lvl:1000}],Unbreakable:1,display:{Name:"Prot   It's supposed to say "Protection Armor", but it only shows "Prot" for some reason. This is the same with all of my other items. Here is the one part of the command that I've showed you:  {ench:[{id:0,lvl:1000}],Unbreakable:1,display:{Name:"Protection Armor"}} Lens upgrade paths (sub $1000) for the EF-S 18-55mm IS kit lens for Canon APS-C cameras