Parallel Lattice Boltzmann Method with Blocked Partitioning

This paper presents and discusses a blocked parallel implementation of bi- and three-dimensional versions of the Lattice Boltzmann Method. This method is used to represent and simulate fluid flows following a mesoscopic approach. Most traditional parallel implementations use simple data distribution strategies to parallelize the operations on the regular fluid data set. However, it is well known that block partitioning is usually better. Such a parallel implementation is discussed and its communication cost is established. Fluid flows simulations crossing a cavity have also been used as a real-world case study to evaluate our implementation. The presented results with our blocked implementation achieve a performance up to 31% better than non-blocked versions, for some data distributions. Thus, this work shows that blocked, parallel implementations can be efficiently used to reduce the parallel execution time of the method.     

Model-based testing approaches selection for software projects

Selecting software technologies for software projects represents a challenge to software engineers. It is known that software projects differ from each other by presenting different characteristics that can complicate the selection of such technologies. This is not different when considering model-based testing. There are many approaches with different characteristics described in the technical literature that can be used in software projects. However, there is no indication as to how they can fit a software project. Therefore, a strategy to select model-based testing approaches for software projects called Porantim is fully described in this paper. Porantim is based on a body of knowledge describing model-based testing approaches and their characterization attributes (identified by secondary and primary experimental studies), and a process to guide by adequacy and impact criteria regarding the use of this sort of software technology that can be used by software engineers to select model-based testing approaches for software projects.     

Forecasting peak air pollution levels using NARX models

Air pollution has a negative impact on human health. For this reason, it is important to correctly forecast over-threshold events to give timely warnings to the population. Nonlinear models of the nonlinear autoregressive with exogenous variable (NARX) class have been extensively used to forecast air pollution time series, mainly using artificial neural networks (NNs) to model the nonlinearities. This work discusses the possible advantages of using polynomial NARX instead, in combination with suitable model structure selection methods. Furthermore, a suitably weighted mean square error (MSE) (one-step-ahead prediction) cost function is used in the identification/learning process to enhance the model performance in peak estimation, which is the final purpose of this application. The proposed approach is applied to ground-level ozone concentration time series. An extended simulation analysis is provided to compare the two classes of models on a selected case study (Milan metropolitan area) and to investigate the effect of different weighting functions in the identification performance index. Results show that polynomial NARX are able to correctly reconstruct ozone concentrations, with performances similar to NN-based NARX models, but providing additional information, as, e.g., the best set of regressors to describe the studied phenomena. The simulation analysis also demonstrates the potential benefits of using the weighted cost function, especially in increasing the reliability in peak estimation.     

ITEA—interactive trajectories and events analysis: exploring sequences of spatio-temporal events in movement data

Widespread use of GPS and similar technologies makes it possible to collect extensive amounts of trajectory data. These data sets are essential for reasonable decision making in various application domains. Additional information, such as events taking place along a trajectory, makes data analysis challenging, due to data size and complexity. We present an integrated solution for interactive visual analysis and exploration of events along trajectories data. Our approach supports analysis of event sequences at three different levels of abstraction, namely spatial, temporal, and events themselves. Customized views as well as standard views are combined to form a coordinated multiple views system. In addition to trajectories and events, we include on-the-fly derived data in the analysis. We evaluate our integrated solution using the IEEE VAST 2015 Challenge data set. A successful detection and characterization of malicious activity indicate the usefulness and efficiency of the presented approach.     

Automatic selection of arterial input function on dynamic contrast-enhanced MR images

Dynamic susceptibility contrast-magnetic resonance imaging (DSC-MRI) data analysis requires the knowledge of the arterial input function (AIF) to quantify the cerebral blood flow (CBF), volume (CBV) and the mean transit time (MTT). AIF can be obtained either manually or using automatic algorithms. We present a method to derive the AIF on the middle cerebral artery (MCA). The algorithm draws a region of interest (ROI) where the MCA is located. Then, it uses a recursive cluster analysis on the ROI to select the arterial voxels. The algorithm had been compared on simulated data to literature state of art automatic algorithms and on clinical data to the manual procedure. On in silico data, our method allows to reconstruct the true AIF and it is less affected by partial volume effect bias than the other methods. In clinical data, automatic AIF provides CBF and MTT maps with a greater contrast level compared to manual AIF ones. Therefore, AIF obtained with the proposed method improves the estimate reliability and provides a quantitatively reliable physiological picture.     

