How to make a Stopwatch without rewrite line for each display
Writing string at the same position using Console.Write in C# 2.0
Why should we typedef a struct so often in C? Why do I get TypeError: can't multiply sequence by non-int of type 'float'? How to get Intel Dual Band Wireless-AC 3168 work on Ubuntu 16.04? Differences between "however", "although","albeit", etc Does a photon instantaneously gain $c$ speed when emitted from an electron? Live USB for Ubuntu 13.10 does't recognize Windows 8 OS Why can't variables be declared in a switch statement? 2D inhomogeneous biharmonic equation I am new to Apex, but it is apparent to me that most (if not all) standard objects probably have an ID field. However, this field does not appear in the reference for the standard objects in the Soap API Developer's Guide. Instead, it reads:     To verify the complete list of fields for an object, you can use a   describe call from the API, or inspect with an appropriate tool, for   example, inspecting the WSDL or using a schema viewer.   If I want to find out for sure whether an object has an ID field, or what the field is named (is it ID, Identifier, id, etc), it sounds like I need to use a "describe call" or "an appropriate tool" or inspect the "WSDL" using a "schema viewer".  Now, I am an experienced software developer, but those solutions are so ambiguous I have no idea where to look next to figure out how to get an object's ID. Can anybody either refer me to more specific documentation, or explain how to find the complete field documentation via a "describe call", "appropriate tool", or "schema viewer"? I absolutely hate it when I watch a video on YouTube and it automatically loads another video page after it's done playing.  This is especially annoying when I'm in the middle of typing a comment as it will cause me to lose what I have typed.  I'd like the video to simply stop and for no further action to take place once it is finished playing.  Is there any way to accomplish this? How can I get octal file permissions from command line? Are there specific techniques/filters for snowscapes? Give us better search-by-score syntax tl;dr: Give the score search operator ability to change between greater than and less than.  I just noticed that searching for score:0 turns up only question with a score equal to 0. Searching for score:1 gives everything with a positive score. (&gt;=1) I can live with these. But here's the big one: score:-1. I would expect it to give all the negatively scored posts - there is a minus sign in there. But it doesn't. It gives all the posts &gt;=-1. Greater than? So, my  is that we get more granular search options for score. For example,  score:1 would show all posts with score == 1 score:1+ would show everything score &gt;= 1 score:0 would show all posts with score == 0 score:-1 would show everything score == -1 score:-1- would show al posts where score &lt;= -1  In short, the operator after the number would show which direction to go with the matching. A minus sign means less than, a plus sign means greater than. No sign means exact. In a  a doubt was voiced about my answer, which claims GCM to requires $2^{128}$ for a successful forgery. The doubt was that the square root needs to be taken meaning the security would be $2^{64}$.  So of course I immediately checked the relevant security theorem ():  $$\mathbf{Adv}^{\text{auth}}_{\operatorname{GCM}[\operatorname{Perm}(n),\tau]}(\mathcal A)\leq \frac{0.5(\sigma+q+q'+1)^2}{2^n}+\frac{q'(\ell_A+1)}{2^\tau}$$  with $\sigma$ being the total plaintext size in blocks, $q$ being the total number of encryption queries, $q'$ being the total number of decryption queries, $n$ being the size in bits of the underlying permutation, $\ell_A$ being maximum authenticated input length in blocks and $\tau$ being the tag size in bits.  Now clearly from this we can see that performing $2^{n/2}=2^{64}$ queries yields a strong enough advantage for a break.  Now my question is: When talking about "n-bits of security" or "needs $2^n$ operations to break", do we usually talk about "online" security, ie queries to an oracle can be done and cost $1$ or "offline" security where no oracles are available or do we need to make this decision depending on the situation?  TL;DR: Does GCM offer 64 or 128 bit security? Concatenating string with space Can Ubuntu use all my 4GB of RAM? Printer "Filter failed" Upgraded to 18.04 from 16.04. I have a workplace printer connected through appsocket which stopped working.  Printer status is Idle-Filter failed.  Printing queue instantly goes to "stopped".  Right clicking on the printer shows "option finishings has value 3 and cannot be changed". I can't find any info on this error except one pdf to ignore the error.  The printer model Ricoh MP 2555 worked previously with the Ricoh MP C2800 driver. Now it works with neither 2800 or 2555.  The IP address of the printer pings fine. When I try and detect the printer on the network using IP address and I ask it to use the Ricoh MP 2555 driver, it asks for an additional driver which opens Ubuntu software (which never helps) and fails.  I tried changing drivers from "" by providing the ppd file. It still doesn't help. var/log/cups/error.log doesn't tell much, or I don't get it.  Hope someone knows about this error or some kind of a generic solution. Proving which QM interpretation is correct Let's assume that the existence of gravitons is theoretically proven or they are detected by LHC could one interpretaion be proven correct? How to blacklist kernel modules? How do I disable loading of unnecessary kernel modules. Kernel 3.2.4 Prove: $\lim\limits_{n \to \infty} \int_{0}^{\sqrt n}(1-\frac{x^2}{n})^ndx=\int_{0}^{\infty} e^{-x^2}dx$ I'd like your help with the following claim to prove:  $$\lim_{n \to \infty} \int_{0}^{\sqrt n}\left(1-\frac{x^2}{n}\right)^ndx=\int_{0}^{\infty} e^{-x^2}dx.$$  I think I should use the claim:     Let $a,b$ two real numbers and $\{f_n\}$ a sequence of continuous functions on $\left[a,b\right]$  which converges uniformly to $f$ on $[a,b]$. Then    $$\lim_{n\to\infty}\int_a^bf_n(t)dt=\int_a^bf(t)dt.$$   But for this, I must prove that $(1-\frac{x^2}{n})^n$ uniformly converges to $e^{-x^2}$.  How do I do that? One of the hardest and trickiest things to do is to prove this uniformly converges.. every function has its own way. I believe that the more examples I'll see the easiest it will be. Thanks again!