I have this gun im modelling and it seems fine on flat shading but when i smooth shade it causes weird lines on the front flat face. im new to blender and i dont know whats causing this issue please help.
I tried to manipulate a cube with the Boolean modifier. I tried to cut out an edge of the cube with a cylinder. Also, the shading result looks awful in FLAT SHADING mode, so I turned on SMOOTH SHADING.   Has anyone an idea how to achieve a better result. (I also cut out a Sphere first, this made the result less awful).   I used Blender Internal and rendered with smooth shading for smoothness.  Using flat shading looks okay, except the "round" cutouts :/  Face normals are okay.  First image is smooth shading.    EDIT: User Pisurquatre suggested the EdgeSplit modifier, works perfect to me (Maybe a little tweaking here and there):
Why can the last block contain a full block of padding in CBC Encryption? I'm trying to understand the SSL Poodle Attack and I'm wondering why the last block of a CBC Record can be full of padding? Wouldn't that mean that the useful data was already a multiple of the key size?  Maybe I'm misunderstanding something else here, as it would seem like you can pad by any number of full blocks of padding. Just don't see why an SSL Library would do that.  Thanks! Is there a general method (which can be implemented by hand) to finding the $n$-th roots of $2 \times 2$ matrices? Is there a similar method for a general $m \times m$ matrix? (for $n &gt; 1$ and $n\in\mathbb{Z}$) Understanding the definition of the order of an entire function in Ahlfors's Complex Analysis Let $f: \mathbb C \to \mathbb C$ be an entire function. The order of $f$ is defined by $$\lambda=\limsup_{r \to \infty} \frac{\log \log M(r)}{\log r}, $$ where $$M(r)=\max_{|z|=r} |f(z)| .$$  Ahlfors in his Complex Analysis claims that     "According to this definition $\lambda$ is the smallest number such that       $$M(r)\leq e^{r^{\lambda+\varepsilon}} $$ for any given $\varepsilon &gt; 0$ as soon as $r$ is sufficiently large."   Why is this true?  My attempt:  We know that $$\lambda=\lim_{\rho \to \infty} \sup_{r \geq \rho} \frac{\log \log M(r)}{\log r}. $$  From the definition of the limit we have that for any $\varepsilon&gt;0$, there exists some $\rho_0&gt;0$, such that $$\left\lvert \sup_{r \geq \rho} \frac{\log \log M(r)}{\log r}-\lambda \right\rvert \leq \varepsilon ,$$ for every $\rho \geq \rho_0$. In other words $$\frac{\log \log M(r)}{\log r} \leq \lambda+\varepsilon $$ for every $r \geq \rho_0$. From here it is easy to see that $$M(r)\leq e^{r^{\lambda+\varepsilon}}, $$ for all $r \geq \rho_0$. I cannot see why $\lambda$ is the smallest number with this property.  Thanks in advance. Is spacetime discrete or continuous? Inserting an image in plain TeX I used the OzTeX implementation of TeX, also I used to typeset my docs in plain TeX, not LaTeX for me, so I had no problem to insert an image using the OzTeX, now I'm back to TeX docs, am using the TeXWorks frontend, but I can't insert an .eps image file, it seems the \includegraphics macro its only for LaTeX, so I can't use it, any idea on how to insert an image when using plain TeX? return eats exception I found the following behavior at least weird:  def errors():     try:         ErrorErrorError     finally:         return 10  print errors() # prints: 10 # It should raise: NameError: name 'ErrorErrorError' is not defined   The exception disappears when you use return inside a finally clause. Is that a bug? Is that documented anywhere?  But the real question (and the answer I will mark as correct) is: What is the python developers' reason to allow that odd behavior? Version Control: Entire site or just pieces? I've been using git to track changes in the plugins and themes I've developed for different sites. Each plugin or theme has their own repository in whichever local install of WordPress I happen to be using for that project. This works fine when I'm just working on one solitary plugin or theme.  But when I have a local version of an entire site which is a collection of different plugins, themes, WordPress core, etc. Should I be keeping that entire directory under version control?  Is there a best practice to always have a collection of repositories for each theme/plugin, or for each client site to have one monolithic repository that includes all the code used in the project (including the latest copy of WordPress via svn.) 16 GB USB flash drive capacity down to 938 MB After writing the FreeNAS IMG to a 16 GB USB flash drive, I can now only use 938 MB. I used the Win32 Disk Imager tool to write the IMG to the device. Then later, when I inserted the the USB drive into my Windows 7 computer it said that it had to be formatted, because it couldn't read it. I believe this is normal. So I formatted it inside Windows using the format option when prompted. So in Windows Explorer now, 938 MB is reported as capacity of this device.    Also, when i check the properties dialog box I can see the same numbers.    And when I check with diskmgmt.msc I can see there are several volumes I don't recognize and unallocated space of 12.79 GB.    Now, I have another 2 GB USB flash drive with the same problem. It too was used for FreeNAS, and it too has a reported capacity of only 938 MB. I thought it was broken there for a while, until I saw the same problem with this 16 GB model.  I tried using diskpart on the 2 GB model, and I saw that there were several partitions there (list partitions) just like on this one. So I used the clean option to try to wipe it, but that wiped off everything so it's totally useless now. I'm not sure how to rebuild it.  Is this a standard routine, like part of the whole "user experience", that whenever you make a bootable USB falsh drive with FreeNAS, it messes up your device? I am new to FreeNAS, so i wouldn't know. But it sure looks like it. Maybe it is in fact the format operation in Windows that messes things up... I don't know. It's not very nice.  How do I restore the capacity back to 16 GB-ish (14.9 GiB)? Are we slightly lighter during the day and slightly heavier at night, owing to the force of the Sun's gravity? I was wondering if it's possible to run an Ubuntu virtual machine using VirtualBox in background, I mean, without any window open.  The idea is to connect via SSH to the Linux host, that would be running in background.  Has anyone ever done something like this? Is it possible? Is it possible to "upgrade" from a 32bit to a 64bit installation? As per title, I wish to know if I can, after a successful 32bit setup and consequent software installations, update to a 64bit version.  I know how to partition (actually one of the solutions is to set /, /etc, /home, /var/www, and /opt as separate partitions) and I know that a clean install is way better than a dirty one, yet I would like to know if/how it's possible to do that. Suppose that $U_n=\frac{1}{\sqrt{2n\sigma^2}}\left(\Sigma X_j-\Sigma Y_j\right)$,  where $X_1,X_2,\ldots$ and $Y_i,Y_2, \ldots$ are i.i.d. sequences of random variables with mean $\mu$ and variance $\sigma^2$ and the sequences $\{X_i\}$ and $\{Y_i\}$ are independent.  Then, for all real numbers $x$, show that, as $n\to \infty$,  $$\mathbb{P}(U_n\leq x) \to  \int_{-\infty}^{x} \frac{1}{(\sqrt(2\pi))} \:e^{-\frac 12{u^2}}\mathrm du $$ Approach  I tried to carry out the integration on the right, but this does not integrate nicely. It ends up involving an error function, so I figured this was the wrong was to go.  Should I be looking at convergence in probability to answer this question? Is Chebyshev's inequality relevant here? If so, how and how does that relate to the integral? How do I make a 2D game resolution independent? I'm working on a simple 2D game. I've finished the mobile phone version.  However, my boss wants the game to works on his RT. I'm doing the "conversion" but my buttons are in the wrong places, because I hard-coded the screen size, like this:   texture = game.Content.Load&lt;Texture2D&gt;("StartScreen");  mainFrame = new Rectangle(0, 0, game.GraphicsDevice.Viewport.Width, game.GraphicsDevice.Viewport.Height);   // button definitions  startbrect = new Rectangle(300, 258, 88, 88);  startbtext = game.Content.Load&lt;Texture2D&gt;("bplay");   In this example, mainframe is fine, but startbrect isn't, because I defined the size to match a Windows phone's screen. How can I handle responsive design when all Windows 8 phones' screens are different? Is there a formula or macro to calculate each time the good size? How to add shortcut keys for java code in eclipse I would like to know where to find the source code of Ubuntu. I'd like to see how far it is "open source". A formal name for "smallest" and "largest" partition Consider a set $A=\{1,2,3,4,5\}$, is there any terminology for the following partitions of $A$ ?  (1) $A=\{ \{1\},\{2\},\{3\},\{4\},\{5\} \}$  (2) $A=\{\{1,2,3,4,5\}\}$. Is there an easy way to convert a number to a word in PHP? $f_n:[0,1]\to [0,1]$ continuous, $f_n\to f$ uniformly, prove: ${\frac1n}\sum_{k=1}^{n}{f_k} \to f$ uniformly I was able to prove, hopefully correctly, that the sum converges uniformly. But, I'm not sure how to show it converges uniformly specifically to $f$.  The way I proved it converges uniformly was by using the Dirichlet convergence test, by taking $a_k(x) = \frac1n$ and $b_k(x) = f_k(x)$. $\sum_{k=1}^n{b_k(x)}$ is uniformly bounded on $[0,1]$ by $n+2$ for instance, and $a_n$ is monotone and uniformly convergent to 0 because it does not depend on the value of $x$.  I got rather stuck after this. I guess I have to use the continuity of the functions and the uniform convergence of both, but I can't figure out how to show that they converge to the same thing. Any help will be greatly appreciated. What to do when witches appear early in the game? A long time ago I played an older version of Minecraft. Back then witches didn't spawn naturally, so you couldn't find them unless you found a hut. Now I'm playing again, but sometimes when I go down a cave I find one or two witches, and it's really hard to find them back.   So, what is the best you can do to kill witches, specially when two spawn at the same time and you don't have milk? Convergence of non increasing and non decreasing sequences to the same limit