Search results for "Computational Mathematic"

Decentralized Subspace Projection for Asymmetric Sensor Networks

2020

A large number of applications in Wireless Sensor Networks include projecting a vector of noisy observations onto a subspace dictated by prior information about the field being monitored. In general, accomplishing such a task in a centralized fashion, entails a large power consumption, congestion at certain nodes and suffers from robustness issues against possible node failures. Computing such projections in a decentralized fashion is an alternative solution that solves these issues. Recent works have shown that this task can be done via the so-called graph filters where only local inter-node communication is performed in a distributed manner using a graph shift operator. Most of the existi…

Car style-holon recognition in computer-aided design

2019

Abstract Multi-scale design can presumably stimulate greater intelligence in computer-aided design (CAD). Using the style-holon concept, this paper proposes a computational approach to address multi-scale style recognition for automobiles. A style-holon is both a whole—it contains sub-styles of which it is composed—as well as a part of a broader style. In this paper, we first apply a variable precision rough set-based approach to car evaluation and ranking. Secondly, we extracted and subsequently computed the each car's characteristic lines from the CAD models. Finally, we identified style-holons using the property of a double-headed style-holon. A style-holon is necessarily included in a 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…

Corrigendum to “Intelligent agents for feature modelling in computer aided design” [J. Comput. Des. Eng. (2018) 19–40]

2018

Subpixel determination of imperfect circles characteristics

2008

This article deals with the problem of the determination of characteristics of imperfect circular objects in discrete images, namely the radius and center coordinates. To limit distortion, a multi-level method based on active contours was developed. Its originality is to furnish a set of geometric envelopes in one pass, with a correspondence between grayscale and a regularity scale. The adequacy of this approach was tested with several methods, among them is the Radon-based method. More particularly, this study indicates the relevance of the use of active contours combined with a Radon transform-based method which was improved using a fitting considering the discrete implementation of the R…

An optimization approach for communal home meal delivery service

2009

Abstract: This paper is the first to discuss the communal home meal delivery problem. The problem can be modelled as a multiple travelling salesman problem with time windows, that is closely related to the well-studied vehicle routing problem with time windows. Experimental results are reported for a real-life case study from Central Finland over several alternative scenarios using the SPIDER commercial solver. The comparison with current practice reveals that a significant savings potential can be obtained using off-the-shelf optimization tools. As such, the potential for supporting real-life communal routing problems can be considered to be important for VRP practitioners.

Density-functional tight-binding for beginners

2009

This article is a pedagogical introduction to density-functional tight-binding (DFTB) method. We derive it from the density-functional theory, give the details behind the tight-binding formalism, and give practical recipes for parametrization: how to calculate pseudo-atomic orbitals and matrix elements, and especially how to systematically fit the short-range repulsions. Our scope is neither to provide a historical review nor to make performance comparisons, but to give beginner's guide for this approximate, but in many ways invaluable, electronic structure simulation method--now freely available as an open-source software package, hotbit.

Speeding up of microstructure reconstruction: II. Application to patterns of poly-dispersed islands

2015

We report a fast, efficient and credible statistical reconstruction of any two-phase patterns of islands of miscellaneous shapes and poly-dispersed in sizes. In the proposed multi-scale approach called a weighted doubly-hybrid, two different pairs of hybrid descriptors are used. As the first pair, we employ entropic quantifiers, while correlation functions are the second pair. Their competition allows considering a wider spectrum of morphological features. Instead of a standard random initial configuration, a synthetic one with the same number of islands as that of the target is created by a cellular automaton. This is the key point for speeding-up of microstructure reconstruction, making u…

Fuzzy Control of Uncertain Nonlinear Systems with Numerical Techniques: A Survey

2019

This paper provides an overview of numerical methods in order to solve fuzzy equations (FEs). It focuses on different numerical methodologies to solve FEs, dual fuzzy equations (DFEs), fuzzy differential equations (FDEs) and partial fuzzy differential equations (PFDEs). The solutions which are produced by these equations are taken to be the controllers. This paper also analyzes the existence of the roots of FEs and some important implementation problems. Finally, several examples are reviewed with different methods.

Parallelization strategies for density matrix renormalization group algorithms on shared-memory systems

2003

Shared-memory parallelization (SMP) strategies for density matrix renormalization group (DMRG) algorithms enable the treatment of complex systems in solid state physics. We present two different approaches by which parallelization of the standard DMRG algorithm can be accomplished in an efficient way. The methods are illustrated with DMRG calculations of the two-dimensional Hubbard model and the one-dimensional Holstein-Hubbard model on contemporary SMP architectures. The parallelized code shows good scalability up to at least eight processors and allows us to solve problems which exceed the capability of sequential DMRG calculations.