Parallelization of kinetic Monte Carlo algorithm to simulate AL3Sc precipitation

The present paper reports the precipitation process of Al3Sc structures in an aluminum scandium alloy, which has been simulated with a synchronous parallel kinetic Monte Carlo (spkMC) algorithm. The spkMC implementation is based on the vacancy diffusion mechanism. To filter the raw data generated by the spkMC simulations, the density-based clustering with noise (DBSCAN) method has been employed. spkMC and DBSCAN algorithms were implemented in the C language and using MPI library. The simulations were conducted in the SeARCH cluster located at the University of Minho. The Al3Sc precipitation was successfully simulated at the atomistic scale with the spkMC. DBSCAN proved to be a valuable aid to identify the precipitates by performing a cluster analysis of the simulation results. The achieved simulations results are in good agreement with those reported in the literature under sequential kinetic Monte Carlo simulations (kMC). The parallel implementation of kMC has provided a 4x speedup over the sequential version.

A model to simulate the moment-rotation and crack width of FRC members reinforced with longitudinal bars

The present work describes a model for the determination of the moment–rotation relationship of a cross section of fiber reinforced concrete (FRC) elements that also include longitudinal bars for the flexural reinforcement (R/FRC). Since a stress–crack width relationship (σ–w)(σ–w) is used to model the post-cracking behavior of a FRC, the σ–w directly obtained from tensile tests, or derived from inverse analysis applied to the results obtained in three-point notched beam bending tests, can be adopted in this approach. For a more realistic assessment of the crack opening, a bond stress versus slip relationship is assumed to simulate the bond between longitudinal bars and surrounding FRC. To simulate the compression behavior of the FRC, a shear friction model is adopted based on the physical interpretation of the post-peak compression softening behavior registered in experimental tests. By allowing the formation of a compressive FRC wedge delimited by shear band zones, the concept of concrete crushing failure mode in beams failing in bending is reinterpreted. By using the moment–rotation relationship, an algorithm was developed to determine the force–deflection response of statically determinate R/FRC elements. The model is described in detail and its good predictive performance is demonstrated by using available experimental data. Parametric studies were executed to evidence the influence of relevant parameters of the model on the serviceability and ultimate design conditions of R/FRC elements failing in bending.

Tunnel engineering – influence of the type and the quantity of measurements in the back analysis of geomechanical parameters

The monitoring data collected during tunnel excavation can be used in inverse analysis procedures in order to identify more realistic geomechanical parameters that can increase the knowledge about the interested formations. These more realistic parameters can be used in real time to adapt the project to the real structure in situ behaviour. However, monitoring plans are normally designed for safety assessment and not especially for the purpose of inverse analysis. In fact, there is a lack of knowledge about what types and quantity of measurements are needed to succeed in identifying the parameters of interest. Also, the optimisation algorithm chosen for the identification procedure may be important for this matter. In this work, this problem is addressed using a theoretical case with which a thorough parametric study was carried out using two optimisation algorithms based on different calculation paradigms, namely a conventional gradient-based algorithm and an evolution strategy algorithm. Calculations were carried for different sets of parameters to identify several combinations of types and amount of monitoring data. The results clearly show the high importance of the available monitoring data and the chosen algorithm for the success rate of the inverse analysis process.

Solving large 0–1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm

The artificial fish swarm algorithm has recently been emerged in continuous global optimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described by 0-1 multidimensional knapsack problems that are NP-hard. In the last decades several exact as well as heuristic methods have been proposed for solving these problems. In this paper, a new simpli ed binary version of the artificial fish swarm algorithm is presented, where a point/ fish is represented by a binary string of 0/1 bits. Trial points are created by using crossover and mutation in the different fi sh behavior that are randomly selected by using two user de ned probability values. In order to make the points feasible the presented algorithm uses a random heuristic drop item procedure followed by an add item procedure aiming to increase the profit throughout the adding of more items in the knapsack. A cyclic reinitialization of 50% of the population, and a simple local search that allows the progress of a small percentage of points towards optimality and after that refines the best point in the population greatly improve the quality of the solutions. The presented method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method can be an alternative method for solving these problems.

A new competitive implementation of the electromagnetism-like algorithm for global optimization

