Missing favourite star while reading posts I tried the android app and so far I don't see any bugs etc, maybe one crash but I miss button for saving questions.  If this is multiple "question" I apologize for spamming. Would you please add it? Thank you.
How to favorite a question from Android app? I've found an interesting question when browsing Freelancers.SE. I've tried to star (favorite) the question but I couldn't find the option...  How to star a question from the Android app?
When you suggest an edit to a post and view the post while it's pending, . But as noted in the , this linking hasn't been implemented for tag wikis/excerpts yet, partly because there are potentially two links to include and the wording is not entirely obvious, and partly because they're orders of magnitude less common.  Here's my suggested wording for the three cases.   Tag wiki excerpt only     Thanks for your edit!   This edit will be visible only to you until it is .  Tag wiki only     Thanks for your edit!   This edit will be visible only to you until it is .  Both     Thanks for your edit!   These edits will be visible only to you until they are peer reviewed (, ).        I can't directly address the prioritization of tag wiki edits, but I'd appreciate the corresponding  or  mark, at least. What is the number of triangles with integer sides, given the length of the longest side? Suppose $a,b,c \in\mathbb N$, and the value of $c$ is known and fixed, while $a$ and $b$ are unknown and are both smaller than $c$. What is the total number of unique triangles possible with $a, b$ and $c$ as its sides? Stack Overflow technology makes me write bad answers Today I had some time and felt like writing a relatively good answer on Stack Overflow; explaining both the underlying mechanisms and good practices, unlike usual declarative answers in a "do that" style.  It took me like an hour of time, $50 if I were free lance. It'll bring me nothing but 3-5 occasional views, and - if I get lucky - some ignorant comments.  You know, it's quite discouraging.  Instead of pride for the job that was done, I feel frustrated. I know, this answer may offer help to the OP, if he ever notices it (being already satisfied with other answers).  So the only fate the answer will meet is to sink forever, below thousands other questions, falling like snow.  So, being a programmer, I am thinking of efficiency. It's a waste of time to spend so much effort to answer one question when there is no way to [actually] reuse it. So, I wouldn't do it again but just turn back into short answers mode without explanations.       Seeing other answers, I don't think I am only one with such feeling.  The current policy is driving knowledgeable and educational users away, yet it attracts inexperienced ones in numbers. Ones who will tell you to use [some technology] which they never have laid their hands upon. Ones who write answers just because they have learned some "good practice" from other questions, and this "knowledge" becomes an endless source of rep points.  The idea of Stack Overflow is rotten. It was excellent when trees were high and traffic was low.  It turned bad now; it has become a honeypot for all the "enthusiast programmers" of the world, eager to share their 2 cents faster than you can say the word "close".  You're killing a great resource. Despite all the nice words and proper declarations, it discourages the reuse of the knowledge. And encourages fast on-site answers.  Of course, the rules will tell you contrary. It's all nice and proper (if you don't mind it's strict mutual exclusivity). But mechanically, technologically it works in the way I described.  I tried to write a tag wiki. You know, it was biggest waste of time in my life. As a matter of fact, it is not a wiki at all; you can't even link to a certain section. Not to mention that nobody ever has the idea to read tag wikis.  Reference questions? Don't make me laugh. There is no good mechanism to store and categorize links. Favorites, although intended for the different purpose, are a chunk of crap when you want to use it as a reference. So, you can't compete with 30-seconds answers: a question will get 5 answers before you can even find an appropriate link.  Okay, I can organize links myself but, there are some problems:   I am just a human. I cannot remember everything I am just a human and I cannot answer questions at rate of 1 qpm. One person cannot fight the Tide. It's helpless. When technology makes people writing fast [incomplete] answers -  no good will of proper declarations can do a thing.  Even if a question gets finally closed, it won't hurt anyone - the hydra grew two more already.   You'll call me a brute for insulting honest users and innocent volunteers, but that's fact: There are much more inexperienced users than experienced ones. And inexperienced users have much more spare time to hang over than experts who have their job to do. So, from that fact we can conclude that most of the answers on Stack Overflow have a low quality. Nobody cares. But I do.   There should be a technical way to limit the activity of not-so-knowledgeable-yet-eager-to-answer users. There should be a technical preference for the closing a question over answering it (have a silly answer for the silly question? welcome to comments). There should be a technical solution to accumulate and structure knowledge, a system that lets you choose a good answer instead of writing it by hand.   That's the only way. Otherwise Stack Overflow will remain an automated dispenser of bad practices.  Well, I just felt like letting it out again. Thank you for reading. How can I hibernate or sleep my Ubuntu 10.10 desktop and have it "wake up" the next day?  I have seen software that can do this on windows, so it can't be hard on Ubuntu! Help me understand Support Vector Machines I understand the basics of what a Support Vector Machines' aim is in terms of classifying an input set into several different classes, but what I don't understand is some of the nitty-gritty details. For starters, I'm a bit confused by the use of Slack Variables. What is their purpose?  I'm doing a classification problem where I've captured pressure readings from sensors I've placed on the insole of a shoe. A subject will sit, stand, and walk for a couple of minutes while pressure data is recorded. I want to train a classifier to be able to determine whether a person is sitting, standing or walking and be able to do that for any future test data. What classifier type do I need to try? What is the best way for me to train a classifier from the data I've captured? I have 1000 entries for sitting, standing and walking (3x1000=3000 total), and they all have the following feature vector form. (pressurefromsensor1, pressurefromsensor2, pressurefromsensor3, pressurefromsensor4) What's the meaning of the transpose? I am trying to help my daughter on her math homework and I am having some trouble on some equation solving steps. My current major concern relies on understanding why $\sqrt{8}/2$ equal to $\sqrt{2}$.  Thanks in advance How can I get a shapefile from a postgis query? My data is in a PostGIS database. I would like to generate a shapefile from a query. How can I do that? How to determine if a type implements a specific generic interface type Why does everyone do 9-overlord, not 10-overlord? What is the advantage on saving the money for the overlord when you have 9 drones, and not filling your supply first and then getting the overlord?  In my theory, in the first case you get to wait the saving time with 9 drones, and get to wait almost the same time with 10 drones in the second case. Second case should be better, since 10 drones mine faster than 9? So why does everybody go with the first case?  All this is assuming you go 12 pool or something like that, where you will get more drones after the overlord. 6- and 8-pools are obviously different. Pass commands as input to another command (su, ssh, sh, etc) The question at hand is:  "Two capacitors of capacitances $C_1$ and $C_1$ have charge $Q_1$ and $Q_2$. How much energy, $\Delta w$, is dissipated when they are connected in parallel. Show explicitly that $\Delta w$ is non-negative."  I'm confused about what the physical situation is. I took the assumption that these capacitors were somehow pre-charged, and then connected to each other in parallel without a voltage source. However, I don't understand how this would work. If a circuit is composed of only 2 elements, I don't see how they could be in any arrangement but series. Nevertheless, I tried solving it that way:  Two capacitors in parallel have the same voltage drop. Charge will be redistributed to make it the same voltage for both. Let $Q_1'$ and $Q_2'$ be the charges on the capacitors after they are connected. Now, picture the equivalent capacitor  $C_{eq} = C_1 + C_2 =$ $\frac{Q_1' + Q_2'}{V_f}$   conservation of charge:  $Q_1' + Q_2'= Q_1 + Q_2$,        $C_{eq} =$ $\frac{Q_1 + Q_2}{V_f}$  $V_f = $$\frac{Q_1 + Q_2}{C_1 + C_2}$  The initial energy of the capactiors is:  $U_0 = $$\frac{Q_1^2}{2C_1}$$+\frac{Q_2^2}{2C_2}$  $U_f = $$\frac{1}{2}$$(C_1 + C_2)V_f^2 = $$\frac{(Q_1 + Q_2)^2}{2(C_1 + C_2)}$  $\Delta U$$ = $$\frac{(Q_1 + Q_2)^2}{2(C_1 + C_2)}$-$\frac{Q_1^2}{2C_1}$$-\frac{Q_2^2}{2C_2}$  However, I don't see how this is necessarily non-negative. How do I profile memory usage in Python? I've recently become interested in algorithms and have begun exploring them by writing a naive implementation and then optimizing it in various ways.  I'm already familiar with the standard Python module for profiling runtime (for most things I've found the timeit magic function in IPython to be sufficient), but I'm also interested in memory usage so I can explore those tradeoffs as well (e.g. the cost of caching a table of previously computed values versus recomputing them as needed). Is there a module that will profile the memory usage of a given function for me? Why do some adjectives follow the nouns they modify? Right now I can only think of one instance in which this regularly occurs.  The adjective proper is sometimes placed after the noun it modifies, e.g:      A class of cold-blooded oviparous or ovoviviparous vertebrated animals whose skin is covered with scales or scutes; the reptiles proper.   What is this word order called, and why is it ever used?  Edit: I really want to know about proper, and while the word hyperbaton relates to post-positivity when it is meant to be rhetorically impacting, it doesn't seem to fit with ubiquitous post-positivity, such as that of proper.  I've accepted hyperbaton as the correct term/reason for almost all post-positive constructions, but I'd like a complete answer to include proper. This is a  about Licensing.    Questions on licensing are off-topic on Server Fault.  If your question has been closed as a duplicate of this question, then this is because we want to help you understand why licence questions are off topic rather than just telling you "it just is". In all likelihood, this question will not address your question directly, it was not meant to.    I have a question regarding software licensing. Can the Server Fault community please help with the following:   How many licenses do I need? Is this licensing configuration valid? What CALs do I need to be properly licensed? Can I run this product in a virtual environment? Can I downgrade this product to an earlier version? Am I entitled to feature X with license Y? How to load JAR files dynamically at Runtime? Why is it so hard to do this in Java? If you want to have any kind of module system you need to be able to load JAR files dynamically. I'm told there's a way of doing it by writing your own ClassLoader, but that's a lot of work for something that should (in my mind at least) be as easy as calling a method with a JAR file as its argument.  Any suggestions for simple code that does this? Gradient and Swiftest Ascent I want to understand intuitively why it is that the gradient gives the direction of steepest ascent. (I will consider the case of $f:\mathbb{R}^2\to\mathbb{R}$)  The standard proof is to note that the directional derivative is $$D_vf=v\cdot \nabla f=|\nabla f|\,\cos\theta$$ which is maximized at $\theta=0$. This is a good verification, but it doesn't really help me understand the result. Every once in a while I see users having issues to update due to errors like this:  E:Type 'ain' is not known on line 1 in source list /etc/apt/sources.list.d/some-ppa.list'   with varying types/line numbers/source list files (often after removing a PPA).  How can such an error be fixed? counting triangles in a graph or its complement Given a simple graph $G$ [no loops or parallel edges] on six vertices,  let $G^c$ denote its complement. It is known that either $G$ or $G^c$ must contain a triangle  $T$ in it. [An example of a Ramsey number I think.]   My question came up when I tried to find such a graph on six vertices  which had only one $T$ in it or its complement.  I believe if I did things right there are none of these. This I tried to check by drawing a copy of each graph $G$  on six vertices which has a $T$ in it,  and then looking at the complements to see if any had  no $T$'s in them. I found none.  One way to pose my question for a general number $n$ of vertices  is then as follows: Consider the set of all graphs $G$ on $n$ vertices,  and for each one construct $G^c.$  Count the number of $T$ in $G$ and add that to the number of $T$ in $G^c.$  Finally find the minimal such sum for the given $n$  and call that say $M(n).$ So my above six vertex conjecture  is that $M(6)=2.$   By considering a cycle graph on five vertices we find $M(5)=0.$   So going further one could ask if anything is known  about this minimum function $M(n)$ for larger $n$ [such as bounds, etc.] And does it have a name?  I would also like to see a simpler way to handle the six vertex case, one not involving drawing all the graphs. Example of a domain where all irreducibles are primes and that is not a GCD domain One has the following relations for a domain $R$:  $R$ GCD domain $\Rightarrow$ All irreducible elements are prime  $R$ PID $\Rightarrow$ $(R$ GCD domain $\land$ $R$ statisfies ACCP$)$  $R$ UFD $\Leftrightarrow$ $(R$ GCD domain $\land$ $R$ satisfies ACCP$)$  $R$ satisfies ACCP $\Rightarrow$ $(R$ UFD $\Leftrightarrow$ All irreducible elements are prime$)$  $R$ GCD domain $\Rightarrow$ $(R$ UFD $\Leftrightarrow$ $R$ atomic domain$)$  So what is the difference between a GCD domain and a domain where all irreducible elements are prime? What is the "weakest" predicate $P$ such that  $R$ GCD domain $\Leftrightarrow$ $($All irreducible elements are prime $\land$ $P(R))$ ?