Anyone know what skill in skyrim levels your character up the fastest? My character is out of helgen so I can't do the sneak glitch. Also anyone know how to get destruction skill leveled up fast?
I'm level 16 which makes battling many Draugr Wrights hard. My defense is just way too low, and I don't have enough time or strong enough magic to take them out.   My one-handed skill is at 62 and my strongest weapon does 33+10 enchanted damage. Are there any ways to level up easily?
boolean[] vs. BitSet: Which is more efficient? What is more efficient in terms of memory and CPU usage — an array of booleans or a BitSet? Specific BitSet methods are not used, only get/set/clear (==, =, Arrays.fill respectively for an array). Is it possible to save frequently used expressions in QGIS? Is there any way to save frequently used expressions in the selection or field calculator dialogs? Obviously I can cut and paste them into a file where I might save them, but I mean within the context of QGIS like you can do in ArcMap. Checking if a key exists in a JavaScript object? How to select a clustering method? How to validate a cluster solution (to warrant the method choice)? One of the biggest issue with cluster analysis is that we may happen to have to derive different conclusion when base on different clustering methods used  (including different linkage methods in hierarchical clustering).  I would like to know your opinion on this - which method will you select, and how. One might say "the best method of clustering is which gives you the right answer"; but I may question in response that cluster analysis is supposed to be an unsupervised technique - so how do I know which method or linkage is the right answer?  In general: is a clustering alone robust enough to rely on? Or we need a second method and get a shared result to be based on both?  My question is not only about possible ways to validate / evaluate clustering performance, but is broader - on what basis do we select/prefer one clustering method/algorithm over another one. Also, is there common warnings that we should look around when we are selecting a method to cluster our data?  I know that it is very general question and very difficult to answer. I only would like to know if you have any comment or any advise or any suggestion for me to learn more about this. Choosing variables to include in a multiple linear regression model With the Superman lore, we know that light from a yellow star gives him his powers, light from blue stars makes him stronger, and light from red stars weakens him.  However, what happens if he is near a white dwarf, or a neutron star?  Has there been any evidence of Superman visiting a star system that wasn't red/yellow/blue? Is there a way to access wifi in Zurich airport without a phone service? I am traveling through Zurich and have a phone without any roaming there; I'm planning on picking up a SIM once I get to my final destination. Last time I was there, I couldn't access the airport wifi because it required a code sent via SMS.    In the event I need to contact someone or coordinate about flight delays, is there some alternate way to get wifi access? Experience using dropdowns in-line of sentence "mad lib" style Do you have experience implementing text inputs or drop-downs in-line with other text or forms? Is this approach any better than just creating a separate field/label?  In the example below the user has the option to indicate when to be reminded again (in one, two, or three days). When they are reminded of an assignment, they simply get an email or text message. Prove recursively defined sequence converges I would like some advice on how to solve problems like the following: Let $(x_n)$ be a sequence defined by $x_1= 3$ and $x_{n+1} = \frac{1}{4-x_n}$. Prove that the sequence converges.  My strategy is to use the Monotone Convergence Theorem, but I am having trouble showing that the sequence is decreasing and bounded below. Here's my work so far:  Decreasing: The first 4 values are $3,1,1/3,3/11$, so let's assume $x_n \leq x_{n-1} \leq \ldots \leq x_1$. Want to show $x_{n+1} \leq x_n$. We have $x_{n+1} = \frac{1}{4-x_n}$. I want to have an upper bound for the RHS, but can't find one and don't really know where to go from here.  Bounded below: I wanted to show that all values are positive, but if we assume $x_n &gt; 0$, that doesn't rule out $x_{n+1}$ from being negative. How to calculate 95% CI for cumulative incidence rate using R? My boot is horribly slow, and I don't know why.  $ systemd-analyze  Startup finished in 10.975s (kernel) + 49.732s (userspace) = 1min 708ms $ systemd-analyze blame           34.971s apt-daily.service          20.590s snapd.refresh.service          17.113s grub-common.service          16.033s apport.service          16.027s networking.service          15.894s ondemand.service          15.860s irqbalance.service          15.655s speech-dispatcher.service          11.695s ModemManager.service           9.772s accounts-daemon.service           8.626s NetworkManager-wait-online.service           8.058s systemd-logind.service           8.053s bluetooth.service           7.944s gpu-manager.service           7.896s alsa-restore.service           7.892s pppd-dns.service           7.882s rsyslog.service           7.860s avahi-daemon.service           7.844s dev-sda1.device           7.842s systemd-user-sessions.service           7.648s lightdm.service           7.610s teamviewerd.service           6.445s apparmor.service   Also, during boot-up, I see a message that says something like:  device descriptor read/all, error -62 ata1 softreset failed (device not ready) #most of the times error loading journal #(sometimes) Test WP failed, assume Write Enabled Asking for cache data failed     #most of the times Assuming drive cache: write through   apt-daily.service slows the boot the most. Any idea on how to tackle that?  I have Ubuntu MATE 16.04. I have a SQL query that I am trying to optimize:  DECLARE @Id UNIQUEIDENTIFIER = 'cec094e5-b312-4b13-997a-c91a8c662962'  SELECT    Id,   MIN(SomeTimestamp),   MAX(SomeInt) FROM dbo.MyTable WHERE Id = @Id   AND SomeBit = 1 GROUP BY Id   MyTable has two indexes:  CREATE NONCLUSTERED INDEX IX_MyTable_SomeTimestamp_Includes ON dbo.MyTable (SomeTimestamp ASC) INCLUDE(Id, SomeInt)  CREATE NONCLUSTERED INDEX IX_MyTable_Id_SomeBit_Includes ON dbo.MyTable (Id, SomeBit) INCLUDE (TotallyUnrelatedTimestamp)   When I execute the query exactly as written above, SQL Server scans the first index, resulting in 189,703 logical reads and a 2-3 second duration.   When I inline the @Id variable and execute the query again, SQL Server seeks the second index, resulting in only 104 logical reads and a 0.001 second duration (basically instant).  I need the variable, but I want SQL to use the good plan. As a temporary solution I put an index hint on the query, and the query is basically instant. However, I try to stay away from index hints when possible. I usually assume that if the query optimizer is unable to do its job, then there is something I can do (or stop doing) to help it without explicitly telling it what to do.  So, why does SQL Server come up with a better plan when I inline the variable? If $\gcd(a,b)=1$, $\gcd(a,y)=1$ and $\gcd(b,x)=1$ then prove that $ax+by$ is prime to $ab$.  I tried assuming Diophantine Equations for all the relations and representing everything in terms of $a$, but that didn't lead me anywhere. There must be an intuitive and elegant approach right? I am solving the TOEIC workbook, by the way, I faced conflict that doesn't match meaning I knew.  The problem is     The newest branch of the library is located in/on Pine Street.   I think either 'in' or 'on' have the same meaning. But the commentary said that 'be located in' is mainly writing in front of building name and city name.   I don't know what is correct? LOAD DATA INFILE easily convert YYYYMMDD to YYYY-MM-DD? Huge paged pool probably caused by fltMgr.sys , what to do? Why is there no 32 bit ISO for the new Ubuntu 18.04? Why is there no 32 bit ISO for the new Ubuntu 18.04? Proof by induction of summation inequality: $1+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\dots+\frac1{2^n}\ge 1+\frac{n}2$ Prove by induction the summation of $\frac1{2^n}$ is greater than or equal to $1+\frac{n}2$.  We start with $$1+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\dots+\frac1{2^n}\ge 1+\frac{n}2$$ for all positive integers.   I have resolved that the following attempt to prove this inequality is false, but I will leave it here to show you my progress. In my proof, I need to define P(n), work out the base case for n=1, and then follow through with the induction step. Strong mathematical induction may be used.  This is equivalent to $$\sum_{k=0}^n\frac1{2^k}\ge 1+\frac{n}2\;.$$  Let $P(n)$ be summation shown above.   Base case for $n=1$, the first positive integer,   $$\sum_{k=0}^1\frac1{2^k}=\frac1{2^0}+\frac1{2^1}=1+\frac12=\frac32\ge 1+\frac12=\frac32\;,$$  so base case is true.  Induction step: Assume $P(n)$ is true and implies $P(n+1)$. Thus   $$\sum_{k=0}^{n+1}\frac1{2^k}\ge\frac1{2^{n+1}}+\sum_{k=0}^n\frac1{2^k}\ge 1+\frac{n+1}2\;.$$  This can be written as   $$\sum_{k=0}^{n+1}\frac1{2^k}\ge \frac1{2^{n+1}}+1+\frac{n}2\ge 1+\frac{n+1}2\;.$$  I work the math out but I get stuck contradicting my statement. Please show your steps hereafter so I can correct my mistakes. How can I acknowledge, thank, or otherwise approve of an edit? Possible Duplicate:    Sometimes I get an edit that greatly improves a question or answer I have submitted.  I'd like to acknowledge an edit like this, so that readers can know that the revision was approved of by the OP (me!). I was thinking of comments on edit, or a checkbox noting that OP vouches for the edit.  Sometimes I would like to add a comment to the question or answer, but those don't make a lot of sense in that context. Any suggestions about the best way to do this?  Consider this a feature request, as it seems useful to know that a particular edit was endorsed/vetted by the OP. Could not list layers for this store error when creating new ImageMosaic