Don' t how to place a non-floating figure here. If wrapfigure is used then it can be placed correctly, but then the text wants to wrap. I don't want that.
I have a problem when a lot of figures are in question. Some figures tend to "fly around", that is, be a paragraph below, although I placed them before that paragraph. I use code:  \begin{figure}[ht] \begin{center} \advance\leftskip-3cm \advance\rightskip-3cm \includegraphics[keepaspectratio=true,scale=0.6]{slike/visina8} \caption{} \label{visina8} \end{center}\end{figure}   to place my figures. How can I tell latex I REALLY want the figure in that specific place, no matter how much whitespace will be left?
How to install Anaconda on Ubuntu? How to install  on Ubuntu?   Is there a way to use apt-get install?   I only have command line access to my server. How do I install Anaconda on Ubuntu 14.04 from the command line? Accessing Resources from JSP inside WEB-INF A potential customer wants to evaluate our storage system. They run Windows 2008R2 x64 with 4KB NTFS on a virtual test machine they've sent us. They did not seem to know this at hand, so I think it's reasonable to assume that environment was not tweaked. The tests are inserting, indexing, searching, deleting. Tool is not known to me.  Given that the windows NTFS block size is 4KB, and SQL write in 64KB chunks - is it safe to assume that a block size of 64k on the SAN is a good choice?  They run SQL Server 2008, perhaps standard. Convert a javascript associative array into json object using stringify and vice versa What is the sum of non-real roots of the polynomial equation? I have a column in an Excel spreadsheet with several hundred entries, and some of these entries are duplicated.  I would like to remove all duplicate entries from the column so that each entry remaining is unique.   Is there a way to accomplish this automatically? How can I copy a file from another directory to the current one? I have this problem as part of a school assignment:  NOTE: In case it's hard to read in the image above, here's the directory tree: $ tree . `-- sample_dir1     `-- sample_dir         |-- admin         |-- cambridge         |   |-- cafeteria         |   |-- library         |   `-- security         |       |-- annex         |       |-- building         |       `-- parking         |-- faculty         |-- history.exe         |-- markham         |   |-- annex         |   |-- building1         |   `-- parking         |-- oxford         |   |-- outline.doc         |   |-- programming         |   |   `-- report.pdf         |   `-- security         `-- stenton             |-- gen_ed             `-- lib_arts                 |-- english.txt                 `-- match.doc  15 directories, 11 files  I tried doing the command: $ cp ../cambridge/security/parking ./parking2  ...but it isn't working. The question in the image above states that the current directory is stenton, and that we need to make a copy of the file named parking (from the security directory), and to name the new file parking2, and place it in the current directory, stenton, using relative pathnames. What am I doing wrong? My cp command seems to be correct. I would like to replace the search submit button with a Font Awesome character like the Magnifier (Search Icon) character, and put Search the site inside the search box.  How can I achieve something like this? Approximation algorithms for min vector subset-sum over GF(2) In  vzn asked about the following problem, which I'll call Vector-Subset-Sum.     Given a set of vectors $v_i$ over GF(2) and a target vector $y$, is there a subset of the $v_i$ summing to $y$?   In the answers, comments, and referenced papers I noted   The decision problem is in P. The natural minimization problem (finding the smallest subset) is NP-hard. It's related to the problem of finding sparse codewords in a linear code.   My question is: are there any known polynomial-time approximation algorithms for the minimization problem in (2)? I know very little about coding theory, so there may be some obvious or well-known approximation-preserving reductions to (3) that I have not seen. Irreducibility of an infinite sequence of polynomials uwsgi errno 24 too many open files on CentOS / nginx Today I had some time and felt like writing a relatively good answer on Stack Overflow; explaining both the underlying mechanisms and good practices, unlike usual declarative answers in a "do that" style.  It took me like an hour of time, $50 if I were free lance. It'll bring me nothing but 3-5 occasional views, and - if I get lucky - some ignorant comments.  You know, it's quite discouraging.  Instead of pride for the job that was done, I feel frustrated. I know, this answer may offer help to the OP, if he ever notices it (being already satisfied with other answers).  So the only fate the answer will meet is to sink forever, below thousands other questions, falling like snow.  So, being a programmer, I am thinking of efficiency. It's a waste of time to spend so much effort to answer one question when there is no way to [actually] reuse it. So, I wouldn't do it again but just turn back into short answers mode without explanations.       Seeing other answers, I don't think I am only one with such feeling.  The current policy is driving knowledgeable and educational users away, yet it attracts inexperienced ones in numbers. Ones who will tell you to use [some technology] which they never have laid their hands upon. Ones who write answers just because they have learned some "good practice" from other questions, and this "knowledge" becomes an endless source of rep points.  The idea of Stack Overflow is rotten. It was excellent when trees were high and traffic was low.  It turned bad now; it has become a honeypot for all the "enthusiast programmers" of the world, eager to share their 2 cents faster than you can say the word "close".  You're killing a great resource. Despite all the nice words and proper declarations, it discourages the reuse of the knowledge. And encourages fast on-site answers.  Of course, the rules will tell you contrary. It's all nice and proper (if you don't mind it's strict mutual exclusivity). But mechanically, technologically it works in the way I described.  I tried to write a tag wiki. You know, it was biggest waste of time in my life. As a matter of fact, it is not a wiki at all; you can't even link to a certain section. Not to mention that nobody ever has the idea to read tag wikis.  Reference questions? Don't make me laugh. There is no good mechanism to store and categorize links. Favorites, although intended for the different purpose, are a chunk of crap when you want to use it as a reference. So, you can't compete with 30-seconds answers: a question will get 5 answers before you can even find an appropriate link.  Okay, I can organize links myself but, there are some problems:   I am just a human. I cannot remember everything I am just a human and I cannot answer questions at rate of 1 qpm. One person cannot fight the Tide. It's helpless. When technology makes people writing fast [incomplete] answers -  no good will of proper declarations can do a thing.  Even if a question gets finally closed, it won't hurt anyone - the hydra grew two more already.   You'll call me a brute for insulting honest users and innocent volunteers, but that's fact: There are much more inexperienced users than experienced ones. And inexperienced users have much more spare time to hang over than experts who have their job to do. So, from that fact we can conclude that most of the answers on Stack Overflow have a low quality. Nobody cares. But I do.   There should be a technical way to limit the activity of not-so-knowledgeable-yet-eager-to-answer users. There should be a technical preference for the closing a question over answering it (have a silly answer for the silly question? welcome to comments). There should be a technical solution to accumulate and structure knowledge, a system that lets you choose a good answer instead of writing it by hand.   That's the only way. Otherwise Stack Overflow will remain an automated dispenser of bad practices.  Well, I just felt like letting it out again. Thank you for reading. In school, we just started learning about trigonometry, and I was wondering: is there a way to find the sine, cosine, tangent, cosecant, secant, and cotangent of a single angle without using a calculator?  Sometimes I don't feel right when I can't do things out myself and let a machine do it when I can't.  Or, if you could redirect me to a place that explains how to do it, please do so.  My dad said there isn't, but I just had to make sure.  Thanks. Render semi-transparent volume with cycles Decode JWT Token in Apex What 70s (60s?) TV show / TV movie had a generation ship whose inhabitants did not know they were on a spaceship? I have the vaguest memory of a TV show (maybe a BBC import?) in which the protagonists were moving through the sections of a massive generation ship whose inhabitants had forgotten that they were on a spaceship... I know there was an RPG with the same plot (which, after all, is a pretty great blank slate) but I definitely feel I saw this on a static-filled 13" B&amp;W TV back in the day... Plotting several 2d functions in a 3d graph I am trying to reproduce a similar figure to the following one. My first guess was to use pgfplots but I didn't find any example that I could use as a starting point. At the moment I am unsure if pgfplots is actually the right package or I should rely on something else e.g. TikZ.   Since I don't really know where to start, I would appreciate any piece of code that points me in the right direction.    EDIT  Here is some dummy data for the plots.  plot1   plot2   plot3   plot4 0       0       0       0 3.466   2.058   0       0 4.262   2.976   0.001   0 3.822   3.168   0.006   0.008 2.953   2.936   0.019   0.063 2.065   2.492   0.046   0.265 1.332   1.977   0.092   0.734 0.797   1.478   0.164   1.508 0.443   1.045   0.268   2.44 0.228   0.698   0.412   3.219 0.107   0.438   0.598   3.524 0.046   0.256   0.831   3.219 0.017   0.138   1.109   2.44 0.006   0.067   1.429   1.508 0.002   0.029   1.78    0.734 0       0.01    2.141   0.265 0       0.003   2.479   0.063 0       0.001   2.736   0.008 0       0       2.808   0 0       0       2.465   0 0       0       0       0 Is it possible to install Ubuntu without formatting any partitions? closed form for $\binom{n}{0}+\binom{n}{3}+\binom{n}{6}+...+\binom{n}{n}$ Unable to add comments on closed questions or their answers in the Android app