La Importancia de los Pequeños Detalles de Diseño de la Presa de las Navas del Marqués

En esta presa de gravedad de planta curva se han introducido una serie de pequeños detalles constructivos que inciden favorablemente sobre la seguridad estructural, la funcionalidad de la explotación y la estética de la obra, con un incremento porcentual insignificante del costo. En el artículo se describe cada una de estas actuaciones, el objetivo de las mismas, y su repercusión sobre el costo.

Monumentos de la sierra. El castillo de las Navas del Marqués (Ávila)

Monumentos de la sierra. El castillo de las Navas del Marqués (Ávila)

A repository for integration of software artifacts with dependency resolution and federation support

While developing new IT products, reusability of existing components is a key aspect that can considerably improve the success rate. This fact has become even more important with the rise of the open source paradigm. However, integrating different products and technologies is not always an easy task. Different communities employ different standards and tools, and most times is not clear which dependencies a particular piece of software has. This is exacerbated by the transitive nature of these dependencies, making component integration a complicated affair. To help reducing this complexity we propose a model-based repository, capable of automatically resolve the required dependencies. This repository needs to be expandable, so new constraints can be analyzed, and also have federation support, for the integration with other sources of artifacts. The solution we propose achieves these working with OSGi components and using OSGi itself.

A Model-Based Monitoring Architecture for Heterogeneous Enterprise Services and Information Systems

Runtime management of distributed information systems is a complex and costly activity. One of the main challenges that must be addressed is obtaining a complete and updated view of all the managed runtime resources. This article presents a monitoring architecture for heterogeneous and distributed information systems. It is composed of two elements: an information model and an agent infrastructure. The model negates the complexity and variability of these systems and enables the abstraction over non-relevant details. The infrastructure uses this information model to monitor and manage the modeled environment, performing and detecting changes in execution time. The agents infrastructure is further detailed and its components and the relationships between them are explained. Moreover, the proposal is validated through a set of agents that instrument the JEE Glassfish application server, paying special attention to support distributed configuration scenarios.

A Model-based Repository for Open Source Service and Component Integration.

Open source is a software development paradigm that has seen a huge rise in recent years. It reduces IT costs and time to market, while increasing security and reliability. However, the difficulty in integrating developments from different communities and stakeholders prevents this model from reaching its full potential. This is mainly due to the challenge of determining and locating the correct dependencies for a given software artifact. To solve this problem we propose the development of an extensible software component repository based upon models. This repository should be capable of solving the dependencies between several components and work with already existing repositories to access the needed artifacts transparently. This repository will also be easily expandable, enabling the creation of modules that support new kinds of dependencies or other existing repository technologies. The proposed solution will work with OSGi components and use OSGi itself.

Synchronization waves in geometric networks

We report synchronization of networked excitable nodes embedded in a metric space, where the connectivity properties are mostly determined by the distance between units. Such a high clustered structure, combined with the lack of long-range connections, prevents full synchronization and yields instead the emergence of synchronization waves. We show that this regime is optimal for information transmission through the system, as it enhances the options of reconstructing the topology from the dynamics. Measurements of topological and functional centralities reveal that the wave-synchronization state allows detection of the most structurally relevant nodes from a single observation of the dynamics, without any a priori information on the model equations ruling the evolution of the ensemble

Aplicaciones estructurales de la guadua (Guadua angustifolia Kunth): Proyecto de estructura modular multifuncional en Colombia

