Interactive simulation of flexible parts

Computer simulations play an ever growing role for the development of automotive products. Assembly simulation, as well as many other processes, are used systematically even before the first physical prototype of a vehicle is built in order to check whether particular components can be assembled easily or whether another part is in the way. Usually, this kind of simulation is limited to rigid bodies. However, a vehicle contains a multitude of flexible parts of various types: cables, hoses, carpets, seat surfaces, insulations, weatherstrips... Since most of the problems using these simulations concern one-dimensional components and since an intuitive tool for cable routing is still needed, we have chosen to concentrate on this category, which includes cables, hoses and wiring harnesses. In this thesis, we present a system for simulating one dimensional flexible parts such as cables or hoses. The modeling of bending and torsion follows the Cosserat model. For this purpose we use a generalized spring-mass system and describe its configuration by a carefully chosen set of coordinates. Gravity and contact forces as well as the forces responsible for length conservation are expressed in Cartesian coordinates. But bending and torsion effects can be dealt with more effectively by using quaternions to represent the orientation of the segments joining two neighboring mass points. This augmented system allows an easy formulation of all interactions with the best appropriate coordinate type and yields a strongly banded Hessian matrix. An energy minimizing process accounts for a solution exempt from the oscillations that are typical of spring-mass systems. The use of integral forces, similar to an integral controller, allows to enforce exactly the constraints. The whole system is numerically stable and can be solved at interactive frame rates. It is integrated in the DaimlerChrysler in-house Virtual Reality Software veo for use in applications such as cable routing and assembly simulation and has been well received by users. Parts of this work have been published at the ACM Solid and Physical Modeling Conference 2006 and have been selected for the special issue of the Computer-Aided-Design Journal to the conference.

Analisi e ottimizzazione del servizio di raccolta e trasporto dei rifiuti anche in relazione alle tematiche ambientali: un'applicazione alla rete urbana di Bologna

Questo studio, che è stato realizzato in collaborazione con Hera, è un'analisi della gestione dei rifiuti a Bologna. La ricerca è stata effettuata su diversi livelli: un livello strategico il cui scopo è quello di identificare nuovi metodi per la raccolta dei rifiuti in funzione delle caratteristiche del territorio della città, un livello analitico che riguarda il miglioramento delle applicazioni informatiche di supporto, e livello ambientale che riguarda il calcolo delle emissioni in atmosfera di veicoli adibiti alla raccolta e al trasporto dei rifiuti. innanzitutto è stato necessario studiare Bologna e lo stato attuale dei servizi di raccolta dei rifiuti. È incrociando questi componenti che in questi ultimi tre anni sono state effettuate modifiche nel settore della gestione dei rifiuti. I capitoli seguenti sono inerenti le applicazioni informatiche a sostegno di tali attività: Siget e Optit. Siget è il programma di gestione del servizio, che attualmente viene utilizzato per tutte le attività connesse alla raccolta di rifiuti. È un programma costituito da moduli diversi, ma di sola la gestione dati. la sperimentazione con Optit ha aggiunto alla gestione dei dati la possibilità di avere tali dati in cartografia e di associare un algoritmo di routing. I dati archiviati in Siget hanno rappresentato il punto di partenza, l'input, e il raggiungimento di tutti punti raccolta l'obiettivo finale. L'ultimo capitolo è relativo allo studio dell'impatto ambientale di questi percorsi di raccolta dei rifiuti. Tale analisi, basata sulla valutazione empirica e sull'implementazione in Excel delle formule del Corinair mostra la fotografia del servizio nel 2010. Su questo aspetto Optit ha fornito il suo valore aggiunto, implementando nell'algoritmo anche le formule per il calcolo delle emissioni.

Wewheelrocku: Un'applicazione partecipativa per disabili a bologna

Tesi partecipativa per disabili. Applicazione Android con interfaccia per l'inserimento di informazioni di routing e marker informativi su mappe OpenStreetMap e mediante la libreria Mapsforge.

Progettazione e sviluppo di software di supporto alla logistica dei trasporti.

