I am trying to return the parameter names from the following enum model. Here is  my code  using System.Text.Json.Serialization;   namespace Digital.HrAssist.Services.Models {     [JsonConverter(typeof(JsonStringEnumConverter))]     public enum EExitStatusDescription     {         Started,         Incomplete,         Completed,         Cancelled,         SubmittedForProcessing     } }   return o =&gt; new EmployeeExitItem {       ExitId = o.ExitId,       EmployeeId = o.EmployeeId,       KickoffDate = o.KickoffDate,       Action = (EExitActions)o.ActionId,       Status = (EExitStatus)o.StatusId,       StatusDescription = (EExitStatusDescription)o.StatusDescription };  public class EmployeeExitItem {     public Guid ExitId { get; set; }     public Guid EmployeeId { get; set; }     public DateTime KickoffDate { get; set; }      [EnumDataType(typeof(EExitActions))]     [JsonConverter(typeof(JsonStringEnumConverter))]     public EExitActions Action { get; set; }      [EnumDataType(typeof(EExitStatus))]     [JsonConverter(typeof(JsonStringEnumConverter))]     public EExitStatus Status { get; set; }      public EExitStatusDescription StatusDescription { get; set; } }   So I want to get the parameter names like "Started", "Incomplete" etc however I am currently getting this error "Cannot convert type 'string to 'digital.hrassist.services.models.EExitStatusDescription''"
Which is the preferred way to convert an Enum to a String in .NET 3.5?   Enum.GetName Enum.Format ToString   Why should I prefer one of these over the others? Does one perform better?
Let $x, y$ and $z$ be real numbers such that $x^2+ y^2+ z^2= 1$. Find the   maximum and minimum values of $2x + 3y + z$ .       How can I able to solve the problem? Thanks for your help. All Stack Exchange data dumps Is there any way to import a .json model into Blender? Enable automatic deletion of old, unanswered, zero-score questions after a year? Related to Meta Super User efforts:  and Meta Server Fault efforts:  We already auto-remove negatively voted unanswered old questions automatically after 30 days, network wide, with no human intervention required. I was thinking we might extend that to remove old, unanswered zero score questions... based on the following criteria:  fewer than (question age in days * 1.5) views 0 score or lower, or 1 score or lower if the original author is deleted no answers 1 comment or fewer asked more than 1 year ago (thus based on creation date, not last activity date, so , or a user editing it, does not give a doomed question 365 more days of zombie &quot;life&quot;)  See the results of this query on:  (10509) |  (787) |  (650) This query has been refined based on the comments, and this is the final version that will roll out tonight. Every site in the network (except metas) will automatically delete old questions that meet this criteria from this point forward. Chain length. how long or how many links I measured from the middle of each sprocket and it's 17 inches. Not sure what length of chain I should get Probability brain teaser with infinite loop I found this problem and I've been stuck on how to solve it.     A miner is trapped in a mine containing 3 doors. The first door leads to a tunnel that will take him to safety after 3 hours of travel. The second door leads to a tunnel that will return him to the mine after 5 hours of travel. The third door leads to a tunnel that will return him to the mine after 7 hours. If we assume that the miner is at all times equally likely to choose any one of doors, what is the expected length of time until he reaches safety?   The fact that the miner could be stuck in an infinite loop has confused me. Any help is greatly appreciated. Show that $E(X)=\int_{0}^{\infty}P(X\ge x)\,dx$ for non-negative random variable $X$ Show that for a non-negative random variable $X$,   $$\mathbb E(X)=\int_0^\infty \mathbb P(X\ge x) \, dx.$$   I started with  $$\mathbb E(X)=\int_0^\infty x \, dF(x)=\int_0^\infty \int_0^x dt\,dF(x).$$ This is my try. Editing a question with only a JSFiddle link does not work I can't edit a question that has a jsfiddle link because it has a lack of code. Can we get privileged users able to bypass restriction? The question had some really poor formatting and linking and I couldn't fix it. :  Html is not taking the css code Some of my html tags are not reacting by the css which i gaved them for example is offerbox not reaction to the html part. all html parts down from offerbox are not taking the styles that i gaved the enter code here http://jsfiddle.net/8Bw7M/  pic from the html and css  I feel that as a privileged user, I should be able to make the changes needed. This is related, but I'm not adding any new links. PHP Session data not being saved I have one of those "I swear I didn't touch the server" situations. I honestly didn't touch any of the php scripts. The problem I am having is that php data is not being saved across different pages or page refreshes. I know a new session is being created correctly because I can set a session variable (e.g. $_SESSION['foo'] = "foo" and print it back out on the same page just fine. But when I try to use that same variable on another page it is not set! Is there any php functions or information I can use on my hosts server to see what is going on?  Here is an example script that does not work on my hosts' server as of right now:  &lt;?php session_start(); if(isset($_SESSION['views']))     $_SESSION['views'] = $_SESSION['views']+ 1; else     $_SESSION['views'] = 1;  echo "views = ". $_SESSION['views']; echo '&lt;p&gt;&lt;a href="page1.php"&gt;Refresh&lt;/a&gt;&lt;/p&gt;'; ?&gt;   The 'views' variable never gets incremented after doing a page refresh. I'm thinking this is a  problem on their side, but I wanted to make sure I'm not a complete idiot first.  Here is the phpinfo() for my hosts' server (PHP Version 4.4.7): How to Disavow Bad Backlinks Automatically? Most commented post should be the first post in the blog WordPress default setting is, most recent post is the first post of the blog.  But, I need to "Most commented post should be the first post in the blog". ( Categories page as well as home page) What are the effects of exceptions on performance in Java? Question:  Is exception handling in Java actually slow?  Conventional wisdom, as well as a lot of Google results, says that exceptional logic shouldn't be used for normal program flow in Java.  Two reasons are usually given,   it is really slow - even an order of magnitude slower than regular code (the reasons given vary),     and    it is messy because people expect only errors to be handled in exceptional code.     This question is about #1.  As an example,  describes Java exception handling as "very slow" and relates the slowness to the creation of the exception message string - "this string is then used in creating the exception object that is thrown. This is not fast."  The article  says that "the reason for this is due to the object creation aspect of exception handling, which thereby makes throwing exceptions inherently slow".  Another reason out there is that the stack trace generation is what slows it down.  My testing (using Java 1.6.0_07, Java HotSpot 10.0, on 32 bit Linux), indicates that exception handling is no slower than regular code.  I tried running a method in a loop that executes some code.  At the end of the method, I use a boolean to indicate whether to return or throw.  This way the actual processing is the same. I tried running the methods in different orders and averaging my test times, thinking it may have been the JVM warming up.  In all my tests, the throw was at least as fast as the return, if not faster (up to 3.1% faster).  I am completely open to the possibility that my tests were wrong, but I haven't seen anything out there in the way of the code sample, test comparisons, or results in the last year or two that show exception handling in Java to actually be slow.  What leads me down this path was an API I needed to use that threw exceptions as part of normal control logic.  I wanted to correct them in their usage, but now I may not be able to.  Will I instead have to praise them on their forward thinking?  In the paper , the authors suggest that the presence of exception handlers alone, even if no exceptions are thrown, is enough to prevent the JIT compiler from optimizing the code properly, thus slowing it down.  I haven't tested this theory yet. How to prove that $L=${$a^p$: p is prime} isn't regular? I tried using pumping lemma or finding infinite equivalence classes, but I didn't succeed.  It's clear to me that there is no automata that accepts this language, but I just can't formally prove that this language isn't regular.  How can you prove it? Escaping regex string I want to use input from a user as a regex pattern for a search over some text.  It works, but how I can handle cases where user puts characters that have meaning in regex? For example, the user wants to search for Word (s): regex engine will take the (s) as a group.  I want it to treat it like a string &quot;(s)&quot; .  I can run replace on user input and replace the ( with \( and the ) with \) but the problem is I will need to do replace for every possible regex symbol. Do you know some better way ? Another problem from quora.  What can be said about $v =\prod_{s=2}^{\infty} \zeta(s) $?  Wolfy says that $v \approx 2.294856591673313794183 $.  The Inverse Symbolic Calculator () finds nothing.  Here are the close values:  $2294856391585950 = (0064) sum((7/6*n^3-3*n^2+65/6*n-3)/(Fibo(n)+1),n=1..inf)\\ 2294856397653578 = (0001) GAM(5/6)*BesI(1,2)^{GAM(7/12)}\\ 2294856469349552 = (0006) 1/4357571\\ 2294856473388934 = (0324) 1/10*(10+14^{1/2}*10^{1/4})^{1/2}*10^{3/4}\\ 2294856488490537 = (0001) BesJ(0,1)^{GAM(1/3)/GAM(5/12)}\\ 2294856524215021 = (0314) sin(Pi*8/45)-sin(Pi*14/51)\\ 2294856591673313 \text{ would be here}\\ 2294856740350177 = (0011) sum((2*n^3-5*n^2+22*n-14)/(n!+2),n=1..inf)\\ 2294856991319600 = (0324) 23^{1/2}/(12^{3/4}-3^{2/3})^{1/2}\\ 2294857017919943 = (0001) Feig2*Li4(1/2)/GAM(5/6)\\ 2294857089879260 = (0248) F(11/26;27/50;1) \\ 2294857493303450 = (0404) Psi(1/21)+Psi(19/21)+Psi(13/14)\\ $  I tried using Euler's zeta product and partition sum, but this didn't seem to help. Here is what resulted:  $\zeta(s) =\dfrac1{\prod_p (1-p^{-s})} $.  $\begin{array}\\ v &amp;=\prod_{s=2}^{\infty} \zeta(s)\\ &amp;=\prod_{s=2}^{\infty} \dfrac1{\prod_p (1-p^{-s})}\\ &amp;=\prod_{s=2}^{\infty} \prod_p\dfrac1{ (1-p^{-s})}\\ &amp;= \prod_p\prod_{s=2}^{\infty}\dfrac1{ (1-p^{-s})}\\ \end{array} $  Euler's product identity states that $\prod_{n=1}^{\infty}\dfrac1{1-zx^n} =\sum_{n=1}^{\infty} \dfrac{x^nz^n}{\prod_{k=1}^n(1-x^k)} $. Putting $x=z=\dfrac1{p} $, $\prod_{n=2}^{\infty}\dfrac1{1-p^{-n}} =\sum_{n=1}^{\infty} \dfrac{p^{-2n}}{\prod_{k=1}^n(1-p^{-k})} $.  That's as far as I can go. I know that I can use  to make cross-references and hyperlinks clickable.  That makes the clickable areas outlined in fluorescent green, however.  How can I make the green boxes go away? PostgreSQL Shapefile import failed I am very new to PostGIS/PostgreSQL. In fact, I downloaded it because of the answers I got to this question:   I installed both PostgreSQL and PostGIS. But I am not able to import a shapefile to the database? It gives an error, "Shapefile import failed". What am I doing wrong? Which is correct, "neither is" or "neither are"? Bob: "Can I set the font color? Can I customize the text?"  Frank: "Neither of these options is available. Sorry!"    Is "neither is" always correct or should one use "neither are" in some cases and what are the exact rules?  of this-is-why-stackexchange-exists :P How to (properly) remove the parentheses around the year in authoryear style? (v3) I have a question that has been answered a few times, but does not work for me (and also not for another commenter in a previously asked question).   I want to remove the parenthesis around the yead in the bibliography with biblatex style authoryear, and ideally also add a comma and space before it. I have looked at the following questions:        I use biber 2.10 and TexLive 2017/W32Tex.  This MWE should work according to the question v2 above, but does not work for me, i.e. the output is still Author, Anne (2001a). Alpha. The output I need is Author, Anne, 2001a. Alpha.  \documentclass{article}  \usepackage[style=authoryear,dashed=false]{biblatex} \usepackage{xpatch,filecontents}  \begin{filecontents}{\jobname.bib} @misc{A01,author={Author, Anne},year={2001},title={Alpha}} @misc{A02,author={Author, Anne},year={2001},title={Beta}} \end{filecontents} \addbibresource{\jobname.bib}  \xpatchbibmacro{date+extrayear}{%   \printtext[parens]% }{%   \setunit*{\addperiod\space}%   \printtext% }{}{}   \begin{document} \nocite{*} \printbibliography \end{document} I just started real analysis.  I don't have a background in proofs or logic, simply calculus.  So I'm trying to learn more about proofs--so forgive the basic question, please.  How do you go about proving this theorem: If $a$ and $b$ are any numbers, then there is one and only one number $x$ such that $a + x=b$.  This number is given by $x=b+(-a)$.  First part of the proof I understand--it's simple.  We simply use some axioms and do the following:  $a+b-a=b$, which of course is true.  This is just true from plugging in the $b+(-a)$ for $x$.  But how about the uniqueness issue?  In my text, it says:  $$(a+x)+(-a)=b+(-a) x=b+(-a)$$  How does this prove uniqueness?  Is this equation essentially saying that the ONLY possible value of $x$ is expressed by $b+(-a)$?  How would I have known to set this up as part of the proof if I was asked to prove something is unique?  Sorry for the basic question--have to start somewhere.