La Guadua (Guadua angustifolia Kunth) es una de las especies forestales más características de Colombia. Perteneciente a la familia del bambú, ésta planta nativa de Colombia usada en la construcción permite una reducción de costos, garantizados, entre otras ventajas, por sus propiedades físico-mecánicas de flexibilidad, resistencia, dureza, efecto climatizado y sismo resistencia. En el proyecto se plantea inicialmente un estudio de la Guadua como material estructural. Se estudiará su anatomía, sus propiedades físicas y mecánicas así como la normativa existente que rige su uso en construcción y por último se darán algunos ejemplos en los que se puede comprobar su uso en la actualidad. Posteriormente se procederá al desarrollo del proyecto cuya finalidad es el diseño de una estructura modular multifuncional que se necesita para llevarla a cabo en un proyecto de cooperación localizado en Neiva (Colombia). El proyecto incluirá todos los documentos necesarios para un trabajo de estas características: memoria, pliego de condiciones técnicas, presupuesto, planos, así como el Estudio de Seguridad y Salud Laboral. Como solución a las necesidades planteadas en el proyecto de cooperación, se realizará el diseño de dos estructuras modulares cuya finalidad sea las de uso como oficina y como almacén. Se aplicará para su cálculo el CTE cómo normativa de construcción, pero apoyándose en algunos parámetros en la NSR-10, estableciendo una comparativa posterior entre ambas normativas. Debido a la importancia de la acción sísmica en Colombia se comprobará la resistencia sísmica del módulo diseñado según el “Manual de Construcción, evaluación y rehabilitación sismo resistente de viviendas de mampostería” creado por la Asociación Colombiana de Ingeniería Sísmica. Basándose en este manual se definirán los tipos de uniones más favorables sísmicamente de los módulos con el diseño de una cercha auxiliar necesaria según el tipo de unión. ABSTRACT PROJECT: Structural applications of the guadua (Guadua angustifolia Kunth). Project of modular multifunctional structure in Colombia Guadua (Guadua angustifolia Kunth) is one of the forest species more characteristics of Colombia. Pertaining to the family of the bamboo, this one native plant of Colombia used in the construction allows a reduction of costs, guaranteed, among others advantages, by its physic mechanical properties of flexibility, resistance, hardness, climatic effect and earthquake resistance. The project initially considers a study of the Guadua as structural material. We will study its anatomy, its physical and mechanical properties as well as the existing norm that governs its use in construction and finally some examples will be provided in which its actual use can be verified. Later on, we will proceed with the development of the project which purpose is the design of a multifunctional modular structure required to in a project of cooperation located in Neiva (Colombia). The project will include all the necessary documents for a work of these characteristics: memory, technical specifications, budget, drawings, as well as the Security and Labor Health Study. In order to satisfy the needs raised in the cooperation project, we will undertake the design of two modular structures with the purpose to be used as office and warehouse. The construction normative CTE will be applied for its calculation, but some parameters will be based in the NSR-10, establishing a comparison between both norms. Due to the importance of the seismic action in Colombia, the seismic resistance of the module will be verified according to the “Manual of Construction, evaluation and rehabilitation resistant earthquake of rubblework houses” created by the Colombian Association of Seismic Engineering,. We will also use this Manual to define the types of unions more favorable from seismic point of view, designing the required auxiliary segments according to the type of union.

Estudio selvícola de un encinar de fruto económico -industrial de la montanera en Villanueva de Córdoba

