What are the special features of the recently announced Circle K Power Cube
What is the difference between the Circle-K and Lawson Power Cube?
What is the difference between independent and mutually exclusive events? why are the best questions the ones which have been closed? Web designer's link back to own website (rel="designer" / rel="nofollow") Is there a way to take a screenshot using Java and save it to some sort of image? Transitivity check vs. Transitive Closure Is checking transitivity of a digraph not easier than (in terms of asymptotic complexity) taking the transitive closure of the digraph? Do we know any lower bound better than $\Omega(n^2)$ to determine if a digraph is transitive or not? GeoServer cutting off symbols close to tile edges? On June 13th 2017 all SharePoint calculated columns with HTML markup stopped working.   Basically the fields now render text (regardless of setting the data type to number). The gist of the notice from Microsoft () is:     In Microsoft SharePoint lists and libraries, calculated fields that   are running in the classic UI mode can be used to display results   based on Excel-like formulas. This is a long standing capability, and   is documented in Calculate data in lists or libraries.      Some users have added HTML markup or script elements to calculated   fields. This is an undocumented use of the feature, and we will begin   blocking execution of custom markup in calculated fields in SharePoint   Online from June 13, 2017 onwards. We are also providing this as a   configurable option for on-premises in SharePoint Server 2016 and   SharePoint Server 2013 via the June 2017 and subsequent Public   Updates.   As we don't have on premise SharePoint (online), we have to find an immediate work around, given that this impacts our processes and thus, business.   Is anyone aware of third party applications that will allow for HTML, script markup (that works with SP online)? How would you evaluate $\liminf\limits_{n\to\infty} \ n \,|\mathopen{}\sin n|$ How would you evaluate the limit inferior of the sequence $n\,|\mathopen{}\sin n|$? That is, $$\liminf\limits_{n\to\infty} \ n \,|\mathopen{}\sin n|$$    Edit. Let $\mu$ be the irrationality measure of $\pi$. Since $\mu$ is not known, I will split the question:   Assuming $\mu &gt; 2$, what is $\liminf\limits_{n\to\infty} \ n\,|\mathopen{}\sin n|$? Assuming $\mu = 2$, what is $\liminf\limits_{n\to\infty} \ n\,|\mathopen{}\sin n|$?     I kind of like its graph... We have a SBS 2011 server with 16GB memory that runs Exchange, WSUS and File Sharing for approx 20 users. The server also gives 2GB memory to a virtual machine running in Hyper-V so 14GB left for the rest.  When the server first boots Store.exe consumes about 500MB memory, WSUS and IIS consume some as well, but we generally are only at 60% capacity. During the course of the working day Store.exe consumes 8GB memory and the server sits at approx 97% capacity.  This makes using the server very slow, logging on via RDP is slow, general server admin is slowed down.  Is this normal? I have read that Exchange will consume lots of memory that it does not neccessarily need and then releases it back to other applications that need it. I have also checked that all mailboxes are opened in cached mode. We do have some external uses who connect via Outlook Anywhere or OWA.  If it's deemed to be "normal" is there some way I can restrict it using ALL available memory and leave a little bit for SBS to use for server admin? I have seen some articles regarding setting a high and low memory flag but rumours that this does not work with update rollup 5 which we have installed.  Am I expecting a single server to do to much with only 14GB memory?  Thanks Show that $a_{n+1}= 1 + \frac{1}{a_n}$ converges. Let $\{a_n\}$ be defined by $a_1 =1  $ and $a_{n+1} = 1 + {\dfrac{1}{a_n}}$ with $n \in N$. Show that $a_{n+1}= 1 + {\dfrac{1}{a_n}}$ converges.  I know the limit but how can I show that is a Cauchy sequence or that this sequence converges. Do these leaves signify anything? Can long term sleeping at day damage your health? I've passed half or more of my life, sleeping in very late and often after the sun rises. Now I believe that I'm already feeling its effect. Some of my hormones are under the ideal levels and I have a deficiency in vitamin D.  What are the effects of sleeping during the day and not at night for work reasons or just habit? Is there any effect that can't be reversed simply by sleeping at night? (Assuming that you are sleeping enough time per day like 7-8 hours)  Could this sleep pattern be related to endocrine ills and other ills? A regular expression to exclude a word/string It seems syntax highlighting is not enabled on every SE site, but later on turns out to be rather advantageous. As an example,  may not have sounded like needing it, yet there is , and I think it's justified since many answers have code in them, e.g. JS for InDesign scripts, some GREP-regex and (rather obviously) HTML and CSS. While I'd appreciate having syntax highlighting activate on that specific site (so please upvote ), this question is more general about two points:   Why is syntax highlighting disabled on some sites at all? Are the additional resource costs really so high? Couldn't caching improve that then? How to actually proceed when it should become activated on a specific site? It seems feature requests on the specific meta site are not exactly handled quickly (the request mentioned above is from 2013!), and also appear overkill for a simple "please switch that site's config bool for syntax highlighting". Let's assume that one has some modern HP printer and/or scanner which is not supported by HPLIP package from official repository. Currently Ubuntu versions have :  trusty (14.04LTS): 3.14.3-0ubuntu3.4 xenial (16.04LTS): 3.16.3+repack0-1 bionic (18.04LTS): 3.17.10+repack0-5 focal (20.04LTS): 3.20.3+dfsg0-2 groovy (20.10): 3.20.5+dfsg0-3build1 hirsute (21.04): 3.21.2+dfsg1-2   What can one do if printer is supported in newer version of HPLIP (checked this in )? Optimization when Cost Function Slow to Evaluate Gradient descent and many other methods are useful for finding local minima in cost functions. They can be efficient when the cost function can be evaluated quickly at each point, whether numerically or analytically.    I have what appears to me to be an unusual situation. Each evaluation of my cost function is expensive. I am attempting to find a set of parameters that minimize a 3D surface against ground truth surfaces. Whenever I change a parameter, I need to run the algorithm against the entire sample cohort to measure its effect.  In order to calculate a gradient, I need to change all 15 parameters independently, meaning I have to regenerate all the surfaces and compare against the sample cohort way too many times per gradient, and definitely way too many times over the course of optimization.  I have developed a method to circumvent this problem and am currently evaluating it, but I am surprised that I have not found much in the literature regarding expensive cost function evaluations.  This makes me wonder if I am making the problem harder than it is and that there might be a better way already available.  So my questions are basically this: Does anyone know of methods for optimizing cost functions, convex or not, when evaluation is slow?  Or, am I doing something silly in the first place by rerunning the algorithm and comparing against the sample cohort so many times? What does 'foo' really mean? I hope this qualifies as a programming question, as in any programming tutorial, you eventually come across 'foo' in the code examples. (yeah, right?)  what does 'foo' really mean?  If it is meant to mean nothing, when did it begin to be used so? JavaScript object: access variable property by name as string How do you serialize an object in C++? I have a small hierarchy of objects that I need to serialize and transmit via a socket connection.  I need to both serialize the object, then deserialize it based on what type it is.  Is there an easy way to do this in C++ (as there is in Java)?  Are there any C++ serialization online code samples or tutorials?  EDIT: Just to be clear, I'm looking for methods on converting an object into an array of bytes, then back into an object.  I can handle the socket transmission. I have just started special theory of relativity. The limiting speed known as speed of light fascinated me most. I asked my teacher:      Consider two massless objects moving in the same direction at the speed of light. What would be their relative velocity w.r.t each other?   My teacher tells me that their relative velocity would be zero. But then the speed of light is universal constant regardless of the motion of its frame of reference, so shouldn't their relative velocity be $c$? What is their relative velocity and how? Do objects moving at the speed of light obey law of addition of velocities?