Uno dei problemi più diffusi, nell'ambito della logistica, è rappresentato dai costi di trasporto. La gestione dei flussi merci, l'approvvigionamento dei clienti, e la relativa pianifcazione della movimentazione dei veicoli, hanno incidenze notevoli sui costi di gestione aziendali, i quali vengono stimati mediamente nel 45% dei costi logistici. A ragione di questo, sono sempre di più le aziende che ricorrono all'impiego di uffici dedicati alla pianifcazione delle consegne e la gestione dei trasporti in generale. Sebbene le voci di bilancio relative al trasporto raggiungano cifre rilevanti, fno al 4% del fatturato annuo, il tema della pianifcazione viene spesso sottovalutato. Infatti la soluzione a problemi di pianifcazione e monitoraggio dei costi, è spesso demandata a procedure manuali senza supporto informatico. Nasce da qui l'esigenza di proporre uno strumento informatico che supporti gli addetti preposti alla pianifcazione, sviluppando un sistema che copra esigenze di pianifcazione dei viaggi, controllo e consuntivazione dei costi di trasporto, e monitoraggio dei mezzi in tempo reale. La proposta di Gesp srl, Geographic Information Systems, azienda italiana che opera da anni nel campo delle applicazioni software geo-spaziali, prende il nome di Nuovo Sistema Trasporti, o più semplicemente, NST. In quest'ambito prende corpo questa tesi, la quale si pone l'obiettivo di illustrare le fasi di nascita, analisi, progettazione e sviluppo di un software generico per il supporto alla logistica. Saranno così analizzati: le problematiche affrontate nella fase di defnizione, e kick-off (avvio), del progetto, il problema del routing, o Vehicle Routing Problem e le tecniche di Ricerca Operativa che vengono applicate per la sua risoluzione; le moderne metodologie di gestione e sviluppo di un software; l'architettura e le tecnologie impiegate per la distribuzione dell'applicativo.

Ribosome-inactivating proteins and their immunotoxins for cancer therapy: insights into the mechanism of cell death

Ribosome-inactivating proteins (RIPs) are a family of plant toxic enzymes that permanently damage ribosomes and possibly other cellular substrates, thus causing cell death involving different and still not completely understood pathways. The high cytotoxic activity showed by many RIPs makes them ideal candidates for the production of immunotoxins (ITs), chimeric proteins designed for the selective elimination of unwanted or malignant cells. Saporin-S6, a type 1 RIP extracted from Saponaria officinalis L. seeds, has been extensively employed to construct anticancer conjugates because of its high enzymatic activity, stability and resistance to conjugation procedures, resulting in the efficient killing of target cells. Here we investigated the anticancer properties of two saporin-based ITs, anti-CD20 RTX/S6 and anti-CD22 OM124/S6, designed for the experimental treatment of B-cell NHLs. Both ITs showed high cytotoxicity towards CD20-positive B-cells, and their antitumor efficacy was enhanced synergistically by a combined treatment with proteasome inhibitors or fludarabine. Furthermore, the two ITs showed differencies in potency and ability to activate effector caspases, and a different behavior in the presence of the ROS scavenger catalase. Taken together, these results suggest that the different carriers employed to target saporin might influence saporin intracellular routing and saporin-induced cell death mechanisms. We also investigated the early cellular response to stenodactylin, a recently discovered highly toxic type 2 RIP representing an interesting candidate for the design and production of a new IT for the experimental treatment of cancer.

Many-core Algorithms for Combinatorial Optimization

Combinatorial Optimization is becoming ever more crucial, in these days. From natural sciences to economics, passing through urban centers administration and personnel management, methodologies and algorithms with a strong theoretical background and a consolidated real-word effectiveness is more and more requested, in order to find, quickly, good solutions to complex strategical problems. Resource optimization is, nowadays, a fundamental ground for building the basements of successful projects. From the theoretical point of view, Combinatorial Optimization rests on stable and strong foundations, that allow researchers to face ever more challenging problems. However, from the application point of view, it seems that the rate of theoretical developments cannot cope with that enjoyed by modern hardware technologies, especially with reference to the one of processors industry. In this work we propose new parallel algorithms, designed for exploiting the new parallel architectures available on the market. We found that, exposing the inherent parallelism of some resolution techniques (like Dynamic Programming), the computational benefits are remarkable, lowering the execution times by more than an order of magnitude, and allowing to address instances with dimensions not possible before. We approached four Combinatorial Optimization’s notable problems: Packing Problem, Vehicle Routing Problem, Single Source Shortest Path Problem and a Network Design problem. For each of these problems we propose a collection of effective parallel solution algorithms, either for solving the full problem (Guillotine Cuts and SSSPP) or for enhancing a fundamental part of the solution method (VRP and ND). We endorse our claim by presenting computational results for all problems, either on standard benchmarks from the literature or, when possible, on data from real-world applications, where speed-ups of one order of magnitude are usually attained, not uncommonly scaling up to 40 X factors.

