Localization in underground tunnels

Positioning technologies are becoming ubiquitous and are being used more and more frequently for supporting a large variety of applica- tions. For outdoor applications, global navigation satellite systems (GNSSs), such as the global positioning system (GPS), are the most common and popular choice because of their wide coverage. GPS is also augmented with network-based systems that exploit existing wireless and mobile networks for providing positioning functions where GPS is not available or to save energy in battery-powered devices. Indoors, GNSSs are not a viable solution, but many applications require very accurate, fast, and exible positioning, tracking, and navigation functions. These and other requirements have stim- ulated research activities, in both industry and academia, where a variety of fundamental principles, techniques, and sensors are being integrated to provide positioning functions to many applications. The large majority of positioning technologies is for indoor environments, and most of the existing commercial products have been developed for use in of ce buildings, airports, shopping malls, factory plants, and similar spaces. There are, however, other spaces where positioning, tracking, and navigation systems play a central role in safety and in rescue operations, as well as in supporting speci c activities or for scienti c research activities in other elds. Among those spaces are underground tunnels, mines, and even underwater wells and caves. This chapter describes the research efforts over the past few years that have been put into the development of positioning systems for underground tun- nels, with particular emphasis in the case of the Large Hadron Collider (LHC) at CERN (the European Organization for Nuclear Research), where localiza- tion aims at enabling more automatic and unmanned radiation surveys. Examples of positioning and localization systems that have been devel- oped in the past few years for underground facilities are presented in the fol- lowing section, together with a brief characterization of those spaces’ special conditions and the requirements of some of the most common applications. Section 5.2 provides a short overview of some of the most representative research efforts that are currently being carried out by many research teams around the world. In addition, some of the fundamental principles and tech- niques are identi ed, such as the use of leaky coaxial cables, as used at the LHC. In Section 5.3, we introduce the speci c environment of the LHC and de ne the positioning requirements for the envisaged application. This is followed by a detailed description of our approach and the results that have been achieved so far. Some last comments and remarks are presented in a nal section.

Development of procedures for the design, optimization and manufacturing of customized orthopaedic and trauma implants: Geometrical/anatomical modelling from 3D medical imaging

Tese de Doutoramento (Programa Doutoral em Engenharia Biomédica)

A survey of distributed data aggregation algorithms

Distributed data aggregation is an important task, allowing the de- centralized determination of meaningful global properties, that can then be used to direct the execution of other applications. The resulting val- ues result from the distributed computation of functions like count, sum and average. Some application examples can found to determine the network size, total storage capacity, average load, majorities and many others. In the last decade, many di erent approaches have been pro- posed, with di erent trade-o s in terms of accuracy, reliability, message and time complexity. Due to the considerable amount and variety of ag- gregation algorithms, it can be di cult and time consuming to determine which techniques will be more appropriate to use in speci c settings, jus- tifying the existence of a survey to aid in this task. This work reviews the state of the art on distributed data aggregation algorithms, providing three main contributions. First, it formally de nes the concept of aggrega- tion, characterizing the di erent types of aggregation functions. Second, it succinctly describes the main aggregation techniques, organizing them in a taxonomy. Finally, it provides some guidelines toward the selection and use of the most relevant techniques, summarizing their principal characteristics.

Towards the design and implementation of aspect-oriented programming for spreadsheets

A spreadsheet usually starts as a simple and singleuser software artifact, but, as frequent as in other software systems, quickly evolves into a complex system developed by many actors. Often, different users work on different aspects of the same spreadsheet: while a secretary may be only involved in adding plain data to the spreadsheet, an accountant may define new business rules, while an engineer may need to adapt the spreadsheet content so it can be used by other software systems.Unfortunately,spreadsheetsystemsdonotoffermodular mechanisms, and as a consequence, some of the previous tasks may be defined by adding intrusive “code” to the spreadsheet. In this paper we go through the design and implementation of an aspect-oriented language for spreadsheets so that users can work on different aspects of a spreadsheet in a modular way. For example, aspects can be defined in order to introduce new business rules to an existing spreadsheet, or to manipulate the spreadsheet data to be ported to another system. Aspects are defined as aspect-oriented program specifications that are dynamically woven into the underlying spreadsheet by an aspect weaver. In this aspect-oriented style of spreadsheet development, differentusers develop,orreuse,aspects withoutaddingintrusive code to the original spreadsheet. Such code is added/executed by the spreadsheet weaving mechanism proposed in this paper.

