A meshless adaptive multiscale method for fracture

The paper presents a multiscale method for crack propagation. The coarse region is modelled by the differential reproducing kernel particle method. Fracture in the coarse scale region is modelled with the Phantom node method. A molecular statics approach is employed in the fine scale where crack propagation is modelled naturally by breaking of bonds. The triangular lattice corresponds to the lattice structure of the (111) plane of an FCC crystal in the fine scale region. The Lennard-Jones potential is used to model the atom-atom interactions. The coupling between the coarse scale and fine scale is realized through ghost atoms. The ghost atom positions are interpolated from the coarse scale solution and enforced as boundary conditions on the fine scale. The fine scale region is adaptively refined and coarsened as the crack propagates. The centro symmetry parameter is used to detect the crack tip location. The method is implemented in two dimensions. The results are compared to pure atomistic simulations and show excellent agreement. (C) 2014 Elsevier B. V. All rights reserved.

Hierarchical multiscale model for biomechanics analysis of microfilament networks

The mechanisms of force generation and transference via microfilament networks are crucial to the understandings of mechanobiology of cellular processes in living cells. However, there exists an enormous challenge for all-atom physics simulation of real size microfilament networks due to scale limitation of molecular simulation techniques. Following biophysical investigations of constitutive relations between adjacent globular actin monomers on filamentous actin, a hierarchical multiscale model was developed to investigate the biomechanical properties of microfilament networks. This model was validated by previous experimental studies of axial tension and transverse vibration of single F-actin. The biomechanics of microfilament networks can be investigated at the scale of real eukaryotic cell size (10 μm). This multiscale approach provides a powerful modeling tool which can contribute to the understandings of actin-related cellular processes in living cells.

A sequential Monte Carlo framework for adaptive Bayesian model discrimination designs using mutual information

In this paper we present a unified sequential Monte Carlo (SMC) framework for performing sequential experimental design for discriminating between a set of models. The model discrimination utility that we advocate is fully Bayesian and based upon the mutual information. SMC provides a convenient way to estimate the mutual information. Our experience suggests that the approach works well on either a set of discrete or continuous models and outperforms other model discrimination approaches.

A self-adaptive migration model genetic algorithm for data mining applications

Data mining involves nontrivial process of extracting knowledge or patterns from large databases. Genetic Algorithms are efficient and robust searching and optimization methods that are used in data mining. In this paper we propose a Self-Adaptive Migration Model GA (SAMGA), where parameters of population size, the number of points of crossover and mutation rate for each population are adaptively fixed. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions and a set of actual classification datamining problems. Michigan style of classifier was used to build the classifier and the system was tested with machine learning databases of Pima Indian Diabetes database, Wisconsin Breast Cancer database and few others. The performance of our algorithm is better than others.

Multiscale model reduction methods for deterministic and stochastic partial differential equations

Partial differential equations (PDEs) with multiscale coefficients are very difficult to solve due to the wide range of scales in the solutions. In the thesis, we propose some efficient numerical methods for both deterministic and stochastic PDEs based on the model reduction technique.

For the deterministic PDEs, the main purpose of our method is to derive an effective equation for the multiscale problem. An essential ingredient is to decompose the harmonic coordinate into a smooth part and a highly oscillatory part of which the magnitude is small. Such a decomposition plays a key role in our construction of the effective equation. We show that the solution to the effective equation is smooth, and could be resolved on a regular coarse mesh grid. Furthermore, we provide error analysis and show that the solution to the effective equation plus a correction term is close to the original multiscale solution.

For the stochastic PDEs, we propose the model reduction based data-driven stochastic method and multilevel Monte Carlo method. In the multiquery, setting and on the assumption that the ratio of the smallest scale and largest scale is not too small, we propose the multiscale data-driven stochastic method. We construct a data-driven stochastic basis and solve the coupled deterministic PDEs to obtain the solutions. For the tougher problems, we propose the multiscale multilevel Monte Carlo method. We apply the multilevel scheme to the effective equations and assemble the stiffness matrices efficiently on each coarse mesh grid. In both methods, the $\KL$ expansion plays an important role in extracting the main parts of some stochastic quantities.

For both the deterministic and stochastic PDEs, numerical results are presented to demonstrate the accuracy and robustness of the methods. We also show the computational time cost reduction in the numerical examples.

Adaptive multiscale biological signal processing

Biological processes are very complex mechanisms, most of them being accompanied by or manifested as signals that reflect their essential characteristics and qualities. The development of diagnostic techniques based on signal and image acquisition from the human body is commonly retained as one of the propelling factors in the advancements in medicine and biosciences recorded in the recent past. It is a fact that the instruments used for biological signal and image recording, like any other acquisition system, are affected by non-idealities which, by different degrees, negatively impact on the accuracy of the recording. This work discusses how it is possible to attenuate, and ideally to remove, these effects, with a particular attention toward ultrasound imaging and extracellular recordings. Original algorithms developed during the Ph.D. research activity will be examined and compared to ones in literature tackling the same problems; results will be drawn on the base of comparative tests on both synthetic and in-vivo acquisitions, evaluating standard metrics in the respective field of application. All the developed algorithms share an adaptive approach to signal analysis, meaning that their behavior is not dependent only on designer choices, but driven by input signal characteristics too. Performance comparisons following the state of the art concerning image quality assessment, contrast gain estimation and resolution gain quantification as well as visual inspection highlighted very good results featured by the proposed ultrasound image deconvolution and restoring algorithms: axial resolution up to 5 times better than algorithms in literature are possible. Concerning extracellular recordings, the results of the proposed denoising technique compared to other signal processing algorithms pointed out an improvement of the state of the art of almost 4 dB.

