A user is receiving "a potentially dangerous request.form value was detected" error message when trying to log in. I set validateRequest="false" in the logon.aspx page as well as the following in the "location" of web.config:  &lt;location path="~/Account/Logon.aspx"&gt;     &lt;system.web&gt;       &lt;pages validateRequest="false" /&gt;       &lt;httpRuntime requestValidationMode="2.0" /&gt;       &lt;authorization&gt;         &lt;allow users="?" /&gt;       &lt;/authorization&gt;     &lt;/system.web&gt;   &lt;/location&gt;   User still getting the error message. I askded what special characters he has in his password and he has "&amp;", "#" and "(", none of which should generate this error (I have # and * in mine). Is there anything else I can try?  Almost all suggestions to fix this issue, including those at this site, recommend the use of "validaterequest=false" which does not seem to help.
Every time a user posts something containing &lt; or &gt; in a page in my web application, I get this exception thrown.  I don't want to go into the discussion about the smartness of throwing an exception or crashing an entire web application because somebody entered a character in a text box, but I am looking for an elegant way to handle this.  Trapping the exception and showing     An error has occurred please go back and re-type your entire form again, but this time please do not use &lt;   doesn't seem professional enough to me.  Disabling post validation (validateRequest="false") will definitely avoid this error, but it will leave the page vulnerable to a number of attacks.  Ideally: When a post back occurs containing HTML restricted characters, that posted value in the Form collection will be automatically HTML encoded. So the .Text property of my text-box will be something &amp; lt; html &amp; gt;  Is there a way I can do this from a handler?
I'm heading to India next week and have a connection in Munich, Germany. I made the mistake of booking a flight with only an hour and a half layover (freaking out!) and I'm wondering if I'll have to go through customs in Munich or if I can pass right on through. ToC numbering problem My furnace pilot light keeps going out so I changed the thermocouple. Now the furnace will come on and heat up to the degree set on my thermostat, then the pilot light will go out and the furnace will not come back on.    Could the thermostat be bad and cause the pilot light to go out? Scamming a scammer? I have seen many questions like:      My question is: what happens if you receive this money (without doing anything or giving your bank account number) but do not do anything scammer wants?  I especially want to know about what happens with the money you got and possible legal consequences.    Is it considered yours because scammer transfered it to you? Do you have to return it? If yes, to whom and in what form? And finally, how is it that scammers are just sending money to random people? Aren't they scared that someone will simply not return it? I understand that this may be stolen money, but it surely took some effort (cash/time) to "acquire" it, so why are they just sending it away? I am currently using Sheep It! to render my blend (built on v2.68c) on multiple computers, and I noticed something rather strange. According to the log on-site, the frames rendered from other people's blends were completing in 3 to 4 minutes. This was on an 4 core i5. My main rig (with an 8 core i7) was completing frames in no less than half an hour. How is this possible?  To clarify, these people's frames are very complex, often with very detailed textures. I have 2 objects in my blend. Below are the options I changed for my blend:   Aspect Ratio: 1000px x 1000px Output: PNG Clamp Indirect: 0.98 Render Sampling: 128 Min Light Bounces: 0 Max Light Bounces: 4 Cycles Render   Is there something in there that I should change to make it go faster? I can't really comprehend how it's going to quickly.  EDIT: To answer what @Duarte asked...   System Specs: i7-920, 3GB DDR3, GT 630, Windows 10 I have two circles, extended to form a sort of coin with a star on it. It is not complex at all. I have Firefox and Steam running in the background, but not actively. I've been away from the computer for 8 hours and noticed this behavior. (I am running Blender from Steam.) I made sure when I began rendering that the blend was set for CPU rendering.          And to answer what @pycoder asked, yes, I am using Cycles Render. showing $\psi: R\to \mathbb C$ is ring isomorphism. I want to learn Linux Kernel and I've downloaded the latest kernel version. Now I want to configure Linux with make menuconfig and I'm receiving an error:     Arch/x86/Makefile:184  Compiler lacks asm-goto support...   Can somebody help me? How can I run ssh-add automatically, without a password prompt? Is it possible to serialize and deserialize a class in C++? Say I have a code to draw a flow chart, I want now a arrow from node 3 to node 1, how can I do that?  1&lt;--| |   | 2   | |   | 3----   MWE  \documentclass[class=article,border=0pt]{standalone}  \usepackage{tikz} \usetikzlibrary{shapes,arrows}  % Define block styles \tikzset{     block/.style={rectangle, draw, line width=0.5mm, black, text width=5em, text centered,                   rounded corners, minimum height=2em},     line/.style={draw, -latex} }% &lt;- if you insist in using this in the document add this % here. \begin{document} \begin{tikzpicture}[node distance = 1cm, auto]     % Place nodes     \node [block] (BLOCK1) {a};     \node [block, below of=BLOCK1] (BLOCK2) {b};     \node [block, below of=BLOCK2, node distance=1cm] (BLOCK3) {c};     % Draw edges     \path [line] (BLOCK1) -- (BLOCK2);     \path [line] (BLOCK2) -- (BLOCK3); \end{tikzpicture} \end{document} Is it ok to leave a slow cooker unattended? Prove that if W is a subspace of a finite dimensional vector space V, then dim(W) ≤ dim(V). My attempt at a solution:  Proof  Given a vector space $V$, let $S={v_1,...,v_n}$ be a basis for $V$. Consequently $\dim(V)=n$. Now given $W$, a subspace of $V$, it will be shown that $\dim(W)\le \dim V$   First, consider the case where $W=${0}. Then $dim(W)=0 \le\ n$,   Subsequently, consider the case for $W=V$. Then it follows that $dim(W)=dim(V)=n$.  Finally, consider the case where $W \subset V$ and without loss of generality assume $v_n \notin W$. Let $T={v_1,...,v_k}$ where $k\lt n$ be a basis for the subspace W. Now, since S is a basis for V, for every $v_i \in S$,  $c_1v_1+...+c_nv_n=0$ has only the trivial solution, thus none of the vectors in S can be expressed as linear combinations of the other vectors in S. It follows that the set T is not a basis for V as $v_n$ cannot be generated from T. The $dim(W)$ is given by the number of vectors in the basis. Therefore, $dim(W)=k \lt n$  Therefore, it has been shown that if $W \subseteq V$ then $dim(W) \le dim(V)$ Find $cot\space x_n$ if $sin(x_{n+1}-x_n)+2^{-(n+1)}sin\space x_nsin \space x_{n+1}=0$ for $n\ge1$ Also Given     Suppose $x_1=tan^{-1}2&gt;x_2&gt;x_3&gt;......$ are positive real numbers   I cannot understand as to how I should approach but I have a hunch which is a bit hand-wavy way to prove it but tried to show that  $lim_{n \to \infty}x_n =\dfrac{\pi}{4}$ (For the proof see my edits in @hypernova's answer)  But can anybody prove it and then use it to find $cot \space x_n$ please? Why does this not work with an imaginary exponent? Could someone please tell me why this exponentiation rule does not work when the exponent is imaginary?  The following seems to be true but is only true if $x$ is an integer.  $$e^{2\pi ix} = \left( e^{2\pi i} \right)^x = 1^x = 1$$ As a mod when should I vote to close content that is not flagged? I know mods are supposed to step in to quickly close seriously problematic posts and otherwise allow the community to vote to close a post.  But what about when there are four close votes on a question, and I personally feel the question should be closed but isn't worthy of mod super-mega closing? Should I cast the final vote like a normal user (even though it's technically binding) or should I sit back and wait  for the community?  For me the problem is complicated because on UX.SE we hover close to the point where there's not enough high-rep activity to quickly close posts and I was one of those high rep users that used to VtC.  Should I always treat my mod close vote as binding and reserve it for extreme situations, or should I treat my close vote as "normal" when it's the fifth and final vote anyway? How can I execute `date` inside of a cron tab job? I'm trying to prove that every finite Boolean ring, $R$, is isomorphic to a finite number of copies of $\mathbb{Z} / 2 \mathbb{Z}$:  \begin{align} R \cong \mathbb{Z} / 2 \mathbb{Z} \; \times \cdots \; \times \; \mathbb{Z} / 2 \mathbb{Z} \end{align}  I'm aware that there are answers to this question on this website. However, almost all of the answers seem to use facts about modules and vector spaces defined over fields. This question is posed in section 7.6 in Dummit and Foote's Abstract Algebra. This section is part of the chapters which introduces the basics of ring theory (rings, homomorphisms, ideals, Chinese Remainder Theorem etc.).  I'm not even sure how to being answering this question. I know that if $R$ were an integral domain, then we would have that $R \cong \mathbb{Z} / 2 \mathbb{Z} $.   Please only give hints, considering that that the statement has to be proved using the material only included up till chapters 9 in the textbook. Which wire is negative on this PC fan? I just got this PC fan and it has a 3 pin connector, I know the wire with the white stripe is positive but how can I find out which of the other two wires are negative?  If you can't see the photo, here is a link to it: Probability of lim sup, lim inf for sequence of random variables. Maybe this is extremely simple, but i havent found a specific answer for this online.  For a sequence of independent continuous random variables $X_n$ ,$n=1,2,3,...$ , all with the same probability density function $f(x)&gt;0$ for all real $x$, and a specific real number $b$, what do the following events mean in simple terms and what is the probability of each?  a)$\lim_n\sup\{X_n \gt b\}$ b)$\lim_n\inf\{X_n \gt b\}$ c)$\lim_n\sup\{X_n \le b\}$ d)$\lim_n\inf\{X_n \le b\}$ Can we have cross-site badges?