Given input as:  #start   random string 1 #end  #start   random string 2 #end   I can write a regex as   (#start[\s\S]*?#end)   Now thing gets a bit complex with this given data:    #start     random string 1     #start       random string 2     #end   #end    #start     random string 3   #end   and i want to get 03 matches, which are:  #start   random string 1 #end  #start   random string 2 #end  #start   random string 3 #end   Will this even be possible with regex? Cause i tried most of the regex rules, but i think i missed something cause it doesn't work as I want.  Can someone show me which rules can I used to achieve this goal?  Thank you.
Is it possible to write a regular expression that matches a nested pattern that occurs an unknown number of times? For example, can a regular expression match an opening and closing brace when there are an unknown number of open/close braces nested within the outer braces?  For example:  public MyMethod() {   if (test)   {     // More { }   }    // More { } } // End   Should match:  {   if (test)   {     // More { }   }    // More { } }
How to Set Firefox 4 to only store History for a set period of time, i.e. one day? I want to setup Firefox 4 to only store my history for 1 day (or some other set period of time), but I can't seem to find an option to do that in the options dialog, all I can see is "Remember History", "Never Remember History" and "Custom History Settings". "Custom History Settings" only lets me select what to keep, not for how long.  Is there anyway I can do this? What is hard reset and what is factory reset? It is mentioned at  that one should do Factory reset or hard reset. I'm a bit confused about what is hard reset?  Factory reset I suppose is using the option in settings to reset phone to the factory state i.e. when it was unboxed. Can somebody help me with the execute commands in Minecraft? Recently, Minecraft had removed the /testfor command, which broke these sets of commands that I was trying to execute today.  /testfor @p[r=10] {SelectedItem:{id:"minecraft:feather",tag:{display:{Name:"Roc's Feather",Lore:[Jump higher using this feather.]}}}}`   Now normally, from Minecraft 1.13 onwards, the new /execute command would've been the replacement for the /testfor command, but as I soon found out, the command failed to detect my Roc's Feather and thus could not execute an /effect command that gave me a Jump Boost, for 1 second, at level 3.  I tried remaking my feather from scratch with this command here:  /give @p minecraft:feather{display:{Name:"{\"text\":\"Roc's Feather\",\"color\":\"light_purple\",\"bold\":true,\"italic\":true,\"underlined\":false,\"strikethrough\":false,\"obfuscated\":false}",Lore:["{\"text\":\"Jump higher using this feather.\",\"bold\":false,\"italic\":true,\"underlined\":false,\"strikethrough\":false,\"obfuscated\":false}"]}} 1   But the execute command I placed did not detect this type of uniqueness.  /execute if entity @p[distance=10,nbt={SelectedItem:{id:"minecraft:feather",Count:1b,tag:{display:{Name:"{\"text\":\"Roc's Feather\",\"color\":\"light_purple\",\"bold\":true,\"italic\":true,\"underlined\":false,\"strikethrough\":false,\"obfuscated\":false}",Lore:["{\"text\":\"Jump higher using this feather.\",\"bold\":false,\"italic\":true,\"underlined\":false,\"strikethrough\":false,\"obfuscated\":false}"]}}}}] run effect give @s minecraft:jump_boost 1 3 true   Can somebody tell me what I'm doing wrong here because I cannot even tell what's the issue. I found several very-close-to-duplicate questions/answers. However, I want to restate some questions and discuss the answers from these questions.  Here the questions which I found:         I find it quite unfair that super simple questions and their answers upvote give the same amount of reputation points per upvote as complex questions. I think reputation points should be much closer linked to contribution. And I think that contribution in answering/asking a simple question (both in time, value and time saved to other developers) is way less than for some more complex questions.   Why doesn't Stack&nbsp;Overflow change this?  I saw several common answers:     if you change the game, then the only result is that people will game it differently.   I agree only partly with this. Sure, people will always game the system. However, any improvement can be rejected based on this argument. I believe if there is an obvious problem, it makes sense to fix it. And it looks like this question was asked number of times (meaning that it's not only me thinking that it should be changed).     Reputation is NOTHING more than an INCENTIVE to contribute.   Again. I agree only partly. Reputation doesn't have any real value (it can't be converted to anything). However, let's be honest. People are competitive and people like to have some measurement stick and most of software developers want to have a fair game. Based on this, reputation isn't NOTHING, reputation is very important tool which makes Stack&nbsp;Overflow popular. Calculating reputation one way or another way may lure or discourage people from participating.     Esoteric questions are only of interest to people working with that item.   I believe one of the biggest values of Stack&nbsp;Overflow that it contains a lot of information which is hard to find somewhere else.  So, sure, there are some rare questions which aren't valuable to the whole community. But, I would say that a question which saves 25 people a day of work (complex question) is more valuable than a question which saves a 1000 people 3 minutes of googling (simple question).  My summary:  I believe it makes sense to change a system a little bit. The simplest way would be the ability to mark a question as trivial. If some number of people marked the question as trivial (let's say 10), all upvotes for this question/answers become less valuable (for example, 1 or 2 points, instead of 5). This will close this gap. Changing Network Interfaces name Ubuntu 16.04 I tried to change network interfaces name on this new Ubuntu 16.04 LTS version but doesn't have the /etc/udev/rules.d/70-persistent-net.rules.  So, I tried to use /lib/udev/write_net_rules but it not exist.  Why do I need this modification? Because I'm using a tool to Simulate virtual platforms that use flex licensing and the authentication need to be in eth0 interface name.  Any suggestion?  The command ip link returns:  user@laptop:~$ ip link  1: lo: &lt;LOOPBACK,UP,LOWER_UP&gt; mtu 65536 qdisc noqueue state UNKNOWN mode DEFAULT group default qlen 1 link/loopback 00:00:00:00:00:00 brd 00:00:00:00:00:00 2: enp6s0: &lt;NO-CARRIER,BROADCAST,MULTICAST,UP&gt; mtu 1500 qdisc pfifo_fast state DOWN mode DEFAULT group default qlen 1000 link/ether b8:2a:xx:yy:xx:yy brd ff:ff:ff:ff:ff:ff 3: wlp7s0: &lt;BROADCAST,MULTICAST,UP,LOWER_UP&gt; mtu 1500 qdisc mq state UP mode DORMANT group default qlen 1000 link/ether 5c:e0:xx:yy:xx:yy brd ff:ff:ff:ff:ff:ff  user@laptop:~$ ifconfig  enp6s0    Link encap:Ethernet  HWaddr b8:2a:xx:yy:xx:yy   lo        Link encap:Local Loopback   wlp7s0    Link encap:Ethernet  HWaddr 5c:e0:xx:yy:xx:yy     (Some information were ignored and suppressed)  I already tried some links: Most incarnations of The Hulk I've seen or read about state that he is as strong as he needs, basically meaning that there is no limit to how strong he can get.  Is there any canon regarding this? Have we seen the upper limit of the Hulk's strength? On the left is the normal map generated by the Bevel node. On the right is an unbeveled cube with the Bevel node in action. I wish to convert this to a BW map where The edges/gradients are highlighted and the rest isn't. Does anyone know if this can be achieved with more nodes? What are some scenarios where FTL information transfer would violate causality? I've always heard people saying, "Faster than light information transfer can't happen because it would violate causality!  Effects can precede their causes!"  However, I'm trying to think of a situation where this would happen.  I'm sure it has something to do with relativity or something like that.  I sort of understand that people going faster perceive time slower.  Can someone help illuminate this for me by showing a scenario where causality is clearly violated due to FTL information transfer? Imagine you are surviving in the wilderness traveling in a wandering manner. You've found this landscape that is wonderfully abundant in food and basking in a very favorable climate. Therefore, you decide that this is your new residence.  Night is approaching, so you haphazardly piece together a makeshift shelter to make for a more enjoyable living experience while you get your act together.  This shelter is only temporary. After you've become familiar with the land and have gathered finer resources, you will begin creating a proper home complete with securities, amenities, and furnishings.  The word I am looking for is an adjective meaning something similar to "created recklessly for temporary use."      The shelter you were building on your first night was a(n) ________   abode.   The words and phrases "ad-hoc", "off the cuff", "on the run" came to my mind, but none of those are understood to mean what I am trying to communicate (in fact, two of them are not even close). If you think of a word with a meaning that you believe to be similar to what I am searching for, I'd love to hear from you!  Thank you. Proving : $ \bigl(1+\frac{1}{n+1}\bigr)^{n+1} \gt (1+\frac{1}{n})^{n} $ How could we prove that this inequality holds      $$ \left(1+\frac{1}{n+1}\right)^{n+1} \gt \left(1+\frac{1}{n} \right)^{n} $$   where $n \in \mathbb{N}$, I think we could use the AM-GM inequality for this but not getting how? Mod of numbers with large exponents [modular order reduction] I've read about Fermat's little theorem and generally how congruence works. But I can't figure out how to work out these two:   $13^{100} \bmod 7$ $7^{100} \bmod 13$   I've also heard of this formula:  $$a \equiv b\pmod n \Rightarrow a^k \equiv b^k \pmod n $$  But I don't see how exactly to use that here, because from $13^1 \bmod 7$ I get 6, and $13^2 \bmod 7$ is 1. I'm unclear as to which one to raise to the kth power here (I'm assuming k = 100?)  Any hints or pointers in the right direction would be great. I've compiled a java project into a Jar file, and am having issues running it.  When I run:  java -jar myJar.jar   I get the following error  Could not find the main class: myClass   The class file is not in the root directory of the jar so I've tried changing the path of the main class to match the path to the class file and I get the same issue.  Should I be flattening the file structure? if so how do I do this. I'm using Ant to build the Jar file if thats of any use.  UPDATE   Here is the contents of the jar and the relevant Ant sections, I've changed the name of the firm I work for to "org":  META-INF/ META-INF/MANIFEST.MF dataAccessLayer/ dataAccessLayer/databaseTest.class org/ org/eventService/ org/eventService/DatabaseObject.class org/eventService/DatabaseObjectFactory.class org/eventService/DbEventClientImpl$HearBeatMonitor.class org/eventService/DbEventClientImpl.class org/eventService/EmptyQueryListException.class org/eventService/EventHandlerWorkItem.class org/eventService/EventProcessor.class org/eventService/EventTypeEnum.class org/eventService/EventWorkQueue$MonitorThread.class org/eventService/EventWorkQueue$PoolWorker.class org/eventService/EventWorkQueue.class org/eventService/FailedToLoadDriverException.class org/eventService/IConnectionFailureListener.class org/eventService/InvalidEventTypeException.class org/eventService/JdbcInterfaceConnection.class org/eventService/NullArgumentException.class org/eventService/OracleDatabaseObject.class org/eventService/ProactiveClientEventLogger.class org/eventService/ProactiveClientEventLoggerException.class org/eventService/PropertyMap.class org/eventService/SQLServerDatabaseObject.class org/eventService/TestHarness.class org/eventService/Utilities.class   And the ant target:  &lt;target name="compile" depends="init" description="compile the source "&gt;     &lt;javac srcdir="src" destdir="bin" classpathref="project.class.path"/&gt; &lt;/target&gt; &lt;target name="buildjar" description="build jar file" depends="compile"&gt;     &lt;mkdir dir="dist"/&gt;     &lt;jar destfile="dist/myJar.jar" basedir="bin" includes="**/*.class" &gt;         &lt;manifest&gt;             &lt;attribute name="Main-Class" value="org.eventService.ProactiveClientEventLogger"/&gt;         &lt;/manifest&gt;      &lt;/jar&gt; &lt;/target&gt; Can Java's NullPointerException be changed to report on which variable was null? DMed for the first time yesterday and one of the things I feel I need to sort out, among other comments, improvements, and similar, is how combat itself is actually initiated. The main example I want to use involves  attempting to generate surprise conditions by players. Here the characters have entered a ruined city and generally been noisy about the whole thing - using a spell to make their voice louder and literally ask if there is anyone about. Any enemies around probably know what something is about to kick off but arguably don't know precisely what. After resting the PCs head up a long flight of steps to a temple on the edge of the city. At the top only one crests and finds 3 bandits lounging around, chatting, and doing whatever bandits do in their spare time. After a brief exchange of pleasantries a combat starts:  DM &quot;The bandit spits in your direction 'we're not done looting the temple, so you can clear off', and starts raising his crossbow as his mates emerge from their cover behind the pillars... PC &quot;I cast Firebolt at Bandit Keith&quot; DM &quot;Hang on, I hadn't finished, everyone rolls for initiative...  Which sparked a debate about whether or not the PC could preemptively cast/attack before the combat starts by &quot;instant actioning&quot; (as above) as I was describing the start of the combat. As far as the bandits are concerned a lone half-elf who is pretty heavily armed has popped up in front of them, not even tried to be diplomatic, and ended up saying something rather suggestive about their mothers. The PC then asked about it being &quot;surprise&quot; because the bandits wouldn't necessarily expect an attack, but my view of &quot;surprise&quot; is closer to an ambush where one party is unaware of the other's existence. (This precise example is close to how  works, however this specific PC was always the first of the party to go into rooms (only one with darkvision) and consistently felt they should get free rounds at the start of combat based on declaring attacks before I could &quot;start&quot; the combat.) The second example the party came to more bandits, who were not alert immediately, in an underground room. They used magic to yell something obscene at the bandits and shut off all the torches so the bandits were effectively blinded. At this point they wanted to burst into the room casting spells, swinging maces, and playing some &quot;meaty chords&quot; (the bard's words, not mine). Again they wanted surprise arguing that, despite the fact that the bandits were yelling and cursing in confusion, they couldn't be sure they were actually being attacked as such. In the end a character with darkvision wanted to sneak in to a corner and again wanted surprise based on passing stealth rolls, so they would start the &quot;combat&quot; by firing a crossbow. At that point I think I relented because it was clear that they would do anything to try and win combats in a single round. In a nutshell, my question is: &quot;how liberally can the concept of surprise be applied to combat - is it only when one party is literally unaware of a threat (as I read the rules), or just when they are caught slightly off guard by the exact situation?&quot; NB I already plan to address the attempts at interrupting descriptions with actions next session, because it happened at other times and actually threw me off quite a bit. I have the two PGF nodes foo and bar positioned in a row.  \documentclass{article} \usepackage{tikz} \usetikzlibrary{positioning} \begin{document}   \begin{tikzpicture}[node distance=0.2cm,mynode/.style={rectangle,draw}]     \node[mynode] (foo)                {foo};     \node[mynode] (bar) [right=of foo] {bar};   \end{tikzpicture} \end{document}   How can I create a third node below those two nodes with the width of foo, bar and the node distance between them? Is there a way to do this with the fit library or is this the wrong approach? Manually calculated $R^2$ doesn't match up with randomForest() $R^2$ for testing new data I know this is a fairly specific R question, but I may be thinking about proportion variance explained, $R^2$, incorrectly. Here goes.  I'm trying to use the R package randomForest. I have some training data and testing data. When I fit a random forest model, the randomForest function allows you to input new testing data to test. It then tells you the percentage of variance explained in this new data. When I look at this, I get one number.  When I use the predict() function to predict the outcome value of the testing data based on the model fit from the training data, and I take the squared correlation coefficient between these values and the actual outcome values for the testing data, I get a different number. These values don't match up.   Here's some R code to demonstrate the problem.  # use the built in iris data data(iris)  #load the randomForest library library(randomForest)  # split the data into training and testing sets index &lt;- 1:nrow(iris) trainindex &lt;- sample(index, trunc(length(index)/2)) trainset &lt;- iris[trainindex, ] testset &lt;- iris[-trainindex, ]  # fit a model to the training set (column 1, Sepal.Length, will be the outcome) set.seed(42) model &lt;- randomForest(x=trainset[ ,-1],y=trainset[ ,1])  # predict values for the testing set (the first column is the outcome, leave it out) predicted &lt;- predict(model, testset[ ,-1])  # what's the squared correlation coefficient between predicted and actual values? cor(predicted, testset[, 1])^2  # now, refit the model using built-in x.test and y.test set.seed(42) randomForest(x=trainset[ ,-1], y=trainset[ ,1], xtest=testset[ ,-1], ytest=testset[ ,1]) When is the expected stable release date of Ubuntu Phone and Ubuntu Tablet? Is there an expected stable release date of Ubuntu Phone and Ubuntu Tablet?  If so, what are their dates? What is ubuntu 14.04 doing while showing "stopping early crypto disks"? I created a virtual machine to install ubuntu 14.04 on VirtualBox 4.2.12.*. I created virtual CD to install it with fixed-size virtual disk of 200GB. After successful installation, it restarted as usual. But after showing message of below, it hangs. Actually, I created virtual machines to install ubuntu at Virtual Box successfully several times. It's very easy. The installed ubuntu versions ranged from 9.10, 13.04 and even 14.04 before. I don't know why this time it hangs at restarting after successful installation. The only difference between this failure restart and previous successful ones is that the virtual disk is much larger, 200GB. It failed three times.  * Deactivating swap... [OK] * Stopping remaining crypto disks... [OK] * Stopping early drypto disks... [OK] How do I fix a NoSuchMethodError? Limit of some specific "almost Riemann" sums I'm just beginning my journey with calculus, and this problem is giving me hard time.  $$\lim_{n \to \infty} \sum_{k=1}^n \frac{k}{{n^2+k}}$$  I calculated first three sums: $$\frac{1}{2}, \frac{16}{30}, \frac{117}{220}$$ From that I guessed that the limit is $$\frac{1}{2}$$. The hard part, though, is proving it.    I reckon that the squeeze theorem should be used here, but I can't seem to find anything useful. (The only sequences I was able to figure out give me limits of 1 and 0, so it's not something I can use)  Maybe you guys can give me some ideas or theorems that can be of use here? I know that this problem could be probably solved using some more advanced calculus techniques, but I'm not familiar with derivatives and integrals yet, and this problem is in the limits section of my problem book, so I'm not supposed to use anything more advanced.