BiYacc: Roll your parser and reflective printer into one

In: A. Cunha, E. Kindler (eds.): Proceedings of the Fourth International Workshop on Bidirectional Transformations (Bx 2015), L’Aquila, Italy, July 24, 2015, published at http://ceur-ws.org

Feature Nets: behavioural modelling of software product lines

Software product lines (SPL) are diverse systems that are developed using a dual engineering process: (a)family engineering defines the commonality and variability among all members of the SPL, and (b) application engineering derives specific products based on the common foundation combined with a variable selection of features. The number of derivable products in an SPL can thus be exponential in the number of features. This inherent complexity poses two main challenges when it comes to modelling: Firstly, the formalism used for modelling SPLs needs to be modular and scalable. Secondly, it should ensure that all products behave correctly by providing the ability to analyse and verify complex models efficiently. In this paper we propose to integrate an established modelling formalism (Petri nets) with the domain of software product line engineering. To this end we extend Petri nets to Feature Nets. While Petri nets provide a framework for formally modelling and verifying single software systems, Feature Nets offer the same sort of benefits for software product lines. We show how SPLs can be modelled in an incremental, modular fashion using Feature Nets, provide a Feature Nets variant that supports modelling dynamic SPLs, and propose an analysis method for SPL modelled as Feature Nets. By facilitating the construction of a single model that includes the various behaviours exhibited by the products in an SPL, we make a significant step towards efficient and practical quality assurance methods for software product lines.

Towards an engine for coordination-based architectural reconfigurations

Software reconfigurability became increasingly relevant to the architectural process due to the crescent dependency of modern societies on reliable and adaptable systems. Such systems are supposed to adapt themselves to surrounding environmental changes with minimal service disruption, if any. This paper introduces an engine that statically applies reconfigurations to (formal) models of software architectures. Reconfigurations are specified using a domain specific language— ReCooPLa—which targets the manipulation of software coordinationstructures,typicallyusedinservice-orientedarchitectures(soa).Theengine is responsible for the compilation of ReCooPLa instances and their application to the relevant coordination structures. The resulting configurations are amenable to formal analysis of qualitative and quantitative (probabilistic) properties.

ADSNARK: Nearly practical and privacy-preserving proofs on authenticated data

We study the problem of privacy-preserving proofs on authenticated data, where a party receives data from a trusted source and is requested to prove computations over the data to third parties in a correct and private way, i.e., the third party learns no information on the data but is still assured that the claimed proof is valid. Our work particularly focuses on the challenging requirement that the third party should be able to verify the validity with respect to the specific data authenticated by the source — even without having access to that source. This problem is motivated by various scenarios emerging from several application areas such as wearable computing, smart metering, or general business-to-business interactions. Furthermore, these applications also demand any meaningful solution to satisfy additional properties related to usability and scalability. In this paper, we formalize the above three-party model, discuss concrete application scenarios, and then we design, build, and evaluate ADSNARK, a nearly practical system for proving arbitrary computations over authenticated data in a privacy-preserving manner. ADSNARK improves significantly over state-of-the-art solutions for this model. For instance, compared to corresponding solutions based on Pinocchio (Oakland’13), ADSNARK achieves up to 25× improvement in proof-computation time and a 20× reduction in prover storage space.

Exploring scenario exploration

