Phishing warning with Chrome about answer.
Chrome phishing warning on main
I have IIS7 on my computer, and I can access it through other computers in my house on the same network through my computer's IP address - 192.168.1.10x  Instead of typing in http : //192.168.1.10x/ I want to be able to go to http : //somename/  I know you can change the hosts file to add it but I'd have to do that on each computer and I'd still have to type in the IP to access it from my iPod/Wii... etc. How to make a "reflective tape" material in cycles? How can I make a cycles material that gets very bright when a light is shown on it, yet still has normal colors? I'm talking about the "" that can be seen on road signs, the tape on big trucks (like in the image below), traffic barricades and clothing.  Image by TollGroup on    This reflective stuff has a interesting property where the colors show up perfectly well, but when exposed to a light source they seem to reflect much more light the normal.  has lots of good reference images.  I have tried different combinations of glossy and diffuse shaders, but none work as I have yet to get the super bright reflections.  How can cycles make a material that reflects so much light, and keeps the colors correct? Background:   Story: A colleague of mine told me about  and it seems good to me. I am always trying to use tools which Mac OS X itself gives me, so I've given the Keychain a try. It seems satisfying, but I don't know how to tell Google Chrome to use my specific keychain. I need it to separate saved stuff for work and for private (syncing private to work, but separated from work data).  Stuff:   Google Chrome 21.0.1180.57 (Fully updated) Mac OS X Lion (Fully updated) OS X Mountain Lion (Fully updated)   Question:  How do I tell to Chrome to use a specific keychain and to save data from/to this keychain? Two blue arrows at top right of icons For the ring $\Bbb{Z}[\sqrt{d}]=\{a+b\sqrt{d}\mid a,b \in \Bbb{Z}\}$ where $d$ is not divisible by the square of a prime, prove that the norm $N(a+b\sqrt{d})= |a^2-db^2|$ satisfies the assertions: $N(x)=0$ if and only if $x=0$; $N(xy)=N(x)N(y)$ for all $x$ and $y$; $x$ is a unit if and only if $N(x)=1$; and if $N(x)$ is prime, then $x$ is irreducible in $\Bbb{Z}[\sqrt{d}]$. How to select a value from a list with non-uniform probabilities? How can I extract a predetermined range of lines from a text file on Unix? I have a ~23000 line SQL dump containing several databases worth of data. I need to extract a certain section of this file (i.e. the data for a single database) and place it in a new file. I know both the start and end line numbers of the data that I want.  Does anyone know a Unix command (or series of commands) to extract all lines from a file between say line 16224 and 16482 and then redirect them into a new file? What is necessary and/or sufficient for polynomials to provide isomorphic quotient rings? Ratio of Boys and Girls In a country where everyone wants a boy, each family continues having babies till they have a boy. After some time, what is the proportion of boys to girls in the country? (Assuming probability of having a boy or a girl is the same) Suppose that:  $0 \rightarrow M_{1} \rightarrow M \rightarrow M_{2} \rightarrow 0$  Is an exact sequence of $R$-modules (for $R$ commutative integral domain). Show that $\mathrm{rk}(M) = \mathrm{rk}(M_{1})+\mathrm{rk}(M_{2})$    I have shown the inequality $\mathrm{rk}(M) \geq \mathrm{rk}(M_{1})+\mathrm{rk}(M_{2})$, however for the opposite direction I'm lost. I tried to take $N$ as a linear independent subset and tried to decompose it into $N_{1}$ (the elements in $\mathrm{Ker}(g)$) and $N_{2}$ (the elements not in $\mathrm{Ker}(g)$), but I haven't got far, since $N_{1}$ gives us a linearly independent set in $M_{1}$, however $N_{2}$ can give us a linearly dependent set in $M_{2}$.   We define $\mathrm{rk}(M)$ in this case as the supremum over all cardinalities of the linearly independent subsets of $M$ (where the only finite linear combination equaling $0$ implies trivial coefficients for $r \in R$).  Would this be the proper way to show the result? I think I'm missing something important. string str1 = "12345ABC...\\...ABC100000";   // Hypothetically huge string of 100000 + Unicode Chars  str1 = str1.Replace("1", string.Empty);  str1 = str1.Replace("22", string.Empty);  str1 = str1.Replace("656", string.Empty);  str1 = str1.Replace("77ABC", string.Empty);   // ...  this replace anti-pattern might happen with upto 50 consecutive lines of code.   str1 = str1.Replace("ABCDEFGHIJD", string.Empty);   I have inherited some code that does the same as the snippet above. It takes a huge string and replaces (removes) constant smaller strings from the large string.  I believe this is a very memory intensive process given that new large immutable strings are being allocated in memory for each replace, awaiting death via the GC.  1. What is the fastest way of replacing these values, ignoring memory concerns?  2. What is the most memory efficient way of achieving the same result?  I am hoping that these are the same answer!  Practical solutions that fit somewhere in between these goals are also appreciated.  Assumptions:    All replacements are constant and known in advance Underlying characters do contain some unicode [non-ascii] chars FireFox 66 Quantum disabled all my extensions at midnight! RAII and smart pointers in C++ In practice with C++, what is , what are , how are these implemented in a program and what are the benefits of using RAII with smart pointers? Stripped out bottom bracket I'm on Ubuntu 16.04.1 at the moment, and system windows like the Files window, Terminal or System Software open behind the Unity launcher, which means they are partially hidden behind it. I can move them with Alt+F7, but I'd like a more permanent solution to this problem. Feature request: Add pronouns to usercards? One of the questions people have raised about the new rules about pronouns is how users will know what pronouns are preferred.   We've had a trolling question which got  when the user included their preferred pronouns at the bottom of the question, and I agree that particularly on Stackoverflow (rather than sites like Interpersonal Skills or Workplace), this should be considered as 'noise' since it isn't the strict Q&amp;A this site is about. (The codez should work whatever your gender).  Currently, the suggested way of displaying your pronouns is to put it in your profile's 'About Me' section. However, this is suboptimal, since it requires opening a new page.  I suggest adding a 'preferred pronouns' field in the user profile, and displaying this on a user's usercard. There's currently a 'new contributor' label, so it could be similar to that, with she/her pronouns or whatever they choose.  In comments, it could be appended to the reputation score that currently gets shown when you hover over a name:   4,305 reputation, she/her pronouns  The default would be blank. No flair updates, no hover-in-comments update. If a user fills in this field in their profile, then it will show. How to copy some, but not all files? So, you can use the * as a wild card for all files when using cp within context of a directory.  Is there a way to copy all files except x file? So I've been trying to figure out how to prove the following.     Let $(a_n)$ be a sequence of positive numbers such that $\sum\limits_{n=1}^\infty a_n =\infty$, and define $s_n=\sum\limits_{i=1}^n a_i$. Then $\sum\limits_{n=1}^\infty\frac{a_n}{s_n} =\infty$ as well.   I can prove it by comparing it to $\int_1^\infty \frac{1}{x} \, dx $ if the sequence $a_n$ is bounded by some $M$, but that's as far as I've been able to get. How to compute $k$'th roots $\!\bmod n$? I have the following equation: $$ n \equiv M^k\mod(b) $$ where n, a, b are integers, and M is unknown. How do I solve this equation to find the M value? Those a and b are public keys of the RSA algorithm and n is the result of encryption. I need to find the encrypted message. When to use an offset in a Poisson regression?