I use simple plane object with black material and put a point light above the plane. THe result is when using eevee , the light reflection is way to bright. (see the attachment : top image is cycle, bottom image is eevee). Is this my graphic card or any setting that i need to change ?  Thanks
I get different lightning render with the same scene camera setup.  Cycles render (both experimental and supported feature set) gets weaker lightning and needs more energy.  How can I get the same lightning and reflection setup with EEVEE and Cycles?
Why did the texture I painted in texture paint mode disappear? Access Denied using TakeOwn.exe I have got this file that I can't delete. It happened after a system crash, so the CHKDSK kicked in upon next reboot. After that, I can't delete the file.  THis is on Windows Home Server, and the file is one of those hidden Thumbs.db, and my WHS reports a "File conflict" on the file, the reason: Access Denied"  What I have tried so far, running as an Administrator: Delete: Access Denied TakeOwn.exe : Access Denied Attrib.exe -s -h : Access Denied cacls.exe : Access Denied   (even whe trying to display the current owner) Rename: File not found (its hidden) Re-boot in to safe mode and tried the above: Access Denied Running the above commands as Local System: Access Denied   Tizer Unlocker: Fail (Doesn't find anything locking the file) File Assasin: Crashes ("FindRemoteFileHandles returned NULL value.")  I have used the CHKDSK /f again, rebooted since some suggestions is that the file has been corrupted, but that didn't change anything. Any suggestions ?  Update: In a total separate scenario, I experienced a similar situation; Access Denied when trying to take ownership of a file. It turned out that the file was owned by TrustedInstaler, which is not possible to override just by being an Administrator. In this case, one can use psexec /ids cmd to elevate yourself to System and then TakeOwn.exe /a How to debug EntityMalformedException? I've got fatal error EntityMalformedException: Missing bundle property on entity of type node. in entity_extract_ids() (line 7700 of .\includes\common.inc) when trying to access user/xyz.  I tried to retrieve info about the malformed node at line 7700, where the error message is built, thinks like :  if (!isset($entity-&gt;{$info['entity keys']['bundle']}) || $entity-&gt;{$info['entity keys']['bundle']} === '') {  dpm($info);// or dpm($entity);  throw new EntityMalformedException(t('Missing bundle property on entity of type @entity_type.', array('@entity_type' =&gt; $entity_type))); }   dpm($entity) returns an unexpected user object, and $info a huge qty of things.   Could somebody put me on the right way ?  I already read whatever I could find about Missing bundle property errors, but none helped solving.  dpm($entity) returns  uid (String, 2 characters ) 70 name (String, 9 characters ) John pass (String, 55 characters ) $S$DUwPuOuDPiDL4nRTYXqc7a5uOfMKey7pyhOFUEKka1XM... mail (String, 30 characters ) john@example.com theme (String, 0 characters ) signature (String, 0 characters ) signature_format (String, 13 characters ) filtered_html created (String, 10 characters ) 1396286331 access (String, 10 characters ) 1397146661 login (String, 10 characters ) 1396513460 status (String, 1 characters ) 1 timezone (NULL) language (String, 2 characters ) fr picture (NULL) init (String, 30 characters ) john@example.com data (Array, 5 elements) roles (Array, 1 element) og_user_node (Array, 0 elements) message_subscribe_email (Array, 1 element) field_bio (Array, 0 elements) field_name_first (Array, 1 element) field_name_last (Array, 1 element) field_facebook_url (Array, 0 elements) field_linkedin_url (Array, 0 elements) field_twitter_url (Array, 0 elements) user_trusted_contacts (Array, 1 element) group_group (Array, 1 element) group_access (Array, 1 element) metatags (Array, 0 elements) rdf_mapping (Array, 3 elements) realname (String, 13 characters ) John Doe content (Array, 13 elements) entity_view_prepared (Boolean) TRUE privatemsg_disabled (Boolean) FALSE How can I access shared folders on an Ubuntu host and a Windows XP guest? How to use Parameterized MessageFormat with non-Value attributes of JSF components The following question was asked on a high school test, where the students were given a few minutes per question, at most:     Given that,   $$P(x)=x^{104}+x^{93}+x^{82}+x^{71}+1$$   and,   $$Q(x)=x^4+x^3+x^2+x+1$$   what is the remainder of $P(x)$ divided by $Q(x)$?     The given answer was:     Let $Q(x)=0$. Multiplying both sides by $x-1$:   $$(x-1)(x^4+x^3+x^2+x+1)=0 \implies x^5 - 1=0 \implies x^5 = 1$$   Substituting $x^5=1$ in $P(x)$ gives $x^4+x^3+x^2+x+1$. Thus,   $$P(x)\equiv\mathbf0\pmod{Q(x)}$$     Obviously, a student is required to come up with a “trick” rather than doing brute force polynomial division. How is the student supposed to think of the suggested method? Is it obvious? How else could one approach the problem? How do I write a short literal in C++? Very basic question: how do I write a short literal in C++?  I know the following:   2 is an int 2U is an unsigned int 2L is a long 2LL is a long long 2.0f is a float 2.0 is a double '\2' is a char.   But how would I write a short literal?  I tried 2S but that gives a compiler warning. Positive euphemism for "harped on" How can I replace harped on with a more positive expression?  The production manager harped on the new quality assurance regulations for nearly an hour. Is it acceptable to write a thank you in a comment? There have been a number of cases where I would like to thank someone for providing me with a thorough response and give them feedback beyond the vote up. Often I wish people would tell me why they voted me up. Not that the thank you part is necessary but it sets it apart from the other comments related to answering the question itself.  In this type of situation is a "Thank you" acceptable in a comment?     For more information, see  in the . A regular function can contain a call to itself in its definition, no problem.  I can't figure out how to do it with a lambda function though for the simple reason that the lambda function has no name to refer back to.  Is there a way to do it?  How? How to show the transfer progress and speed when copying files with cp? Otherwise, is there any alternative command line utility that can achieve this? Let $X \ge 0$.  Show  \begin{align} \lim_{y\to\infty} y\,\Bbb{E}\left[ \frac1X \cdot1_{X&gt;y} \right] &amp;= 0 \quad\text{and} \\ \lim_{y \downarrow 0} y\,\Bbb{E}\left[ \frac1X \cdot1_{X&gt;y} \right] &amp;= 0. \end{align}  N.B.: The author doesn't assume $\Bbb{E}[1/X] &lt; \infty$.    My try:  Since the expectation appears on the RHS of Markov's inequality, I don't think this inequality can be applied to solve this question.  $$ \begin{aligned} y\,\Bbb{E}\left[ \frac1X \cdot1_{X&gt;y} \right] &amp;= \Bbb{E}\left[ \frac{y}{X} \cdot1_{X&gt;y} \right] \\ &amp;&lt; \Bbb{E}\left[ 1 \cdot1_{X&gt;y} \right] \\ &amp;= \Bbb{P}(X &gt; y) \\ &amp;\xrightarrow[y\to0]{} \Bbb{P}(X \ge 0) = 1 \end{aligned} \tag1 \label1 $$  For the first part $y \to \infty$, I apply Markov's inequality at the row $\Bbb{P}(X &gt; y)$ in \eqref{1}, so that $$\Bbb{P}(X &gt; y) \le \frac{\Bbb{E}[X]}{y} \xrightarrow[y\to\infty]{} 0?$$ But I don't have $\Bbb{E}[X] &lt; \infty$.  Thanks for any help. Use a variable reference "inside" another variable I'm sure it is relatively simple, I just don't know how to do it.  #!/usr/bin/ksh set `iostat` myvar=6   I want to something like echo ${$myvar} which i want interpreted as ${$myvar} -> ${6} -> value How to avoid the 'not properly formatted as code' alert echo "#!" fails -- "event not found" Shape with a slanted side (responsive) I'm going to install 64 bit 14.04 on a new machine with something like 1 to maybe 128GB RAM and even more RAM later. How much space should I allocate to the swap partition?   And especially: WHY those recommendations for these numbers?    (None of the existing answers  and  explain any of the why and are a bit dated if we look at 1GB or RAM and up) How many points in RSA, such that $m^e = m \bmod n$ For every RSA-cryptosystem, there exist some messages $m$, for which it holds that $m^e \equiv m \pmod n$ As to the question, how many such messages exist, this question has already been asked and answered here:  However, I do only understand the answer up to a certain point Suppose that $n$ is only 1 prime. Then it holds that the number of unconcealable messages is $\gcd(e-1, p-1)+1$ This is because in $m^e \equiv m \pmod  p$ , either $m = 0$ or $m \not= 0$. In the latter case $m$ can be expressed as $g^t$, where $g$ is a Generator in $\mathbb{Z_p}$ $g^{t*e} \equiv g^t \pmod p$ $g^{t(e-1) \bmod p -1 } \equiv g^{0 \bmod p -1} \pmod p$ $t(e-1) \equiv 0 \pmod {p-1} $ has exactly $\gcd(e-1, p-1)$  solutions, so the total number of unconcealable messages is, together with $m=0$ , $\gcd(e-1, p-1)+1$ When we now look at real RSA, which has two prime factors in its modulus, it holds that the number of unconcealable messages is $(\gcd(e-1, p-1)+1)\cdot(\gcd(e-1, q-1)+1)$ Why is that so? I suppose it has to do with CRT, but I just cant understand why. How do I evolve Kadabra to its final form without trading it? Does "until [date]" mean "before that date"?