KDD, SEMMA and CRISP-DM: a parallel overview

In the last years there has been a huge growth and consolidation of the Data Mining field. Some efforts are being done that seek the establishment of standards in the area. Included on these efforts there can be enumerated SEMMA and CRISP-DM. Both grow as industrial standards and define a set of sequential steps that pretends to guide the implementation of data mining applications. The question of the existence of substantial differences between them and the traditional KDD process arose. In this paper, is pretended to establish a parallel between these and the KDD process as well as an understanding of the similarities between them.

Caracterização do papel da adrenalina na maturação dos adrenorreceptores B2

As respostas pós-juncionais mediadas por adrenorreceptores β2 (ARβ2), responsáveis pelo relaxamento do músculo liso, na veia safena do cão, estão ausentes à nascença. Pelo contrário, no rato recém-nascido já se verifica a estimulação da adenilil ciclase pela activação dos ARβ2. Não existem ainda estudos no coelho recém-nascido. O principal objectivo deste trabalho é avaliar as respostas pós-juncionais mediadas pelos ARβ2 em coelhos recém-nascidos e jovens e relacionar essas respostas com a adrenalina produzida nas glândulas supra-renais. Traçaram-se curvas de dose-resposta à isoprenalina (agonista β) utilizando-se anéis de aorta montados em banho de órgãos isolados ligado a um transdutor de força isométrica. As catecolaminas das supra-renais foram quantificadas por RP-HPLC-ED. Em aortas pré-contraídas com fenilefrina (agonista α1), a isoprenalina causou relaxamento total apenas em coelhos recém-nascidos (n=10). O relaxamento máximo nos coelhos jovens foi de 21±4% (n=23). A potência da isoprenalina foi maior nos recém-nascidos (EC50=1.15×10-8±7.2×10-10 M, n=10) do que nos coelhos jovens (EC50=1.29×10-7 ±4.7×10-9 M, n=23). O relaxamento máximo com isoprenalina, em aortas pré-contraídas com prostaglandina F2α (PGF2α), no grupo de coelhos recém-nascidos foi de 95±3.6% (n=16). O relaxamento máximo nos coelhos jovens foi de 43.7±8.6% (n=9). Na pré-contracção com PGF2α a potência da isoprenalina registou-se maior nos recémnascidos (EC50=9.59×10-9±4.0×10-10 M, n=16) do que nos coelhos jovens (EC50=2.13×10- 8±3.8×10-9 M, n=9), estando concordante com os resultados da pré-contracção com fenilefrina. Nas supra-renais dos recém-nascidos, o conteúdo de noradrenalina foi de 586±128 nmol/mg e da adrenalina foi de 1915±356 nmol/mg (n=4) e nos coelhos jovens foi de 112±12 nmol/mg e de 3644±403 nmol/mg (n=6), respectivamente. As respostas mediadas por ARβ2 no coelho desenvolvem-se mais cedo do que no cão, pois já estão presentes no nascimento. Tal como no rato, no coelho a adrenalina é já a catecolamina em maior quantidade à nascença, enquanto no cão é vestigial. Há uma relação temporal entre a síntese da adrenalina, a única catecolamina biogénica com alta afinidade para os ARβ2 e a maturação das respostas pós-juncionais mediadas por esses receptores. Um protocolo para experiências futuras destinadas a testar esta hipótese, com base no knockdown da Feniletanolamina-N-metiltransferase por RNAi foi elaborado e incluído neste documento.

Interpretation of gravity data to delineate structural features connected to low-temperature geothermal resources at Northeastern Portugal

