Another problem has risen about my Earth. When the camera starts to go away from the Earth, these weird fragments appear. I've figured out that it's the Earth map coming through the clouds and atmosphere but only at a distance. They're far apart enough and I don't know if it's a setting that causes this.
I have recently started using blender and one of the models I'm working on has dark shadows along edges. I started this model from scratch. I can't remember them being there when I first started the model, but I had trouble joining areas together and think I've pressed something I shouldn't have. However, there are so many options I'm not sure what I did.  Here is an image of what I mean   The one on the left has the shadow. As a test I started a new model, which is on the right in the image, and as you can see it doesn't have any shadows.  Also, occluded vertices partially show through the model. Occlusion doesn't work properly.   In orthogonal view small darkened triangles appear along the the edges.    I don't really want to start the model again from scratch so any ideas on how to remove this shadow would be great. Thanks.
$f\geq 0$, continuous and $\int_a^b f=0$ implies $f=0$ everywhere on $[a,b]$ How do I manage (add/remove) all the startup applications in Ubuntu 11.10 and up?  Startup Applications doesn't show all the applications which are started during boot. When should static_cast, dynamic_cast, const_cast and reinterpret_cast be used? Mikrotik NAT halves WAN speed Why $9$ & $11$ are special in divisibility tests using decimal digit sums? (casting out nines & elevens) I don't know if this is a well-known fact, but I have observed that every number, no matter how large, that is equally divided by $9$, will equal $9$ if you add all the numbers it is made from until there is $1$ digit. A quick example of what I mean:  $9*99 = 891$ $8+9+1 = 18$ $1+8 = 9$  This works even with really long numbers like $4376331$ Why is that? This doesn't work with any other number. Similarly for $11$ and alternating digits sums. Loop "Forgets" to Remove Some Items Suppose that $f$ is analytic on a close curve γ. Prove or disprove $\int_\gamma \overline{f(z)}f'(z)dz$ is purely imagine. Suppose that $f$ is analytic on a close curve γ. Prove or disprove   $$\int_\gamma \overline{f(z)}f'(z)dz$$  is purely imagine.  I know that $f$ is analytic on a close curve, then   $$\int_\gamma f(z) dz=0$$  I tried an example with $\gamma =e^{it}$ with $0\leq t\leq 2\pi$, I often get the real part of the integral equal zero.  I tried let $f=u+iv$ so $f'=u_x+iv_x$. Since $f=u+iv$, $\overline{f}=u-iv$  $$\overline{f(z)}f'(z)=uu_x+vv_x+i(uv_x-vu_x)$$  But this doesn't get me anywhere. Any help would be greatly appreciated. Whenever I play a PC game with the directional keys, I can only press two buttons at a time.  For instance if I am playing a shooter like R-Type, I cannot hold down the fire button while moving diagonally at the same time.  The computer simply ignores the extra button press.  How do I remove this limit so I can shoot while moving diagonally?  This limitation seems to apply for every game.  I am running Windows 7 if it makes any difference.  I noticed the same problem back when I used Windows XP. I have two checkboxes in a lightning component, when we click on the first checkbox it marks true to the other checkbox, it works well only with the UI tags but doesn't work when I convert it to lightning tag  &lt;ui:inputCheckbox aura:id="box3" change="{!c.selectAll}"/&gt;  &lt;ui:inputCheckbox aura:id="boxPack" value=""                                                          change="{!c.checkboxSelect}"/&gt;   below are the lightning tags  &lt;lightning:input type="checkbox" aura:id="box3" onclick="{!c.selectAll}"/&gt;  &lt;lightning:input type="checkbox" aura:id="boxPack" value=""                                                          onclick="{!c.checkboxSelect}"/&gt;   controller  checkboxSelect: function(component, event, helper) {         // get the selected checkbox value           var selectedRec = event.getSource().get("v.value");         // get the selectedCount attrbute value(default is 0) for add/less numbers.          var getSelectedNumber = component.get("v.selectedCount");         // check, if selected checkbox value is true then increment getSelectedNumber with 1          // else Decrement the getSelectedNumber with 1              if (selectedRec == true) {             getSelectedNumber++;         } else {             getSelectedNumber--;         }         // set the actual value on selectedCount attribute to show on header part.          component.set("v.selectedCount", getSelectedNumber);     },      selectAll: function(component, event, helper) {         //get the header checkbox value           var selectedHeaderCheck = event.getSource().get("v.value");         // get all checkbox on table with "boxPack" aura id (all iterate value have same Id)         // return the List of all checkboxs element          var getAllId = component.find("boxPack");         // If the local ID is unique[in single record case], find() returns the component. not array            if(! Array.isArray(getAllId)){             if(selectedHeaderCheck == true){                  console.log('true');                 component.find("boxPack").set("v.value", true);                 component.set("v.selectedCount", 1);             }else{                 component.find("boxPack").set("v.value", false);                 component.set("v.selectedCount", 0);             }         }else{             // check if select all (header checkbox) is true then true all checkboxes on table in a for loop               // and set the all selected checkbox length in selectedCount attribute.             // if value is false then make all checkboxes false in else part with play for loop              // and select count as 0              if (selectedHeaderCheck == true) {                 for (var i = 0; i &lt; getAllId.length; i++) {                     component.find("boxPack")[i].set("v.value", true);                     component.set("v.selectedCount", getAllId.length);                 }             } else {                 for (var i = 0; i &lt; getAllId.length; i++) {                     component.find("boxPack")[i].set("v.value", false);                     component.set("v.selectedCount", 0);                 }             }          }        }, Properly discontinuous actions and discrete groups in complete Riemannian manifolds. I was reading the article "The Geometries of 3-manifolds" by Peter Scott and in the end of page 406 he states the following:     If $G$ acts properly discontinuously on a space $X$, then $G$ is a   discrete subset of the space of all continuous functions $X \to X$   with the compact-open topology. The converse is false, in general, but   is true if $X$ is a complete Riemannian manifold and $G$ is a group of   isometries of $X$.   How do I prove the last statement?     If $X$ is a complete Riemannian manifold and   $G$ is a group of isometries of $X$ acting properly discontinuously on $X$, then $G$ is discrete.    Observation: We say a group $G$ of homeomorphisms of $X$ acts properly discontinuously on $X$ if for every compact $K \subset X$ the set $$\{g \in G: gK \cap K \neq \emptyset\}$$ is finite. I am trying to solve this exercise from Royden's 3rd edition.     The question is as follows: Let $f$ be a real-valued function defined for all real numbers. Show that the set of points at which $f$ is continuous is a $G_{\delta}$.    Let $$A_n = \{y : \text{there is a }~\delta_y \gt 0 : |f(s)-f(t)|\lt 1/n ~ \text{whenever}~ s,t \in (y-\delta, y+\delta)\}\;.$$     Then by the definition of open sets, $A_n$ is open.     To complete the proof, I need help in showing that $f$ is continuous at say $x$ if and only if $x\in \cap A_n$.     If $f$ is continuous at $x$, the there is a $\delta \gt 0$ such that $|f(x) - f(a)| \lt 1/n$ whenever, $x\in (a-\delta, a+\delta)$. so $x \in A_n$ son it must be in $\cap A_n$.  Thanks. An excerpt from Introduction to Analytic Number Theory by Tom M. Apostol.      I have three main concerns regarding this proof:    What is the abscissa of convergence for $\frac{1}{F(s)}$ - why can we take the product of the two series. I only know this is true if the two series are absolutely convergent.  Why can we do term by term integration? I believe its suffices to show that the series converges locally uniformly - BUT is this true?  How does the proof show that $G(s)$ converges uniformly? Retrieving date in sql server, CURRENT_TIMESTAMP vs GetDate() Using SQL Server - which is the fastest or best practice method to use for date retrieval? Is there a difference? How to enable root login? Is using "fruits" as the plural of "fruit" acceptable? How to take a site offline using Drush? Determine if two rectangles overlap each other? I am trying to write a C++ program that takes the following inputs from the user to construct rectangles (between 2 and 5): height, width, x-pos, y-pos. All of these rectangles will exist parallel to the x and the y axis, that is all of their edges will have slopes of 0 or infinity.  I've tried to implement what is mentioned in  question but I am not having very much luck.  My current implementation does the following:  // Gets all the vertices for Rectangle 1 and stores them in an array -&gt; arrRect1 // point 1 x: arrRect1[0], point 1 y: arrRect1[1] and so on... // Gets all the vertices for Rectangle 2 and stores them in an array -&gt; arrRect2  // rotated edge of point a, rect 1 int rot_x, rot_y; rot_x = -arrRect1[3]; rot_y = arrRect1[2]; // point on rotated edge int pnt_x, pnt_y; pnt_x = arrRect1[2];  pnt_y = arrRect1[3]; // test point, a from rect 2 int tst_x, tst_y; tst_x = arrRect2[0]; tst_y = arrRect2[1];  int value; value = (rot_x * (tst_x - pnt_x)) + (rot_y * (tst_y - pnt_y)); cout &lt;&lt; "Value: " &lt;&lt; value;     However I'm not quite sure if (a) I've implemented the algorithm I linked to correctly, or if I did exactly how to interpret this?  Any suggestions? How can I run everything as root I have dual booted to lubuntu (with Windows XP) and everytime and then I'm getting asked for my password. How do I run everything as root and not ask a password again? Ideally I wanted to run nginx but it has permission denied issues:  apathetic@ubuntu:~$ service nginx start Starting nginx: nginx: [alert] could not open error log file: open() "/var/log/nginx/error.log" failed (13: Permission denied) 2012/08/03 20:06:25 [warn] 4762#0: the "user" directive makes sense only if the master process runs with super-user privileges, ignored in /etc/nginx/nginx.conf:1 nginx: the configuration file /etc/nginx/nginx.conf syntax is ok 2012/08/03 20:06:25 [emerg] 4762#0: open() "/var/run/nginx.pid" failed (13: Permission denied) nginx: configuration file /etc/nginx/nginx.conf test failed Can a negative charge ionize air? Adding to this question, I have studied that positive charge ionizes air but never studied that negative charge ionize air. If possible, please explain how does it ionize air? Why do we need a Stack Overflow in Portuguese? I have noticed there is a Stack Overflow in language differs from English which is global and mostly used by programmers.  I think there is no need for a site in other languages. Otherwise we will end up with 127 StackOverflow sites. I am afraid that we will lose the amount of people sharing data.