Nonautonomous Graphs and Topological Entropy of Nonautonomous Lorenz Systems

In this work, we associate a p-periodic nonautonomous graph to each p-periodic nonautonomous Lorenz system with finite critical orbits. We develop Perron-Frobenius theory for nonautonomous graphs and use it to calculate their entropy. Finally, we prove that the topological entropy of a p-periodic nonautonomous Lorenz system is equal to the entropy of its associated nonautonomous graph.

Minimization of open orders using interval graphs

In this paper we address an order processing optimization problem known as the Minimization of Open Stacks Problem (MOSP). This problem consists in finding the best sequence for manufacturing the different products required by costumers, in a setting where only one product can be made at a time. The objective is to minimize the maximum number of incomplete orders from costumers that are being processed simultaneously. We present an integer programming model, based on the existence of a perfect elimination order in interval graphs, which finds an optimal sequence for the costumers orders. Among other economic advantages, manufacturing the products in this optimal sequence reduces the amount of space needed to store incomplete orders.

Sequencing cutting patterns with colored interval graphs

The problem addressed here originates in the industry of flat glass cutting and wood panel sawing, where smaller items are cut from larger items accordingly to predefined cutting patterns. In this type of industry the smaller pieces that are cut from the patterns are piled around the machine in stacks according to the size of the pieces, which are moved to the warehouse only when all items of the same size have been cut. If the cutting machine can process only one pattern at a time, and the workspace is limited, it is desirable to set the sequence in which the cutting patterns are processed in a way to minimize the maximum number of open stacks around the machine. This problem is known in literature as the minimization of open stacks (MOSP). To find the best sequence of the cutting patterns, we propose an integer programming model, based on interval graphs, that searches for an appropriate edge completion of the given graph of the problem, while defining a suitable coloring of its vertices.

Generalized Extraction of Real-Time Parameters for Homogeneous Synchronous Dataflow Graphs

23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP 2015). 4 to 6, Mar, 2015. Turku, Finland.

Graph usage in financial reports: Evidence from Portuguese listed companies

When assessing investment options, investors focus on the graphs of annual reports, despite lack of auditing. If poorly constructed, graphs distort perceptions and lead to inaccurate decisions. This study examines graph usage in all the companies listed on Euronext Lisbon in 2013. The findings suggest that graphs are common in the annual reports of Portuguese companies and that, while there is no evidence of Selectivity Distortion, both Measurement and Orientation Distortions are pervasive. The study recommends the auditing of financial graphs, and urges preparers and users of annual reports to be wary of the possibility of graph distortion.

Graph usage in annual reports, evidence from Norwegian listed companies

As investors and other users of annual reports often focus their attention on graphs, it is important that they portray accurate and reliable information. However, previous studies show that graphs often distort information and mislead users. This study analyses graph usage in annual reports from the 52 most traded Norwegian companies. The findings suggest that Norwegian companies commonly use graphs, and that the graph distortions, presentational enhancement and measurement distortion, are present. No evidence of selectivity was found. This study recommends development of guidelines for graphical disclosure, and advises preparers and users of annual reports to be aware of misleading graphs.

Erratum: Erratum: Alcohol-aminosilicate hybrid coatings for corrosion protection of galvanized steel in mortar

Artigo completo publicado na revista "Journal of The Electrochemical Society" 161:6 (2014) C349-C362 e disponível no RepositóriUM em: http://hdl.handle.net/1822/33784. Errata disponível no RepositóriUM em: http://hdl.handle.net/1822/40064. (Publisher’s note: An erratum that addressed the errors in Figure 9 was originally published on Dec. 10, 2014, however the graphs in that erratum were not correct.)

An Equation for the Prediction of Oxygen Consumption in a Brazilian Population

