Misenum: the harbour and the city. Landscapes in context

The interest of archaeological research on the Phlegraean Fields, in the Gulf of Naples, has been often concentrated on different topics: monumental architecture, thermalism, coastal otium villas. However, we are still missing a reasonable reconstruction of the ancient landscapes of the area with special regard to the peninsula between Baiae and Misenum. The recent PhD project at the Vrije Universiteit Amsterdam has had the task of filling in the gap in local modern archaeology, and shifting the level of analysis from the ‘site’ to the ‘territory’: the study of individual monuments and surviving archaeological assemblages of the Roman town of Misenum, the main harbour for the Imperial navy, is now a part of the investigation of the urban organization of the municipium. The use of a dynamic and multidisciplinary research strategy has led to the creation of a new archaeological map for the area being investigated

studio teorico e sperimentale sul danneggiamento da pitting in ingranaggi per usi aerospaziali

La struttura della tesi è suddivisa in tre parti : la prima, teorica, che attraverso diverse metodologie di calcolo, fa una stima della previsione del danneggiamento da fatica superficiale da pitting. La seconda , sperimentale, che partendo dalle prove eseguite sul banco prova, mette in evidenza i risultati ottenuti, attraverso l'analisi con strumenti ottici quali il boroscopio e il microscopio, il rugosimetro, l’analisi metallografica ed infine il SEM. La terza parte tratta di un caso particolare di prove che rappresentano delle condizioni di funzionamento estreme a cui possono essere soggetti gli ingranaggi durante il verificarsi di un guasto all’impianto di lubrificazione

Relating state-based and process-based concurrency through linear logic (full-version)

AbstractThis paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones.Concurrent and distributed systems are notoriously hard to get right. Therefore, following an approach that has proved highly beneficial for sequential programs, much effort has been invested in tracing the foundations of concurrency in logic. The starting points of such investigations have been various idealized languages of concurrent and distributed programming, in particular the well established state-transformation model inspired by Petri nets and multiset rewriting, and the prolific process-based models such as the π-calculus and other process algebras. In nearly all cases, the target of these investigations has been linear logic, a formal language that supports a view of formulas as consumable resources. In the first part of this paper, we review some of these interpretations of concurrent languages into linear logic and observe that, possibly modulo duality, they invariably target a small semantic fragment of linear logic that we call LVobs.In the second part of the paper, we propose a new approach to understanding concurrent and distributed programming as a manifestation of logic, which yields a language that merges those two main paradigms of concurrency. Specifically, we present a new semantics for multiset rewriting founded on an alternative view of linear logic and specifically LVobs. The resulting interpretation is extended with a majority of linear connectives into the language of ω-multisets. This interpretation drops the distinction between multiset elements and rewrite rules, and considerably enriches the expressive power of standard multiset rewriting with embedded rules, choice, replication, and more. Derivations are now primarily viewed as open objects, and are closed only to examine intermediate rewriting states. The resulting language can also be interpreted as a process algebra. For example, a simple translation maps process constructors of the asynchronous π-calculus to rewrite operators. The language of ω-multisets forms the basis for the security protocol specification language MSR 3. With relations to both multiset rewriting and process algebra, it supports specifications that are process-based, state-based, or of a mixed nature, with the potential of combining verification techniques from both worlds. Additionally, its logical underpinning makes it an ideal common ground for systematically comparing protocol specification languages

Odorants for surveillance and control of the Asian Citrus Psyllid (Diaphorina citri).

BackgroundThe Asian Citrus Psyllid (ACP), Diaphorina citri, can transmit the bacterium Candidatus Liberibacter while feeding on citrus flush shoots. This bacterium causes Huanglongbing (HLB), a major disease of citrus cultivation worldwide necessitating the development of new tools for ACP surveillance and control. The olfactory system of ACP is sensitive to variety of odorants released by citrus plants and offers an opportunity to develop new attractants and repellents.ResultsIn this study, we performed single-unit electrophysiology to identify odorants that are strong activators, inhibitors, and prolonged activators of ACP odorant receptor neurons (ORNs). We identified a suite of odorants that activated the ORNs with high specificity and sensitivity, which may be useful in eliciting behavior such as attraction. In separate experiments, we also identified odorants that evoked prolonged ORN responses and antagonistic odorants able to suppress neuronal responses to activators, both of which can be useful in lowering attraction to hosts. In field trials, we tested the electrophysiologically identified activating odorants and identified a 3-odor blend that enhances trap catches by ∼230%.ConclusionThese findings provide a set of odorants that can be used to develop affordable and safe odor-based surveillance and masking strategies for this dangerous pest insect

Relating Multiset Rewriting and Process Algebras for Security Protocol Analysis

When formalizing security protocols, different specification languages support very different reasoning methodologies, whose results are not directly or easily comparable. Therefore, establishing clear mappings among different frameworks is highly desirable, as it permits various methodologies to cooperate by interpreting theoretical and practical results of one system into another. In this paper, we examine the relationship between two general verification frameworks: multiset rewriting (MSR) and a process algebra (PA) inspired to CCS and the -calculus. Although defining a simple and general bi-jection between MSR and PA appears difficult, we show that the sublanguages needed to specify cryptographic protocols admit an effective translation that is not only trace-preserving, but also induces a correspondence relation between the two languages. In particular, the correspondence sketched in this paper permits transferring several important trace-based properties such as secrecy and many forms of authentication