Preliminary results of a study of magnetic properties in the Foum-Zguid dyke (Morocco)

This work focuses on the study of flow and propagation of magma using rock magnetic analyses along sections across the thick Jurassic dyke of Foum-Zguid (Southern Morocco). Thermomagnetic data show that Ti-poor titanomagnetite is the main magnetic carrier. Petrographic analysis shows that the main Ti phase (ilmenite) occurs either as lamellae within spinel (center of the dyke) or as isolated grains (dyke margin). Bulk magnetic properties display distinct behavior according to the distance to the dyke margin; grain size of the main magnetic carrier decreases towards the center of the dyke, while the natural remanent magnetization and the bulk magnetic susceptibility increase. Only the magnetic susceptibility ellipsoid close to the dyke margin corresponds to that usually found in thin dykes, with the magnetic foliation sub parallel to dyke margins. Maximum principal axis is in most cases either parallel or perpendicular to the intersection between the planes of magnetic foliation and dyke wall. Moreover, when this axis is perpendicular to the intersection it is associated with a more oblate magnetic susceptibility ellipsoid shape, indicating the presence of complex magnetic fabrics. The studied magnetic properties show that, in this 100 m wide thick dyke, flow structures related with dyke propagation are only preserved close to the quickly cooled dyke margins.

Synthesis of optimization of [11C] Pittsburgh compound B by the captive solvent method

Mestrado em Medicina Nuclear.

Optimal methodology for distribution systems reconfiguration based on OPF and solved by decomposition technique

This paper presents a new and efficient methodology for distribution network reconfiguration integrated with optimal power flow (OPF) based on a Benders decomposition approach. The objective minimizes power losses, balancing load among feeders and subject to constraints: capacity limit of branches, minimum and maximum power limits of substations or distributed generators, minimum deviation of bus voltages and radial optimal operation of networks. The Generalized Benders decomposition algorithm is applied to solve the problem. The formulation can be embedded under two stages; the first one is the Master problem and is formulated as a mixed integer non-linear programming problem. This stage determines the radial topology of the distribution network. The second stage is the Slave problem and is formulated as a non-linear programming problem. This stage is used to determine the feasibility of the Master problem solution by means of an OPF and provides information to formulate the linear Benders cuts that connect both problems. The model is programmed in GAMS. The effectiveness of the proposal is demonstrated through two examples extracted from the literature.

Branching points in the low-temperature dipolar hard sphere fluid

In this contribution, we investigate the low-temperature, low-density behaviour of dipolar hard-sphere (DHS) particles, i.e., hard spheres with dipoles embedded in their centre. We aim at describing the DHS fluid in terms of a network of chains and rings (the fundamental clusters) held together by branching points (defects) of different nature. We first introduce a systematic way of classifying inter-cluster connections according to their topology, and then employ this classification to analyse the geometric and thermodynamic properties of each class of defects, as extracted from state-of-the-art equilibrium Monte Carlo simulations. By computing the average density and energetic cost of each defect class, we find that the relevant contribution to inter-cluster interactions is indeed provided by (rare) three-way junctions and by four-way junctions arising from parallel or anti-parallel locally linear aggregates. All other (numerous) defects are either intra-cluster or associated to low cluster-cluster interaction energies, suggesting that these defects do not play a significant part in the thermodynamic description of the self-assembly processes of dipolar hard spheres. (C) 2013 AIP Publishing LLC.

Suporte à computação paralela e distribuída em Java: API e comunicação entre nós cooperantes

