python failure on output redirect/pipe
Setting the correct encoding when piping stdout in Python
What's the difference between $\equiv$ and $\leftrightarrow$ in a formal proof? Group Membership Test for Permutations How do I check if an element is really visible with JavaScript? In JavaScript, how would you check if an element is actually visible?  I don't just mean checking the visibility and display attributes. I mean, checking that the element is not   visibility: hidden or display: none underneath another element scrolled off the edge of the screen   For technical reasons I can't include any scripts. I can however use  as it is on the page already. Recalculating full extent of File Geodatabase feature class? Splitting lines by polygons in QGIS I have a river network (lines) and a .shp with states (polygon). I would like to split the lines at the state boundaries i.e. split lines by polygon boundaries. Is there a geoprocessing tool to do this in QGIS? I can't merge the lines by the way, since they are meaningfully split into tributaries/main river. Proximal Operator Fixed Point Property for Matrices $\newcommand{\prox}{\operatorname{prox}}$ $\newcommand{\argmin}{\operatorname{argmin}}$ $\newcommand{\dom}{\operatorname{dom}}$  Recall again that the proximal operator for vectors $\prox_{f}: R^n \rightarrow R^n$ of $f$ is defined as:  $\prox_f(v) := \argmin_{x} \left(f(x) +(1/2)\|x-v\|_2^2 \right) $,  where $f: R^n \rightarrow R \cup \infty$ is a closed proper convex function and $\|\cdot \|_2$ is the Euclidean norm. $\prox$ is strongly convex and not everywhere infinite, so there it will have a unique minimizer for every $v \in R^n$  The crucial property of proximal operator is that $x^*$ minimizes $f(x)$ iff $x^* = \prox_f(x^*)$, i.e. $x^*$ is a fixed point of $\prox_f$.  Let us consider the proof of this property. The first part, namely, that if $x^*$ minimizes $f$ then $\prox_f(x^*)=x^*$, is trivial:  $f(x) +(1/2)\|x-x^*\|_2^2 \le f(x^*) = f(x^*) +(1/2)\|x^*-x^*\|_2^2$  The second part uses the notion of subdifferential. In the proof authors say that $\tilde{x}$ minimizes  $f(x) +(1/2)\|x-v\|_2^2$  i.e. $\tilde{x} = \prox_f(v)$ iff $0 \in \partial f(\tilde{x}) + (\tilde{x}-v)$,   where the sum is of a set and a point. Recall the definition of the subdifferential:  $\partial f(x) = \{ y$ |  $ f(z)\le f(x) + y^T(z-x)$ $\forall z \in \dom{f}\}$  Take $\tilde{x}=v=x^*$, it follows that $0 \in \partial f(x^*)$ so $x^*$ minimizes $f$.  Question 1:  Consider proximal operator defined for matrices now:  $\prox_f(Y) := \argmin_{X} \left(f(X) +(1/2)\|X-Y\|^2 \right)$,  where $X$ is some real $m$ by $n$ matrix. What norm function should be taken in the definition of the $\prox$ in this case? Frobenius? Or spectral norm (induced 2nd norm) which is the largest eigenvalue (is spectral norm even differentiable?)? Or something else?  Question 2:   Can the norm for the definition of $\prox$ in case of matrices be chosen in different ways? What conditions does the proof above impose on the norm function? Find equation of a plane that passes through point and contains the intersection line of 2 other planes Find equation of a plane that passes through point P $(-1,4,2)$ that contains the intersection line of the planes  $$\begin{align*} 4x-y+z-2&amp;=0\\ 2x+y-2z-3&amp;=0 \end{align*}$$  Attempt: I found the the direction vector of the intersection line by taking the cross product of vectors normal to the known planes. I got $\langle 1,10,6\rangle$. Now, I need to find a vector normal to the plane I am looking for. To do that I need one more point on that plane. So how do I proceed? If $E[X|Y]=Y$ almost surely and $E[Y|X]=X$ almost surely then $X=Y$ almost surely Is it possible to include one CSS file in another? Is it possible to include one CSS file in another? Proof by induction of summation inequality: $1+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\dots+\frac1{2^n}\ge 1+\frac{n}2$ Using global variables in a function Did Luke attempt to retake the Jedi Temple on Coruscant? After the New Republic gains control of Coruscant through the Galactic Concordance, did Luke Skywalker attempt to reclaim (or even visit) the former and still very much intact Jedi Temple, now converted to be the deceased Emperor's palace?   If Luke is so insistent on saving a tree just because it belongs to the Jedi and the Empire stole it, then shouldn't reclaiming the Jedi Temple be even higher priority?  If he did, is he aware of the Sith shrine beneath it? Which is something even Yoda does not know. And if he didn't, why didn't he? Highlight tags corresponding to our favorites Each of us have our list of favorite tags.  When a question has tag(s) that match one or more of ours, the background gets highlighted, drawing our attention to the question.  It would also be nice to highlight (perhaps using a bold font) the tags(s) that matched our own, so one could quickly do a further filtering of the question to see if it is of interest at the present time, like the following:    e.g. arduino is in my list of favorites, but the other two in each question are not. is there any uncertainty on the free particle with a definite momentum $\vec p$? The probability amplitude for a free particle with momentum $\ p$ and energy $E$ is the complex wave function: $$\psi_{(\vec x , t)}=e^{i(\vec k\cdot \vec x -\omega t)}$$  is there any uncertainty on the free particle with a definite momentum $\vec p$!? What is the most secure hand cipher? By "hand cipher", I mean a symmetric cipher for which encryption and decryption can can both be performed with a pencil on graph paper, consuming about 10-20 seconds per character by a proficient user. Additional simple tools, e.g. a deck of cards or a multiplication table, may be used to expedite the process. No mathematical proficiency is required other than mental addition, subtraction, and maybe multiplication.  Basically, it should be a cipher that someone of average mathematical abilities can master, and it should require no digital technology or cryptographic tools that cannot be constructed out of paper.  For example, four-square in CBC mode seems secure to me because CBC is a well established mode of operation and four-square seems to be a good block cipher as it accommodates large keys and seems to produce a random-looking output. However, the fact that four-square in CBC was never widely adopted before digital encryption became a consumer technology leads me to believe that someone broke the cipher and thus discouraged people from using it.  So is there any hand cipher that the best supercomputers would take years to cryptanalyze? If not, then for which hand cipher is the best known attack the most complex? My question is related to my previous asked one:   I have about 300 shapekeys and want to set the random value for all of them . How to do it using scripting? How to send AT commands to modem once the connection is established? I have a zte 3g modem. I use carrier provided dialer for connection establishment. Once the ppp connection is active, i would like to send some AT commands(for ex. Query signal strength, AT+CSQ). But the dialer i use locks the /dev/ttyUSB0 port, which is the command port to send AT commands for my modem. So is there any way, to send the commands, once the connection is active?    Edit: I also tried the additional port /dev/ttyUSB1. But the port is flowing with random data from the modem. A sample is given below.  T^PREFMODE??                                                                     ^PREFMODE:8                                                                       OK                                                                               TC                                                                               ^DSDORMANT:1                                                                      +CSQ:19, 99                                                                       OK                                                                               T^SYSINFO                                                                        ^SYSINFO:2,3,0,4,255                                                              OK                                                                               TT^SYSINFO?                                                                      ^SYSINFO:2,3,0,4,255     I tried adding my commands, i even got output. But the response is very poor. Most of the times, my AT commands went unnoticed. Preserving signatures of decorated functions Suppose I have written a decorator that does something very generic. For example, it might convert all arguments to a specific type, perform logging, implement memoization, etc.  Here is an example:  def args_as_ints(f):     def g(*args, **kwargs):         args = [int(x) for x in args]         kwargs = dict((k, int(v)) for k, v in kwargs.items())         return f(*args, **kwargs)     return g  @args_as_ints def funny_function(x, y, z=3):     """Computes x*y + 2*z"""     return x*y + 2*z  &gt;&gt;&gt; funny_function("3", 4.0, z="5") 22   Everything well so far. There is one problem, however. The decorated function does not retain the documentation of the original function:  &gt;&gt;&gt; help(funny_function) Help on function g in module __main__:  g(*args, **kwargs)   Fortunately, there is a workaround:  def args_as_ints(f):     def g(*args, **kwargs):         args = [int(x) for x in args]         kwargs = dict((k, int(v)) for k, v in kwargs.items())         return f(*args, **kwargs)     g.__name__ = f.__name__     g.__doc__ = f.__doc__     return g  @args_as_ints def funny_function(x, y, z=3):     """Computes x*y + 2*z"""     return x*y + 2*z   This time, the function name and documentation are correct:  &gt;&gt;&gt; help(funny_function) Help on function funny_function in module __main__:  funny_function(*args, **kwargs)     Computes x*y + 2*z   But there is still a problem: the function signature is wrong. The information "*args, **kwargs" is next to useless.  What to do? I can think of two simple but flawed workarounds:  1 -- Include the correct signature in the docstring:  def funny_function(x, y, z=3):     """funny_function(x, y, z=3) -- computes x*y + 2*z"""     return x*y + 2*z   This is bad because of the duplication. The signature will still not be shown properly in automatically generated documentation. It's easy to update the function and forget about changing the docstring, or to make a typo. [And yes, I'm aware of the fact that the docstring already duplicates the function body. Please ignore this; funny_function is just a random example.]  2 -- Not use a decorator, or use a special-purpose decorator for every specific signature:  def funny_functions_decorator(f):     def g(x, y, z=3):         return f(int(x), int(y), z=int(z))     g.__name__ = f.__name__     g.__doc__ = f.__doc__     return g   This works fine for a set of functions that have identical signature, but it's useless in general. As I said in the beginning, I want to be able to use decorators entirely generically.  I'm looking for a solution that is fully general, and automatic.  So the question is: is there a way to edit the decorated function signature after it has been created?  Otherwise, can I write a decorator that extracts the function signature and uses that information instead of "*kwargs, **kwargs" when constructing the decorated function? How do I extract that information? How should I construct the decorated function -- with exec?  Any other approaches? I'm new in LaTex. I need to draw a graphic like the image and each rectangles of image must have the size shown in Figure. I drwan it by MS power point but I need to do by LaTex. Can you help me? Thank you in advance for your help and collaboration!  Thank you in advance for your help and collaboration! Please help identify this 2-part TV movie: Alien woman crash-lands on earth, falls in love, 199x