RACE (Rapid Arterial oCclusion Evaluation): Diseño y validación prehospitalaria de una escala neurológica para la predicción de una oclusión arterial proximal en los pacientes con un ictus isquémico agudo de la circulación cerebral anterior

La Rapid Arterial oCclusion Evaluation és una escala neurològica prehospitalària que prediu la presència d’una oclusió arterial proximal (OAP) en els pacients amb un ictus isquèmic agut de la circulació cerebral anterior (IIACCA). Fou dissenyada valorant retrospectivament a 654 pacients amb un IIACCA, seleccionant la combinació dels ítems de la National Institutes of Health Stroke Scale que mostraven una major associació amb la presència d’una OAP: parèsia facial, parèsia braquial, parèsia crural, desviació oculocefàlica y agnòsia/afàsia. Fou validada valorant prospectivament a 93 activacions del Codi Ictus, mostrant una sensibilitat del 88% y una especificitat del 65% per una puntuació ≥ 4.

Management information systems: The balanced scorecard in Spanish public universities

Organisations are becoming increasingly aware of the need for management information systems, due largely to the changing environment and a continuous process of globalisation. All of this means that managers need to adapt the structures of their organisations to the changes and, therefore, to plan, control and manage better. The Spanish public university cannot avoid this changing (demographic, economic and social changes) and globalising (among them the convergence of European qualifications) environment, to which we must add the complex organisation structure, characterised by a high dispersion of authority for decision making in different collegiate and unipersonal organs. It seems obvious that these changes must have repercussions on the direction, organisation and management structures of those public higher education institutions, and it seems natural that, given this environment, the universities must adapt their present management systems to the demand by society for the quality and suitability of the services they provide.

Trends in hours, balanced growth and the role of technology in the business cycle

The present paper revisits a property embedded in most dynamic macroeconomic models: the stationarity of hours worked. First, I argue that, contrary to what is often believed, there are many reasons why hours could be nonstationary in those models, while preserving the property of balanced growth. Second, I show that the postwar evidence for most industrialized economies is clearly at odds with the assumption of stationary hours per capita. Third, I examine the implications of that evidence for the role of technology as a source of economic fluctuations in the G7 countries.

Demand-based structural change and balanced economic growth

[eng] We analyze the equilibrium of a multi-sector exogenous growth model where the introduction of minimum consumption requirements drives structural change. We show that equilibrium dynamics simultaneously exhibt structural change and balanced growth of aggregate variables as is observed in US when the initial intensity of minimum consumption requirements is sufficiently small. This intensity is measured by the ratio between the aggregate value of the minimum consumption requirements and GDP and, therefore, it is inversely related with the level of economic development. Initially rich economies benefit from an initially low intensity of the minimum consumption requirements and, as a consequence, these economies end up exhibiting balanced growth of aggregate variables, while there is structural change. In contrast, initially poor economies suffer from an initially large intensity of the minimum consumption requirements, which makes the growth of the aggregate variables unbalanced during a very large period. These economies may never exhibit simultaneously balanced growth of aggregate variables and structural change.

Generating highly balanced sudoku problems as hard problems

Sudoku problems are some of the most known and enjoyed pastimes, with a never diminishing popularity, but, for the last few years those problems have gone from an entertainment to an interesting research area, a twofold interesting area, in fact. On the one side Sudoku problems, being a variant of Gerechte Designs and Latin Squares, are being actively used for experimental design, as in [8, 44, 39, 9]. On the other hand, Sudoku problems, as simple as they seem, are really hard structured combinatorial search problems, and thanks to their characteristics and behavior, they can be used as benchmark problems for refining and testing solving algorithms and approaches. Also, thanks to their high inner structure, their study can contribute more than studies of random problems to our goal of solving real-world problems and applications and understanding problem characteristics that make them hard to solve. In this work we use two techniques for solving and modeling Sudoku problems, namely, Constraint Satisfaction Problem (CSP) and Satisfiability Problem (SAT) approaches. To this effect we define the Generalized Sudoku Problem (GSP), where regions can be of rectangular shape, problems can be of any order, and solution existence is not guaranteed. With respect to the worst-case complexity, we prove that GSP with block regions of m rows and n columns with m = n is NP-complete. For studying the empirical hardness of GSP, we define a series of instance generators, that differ in the balancing level they guarantee between the constraints of the problem, by finely controlling how the holes are distributed in the cells of the GSP. Experimentally, we show that the more balanced are the constraints, the higher the complexity of solving the GSP instances, and that GSP is harder than the Quasigroup Completion Problem (QCP), a problem generalized by GSP. Finally, we provide a study of the correlation between backbone variables – variables with the same value in all the solutions of an instance– and hardness of GSP.