Este trabalho é uma parte do tema global “Suporte à Computação Paralela e Distribuída em Java”, também tema da tese de Daniel Barciela no mestrado de Engenharia Informática do Instituto Superior de Engenharia do Porto. O seu objetivo principal consiste na definição/criação da interface com o programador, assim como também abrange a forma como os nós comunicam e cooperam entre si para a execução de determinadas tarefas, de modo a atingirem um único objetivo global. No âmbito desta dissertação foi realizado um estudo prévio relativamente aos modelos teóricos referentes à computação paralela, assim como também foram analisadas linguagens e frameworks que fornecem suporte a este mesmo tipo de computação. Este estudo teve como principal objetivo a análise da forma como estes modelos e linguagens permitem ao programador expressar o processamento paralelo no desenvolvimento das aplicações. Como resultado desta dissertação surgiu a framework denominada Distributed Parallel Framework for Java (DPF4j), cujo objetivo principal é fornecer aos programadores o suporte para o desenvolvimento de aplicações paralelas e distribuídas. Esta framework foi desenvolvida na linguagem Java. Esta dissertação contempla a parte referente à interface de programação e a toda a comunicação entre nós cooperantes da framework DPF4j. Por fim, foi demonstrado através dos testes realizados que a DPF4j, apesar de ser ainda um protótipo, já demonstra ter uma performance superior a outras frameworks e linguagens que possuem os mesmos objetivos.

Concurrent tabling

In the past few years Tabling has emerged as a powerful logic programming model. The integration of concurrent features into the implementation of Tabling systems is demanded by need to use recently developed tabling applications within distributed systems, where a process has to respond concurrently to several requests. The support for sharing of tables among the concurrent threads of a Tabling process is a desirable feature, to allow one of Tabling’s virtues, the re-use of computations by other threads and to allow efficient usage of available memory. However, the incremental completion of tables which are evaluated concurrently is not a trivial problem. In this dissertation we describe the integration of concurrency mechanisms, by the way of multi-threading, in a state of the art Tabling and Prolog system, XSB. We begin by reviewing the main concepts for a formal description of tabled computations, called SLG resolution and for the implementation of Tabling under the SLG-WAM, the abstract machine supported by XSB. We describe the different scheduling strategies provided by XSB and introduce some new properties of local scheduling, a scheduling strategy for SLG resolution. We proceed to describe our implementation work by describing the process of integrating multi-threading in a Prolog system supporting Tabling, without addressing the problem of shared tables. We describe the trade-offs and implementation decisions involved. We then describe an optimistic algorithm for the concurrent sharing of completed tables, Shared Completed Tables, which allows the sharing of tables without incurring in deadlocks, under local scheduling. This method relies on the execution properties of local scheduling and includes full support for negation. We provide a theoretical framework and discuss the implementation’s correctness and complexity. After that, we describe amethod for the sharing of tables among threads that allows parallelism in the computation of inter-dependent subgoals, which we name Concurrent Completion. We informally argue for the correctness of Concurrent Completion. We give detailed performance measurements of the multi-threaded XSB systems over a variety of machines and operating systems, for both the Shared Completed Tables and the Concurrent Completion implementations. We focus our measurements inthe overhead over the sequential engine and the scalability of the system. We finish with a comparison of XSB with other multi-threaded Prolog systems and we compare our approach to concurrent tabling with parallel and distributed methods for the evaluation of tabling. Finally, we identify future research directions.

Incremental filter and wrapper approaches for feature discretization

Discrete data representations are necessary, or at least convenient, in many machine learning problems. While feature selection (FS) techniques aim at finding relevant subsets of features, the goal of feature discretization (FD) is to find concise (quantized) data representations, adequate for the learning task at hand. In this paper, we propose two incremental methods for FD. The first method belongs to the filter family, in which the quality of the discretization is assessed by a (supervised or unsupervised) relevance criterion. The second method is a wrapper, where discretized features are assessed using a classifier. Both methods can be coupled with any static (unsupervised or supervised) discretization procedure and can be used to perform FS as pre-processing or post-processing stages. The proposed methods attain efficient representations suitable for binary and multi-class problems with different types of data, being competitive with existing methods. Moreover, using well-known FS methods with the features discretized by our techniques leads to better accuracy than with the features discretized by other methods or with the original features. (C) 2013 Elsevier B.V. All rights reserved.

Estudo da influência da carga específica na fragmentação de rocha granítica no desmonte em bancada

Mestrado em Engenharia Geotécnica e Geoambiente

Optimizing memory transactions for large-scale programs

