Please let us keep the reason for community-deleted posts
Can the system leave a deletion reason when it deletes a question?
How can I find the method that called the current method? When logging in C#, how can I learn the name of the method that called the current method? I know all about System.Reflection.MethodBase.GetCurrentMethod(), but I want to go one step beneath this in the stack trace. I've considered parsing the stack trace, but I am hoping to find a cleaner more explicit way, something like Assembly.GetCallingAssembly() but for methods. So I did a fresh install of Ubuntu 20.04 on a computer with the new RTL8125B Realtek network card and I cannot get the network to work. I was very suprised since this is supposed to be the new feature of the 5.4 kernel (I have 5.4.0-26-generic installed). Does anyone have any idea on how to get it working? Thank you. $ lspci -knn | grep Eth -A3 06:00.0 Ethernet controller [0200]: Realtek Semiconductor Co., Ltd. RTL8125 2.5GbE Controller [10ec:8125] (rev 04) Subsystem: ASUSTeK Computer Inc. RTL8125 2.5GbE Controller [1043:87d7] Kernel modules: r8169 07:00.0 VGA compatible controller [0300]: Advanced Micro Devices, Inc. [AMD/ATI] Ellesmere [Radeon RX 470/480/570/570X/580/580X/590] [1002:67df] (rev e7)  $ dmesg | grep -i r8169 [    0.911236] r8169 0000:06:00.0: unknown chip XID 641 is a simple way to script small GUIs.  Can anyone give a nice example with a button and a text widget. When the button is pressed should a shell command be executed and the output piped to the text widget.  If you have other nice and clean examples for useful tasks, please add them too. Say I have a huge text file (>2GB) and I just want to cat the lines X to Y (e.g. 57890000 to 57890010).  From what I understand I can do this by piping head into tail or viceversa, i.e.   head -A /path/to/file | tail -B   or alternatively  tail -C /path/to/file | head -D   where A,B,C and D can be computed from the number of lines in the file, X and Y.  But there are two problems with this approach:   You have to compute A,B,C and D. The commands could pipe to each other many more lines than I am interested in reading (e.g. if I am reading just a few lines in the middle of a huge file)   Is there a way to have the shell just work with and output the lines I want? (while providing only X and Y)? A result of Stieltjes Integral While studying the Riemann - Stieltjes integral, I read this exercise in my book:  "Let $f:[a, b]\to \mathbb{R}$ be a bounded function. Denoted $L(P, f)$ the lower Darboux sum and $|P|$ the mesh of the partition $P$. Prove that for every $\epsilon&gt;0$, there exists $\delta&gt;0$ such that for every partition $P$ with $|P|&lt;\delta$, we have: $\underline{\int_{a}^{b}}f(x)dx-L(P, f)&lt;\epsilon$."  My question is: Can we generalize this problem for Stieltjes integral, with $\underline{\int_{a}^{b}}f(x)d\alpha$ instead of $\underline{\int_{a}^{b}}f(x)dx$?  Particularly, can we have this theorem?  Let $f:[a, b]\to \mathbb{R}$ be a bounded function and $\alpha$ is a monotonic function on $[a, b]$ . Denoted $L(P, f, \alpha)$ the lower Darboux sum and $|P|$ the mesh of the partition $P$. Prove that for every $\epsilon&gt;0$, there exists $\delta&gt;0$ such that $\underline{\int_{a}^{b}}f(x)d\alpha-L(P, f, \alpha)&lt;\epsilon$ for every partition $P$ with $|P|&lt;\delta$?  I don't know how the mesh of the partition relate to the function $\alpha$. Find count of all combination of numbers whose sum is x What's the difference between executing a script like this:  ./test.sh  and executing a script like this:  . test.sh?  I tried a simple, two-line script to see if I could find if there was a difference:  #!/bin/bash ls   But both . test.sh and ./test.sh returned the same information. add transistor model to LTspice I'm trying to add the mmbt3904lt1g model to LTspice. - I've copied its data from the MMBT3904LT1.LIB.txt in the standard.bjt library. - I've added an NPN to my schematic then I've changed its value to mmbt3904lt1g  - through the Edit->spice directive I've pasted the path to this library I thought it was all to use this device but no simulation is achieved.. I get only: Can't find definition of model "MMBT3904LT1g"  where I'm doing wrong ? How much did the Trade Federation know about their 'lord' at time of blockade? Do you think there is a big difference in for...in and for loops? What kind of "for" do you prefer to use and why?  Let's say we have an array of associative arrays:  var myArray = [{'key': 'value'}, {'key': 'value1'}];   So we can iterate:  for (var i = 0; i &lt; myArray.length; i++)   And:  for (var i in myArray)   I don't see a big difference. Are there any performance issues? On a plane, there are two congruent circles, $O_1, O_2$. One line intersects $O _1$ and A and B and $O_2$ at C and D such that AB=BC=CD=14. Another line intersects $O _1$ and E and F and $O_2$ at G and H such that EF=FG=GH=6. What is the radius of the circle.   The configuration was hard to draw. . You can reflect the lines over the centers, but it is still the same. Cleary, $\widehat{AB}=\widehat{CD}$ and $\widehat{EF}=\widehat{GH}$. I have no idea how to proceed. How to write conditional equations with one-sided curly brackets Problem:  Ajax suggest-search on [n] ingredients in recipes. That is: match recipes against multiple ingredients.  For instance: SELECT Recipes using "flower", "salt" would produce: "Pizza", "Bread", "Saltwater" and so forth.  Tables:  Ingredients [     IngredientsID INT [PK],     IngredientsName VARCHAR ]  Recipes [     RecipesID INT [PK],     RecipesName VARCHAR ]  IngredientsRecipes [     IngredientsRecipesID INT [PK],     IngredientsID INT,     RecipesID INT ]   Query:  SELECT     Recipes.RecipesID,     Recipes.RecipesName,     Ingredients.IngredientsID,     Ingredients.IngredientsName FROM     IngredientsRecipes      INNER JOIN Ingredients     ON IngredientsRecipes.IngredientsID = Ingredients.IngredientsID      INNER JOIN Recipes     ON IngredientsRecipes.RecipesID = Recipes.RecipesID WHERE     Ingredients.IngredientsName IN ('salt', 'water', 'flower')   I am currently constructing my query using ASP.NET C# because of the dynamic nature of the WHERE clause.  I bites that I have to construct the query in my code-layer instead of using a stored procedure/pure SQL, which in theory should be much faster.  Have you guys got any thoughts on how I would move all of the logic from my code-layer to pure SQL, or at least how I can optimize the performance of what I'm doing?  I am thinking along the lines of temporary tables:  Step one: SELECT IngredientsID FROM Ingredients and INSERT INTO temp-table  Step two: SELECT RecipesName FROM Recipes joined with IngredientsRecipes joined with temp-table.IngredientsID I use TeX Live 2010 and my editor is Texmaker Bidi. It was working probably good but from 2 months ago I've encountered with the error:   !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! ! ! Fatal fontspec error: "cannot-use-pdftex" !  ! The fontspec package requires either XeTeX or LuaTeX to function. !  ! You must change your typesetting engine to, e.g., "xelatex" or "lualatex" ! instead of plain "latex" or "pdflatex". !  ! See the fontspec documentation for further information. !  ! For immediate help type H &lt;return&gt;. !...............................................   when I'm trying to load xepersian LaTeX.  but I do not know how can I change pdfLaTeX to XeLaTeX.    This is the second edit of my question .   the code is :    ‎\documentclass{article}‎ ‎\usepackage{pstricks}‎ ‎\usepackage{‎pst‎-‎bezier}‎ ‎‎\usepackage{xepersian}‎  ‎\settextfont{XB Zar}‎  ‎\setlatintextfont{Junicode}‎  ‎\setdigitfont{XB Zar}‎  ‎\begin{document}‎  ‎!‎سلام دنیا‎‎ ‎\begin{pspicture}(‎3‎,3)‎ ‎\psbcurve(1,2)(5,7)(2,2)(12,3)‎ ‎\end{pspicture}‎ ‎ ‎\end{document}   but the output does not include the shapes . Colors from a computer vs. colors from visible spectrum of sunlight Observation:  So, I know that all computer screens are able to project many different colors by varying how they display the RGB (Red, Green, Blue) pixels.  Question  What's the difference between say, yellow light (575 nm) from sunlight vs. the same yellow light that's displayed on the computer screen? Aren't they different? Is our brains mixing together the RGB lights together and its being interpreted as yellow light or is yellow light the same (575 nm) light that comes from sunlight actually hits our eyes?  Relationship between Fourier Series and light?  1) So I know that in Fourier Series, you have basis functions, sines and cosines that make up any other function depending on the coefficients that are in front of the sines and cosines terms.  2) I know that RGB colors on a screen are the "basis" for all the other colors that a computer screen makes up and the intensity of each of the RGB are like the "coefficients". So, am I making the correct relationship here? I'm trying to fix the following TikZ figure, where the circle device in the middle should be embraced by two bended arrows pointing counter-clockwise.    I have drawn these arrows with an arc path, but the tips of the arrows are unexpectedly both pointing upward.  Any idea how to get these arrow tips to follow the direction of the arc?  Here is my code for the above figure:  \documentclass[12pt]{article}  \usepackage{tikz} \usetikzlibrary{arrows} \usetikzlibrary{calc}  \begin{document} \begin{tikzpicture}   \draw (0,0) circle (1cm);   \draw[fill=gray!20]  (23:0.45cm)     -- (23:1cm) arc[radius=1, start angle=23, end angle=-203] (157:1cm)     -- (157:0.45cm) arc[radius=0.45, start angle=157, end angle=23] (23:0.45cm);   \draw[fill] (0,0) circle(2pt);   \draw[-&gt;,&gt;=stealth',semithick] (150:1.2cm) arc[radius=1.2, start angle=150, end angle=210] (210:1.2cm);  \draw[-&gt;,&gt;=stealth',semithick] (-30:1.2cm) arc[radius=1.2, start angle=-30, end angle=30] (30:1.2cm);   \foreach \x/\y in {1/0,2/0,3/0,4/1,5/1,6/1,7/0,0/1}     \node[rotate={\x*45-90}] at ($(0,0)!.75!\x*45:(1,0)$) {\y} ; \end{tikzpicture} \end{document} How can I change Win 10 protected registry entries? Where does the extra kinetic energy of the rocket come from? tikz declare function and babel french option Cardinal number subtraction We all know that $|\mathbb{N}| = \aleph_0$. Since $|\{-1\} \cup \mathbb{N}| = \aleph_0$ as well, I guess you could say that $\aleph_0 + 1 = \aleph_0$.  You can go on to derive that $\aleph_0 + \aleph_0 = \aleph_0$, and by induction $n \times \aleph_0 = \aleph_0$ (assuming that $n$ is finite, anyway).  Now, here's a thing: What is $\aleph_0 - \aleph_0$?  Well, $|\mathbb{P}| = \aleph_0$, and $|\mathbb{P} \backslash \mathbb{N}| = \aleph_0$, so perhaps $\aleph_0 - \aleph_0 = \aleph_0$?  No, wait. Consider the set $S = \{n \in \mathbb{N}: n &gt; 5\}$. Now we have $|S| = \aleph_0$, and yet $|\mathbb{N} \backslash S| = 5$. So maybe $\aleph_0 - \aleph_0 = 5$?  But that is absurd, since we can redefine $S$ to make the result any finite number we wish. Or we can define $S$ such that the result is countably infinite.  Does this mean that the notion of $\aleph_0 - \aleph_0$ simply has no definite answer? Or am I just being too simplistic here?