With Screenspace reflections on I want to keep my edge fading at 0.075, but prevent it from fading the edges of the screen when zoomed in on a reflective surface.  So currently I get this really nasty effect on my window material (top left) when it's not fully in frame:    Is there a way to render the borders just outside the camera's vision, and then crop that to my actual desired output resolution to get around this? Is this possible with render borders?  So although I want a 1920x1080 image, I want to render, say, 2120x1280 (an extra 100px around the borders) and then have blender crop it back to what it should be and save this as the render output.  Edit: This is not a duplicate of the referred to question. The problem has nothing to do with faces not facing the camera and not being reflected. There's almost no reflection in the glass but this is intentional. I just wanted to show the black edge effect in a previously rendered frame.
I started to work with EEVEE short time ago and I was amazed by the capabilities of this engine. However, I noticed something strange when I was rendering some tests. Some objects/reflections/shadows dissapear when they're off canvas. I imagine that maybe this is for save memory data, but it can be not suitable to some projects. To make my point graphical, I made a simple scene with simple objects. The main object is the sphere with a mirror-like shader. Out of focus there are different objects with different shaders. A yellow cone, a blue cylinder and a white cube light. But surprisingly, those objects dissapear when the composition is rendered. See the rendered animation below:  Notice that the blue cylinder is not even showing at all in the final render. And the blooming effect from the light cube also dies. I would like to improve this bahaviour and render the objects that are still out of canvas using EEVEE. Do I missing something like memory configuration or reflection/shadow tweaks? Is this caused by the EEVEE engine or by my GPU config (GTX1060)? Thank you in advance!
How to log out user from web site using BASIC authentication? Is it possible to log out user from a web site if he is using basic authentication?  Killing session is not enough, since, once user is authenticated, each request contains login info, so user is automatically logged in next time he/she access the site using the same credentials.  The only solution so far is to close browser, but that's not acceptable from the usability standpoint. What is the relationship between ISO, aperture, and shutter speed? I know digital cameras have ISO options, and that ISO is the camera's sensitivity to light, but if you set  higher ISO then you can get a noisy image. I also know there are two other camera options, shutter speed and aperture.   What is the relationship of between them? Is there any equation, or something like that?  For example, if I set the ISO to 640, then how should I set the shutter speed and aperture? Suggested edit review should show custom rejection reasons Somewhat similar to , but rather more limited: when Rejecting an edit, not only the count of custom rejection reasons but the actual text of the reasons should be shown, IMO. Just now I  on SO that tidied some code in a trivially correct and substantially superior way because it looked perfectly legitimate and I couldn't understand why anyone would bother with a custom rejection reason. As it turned out, it was code in a question, of course.  In this case, the rejection reason correctly identified the problem, and had I seen it, I would have been reminded of that aspect I had neglected to check. How can I prove these are the adjoint operators? Locally bounded additive function is linear Let $T:\mathbb{R}^k\to\mathbb{R}^m$ is additive, i.e. $T(X_1+X_2)=T(X_1)+T(X_2)$. $T$ is locally bounded. Prove that $T$ is a linear transformation.  I know there is a relation between boundedness, convexity and scalar multiplicity. But not sure where to start or how to tie things together. Show that $\left|\frac{\alpha - \beta}{1-\bar{\alpha}\beta}\right| < 1$ when $|\alpha|,|\beta| < 1$ This is the question I'm stumbling with:   When $|\alpha| &lt; 1$ and $|\beta| &lt; 1$, show that:  $$\left|\cfrac{\alpha - \beta}{1-\bar{\alpha}\beta}\right| &lt; 1$$    The chapter that contains this question contains (among others) the triangle inequalities:   $$\left||z_1| - |z_2|\right| \le |z_1 + z_2| \le |z_1| + |z_2| $$  I've tried to use the triangle inequalities to increase the dividend and/or decrease the divisor:  $$\left|\cfrac{\alpha - \beta}{1-\bar{\alpha}\beta}\right| &lt; \cfrac{|\alpha| +|\beta|}{\left|1-|\bar{\alpha}\beta|\right|}$$  But it's not clear if or why that would be smaller than one.  I've also tried to multiply the equation by the conjugated divisor $\cfrac{1-\alpha\bar{\beta}}{1-\alpha\bar{\beta}}$, which gives a real divisor, but the equation does not appear solvable.  Any hint would be much appreciated. Adjectives order: opinion or size? speaking, opinion goes before size, i.e. opinion, size, age, shape, color, origin, material, purpose. However, I saw this example in Practical English Usage, third edition, page 12:      a big beautiful garden   Or you have probably heard the known expression  (BBW). What am I missing? How to get hardware specs of Android device? Is there any bidirectional 5v-3.3v level shifter? How to find the working folder of a servlet based application in order to load resources A great Python IDE for Ubuntu Possible Duplicate:          I want to develop Python apps in Ubuntu, and I'm tired of working with gedit one time and another.  So I'm trying to find a great Python IDE (a true IDE, not just a syntax-highlighting editor) on the Ubuntu repositories. Which one do you recommend me? How to show that the cohomology of a Grassmannian has a basis consisting of the equivalent classes represented by Schubert cycles? Let $G(r, n)$ be the Grassmannian of the set of all $r$-planes in a $n$-dim vector space. How to show that the cohomology of a Grassmannian has a basis consisting of the equivalent classes represented by Schubert cycles? I am confused since I don't know how to compute the cohomology of a variety (how to construct the co-chain complex). I am really appreciate if you can compute the cohomology of, for example, $G(2,4)$ and show that it has a basis consisting of the equivalent classes represented by Schubert cycles. Some guy called one of my Snipplr submissions "crap" because I used if ($_SERVER['REQUEST_METHOD'] == 'POST') instead of if ($_POST)  Checking the request method seems more correct to me because that's what I really want to do. Is there some operational difference between the two or is this just a code clarity issue? Understanding MCMC and the Metropolis-Hastings algorithm Over the past few days I have been trying to understand how Markov Chain Monte Carlo (MCMC) works. In particular I have been trying to understand and implement the Metropolis-Hastings algorithm. So far I think I have an overall understanding of the algorithm but there are a couple of things that are not clear to me yet. I want to use MCMC to fit some models to data. Because of this I will describe my understanding of Metropolis-Hastings algorithm for fitting a straight line $f(x)=ax$ to some observed data $D$:  1) Make an initial guess for $a$. Set this $a$ as our current $a$ ($a_0$). Also add $a$ at the end of the Markov Chain ($C$).  2) Repeat the steps bellow a number of times.  3) Evaluate current likelihood (${\cal L_0}$) given $a_0$ and $D$.  4) Propose a new $a$ ($a_1$) by sampling from a normal distribution with $\mu=a_0$ and $\sigma=stepsize$. For now, $stepsize$ is constant.  5) Evaluate new likelihood (${\cal L_1}$) given $a_1$ and $D$.  6) If ${\cal L_1}$ is bigger than ${\cal L_0}$, accept $a_1$ as the new $a_0$, append it at the end of $C$ and go to step 2.  7) If ${\cal L_1}$ is smaller than ${\cal L_0}$ generate a number ($U$) in range [0,1] from a uniform distribution  8) If $U$ is smaller than the difference between the two likelihoods (${\cal L_1}$ - ${\cal L_0}$), accept $a_1$ as the new $a_0$, append it at the end of $C$ and go to step 2.  9) If $U$ is bigger than the difference between the two likelihoods (${\cal L_1}$ - ${\cal L_0}$), append the $a_0$ at the end of $C$, keep using the same $a_0$, go to step 2.  10) End of Repeat.  11) Remove some elements from the start of $C$ (burn-in phase).  12) Now take the average of the values in $C$. This average is the estimated $a$.  Now I have some questions regarding the above steps:   How do I construct the likelihood function for $f(x)=ax$ but also for any arbitrary function? Is this a correct implementation of Metropolis-Hastings algorithm? How the selection of the random number generation method at Step 7 can change the results? How is this algorithm going to change if I have multiple model parameters? For example, if I had the model $f(x)=ax+b$.   Notes/Credits: The main structure of the algorithm described above is based on the code from an MPIA Python Workshop. Most efficient way to see if an ArrayList contains an object in Java I have an ArrayList of objects in Java.  The objects have four fields, two of which I'd use to consider the object equal to another.  I'm looking for the most efficient way, given those two fields, to see if the array contains that object.  The wrench is that these classes are generated based on XSD objects, so I can't modify the classes themselves to overwrite the .equals.    Is there any better way than just looping through and manually comparing the two fields for each object and then breaking when found?  That just seems so messy, looking for a better way.  Edit: the ArrayList comes from a SOAP response that is unmarshalled into objects. Copying prod multi-site installation to dev multi-site installation I am attempting to upgrade my Drupal 8.9.2 multi-site installation to D9. I was hoping to work this all out on a development installation, that is located in a subdirectory of my home directory on my NameCheap Shared Hosting plan. When I first installed this installation, I did so using the tarball method from years ago. I then followed the instructions given here (). I was able to get the current running prod version converted to use composer with out an issue. Before I go and start messing with the files, and attempting to upgrade to D9 through composer on a prod installation, I wanted to copy these files over to another installation where I can use it as a sandbox. To do this I:  copied the files on my server to a new directory made clone databases for the new installation truncated all the cache tables in the cloned DB changed all the database settings in the settings files to point to the cloned databases  I've done this before without any issues, and now I seem to be getting a WSOD error on all the sites running from the new installation. The error I'm getting is  PHP Fatal error:  Uncaught Error: Class 'Drupal\Core\Cache\DatabaseBackend' not found in ~/{new installation dir}/public_html/index.php:16.  If anyone has any thoughts what's going on I am all ears. Thank you in advance I know, it's been asked before but I couldn't really get a satisfying answer for some details/backgrounds and I guess it's an important question for many.    Some application seem only to be running with Adobe Flash 15 (or at least I know it does, because I have that version on my Windows Partition).  The official Adobe website says:     NOTE: Adobe Flash Player 11.2 will be the last version to target Linux as a supported platform. Adobe will continue to provide security backports to Flash Player 11.2 for Linux.   Some search on the web like "Ubuntu Adobe Flash 15" or similar does not return any good websites.  I found something that says   (using a "pepper-based version"), and  .   Is it impossible to use this for Firefox too? Would it be a privacy risk?  Are there no alternative projects (I know it's closed source but there are so many so very bright people out there using something similar to wine but just for the plugin....)?  How about the Mac-Version? Shouldn't someone be able to port that one to Linux? How to calculate the sum of sequence $$\frac{1}{\binom{n}{1}}+\frac{1}{\binom{n}{2}}+\frac{1}{\binom{n}{3}}+\cdots+\frac{1}{\binom{n}{n}}=？$$ How about its limit? Newton's cradle Why, when one releases 2 balls in , two balls on the opposite side bounce out at approximately the same speed as the 1st pair, rather than one ball at higher speed, or 3 balls at lower speed? grep a file, but show several surrounding lines?