Even though Software Transactional Memory (STM) is one of the most promising approaches to simplify concurrent programming, current STM implementations incur significant overheads that render them impractical for many real-sized programs. The key insight of this work is that we do not need to use the same costly barriers for all the memory managed by a real-sized application, if only a small fraction of the memory is under contention lightweight barriers may be used in this case. In this work, we propose a new solution based on an approach of adaptive object metadata (AOM) to promote the use of a fast path to access objects that are not under contention. We show that this approach is able to make the performance of an STM competitive with the best fine-grained lock-based approaches in some of the more challenging benchmarks. (C) 2015 Elsevier Inc. All rights reserved.

Earthquakes in western Iberia: improving the understanding of lithospheric deformation in a slowly deforming region

Mainland Portugal, on the southwestern edge of the European continent, is located directly north of the boundary between the Eurasian and Nubian plates. It lies in a region of slow lithospheric deformation (< 5 mm yr(-1)), which has generated some of the largest earthquakes in Europe, both intraplate (mainland) and interplate (offshore). Some offshore earthquakes are nucleated on old and cold lithospheric mantle, at depths down to 60 km. The seismicity of mainland Portugal and its adjacent offshore has been repeatedly classified as diffuse. In this paper, we analyse the instrumental earthquake catalogue for western Iberia, which covers the period between 1961 and 2013. Between 2010 and 2012, the catalogue was enriched with data from dense broad-band deployments. We show that although the plate boundary south of Portugal is diffuse, in that deformation is accommodated along several distributed faults rather than along one long linear plate boundary, the seismicity itself is not diffuse. Rather, when located using high-quality data, earthquakes collapse into well-defined clusters and lineations. We identify and characterize the most outstanding clusters and lineations of epicentres and correlate them with geophysical and tectonic features (historical seismicity, topography, geologically mapped faults, Moho depth, free-air gravity, magnetic anomalies and geotectonic units). Both onshore and offshore, clusters and lineations of earthquakes are aligned preferentially NNE-SSW and WNW-ESE. Cumulative seismic moment and epicentre density decrease from south to north, with increasing distance from the plate boundary. Only few earthquake lineations coincide with geologically mapped faults. Clusters and lineations that do not match geologically mapped faults may correspond to previously unmapped faults (e.g. blind faults), rheological boundaries or distributed fracturing inside blocks that are more brittle and therefore break more easily than neighbour blocks. The seismicity map of western Iberia presented in this article opens important questions concerning the regional seismotectonics. This work shows that the study of low-magnitude earthquakes using dense seismic deployments is a powerful tool to study lithospheric deformation in slowly deforming regions, such as western Iberia, where high-magnitude earthquakes occur with long recurrence intervals.

A module for the XDense architecture in ns-3

Demo in Workshop on ns-3 (WNS3 2015). 13 to 14, May, 2015. Castelldefels, Spain.

Development of regional spatial data infrastructure (SDI) case study in hearth of Borneo

Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.

Escolhas sequenciais e simultâneas em humanos: processamento independente ou por competição?

Dissertação de mestrado integrado em Psicologia

Bacteriophage-encoded depolymerases: their diversity and biotechnological applications

Bacteriophages (phages), natural enemies of bacteria, can encode enzymes able to degrade polymeric substances. These substances can be found in the bacterial cell surface, such as polysaccharides, or are produced by bacteria when they are living in biofilm communities, the most common bacterial lifestyle. Consequently, phages with depolymerase activity have a facilitated access to the host receptors, by degrading the capsular polysaccharides, and are believed to have a better performance against bacterial biofilms, since the degradation of extracellular polymeric substances by depolymerases might facilitate the access of phages to the cells within different biofilm layers. Since the diversity of phage depolymerases is not yet fully explored, this is the first review gathering information about all the depolymerases encoded by fully sequenced phages. Overall, in this study, 160 putative depolymerases, including sialidases, levanases, xylosidases, dextranases, hyaluronidases, peptidases as well as pectate/pectin lyases, were found in 143 phages (43 Myoviridae, 47 Siphoviridae, 37 Podoviridae, and 16 unclassified) infecting 24 genera of bacteria. We further provide information about the main applications of phage depolymerases, which can comprise areas as diverse as medical, chemical, or food-processing industry.

Flow updating: fault-tolerant aggregation for dynamic networks

Documento submetido para revisão pelos pares. A publicar em Journal of Parallel and Distributed Computing. ISSN 0743-7315