I'm using MikTeX and WinEdt for writing an IEEE conference paper. To create a neural network structure I used this code :  \begin{figure} \begin{tikzpicture}[ init/.style={   draw,   circle,   inner sep=2pt,   font=\Huge,   join = by -latex }, squa/.style={   draw,   inner sep=2pt,   font=\Large,   join = by -latex }, start chain=2,node distance=13mm ] \node[on chain=2]   (x2) {$x_2$}; \node[on chain=2,join=by o-latex]   {$w_2$}; \node[on chain=2,init] (sigma)   {$\displaystyle\Sigma$}; \node[on chain=2,squa,label=above:{\parbox{2cm}{\centering Activate \\ function}}]   {$f$}; \node[on chain=2,label=above:Output,join=by -latex]   {$y$}; \begin{scope}[start chain=1] \node[on chain=1] at (0,1.5cm)   (x1) {$x_1$}; \node[on chain=1,join=by o-latex]   (w1) {$w_1$}; \end{scope} \begin{scope}[start chain=3] \node[on chain=3] at (0,-1.5cm)   (x3) {$x_3$}; \node[on chain=3,label=below:Weights,join=by o-latex]   (w3) {$w_3$}; \end{scope} \node[label=above:\parbox{2cm}{\centering Bias \\ $b$}] at (sigma|-w1) (b) {};  \draw[-latex] (w1) -- (sigma); \draw[-latex] (w3) -- (sigma); \draw[o-latex] (b) -- (sigma);  \draw[decorate,decoration={brace,mirror}] (x1.north west) -- node[left=10pt] {Inputs} (x3.south west); \end{tikzpicture} \caption{NN} \label{fig_neuron} \end{figure}   How can I minimize size of total figure? It is a little big for two column article.
I have a simular issue to the question asked in :  I have tried the solution provided by Jake. This makes that my picture fails to resize (scale) as i intend.  Whether i give Set scale=0.4 or Set scale=0.8 The size of the  picture remains the same  This is the code i use:  \begin{figure}[ht!] \centering \begin{tikzpicture}[Set scale=0.4, every node/.append style={transform shape},] % STYLES \tikzstyle{every node}=[rectangle,rounded corners, minimum width=100pt,     align=center,node distance=3cm,fill=black!10,inner sep=5pt,text width=3cm,minimum height=1.75cm,&gt;=stealth,text badly centered] % Draw forces \node [force, above of=rivalry] (top) {Firm strategy, structure and rivalry}; \node [force, left=1cm of rivalry] (left) {Factor conditions}; \node [force, right=1cm of rivalry] (right) {Demand Conditions}; \node [force, below of=rivalry] (bottom) {Related and Supporting industries}; %%%%%%%%%%%%%%%% % Draw the links between forces \path[&lt;-&gt;,thick]  (left) edge (right) (left) edge (top) (left) edge (bottom) (top) edge (right) (bottom) edge (right); \path[&lt;-&gt;,thick]  (bottom) edge (top); \end{tikzpicture} \caption{Porter's Diamond source:~\cite{Porter:1980}}% \label{fig:diamond}  \end{figure}
There is this famous example about the order difference between gravitational force and EM force. All the gravitational force of Earth is just countered by the electromagnetic force between the electrons on the surface of my feet and the ground.  But also wave-function of electrons(fermions) do not overlap each other due to Pauli exclusion principle.  So which one is the true reason of me not flopping inside the earth forever? Is it only one of them(my guess is Pauli exclusion) or is it both? Finding the conjugate hyperbola Assume we are given a general proper hyperbola $  a_{11}x^2 + 2 a_{12} x y + a_{22} y^2 + 2 a_{13}x +2 a_{23}y + a_{33} = 0$ with  $D =\det \begin{pmatrix}   a_{11} &amp; a_{12} \\   a_{12} &amp; a_{22} \end{pmatrix} &lt; 0$ and $ A = \det \begin{pmatrix}   a_{11} &amp; a_{12} &amp; a_{13} \\   a_{12} &amp; a_{22} &amp; a_{23} \\   a_{13} &amp; a_{23} &amp; a_{33} \end{pmatrix} \neq 0$.  Is there an easy way to find the implicit description of the conjugate hyperbola?  I could translate and rotate the hyperbola and obtain a canonical representation of the form $\frac{x^2}{a^2} - \frac{y^2}{b^2} = \pm 1$, find the conjugate of the canonical one and the transform back. However, I'm looking for a more straightforward way to achieve this. How to delay a command block I have created a short command block stack, one block teleports the player and the other plays block.piston.extend. My problem is that it teleports the player before the player can hear the sound. I would like to know if there is a way to delay the command from inside that command block. I have looked at other solutions but they all involve some complex scoreboard timer thing. If you could give me a solution that doesn't use that system or maybe you could explain it better.  This is the command I need to delay:  /tp @p -586.634 64 -430.697   If anyone could help I would really appreciate it, so thanks in advance! Is it possible to have f.lux (software that adjusts display's color temperature) on Ubuntu 14.04? f.lux is software which adjusts temperature of your display according to time of the day. Is it possible to make f.lux work in Ubuntu 14.04? If so, maybe you can share your knowledge or point me to a guide. Regarding the sum $\sum_{p \ \text{prime}} \sin p$ I'm very confident that  $$\sum_{p \ \text{prime}} \sin p $$  diverges. Of course, it suffices to show that there are arbitrarily large primes which are not in the set $\bigcup_{n \geq 1} (\pi n - \epsilon, \pi n + \epsilon)$ for sufficiently small $\epsilon$. More strongly, it seems that $\sin p$ for prime $p$ is dense in $[-1,1]$.   This problem doesn't seem that hard though. Here's something that (to me) seems harder.      If $p_n$ is the nth prime, what is $$\limsup_{n \to +\infty} \sum_{p \ \text{prime} \leq p_n} \sin p?$$   What is $$\sup_{n \in \mathbb{N}} \sum_{p \ \text{prime} \leq p_n} \sin p? $$   Of course, we can ask analogous questions for $\inf$.   I'm happy with partial answers or ideas. For example, merely an upper bound. Find no. of non negative integer solutions of $a+2b+3c = 200$ I want to find number of the non negative integer solutions of $a+2b+3c = 200$ (answer can contain $a,b,c = 0$)  Example one of the solutions is $a = 100, b = 50, c = 0$  I used stars and bars trick and here i get is  $\dfrac{\dbinom{200+2}{2}}{2 \times 3}$ but it is incorrect  any type of math is welcomed    what I have learnt from stars and bars technique is to find the solutions of $x+y = n , x,y,n &gt; 0$ are positive integers but I am confused with equation of type $ax+by = n$ where $a , b&gt; 1$ Why XML-Serializable class need a parameterless constructor Weird behavior when overriding gnome alert styling? After playing around with the i3 tiling window manager, I had my fill and decided to uninstall it and continue using gnome. However, to my dismay, something in i3 overrode the default gnome alert box. For example, when connecting to wifi, I get a gray or blue box instead of the nice ubuntu popups. The screenshot says it all. Any ideas?    (See top right corner) bordermatrix with blocks I need to write a complicated matrix, that has a structure as in the attached picture. It's easy to check that for any natural $n$ $$\frac{n+1}{n}=\cfrac{1}{2-\cfrac{n+2}{n+1}}.$$  Now,   $$1=\frac{1}{2-1}=\frac{1}{2-\cfrac{1}{2-1}}=\frac{1}{2-\cfrac{1}{2-\cfrac{1}{2-1}}}=\cfrac{1}{2-\cfrac{1}{2-\frac{1}{2-\frac{1}{2-1}}}}=\ldots =\cfrac{1}{2-\cfrac{1}{2-\frac{1}{2-\frac{1}{2-\frac{1}{2-\dots}}}}},$$  $$2=\cfrac{1}{2-\cfrac{3}{2}}=\cfrac{1}{2-\cfrac{1}{2-\cfrac{4}{3}}}=\cfrac{1}{2-\cfrac{1}{2-\frac{1}{2-\frac{5}{4}}}}=\cfrac{1}{2-\cfrac{1}{2-\cfrac{1}{2-\frac{1}{2-\frac{6}{5}}}}}=\ldots =\cfrac{1}{2-\frac{1}{2-\frac{1}{2-\frac{1}{2-\frac{1}{2-\ldots}}}}}.$$  Since the right hand sides are the same, hence $1=2$. The curious case of Dmitri Valtane I was trying to prove this question.   Q. If G is a group of even order, prove that it has an element a, such that a$\neq$e satisfying $a^2$=e.   I tried solving it using Principle of mathematical induction.  So, Let O(G)=2m, where m$\in$ $N$.   We proceed by induction on m.   For m=1, O(G)=2, $\therefore$ G contains two elements.  G=$\{{e,a}\}$. Now, e has order 1. So, a can not have order 1. $\therefore$ a has order 2. So, it true for m=1.  Now, let it be true for m=k.  Then, we have a group G of order 2k, where $\exists$ an element a$\in$ G, whose order is 2.   We wish to prove it for m=k+1.   Then G has order 2k+2.   I don't know how to proceed further. I'm trying to prove that $e^{\sqrt 2}$ is irrational. My approach: $$ e^{\sqrt 2}+e^{-\sqrt 2}=2\sum_{k=0}^{\infty}\frac{2^k}{(2k)!}=:2s $$ Define $s_n:=\sum_{k=0}^{n}\frac{2^k}{(2k)!}$, then: $$ s-s_n=\sum_{k=n+1}^{\infty}\frac{2^k}{(2k)!}=\frac{2^{n+1}}{(2n+2)!}\sum_{k=0}^{\infty}\frac{2^k}{\prod_{k=1}^{2k}(2n+2+k)}\\&lt;\frac{2^{n+1}}{(2n+2)!}\sum_{k=0}^{\infty}\frac{2^k}{(2n+3)^{2k}}=\frac{2^{n+1}}{(2n+2)!}\frac{(2n+3)^2}{(2n+3)^2-2} $$ Now assume $s=\frac{p}{q}$ for $p,q\in\mathbb{N}$. This implies: $$ 0&lt;\frac{p}{q}-s_n&lt;\frac{2^{n+1}}{(2n+2)!}\frac{(2n+3)^2}{(2n+3)^2-2}\iff\\ 0&lt;p\frac{(2n)!}{2^n}-qs_n\frac{(2n)!}{2^n}&lt;\frac{2}{(2n+1)(2n+2)}\frac{(2n+3)^2}{(2n+3)^2-2} $$ But $\left(p\frac{(2n)!}{2^n}-qs_n\frac{(2n)!}{2^n}\right)\in\mathbb{N}$ which is a contradiction for large $n$. Thus $s$ is irrational. Can we somehow use this to prove $e^\sqrt{2}$ is irrational? White cloudy areas on bottom of new stainless steel skillet I just bought my first few pot and pans "Calaphon" stainless steel trip-ply  I used my new 10" skillet tonight, and cooked pork chops. I heated the pan first, added olive oil, let it heat, then added chops. After I was done, cleaned it immediately under water, and noticed white cloud looking areas on the bottom of the skillet. They won’t wash or rub off  Do I need to return these? I did buy them for the look as well. Friendly_Id and Reserved Words -- How can i replace the reserved word? Is this correct: "Our listeners are what make X"? Suppose I have a node in the shape of a circle. How can I make its border thicker?   \node[circle, draw=blue!80, inner sep=0pt, minimum size=12pt] (1) at (0,0) {1}; At the start of the movie it says:      "A long time ago in a galaxy far, far away...."   Does this mean that the entire Star Wars saga takes place in a single galaxy? To my understanding a galaxy isn't very big compared to the universe itself. Star Wars has many different sentient races, and the way they are presented suggests that most planets are host to only one of them (some exceptions like naboo). This strongly leads me to believe there should actually be more galaxies in the Star Wars universe (hehe).   Another thing, I think it's safe to assume that even if the entire saga takes place in one single galaxy, their researchers can observe other galaxies (I think we started doing that in the 1600s, and they are a lot more technologically advanced than we were back then). When Obi-wan is looking for Kamino (the rain planet with the cloners) the librarian says something like "If it's not in our records, it doesn't exist", so she must be convinced that the entire universe has been explored.    If the entire universe has been documented, why wouldn't they go to those other galaxies? The technology seems to be advanced enough to hop to another galaxy. Is there any canon material that suggest that traveling between galaxies is done? If not, is there a canon explanation why they don't? I am trying to do a new environment or command (i tried both) where i can put in the name, description and code of a Method in c++ and it gives me a new section with the MethodName, the code listed and the description below. But i am not able to use the listings environment in a new command or new environment.. Consider my MWE   \documentclass[a4paper,11pt]{article} \usepackage{listings}  \newcommand{\method}[3] { \section{#1}\label{#1} \begin{lstlisting} #2 \end{lstlisting} #3 }   \begin{document}  \method{MethodName}{Method Void MethodName()}{Description of the Method blablabla}  \end{document}   How can I fix this?   I would prefer to do it using a macro since I don't need an ending. Is there an irrational number $a$ such that $a^a$ is rational? It can be proved that there are two irrational numbers $a$ and $b$ such that $a^b$ is rational (see ) and that for each irrational number $c$ there exists another irrational number $d$ such that $c^d$ is rational (see ).  My question is: Is there an irrational number $a$ such that $a^a$ is rational (and how could you prove that)?