## LaTeX forum ⇒ Presentations and Posters ⇒ How to enumerate the blocks in a poster

Beamer, Powerdot and KOMA-Script presentations, Conference posters (a0poster, baposter, tikzposter)
BarbaraG
Posts: 3
Joined: Mon May 09, 2016 9:59 pm

### How to enumerate the blocks in a poster

Hi everybody!
As the title suggests, I am writing a poster and I want to enumerate the blocks. I am using the Jacobs Landscape Poster and I'd like to have a small number at the bottom right. I need this template because is so clear, but I was told the block in the middle make kind of confusion on the order, then I want to enumerate all the blocks and make it clear.
Thank you very much!

Johannes_B
Site Moderator
Posts: 4044
Joined: Thu Nov 01, 2012 4:08 pm
Welcome,

if the order in which to read the blocks is clear depends on the layout of the blocks, little numbers will only help a little.

How is the current setup of your poster?
The smart way: Calm down and take a deep breath, read posts and provided links attentively, try to understand and ask if necessary.

BarbaraG
Posts: 3
Joined: Mon May 09, 2016 9:59 pm
Hi!
I didn't change any blocks of the original one (okay, of course I wrote down my texts instead of Lore ipsum..). I was just told the blue block in the middle is a little bit confusing. One does not know where to look exactly after that.

Stefan Kottwitz
Posts: 9440
Joined: Mon Mar 10, 2008 9:44 pm
Hi Barbara,

welcome to the forum!

Perhaps post your code here. I would test it to see how to enumerate.
I just did not find the time to search for the "Jacobs Landscape Poster" and to create an example myself. If you already have code, simply post it. That's easier for all.

Stefan

BarbaraG
Posts: 3
Joined: Mon May 09, 2016 9:59 pm
Of course! Thank you!
P.s.: I am new, so I don't know exactly if there is a better way to post it. Anyway, here there is =)