Simulation of visible light communications in vehicular networks

The rapid development in the field of lighting and illumination allows low energy consumption and a rapid growth in the use, and development of solid-state sources. As the efficiency of these devices increases and their cost decreases there are predictions that they will become the dominant source for general illumination in the short term. The objective of this thesis is to study, through extensive simulations in realistic scenarios, the feasibility and exploitation of visible light communication (VLC) for vehicular ad hoc networks (VANETs) applications. A brief introduction will introduce the new scenario of smart cities in which visible light communication will become a fundamental enabling technology for the future communication systems. Specifically, this thesis focus on the acquisition of several, frequent, and small data packets from vehicles, exploited as sensors of the environment. The use of vehicles as sensors is a new paradigm to enable an efficient environment monitoring and an improved traffic management. In most cases, the sensed information must be collected at a remote control centre and one of the most challenging aspects is the uplink acquisition of data from vehicles. My thesis discusses the opportunity to take advantage of short range vehicle-to-vehicle (V2V) and vehicle-to-roadside (V2R) communications to offload the cellular networks. More specifically, it discusses the system design and assesses the obtainable cellular resource saving, by considering the impact of the percentage of vehicles equipped with short range communication devices, of the number of deployed road side units, and of the adopted routing protocol. When short range communications are concerned, WAVE/IEEE 802.11p is considered as standard for VANETs. Its use together with VLC will be considered in urban vehicular scenarios to let vehicles communicate without involving the cellular network. The study is conducted by simulation, considering both a simulation platform (SHINE, simulation platform for heterogeneous interworking networks) developed within the Wireless communication Laboratory (Wilab) of the University of Bologna and CNR, and network simulator (NS3). trying to realistically represent all the wireless network communication aspects. Specifically, simulation of vehicular system was performed and introduced in ns-3, creating a new module for the simulator. This module will help to study VLC applications in VANETs. Final observations would enhance and encourage potential research in the area and optimize performance of VLC systems applications in the future.

Contributions to exact approaches in combinatorial optimization

The focus of this thesis is to contribute to the development of new, exact solution approaches to different combinatorial optimization problems. In particular, we derive dedicated algorithms for a special class of Traveling Tournament Problems (TTPs), the Dial-A-Ride Problem (DARP), and the Vehicle Routing Problem with Time Windows and Temporal Synchronized Pickup and Delivery (VRPTWTSPD). Furthermore, we extend the concept of using dual-optimal inequalities for stabilized Column Generation (CG) and detail its application to improved CG algorithms for the cutting stock problem, the bin packing problem, the vertex coloring problem, and the bin packing problem with conflicts. In all approaches, we make use of some knowledge about the structure of the problem at hand to individualize and enhance existing algorithms. Specifically, we utilize knowledge about the input data (TTP), problem-specific constraints (DARP and VRPTWTSPD), and the dual solution space (stabilized CG). Extensive computational results proving the usefulness of the proposed methods are reported.

Smart Mobility: integrazione di crowdsourcing e opendata per percorsi multimodali e personalizzati.

Lo scopo che questa tesi ha è di inserirsi nell’ambito della Smart Mobility, in particolare nell'ambito dell’accessibilità urbana. Obiettivo primario è di offrire un software capace di adattarsi alle capacità dell’utente nel muoversi nell’ambiente urbano, in particolare riguardo alle barriere architettoniche che lo ostacolano. Quello che il programma deve fare è offrire percorsi per l’utente, personalizzati rispetto alle sue richieste. Affinché sia possibile tutto ciò, sono necessarie delle fondamenta, nella fattispecie una fonte di dati geografici e uno strumento che permetta di ricercare percorsi da essi e di essere modificato per includere le modifiche volute. La fonte di dati geografici scelta è stata OpenStreetMap, un progetto di crowdsourcing che punta a creare una mappa globale completamente accessibile fino al suo livello più basso e utilizzabile da chiunque, purché sia rispettata la sua licenza. Da questa scelta, derivano i software utilizzabili per calcolare i percorsi: la tesi ne esplorerà in particolare due GraphHopper e OpenTripPlanner, entrambi progetti open source. L’ultimo, ma non meno importante, scopo della tesi è effettivamente implementare un algoritmo di routing capace di considerare le preferenze degli utenti. Queste preferenze, infatti, non devono solo permettere di escludere percorsi con una barriera/architettonica cui l’utente non può accedere, ma anche di favorire percorsi con le facility che l’utente preferisce e di sfavorire quelli con facility che l’utente non preferisce.

