From medical librarian to informacionist: semantic traces of their profiles and areas of performance

This literature review retakes the discussion of the profiles and competences of the information area professional, specifically, in the health field. Therefore, the aim here is to outline the new fields of performance for the informationist and the profiles required in the health context.

Incidence, morphology and morphometry of the foramen of Vesalius: complementary study for a safer planning and execution of the trigeminal rhizotomy technique

The foramen of Vesalius (FV) is located in the greater wing of the sphenoid bone between the foramen ovale (FO) and the foramen rotundum in an intracranial view. The FO allows the passage of the mandibular branch of trigeminal nerve, which is the target of the trigeminal radiofrequency rhizotomy. We analyzed its location, morphology, morphometry and interrelation among other foramina. 400 macerated adult human skulls were examined. A digital microscope (Dino-Lite plus(A (R))) was used to capture images from the FV. A digital caliper was used to perform the measurements of the distance between the FV and other foramina (FO, foramen spinosum and the carotid canal) in an extracranial view of the skull base. In the 400 analyzed skulls, the FV was identified in 135 skulls (33.75%) and absent on both sides in 265 skulls (66.25%). The FV was observed present bilaterally in 15.5% of the skulls. The incidence of unilateral foramen was 18.25% of the skulls of which 7.75% on right side and 10.5% on left side. The diameter of the FV was measured and we found an average value of 0.65 mm, on right side 0.63 mm and on the left side 0.67 mm. We verified that positive correlations were statistically significant among the three analyzed distances. This study intends to offer specific anatomical data with morphological patterns (macroscopic and mesoscopic) to increase the understanding of the FV features as frequency, incidence and important distances among adjacent foramina.

IOPT Petri Net State Space Generation Algorithm with Maximal-Step Execution Semantics

This paper presents an algorithm to efficiently generate the state-space of systems specified using the IOPT Petri-net modeling formalism. IOPT nets are a non-autonomous Petri-net class, based on Place-Transition nets with an extended set of features designed to allow the rapid prototyping and synthesis of system controllers through an existing hardware-software co-design framework. To obtain coherent and deterministic operation, IOPT nets use a maximal-step execution semantics where, in a single execution step, all enabled transitions will fire simultaneously. This fact increases the resulting state-space complexity and can cause an arc "explosion" effect. Real-world applications, with several million states, will reach a higher order of magnitude number of arcs, leading to the need for high performance state-space generator algorithms. The proposed algorithm applies a compilation approach to read a PNML file containing one IOPT model and automatically generate an optimized C program to calculate the corresponding state-space.

Distributed process execution in collaborative networks

Processes are a central entity in enterprise collaboration. Collaborative processes need to be executed and coordinated in a distributed Computational platform where computers are connected through heterogeneous networks and systems. Life cycle management of such collaborative processes requires a framework able to handle their diversity based on different computational and communication requirements. This paper proposes a rational for such framework, points out key requirements and proposes it strategy for a supporting technological infrastructure. Beyond the portability of collaborative process definitions among different technological bindings, a framework to handle different life cycle phases of those definitions is presented and discussed. (c) 2007 Elsevier Ltd. All rights reserved.

Finding an upper bound on the increase in execution time due to contention on the memory bus in COTS-based multicore systems

Contention on the memory bus in COTS based multicore systems is becoming a major determining factor of the execution time of a task. Analyzing this extra execution time is non-trivial because (i) bus arbitration protocols in such systems are often undocumented and (ii) the times when the memory bus is requested to be used are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. We present a method for finding an upper bound on the extra execution time of a task due to contention on the memory bus in COTS based multicore systems. This method makes no assumptions on the bus arbitration protocol (other than assuming that it is work-conserving).

The Gap Between Knowledge and Action: Obstacles, Restraints and Deficits During the Execution of Refurbishments

This article outlines the initial draft of a PhD project which investigates refurbishment or rehabilitation projects in two German cities. The study focuses on obstacles, restraints and deficits as well as factors of success, which can be identified during the execution of the refurbishments. Moreover the study examines the process of the refurbishment itself, the general conditions under which the refurbishments are being executed as well as the implementation of sustainability criteria. First the article gives a short summary of the theoretical considerations of the study. In this respect it shortly outlines the global conditions of urban development and conducting challenges for cities in the 21st century, guiding principles of a sustainable urban development as well as goals of sustainable refurbishments. Finally the article shortly describes the case studies and presents the initial results of the empirical work.

Speculative execution by using software transactional memory

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Engenharia Informática.

Autonomic Activities in the Execution of Scientific Workflows: Evaluation of the AWARD Framework

Workflows have been successfully applied to express the decomposition of complex scientific applications. However the existing tools still lack adequate support to important aspects namely, decoupling the enactment engine from tasks specification, decentralizing the control of workflow activities allowing their tasks to run in distributed infrastructures, and supporting dynamic workflow reconfigurations. We present the AWARD (Autonomic Workflow Activities Reconfigurable and Dynamic) model of computation, based on Process Networks, where the workflow activities (AWA) are autonomic processes with independent control that can run in parallel on distributed infrastructures. Each AWA executes a task developed as a Java class with a generic interface allowing end-users to code their applications without low-level details. The data-driven coordination of AWA interactions is based on a shared tuple space that also enables dynamic workflow reconfiguration. For evaluation we describe experimental results of AWARD workflow executions in several application scenarios, mapped to the Amazon (Elastic Computing EC2) Cloud.

Part I : Comparing derivatization methods for amino acids – one and two-step procedures using gas chromatography – flame ion detector (GC-FID) Part II: Story of an icon from its execution until its conservation

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Conservação e Restauro

Petri net model decomposition - a model based approach supporting distributed execution

Dissertação apresentada para obtenção do Grau de Doutor em Engenharia Electrotécnica, Especialidade de Sistemas Digitais, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

The interrogation of witnesses abroad in execution of a european investigation order: an examination from eyes of the defence

European Master Human Rights and Democratisation

An Execution Model for Fine-Grained Parallelism in Ada

20th International Conference on Reliable Software Technologies - Ada-Europe 2015 (Ada-Europe 2015), 25 to 29, Jun, 2015. Madrid, Spain. Best Paper Award.