Template-based quadrilateral mesh generation from imaging data

This paper describes a novel template-based meshing approach for generating good quality quadrilateral meshes from 2D digital images. This approach builds upon an existing image-based mesh generation technique called Imeshp, which enables us to create a segmented triangle mesh from an image without the need for an image segmentation step. Our approach generates a quadrilateral mesh using an indirect scheme, which converts the segmented triangle mesh created by the initial steps of the Imesh technique into a quadrilateral one. The triangle-to-quadrilateral conversion makes use of template meshes of triangles. To ensure good element quality, the conversion step is followed by a smoothing step, which is based on a new optimization-based procedure. We show several examples of meshes generated by our approach, and present a thorough experimental evaluation of the quality of the meshes given as examples.     

Molecular basis of agonicity and antagonicity in the androgen receptor studied by molecular dynamics simulations

Treatment of prostate cancer patients with antiandrogens is initially successful, though the therapy often becomes refractory over the time. This mechanism is not fully understood, but the presence of androgen receptor (AR) mutant forms which are activated by antiandrogens and other endogenous ligands, and overexpression of the receptor have been suggested. In an attempt to explain the molecular basis for agonicity and antagonicity in the androgen receptor, and the changes on biological activity of subtle modifications at the ligand and receptor (mutations) level, molecular dynamics simulations were performed on the androgen receptor wild type (WT), and T877A and W741 mutant forms, complexed with several non-steroidal androgens. The stabilizing role of residues from helices 3, 5, 11 and 12 was observed in non-steroidal androgens R-3, S-1, and R-bicalutamide and hydroxyflutamide in resistant mutations. In the AR WT antiandrogen R-bicalutamide complex, destabilization of M895 by both W741 and the sulfonyl linkage of the ligand may be responsible for reported antagonism. Changes in the ligand or mutations alleviating this effect were observed to stabilize the receptor in the active conformation, thus developing resistance to R-bicalutamide. The results presented provide a plausible explanation for the molecular basis of agonicity and antagonicity in the androgen receptor, and complement previous studies using static crystal structures, incorporating for the first time protein dynamics into the analysis. Thus, our results provide a valuable framework for the structure-based design of improved antiandrogens.     

Shadow attacks on users’ anonymity in pervasive computing environments

Privacy preserving technologies are likely to become an essential component of adaptive services in pervasive and mobile computing. Although privacy issues have been studied for a long time in computer science as well as in other fields, most studies are focused on the release of data from large repositories. Mobile and pervasive computing pose new challenges, requiring specific formal models for attacks and new privacy preserving techniques. This paper considers a specific pervasive computing scenario, and shows that the application of state-of-the-art techniques for the anonymization of service requests is insufficient to protect the privacy of users. A specific class of attacks, called shadow attacks, is formally defined and a defense technique is proposed. This defense is formally proved to be correct, and its effectiveness is validated by extensive experiments in a simulated environment.     

A coarse-grain reconfigurable architecture for multimedia applications featuring subword computation capabilities

This paper presents the design and the implementation of a coarse-grain reconfigurable machine used as an accelerator for a programmable RISC core, to speed up the execution of computationally demanding tasks like multimedia applications. We created a VHDL model of the proposed architecture and implemented it on a FPGA board for prototyping purposes; then we mapped on our architecture some DSP and image processing algorithms as a benchmark. In particular, we provided the proposed architecture with subword computation capabilities, which turns out to be extremely effective especially when dealing with image processing algorithms, achieving significant benefits in terms of speed and efficiency in resource usage. To create the configuration bitstream (configware) we created a tool based on a graphical user interface (GUI) which provides a first step towards the automation of the programming flow of our design: the tool is meant to ease the life of the programmer, relieving him from the burden of calculating the configuration bits by hand. Synthesis results indicate that the area occupation and the operating frequency of our design are reasonable also when compared to other similar design. In addition to this, the amount of clock cycles taken by our machine to perform a given algorithm is orders of magnitude smaller than the one required by a corresponding software implementation on a RISC microprocessor.