Search results for "modelling."
showing 10 items of 1269 documents
Exploring parallel capabilities of an innovative numerical method for recovering image velocity vectors field
2010
In this paper an efficient method devoted to estimate the velocity vectors field is investigated. The method is based on a quasi-interpolant operator and involves a large amount of computation. The operations characterizing the computational scheme are ideal for parallel processing because they are local, regular and repetitive. Therefore, the spatial parallelism of the process is studied to rapidly proceed in the computation on distributed multiprocessor systems. The process has shown to be synchronous, with good task balancing and requiring a small amount of data transfer.
Shooting methods for 1D steady-state free boundary problems
1993
AbstractIn this note, we present two numerical methods based on shooting methods to solve steady-state diffusion-absorption models.
Comparison of implementations of the lattice-Boltzmann method
2008
AbstractSimplicity of coding is usually an appealing feature of the lattice-Boltzmann method (LBM). Conventional implementations of LBM are often based on the two-lattice or the two-step algorithm, which however suffer from high memory consumption and poor computational performance, respectively. The aim of this work was to identify implementations of LBM that would achieve high computational performance with low memory consumption. Effects of memory addressing schemes were investigated in particular. Data layouts for velocity distribution values were also considered, and they were found to be related to computational performance. A novel bundle data layout was therefore introduced. Address…
Using an Adaptive Network-based Fuzzy Inference System to Estimate the Vertical Force in Single Point Incremental Forming
2019
Manufacturing processes are usually complex ones, involving a significant number of parameters. Unconventional manufacturing processes, such as incremental forming is even more complex, and the establishment of some analytical relationships between parameters is difficult, largely due to the nonlinearities in the process. To overcome this drawback, artificial intelligence techniques were used to build empirical models from experimental data sets acquired from the manufacturing processes. The approach proposed in this work used an adaptive network-based fuzzy inference system to extract the value of technological force on Z-axis, which appears during incremental forming, considering a set of…
On the first- and second-order statistics of the capacity of N*Nakagami-m channels for applications in cooperative networks
2012
This article deals with the derivation and analysis of the statistical properties of the instantaneous channel capacitya of N*Nakagami-m channels, which has been recently introduced as a suitable stochastic model for multihop fading channels. We have derived exact analytical expressions for the probability density function (PDF), cumulative distribution function (CDF), level-crossing rate (LCR), and average duration of fades (ADF) of the instantaneous channel capacity of N*Nakagami-m channels. For large number of hops, we have studied the first-order statistics of the instantaneous channel capacity by assuming that the fading amplitude of the channel can approximately be modeled as a lognor…
Upport vector machines for nonlinear kernel ARMA system identification.
2006
Nonlinear system identification based on support vector machines (SVM) has been usually addressed by means of the standard SVM regression (SVR), which can be seen as an implicit nonlinear autoregressive and moving average (ARMA) model in some reproducing kernel Hilbert space (RKHS). The proposal of this letter is twofold. First, the explicit consideration of an ARMA model in an RKHS (SVM-ARMA 2k) is proposed. We show that stating the ARMA equations in an RKHS leads to solving the regularized normal equations in that RKHS, in terms of the autocorrelation and cross correlation of the (nonlinearly) transformed input and output discrete time processes. Second, a general class of SVM-based syste…
ORGANIZED LEARNING MODELS (PURSUER CONTROL OPTIMISATION)
1983
Abstract The concept of Organized Learning is defined, and some random models are presented. For Not Transferable Learning, it is necessary to start from an instantaneous learning; by a discrete way, we must form a stochastic model considering the probability of each path; with a continue aproximation, we can study the evolution of the internal state through to consider the relative and absolute probabilities, by means of differential equations systems. For Transferable Learning, the instantaneous learning give us directly the System evolution. So, the Algoritmes for the different models are compared.
A computer method for estimating volumes and surface areas of complex structures consisting of overlapping spheres
1992
A PASCAL program which calculates volumes and surface areas of structures consisting of overlapping spheres is designed. The calculation is done by modelling the structure in the memory of a computer and then scanning the memory bit- or bytewise. A brief discussion of the error is presented, and an example for testing the algorithm is provided.
Combining Supervised and Unsupervised Learning to Discover Emotional Classes
2017
Most previous work in emotion recognition has fixed the available classes in advance, and attempted to classify samples into one of these classes using a supervised learning approach. In this paper, we present preliminary work on combining supervised and unsupervised learning to discover potential latent classes which were not initially considered. To illustrate the potential of this hybrid approach, we have used a Self-Organizing Map (SOM) to organize a large number of Electroencephalogram (EEG) signals from subjects watching videos, according to their internal structure. Results suggest that a more useful labelling scheme could be produced by analysing the resulting topology in relation t…
An asynchronous covert channel using spam
2012
AbstractCurrent Internet e-mail facilities are built onto the foundation of standard rules and protocols, which usually allow a considerable amount of “freedom” to their designers. Each of these standards has been defined based on a number of vendor specific implementations, in order to provide common inter-working procedures for cross-vendor communication. Thus, a lot of optional and redundant information is being exchanged during e-mail sessions, which is available to implement versatile covert channel mechanisms.This work exploits this possibility by presenting a simple but effective steganographic scheme that can be used to deploy robust secret communication through spam e-mails. This s…