The Electromagnetism-like (EM) algorithm is a population- based stochastic global optimization algorithm that uses an attraction- repulsion mechanism to move sample points towards the optimal. In this paper, an implementation of the EM algorithm in the Matlab en- vironment as a useful function for practitioners and for those who want to experiment a new global optimization solver is proposed. A set of benchmark problems are solved in order to evaluate the performance of the implemented method when compared with other stochastic methods available in the Matlab environment. The results con rm that our imple- mentation is a competitive alternative both in term of numerical results and performance. Finally, a case study based on a parameter estimation problem of a biology system shows that the EM implementation could be applied with promising results in the control optimization area.

Combining non-dominance, objective-order and spread metric to extend firefly algorithm to multi-objective optimization

In this paper, we propose an extension of the firefly algorithm (FA) to multi-objective optimization. FA is a swarm intelligence optimization algorithm inspired by the flashing behavior of fireflies at night that is capable of computing global solutions to continuous optimization problems. Our proposal relies on a fitness assignment scheme that gives lower fitness values to the positions of fireflies that correspond to non-dominated points with smaller aggregation of objective function distances to the minimum values. Furthermore, FA randomness is based on the spread metric to reduce the gaps between consecutive non-dominated solutions. The obtained results from the preliminary computational experiments show that our proposal gives a dense and well distributed approximated Pareto front with a large number of points.

New control algorithm for single-phase series active power filter

This paper presents a single-phase Series Active Power Filter (Series APF) for mitigation of the load voltage harmonic content, while maintaining the voltage on the DC side regulated without the support of a voltage source. The proposed series active power filter control algorithm eliminates the additional voltage source to regulate the DC voltage, and with the adopted topology it is not used a coupling transformer to interface the series active power filter with the electrical power grid. The paper describes the control strategy which encapsulates the grid synchronization scheme, the compensation voltage calculation, the damping algorithm and the dead-time compensation. The topology and control strategy of the series active power filter have been evaluated in simulation software and simulations results are presented. Experimental results, obtained with a developed laboratorial prototype, validate the theoretical assumptions, and are within the harmonic spectrum limits imposed by the international recommendations of the IEEE-519 Standard.

The group inverse of a product

In this paper, we characterize the existence and give an expression of the group inverse of a product of two regular elements by means of a ring unit.

Further results on the inverse along an element in semigroups and rings

In this paper, we introduce a new notion in a semigroup $S$ as an extension of Mary's inverse. Let $a,d\in S$. An element $a$ is called left (resp. right) invertible along $d$ if there exists $b\in S$ such that $bad=d$ (resp. $dab=b$) and $b\leq_\mathcal{L}d$ (resp. $b\leq_\mathcal{R}d$). An existence criterion of this type inverse is derived. Moreover, several characterizations of left (right) regularity, left (right) $\pi$-regularity and left (right) $*$-regularity are given in a semigroup. Further, another existence criterion of this type inverse is given by means of a left (right) invertibility of certain elements in a ring. Finally we study the (left, right) inverse along a product in a ring, and, as an application, Mary's inverse along a matrix is expressed.

The inverse along a product and its applications

In this paper, we study the recently defined notion of the inverse along an element. An existence criterion for the inverse along a product is given in a ring. As applications, we present the equivalent conditions for the existence and expressions of the inverse along a matrix.

MOEA/VAN: Multiobjective Evolutionary Algorithm based on Vector Angle Neighborhood

Natural selection favors the survival and reproduction of organisms that are best adapted to their environment. Selection mechanism in evolutionary algorithms mimics this process, aiming to create environmental conditions in which artificial organisms could evolve solving the problem at hand. This paper proposes a new selection scheme for evolutionary multiobjective optimization. The similarity measure that defines the concept of the neighborhood is a key feature of the proposed selection. Contrary to commonly used approaches, usually defined on the basis of distances between either individuals or weight vectors, it is suggested to consider the similarity and neighborhood based on the angle between individuals in the objective space. The smaller the angle, the more similar individuals. This notion is exploited during the mating and environmental selections. The convergence is ensured by minimizing distances from individuals to a reference point, whereas the diversity is preserved by maximizing angles between neighboring individuals. Experimental results reveal a highly competitive performance and useful characteristics of the proposed selection. Its strong diversity preserving ability allows to produce a significantly better performance on some problems when compared with stat-of-the-art algorithms.

Sistema de posicionamento baseado em redes de sensores sem fios

Dissertação de mestrado integrado em Engenharia Eletrónica Industrial e Computadores