Model finders are very popular for exploring scenarios, helping users validate specifications by navigating through conforming model instances. To be practical, the semantics of such scenario exploration operations should be formally defined and, ideally, controlled by the users, so that they are able to quickly reach interesting scenarios. This paper explores the landscape of scenario exploration operations, by formalizing them with a relational model finder. Several scenario exploration operations provided by existing tools are formalized, and new ones are proposed, namely to allow the user to easily explore very similar (or different) scenarios, by attaching preferences to model elements. As a proof-of-concept, such operations were implemented in the popular Alloy Analyzer, further increasing its usefulness for (user-guided) scenario exploration.

Metaphorisms in programming

This paper introduces the metaphorism pattern of relational specification and addresses how specification following this pattern can be refined into recursive programs. Metaphorisms express input-output relationships which preserve relevant information while at the same time some intended optimization takes place. Text processing, sorting, representation changers, etc., are examples of metaphorisms. The kind of metaphorism refinement proposed in this paper is a strategy known as change of virtual data structure. It gives sufficient conditions for such implementations to be calculated using relation algebra and illustrates the strategy with the derivation of quicksort as example.

Preoperative staging of rectal cancer with MRI: correlation with pathologic staging

[INTRODUCTION] An accurate preoperative rectal cancer staging is crucial to the correct management of the disease. Despite great controversy around this issue, pelvic magnetic resonance (RM) is said to be the imagiologic standard modality. This work aimed to evaluate magnetic resonance accuracy in preoperative rectal cancer staging comparing with the anatomopathological results. METHODS We calculated sensibility, specificity, positive (VP positive) and negative (VP negative) predictive values for each T and N. We evaluated the concordance between both methods of staging using the Cohen weighted K (Kw), and through ROC curves, we evaluated magnetic resonance accuracy in rectal cancer staging. RESULTS 41 patients met the inclusion criteria. We achieved an efficacy of 43.9% for T and 61% for N staging. The respective sensibility, specificity, positive and negative predictive values are 33.3%, 94.7%, 33.3% and 94.7% for T1; 62.5%, 32%, 37.0% and 57.1% for T2; 31.8%, 79%, 63.6% and 50% for T3 and 27.8%, 87%, 62.5% and 60.6% for N. We obtained a poor concordance for T and N staging and the anatomopathological results. The ROC curves indicated that magnetic resonance is ineffective in rectal cancer staging. CONCLUSION Magnetic resonance has a moderate efficacy in rectal cancer staging and the major difficulty is in differentiating T2 and T3.

Chondrogenic potential of injectable κ-carrageenan hydrogel with encapsulated adipose stem cells for cartilage tissue-engineering applications

Due to the limited self-repair capacity of cartilage, regenerative medicine therapies for the treatment of cartilage defects must use a significant amount of cells, preferably applied using a hydrogel system that can promise their delivery and functionality at the specific site. This paper discusses the potential use of k-carrageenan hydrogels for the delivery of stem cells obt ained from adipose tissue in the treatment of cartilage tissue defects. The developed hydrogels were produced by an ionotropic gelation met hod and human adipose stem cells (hASCs) were encapsulated in 1.5% w/v k-carrageenan solution at a cell density of 5  10 6 cells/ml. The results from the analysis of the cell-encapsulating hydrogels, cultured for up to 21 days, indicated that k-carrageenan hydrogels support the viability, proliferation and chondrogenic differentiation of hASCs. Additionally, the mec hanical analysis demonstrated an increase in stiffness and viscoelastic properties of k-carrageenan gels with their encapsulated cells with increasing time in culture with chondrogenic medium. These results allowed the conclusion that k-carrageenan exhibits properties t hat enable the in vitro functionality of encapsulated hASCs and thus may provide the basis for new successful approaches for the treatment of cartilage defects.

Plataforma de apoio à decisão nos cuidados de ginecologia e obstetrícia

Dissertação de mestrado integrado em Engenharia Biomédica (área de especialização em Informática Médica)

SOFHIA: a CAD environment to design digital control systems

"Series Title: IFIP - The International Federation for Information Processing, ISSN 1868-4238"

An evolutionary approach to the use of Petri net based models: from parallel controllers to HW/SW co-design

"A workshop within the 19th International Conference on Applications and Theory of Petri Nets - ICATPN’1998"