Select Option to php variable
Sending form POST request to PHP
Today I saw a sentence:  She surely can do it.  What does that mean? How does it differ from:  She certainly can do it. Surely she can do it.  This slight difference in meaning of those sentences I am not able to notice. Could you please help me? Thanks in advance! How to remove conference information from the ACM 2017 SIGCONF template? Is the sorting algorithm used by .NET's `Array.Sort()` method a stable algorithm? Is the sorting algorithm used by .NET's Array.Sort() method a  algorithm? Let's stop displaying a user's accept rate My feature request (or anti-feature-request perhaps) is the following: Let's stop displaying a user's accept rate.  For those of you who know "Fawlty Towers", the whole issue of a visible accept rate and our behavior towards it starts to feel like .   We generally seem to agree that harassing a user about it is not appropriate and that our decision to answer a question should not depend on it, yet we display it in varying terrorist-threat-levels of color. Yes dear users, please don't pay any attention to the brightly orange colored percentage you see there. And whatever you do, don't bring it up.  But as long as you're displaying the accept rate, people will comment on it, criticize users for it and possibly reconsider answering because of it. And while I'm of the opinion that a low accept rate should not stop you from answering (we're here to make the internet better after all) and that the possible reputation gain (or lack thereof) should not factor in either, I can't blame users for considering it. It's in their face after all. And we're only people.   So let's take the issue off the table. Or at least partially. Information about a user's acceptance behavior can still always be gathered from the profile. But at least that would be less in-your-face.   "But it helps me to see if a user is a help vampire!" I'm still wondering if those are of the sparkly variety as well, but I digress. So what? If the question is bad, downvote it. Evaluate a question on its individual value. There is no need to take a user's history into account. There might be a correlation between the quality of a question and a user's accept rate, but there doesn't have to be. And if there is, the bigger problem is the question's quality.  "Exactly! A user with a low accept rate might indicate there's a problem!" I'm not arguing we should get rid of the accept-rate value within SO/SE. After all, this Q&amp;A works based on up and downvotes, as well as the acceptance of an answer. But why not use it behind the scenes to (very occasionally) nudge the user with a statement like:      "You have received several answers to your questions, yet have not accepted an answer as correct or helpful in a while. You might want to evaluate them and where possible ".    After all, in the various questions with regards to comments on low accept rates, if any comments are encouraged at all, then they are of this soft variety. So why not let the system take care of that?  I feel this would take the whole issue of accept rate off the table, while still providing the user with the information he might have missed or needs. (As a bonus, it would reduce the frequency with which the topic is brought up here on Meta) And those users who would ignore this information are most likely not convinced by a displayed percentage either. How can I create a Windows bootable USB stick using Ubuntu? Semicolons at the end of list items In school, we were taught to end each list item with a semicolon. But I have never actually seen this. Can somebody please confirm this? Should we end each list item with anything at all?  I've seen people use periods after each list item, colons, and even commas. But I've never seen a semicolon at the end of each item — and even if I have, it would be that rare that I've forgotten.  Example:   item; item; item; item Prove that $\lim_{x\to y} \frac{d(x, F )}{|x−y|} = 0$ for a.e. $y \in F$. Let $F \subset \mathbb{R}$ be a closed set and define the distance from $x \in \mathbb{R}$ to $F$ by $d(x,F)= \inf_{y \in F} |x−y|.$  Prove that  $$\lim_{x\to y} \frac{d(x, F )}{|x−y|} = 0$$ for a.e. $y \in F$.  Hint: Consider Lebesgue points of F.  I am not sure where to begin on this question.  Any suggestions?  Thanks. I can't install software-center on Kali How to save picture to iPhone photo library? I am trying to solve the exercises from the book Stochastic differential equations -An Introduction with applications by Bernt Oksendal and I am stuck on 1 question.  Prove directly from the definition of Ito's integral that   $$\int_0^t B_s^2 dB_s=\frac{1}{3}B_t^3-\int_0^t B_s ds$$  I have tried for a couple of hours but I simply cannot prove it . I would be grateful if somebody could help me out , even a hint would be very helpful Sum of Cosine/Exponential How to truncate a file in C? How can I install .exe files of Windows 7 or more in Ubuntu? I want to run/install .exe files that require Windows 7 or higher in Wine on Ubuntu.   When I try to install a specific .exe file on Wine, it says      Windows version is not supported! You can install it in Windows 7 or higher.   How can I configure which Windows version (XP, Vista, 7, 8, ...) Wine emulates? Is it possible to make LaTeX mark overfull boxes in the output, for example by drawing red rectangles in the PDF where the boxes overflow? The purpose -- to more easily "see" where the problems are in the output. I have iterate over numbers in various order. I am able to display them in increasing order, even with steps like:  $ seq --separator="," 1 10 1,2,3,4,5,6,7,8,9,10 $ seq --separator="," 1 2 10 1,3,5,7,9   I am also able to display them in reverse order, neither continuous nor step wise.  $ seq --separator="," 10 1    $ seq --separator="," 10 2 1   No output for above commands.   My shell details:  $ bash --version GNU bash, version 3.2.25(1)-release (x86_64-redhat-linux-gnu) Copyright (C) 2005 Free Software Foundation, Inc.   Let me know how I would be able to display the numbers in descending order? Lebesgue integral uniform convergence Let $f_n, f \colon [a,b] \to \mathbb{R}.$ Show that, if $f_n \to f$ uniformly, then the Lebesgue integrals are equal, i.e. $\int f = \lim \int f_n$.  This is clearly true for continuous functions, but how do I handle the case of non-continuous functions? Auto update specifick plugin I've created a plugin and I want to auto-update this plugin.  I've been looking in the WordPress Codex and found this following piece of code:  add_filter( 'auto_update_plugin', '__return_true' );   I added this code into a new Must-have Plugin but it doesn't work. It does not auto-update all my plug-ins..  Anyone that have experience with auto updating? iPhone asks 'Trust This Computer' again (I am on macOS 10.14.6 and iOS 12.4)   I am certain that I have trusted my Mac before. Without the latter trust, I can also access the phone in iTunes.   I have tried reset "Location and Privacy" on my phone. Then   When connecting the iPhone with iTunes running, it asks for the trust and I trust it.  Reboot my Mac and the phone asks for another trust.   Is there some known malware mimics system behavior and steal data from an iPhone?  (I do have installed some pir*ted software recently. That's my fault.) How does order-preserving encryption work? Order-preserving encryption (OPE) is, apparently, a method of encrypting data so that it's possible to make efficient inequality comparisons on the encrypted items without decrypting them.  I've been coming across this term in various places (including ) lately, but I have no idea how such encryption schemes are supposed to work.  Any obvious methods I can think of to allow such comparisons on encrypted data would result in catastrophic security failure.  Certainly, I assume that OPE must involve some kind of security tradeoff compared to traditional encryption, but given that it seems to be actively  and , it seems that it must be possible to implement in a way that retains at least some level of useful security.  I just don't see how.  Given that  didn't turn up any convenient Wikipedia articles or other popular summaries of OPE, I figured I'd try asking for one here before diving into the academic literature.  (At worst, I may try to answer my own question later, if nobody else beats me to it.)  So, to summarize, my question is: How does order-preserving encryption work, and what security properties does it provide? I was trying to prove this inequality using induction, but couldn't do.  Question: Suppose $a$ and $b$ are real numbers with $0 &lt; b &lt; a$. Prove that if $n$ is a positive integer, then:  $$a^n-b^n \leq na^{n-1}(a-b)$$