With the lstlistings package, is there a strait forward way of changing the label style from   Listing 1   to   Listing. 1   By the "label style" I mean the string used in the captions.  EG.   \begin{lstlisting}[caption=This is a caption, label=list]    here lieth some code \end{lstlisting}   would give me:  listing 1: This is a caption here lieth some code   However, What I need to get is (notice the punctuation after the listing):  listing. 1: This is a caption here lieth some code
I'm using the listings package with this \begin command:  \begin{lstlisting}[caption=blabla, label=amb]   This yields a nice code listing with a caption like "Listing 1.1 blabla". Is there a way to change the caption and have something like "Code 1.1 blabla"?  I saw the title command but it doesn't use a numbering system. Any hint will be greatly appreciated!
Access gnome-shell messaging tray using keyboard Is there a keyboard shortcut to access the gnome-shell messaging tray? E.g. For responding to incoming IM, etc. Partial adb restore ICS devices support creating backups using adb backup, and restoring them using adb restore. Using adb backup, one can select that everything should be backed up, or only a certain package.  However, adb restore lacks all the options of adb backup. When I call adb restore backup.ab, where backup.ab is only the backup of a single package, the phone shows me a warning dialog saying that all settings are going to be lost after restoring the backup. Is it true that restoring a single package backup wipes all data on the phone? If yes, is it somehow possible to restore a single package using adb restore? Are you allowed to use numbers as table names in MySQL? I'm thinking of having a program that dynamically creates new tables as the need arises. Can I have tables named with just numbers in MySQL? Problems after upgrading to 14.04 (only background and pointer after login) Functions that are their Own nth Derivatives for Real $n$ Is this algebraic identity obvious? $\sum_{i=1}^n \prod_{j\neq i} {\lambda_j\over \lambda_j-\lambda_i}=1$ If $\lambda_1,\dots,\lambda_n$ are distinct positive real numbers, then  $$\sum_{i=1}^n \prod_{j\neq i} {\lambda_j\over \lambda_j-\lambda_i}=1.$$ This identity follows from a probability calculation that you can find at the  top of page 311 in the 10th edition of Introduction to Probability Models by Sheldon Ross.   Is there a slick or obvious explanation for this identity?   This  question is sort of similar to ; clearly algebra is not my strong suit! How to create a YouTube playlist from a list of links? I have very long lists of YouTube links/bookmarks. I want to create playlists for my YouTube channel with them. Is there any way to do it automatically without having to add each individual URL to a playlist? Vertically align text next to an image? How do I find playtesters? Obviously the first tester group would be your own group. But beyond that? It would seem to make sense to have at least more than one group test out your game, as different groups want different things and play differently. Fresh eyes find different bugs, etc. etc.  Are there resources out there to help aspiring game designers without a lot of contacts find people willing and eager to test out their game?  Or is this in essence a "" issue?  To clarify my own situation:  I have the mechanics finished. The setting is still under development, but in accordance with the motto "fail faster" I want to go ahead and test the mechanics (in a different setting for now) to see if they work and are fun or if I need to go back to the drawing board. I have a sort-of group, but I don't know them very well and they don't meet often, and so I'm not excited about the prospect of presenting the mechanics to them right now (as I'm sure there are a dozen issues I've overlooked). Also, I'd like to test the game (including the setting, later) on more than one group, as mentioned above. I've put out some feelers among my current friends and acquaintances, but nobody's really been excited about playtesting or even really giving in-depth feedback, and I don't want to be that person who's always shoving their project in your face. I'm willing to run something online as well. I'm also interested in having others run a game without me present, and giving me their feedback.  Also, I'm looking for something of a guide-type answer that might help someone besides just me. Show that the series $$\sum\limits_{n=2}^{\infty} \frac {(n^3+1)^{1/3}-n}{\log n}$$ converges.   I showed it using Abel's theorem and limit comparison test. Any other simpler method? What are the uses of "using" in C#? User  answered the wonderful  question by mentioning the using keyword. Can you elaborate on that? What are the uses of using? How can I get bash to perform tab-completion for my aliases? I have a bunch of bash completion scripts set up (mostly using bash-it and some manually setup).    I also have a bunch of aliases setup for common tasks like gco for git checkout. Right now I can type git checkout dTab and develop is completed for me but when I type gco dTab it does not complete.    I'm assuming this is because the completion script is completing on git and it fails to see gco.    Is there a way to generically/programmatically get all of my completion scripts to work with my aliases?  Not being able to complete when using the alias kind of defeats the purpose of the alias. Equivalent definitions of convexity for $f\in\mathcal C^1(\mathbb R^n)$ I noticed many identical questions on this site relating to equivalent definitions of convexity, see for example , , , , , ,  and there might be more. So I wanted to create a &quot;big list&quot; of equivalent definitions of convex functions, I will start with some equivalent definitions and post my proofs in my answer below. Feel free to add any other equivalent definitions. This question can then serve as an abstract duplicate. Claim. Let $n\in\mathbb N$ and $f\in\mathcal C^1(\mathbb R^n)$. Then the following are equivalent:  $f$ is convex, i.e. $f(\lambda x_1 + (1-\lambda x_2))\le\lambda f(x_1)+(1-\lambda)f(x_2)$ for all $\lambda\in[0,1]$ and $x_1,x_2\in\mathbb R^n$. For all $x,y\in\mathbb R^n$, $\langle\nabla f(x)-\nabla f(y),x-y\rangle\geq0$. For every $x,y\in\mathbb R^n$, $f(y)\geq f(x)+\langle y-x,\nabla f(x)\rangle$. Evaluate $\int_{-\pi/4}^{\pi/4}(\cos(t)+\sqrt{1+t^2}\cos(t)^3\sin (t)^3)dt$ Compactness of  Multiplication Operator on $L^2$ Suppose we have an bounded linear operator A that operates from $L^2([a,b]) \mapsto L^2([a,b])$.  Now suppose that $A(f)(t) = tf(t)$.    Is A compact?  Edit: I know $A = A^*$ but I'm not really sure how to start on this.  It's not homework, just summer fun :D Split Line at Points not splitting at every point in ArcGIS for Desktop? Why does  not split at every point encountered, even if run in an iterative fashion?  Following the suggestions of a thread here and several others, I made a set of points in order to split polylines at specified intervals. In order to do this, I used linear referencing to turn my lines into routes. Then, I exported the attribute table, divided each length by 5, and set points at multiples of 1/5 the length of the line. I used this as the event table to create a layer of events. So, each line has 4 equally spaced points along it, and I thus ultimately need the 5 segments separated by those points.  Curiously, though, when I try to do the second part "Split Line at Point," it seems that only one point is used on a given line at a time, and I'm not sure how it chooses the point (maybe order in its attribute table?) I could run the tool multiple times, but this doesn't seem to solve the problem either. For example, I could see how it would continue splitting segments as more segments are generated, but on e.g. the 4th run I see that some lines are still only split 3 times, even though there is a point within a line segment that was never split and existed before I ran the tool. I'm not sure how the splits are generated, but in any case, it doesn't seem to do what I want it to do, which is produce a split at "each" point.  What should I do to split lines at ALL points along the line? Area of the Limiting Polygon Start with an equilateral triangle with unit area. Trisect each of the sides and then cut-off the corners. In this case, we get a regular hexagon - see the picture below. Next, trisect each of the sides of the hexagon and cut-off the corners. This will give a dodecagon, but not a regular one.   Continue this process ad infinitum.  What is the area of the limiting "polygon"?  My first thought was that it would be the circle tangent to the midpoint of each side. However, by making some pictures, it becomes clear quite quickly that the limiting polygon is not a circle and, in fact, might perhaps be an ellipse. The problem with that is that while there is a unique circle passing through any three points in general position, I need five generic points to specify a conic.   Can anyone suggest any hints as to how to find the area? By "hint" I don't mean "what you think might work", I mean "what you have tried and you know will work". Thanks in advance. Where can I find Ghost/Poison/Psychic type Pokémon? Approximating a $\sigma$-algebra by a generating algebra Theorem. Let $(X,\mathcal B,\mu)$ a finite measure space, where $\mu$ is a positive measure. Let $\mathcal A\subset \mathcal B$ an algebra generating $\cal B$. Then for all $B\in\cal B$ and $\varepsilon&gt;0$, we can find $A\in\cal A$ such that $$\mu(A\Delta B)=\mu(A\cup B)-\mu(A\cap B)&lt;\varepsilon.$$  I don't think there is a proof in this site. It's a useful result for several reasons:  We know what the algebra generated by a collection of sets is, but not what the generated $\sigma$-algebra is. The map $\rho\colon \cal B\times\cal B\to \Bbb R_+$, $\rho(A,A')=\mu(A\Delta A')$ gives a pseudo-metric on $\cal B$. This makes a link between generating for an algebra and dense for the pseudo-metric. We say that a $\sigma$-algebra is separable if it's generated by a countable class of sets. In this case, the algebra generated by this class is countable. An with the mentioned result, we can show that $L^p(\mu)$ is separable for $1\leq p&lt;\infty$, which makes a link between the two notions. In ergodic theory, we have to test mixing conditions only an a generating algebra, not on all the $\sigma$-algebra. Dynamically Determine Calling Context? We have various ways of invoking apex. Triggers, Inbound Webservices, @InvocableMethod,@RemoteAction and what not. Often we call some or other utility methods from these execution contexts. I have some generic utility method,that should behave differently from the context it is called?  I know about Trigger.isExecuting but it only tells if its running in trigger context or not.  I have a utility method that creates lead from Webservices, VF button click and via Lightning . Whenever we create a lead I want some special operations to be done via the source it was originated.(Its not just updating a simple field leadSource, I have some methods that creates some childs and update other records of other type) . I can achieve this by passing an extra parameter to utility method to tell about source, but i have then to edit hundred of other class that uses this utility method. If i could dynamically find out via which context this piece of code is running,then i would have to change only one class to satisfy my requirement.    Is there something in APEX that tells in what context the apex method was called?