Anonimato in rete

CAP.1: introduzione sulla creazione di Internet e la sua diffusione; CAP.2: panoramica sui dati reperibili online e sugli strumenti attraverso cui è possibile estrarne informazioni; CAP.3: concetti di privacy ed anonimato applicati ad Internet, alcune normative, sintesi su cookie e spyware; CAP.4: deep web, cos'è e come raggiungerlo; CAP.5: TOR project, elenco delle componenti, spiegazione del protocollo per la creazione di connessioni anonime, particolarità ed aspetti problematici; CAP.6: conclusioni; carrellata dei progetti correlati a TOR, statistiche sull'uso dell'Internet anonimo, considerazioni sugli effetti dell'anonimato sul sociale e sull'inviolabilità di questo sistema.

Factors influencing the decision for Baha in unilateral deafness: the Bern benefit in single-sided deafness questionnaire

The data of 46 adults with single-sided sensorineural deafness who were candidates for bone-anchored hearing aids (Baha) CROS (contralateral routing of signals) were analyzed. All candidates tested a Baha with a headband in their normal environment. Subsequently, 29 of the candidates chose a permanent Baha CROS fitting, and 17 declined, thus forming the two study groups. No significant difference regarding age, sex or duration of deafness was found between the two groups. Similarly, the transcranial attenuation was not significantly different between those who accepted and declined a Baha. Subjects with some residual hearing in their poorer ear tended to decline a Baha, but the effect was not statistically significant. For a subset of 28 subjects, the Bern Benefit in Single-Sided Deafness questionnaire was administered. The questionnaire consists of 10 visual analogue scales rating the subjectively perceived benefit of the Baha or any other CROS device in different situations. Scores were found to be significantly higher for speech understanding at some distance (p = 0.026), for speech understanding in noise (p = 0.037), for group conversations (p < 0.01), and for the overall benefit (p < 0.01) for those candidates who chose to use a Baha as a CROS device permanently.

The stress response protein Gls24 is induced by copper and interacts with the CopZ copper chaperone of Enterococcus hirae

Intracellular copper routing in Enterococcus hirae is accomplished by the CopZ copper chaperone. Under copper stress, CopZ donates Cu(+) to the CopY repressor, thereby releasing its bound zinc and abolishing repressor-DNA interaction. This in turn induces the expression of the cop operon, which encodes CopY and CopZ, in addition to two copper ATPases, CopA and CopB. To gain further insight into the function of CopZ, the yeast two-hybrid system was used to screen for proteins interacting with the copper chaperone. This led to the identification of Gls24, a member of a family of stress response proteins. Gls24 is part of an operon containing eight genes. The operon was induced by a range of stress conditions, but most notably by copper. Gls24 was overexpressed and purified, and was shown by surface plasmon resonance analysis to also interact with CopZ in vitro. Circular dichroism measurements revealed that Gls24 is partially unstructured. The current findings establish a novel link between Gls24 and copper homeostasis.

Debris-flow activity in abandoned channels of the Manival torrent reconstructed with LiDAR and tree-ring data

Hydrogeomorphic processes are a major threat in many parts of the Alps, where they periodically damage infrastructure, disrupt transportation corridors or even cause loss of life. Nonetheless, past torrential activity and the analysis of areas affected during particular events remain often imprecise. It was therefore the purpose of this study to reconstruct spatio-temporal patterns of past debris-flow activity in abandoned channels on the forested cone of the Manival torrent (Massif de la Chartreuse, French Prealps). A Light Detecting and Ranging (LiDAR) generated Digital Elevation Model (DEM) was used to identify five abandoned channels and related depositional forms (lobes, lateral levees) in the proximal alluvial fan of the torrent. A total of 156 Scots pine trees (Pinus sylvestris L.) with clear signs of debris flow events was analyzed and growth disturbances (GD) assessed, such as callus tissue, the onset of compression wood or abrupt growth suppression. In total, 375 GD were identified in the tree-ring samples, pointing to 13 debris-flow events for the period 1931–2008. While debris flows appear to be very common at Manival, they have only rarely propagated outside the main channel over the past 80 years. Furthermore, analysis of the spatial distribution of disturbed trees contributed to the identification of four patterns of debris-flow routing and led to the determination of three preferential breakout locations. Finally, the results of this study demonstrate that the temporal distribution of debris flows did not exhibit significant variations since the beginning of the 20th century.