On balanced CSPs with high treewidth

Tractable cases of the binary CSP are mainly divided in two classes: constraint language restrictions and constraint graph restrictions. To better understand and identify the hardest binary CSPs, in this work we propose methods to increase their hardness by increasing the balance of both the constraint language and the constraint graph. The balance of a constraint is increased by maximizing the number of domain elements with the same number of occurrences. The balance of the graph is defined using the classical definition from graph the- ory. In this sense we present two graph models; a first graph model that increases the balance of a graph maximizing the number of vertices with the same degree, and a second one that additionally increases the girth of the graph, because a high girth implies a high treewidth, an important parameter for binary CSPs hardness. Our results show that our more balanced graph models and constraints result in harder instances when compared to typical random binary CSP instances, by several orders of magnitude. Also we detect, at least for sparse constraint graphs, a higher treewidth for our graph models.

Demand-based structural change and balanced economic growth

[eng] We analyze the equilibrium of a multi-sector exogenous growth model where the introduction of minimum consumption requirements drives structural change. We show that equilibrium dynamics simultaneously exhibt structural change and balanced growth of aggregate variables as is observed in US when the initial intensity of minimum consumption requirements is sufficiently small. This intensity is measured by the ratio between the aggregate value of the minimum consumption requirements and GDP and, therefore, it is inversely related with the level of economic development. Initially rich economies benefit from an initially low intensity of the minimum consumption requirements and, as a consequence, these economies end up exhibiting balanced growth of aggregate variables, while there is structural change. In contrast, initially poor economies suffer from an initially large intensity of the minimum consumption requirements, which makes the growth of the aggregate variables unbalanced during a very large period. These economies may never exhibit simultaneously balanced growth of aggregate variables and structural change.

Demand-based structural change and balanced economic growth

[eng] We analyze the equilibrium of a multi-sector exogenous growth model where the introduction of minimum consumption requirements drives structural change. We show that equilibrium dynamics simultaneously exhibt structural change and balanced growth of aggregate variables as is observed in US when the initial intensity of minimum consumption requirements is sufficiently small. This intensity is measured by the ratio between the aggregate value of the minimum consumption requirements and GDP and, therefore, it is inversely related with the level of economic development. Initially rich economies benefit from an initially low intensity of the minimum consumption requirements and, as a consequence, these economies end up exhibiting balanced growth of aggregate variables, while there is structural change. In contrast, initially poor economies suffer from an initially large intensity of the minimum consumption requirements, which makes the growth of the aggregate variables unbalanced during a very large period. These economies may never exhibit simultaneously balanced growth of aggregate variables and structural change.

Genetic markers of the Va/Ba balanced lethal strain of Drosophila subobscura

The Va/Ba strain, constructed by Sperlich et al. (1977), is the only balanced lethal strain in D. subobscura. It allows the production of homozygous O chromosomes and has been a useful tool not only to analyse chromosomal viabilities but also to obtain homokaryotypic lines (Mestres and Serra, 2008). Besides the morphological dominant mutations Va (Varicose) and Ba (Bare), other genetic markers have been characterized in this strain, some of them by our group and not described previously. Here we present a list of these markers.

Viewpoint-Based Ambient Occlusion

We've developed a new ambient occlusion technique based on an information-theoretic framework. Essentially, our method computes a weighted visibility from each object polygon to all viewpoints; we then use these visibility values to obtain the information associated with each polygon. So, just as a viewpoint has information about the model's polygons, the polygons gather information on the viewpoints. We therefore have two measures associated with an information channel defined by the set of viewpoints as input and the object's polygons as output, or vice versa. From this polygonal information, we obtain an occlusion map that serves as a classic ambient occlusion technique. Our approach also offers additional applications, including an importance-based viewpoint-selection guide, and a means of enhancing object features and producing nonphotorealistic object visualizations