Background: The equations predicting maximal oxygen uptake (VO2max or peak) presently in use in cardiopulmonary exercise testing (CPET) softwares in Brazil have not been adequately validated. These equations are very important for the diagnostic capacity of this method. Objective: Build and validate a Brazilian Equation (BE) for prediction of VO2peak in comparison to the equation cited by Jones (JE) and the Wasserman algorithm (WA). Methods: Treadmill evaluation was performed on 3119 individuals with CPET (breath by breath). The construction group (CG) of the equation consisted of 2495 healthy participants. The other 624 individuals were allocated to the external validation group (EVG). At the BE (derived from a multivariate regression model), age, gender, body mass index (BMI) and physical activity level were considered. The same equation was also tested in the EVG. Dispersion graphs and Bland-Altman analyses were built. Results: In the CG, the mean age was 42.6 years, 51.5% were male, the average BMI was 27.2, and the physical activity distribution level was: 51.3% sedentary, 44.4% active and 4.3% athletes. An optimal correlation between the BE and the CPET measured VO2peak was observed (0.807). On the other hand, difference came up between the average VO2peak expected by the JE and WA and the CPET measured VO2peak, as well as the one gotten from the BE (p = 0.001). Conclusion: BE presents VO2peak values close to those directly measured by CPET, while Jones and Wasserman differ significantly from the real VO2peak.

Contractions in the 2-wasserstein lenght space and thermalization of granular media

An algebraic decay rate is derived which bounds the time required for velocities to equilibrate in a spatially homogeneous flow-through model representing the continuum limit of a gas of particles interacting through slightly inelastic collisions. This rate is obtained by reformulating the dynamical problem as the gradient flow of a convex energy on an infinite-dimensional manifold. An abstract theory is developed for gradient flows in length spaces, which shows how degenerate convexity (or even non-convexity) | if uniformly controlled | will quantify contractivity (limit expansivity) of the flow.

Orthogonal systems in finite grahps

To a finite graph there corresponds a free partially commutative group: with the given graph as commutation graph. In this paper we construct an orthogonality theory for graphs and their corresponding free partially commutative groups. The theory developed here provides tools for the study of the structure of partially commutative groups, their universal theory and automorphism groups. In particular the theory is applied in this paper to the centraliser lattice of such groups.

Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs

We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove “fixation”, i.e. that players will adopt a constant strategy after a finite time. The resulting dynamics is related to zerotemperature Glauber dynamics on random graphs of possibly infinite volume.

Monads in double categories

We extend the basic concepts of Street's formal theory of monads from the setting of 2-categories to that of double categories. In particular, we introduce the double category Mnd(C) of monads in a double category C and dene what it means for a double category to admit the construction of free monads. Our main theorem shows that, under some mild conditions, a double category that is a framed bicategory admits the construction of free monads if its horizontal 2-category does. We apply this result to obtain double adjunctions which extend the adjunction between graphs and categories and the adjunction between polynomial endofunctors and polynomial monads.

Els cultius in vitro i el desenvolupament vegetal

Biotecnologia Vegetal de materials de treball que incorporin les TICs. El material elaborat ha estat un llibre electrònic utilitzable tant on-line (web) com off-line (CD). Els materials generats com a resultes d’aquest projecte han estat situats en un servidor de la UdL accessible des de l’exterior de la Universitat. Aquest llibre electrònic és d’accés obert i es pot consultar on-line a l’URL (http://sakai.udl.es/cursos/76304/indexC.htm). El llibre electrònic conté un total de 98 Mb d’informació hipermèdia i hipertexual distribuïda en més de 380 arxius dels quals 50 són pàgines html, 10 arxius doc, 10 arxius pdf, 258 imatges fixes i 8 arxius de vídeo en format flash (swf). L’accés al llibre electrònic es realitza a través d’una pantalla inicial que dóna pas a un menú que distribueix els materials en 7 apartats. Els textos estan acompanyats de gran quantitat d’imatges fotogràfiques, gràfics, esquemes, imatges infogràfiques i videoclips generats de novo per aquest projecte. En dissenyar la web s’han tingut en compte criteris de confiabilitat, accessibilitat i usabilitat. El primer disseny de la web ha estat validat per un panel d’usuaris i utilitzat posteriorment amb alumnes durant el curs 2007-2008. Les observacions i suggeriments fets per aquests ja han estat incorporats en aquest document final. Una primera enquesta de satisfacció realitzada amb aquest alumnat permet concloure, a títol provisional donat lo reduït de la població enquestada, que l’alumnat mostra un grau de coneixement de les eines TIC suficient i que consideren positiva la incorporació de materials multimèdia com a recurs educatiu. A més a més, la realització d’aquest projecte i la seva aplicació a l’aula ha estat presentada en dues ponències al “Congreso Internacional de Docencia y Innovación Universitaria”.