A great number of low-temperature geothermal fields occur in Northern-Portugal related to fractured rocks. The most important superficial manifestations of these hydrothermal systems appear in pull-apart tectonic basins and are strongly conditioned by the orientation of the main fault systems in the region. This work presents the interpretation of gravity gradient maps and 3D inversion model produced from a regional gravity survey. The horizontal gradients reveal a complex fault system. The obtained 3D model of density contrast puts into evidence the main fault zone in the region and the depth distribution of the granitic bodies. Their relationship with the hydrothermal systems supports the conceptual models elaborated from hydrochemical and isotopic water analyses. This work emphasizes the importance of the role of the gravity method and analysis to better understand the connection between hydrothermal systems and the fractured rock pattern and surrounding geology. (c) 2013 Elsevier B.V. All rights reserved.

Avaliação de qualidade de energia de um sistema fotovoltaico numa rede elétrica

Dissertação para obtenção do grau de Mestre em Engenharia Electrotécnica Ramo de Energia

Parallel implementation of vertex component analysis for hyperspectral endmember extraction

International Conference with Peer Review 2012 IEEE International Conference in Geoscience and Remote Sensing Symposium (IGARSS), 22-27 July 2012, Munich, Germany

Real-time scheduling of parallel tasks in the Linux Kernel

This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines the global EDF scheduler with a priority-aware work-stealing load balancing scheme, enabling parallel real-time tasks to be executed on more than one processor at a given time instant. We state that some priority inversion may actually be acceptable, provided it helps reduce contention, communication, synchronisation and coordination between parallel threads, while still guaranteeing the expected system’s predictability. Experimental results demonstrate the low scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Supporting real-time parallel task models with work-stealing

Dynamic parallel scheduling using work-stealing has gained popularity in academia and industry for its good performance, ease of implementation and theoretical bounds on space and time. Cores treat their own double-ended queues (deques) as a stack, pushing and popping threads from the bottom, but treat the deque of another randomly selected busy core as a queue, stealing threads only from the top, whenever they are idle. However, this standard approach cannot be directly applied to real-time systems, where the importance of parallelising tasks is increasing due to the limitations of multiprocessor scheduling theory regarding parallelism. Using one deque per core is obviously a source of priority inversion since high priority tasks may eventually be enqueued after lower priority tasks, possibly leading to deadline misses as in this case the lower priority tasks are the candidates when a stealing operation occurs. Our proposal is to replace the single non-priority deque of work-stealing with ordered per-processor priority deques of ready threads. The scheduling algorithm starts with a single deque per-core, but unlike traditional work-stealing, the total number of deques in the system may now exceed the number of processors. Instead of stealing randomly, cores steal from the highest priority deque.

Parallel real-time support for distributed adaptive embedded applications

Real-time embedded applications require to process large amounts of data within small time windows. Parallelize and distribute workloads adaptively is suitable solution for computational demanding applications. The purpose of the Parallel Real-Time Framework for distributed adaptive embedded systems is to guarantee local and distributed processing of real-time applications. This work identifies some promising research directions for parallel/distributed real-time embedded applications.

A framework for the development of parallel and distributed real-time embedded systems

Embedded real-time applications increasingly present high computation requirements, which need to be completed within specific deadlines, but that present highly variable patterns, depending on the set of data available in a determined instant. The current trend to provide parallel processing in the embedded domain allows providing higher processing power; however, it does not address the variability in the processing pattern. Dimensioning each device for its worst-case scenario implies lower average utilization, and increased available, but unusable, processing in the overall system. A solution for this problem is to extend the parallel execution of the applications, allowing networked nodes to distribute the workload, on peak situations, to neighbour nodes. In this context, this report proposes a framework to develop parallel and distributed real-time embedded applications, transparently using OpenMP and Message Passing Interface (MPI), within a programming model based on OpenMP. The technical report also devises an integrated timing model, which enables the structured reasoning on the timing behaviour of these hybrid architectures.

Dynamic global scheduling of parallel real-time tasks