Como cualquier encinar que eligiésemos a fin de concretar en él nuestro estudio, quedaría enclavado dentro de la masa general de encina que puebla el término de Villanueva de Córdoba, sometida toda ella al mismo tratamiento y sobre la que gravitan los mismos problemas, creemos conveniente dividir nuestro trabajo en dos partes, comprendiendo la primera esas cuestiones de índole general, no sólo dentro del término de Villanueva, sino comunes a todo el valle de los Pedroches, haciendo resaltar los problemas que en la actualidad se presentan y sus soluciones adecuadas: tratando en la segunda de las características, tratamiento y distintos aprovechamientos que posee, de que es objeto y rinde una finca concreta que posea las condiciones que se nos señala de “tener una producción frutal no inferior de la necesaria para el cebo o engorde de una piara de trescientos cerdos”. Siguiendo esta directriz, tratamos en la primera parte de la evolución histórico-jurídica, primero, y selvícola, después, de la masa encinar del término; pasamos a ocuparnos después de los tratamientos de que son objeto, del suelo y vuelo; estudiamos detenidamente la cuestión de plagas con los remedios que se han puesto y cabe poner en práctica, y, por último, tratamos de los distintos aprovechamientos de que son objeto estos encinares. En la segunda parte concretamos nuestro estudio sobre el monte “Las Navas” de propiedad particular en cuanto a sus estados legal, natural y forestal, y determinamos su capacidad en ganado deducida de su posibilidad en fruto y el rendimiento en los distintos aprovechamientos de que es objeto la finca. Resaltamos de antemano los tres problemas pendientes de solución, de gran trascendencia en cuanto al estado actual y futuro y de los encinares y su economía general: la extinción de plagas, la regeneración artificial del arbolado y el aprovechamiento del fruto mediante su conservación o transformación. El primer problema, siempre de actualidad, y de posible realización, que por su persistencia ha adquirido caracteres de catástrofe, es de lamentar que quede sin resolver después de los importantes trabajos realizados por el antiguo Servicio de Estudio y Extinción de Plagas Forestales, adscrito al Cuerpo de Montes. El segundo problema, el de la regeneración de los encinares, lo encontramos de necesaria solución, a pesar de la imposibilidad de los particulares que creen en la indefinida longevidad de la encina; pues es ya grande la extensión de la zona desarbolada o casi desarbolada, sin que su suelo produzca apenas utilidad alguna después de la desaparición del arbolado; y cierto el estado decadente del vuelo de algunas fincas. Y, por último, la cuestión de la conservación del fruto en grandes cantidades, o, mejor aún, su transformación en harina y conservación de la misma, es de gran transcendencia económica y su solución resolvería el problema del total y apropiado aprovechamiento de la bellota. Ilustran nuestro trabajo una pequeña colección de fotografías relacionadas con los distintos asuntos tratados, un pequeño muestrario de lo distintos tipos de fruto de la localidad y de diversas variedades de encina, y varias modalidades de las puestas de L. dispar y M. neustria, sin que hayamos podido recoger ninguna de T. viridana como era nuestro propósito. …

Negative ternary set-sharing

The Set-Sharing domain has been widely used to infer at compiletime interesting properties of logic programs such as occurs-check reduction, automatic parallelization, and flnite-tree analysis. However, performing abstract uniflcation in this domain requires a closure operation that increases the number of sharing groups exponentially. Much attention has been given to mitigating this key inefflciency in this otherwise very useful domain. In this paper we present a novel approach to Set-Sharing: we define a new representation that leverages the complement (or negative) sharing relationships of the original sharing set, without loss of accuracy. Intuitively, given an abstract state sh\> over the finite set of variables of interest V, its negative representation is p(V) \ shy. Using this encoding during analysis dramatically reduces the number of elements that need to be represented in the abstract states and during abstract uniflcation as the cardinality of the original set grows toward 2 . To further compress the number of elements, we express the set-sharing relationships through a set of ternary strings that compacts the representation by eliminating redundancies among the sharing sets. Our experiments show that our approach can compress the number of relationships, reducing signiflcantly the memory usage and running time of all abstract operations, including abstract uniflcation.

A flexible (C)LP-based approach to the analysis of object-oriented programs

Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of the work involving object-oriented languages and abstract interpretation usually omits the description of that language or just refers to the Control Flow Graph(CFG) it represents. However, this lack of formalization on one hand results in an absence of assurances regarding the correctness of the transformation and on the other it typically strongly couples the analysis to the source language. In this work we present a framework for analysis of object-oriented languages in which in a first phase we transform the input program into a representation based on Horn clauses. This allows on one hand proving the transformation correct attending to a simple condition and on the other being able to apply an existing analyzer for (constraint) logic programming to automatically derive a safe approximation of the semantics of the original program. The approach is flexible in the sense that the first phase decouples the analyzer from most languagedependent features, and correct because the set of Horn clauses returned by the transformation phase safely approximates the standard semantics of the input program. The resulting analysis is also reasonably scalable due to the use of mature, modular (C)LP-based analyzers. The overall approach allows us to report results for medium-sized programs.

