I have photographed the following plant in our garden in Pittsburgh, PA.  Do you know the name of the plant?
This plant was found growing in Germany. I have never seen it before, reverse Google image search did not help either. Can you help me identify what type of plant this is?      Thanks, looks like it is something like this:    Related question:
I could have modifications ready for a specific question that was downvoted. I felt like the best thing to do was to delete the post first.  Is it possible to flag for moderator attention after you deleted the post ? Once and for all: Is there anything that can possibly be done to my commander that would cause it to cease being my commander?    All of these questions ask the same thing, but aren't general enough to be marked as a duplicate.      Is a commander still a commander if it gets turned into a forest?     Is a commander still a commander if it gets turned face down? How can i use ArcGIS server 10 mapservices in OpenLayers2? How do I change the default settings of export operators? I have several files that I ftp each hour.  The receiving system needs to have some sort of identifier that they came from the same batch, so I would like to append a timestamp to the filename.  That alone is fairly easy, but since I want each file to have the same timestamp (so it can serve as the batch identifier), I cannot figure out how to do this.  So, I have:  file1.txt file2.txt file3.txt   And I want to have:  file1_20141110184303.txt file2_20141110184303.txt file3_20141110184303.txt   Any use of the date +%Y%m%d%H%M%S after the first use will obviously result in a different values in seconds, so I would like to have the first timestamp appended to the remaining files. The problem of counting the solutions $(a_1,a_2,\ldots,a_n)$ with integer $a_i\geq0$ for $i\in\{1,2,\ldots,n\}$ such that $$a_1+a_2+a_3+....a_n=N$$ can be solved with a stars-and-bars argument. What is the solution if one adds the constraint that $a_i\leq r_i$ for certain integers $r_1,\ldots,r_n$?  e.g. for $n=3$, $N=6$ and $(r_1,r_2,r_3)=(3,3,2)$, the tuple $(a_1,a_2,a_3)=(2,3,1)$ is a solution, but $(2,1,3)$ is not a solution because $a_3=3&gt;2=r_3$. If I have a native C++ windows program (i.e. the entry point is WinMain) how do I view output from console functions like std::cout? Biblatex: URL-breaking not working in DVI-mode I'm preparing my bibliography and noticed that biblatex-printbibliography produces Overfull \hbox several times.  Examples (gray lines indicates text margins, red line is the physical page margin):        Why is hyperref line-breaking not working as expected using pdflatex or even latex -&gt; dvipdfm BUT not using latex -&gt; dvips -&gt; ps2pdf?  Also it would be great if someone could point out how I can raise the indentation of the second (and following) lines, as this might look better.  edit: Customized question, as the answer given by lockstep solved the third problem. The second problem seems to be identical to the first.  \documentclass[12pt]{scrbook} \usepackage[english]{babel} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage[ps2pdf]{hyperref} %\usepackage[ps2pdf,breaklinks=true]{hyperref} %This doesn't change anything. %\usepackage{breakurl} %That makes no difference either.  \usepackage[a4paper,twoside,showframe]{geometry} %show text margins  \usepackage[style=alphabetic,backend=biber,maxnames=4,minnames=3,maxbibnames=99]{biblatex} \bibliography{biblatex-issue}  \begin{document} \nocite{*}  \printbibliography[heading=subbibliography,type=article,prefixnumbers={A-}] \printbibliography[heading=subbibliography,type=book,prefixnumbers={B-}] \printbibliography[heading=subbibliography,type=online]  \end{document}   And the bib-file:  @online{GLS:datasheet,     title         = "GLS Datasheet",     organization  = "Optoelectronics Research Centre",     howpublished ="Website",     date = "2004-09",     urldate="2013-07-01",     url ="http://www.southampton.XXXX",     address       = "Southampton, United Kingdom" } @book {Lifante:Fundamentals,     title = "Integrated Photonics: Fundamentals",     author = "Lifante, Ginés",     publisher = "J.Wiley",     address = "Chichester",     year = "2003",     type = "text",     isbn = "9780470848685" } @article{Labadie:First_fringes,     author = {Labadie, L. and Mart\'{\i}n, G. and Anheier, N. C. and Arezki, B. and Qiao, H. A. and Bernacki, B. and Kern, P.},     title = {First fringes with an integrated-optics beam combiner at 10},     DOI= "10.1051/0004-6361/201116727",     journal = {A\&amp;A},     year = 2011,     volume = 531,     pages = "A48" }     P.S.: I noticed that the visiting-date of the GLS-datasheet is wrong ;-) Can't specify the 'async' modifier on the 'Main' method of a console app Microdisplacements with adaptive subdivision turning black How do you add a thin outline? I am new at this. I am extracting files a game. In the game they have thin black outlines, but they aren't part of a model. I am having trouble finding anything about this. What is the simplest way to do this?  Update: I think I am looking for something like freestyle. What is the simplest way to use this to create a thin black outline around a model? Why $f(x) = \sqrt{x}$ is a function? Why $f(x) = \sqrt{x}$ is a function (as I found in my textbook) since for example the square root of $25$ has two different outputs ($-5,5$) and a function is defined as "A function from A to B is a rule of corre- spondence that assigns to each element in set A exactly one element in B.", so $f(x) = \sqrt{x}$ is not a function? I am working to build a reinforcement agent with DQN. The agent would be able to place buy and sell orders for a day trading purpose. I am facing a little problem with that project. The question is "how to tell the agent to maximize the profit and avoid the transaction where the profit is less than 100$".  I want to maximize the profit inside a trading day and avoid to place the pair (limit buy order, limit sell order) if the profit on that transaction is less than 100$. The idea here is to avoid the little noisy movements. Instead, I prefer long beautiful profitable movements. Be aware that I thought using the "Profit &amp; Loss" as the reward.  "I want the minimal profit per transaction to be 100$" ==> It seems this is not something that is enforceable. I can train the agent to maximize profit per transaction, but how that profit is cannot be ensured.  At the beginning, I wanted to tell the agent, if the profit of a transaction is 50 dollars, I will remove 100 dollars, then It becomes a penalty of 50 dollars for the agent. I thought it was a great way to tell the agent to not place a limit buy order if you are not sure it will give us a minimal profit of 100$. It seems that all I would be doing there is simply shifting the value of the reward. The agent only cares about maximizing the sum of rewards and not taking care of individual transactions.   How to tell the agent to maximize the profit and avoid the transaction where the profit is less than 100$? With that strategy, what guarantee that the agent will never make a buy/sell decision that results in less than 100 dollars profit? Does the sum of reward - # transaction * 100 can be a solution? Do you have to take the second leg of a domestic flight? Say I want to book a flight from Fort Lauderdale to Chicago.  Say the airline also flies to St. Louis from Fort Launderdale but has a connecting flight through Chicago.  If I book that flights from FLL->ORD->STL and just get off in Chicago, what possible problems can I run into, assuming I didn't check any bags and only have carry on?  This scenario exist for Southwest, but I wanted this be more of a general question that would apply to all airlines. Which "mean" to use and when? So we have arithmetic mean (AM), geometric mean (GM) and harmonic mean (HM). Their mathematical formulation is also well known along with their associated stereotypical examples (e.g., Harmonic mean and it's application to 'speed' related problems).  However, a question that has always intrigued me is "how do I decide which mean is the most appropriate to use in a given context?" There must be at least some rule of thumb to help understand the applicability and yet the most common answer I've come across is: "It depends" (but on what?).  This may seem to be a rather trivial question but even high-school texts failed to explain this -- they only provide mathematical definitions!  I prefer an English explanation over a mathematical one -- simple test would be "would your mom/child understand it?" Given an alphabet of size $n$, how many strings of length $c$ contain every single letter of the alphabet at least once?  I first attempted to use a recurrence relation to work it out:  $$ T(c) = \left\{ \begin{array}{cr} 0 &amp;\mbox{ if $c&lt;n$} \\ n! &amp;\mbox{ if $c = n$} \\ T(c-1) \cdot n \cdot c &amp;\mbox{ if $c &gt; n$} \end{array} \right. $$  As there's no strings that contain every letter if c &lt; n, and if c = n then it's just all permutations. When c > n you can take any string of size (c-1) that contains all letters (of which there are $T(c-1)$ to choose from), you choose which letter to add (of which there are $n$ choices) and there are $c$ different positions to put it. However, this gives out results that are larger than $n^c$ (the total number of strings), so it can't be right, and I realised it was because you could count some strings multiple times, as you can make them taking different inserting steps.   Then I thought about being simpler: you choose n positions in the string, put each letter of the alphabet in one of those positions, then let the rest of the string be anything:  $$ {c\choose{n}} \cdot n! \cdot n^{c-n} $$  But again this counts strings multiple times.  I've also considered using multinomial coefficients, but as we don't know how many times each letter appears in the string it seems unlikely they would be much help. I've also tried several other methods, some complicated and some simple, but none of them seem to work.  How would you go about working out a formula for this? I'm sure there's something simple that I'm missing. Lazy loading properties after an insert Do there exist general conditions under which we can conclude that continuity on a topological space is detected by $\mathbb{R}$? Whenever $X$ is a topological space, let us say that continuity on $X$ is detected by $\mathbb{R}$ iff for all functions $f : X \rightarrow Y$ where $Y$ is another topological space, we have that if every continuous function $c : \mathbb{R} \rightarrow X$ satisfies "$f \circ c$ is continuous", then $f$ is itself continuous.   Clearly, continuity on $\mathbb{R}$ is detected by $\mathbb{R}$ It is shown  that continuity on $\mathbb{R}^2$ is detected by $\mathbb{R}$. Clearly, it is not the case that continuity on $\mathbb{Q}$ is detected by $\mathbb{R}$, since every continuous mapping $\mathbb{R} \rightarrow \mathbb{Q}$ is constant.      Question. Do there exist general conditions underwhich we can conclude that continuity on a topological space is detected by $\mathbb{R}$? Constants in Objective-C I'm developing a  application, and I'm using constant NSStrings as ways to store key names for my preferences.  I understand this is a good idea because it allows easy changing of keys if necessary. Plus, it's the whole 'separate your data from your logic' notion.     Anyway, is there a good way to make these constants defined once for the whole application?     I'm sure that there's an easy and intelligent way, but right now my classes just redefine the ones they use. javascript object access performance