High-level parallel languages offer a simple way for application programmers to specify parallelism in a form that easily scales with problem size, leaving the scheduling of the tasks onto processors to be performed at runtime. Therefore, if the underlying system cannot efficiently execute those applications on the available cores, the benefits will be lost. In this paper, we consider how to schedule highly heterogenous parallel applications that require real-time performance guarantees on multicore processors. The paper proposes a novel scheduling approach that combines the global Earliest Deadline First (EDF) scheduler with a priority-aware work-stealing load balancing scheme, which enables parallel realtime tasks to be executed on more than one processor at a given time instant. Experimental results demonstrate the better scalability and lower scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Server-based scheduling of parallel real-time tasks

Multicore platforms have transformed parallelism into a main concern. Parallel programming models are being put forward to provide a better approach for application programmers to expose the opportunities for parallelism by pointing out potentially parallel regions within tasks, leaving the actual and dynamic scheduling of these regions onto processors to be performed at runtime, exploiting the maximum amount of parallelism. It is in this context that this paper proposes a scheduling approach that combines the constant-bandwidth server abstraction with a priority-aware work-stealing load balancing scheme which, while ensuring isolation among tasks, enables parallel tasks to be executed on more than one processor at a given time instant.

Software transactional memory as a building block for parallel embedded realtime systems

The recent trends of chip architectures with higher number of heterogeneous cores, and non-uniform memory/non-coherent caches, brings renewed attention to the use of Software Transactional Memory (STM) as a fundamental building block for developing parallel applications. Nevertheless, although STM promises to ease concurrent and parallel software development, it relies on the possibility of aborting conflicting transactions to maintain data consistency, which impacts on the responsiveness and timing guarantees required by embedded real-time systems. In these systems, contention delays must be (efficiently) limited so that the response times of tasks executing transactions are upper-bounded and task sets can be feasibly scheduled. In this paper we assess the use of STM in the development of embedded real-time software, defending that the amount of contention can be reduced if read-only transactions access recent consistent data snapshots, progressing in a wait-free manner. We show how the required number of versions of a shared object can be calculated for a set of tasks. We also outline an algorithm to manage conflicts between update transactions that prevents starvation.

A parallel programming model for ada

Over the last three decades, computer architects have been able to achieve an increase in performance for single processors by, e.g., increasing clock speed, introducing cache memories and using instruction level parallelism. However, because of power consumption and heat dissipation constraints, this trend is going to cease. In recent times, hardware engineers have instead moved to new chip architectures with multiple processor cores on a single chip. With multi-core processors, applications can complete more total work than with one core alone. To take advantage of multi-core processors, parallel programming models are proposed as promising solutions for more effectively using multi-core processors. This paper discusses some of the existent models and frameworks for parallel programming, leading to outline a draft parallel programming model for Ada.

Le Crétacé inférieur de la marge atlantique portugaise: biostratigraphie, organization séquentielle, evolution paléogéographique

This paper gives a short description of main stratigraphic unities from the early Cretaceous in Estremadura and Algarve, with their lithological, sedimentological and paleontological characteristics. The distribution of facies enable to propose a paleogeographic frame including eroded high areas and sedimentary low areas roughly parallel to the present coast. The early Cretaceous from Estremadura is splited up into three megasequences each one with regressive then transgressive tendencies: this fact must be connected with the leading action of distensive, slow or sudden, movements. Beyond the hercynian fault of Messejana, Algarve presents a different sedimentary evolution during the early Cretaceous.

Parallel hyperspectral unmixing on GPUs

This letter presents a new parallel method for hyperspectral unmixing composed by the efficient combination of two popular methods: vertex component analysis (VCA) and sparse unmixing by variable splitting and augmented Lagrangian (SUNSAL). First, VCA extracts the endmember signatures, and then, SUNSAL is used to estimate the abundance fractions. Both techniques are highly parallelizable, which significantly reduces the computing time. A design for the commodity graphics processing units of the two methods is presented and evaluated. Experimental results obtained for simulated and real hyperspectral data sets reveal speedups up to 100 times, which grants real-time response required by many remotely sensed hyperspectral applications.