Packaging Python script for end user to run I have a Python script that I have made to some basic data management tasks.  I want to package up a Python script in a nice user friendly way for an end user to run, they do not know how to run Python scripts and I need them to input some parameters in an easy way i.e. say a filename.  What is the best way to do this?
Sending file of custom python script with all parameters for popup interface already defined? I have a python script in ArcGIS 10 that when clicked, has a popup for a user to choose parameters. I would like to send this file to someone else. While I could send them the python code and have them setup the parameters - this method repeats work I have already done.   I would like to send someone one file that contains all of this information so they can just recieve my file, add it to a toolbox, and then have it all work. I am wondering where the file resides that has both the python code and parameters / what is the export process/ file type I should be looking at? (All the searches I do for "export script" seem to refer to exporting a model to python code...)
I've searched the net for such information and found different command lines, like these ones:  sudo apt-get remove application sudo apt-get remove application*  sudo apt-get remove --purge application sudo apt-get remove --purge application*  sudo apt-get purge application sudo apt-get purge application*   So, what is the correct way? Is it necessary to use that "*"?  After that, I also found these commands:  sudo updatedb sudo locate application sudo rm -rf (file/folder name) I'm just starting to learn linear algebra and I understand Gaussion elimination but I don't understand this proof:    Is the heart of this the fact that all the while when I've been row-reducing matrices to reduced row-echelon form... I've actually been multiplying a matrix by a series of a elementary matrices?  What does the notation $[A\ \ 0]$ mean?  How is the equation $A = E_1^{-1}...E_k^{-1}$ arrived at? Inner product on $C(\mathbb R)$ With axiom of choice it is possible to construct an inner product on $C(\mathbb R)$. My question is, is it possible to explicitly construct an inner product on $C(\mathbb R)$? I.e. to give a closed formula to calculate the inner product? I know it is straight-forward to write down a scalar product using a Hamel basis. This is not the answer I am looking for. This question came to me, when a student asked me in the lecture today 'whether there are vector spaces without inner products'. So I tried to find scalar produces for function spaces. I think I managed to write one down for $L^1((0,1))$. But I failed to construct one for $C(\mathbb R)$. Extra }, or forgotten \right My MWE:  \documentclass{report}  \usepackage{amsmath}  \begin{document}  \begin{align} y &amp;= a \\ =&amp; -2c_1\bar{z}_1^2 + 2\bar{z}_1\bar{z}_2 + 2\bar{z}_2 \left ( -\bar{z}_1 -c_2z_2 - \frac{3\epsilon}{2}\bar{z}_2 -\sigma_{2,1}\cos(x_1)\Delta x_1 \notag \right. \\ \left. &amp;- \sigma_{2,2}\Delta x_2 -\sigma_{2,3} \Delta u +c_2 \chi_2 \vphantom{\frac{1}{1}} \right ) - 2\gamma \sigma_{2,1}^2\cos^2(x_1) \Delta x_1^2 - \gamma \sigma_{2,2}^2 \Delta x_2^2   - 2\gamma \sigma_{2,3}^2 \Delta u^2 \end{align}  \end{document}   The error I get:  Extra }, or forgotten \right.   The expected result: How to get all possible combinations of a list’s elements? I have a list with 15 numbers in, and I need to write some code that produces all 32,768 combinations of those numbers.   I've found  (by Googling) that apparently does what I'm looking for, but I found the code fairly opaque and am wary of using it. Plus I have a feeling there must be a more elegant solution.  The only thing that occurs to me would be to just loop through the decimal integers 1–32768 and convert those to binary, and use the binary representation as a filter to pick out the appropriate numbers.   Does anyone know of a better way? Using map(), maybe? Rules and guidelines for drawing good schematics There are a lot of poorly drawn schematics here. A few times people have actually asked for critiques of their schematics. This question is intended as a single repository on schematic drawing rules and guidelines can point people to. The question is  What are the rules and guidelines for drawing good schematics?     Note: This is about schematics themselves, not about the circuits they represent. This is Exercise 3.1.A. in      Suppose that $\pi: X\rightarrow Y$ is a continuous map of differentiable manifolds. Show that $\pi$ is differentiable if differentialble functions pull back to differentiable functions, i.e., if pullback by $\pi$ gives mpa $\mathcal{O}_Y\rightarrow \pi_*\mathcal{O}_X$.   Let $f: V\subseteq Y\rightarrow \mathbb{R}$ be a differentiable function on an open subset of $Y$. Let $(U,\phi)$ be a chart of $X$, $(V,\psi)$ be a chart of $Y$. Then $f\circ\pi(\phi^{-1})$ is differentiable and $f\circ\psi^{-1}$ is differentiable. We need to show that $\psi\circ\pi\circ\phi^{-1}$ is differentiable. I don't know how to prove this.   Can we say that since $(U,\psi\circ\pi)$ constructs a chart of $X$, by the compatibility, $\psi\circ\pi\circ\phi^{-1}$ is differentiable? This seems true but this does not use the fact that $f$ is differentiable.  Sorry I have no background of Differentiable Manifolds. Any help would be appreciated.  I also saw this post: , but I don't understand how $\gamma$ is smooth in the answer. $\gamma=\beta\circ\rho$, where $\rho$ is defined to be smooth, but $\beta$ is not. $f$ differentiable except in $1$ point Spyder - touchpad scroll does not work I use the scroll function with my mouse and it works fine. But either in script, or in terminal sections of Spyder, I can't use the touchpad for scrolling. I do not experience any problems with my touchpad in other programs like Word, Chrome etc. Is there any option for this in Spyder, specific for touchpad?  I am using Lenovo Legion Y520, Windows 10. How to find out the variant of my Galaxy Nexus? There have been some Jelly Bean updates for Galaxy Nexus, but most of these are specific to a certain variant of the Nexus. How can I easily find out which variant I have? gwt java.lang.ExceptionInInitializerError Counting invertible $0$-$1$ matrices that remain invertible under negating the diagonal There is an invertible $n×n$ matrix with each entry $0$ or $1$. Now we negate ($x\to 1-x$) the diagonal of the matrix, and it is still invertible. How many such matrices exist for a given $n$?  Can we derive a general formula? If $n=2$ there are $2$ such matrices, if $n=3$ there are $48$. But I have no idea whether a formula exists for higher $n$. Can I open Microsoft Word and Excel files? Can a player character use the Misty Step spell to bring another character or creature with them when they teleport? I am an Eladrin elf and have the ability to use the misty step spell to teleport with my clothing and items. However, can I grapple a party member (or NPC or other creature) and use the misty step spell to bring them with me when I teleport? Would they have to be willing? Induced metric on a null hypersurface Consider a metric $g_{\mu\nu}(x)$ and a hyper surface ${\cal H}$ defined by $~f(x) = c$. One (or at least I) usually finds the "induced metric" on ${\cal H}$ by solving$~f(x) = c$ for one of the coordinates and plugging it back into the metric to give us $\gamma_{ij}$. For null hypersurfaces, I seem to be finding that the resultant induced metric is singular.         Is it true in general that the induced metric as defined above is singular on a null hypersurface?   How does one define the induced metric on a null hypersurface? sudo credential caching on by default Just installed a minimal ubuntu 12.04, then installed xfce4 and xinit from the command line after first boot.  Totally vanilla installation afaik.  I'm noticing that sudo caches the password until I issue sudo -k to clear it.  This is unexpected behavior in my mind.  I've run xfce4 before and don't recall credential caching being on, nor have I experienced it in the many previous ubuntu installs I've had over the years.  Is this a new feature of Ubuntu?  Is this something that's the result of the minimal install?  Is this an xfce default that's been added recently? Incompatible pointer type initializing 'CustomCellView *' with an expression of type UItableViewCell How can top principal components retain the predictive power on a dependent variable (or even lead to better predictions)? What is the easiest way to handle huge numbers in C? I need to store values in the Area 1000^900, or in more human readable form 10^2700. Does anybody know of an easy way to do that? Any help would really be appreciated! why does IE need for me to click twice