I have a blend file. I got it from . A strange thing happens when you go to Edit Mode on "body" part. Well, the object called "body". Anyway, when you do that the half of the object is clipped, you go back to Object Mode, the clipped part goes back. I figured out that applying the existing subsurf modifier fixes this weird behavior.  And another thing. The origin point is cyan instead of orange.   Any thoughts on why this happens and what's with the origin point color?   (if you don't have an acc on blendswap)  Edited:   Thanks to Gonzou, his answer solves the mystery of the disappearing mesh.  The cyan dot mystery still remains. I looked through theme colors and didn't find any entry that controls that cyan dot. The "Active Object" entry only controls the outline color on that object. However, on a newly created object an origin dot color is orange (as it expected) and that "Active Object" entry controls an outline and dot colors.
I have append a mesh (rex) from this .blend .  In edit Mode I see different vertices from objcet mode (see pictures). The vertices of belt are missing!  OBJECT MODE:   EDIT MODE:   How can I edit vertices of belt? Is It a bug?  This is my .blend  maybe can help.
Limits of sequences of sets I am starting to learn about the liminf and limsup of a sequence of sets. However, I do not understand the very basics, such as why $\lim\sup A_n=\bigcap_{n\in N}\bigcup_{k&gt;n} A_k,$ and why $\lim\sup A_n=\bigcup_{n\in N}\bigcap_{k&gt;n}A_k.$ Can someone break these definitions down for me?  Also, why is $\lim\inf\subseteq\lim\sup$? The page I'm trying to fetch is public.  The server logs show no request.  Google reports that any page on my site is "Temporarily unreachable". It won't even fetch the verification file, a static HTML file that was successfully used to verify with the webmaster tool application itself.   My site is running on the .  What is causing this? Is the CMB rest frame special? Where does it come from? It seems that we are . This is the speed of our galaxy relative to the cosmic microwave background. Where does this rest frame come from? Is this special in any way (i.e., an absolute frame)? EDIT: I think the more important question is &quot;where does the CMB rest frame come from?&quot;. Where can I find gedit's backup files and how to open them? So, I just finished off the first part of an important task for school and today when I was going to continue, the document with my notes were gone. The only fragment I've got left of my file is the back up file, which doesn't show in the folder where I saved the document, but I can search for it.  Is there anyway which allows me to open the back up file, save it as a text file and continue my task? I don't really have the time for running restoring tools, which never has helped me in a satisfactory way anyway.  I wrote the document in gedit and my version of Ubuntu is 12.10. Indent entire section using only preamble I heavily use org-mode in Emacs to create TODO lists with timekeeping, which has a handy export to LaTeX feature. The problem is that in order to get my exported LaTeX document to look right, I want to indent entire sections, essentially treating sections like lists. It's very easy to create a template to copy and paste into every new file, but not feasible to edit the text directly as this would interfere with org-modes ease of use. Thus:  Is there a way to indent an entire section, using only the preamble?  MWE  \documentclass{article} \usepackage[explicit]{titlesec} \setcounter{secnumdepth}{0} \newcommand{\clock}{CLOCK: number number number \\}  \titleformat{\section}{\bfseries{}}{\roman{section}}{3pt}{#1} \titlespacing*{\section}{0pt}{0pt}{0pt} \titleformat{\subsection}{\bfseries{}}{\roman{subsection}}{3pt}{$\rightarrow$#1} \titlespacing*{\subsection}{2em}{0pt}{0pt} \begin{document}   \section{First section} \clock  \section{Second section} \clock \clock \clock  \subsection{First subsection} \clock \clock  \subsection{Second subsection} \clock  \subsection{Third subsection} \clock  \end{document}   I want the text with the red arrow to be indented to the same level as the section. What is the maximum party size and the corresponding monster buffs? What is the maximum party size (if there is one) in Diablo 3?  Additionally, how much of a buff do monsters get when adding party members?     "A new ally has joined, but the minions of Hell grow stronger." Can I install Ubuntu inside Windows? Ubuntu 12.04 won't come with the Windows Installer (Wubi) pre-added. But is there any way to install 12.04 using Wubi? "Awesome" vs. "Awful" How to disable SSLv2 or SSLv3? What is CUPS server and how to share a printer (Locally or over a network) The title tells you all, except that it's about sharing printers.   How do I connect to a shared printer on the network through CUPS or terminal? Do you have recommendations for books to self-teach Applied Statistics at the graduate level? I took several statistics courses in college but I found that my education was very theory driven.  I was wondering if any of you had a text in Applied Statistics (at the graduate level) that you recommend or have had good experience with. I want to create this:  Note that wire lay chaotically, so spiral object not the same thing.  There is a cool way to do this task in 3ds max:  Basically he deform straight spline/curve and then bend it couple iterations (over 9000 degrees angle in max).   Blender can't bend that way with simple deform as I know, only up to 360 degree. Is there any other way to make wire wrapping similar to photo? Image of the set of natural numbers under any function is denumerable. Hi everyone I'd like to know if the following reasoning is correct, any suggestion would be great. Thanks.  Proposition: Let $Y$ be a set and let $f: \mathbb{N}\rightarrow Y$ be a function. Then $f[\mathbb{N}]$ is at most countable.   Proof: If $Y$ is finite the result follows, this is because$f[\mathbb{N}]\subset Y$ and any subset of a finite set  is finite and has at most the size of the set in which is contained.   We may assume  that the set $Y$ is infinite. We set $A:= \{\,n\in\mathbb{N}:f(i)\not=f(n) \,\,\text{ for  any }i&lt; n\, \}$. And we define the function $g:A \rightarrow f[\mathbb{N}]$ as the restriction of $f$ in $A$. We claim that the function $g$ is a bijective map. From the definition of $A$ we already know that the map is $1:1$. We will show that also is onto.   Let $y\in f[\mathbb{N}]$. Suppose for the sake of contradiction that there is no $n\in A$ such that $g(n)=y$. Since $y$ lies in the image of $f$, then there is some $j\in \mathbb{N}$ for which $y=f(j)$. Then either $f(j)\not= f(i)$ for any $i&lt;j$ or there exists some $i&lt;j$ such that $f(j)= f(i)$. For the former, $j$ lies in $A$ (by its definition). For the latter, the set $\{\, n\in \mathbb{N}: f(j)=f(n)\, \text{and }\,n\not=j \}$ is non empty, and hence has a minimum element. Let $m$ be its minimum element. Then $f(m)\not=f(n)$ for any $n&lt;m$ and thus $\,m\in A$ but $g(m)=f(m)= f(j)=y$. Thus any case leads to a contradiction. The result follows by reductio ad absurdum. Hence $f$ is surjective and injective, i.e., a bijective map.   Since there is a bijection between $A$ and the images of the natural numbers under $f$, both have the same cardinality. Also we already know that $A\subset \mathbb{N}$ and any set of the natural numbers is denumerable, thus $f[\mathbb{N}]$ is countable. $\Box$ Been trying to find graphic novel for decades - at least I think it's a graphic novel polytopes as inequalities sistem solutions in R3 (x-y-z) cartesian space i'm here to ask if there's a TikZ/pgf support to draw areas resulting from a system of linear inequalities, into a xyz cartesian space. i found examples of my needs for xy plan at , but i also need to draw some 3d polytopes.  the problem is coordinate system as i found in pgfmanual.pdf seems not suited for R3: only (,) support but i need something like (,,).  As an example, i need to do drawings like this:    but i also need to get a colored surface with a 50% transparent color.  The system which generated that polytope is quite simple and is a linear programming problem:  x_1 + x_2 + x_3 &lt;= 4 x_1             &lt;= 2             x_3 &lt;= 3     3*x_2 + x_3 &lt;= 6 x_1             >= 0       x_2       >= 0             x_3 >= 0    Can you advise me some url/article/doc which can help me, or make me some example to lead me to learn how to reach my target?  Thank you for your attention How does one prove that every finite group is isomorphic to a subgroup of an alternating group? At what point is a creature's toughness calculated? If I have  where I can sacrifice a creature and put X 1/1 token creatures onto the battlefield, where X is the sacrificed creature's toughness.  If I have a creature that is 4/4 and cast  to give it +3/+3 then sacrifice it? Do I get 4 tokens or 7?  Also what if my 4/4 creature was dealt 2 combat damage before I sacrificed it? Do I get 2 or 4 creatures?  Finally, what about counters? If my 4/4 had a +1/+1 do I get 4 or 5 tokens? Headers of \chapters* take the headers of their previous \chapter When using book.cls and using \chapter* after a \chapter, the header used in \chapter* is wrong. An example is pasted below.   Is there any known workaround for that? I have tried quite some tricks without success.   \documentclass[]{book}  \begin{document}  \chapter{First Chapter} aslkjdf  \chapter*{Unnumbered Chapter} The GNU General Public License is a free, copyleft license for software and other kinds of works.  The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too.  When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things.  To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others.  For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights.  Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it.  For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions.  Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users.  Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free.  The precise terms and conditions for copying, distribution and modification follow.  \end{document} Can someone explained, as detailed as possible, the differences between the following types?  List List&lt;Object&gt; List&lt;?&gt;   Let me make this more specific. When would I want to use  // 1  public void CanYouGiveMeAnAnswer(List l) { }  // 2 public void CanYouGiveMeAnAnswer(List&lt;Object&gt; l) { }  // 3 public void CanYouGiveMeAnAnswer(List&lt;?&gt; l) { } Is there consensus in the field of statistics that one book is the absolute best source and completely covering every aspect of GLM - detailing everything from estimation to inference?