I have a method in java which returns the updated lines of a flat file as a "String". I  am receiving the String as a bunch of lines, what i want to do is to separate the String line by line. How can i do that in java?????
I'm trying to split text in a JTextArea using a regex to split the String by \n However, this does not work and I also tried by \r\n|\r|n and many other combination of regexes. Code:  public void insertUpdate(DocumentEvent e) {     String split[], docStr = null;     Document textAreaDoc = (Document)e.getDocument();      try {         docStr = textAreaDoc.getText(textAreaDoc.getStartPosition().getOffset(), textAreaDoc.getEndPosition().getOffset());     } catch (BadLocationException e1) {         // TODO Auto-generated catch block         e1.printStackTrace();     }      split = docStr.split("\\n"); }
Is there a limit to a total number of months a holder of UK multiple entry visitor visa can spend in UK per calendar year? A relative of mine has received a multiple-entry UK visa for 2 years. Is there a particular limit on how many months in total per year she can stay in UK? The way I understand the current rule is that such visitors can enter UK as many times as they want as long as they do not stay for longer than 6 months per single visit. However, does this mean that if she stayed with us for 5 months and went back home for 1-2 months, she could come and stay for another 5 months? I heard that it is advisable to spend only 180 day per calendar year in UK and not more, but I could not find that rule in any official UK Home Office documents. Thanks in advance for any info about this. Why is this function continuous, unlike the Dirichlet function? Layers with same coordinate system should align/overlap in ArcMap but do not? I put 4 different layers into my ArcMap document, but only one of them will show up on the map! I should be seeing the other 3 layers as well. When I do a Zoom to layer, I can see one layer, but I cannot figure out how to make the other 3 show up at once on top of each other.  Before I opened ArcMap, I used ArcCatalog where I right-clicked 3/4 of the shapefiles and  clicked Properties &rarr; Coordinate system &rarr; Import and then clicked on my Trees layer, which has the coordinate system I want the other 3 to have. But when I opened ArcMap the 4 layers did not overlap, nor could I move them above or below each other. I'm running Windows 7. It seems that svchost is eating up a lot of memory.   The user name for the particular svchost instance is "Network Service". The description is "Host Process for Windows Services".   Sometimes it eats up 50% of the CPU usage. Other times, it's just under 5%. I can't figure out when it's 50% and when it's not. But it fluctuates often -- even when I've just booted up and no programs were started.  How do I diagnose this? In chapter 2 section 7 (pg 151) of Hartshorne's algebraic geometry there is an example given that talks about automorphisms of $\mathbb{P}_k^n$. In that example Hartshorne states that $\mathcal{O}(-1)$ has no global sections. However, we know that $\mathcal{O}(1)$ is generated by global sections. This is stated at the first of the section that if $\mathbb{P}_k^n = Proj k[x_0,...,x_n]$ then the $x_0,...,x_n$ give rise to global sections $x_0,...,x_n\in\Gamma(\mathbb{P}_k^n,\mathcal{O}(1))$.  I guess I don't understand this twisted structure sheaf very well, or to be honest I don't think I understand structure sheaves in general as well as I would like. The twisting part seems simple at first- you shift the grading of Proj over and then take the structure sheaf.  Admittedly I don't feel comfortable using the structure sheaf other than using the basic facts about it that Hartshorne gives when it is introduced. If anyone could give some insight as to what's going on here or how I might be able to understand this better it would be much appreciated. Thanks. Is it ok to say 'sorry' where you otherwise would use 'excuse me'?  Example: "Sorry, but could you show me the way to the next train station?" I have a doubt on something. I have a theorem that says that if $R$ is a ring, then $R/I$ is a domain iff $I$ is prime. Since $X^2-1$ is note prime, $\mathbb Z[X]/(X^2-1)$ is not a domain. But, $X^2-1=(X-1)(X+1)$, and since $X-1$ and $X+1$ are prime in $\mathbb Z[X]$, there are coprime, and thus, by the chinese remainder $$\mathbb Z[X]/(X^2-1)\cong \mathbb Z[X]/(X-1)\times \mathbb Z[X]/(X+1),$$ since $\mathbb Z[X]/(X-1)\times \mathbb Z[X]/(X+1)$ is a domain, then so is $\mathbb Z[X/(X^2-1)$. What is the mistakes here ? Substitute for onions and garlic I love the taste of onions and garlic and it seems lots of other people do too.  But they upset my stomach so much that I can't really cook with them.  What can I use in their place to give my food a similar flavour? A priori power analysis for generalized linear mixed-effects model Let's say I have a data set (with a binary DV) which I used a generalized linear mixed-effects model on. I am currently trying to run a simulation-based power analysis to determine the sample size I should try to collect for a replication attempt.   I know about the  function for fitted lme4 model objects, which will create simulated responses that follow the size and structure of the actual dataset.  My question is, how can I use this fitted model object to run an a-priori power analysis for my replication?. In other words, is there an easy way to extract the necessary information from the simulate function, vary the sample size, then to simulate responses?  EDIT:  Here is a simple example with ten subjects that should give me a good starting place. The data here are totally fake so the effects are not close to what I have in the pilot data.  The two variables of interest are age in months (between subjects) and whether the stimulus is "similar" or "dissimilar" (within subjects). Each individual is exposed to three items within each similarity group, for a total of six binary responses for each subject. As seen in the model, I am interested in a possible interaction between age and similarity and include a random slope of similarity to do this.   Let me know if I need to modify anything/provide more information to make things easier.   set.seed(28)  fakeData &lt;- data.frame(ID = rep(1:10, each = 6),                        months = rep(round(runif(10, min = 60, max = 80)), each = 18),                        similarity = rep(c("Sim", "Dissim"), each = 3),                        response = sample(c(0, 1), 60, replace = TRUE))  fakeModel &lt;- glmer(response ~ months * similarity + (similarity | ID), family = binomial, data = fakeData) summary(fakeModel) How can I install Sun/Oracle's proprietary Java JDK 6/7/8 or JRE? Let $y_n$ be a sequence such that  $\lim_{n\to \infty} y_n= y$ then prove that     $ \lim \dfrac{y_1+y_2+...+y_n}{n}= y$   My try:  As  $\lim_{n\to \infty} y_n= y$ then given $\epsilon&gt;0$ there exists $N$ such that $\forall n\ge N ;||y_n-y||&lt;\epsilon $.  Now $||\dfrac{y_1+y_2+...+y_n}{n}-y||\le n^{-1}\{||y_1-y||+||y_2-y||+...+||y_n-y||\}$  How to make this limit tend to zero? This is an exam question I was practising. I have the general understanding of Linear programming, but how would you go about finding the Decision Variables, Objective function and Constraints for this?  My Opinions: Decision variables: $M_1$- # of Model $1$ to be produced $M_2$ and $M_3$(similar definition as $M_1$)  Objective function: I'd Multiple the Cost to make in house by cost to buy from subtractor  to get Minimise: $3900M_1+7500M_2+27300M_3$  Constraints: $3M_1+1.5M_2+2M_3\ge0$  $1.25M_1+2.5M_2+0.75M_3\ge8500$  $M_1,M_2,M_3\ge 5500$  No idea where number order would go? Do I use it in the Constraints and multiply by the Hours?  Now, am I on the right track? How can I add "page # of ##" on my document? I want to add a footer to my document displaying the current number out of total number of pages. How do I do that? How can I install Whatsapp web app on Ubuntu? I found a similar question , but here I am asking for the WhatsApp desktop webapp so that I can directly access the application without opening a browser. Determining a matrix from its characteristic polynomial How to change language of a specific application? Pixelated wallpaper/background I installed Ubuntu 14.04 on my Lenovo IdeaPad Y510P today. Everything worked fine, but after installing my graphics card driver the background became pixelated (Nvidia GeForce GT755m). I downloaded the driver through Additional Drivers and selected Version 331.113 (Proprietary, tested). It was using Nouveau before.  When I apply Nouveau it becomes clean again, but it is much weaker when I open games, it gives me very low FPS even in Counter-Strike. With Nvidia driver FPS and everything else seems fine, except things look pixelated and when I minimize windows and maximize again, the window goes black.    I attempted to solve the problem myself by removing the old Nvidia driver and manually installing the latest version, but it did not help.  Please let me know if you need more details. Is there a way to achieve the equivalent of a  in javascript regular expressions?  I need to match a string that does not start with a specific set of characters.  It seems I am unable to find a regex that does this without failing if the matched part is found at the beginning of the string.  Negative lookbehinds seem to be the only answer, but javascript doesn't have one.  EDIT: This is the regex that I would like to work, but it doesn't:  (?&lt;!([abcdefg]))m  So it would match the 'm' in 'jim' or 'm', but not 'jam' Set Theory: Tree Property Why does the tree property hold for regular cardinals but not singular cardinals? (I.e. There exists a tree of height $\kappa$ with countable levels and no cofinal branch for $\kappa$ a singular cardinal) $n$ people attend the same meeting, what is the chance that two people share the same birthday? Given the first $b$ birthdays, the probability the next person doesn't share a birthday with any that went before is $(365-b)/365$. The probability that none share the same birthday is the following: $\Pi_{0}^{n-1}\frac{365-b}{365}$. How many people would have to attend a meeting so that there is at least a $50$% chance that two people share a birthday?   So I set $\Pi_{0}^{n-1}\frac{365-b}{365}=.5$ and from there I manipulated some algebra to get $\frac{364!}{(364-n)!365^{n}}=.5\iff (364-n)!365^{n}=364!/.5=.....$   There has to be an easier way of simplifying this.