1. \documentclass[final]{beamer}
2.
3. \usepackage[scale=1.24]{beamerposter} % Use the beamerposter package for laying out the poster
4. \usepackage{subfig}
5.
6. \usetheme{confposter} % Use the confposter theme supplied with this template
7.
8. \setbeamercolor{block title}{fg=ngreen,bg=white} % Colors of the block titles
9. \setbeamercolor{block body}{fg=black,bg=white} % Colors of the body of blocks
10. \setbeamercolor{block alerted title}{fg=white,bg=dblue!70} % Colors of the highlighted block titles
11. \setbeamercolor{block alerted body}{fg=black,bg=dblue!10} % Colors of the body of highlighted blocks
12. % Many more colors are available for use in beamerthemeconfposter.sty
13.
14.
15. \newlength{\sepwid}
16. \newlength{\onecolwid}
17. \newlength{\twocolwid}
18. \newlength{\threecolwid}
19. \setlength{\paperwidth}{48in} % A0 width: 46.8in
20. \setlength{\paperheight}{36in} % A0 height: 33.1in
21. \setlength{\sepwid}{0.024\paperwidth} % Separation width (white space) between columns
22. \setlength{\onecolwid}{0.22\paperwidth} % Width of one column
23. \setlength{\twocolwid}{0.464\paperwidth} % Width of two columns
24. \setlength{\threecolwid}{0.708\paperwidth} % Width of three columns
25. \setlength{\topmargin}{-0.8in} % Reduce the top margin size
26. %-----------------------------------------------------------
27.
28. \usepackage{graphicx} % Required for including images
29.
30. \usepackage{booktabs} % Top and bottom rules for tables
31.
32. %----------------------------------------------------------------------------------------
33. % TITLE SECTION
34. %----------------------------------------------------------------------------------------
35.
36. \title{Stability and connectivity of dynamical systems on graphs} % Poster title
37.
38. \author{Barbara Giunti} % Author(s)
39.
40. \institute{Universit\`a degli studi di Torino} % Institution(s)
41.
42. %\begin{flushright}
43. %\begin{figure}
44. %\includegraphics[width=0.4\linewidth]{Logo1.png}
45. %\end{figure}
46. %\end{flushright}
47.
48. %----------------------------------------------------------------------------------------
49.
50. \begin{document}
51.
52. \addtobeamertemplate{block end}{}{\vspace*{0.1ex}} % White space under blocks
54.
55. \setlength{\belowcaptionskip}{0.1ex} % White space under figures
56. \setlength\belowdisplayshortskip{1ex} % White space under equations
57.
58. \begin{frame}[t] % The whole poster is enclosed in one beamer frame
59.
60. \begin{columns}[t] % The whole poster consists of three major columns, the second of which is split into two columns twice - the [t] option aligns each column's content to the top
61.
62. \begin{column}{\sepwid}\end{column} % Empty spacer column
63.
64. \begin{column}{\onecolwid} % The first column
65.
66. %----------------------------------------------------------------------------------------
67. % OBJECTIVES
68. %----------------------------------------------------------------------------------------
69.
71.
72. We consider a finite simple graph and assign to each vertex a scalar state variable, we described the collective dynamics with a gradient-type dynamical system. The system is linear and his matrix is closely related to the signless Laplacian of the graph. Then, its behaviour is determined by the spectral properties of its matrix:
73. \begin{itemize}
74. \item we computed explicitly the eigenvalues and the eigenspaces for special classes of graphs
75. \item we collect a number of qualitative results from the literature, for more general classes of graphs
76. \item we then use these results to discuss the stability properties of the dynamical system on the graph
77. \item we perturb the deterministic system by a white noise term at each node
78. \end{itemize}
79.
81.
82. %----------------------------------------------------------------------------------------
83. % INTRODUCTION
84. %----------------------------------------------------------------------------------------
85.
86. \begin{block}{Motivation}
87. \textbf{Mathematical motivation:}
88. the signless Laplacian $Q$ matrix is square, symmetric, non negative, real and positive semi-definite. Thus his eigenvalues are real, non negative and are computed fast. Moreover, from \cite{CveSiI} we know that studying graphs by $Q$-spectra is more efficient than studying them by their (adjacency) spectra.
89. \begin{figure}
90. \includegraphics[width=0.65\linewidth]{Capsid2.jpg}
91. \caption{Viral capsid}
92. \end{figure}
93. \textbf{Biological motivation:}
94. in order to model the opening of a viral capsid, we define a potential depending on only two parameters. One governs the square of the distance from the capsid center, the other the attraction between two adjacent faces \cite{CerInZap}\cite{Tirion}.
95. \begin{equation*}
96. U\left(\pmb{x}\right)=
97. \frac{a}{2}\sum_{i=1}^{n}x_{i}^{2}+\frac{b}{2}\sum_{i=1}^{n}\sum_{j=1}^{n}A_{ij}\left(x_{i}+x_{j}\right)^{2}
98. \end{equation*}
99. His gradient turns out to be:
100. \begin{equation*}
101. \nabla U\left(\pmb{x}\right)=\left(a I + 2b Q\right)\pmb{x}
102. \end{equation*}
103. \end{block}
104.
105. %----------------------------------------------------------------------------------------
106.
107. \end{column} % End of the first column
108.
109. \begin{column}{\sepwid}\end{column} % Empty spacer column
110.
111. \begin{column}{\twocolwid} % Begin a column which is two columns wide (column 2)
112.
113. \begin{columns}[t,totalwidth=\twocolwid] % Split up the two columns wide column
114.
115. \begin{column}{\onecolwid}\vspace{-.6in} % The first column within column 2 (column 2.1)
116.
117. %----------------------------------------------------------------------------------------
118. % SECONDA COLONNA
119. %----------------------------------------------------------------------------------------
120.
124. Given a graph $G$, with adjacency matrix $A$ and degree matrix $D$, the signless Laplacian is defined by:
125. $$Q = A + D$$
127. \begin{block}{Graph and signless Laplacian}
128. We performed the explicit calculation for eigenvalues and eigenvectors of the complete graph $K_{n}$, the complete bipartite graph $K_{n,m}$, the cycle $C_{n}$, the path $P_{n}$ and the star $S_{n}$.
129. %For example,
130. $K_{n,m}$ has four different eigenvalues,
131. $n+m^{1}, m^{n-1}, n^{m-1}, 0^{1}$, the superscript is the multiplicity. The first eigenvector is
132. \begin{center}
133. $\qquad \pmb{v}_{1}=\left(\frac{1}{n},\dots,\frac{1}{n}, \frac{1}{m}\dots,\frac{1}{m}\right)$
134. \end{center}
135. \end{block}
136.
137. %----------------------------------------------------------------------------------------
138.
139. \end{column} % End of column 2.1
140.
141. \begin{column}{\onecolwid}\vspace{-.6in} % The second column within column 2 (column 2.2)
142.
143. %----------------------------------------------------------------------------------------
144. % METHODS
145. %----------------------------------------------------------------------------------------
146.
147. \begin{block}{General results for $Q$}
148. There are a lot of interesting results for more general graphs' classes.
149. \begin{itemize}
150. \item the smallest eigenvalue of a bipartite graph is $0^{1}$
151. \item the largest eigenvalue of a $r$-regular graph is $2r$
152. with eigenvector $\left(1,\dots,1\right)$
153. \item only $K_{n}$ has got only two distinct eigenvalues
154. \end{itemize}
155. %For bipartite graph the Laplacian spectrum correspond to the $Q$-spectrum.
156. Comparing the general results, we noticed that there is a correlation between the connection properties of a graph and the number of eigenvalues: more connected is the graph, less eigenvalues we have. For example, on all the tree graphs, only the star $S_{n}$ has three distinct eigenvalues; all the others have at least four. Moreover, if a graph has diameter $d$ then $k$, the number of distinct eigenvalues, will satisfy $k-1 \geq d$.
157. \end{block}
158.
159. %----------------------------------------------------------------------------------------
160.
161. \end{column} % End of column 2.2
162.
163. \end{columns} % End of the split of column 2 - any content after this will now take up 2 columns width
164.
165. %----------------------------------------------------------------------------------------
166. % IMPORTANT RESULT
167. %----------------------------------------------------------------------------------------
168.
170.
171. Labelling with $\lambda_{i}$ the eigenvalues of the dynamical system on the graph and with $q_{i}$ the $Q$-eigenvalues of the graph, we have the following relations:
172. $\lambda_{i}=-a-2b q_{n-i+1}$, for $a \in \mathbb{R}$ and $b \in \mathbb{R}^{+}$.
173. If the largest eigenvalue of the system is negative, the system is stable. Then we can find a simple stability condition depending on the smallest $Q$-eigenvalue:
174. if $q_{n}>-\dfrac{a}{2b}$ the system is stable,
175. %if $q_{n}<-\dfrac{a}{2b}$
176. otherwise
177. the system is unstable.
179.
180. %----------------------------------------------------------------------------------------
181.
182. \begin{columns}[t,totalwidth=\twocolwid] % Split up the two columns wide column again
183.
184. \begin{column}{\onecolwid} % The first column within column 2 (column 2.1)
185.
186. %----------------------------------------------------------------------------------------
187. % MATHEMATICAL SECTION
188. %----------------------------------------------------------------------------------------
189. \begin{block}{Dynamical systems on the graph}
190. Given a graph $G$ of order $n$, consider a vector field $\pmb{x}\in \mathbb{R}^{n}$ whose components $\left(x_{1},\dots,x_{n}\right)$ are scalar fields associated to the vertices of $G$. Using the potential we defined before $U: \mathbb{R}^{n}\rightarrow \mathbb{R}$, the system becomes:
191. \begin{equation}
192. \dot{\pmb{x}}=- \left(aI+2bQ\right) \pmb{x}
193. \label{eqn:Einstein}
194. \end{equation}
195. $Q$ is a non negative, positive semidefinite, symmetric matrix. Thus $\exists R \in SO\left(n\right)$ that diagonalizes $Q$. We put $\pmb{\xi}=R^{-1}\pmb{x}$ and $\mathcal{D}=R^{-1}QR$ the diagonal matrix of all eigenvalues.
196. \begin{align*}
197. R^{-1}\dot{\pmb{x}}&=-R^{-1}\left(a I+2 b Q\right) R R^{-1}\pmb{x}
198. \\
199. \Rightarrow \dot{\pmb{\xi}}&=-\left(a I+2 b \mathcal{D}\right)\pmb{\xi}
200. \end{align*}
201. %Making explicit the individual equations, which are decoupled, we find:
202. %\begin{equation*}
203. %\dot{\xi}_{i}=-\left(a +2 b q_{i}\right)\xi_{i}, \qquad i=1,\dots, n .
204. %\end{equation*}
205. %The solutions of these equations are:
206. %\begin{equation*}
207. %\xi_{i}\left(t\right)=\xi_{i}\left(0\right)exp\left[-\left(a+2 b q_{i}\right)t\right] \qquad i=1,\dots, n
208. %\end{equation*}
209. and then the general solution is given by
210. \begin{equation}
211. \pmb{\xi}\left(t\right)=\sum_{i=1}^{n} e^{-\left(a+2bq_{i}\right)t}\pmb{c}_{i}
212. \end{equation}
213. where $\pmb{c}_{i}$ belongs to the $Q$-eigenspace. The system is unstable in $\pmb{x}=\pmb{0}$ if the largest eigenvalue is positive, and it is stable otherwise.
214. \end{block}
215.
216. %----------------------------------------------------------------------------------------
217.
218. \end{column} % End of column 2.1
219.
220. \begin{column}{\onecolwid} % The second column within column 2 (column 2.2)
221.
222. %----------------------------------------------------------------------------------------
223. % RESULTS
224. %----------------------------------------------------------------------------------------
225.
226. \begin{block}{System's eigenvalues}
227. \begin{figure}[tb]
228. \subfloat
230. \subfloat
231. {\includegraphics[width=.45\columnwidth]{index}}
232. \caption{Simulation for the system on $S_{5}$ and $C_{9}$}
233. %\label{fig:subfig}
234. \end{figure}
235. We combine the previous results. The $K_{n}$ system has smallest eigenvalue $\lambda_{n}=-a-4b\left(n-1\right)$ with eigenvector $\left(1,\dots,1\right)$. The perturbation spreads along all direction. It is needed a strong force to disrupt all the connection.
236. Then, a high connected graph like a complete graph $K_{n}$ goes in a very stable system.
237. On the other hand, the eigenspaces of the $P_{n}$ system have all dimension equal to one and a perturbation goes along just one vector.
238. That means that first it is easier to disconnect the system, because the perturbation can act on only one vector, and second the perturbation acts really specifically, leaving the other vertices untouched.
239.
240. %The largest eigenvalue is $\lambda_{1}=-a$, with eigenvector $\pmb{v}\left(q_{n}\right)=\left(1,\dots,1\right)$
241.
242. \end{block}
243.
244. %----------------------------------------------------------------------------------------
245.
246. \end{column} % End of column 2.2
247.
248. \end{columns} % End of the split of column 2
249.
250. \end{column} % End of the second column
251.
252. \begin{column}{\sepwid}\end{column} % Empty spacer column
253.
254. \begin{column}{\onecolwid} % The third column
255.
256. %----------------------------------------------------------------------------------------
257. % CONCLUSION
258. %----------------------------------------------------------------------------------------
259.
260. \begin{block}{Stochastic system}
261. We want now to add a stochastic noise to our differential equation.
262. We consider a stochastic vector, i.e., a vector of random variables defined on a probability space $\left(\Omega, \mathcal{F}, \mu\right)$, whose components are associated to the vertices of the graph. The equation becomes:
263. \begin{equation}
264. dX_{t}=-\left(a I+2 b Q\right) X_{t}dt+\beta\sum_{i=1}^{n}dW_{t}^{i} \label{stocheq}
265. \end{equation}
266. %$X_{t}:\Omega \rightarrow \mathbb{R}^{n}$,
267. where $\beta \in \mathbb{R}^{+}$ and $W_{t}=\left(W_{t}^{1},\dots,W_{t}^{n}\right)$ is a $n$-dimensional Brownian motion.
268. The equation has a solution in the form:
269. \begin{equation}
270. X_{t}=e^{-Ht}\left(c+\beta\int_{0}^{t}e^{Hs}dW_{s}\right) \label{solstoch}
271. \end{equation}
272. If we have an asymptotically stable solution, $H$ is positive definite and then $X_{t}$ converges in distribution to a normal distribution $\mathcal{N}\left(\mathbf{0},\frac{1}{2} \beta^2 H^{-1}\right)$.
273. \end{block}
274.
275. %----------------------------------------------------------------------------------------
277. %----------------------------------------------------------------------------------------
278.
279. \begin{block}{Conclusion}
280. \begin{itemize}
281. \item More connected is the graph, less distinct eigenvalues there are, bigger is the dimension of the relative eigenspaces
282. \item the smallest eigenvalue of the graph system, is simple and his eigenvector is positive
283. \item for bipartite graphs the largest eigenvalue is $\lambda_{1}=-a$, i.e., the system is unstable for all $a<0$
284. \end{itemize}
285.
286. \end{block}
287.
288. %----------------------------------------------------------------------------------------
289. % REFERENCES
290. %----------------------------------------------------------------------------------------
291.
292. \begin{block}{References}
293.
294. \nocite{*} % Insert publications even if they are not cited in the poster
295. \small{\bibliographystyle{unsrt}
296. %\bibliography{}\vspace{0.75in}
297. \begin{thebibliography}{1}
298. \bibitem{Arnold} L. Arnold, {\em Stochastic differential equations: theory and applications}, Krieger Publishing Company 1992
299. \bibitem{CerInZap} P. Cermelli, G. Indelicato, E. Zappa, {\em A stochastic model for the destabilization of viral capsids}, to appear
300. \bibitem{CveSiI} D. Cvetkovi\'c, S.K. Simi\'{c}, {\em Towards a spectral theory of graphs based on the signless Laplacian I}, Linear Algebra Appl. 432 (2010) 2257-2272
301. \bibitem{KazShre} I. Karatzas, S.E. Shreve, {\em Brownian motion and stochastic calculus}, Springer-Verlag New York (1991)
302. \bibitem{Tirion} M. M. Tirion, {\em Large Amplitude Elastic Motions in Proteins from a Single-Parameter, Atomic Analysis}, PRL, 99-7 (1996)
303. \end{thebibliography}
304. }
305. \end{block}
306.
307. %----------------------------------------------------------------------------------------
308. % ACKNOWLEDGEMENTS
309. %----------------------------------------------------------------------------------------
310.
311. \setbeamercolor{block title}{fg=red,bg=white} % Change the block title color
312.
313. %\begin{block}{Acknowledgements}
314. %
315. %\small{\rmfamily{Nam mollis tristique neque eu luctus. Suspendisse rutrum congue nisi sed convallis. Aenean id neque dolor. Pellentesque habitant morbi tristique senectus et netus et malesuada fames ac turpis egestas.}} \\
316. %
317. %\end{block}
318.
319. %----------------------------------------------------------------------------------------
320. % CONTACT INFORMATION
321. %----------------------------------------------------------------------------------------
322.
325.
327.
328. \begin{itemize}
329. \item Email: \href{mailto:}{}
330. \item Skype:
331. \item Phone:
332. \end{itemize}
333.
335.
336. %\begin{center}
337. %\begin{tabular}{ccc}
338. %\includegraphics[width=0.4\linewidth]{Logo1.png} %& \hfill & \includegraphics[width=0.4\linewidth]{logo.png}
339. %\end{tabular}
340. %\end{center}
341.
342. %----------------------------------------------------------------------------------------
343.
344. \end{column} % End of the third column
345.
346. \end{columns} % End of all the columns in the poster
347.
348. \end{frame} % End of the enclosing frame
349.
350. \end{document}
Last edited by Stefan Kottwitz on Tue May 10, 2016 3:49 pm, edited 1 time in total.
Reason: code marked

### Who is online

Users browsing this forum: No registered users and 1 guest