Using an adaptive autoregressive model for the early detection of action potential duration alternans

Cardiostim 2012, Nice, France

Debonding detection of FRP strengthened concrete beams by using impedance measurements and an ensemble PSO adaptive spectral model

An impedance-based midspan debonding identification method for RC beams strengthened with FRP strips is presented in this paper using piezoelectric ceramic (PZT) sensor?actuators. To reach this purpose, firstly, a two-dimensional electromechanical impedance model is proposed to predict the electrical admittance of the PZT transducer bonded to the FRP strips of an RC beam. Considering the impedance is measured in high frequencies, a spectral element model of the bonded-PZT?FRP strengthened beam is developed. This model, in conjunction with experimental measurements of PZT transducers, is used to present an updating methodology to quantitatively detect interfacial debonding of these kinds of structures. To improve the performance and accuracy of the detection algorithm in a challenging problem such as ours, the structural health monitoring approach is solved with an ensemble process based on particle of swarm. An adaptive mesh scheme has also been developed to increase the reliability in locating the area in which debonding initiates. Predictions carried out with experimental results have showed the effectiveness and potential of the proposed method to detect prematurely at its earliest stages a critical failure mode such as that due to midspan debonding of the FRP strip.

An adaptive motion model for person tracking with instantaneous head-pose features

This letter presents novel behaviour-based tracking of people in low-resolution using instantaneous priors mediated by head-pose. We extend the Kalman Filter to adaptively combine motion information with an instantaneous prior belief about where the person will go based on where they are currently looking. We apply this new method to pedestrian surveillance, using automatically-derived head pose estimates, although the theory is not limited to head-pose priors. We perform a statistical analysis of pedestrian gazing behaviour and demonstrate tracking performance on a set of simulated and real pedestrian observations. We show that by using instantaneous `intentional' priors our algorithm significantly outperforms a standard Kalman Filter on comprehensive test data.

Um modelo multiescala concorrente para representar o processo de fissuração do concreto.

Este trabalho propõe uma técnica de modelagem multiescala concorrente do concreto considerando duas escalas distintas: a mesoescala, onde o concreto é modelado como um material heterogêneo, e a macroescala, na qual o concreto é tratado como um material homogêneo. A heterogeneidade da estrutura mesoscópica do concreto é idealizada considerando três fases distintas, compostas pelos agregados graúdos e argamassa (matriz), estes considerados materiais homogêneos, e zona de transição interfacial (ZTI), tratada como a parte mais fraca entre as três fases. O agregado graúdo é gerado a partir de uma curva granulométrica e posicionado na matriz de forma aleatória. Seu comportamento mecânico é descrito por um modelo constitutivo elástico-linear, devido a sua maior resistência quando comparado com as outras duas fases do concreto. Elementos finitos contínuos com alta relação de aspecto em conjunto com um modelo constitutivo de dano são usados para representar o comportamento não linear do concreto, decorrente da iniciação de fissuras na ZTI e posterior propagação para a matriz, dando lugar à formação de macrofissuras. Os elementos finitos de interface com alta relação de aspecto são inseridos entre todos os elementos regulares da matriz e entre os da matriz e agregados, representando a ZTI, tornando-se potenciais caminhos de propagação de fissuras. No estado limite, quando a espessura do elemento de interface tende a zero (h ?0) e, consequentemente, a relação de aspecto tende a infinito, estes elementos apresentam a mesma cinemática da aproximação contínua de descontinuidades fortes (ACDF), sendo apropriados para representar a formação de descontinuidades associados a fissuras, similar aos modelos coesivos. Um modelo de dano à tração é proposto para representar o comportamento mecânico não linear das interfaces, associado à formação de fissuras, ou até mesmo ao eventual fechamento destas. A fim de contornar os problemas causados pela malha de elementos finitos de transição entre as malhas da macro e da mesoescala, que, em geral, apresentam diferenças expressivas 5 de refinamento, utiliza-se uma técnica recente de acoplamento de malhas não conformes. Esta técnica é baseada na definição de elementos finitos de acoplamento (EFAs), os quais são capazes de estabelecer a continuidade de deslocamento entre malhas geradas de forma completamente independentes, sem aumentar a quantidade total de graus de liberdade do problema, podendo ser utilizados tanto para acoplar malhas não sobrepostas quanto sobrepostas. Para tornar possível a análise em multiescala em casos nos quais a região de localização de deformações não pode ser definida a priori, propõe-se uma técnica multiescala adaptativa. Nesta abordagem, usa-se a distribuição de tensões da escala macroscópica como um indicador para alterar a modelagem das regiões críticas, substituindo-se a macroescala pela mesoescala durante a análise. Consequentemente, a malha macroscópica é automaticamente substituída por uma malha mesoscópica, onde o comportamento não linear está na iminência de ocorrer. Testes numéricos são desenvolvidos para mostrar a capacidade do modelo proposto de representar o processo de iniciação e propagação de fissuras na região tracionada do concreto. Os resultados numéricos são comparados com os resultados experimentais ou com aqueles obtidos através da simulação direta em mesoescala (SDM).

A Dynamic Migration Model for Self-adaptive Genetic Algorithms

In this paper, we propose a self Adaptive Migration Model for Genetic Algorithms, where parameters of population size, the number of points of crossover and mutation rate for each population are fixed adaptively. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions, when compared with Island model GA(IGA) and Simple GA(SGA).

A Dynamic Migration Model for self-adaptive Genetic Algorithms

In this paper, we propose a self Adaptive Migration Model for Genetic Algorithms, where parameters of population size, the number of points of crossover and mutation rate for each population are fixed adaptively. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions, when compared with Island model GA(IGA) and Simple GA(SGA).