Can't get json_encode to work with database entry
UTF-8 all the way through
Open terminal window and execute Python script on startup I have a Python script which I would like to execute at every startup. I can run it by adding this to the startup applications:  python3 /path/to/script.py   That works, but it doesn't open a terminal window, so I can't see the program's output. How could I make it open a terminal window and execute the script in there?  Note: I get the window to stay open with input(' ') at the end of the Python script. Thanks! sci-fi book where a meteorite gives 3 different kinds of telepathic powers to people who then vie for control 3 groups of telepaths each with different powers.  They received their powers from a meteorite.  One group is the strongest and are kind of in control.  Another group wants to gain control.  One group, I believe the strongest, have telepathic battles to determine the strength of one another conjuring up swords, walls, etc. in their minds. It was written by a lawyer.  Could have been written in the ‘80s, or earlier. Energia/MSP-EXP432 Issue: Analog In Pin removing voltage from Voltage Divider In the circuit below, I want to measure the voltage going to the ADC (output from the voltage divider consisting of a fixed resistor and photoresistor) using an MSP-EXP432; however, the MSP-EXP432 "Analog In" pin is lowering the output voltage (i.e. the voltage going into the ADC from the voltage divider drops when the "Analog In" pin is connected).  I set the analog pin as an input in the code shown below in Energia.  Is there any way to fix this?    const int bitsOfADC = 14; // 14-bit ADC Launchpad //int maxVal = 2^N -1;  // 2^14-1 int maxVal = 16383; float FSV = 5.0; // Supply to 0804ADC float LaunchPadResolution = FSV/maxVal; int D7 = A13; int D6 = A14; int ADCInput = A6; boolean D7_State = LOW; boolean D6_State = LOW; void setup() {   delay(1000);   Serial.begin(9600);   pinMode(D7, INPUT);   pinMode(D6, INPUT);   analogReadResolution(bitsOfADC);   pinMode(ADCInput, INPUT); } First, I'd like to apologize for the awkwardly-phrased title.   Instead of trying to explain the structure I'm thinking of, I'd like to give some context and then an example or two. I've used and seen this construction used conversationally, and if my memory and intuition serve, conversationally only. I'm curious to know if there is a formal term for it.  Ex 1  "If you don't like what I'm offering, the door is that way."  A purely logical interpretation would make little sense with this example. In this context, the inference is that the speaker is indicating to whomever he is speaking that they should leave, which suggests that there might be an elision, e.g.  "If you don't like what I'm offering, ... [then you may leave. T]...he door is that way."  Ex 2  "If you're hungry, I have food."  This is a similar context. The implication is that the speaker will offer food to whom she is speaking if they are hungry. A (strictly) logical interpretation would, again, make little sense (if you are hungry, then I have food doesn't convey any intent to provide it, nor does it make sense; the speaker always has food, she just will offer it if her guest is hungry).  I recognize that this might be too specific to have a term associated with it. I'm just curious to know what it is if it does exist. Could "them" mean "those"? Rotating image / marker image on Google map V3 A local IP address (RFC 1918) on my network that is not … local I've noticed an IP address today on my network (192.168.15.1) which when visited actually goes to a page that has a router webconfig page (Not my router)  The puzzling thing is that i tried traceroute 192.168.15.1 which said that the distance between me and that host is 9 hops, whereas the distance between me and any other computer on my home network is 2 hops away (My computer --> Router --> Host)   Can someone please explain what's going on here ?  tracert output:  Tracing route to 192.168.15.1 over a maximum of 30 hops    1    &lt;1 ms    &lt;1 ms    &lt;1 ms  192.168.1.1   2    47 ms    51 ms    49 ms  [163.121.171.123]   3     *        *        *     Request timed out.   4   128 ms     *        *     163.121.211.134.dnet.net [163.121.211.134 ]   5     *      134 ms   126 ms  10.37.242.18   6    94 ms    90 ms    95 ms  10.35.2.157   7   178 ms   254 ms   206 ms  10.32.8.107   8    85 ms    57 ms   318 ms  10.35.0.186   9   215 ms   241 ms   230 ms  192.168.15.1  Trace complete. Characterization of short exact sequences The following is the first part of Proposition 2.9 in "Introduction to Commutative Algebra" by Atiyah &amp; Macdonald.     Let $A$ be a commutative ring with $1$. Let $$M' \overset{u}{\longrightarrow}M\overset{v}{\longrightarrow}M''\longrightarrow  0\tag{1} $$ be sequence of $A$-modules and homomorphisms. Then the sequence (1) is exact if and only if for all $A$-modules $N$, the   sequence  $$0\longrightarrow \operatorname{Hom}(M'', N)  \overset{\overline{v}}{\longrightarrow}\operatorname{Hom}(M,  N)\overset{\overline{u}}{\longrightarrow}\operatorname{Hom}(M', N)  \tag{2} $$ is exact.   Here, $\overline{v}$ is the map defined by $\overline{v}(f)=f\circ v$ for every $f\in\operatorname{Hom}(M'', N)$ and $\overline{u}$ is defined likewise.   The proof one of direction, namely $(2)\Rightarrow (1)$ is given in the book, which I am having some trouble understanding. So assuming (2) is exact sequence, the authors remark that "since $\overline{v}$ is injective for all $N$, it follows that $v$ is surjective". Could someone explain why this follows?  Given that $\overline{v}$ is injective, we know that whenever $f(v(x))=g(v(x))$ for all $x\in M$, we have $f=g$. I am not sure how we conclude from this surjectivity of $v$.  Thanks! alternative to "netstat -s" prints out a lot of very detailed protocol statistics like number of TCP reset messages received or number of ICMP "echo request" messages sent or number of packets dropped because of a missing route.  When in Linux netstat is considered deprecated at nowadays, then is there an alternative?  Statistics provided by ss -s are superficial compared to the ones provided by netstat. I'm hoping someone can help me as this is driving me nuts! Context and Chronological info I'm trying to find the title/author of a short story that I read in some or other anthology ages ago. I couldn't give you an exact date but I'd say it was probably 50s/60s. Plot The human population has increased to the point where input and output of resources on Earth is in exact equilibrium. As such, no other living matter can be permitted to exist, as its use of resources would throw this equilibrium out of balance. One man in a vast tower block has managed to hide some flowers, and, I think, one or a few small animals - perhaps a mouse. These are detected by the relevant authorities, and the story ends when an official arrives at the apartment and requires the man to destroy them - the last non-human living things on Earth. How can I make sharp geometric 3d models look more realistic? I'm making a scene in Blender with manufactured mechanical and electrical objects - cylinders, metal objects and so forth. I want to make these look real, be fully present with a sense of mass and substance.  3DCG has a tendency to make everything very sharply geometric, often looking mathematical and artificial. In other scenes, some organic curves, normal maps or particle systems would help make object look real. Like for example, making a simple plastic dog model look more believable, one can add more vertices for better definition, add texture layer, add fur etc.  My scene shows clean resistors, wires, metal strips and such, all sharply geometric. It's tricky to find ways to make the result less mathematical and more substantial, realistic and interesting to the eye.  What are some effective ways to add realism to these objects? Here is a quesion that has been bugging me. You know how you can set up a program to run on start up right?  Well, how can i tell it to start minimized, like you would do in windows?   TeamViewer starts open, but I need it minimized, and Tray-it just doesn't seem as elegant of a way to do it. Is it feasible to build an index of prime factors? Would it be possible to break an RSA key, in for example 1 week of time, if the cracker have already spent X number of years building an index of primes by performing every permutation of existing prime keys up to $2^{2048}$?  I understand this would take an immense amount of time to do, but it would only be done once. Obviously, computing such an index would take a considerable amount of time and would have to be done with someone having the right amount of resource. Given the public key, you would be able to look up what the two primes are, and hence retrieve the private key instantly.  Breaking an 256 AES would then be easier, as AES keys are often generated using the RSA private key.  Would it be possible to build such an index? How long would that take in permutations and perhaps with the fastest computer in the world? First, this question is motivated by the imprecise question: Is there a sensible notion of parity (evenness and oddness) for real numbers?   Here are some properties a notion of parity for $\mathbb{R}$ should have:    It should be an equivalence relation on $\mathbb{R}$ with exactly two equivalence classes.  Each equivalence class should be dense in $\mathbb{R}$. There should be some kind of symmetry between the two equivalence classes. (This is intentionally imprecise.)   If we divide $\mathbb{R}$ into rationals and irrationals, this lacks symmetry, since the rationals have measure zero and are countable, while the rationals have infinite measure and are uncountable.   So we could require that each equivalence class be uncountable and/or have positive (or infinite) measure. Then take one equivalence class to be the rationals, union with countably many fat cantor sets with positive measure, and the other class its complement. Then both classes are now dense, uncountable, and have infinite measure. But again, symmetry is lacking. One of these classes is "uncountable everywhere" and has "positive measure everywhere" while the other does not.   I propose some definitions: A subset $A \subset \mathbb{R}$ is uncountable everywhere if for any open interval $(a,b)$, the intersection $A \cap (a,b)$ is uncountable. A subset $A \subset \mathbb{R}$ has positive measure everywhere if for every open interval $(a,b)$, the intersection $A \cap (a,b)$ has positive measure. We can see immediately that having positive measure everywhere implies being uncountable everywhere, since a positive measure set must be uncountable.   Finally, my questions:    Is there a partition of $\mathbb{R}$ into two sets that are both uncountable everywhere?  Is there a partition of $\mathbb{R}$ into two sets that both have positive measure everywhere?  Is there a partition of $\mathbb{R}$ into two sets that split each interval $(a,b)$ into two parts of equal measure?   Potential generalizations for extra credit: What about partitions of $\mathbb{R}$ with $n$ equivalence classes, where $n \in \mathbb{N}$, or even with countably many, or even uncountably many equivalence classes?  Note: If you've seen these definitions of uncountable everywhere or positive measure everywhere somewhere under a different name, please let me know. I've never found anything where other people were thinking about these notions.  EDIT: By "measure," I mean Lebesgue outer measure, so we don't have to worry about anything being measurable. I have been developing a few python addins and I'm just wondering what is the best way to re-compile the addin anytime I edit the script.  Currently, if I make an edit to the script, it seems like I have to   Close ArcMap Go to My addin folder and double click the 'makeaddin' python file Double click the 'Python Addin File Restart ArcMap for the changes to come into effect   If I don't do these steps, then the edits aren't recognized. This gets pretty annoying and time consuming when I want to place maybe a simple print line somewhere or I do a small edit just to test a result.  Is there a better way of doing this? Prove that $f$ has a fixed point . For $f:[a,b]\rightarrow [a,b]$ is a continuous . Prove that $f$ has a fixed point . Is that true if we change $[a,b]$ by $[a,b)$ or $(a,b)$. css background color with floating elements Single word describing a person new in something What is a word for someone who is totally new in something or participates in something for the first time? What is the limit of $\lim\limits_{x→∞}\frac{\sin x}{x}$ How do I translate an ISO 8601 datetime string into a Python datetime object?