7,457 research outputs found
A Vision-Based Technique for Lay Length Measurement of Metallic Wire Ropes
No full textThe lay length of metallic wire ropes is an important dimensional quantity whose analysis is useful to highlight rope deformations due to distributed damages. This paper describes a measurement system that is based on a video camera and on an offline processing algorithm. The camera acquires an image sequence of the running rope; then, an image processing algorithm extracts the rope contour and measures both the distance among rope strands and the whole distance covered by the rope during the test. A mathematical model of the rope contour has been developed and employed to test the proposed algorithm with simulated data. Field tests have been carried out with the proposed system on a working aerial cableway using a general-purpose camer
Herbert Danninger y Alberto Molinari, nuevos doctores honoris causa de la UC3M
No full textAudiovisuales: Entrevista disponible en YouTube a Herbert Danninger disponible en: https://youtu.be/bWpDIe4cgqw . -- Entrevista disponible en YouTube a Herbert Danninger disponible en: https://youtu.be/KLQos2z4DasLos profesores Herbert Dannigner, catedrático de la Universidad Técnica de Viena, y Alberto Molinari, catedrático de la Universidad de Trento, fueron investidos doctores Honoris Causa por el rector de la UC3M, Juan Romo, durante el acto del día de la Universidad, celebrado el 29 de enero en el Aula Magna del campus de Getafe
Constraining Cycle Alternations in Model Checking for Interval Temporal Logic
No full textModel checking is one of the most successful techniques in system verification. While a variety of methods and tools exist to check properties expressed in point-based temporal logics, like LTL and CTL, model checking for interval temporal logic has entered the research agenda only very recently. In previous work, we devised a non-elementary model checking procedure for Halpern and Shoham's modal logic of time intervals, interpreted over finite Kripke structures, and an EXPSPACE algorithm for two meaningful fragments of it. In this paper, we show that the latter algorithm can be suitably tailored in order to check a subset of the computations of a system, that satisfy a given bound on the number of cycle alternations, by making use of a polynomial (instead of exponential) working space. We also prove that such a revised algorithm turns out to be complete for Kripke structures whose strongly connected components are simple cycle
Educación indígena: balance y perspectivas. Antropología. Boletín Oficial del Instituto Nacional de Antropología e Historia. Num. 70 Nueva Época (2003) abril-junio
No full textAcevedo, María Luisa, Íñigo Aguilar, Sara Molinari, et al., Etnografía y educación en el estado de Oaxaca, México, INAH (Científica, 268), 1993.Acevedo, María Luisa, Íñigo Aguilar, Luz Ma. Brunt y Sara Molinari, Educación interétnica, México, INAH (Científica, 320), 1996.Aguilar, Íñigo; El problema de la educación indígena. El caso del estado de Oaxaca, 3 vols., México, INAH (Científica, 235, 236 y 237), 1991.Aguirre Beltrán, Gonzalo; Regiones de refugio, México, Instituto Nacional Indigenista, 1973.López Morales, Alberto; "Más de 35,000 Oaxaqueños de diversos grupos étnicos viven en condiciones infrahumanas en el Valle de San Quintín", en El Universal, 23 de septiembre de 1994.Oficina de representación para el desarrollo de los pueblos indígenas de la Presidencia de la República, “Programa Nacional para el desarrollo de los pueblos indígenas. 2001-2006”, México, 2001.Secretaría de Educación Pública, Coordinación General de Educación Intercultural Bilingüe, “Convocatoria para elaborar el nuevo modelo educativo para el fortalecimiento de la diversidad”, México, SEP, 28 de junio de 2002
Libretto di sala - 1992 - Mariella Devia e Paola Molinari
No full textMariella Devia, sopranoPaola Molinari, pianofort
Image Analysis of Metallic Ropes for the Measurement of the Lay Length
No full textThe lay length of metallic wire ropes is an important dimensional quantity whose analysis is useful to highlight rope deformations due to distributed damages. The paper describes a measurement system based on a camera, which is employed to acquire images of hauling ropes, and on an image and signal processing algorithm that extracts the rope contour and measures the distance among rope strands. A mathematical model of the rope contour has been derived and it has been employed to test the proposed algorithm with simulated data. The simulation results have been also employed to set the view-angle of the vision system. Preliminary tests have been carried out on an aerial cableway with a general purpose camera in order to test the feasibility of the proposed measurement syste
Model Checking: il Metodo Intervallare
No full textI metodi formali sono metodologie strutturate che supportano lo sviluppo di sistemi critici allo scopo di dimostrare la loro correttezza con rigore matematico, fornendo tecniche e strumenti di verifica efficaci, e riducendo il tempo del processo di verifica, aumentando contemporaneamente il grado di copertura.
Il model checking (MC) è una famiglia di metodi formali che sono stati accettati dal mondo dell’industria e stanno diventando parte integrante di standard. Nel MC, alcune proprietà di un sistema di transizione vengono espresse mediante linguaggi di specifica e, successivamente, queste sono verificate su un modello del sistema stesso (di solito una struttura di Kripke), tramite l’enumerazione completa degli stati raggiungibili. Tale tecnica è automatica ed ogni volta che è violata una proprietà desiderata, viene fornito un controesempio che illustra un comportamento che falsifica la proprietà: ciò è utile per il debugging.
Le più famose tecniche di MC furono sviluppate negli anni 80 considerando le famose logiche temporali LTL e CTL, che sono basate su punti. Tuttavia, esistono alcune proprietà che potremmo voler verificare che hanno inerentemente una semantica intervallare e quindi non possono essere espresse da logiche puntuali, per esempio: “la proposizione p deve valere in almeno un dato numero medio di stati del sistema, in un settore di computazione specifico”. Le logiche temporali intervallari entrano in gioco in questi casi, permettendoci di ragionare su aspetti temporali in modo diverso: esse adottano gli intervalli, invece dei punti, come loro entità primitive. Questa caratteristica dà loro l’abilità di esprimere proprietà intervallari, come azioni con durata e aggregazioni temporali, che non possono essere trattate nelle logiche puntuali.
La logica modale degli intervalli temporali di Halpern e Shoham (HS) è una delle più famose logiche intervallari: essa ha una modalità per ognuna delle 13 relazioni di ordinamento fra coppie di intervalli, eccetto l’uguaglianza. In questa tesi viene considerato il problema del MC basato su HS, come linguaggio di specifica delle proprietà, il quale ha ricevuto poca attenzione in letteratura. L’idea è quella di valutare formule di HS su strutture di Kripke finite, per riuscire a verificare la correttezza di un sistema rispetto a proprietà intervallari. A questo scopo, ognuno dei percorsi finiti di una struttura di Kripke (i quali possono essere presenti in quantità infinita) è interpretato come un intervallo, e le proprietà atomiche che valgono su quest’ultimo sono definite sulla base di quelle degli stati che lo costituiscono, inizialmente secondo il principio di omogeneità: esso prevede che una proprietà atomica valga su un intervallo se e solo se vale su tutti i suoi sottointervalli. Dimostriamo che il MC per HS su strutture di Kripke finite è decidibile (la sua complessità ha un upper bound non-elementare); poi mostriamo che è EXPSPACE-hard.
Poiché il problema non ammette procedure di decisione polinomiali, consideriamo anche frammenti di HS, i quali hanno complessità migliori—da EXPSPACE, giù fino a livelli bassi della gerarchia polinomiale—pur tuttavia mantenendo l’abilità di esprimere proprietà intervallari significative. Presentiamo svariati algoritmi di MC, costruiti ad-hoc per gli specifici frammenti considerati, e fondati su concetti e tecniche diversi fra loro.
Studiamo poi il potere espressivo di HS in confronto a quello delle logiche puntuali LTL, CTL e CTL∗, sempre sotto l’ipotesi di omogeneità, la quale viene poi rilassata mostrando quali sono le implicazioni sul MC per HS ed i suoi frammenti, e sull’espressività della logica stessa.
Infine, consideriamo una possibile alternativa alle strutture di Kripke: studiamo un modello di sistemi più espressivo, che ci permette di descrivere gli stessi in termini delle loro proprietà intervallari.
Ciò apre la strada a un MC intervallare più generale.Formal methods are structured methodologies that support the development of critical systems, with the aim of establishing system correctness with mathematical rigor, providing effective verification techniques and tools, and reducing verification time while simultaneously increasing coverage.
Model checking (MC) is a family of formal methods that have been accepted by industry and are becoming integral part of standards. In MC, some properties of a transition system are expressed in suitable specification languages and then verified over a model of the system itself (usually a Kripke structure) through exhaustive enumeration of the reachable states. This technique is fully automatic and every time the design violates a desired property, a counterexample is produced, which illustrates a behavior falsifying such a property: this is extremely useful for debugging.
The most famous MC techniques were developed from the late 80s, bearing in mind the well-known “point-based” temporal logics LTL and CTL. However, while the expressiveness of such logics is beyond doubt, there are some properties we may want to check that are inherently “interval-based” and thus cannot be expressed by point-based temporal logics, e.g., “the proposition p has to hold in at least an average number of system states in a given computation sector”. Here interval temporal logics (ITLs) come into play, providing an alternative setting for reasoning about time. Such logics deal with intervals, instead of points, as their primitive entities: this feature gives them the ability of expressing temporal properties, such as actions with duration, accomplishments, and temporal aggregations, which cannot be dealt with in standard point-based logics.
The Halpern and Shoham’s modal logic of time intervals (HS, for short) is one of the most famous ITLs: it features one modality for each of the 13 possible ordering relations between pairs of intervals, apart from equality. In this thesis we focus our attention on MC based on HS, in the role of property specification language, for which a little work has been done if compared to MC for point-based temporal logics. The idea is to evaluate HS formulas on finite Kripke structures, making it possible to check the correctness of the behavior of systems with respect to meaningful interval properties. To this end, we interpret each one of the (possibly infinitely many) finite paths of a Kripke structure as an interval, and we define its atomic properties on the basis of the properties of the states composing it, at first assuming the homogeneity principle: the latter enforces an atomic property to hold over an interval if and only if it holds over all its subintervals. We prove that MC for HS interpreted over finite Kripke structures is a decidable problem (whose computational complexity has a nonelementary upper bound), and then we show it to be EXPSPACE-hard.
Since the problem provably admits no polynomial-time decision procedure, we also focus on HS fragments, which feature considerably better complexities—from EXPSPACE, down to low levels of the polynomial hierarchy—yet retaining the ability to capture meaningful interval properties of state transition systems. Several MC algorithms are presented, tailored to the specific fragments being considered, and founded on concepts and techniques different from each other.
Moreover, we study the expressive power of HS in MC, in comparison with that of the standard point-based logics LTL, CTL and CTL∗, still under the homogeneity principle, which is then relaxed showing how this impacts on the complexity of MC for HS and its fragments, and on the expressiveness of the logic.
Finally, we consider a possible replacement of Kripke structures by a more expressive model, which allows us to directly describe systems in terms of their interval-based behavior and properties, thus paving the way for a more general interval-based MC
Ciclo de Difusión Argentino
No full textIntérpretes: Ricardo Molinari, Alberto Girri , Olga Orozco y Héctor A. Murena. Leopoldo Federico, bandoneón. Roberto Grela, guitarraMin. 26.25: Notas sobre los poetas argentinos: Ricardo Molinari, Alberto Girri , Olga Orozco y Héctor A. Murena -- Min. 28.58: Ricardo Molinari lee Las nubes -- Min. 31.29: Recuerdos de la Alhambra de Tárrega -- Min. 35.01: Alberto Girri dos poemas suyos: Abril ; Min. 36.46: El desesperado -- Min. 28.06: Pieza musical -- Min. 39.39: Olga Orozco da lectura de Para retenerte mejor -- Min. 44.35: Pieza musical -- Min. 45.42: Breves retazos sobre Héctor A. Murena -- Min. 46.23: Héctor A. Murena lee La tormenta -- Min. 48.18: Tango Danzarín de Julián Plaza interpretado por Leopoldo Federico al bandoneón y Roberto Grela a la guitarra -- Min. 51.57: Despedida y cierre del program
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption
No full textThe expressive power of interval temporal logics (ITLs) makes them one of the most natural choices in a number of application domains, ranging from the specification and verification of complex reactive systems to automated planning. However, for a long time, because of their high computational complexity, they were considered not suitable for practical purposes. The recent discovery of several computationally well-behaved ITLs has finally changed the scenario. In this paper, we investigate the finite satisfiability and model checking problems for the ITL D, that has a single modality for the sub-interval relation, under the homogeneity assumption (that constrains a proposition letter to hold over an interval if and only if it holds over all its points). We first prove that the satisfiability problem for D, over finite linear orders, is PSPACE-complete, and then we show that the same holds for its model checking problem, over finite Kripke structures. In such a way, we enrich the set of tractable interval temporal logics with a new meaningful representative. © L. Bozzelli, A. Molinari, A. Montanari, A. Peron, and P. Sala
Digital currency, distributed innovation and technological and social change
No full textFil: Molinari, Carlos Alberto Jesús. Universidad Nacional de Luján. Departamento de Ciencias Sociales; Argentina.El artículo expone algunas de las líneas de trabajo desarrolladas en un Proyecto de Investigación dirigido por el autor, en el Departamento de Ciencias Sociales de la Universidad Nacional de Luján, entre los años 2018 y 2020. En ese sentido el objetivo es, tomando como modelo el bitcoin, explicitar las condiciones de posibilidad que dieron origen a las criptomonedas, su papel en el actual desarrollo del capitalismo y las derivas de las mismas y su tecnología de base. De la misma manera se enuncian algunas las conclusiones sobre las líneas expuestas. El equipo de investigación estuvo compuesto por: Lic. J. Monticelli, Mg. J. Belgrano, Lic. L. Luna, Lic. R. Ayesa, Lic. M. Passarini, Lic. V. Llarín, Lic. F. Boixados.The article exposes some of the lines of work developed in a Research Project directed by the author, in the Department of Social Sciences of the National University of Luján, between years 2018 to 2020. In that sense the objective is, taking bitcoin as a model, to make explicit the conditions of possibility that gave rise to cryptocurrencies, their role in the current development of capitalism and their derivations and their basic technology. In the same way, some of the conclusions about the exposed lines are enunciated. The Research team was formed by: Lic. J. Monticelli, Mg. J. Belgrano, Lic. L. Luna, Lic. R. Ayesa, Lic. M. Passarini, Lic. V. Llarín, Lic. F. Boixados
- …
