I use Avast Web Shield, and it intercepts TLS traffic from the browser using the env variable: SSLKEYLOGFILE  \\.\aswMonFltProxy\FFFFDE812B3DD840 While I don't actually mind that it does this, and I understand why it does so, I got curious as to what this &quot;path&quot; actually points to. My first thought is this is either some kind of Netbios address or a socket connection, but I really have no idea. Does anyone have any idea what this kind of &quot;path&quot; is and if it's actually mappable to a physical file on the disk or maybe in memory?
I'm wondering about the period character . used as a shortcut for the local computer name.  You can use it when logging into Windows 7, for example, to specify that the user account you're entering belongs to the local computer rather than to a domain:  .\MyLocalUserAccount   And you can use it within a Windows Management Instrumentation (WMI) query to indicate that the target is the local computer rather than a remote computer.  You can also use it when working with named pipes to for similar purposes.  However, you cannot use it as the UNC network name for the computer, like this:  \\.\MyShare   Does this character have an official name (e.g. "LocalHostToken") and when and where can it be used for this purpose?
What would you call a word that doesn't exist in or translate well into another language? I've run into this situation several times, being a native Spanish speaker.   There are some words you just can't translate into another language. Is there a particular word to describe this?  I'm not refering to idioms.  Also, if its a noun, people tend to use them by surrounding them in quotes. Is this appropiate?  Example:     I arrived at around 5 pm and had some quesadillas.   Edit:  I also meant to cover words that exist in English, but cannot be translated into another language.   Example:      There isn't a word for "drive-thru" in your language. I'm curious to know how important the bias node is for the effectiveness of modern neural networks. I can easily understand that it can be important in a shallow network with only a few input variables. However, modern neural nets such as in deep learning often have a large number of input variables to decide whether a certain neuron is triggered. Would simply removing them from, e.g., LeNet5 or ImageNet have any real impact at all? Number of connected components of the complement of a compact Let $X$ be a connected, locally compact space and let $K$ be a compact subset of $X$. Is the number of connected components of the complement $X\setminus K$ finite? If it is not, are there some hypotheses over $X$ for finiteness of connected components? Given $f_{n} : [a,b]\rightarrow \mathbb R$ is uniformly Lipschitz and $f_{n}\rightarrow f$, how can I show that $f$ is Lipschitz?  $f_{n}$ is uniformly Lipschitz $\leftrightarrow \exists K &gt; 0$ such that for all $n$ and for every $x,y\in [a,b]$ we have $|f_{n}(x)-f_{n}(y)| &lt; K|x-y|$.  $f_{n}\rightarrow f \leftrightarrow \forall~\epsilon&gt;0~~\exists~N$ such that $\forall~n&gt;N$ we have $\mid f_{n}(x) - f(x)\mid&lt;\epsilon~~~(=\mid x-y\mid?)$  Then we have  \begin{align} |f(x)-f(y)| &amp;\leq |f(x)- f_{n}(x)| + |f_{n}(y)-f(y)| + |f_{n}(x)-f_{n}(y)| \\ &amp;\leq |x-y| + |x-y| + K|x-y| \\ &amp;\leq (K + 2) |x - y| \end{align}  which shows that $f$ is Lipschitz. Can anybody tell me if this makes sense? Sorry if layout is poor. How to represent a list as a cycle I want to collect the most common mistakes, misconceptions, pitfalls, etc that (La)TeX and Friends users make. Please one answer for each mistake, misconception, pitfall, etc.  I am only interested in more technical, objective cases rather than psychological, social, subjective cases.  From this complete infinite list of technical and objective cases, we can have a reference how  to teach newbies much better directly or indirectly via writing a good book.  The technical and object cases are, for example, as follows.   Beginners sometimes use $\huge E=mc^2$ with the hope they will get a huge formula. It actually does not produce the expected result. The correct way is \huge $E=mc^2$. Beginner sometimes use longtable inside table because they assume longtable is the longer version of tabular which is able to be sandwiched in table. etc. How to cluster time series? I have a question about cluster analysis. There are 3000 companies, which have to be clustered according to their power usage over 5 years. Each company has values for every hour during 5 years. I would like to find out if some companies have the same pattern in usage power over the time period. The results should be used for daily prediction of power usage. If you have some ideas how to cluster time series in SPSS, please share with me. JavaScript variable definition: Commas vs. Semicolons All html canvas shapes are given the color of the last object added I found some articles related to this, but they were not sufficient for me. I want to know how the localhost works and why is it the same on many different machines?   How does the localhost block the access to the website when we use it in the host file to block the website? Would like to emulate google maps' driving directions functionality but use pgRouting instead. google's data over the project area &amp; scale is quite a bit off so we want to use our own transport network data in postGIS.  any hints?  thanks. I have my A* pathfinding algorithm right now working such that given a graph it can find the route from one starting node to one goal node.   This works well for many problems, but sometimes I find that multiple goal nodes are valid.  For example, in a game, an NPC might have to go to a switch to shut a door. If there are multiple switches that shut the door in question, it doesn't matter which switch it goes to - it just needs to go to one of them.  How can I augment my pathfinding algorithm to find the path to the best goal (the shortest path)? As in, the algorithm searches for multiple goals and when it finds just one, it returns the path to that one.  One solution would be to run the algorithm as many times as there are valid goals, but you can guess why that might be inefficient. An insurance company supposes that the number of accidents that each of its policyholders will have this year is Poisson distributed, with a mean depending on the policyholder: the Poisson mean Λ of a randomly chosen person has a Gamma distribution with the Γ(2, 1)-density function fΛ(λ) = λe−λ (λ > 0). Find the expected value of Λ for a policyholder having x accidents this year (x = 0, 1, 2, . . .).  I am not sure how to incorporate the gamma parameters. So far I have found P(X = n|Λ = λ) = Poisson(λ) and fΛ(λ)= Exp(λ) so by integrating P(X = n|Λ = λ)fΛ(λ) then letting the integral of Gamma (n + 2, 2) equate to 1, I have worked out P(X = n) = (n + 1)/2^(n+2). How do you find the expected value of Λ from that? I have seen that a Gamma-Poison mix has E(X) = αβ which would give 2 but I have tried integrating fΛ(λ) and can't seem to get 2. How can I change what keys on my keyboard do? (How can I create custom keyboard commands/shortcuts?) I want to change the key bindings on some of the keys on my keyboard.  I want some to run commands and others to activate different keys.  What applications can I use to do this?      Index:       (from within System Settings)             I'm still looking for answers using dconf and any other method. Trig sum: $\tan ^21^\circ+\tan ^22^\circ+\cdots+\tan^2 89^\circ = \text{?}$ As the title suggests, I'm trying to find the sum $$\tan^21^\circ+\tan^2 2^\circ+\cdots+\tan^2 89^\circ$$ I'm looking for a solution that doesn't involve complex numbers, or any other advanced branch in maths. The solution can involve techniques such as induction, telecoping, etc, but preferably only ideas from precalculus, e.g. trig identities, polynomials, etc.  EDIT: I know that the sum is a rational number. I want to work with unsigned 8-bit variables in C++.  Either unsigned char or uint8_t do the trick as far as the arithmetic is concerned (which is expected, since AFAIK uint8_t is just an alias for unsigned char, or so the debugger presents it.  The problem is that if I print out the variables using ostream in C++ it treats it as char.  If I have:  unsigned char a = 0; unsigned char b = 0xff; cout &lt;&lt; "a is " &lt;&lt; hex &lt;&lt; a &lt;&lt;"; b is " &lt;&lt; hex &lt;&lt; b &lt;&lt; endl;   then the output is:  a is ^@; b is 377   instead of   a is 0; b is ff   I tried using uint8_t, but as I mentioned before, that's typedef'ed to unsigned char, so it does the same.  How can I print my variables correctly?  Edit: I do this in many places throughout my code.  Is there any way I can do this without casting to int each time I want to print? Describing integral closure of quadratic number fields I'm facing the following problem.      Let $p$ be a prime and $ K=\mathbb{Q}(\sqrt{p}) $. I'm trying to find the integral closure of $ \mathbb{Z} $ in $ K $.   I don't really know where to start. I've managed to prove that $ \mathbb{Z}[\sqrt{p}] $ is in the integral closure and I'm almost sure $ \mathbb{Q} $ is not.   I can't think of a systematic way to approach this. I would appreciate any help. How do you select a particular option in a SELECT element in jQuery? What's the best way to communicate between view controllers? Proving $M_n(I)\lhd M_n(R)$ and proofs about ideal rings. I'm trying to do a few proofs about rings: $(1)$ I want to show that for a ring $R$ and the ring of matrices $M_n(R)$, if $I\lhd R\implies M_n(I)\lhd M_n(R)$ and that all ideals of $M_n(R)$ are of the form $M_n(I)$. $(2)$ Prove that if $R$ is a ring with division then $M_n(R)$ is a simple ring.  The relation $I\lhd R$ implies that with $r\in R$ and $x\in I$ we have $rx\in I, xr\in I$. But how can I prove the statement for matrices?, here's what I would do: Consider $\psi \in M_n(R)$, if is given any matrix $\phi\in M_n(I)$ it must be $\psi \phi \in M_n(I),\phi \psi \in M_n(I)$, if we denote the element $(i,j)$ of each matrix by $\phi_{ij}$ and $\psi_{ij}$, then $(\psi \phi)_{ij}=\sum_{k=1}^n \psi_{ik}\phi_{kj}$ and $(\phi \psi)_{ij}=\sum_{k=1}^n \phi_{ik}\psi_{kj}$.  Since $I\lhd R$ is $\psi_{ik}\phi_{kj}\in I$ and $\phi_{ik}\psi_{kj}\in I$, which means that $I\lhd R\implies M_n(I)\lhd M_n(R)$.  To show that every ideal of $M_n(R)$ are of the form $M_n(I)$ with $I$ ideal: Suppose $I$ is not an ideal of $R$, then exists $r\in R$ such that $rx\notin I$ or $xr\notin I$, then with taking a matrix $\phi\in M_n(I)$ such that $x$ is an entry of $\phi$ and a matrix $\psi$ such that $r$ is an entry of $\psi$ we get that the matrices $\phi$ and $\psi$ have an entry $xr$ or $rx$, in either case this is not an element of $I$ then the matrix is not in $M_n(I)$. This concludes my proof (is it?) for $(1)$.  For $(2)$ I'd like to proceed by absurdum . Let's say that $M_n(R)$ is not a simple ring, then it has at least one ideal. Denote by $\varphi$ this ideal in $I$, then for any matrix $\psi$ we have $\varphi\psi \in M_n(I)$ and $\psi \varphi \in M_n(I)$.  Now, can $R$ be a ring with division?.I'm not sure how to prove that it can't. I believe I could use this theorem: "If $I\lhd R$ and $1\in I$ then $I=R$. The case $I\neq R$ implies $1\neq R$ and since $\varphi \psi$ and $\psi \varphi$ are in $M_n(I)$ then there are at entries in the product matrix which belong to $I$ (using $I \lhd R$) but are not $1$ (1\notin I); then there are elements in $I$ (and therefore in $R$ by $I\subset R$) that are not invertible, follows that $R$ is not a ring with division. But if $I=R$?, here I can't see a why $R$ can't be a ring with division.