Alteration of the pulmonary surfactant system in full-term infants with hereditary ABCA3 deficiency

RATIONALE: ABCA3 mutations are known to cause fatal surfactant deficiency. OBJECTIVE: We studied ABCA3 protein expression in full-term newborns with unexplained respiratory distress syndrome (URDS) as well as the relevance of ABCA3 mutations for surfactant homeostasis. METHODS: Lung tissue of infants with URDS was analyzed for the expression of ABCA3 in type II pneumocytes. Coding exons of the ABCA3 gene were sequenced. Surfactant protein expression was studied by immunohistochemistry, immunoelectron microscopy, and Western blotting. RESULTS: ABCA3 protein expression was found to be greatly reduced or absent in 10 of 14 infants with URDS. Direct sequencing revealed distinct ABCA3 mutations clustering within vulnerable domains of the ABCA3 protein. A strong expression of precursors of surfactant protein B (pro-SP-B) but only low levels and aggregates of mature surfactant protein B (SP-B) within electron-dense bodies in type II pneumocytes were found. Within the matrix of electron-dense bodies, we detected precursors of SP-C (pro-SP-C) and cathepsin D. SP-A was localized in small intracellular vesicles, but not in electron-dense bodies. SP-A and pro-SP-B were shown to accumulate in the intraalveolar space, whereas mature SP-B and SP-C were reduced or absent, respectively. CONCLUSION: Our data provide evidence that ABCA3 mutations are associated not only with a deficiency of ABCA3 but also with an abnormal processing and routing of SP-B and SP-C, leading to severe alterations of surfactant homeostasis and respiratory distress syndrome. To identify infants with hereditary ABCA3 deficiency, we suggest a combined diagnostic approach including immunohistochemical, ultrastructural, and mutation analysis.

Multi-antenna non-line-of-sight identification techniques for target localization in mobile ad-hoc networks

Target localization has a wide range of military and civilian applications in wireless mobile networks. Examples include battle-field surveillance, emergency 911 (E911), traffc alert, habitat monitoring, resource allocation, routing, and disaster mitigation. Basic localization techniques include time-of-arrival (TOA), direction-of-arrival (DOA) and received-signal strength (RSS) estimation. Techniques that are proposed based on TOA and DOA are very sensitive to the availability of Line-of-sight (LOS) which is the direct path between the transmitter and the receiver. If LOS is not available, TOA and DOA estimation errors create a large localization error. In order to reduce NLOS localization error, NLOS identifcation, mitigation, and localization techniques have been proposed. This research investigates NLOS identifcation for multiple antennas radio systems. The techniques proposed in the literature mainly use one antenna element to enable NLOS identifcation. When a single antenna is utilized, limited features of the wireless channel can be exploited to identify NLOS situations. However, in DOA-based wireless localization systems, multiple antenna elements are available. In addition, multiple antenna technology has been adopted in many widely used wireless systems such as wireless LAN 802.11n and WiMAX 802.16e which are good candidates for localization based services. In this work, the potential of spatial channel information for high performance NLOS identifcation is investigated. Considering narrowband multiple antenna wireless systems, two xvNLOS identifcation techniques are proposed. Here, the implementation of spatial correlation of channel coeffcients across antenna elements as a metric for NLOS identifcation is proposed. In order to obtain the spatial correlation, a new multi-input multi-output (MIMO) channel model based on rough surface theory is proposed. This model can be used to compute the spatial correlation between the antenna pair separated by any distance. In addition, a new NLOS identifcation technique that exploits the statistics of phase difference across two antenna elements is proposed. This technique assumes the phases received across two antenna elements are uncorrelated. This assumption is validated based on the well-known circular and elliptic scattering models. Next, it is proved that the channel Rician K-factor is a function of the phase difference variance. Exploiting Rician K-factor, techniques to identify NLOS scenarios are proposed. Considering wideband multiple antenna wireless systems which use MIMO-orthogonal frequency division multiplexing (OFDM) signaling, space-time-frequency channel correlation is exploited to attain NLOS identifcation in time-varying, frequency-selective and spaceselective radio channels. Novel NLOS identi?cation measures based on space, time and frequency channel correlation are proposed and their performances are evaluated. These measures represent a better NLOS identifcation performance compared to those that only use space, time or frequency.