User-definable resource bounds analysis for logic programs

We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in general be functions of input data sizes. A resource in our approach is a quite general, user-defined notion which associates a basic cost function with elementary operations. The analysis then derives the related (upper- and lower-bound) resource usage functions for all predicates in the program. We also present an assertion language which is used to define both such resources and resourcerelated properties that the system can then check based on the results of the analysis. We have performed some preliminary experiments with some concrete resources such as execution steps, bytes sent or received by an application, number of files left open, number of accesses to a datábase, number of calis to a procedure, number of asserts/retracts, etc. Applications of our analysis include resource consumption verification and debugging (including for mobile code), resource control in parallel/distributed computing, and resource-oriented specialization.

Efficient top-down set-sharing analysis using cliques

Abstract. We study the problem of efficient, scalable set-sharing analysis of logic programs. We use the idea of representing sharing information as a pair of abstract substitutions, one of which is a worst-case sharing representation called a clique set, which was previously proposed for the case of inferring pair-sharing. We use the clique-set representation for (1) inferring actual set-sharing information, and (2) analysis within a top-down framework. In particular, we define the new abstract functions required by standard top-down analyses, both for sharing alone and also for the case of including freeness in addition to sharing. We use cliques both as an alternative representation and as widening, defining several widening operators. Our experimental evaluation supports the conclusión that, for inferring set-sharing, as it was the case for inferring pair-sharing, precisión losses are limited, while useful efficieney gains are obtained. We also derive useful conclusions regarding the interactions between thresholds, precisión, efficieney and cost of widening. At the limit, the clique-set representation allowed analyzing some programs that exceeded memory capacity using classical sharing representations.

Automatic granularity-aware parallelization of programs with predicates, functions, and constraints

Abstract is not available

User-definable resource usage bounds analysis for java bytecode

Automatic cost analysis of programs has been traditionally concentrated on a reduced number of resources such as execution steps, time, or memory. However, the increasing relevance of analysis applications such as static debugging and/or certiflcation of user-level properties (including for mobile code) makes it interesting to develop analyses for resource notions that are actually application-dependent. This may include, for example, bytes sent or received by an application, number of files left open, number of SMSs sent or received, number of accesses to a datábase, money spent, energy consumption, etc. We present a fully automated analysis for inferring upper bounds on the usage that a Java bytecode program makes of a set of application programmer-deflnable resources. In our context, a resource is defined by programmer-provided annotations which state the basic consumption that certain program elements make of that resource. From these deflnitions our analysis derives functions which return an upper bound on the usage that the whole program (and individual blocks) make of that resource for any given set of input data sizes. The analysis proposed is independent of the particular resource. We also present some experimental results from a prototype implementation of the approach covering a signiflcant set of interesting resources.

Two efficient representations for set-sharing analysis in logic programs

Set-Sharing analysis, the classic Jacobs and Langen's domain, has been widely used to infer several interesting properties of programs at compile-time such as occurs-check reduction, automatic parallelization, flnite-tree analysis, etc. However, performing abstract uniflcation over this domain implies the use of a closure operation which makes the number of sharing groups grow exponentially. Much attention has been given in the literature to mitígate this key inefficiency in this otherwise very useful domain. In this paper we present two novel alternative representations for the traditional set-sharing domain, tSH and tNSH. which compress efficiently the number of elements into fewer elements enabling more efficient abstract operations, including abstract uniflcation, without any loss of accuracy. Our experimental evaluation supports that both representations can reduce dramatically the number of sharing groups showing they can be more practical solutions towards scalable set-sharing.