I'm running a 3.5 campaign for a large group (8 players, I must be crazy), none of which have every played before, and several of which are quite young (ages 13-17).  I've got some ideas for changing up the set up to make it flow faster (mentioning who is "on deck," etc.), but I was wondering if there were any good rule changes / adjustments for 3.5 that would speed up combat and just generally make the game flow faster.
I'm looking for ways to speed up the combat in my D&amp;D 3.5 game. It seems that turns - both player and non-player - simply take too long. I have thought about giving everyone a 30 second timer, but I'm afraid that might inhibit their ability to come up with strategy and tactics.
Rights if we possess Carta di Soggiorno? What is the most effective way for float and double comparison? How does the Ranger's Extra Attack feature work with Two-Weapon Fighting? I think I know the answer to this one but I'm double checking.  At the 5th level the Ranger gets Extra Attack, which lets them attack a second time during the Attack action. If they are fighting with 2 weapons, the second weapon normally uses their bonus action.  Does this mean when using the Extra Attack and using two weapons, a ranger can attack twice during the Attack action, and still make 1 extra attack as a bonus action, for a total of 3 attacks? Minecraft LAN "java.net.ConnectException: Connection refused: no further information:" I am trying to play a map on LAN. But every time I try to log on, I get:     java.net.ConnectException: Connection refused: no further information:   This used to work, but for some reason has stopped all of a sudden. I looked it up online, and everything I found said the firewall just wasn't allowing Java through. I followed tutorials to allow Java through the firewall, but even then it won't work. I know for a fact that I'm putting the IP in correctly, and everything seems to be correct, but yet I still get the same error message.  If it helps any, I'm using MC version 1.8.9 (the map requires it), and I don't have any mods. I'm working through some old integrals and I found one that's interesting. I can't quite remember how it's proved, so if someone could set me off in the right direction, it would be really helpful. Thanks!   $\int_{\mathbb{R}} e^{-ax^2 + bx} dx = \sqrt{ \dfrac{\pi}{a}} e^{\frac{b^2}{4a}}$  I've tried change of variable, but I'm not sure this is the right approach. Creating mask file from shapefile using ArcGIS for Desktop? I have a shapefile of Lakes over my study area. Each polygon has attribute information of each lake, name, shape etc. Actually I want to eliminate all lakes from analysis. In other word, I want lakes to have 0 value and the area that out of boundary of lake to have their orginal pixel values. when I do subset using this shapefile, the output is not I want because my shapefile deoesn't have any value outer boundary of lake.   How can I build a proper mask file (inner part of lake has 0 value, outer is 1) using this shapefile in ArcGIS Desktop? Understanding the definition of the order of an entire function in Ahlfors's Complex Analysis Let $f: \mathbb C \to \mathbb C$ be an entire function. The order of $f$ is defined by $$\lambda=\limsup_{r \to \infty} \frac{\log \log M(r)}{\log r}, $$ where $$M(r)=\max_{|z|=r} |f(z)| .$$  Ahlfors in his Complex Analysis claims that     "According to this definition $\lambda$ is the smallest number such that       $$M(r)\leq e^{r^{\lambda+\varepsilon}} $$ for any given $\varepsilon &gt; 0$ as soon as $r$ is sufficiently large."   Why is this true?  My attempt:  We know that $$\lambda=\lim_{\rho \to \infty} \sup_{r \geq \rho} \frac{\log \log M(r)}{\log r}. $$  From the definition of the limit we have that for any $\varepsilon&gt;0$, there exists some $\rho_0&gt;0$, such that $$\left\lvert \sup_{r \geq \rho} \frac{\log \log M(r)}{\log r}-\lambda \right\rvert \leq \varepsilon ,$$ for every $\rho \geq \rho_0$. In other words $$\frac{\log \log M(r)}{\log r} \leq \lambda+\varepsilon $$ for every $r \geq \rho_0$. From here it is easy to see that $$M(r)\leq e^{r^{\lambda+\varepsilon}}, $$ for all $r \geq \rho_0$. I cannot see why $\lambda$ is the smallest number with this property.  Thanks in advance. At work we were discussing this as my boss has never heard of normalization. In Linear Algebra, Normalization seems to refer to the dividing of a vector by its length. And in statistics, Standardization seems to refer to the subtraction of a mean then dividing by its SD. But they seem interchangeable with other possibilities as well.   When creating some kind of universal score, that makes up $2$ different metrics, which have different means and different SD's, would you Normalize, Standardize, or something else? One person told me it's just a matter of taking each metric and dividing them by their SD, individually. Then summing the two. And that will result in a universal score that can be used to judge both metrics.  For instance, say you had the number of people who take the subway to work (in NYC) and the number of people who drove to work (in NYC).   $$\text{Train} \longrightarrow x$$ $$\text{Car} \longrightarrow y$$  If you wanted to create a universal score to quickly report traffic fluctuations, you can't just add $\text{mean}(x)$ and $\text{mean}(y)$ because there will be a LOT more people who ride the train. There's 8 million people living in NYC, plus tourists. That's millions of people taking the train everyday verse hundreds of thousands of people in cars. So they need to be transformed to a similar scale in order to be compared.  If $\text{mean}(x) = 8,000,000$  and $\text{mean}(y) = 800,000$  Would you normalize $x$ &amp; $y$ then sum? Would you standardize $x$ &amp; $y$ then sum? Or would you divide each by their respective SD then sum?  In order to get to a number that when fluctuates, represents total traffic fluctuations.  Any article or chapters of books for reference would be much appreciated. THANKS!  Also here's another example of what I'm trying to do.   Imagine you're a college dean, and you're discussing admission requirements. You may want students with at least a certain GPA and a certain test score. It'd be nice if they were both on the same scale because then you could just add the two together and say, "anyone with at least a 7.0 can get admitted." That way, if a prospective student has a 4.0 GPA, they could get as low as a 3.0 test score and still get admitted.  Inversely, if someone had a 3.0 GPA, they could still get admitted with a 4.0 test score.  But it's not like that. The ACT is on a 36 point scale and most GPA's are on 4.0 (some are 4.3, yes annoying). Since I can't just add an ACT and GPA to get some kind of universal score, how can I transform them so they can be added, thus creating a universal admission score.  And then as a Dean, I could just automatically accept anyone with a score above a certain threshold.  Or even automatically accept everyone whose score is within the top 95%.... those sorts of things.  Would that be normalization? standardization? or just dividing each by their SD then summing? Extracting extension from filename in Python Is there a function to extract the extension from a filename? I want to talk to someone about the house that my wife and I own.  Saying, for example, "My wife's and my house is awesome," sounds a bit funny to me.  What's the best way to express this?  Clarification  I'm asking specifically about the grammar of multiple nouns in possessive form.  I'm particularly curious if it's possible to do this with a first-person pronoun (me).  I am capable of rephrasing this in other ways - my question is not how to express the idea, but about this particular grammatical construction, if it is even legal. How do I set OS X to boot by default? I set Windows 7 to my Boot Camp. Windows 7 starts now by default in the normal boot. However, I want that OSX boots by default and Windows 7 only as I press ALT and then select it.  How can you set OSX to boot by default? Is the orbit in Schwarzshild metric a path with maximal proper time? In curved spacetime particles follow timelike geodesics, which should have maximal proper time (at least locally). I thought this path usually corresponds to a global maximum, and there are only strange exceptions. Propably I was wrong, or I really don't understand something, because it doesn't seem to be true for the case of orbitals in Schwarzschild geometry.  The Schwarzschild metric is (with +--- signature)  $$ g_{\mu\nu} = \textrm{diag}\left(1-\frac{2GM}{r},-\left(1-\frac{2GM}{r}\right)^{-1},-r^2,-r^2\sin^2\theta\right) $$  An observer with fixed $r,\theta,\phi$ coordinates will age according to $d\tau_1 = \sqrt{g_{tt}}dt$. An observer, which orbits the center at the same constant radius with $\theta=\pi/2$ will age according to $d\tau_2 = \sqrt{g_{tt}-\omega^2r^2\sin^2\theta}dt$, so he ages slower during the same amount of coordinate time $dt$. If the two observers start from the same point, they will meet again after a full rotation of the orbiting observer, and the orbiting observer will age less. What I don't understand is that the orbit is the geodesic (if the angular velocity is set properly), so why didn't he age more? He should have been on the path with maximal proper time. How to install latest Code::Blocks from tar.xz? Could humans choose to establish fibre digesting colonies in our guts? Humans don't digest fibre, and nor do any animals, but some creatures have micro-organisms (bacteria, I'm guessing) in their gut which digest fibre for them.  My question is, could humans take some sort of pill and establish our own fibre-digesting colonies in our intestines?  Has this been tried?  Supposing it could be done, would you suppose it would have any negative effects on our health?  (i.e.. would those whose gut digested fibre for them be stuck on a low-fibre diet?).    Purpose of question: just wondering.  It would be cool to be able to eat bark. Retrieve the position (X,Y) of an HTML element relative to the browser window Transit Visa in Hong Kong for 15 hour layover between India and USA? For closed subsets $A,B \subseteq X$ with $X = A \cup B$ show that $f \colon X \to Y$ is continuous iff $f|_A$ and $f|_B$ are continuous. I was just trying to solve an exercise in Munkres' Analysis on Manifolds to get better at continuous functions and topology in $\mathbb{R}^{n}$, and I got stuck. Here it is:      Let $X = A \cup B$, $A$ and $B$ are subspaces of $X$. Let $f:X \rightarrow Y.$ Suppose that the restricted functions $f_{|A}:A \rightarrow Y$ and $f_{|B}:B \rightarrow Y$ are continuous. Show that if both $A$ and $B$ are closed in $X$, then $f$ is continuous.    Our definition of continuity is:  $f$ is continuous at $x \in X$ if for each open set $V$ of $Y$ containing $f(x)$, there is an open set $U$ of $X$ containing $x$ such that $f(U) \subset V$. $f$ is continuous if it is continuous at each point of its domain.  What I've tried so far:  Suppose $A$ and $B$ are closed in $X$. Suppose $A \cap B = \emptyset$. Then $X -A$ is open in $X$. But $X - A = B$ which is closed in $X$, which is a contradiction. Hence, $A \cap B \ne  \emptyset$. I'm not sure if this will be useful in the problem or not. If $x \in X$, then it's either in $A$ or in $B$. Suppose without loss of generality that it's in $A$. Then for all open sets $V$ of $Y$ s.t. $f(x) \in V$, $\exists$ an open set $U_{1}$ of $A$ s.t. $U_{1} \subset A, a \in U_{1}$ and $f(U_{1}) \subset V$. This is almost what we want, except that we want to find an open set $U$ of $X$ s.t. $U \subset A, a \in U$ and $f(U) \subset V$. This is because $U_{1}$ being open in $A$ does not necessarily mean that it's open in $X$ because $A$ is closed in $X$. (i know how to expand this argument out if needed) My idea now is to try to find a subset $U$ of $U_{1}$ such that $U$ is open in $X$. We have two cases:  (1) $U_{1}$ does not intersect the boundary of $A$. (2) $U_{1}$ intersects the boundary of $A$. Now I'm not sure what to do. I'm wondering if it would help to investigate the relationship between Bd(A) and Bd(B).. In any case (no pun intended), any help/advice would be greatly appreciated. :)  Sincerely,  Vien Receiving Push Notifications while in background US Customs when coming through Canada I have an upcoming trip where I will be flying to and from Copenhagen, through Toronto.  I notice that my departure and return gate in the Philadelphia airport is not in the international terminal.  Where will I clear customs? Can I replace a 15 ampere circuit breaker with a 20 ampere breaker? When I plug-in a conventional heating pad or a hair dryer into any bedroom duplex, the lights dim; and/or trips the circuit breaker. The home is of new construction-- placed in service 31 Dec 2013. My question is: Can I safely replace the existing 15 AMP Breaker with that of a 20 AMP? . . . the service cable is of 14 Gauge Copper Conductor.