How do I video screen capture with windows 10?
How to capture a still image from digital video?
While finding escape velocity, does human mass counts as the mass of Earth? Escape velocity depends upon the mass of earth. my doubt is whether human mass adds into it or not? If it add then Earth's escape velocity would be increasing! How do I change how executable files are handled by the file manager? When I double click on text files, nautilus asks me what I would like to do with them. I find this to be intrusive, as I just want them to open.  How can I fix this?  Note: This question is a "canonical" question on the subject; edit if needed. Note 2: Text files can be HTML, CSS, TXT, and more. Background image resize in Ubuntu 18.04.1 LTS Recently updated to 18.04.1 and now I cannot resize my background image from fill screen to center image.  How can I resize the image now that 18 doesnt have the quick resize feature? In Walter Rudin's Principles of mathematical analysis Exercise 5.21, it is proved that for any closed subset $E\subseteq \mathbb{R}$, there exists a smooth function $f$ on $\mathbb{R}$ such that $E=\{x\in \mathbb{R}\mid f(x)=0\}$.   Since $E^c$ is open in $\mathbb{R}$, $E^c$ is a countable disjoint union of open intervals $(a_i,b_i)$. On an interval $(a,b)$, if we let $f(x)=\exp(\frac{1}{(x-a)(x-b)})$, $x\in(a,b)$; $f(x)=0$, $x\notin(a,b)$, ($f(x)=\exp(\frac{1}{(x-a)})$ or $f(x)=\exp(\frac{1}{(x-b)})$ on $(a,\infty)$ and $(-\infty,b)$ resp.), then $f$ is smooth. Hence we can get a smooth function on $\mathbb{R}$ such that $E$ is the zero point sets of $f$.  (1). How about a closed subset $E$ of $\mathbb{R}^n$? is it true that for any closed subset $E\subseteq \mathbb{R}^n$, there exists a smooth function $f$ on $\mathbb{R}^n$ such that $E=\{x\in \mathbb{R}^n\mid f(x)=0\}$?  An open set in $\mathbb{R}^n$ cannot be written as a disjoint union of countable open balls hence the proof above is not valid. The partition of unity only claims that for an  open set $U$, there exists open $V$ in $U$ such that $\bar V\subseteq U$ and a smooth function $f$ on $\mathbb{R}^n$ such that $supp f\subseteq U$, $f|_V=1$.   (2). The taylor series of $f(x)=\exp(\frac{1}{(x-a)(x-b)})$ does not converge around points $a,b$ hence $f$ is not analytic at $a,b$. Is it true that for any closed subset $E\subseteq \mathbb{R}$, there exists an analytic function $f$ on $\mathbb{R}$ such that $E=\{x\in \mathbb{R}\mid f(x)=0\}$? I try to add an item to my sharepoint list from a custom web part. Is there any mistake in my code?  [WebMethod]         public static string AjouterDemande()         {             SPList ListeDemandeConge = SPContext.Current.Site.RootWeb.Lists["DEMANDE CONGÉ"];             SPListItem ListItem = ListeDemandeConge.Items.Add();             ListItem["CODE"] = code;             ListItem["DEMANDEUR"] = Utilisateur.LoginName;             ListItem["DATE DEMANDE"] = DateTime.Today.Date;             ListItem["DATE FIN"] = EndDateD;             ListItem["DATE DEPART"] = StartDateD;             ListItem["DUREE"] = int.Parse(DayCount);             ListItem["PREMIER RESPONSABLE"] = Employe.FirstSuperior.LoginName;             ListItem["DEUXIEME RESPONSABLE"] = Employe.SecondSuperior.LoginName;             ListItem["PRESENCE PRES"] = Boolean.Parse(FirstRespPresent);             ListItem["SOLDE CONGE"] = Conge.SoldeAnneeConge;             ListItem["MOIS"] = int.Parse(StartDateTab[1]);             ListItem["ANNEE"] = int.Parse(StartDateTab[0]);             ListItem["JOURS APPROUVEES"] = 0;             ListItem.Update();             ListeDemandeConge.Update();             return "true";          }   When I use F10 to process debugging step by step and get to my listitem.update(), it went out without giving any error. Distance between surfaces When I log in with LightDM on my laptop running Debian Unstable, it recently started to hang for around 2 minutes until journalctl shows the message kernel: random: crng init done. When I press random keys on my keyboard while it hangs, it logs in faster (around 10 seconds). Before I didn't have this issue, is there any way I can fix it?  Edit: using linux-image-4.15.0-3-amd64 instead of linux-image-4.16.0-1-amd64 works, but I don't want to use an older kernel. Ask question post button remains disabled I've noticed this twice in the last ~2 weeks or so. The &quot;post your question&quot; button can remain disabled for some reason even when your question is shown as &quot;ready to publish&quot;. I.e., you've gotten to the &quot;review&quot; page after the initial edit. If I remember correctly, one case was on Stack Overflow, and the other was on . I'm not sure what exact scenario leads up to this. I haven't paid attention to the button until the last step when I'm ready to click it. The workaround has been to reload the page. (I copied my content for safe-keeping first.) This works, and the button then shows up as active. Afterwards, however, on both occasions, it forced me through the &quot;are you a human&quot; verification.  Update - this question itself did not exhibit this, nor did it do the .  Update - I'm using Chrome on Windows and am not sure what version it was when this happened.  It has  installed, but there aren't any scripts for any Stack Exchange sites.  It has  installed.  The virus scanner on the PC I probably was using was Prevent applications from opening browser Is there a free application out there that will intercept requests from applications to open a URL and prompt me as to whether or not I want the URL to be opened? (For instance, after Adobe Reader installs, it opens its website to get feedback about the install process.)  Ideally, it would be lightweight software for just this task, but if a larger firewall/security app provides this feature, that would be acceptable.  I'm using windows 7 32-bit.  As stating in a comment below, the idea is that you don't want the browser to open (assume it's not already running), so an extension (e.g. for Chrome, ffox) wouldn't be relevant. This question was prompted by . Notoriously, if you calculate the Schwarzschild coordinate time for anything, matter or light, to reach the event horizon the result is infinite. This implies that the universe ages by an infinite time before someone falling into the black hole reaches the event horizon, so could that person see the universe age by an infinite time?  To be more precise, suppose the observer starts falling from rest at time $t = 0$ and some initial distance $r &gt; r_s$. If we wait for some time $T$ then shine a light ray at the falling observer. Will the light ray always reach the falling observer before they cross the event horizon? If not, what is the formula for the longest time $T$ that we can wait and still be sure the ray will catch the observer? If $T$ is not bounded it implies that observer could indeed see the end of the universe.  I can think of a qualitative argument for an upper limit on $T$, but I'm not sure how sound my argument is. The proper time for the observer to fall to the event horizon is finite - call this $\tau$. The proper time for the light ray to reach the horizon is zero, therefore the light ray will reach the observer before they cross the event horizon only if $T &lt; \tau$. Hence $T$ is bounded and the observer won't see the end of the universe.  I think a more rigorous approach would be to determine the equations of motion (in the Schwarzschild coordinates) for the falling observer and the light ray, and then find the condition for the light to reach the falling observer at some distance $\epsilon$ from the event horizon. Then take the limit as $\epsilon \rightarrow 0$. In principle this seems straightforward, but in practice the algebra rapidly defeated me. Even for a light ray the radial distance:time equation isn't closed form (Wolfram claims it needs the $W$ function) and for the falling observer the calculation is even harder. Is there a way to assign a value to a variable, that value which we get in terminal by writing any command?  Example command: sensors  From that we get CPU temperature. How can I assign this value to a temp_cpu variable? of a monic polynomial $f \in \mathbb F\left[x\right]$ in $1$ variable $x$ over a field $\mathbb F$ plays an important role in understanding the structure of finite dimensional $\mathbb F[x]$-modules.  It is an important fact that the characteristic polynomial and the minimal polynomial of $C(f)$ are both equal to $f$. This can be seen quite easily by induction on the degree of $f$.  Does anyone know a different proof of this fact? I would love to see a graph theoretic proof or a non inductive algebraic proof, but I would be happy with anything that makes it seem like more than a coincidence! Evaluating $\int P(\sin x, \cos x) \text{d}x$ .NET Attributes: Why does GetCustomAttributes() make a new attribute instance every time? So I was playing around a little more with attributes in .NET, and realized that every call to Type.GetCustomAttributes() creates a new instance of my attribute. Why is that? I would think that the attribute instance would basically be a singleton-per-MemberInfo, with 1 instance bound to the Type, PropertyInfo, etc...  Here is my test code:  using System;  namespace AttribTest { [AttributeUsage(AttributeTargets.Class)] class MyAttribAttribute : Attribute {     public string Value { get; set; }      public MyAttribAttribute()         : base()     {         Console.WriteLine("Created MyAttrib instance");     } }  [MyAttrib(Value = "SetOnClass")] class MyClass { }  class Program {     static void Main(string[] args)     {         Console.WriteLine("Getting attributes for MyClass.");         object[] a = typeof(MyClass).GetCustomAttributes(false);         ((MyAttribAttribute)a[0]).Value = "a1";          Console.WriteLine("Getting attributes for MyClass.");         a = typeof(MyClass).GetCustomAttributes(false);         Console.WriteLine(((MyAttribAttribute)a[0]).Value);          Console.ReadKey();     } } }   Now if I were to implement attributes, I would expect the output to be:  Created MyAttrib instance Getting attributes for MyClass. Getting attributes for MyClass. a1   Where the "class loader" (sorry, I have more of a Java background, not 100% sure how .net loads its types) would compile MyClass, and create an instance of MyAttribAttribute, and store them together somewhere. (probably the Perm Gen in the heap if this were Java) The 2 calls to GetCustomAttributes() would then just return the same earlier created instance.  But the actual output is:  Getting attributes for MyClass. Created MyAttrib instance Getting attributes for MyClass. Created MyAttrib instance SetOnClass   So... why? It seems like creating a new instance of all these objects for every call is a bit excessive, and not good for performance/memory management.  Is there any way to always get the same instance over and over?  Anyone have any ideas why it was designed this way?  The reason I care at all is because I made a custom attribute that internally holds some validation information, so in the Attribute I basically have a "private bool Validated" that I set to true. The validation stuff takes a while, so I don't want to run it every time. Now the problem is that since it creates a new instance of the attribute each time I get the attributes, Validated is always "false". Journey Builder: Error binding data bound member How do I close a connection early? How do I get my arrow keys working in the at> prompt "May I go to the bathroom?" and "I asked if I might go to the bathroom."   The modal auxiliary 'may/might' is used to ask permission.     "He may not have understood your question." and "He might not have understood your question."   The same modal auxiliary is used for uncertainty.  Why? Combinatorics Distribution - Number of integer solutions Concept Explanation I reading my textbook and I don't understand the concept of distributions or number of solutions to an equation.  It's explained that this problem is 1/4 types of sampling/distributions problems.  An example is provided to illustrate:     In how many ways can 4 identical jobs (indistinguishable balls) be distributed among 26 members (urns) without exclusion (since one member can do multiple jobs)?      A sample outcome might be:   $\text{_____________}$   |  A  |  B  |  C  |...|  Z  |    $\text{--------------------}$      $\text{_____________}$   |  o  | oo|    |   |    ||| o  |    $\text{_____________}$   |  A  |  B  |  C  |...  |  Z  |    $\text{--------------------}$      Thus, the question is reduced to, "How many $(26-1+4)$ letter words are there consisting of four circles and $(26-1)$ vertical lines?"  Therefore, the solution is:  $\binom{26-1+4}{4}$   I really don't understand why its $(26-1+4)$.  There's only 26 different spots or "urns" to place the 4 jobs.  Can someone please explain?    I looked through another text to try and understand and I found it explained as such:       There are $\binom{n+r-1}{r-1}$ distinct nonnegative integer valued vectors $(x_1,...,x_r$ satisfying the equation $(x_1 + ... + x_r = x_n$ for $x\ge0$. $\spadesuit$   How in the world are they deriving this?  For distinct positive integers I understand:  Assume I have 8 balls (n=8) and I have 3 urns (r=3): o^o^o^o^o^o^o^o, where o represents  a ball and ^ represents a place holder where an urn could be placed.  For this scenario:     There are $\binom{n-1}{r-1}$ distinct positive integer valued vectors $(x_1,...,x_n)$ satisfying the equation:  $x_1 + ... + x_n = n, x_i&gt;0, i=1,..,r$ $\clubsuit$   It's clear that I could have this specific case ooo|ooo|oo.  Here the bar represents a divide for the urn and you see I have 3 sections.  So that case is clear.  Can anyone please explain this problem to me?  I don't understand the nonnegative integer case.   Also, people who post tend to be crazy smart and explain things very in a complicated manner.  I'd appreciate it if it could be explained in layman's terms as much as possible.   Thank you!!! Windows 8.1 missing font files after restart