scholarly journals Erratum: Correia, S.D., et al. Development of a Test-Bench for Evaluating the Embedded Implementation of the Improved Elephant Herding Optimization Algorithm Applied to Energy-Based Acoustic Localization. Computers 2020, 9, 87

Computers ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 41
Author(s):  
Sérgio D. Correia ◽  
João Fé ◽  
Slavisa Tomic ◽  
Marko Beko
Keyword(s):  
Optimization Algorithm ◽  
Test Bench ◽  
Acoustic Localization ◽  
The Third ◽  
Embedded Implementation

The third affiliation of the paper should have been completed in our original article [...]

scholarly journals Development of a Test-Bench for Evaluating the Embedded Implementation of the Improved Elephant Herding Optimization Algorithm Applied to Energy-Based Acoustic Localization

Computers ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 87
Author(s):  
Sérgio D. Correia ◽  
João Fé ◽  
Slavisa Tomic ◽  
Marko Beko
Keyword(s):  
Real Time ◽  
Test Bench ◽  
High Reliability ◽  
Low Complexity ◽  
Embedded Processor ◽  
Acoustic Localization ◽  
Metaheuristic Methods ◽  
Real Time Applications ◽  
High Level ◽  
Embedded Implementation

The present work addresses the development of a test-bench for the embedded implementation, validity, and testing of the recently proposed Improved Elephant Herding Optimization (iEHO) algorithm, applied to the acoustic localization problem. The implemented methodology aims to corroborate the feasibility of applying iEHO in real-time applications on low complexity and low power devices, where three different electronic modules are used and tested. Swarm-based metaheuristic methods are usually examined by employing high-level languages on centralized computers, demonstrating their capability in finding global or good local solutions. This work considers iEHO implementation in C-language running on an embedded processor. Several random scenarios are generated, uploaded, and processed by the embedded processor to demonstrate the algorithm’s effectiveness and the test-bench usability, low complexity, and high reliability. On the one hand, the results obtained in our test-bench are concordant with the high-level implementations using MatLab® in terms of accuracy. On the other hand, concerning the processing time and as a breakthrough, the results obtained over the test-bench allow to demonstrate a high suitability of the embedded iEHO implementation for real-time applications due to its low latency.

Research on Statistic-Based Image Segmentation Method

2012 ◽  
Vol 461 ◽  
pp. 575-578 ◽  
Author(s):  
Yi Min Hou ◽  
Chun Ting Zhang ◽  
Xiao Yan Lai ◽  
Jian Ming Di
Keyword(s):  
Image Segmentation ◽  
Random Field ◽  
Markov Random Field ◽  
Optimization Algorithm ◽  
Image Noise ◽  
Segmentation Method ◽  
The Third ◽  
Markov Random ◽  
Class Segmentation ◽  
Multiple Class

The paper researched the image segmentation method based on statistic. For the multiple class segmentation, the K-means segmentation was employed in the first part. The segmentation method named OTSU is discussed in the second part of this paper. To solve the problem of the image noise, the method based on the Markov Random Field (MRF) is proposed in the third part of the paper. The ICM optimization algorithm is used in the procedure of MRF segmentation. In the experiments part, the methods are compared with each other, and the results showed that the method based on MRF are more efficient to remove the noise in the images.

scholarly journals Optimal Coronavirus Optimization Algorithm Based PID Controller for High Performance Brushless DC Motor

Algorithms ◽  
2021 ◽  
Vol 14 (7) ◽  
pp. 193
Author(s):  
Mohamed A. Shamseldin
Keyword(s):  
Optimization Algorithm ◽  
Rise Time ◽  
Pid Controller ◽  
High Performance ◽  
Harmony Search ◽  
Settling Time ◽  
Optimization Techniques ◽  
Bldc Motor ◽  
Brushless Dc ◽  
The Third

This paper presents an efficient coronavirus optimization algorithm (CVOA) to find the optimal values of the PID controller to track a preselected reference speed of a brushless DC (BLDC) motor under several types of disturbances. This work simulates how the coronavirus (COVID-19) spreads and infects healthy people. The initial values of PID controller parameters consider the zero patient, who infects new patients (other values of PID controller parameters). The model aims to simulate as accurately as possible the coronavirus activity. The CVOA has two major advantages compared to other similar strategies. First, the CVOA parameters are already adjusted according to disease statistics to prevent designers from initializing them with arbitrary values. Second, the approach has the ability to finish after several iterations where the infected population initially grows at an exponential rate. The proposed CVOA was investigated with well-known optimization techniques such as the genetic algorithm (GA) and Harmony Search (HS) optimization. A multi-objective function was used to allow the designer to select the desired rise time, the desired settling time, the desired overshoot, and the desired steady-state error. Several tests were performed to investigate the obtained proper values of PID controller parameters. In the first test, the BLDC motor was exposed to sudden load at a steady speed. In the second test, the continuous sinusoidal load was applied to the rotor of the BLDC motor. In the third test, different operating points of reference speed were selected to the rotor of the BLDC motor. The results proved that the CVOA-based PID controller has the best performance among the techniques. In the first test, the CVOA-based PID controller has a minimum rise time (0.0042 s), minimum settling time (0.0079 s), and acceptable overshoot (0.0511%). In the second test, the CVOA-based PID controller has the minimum deviation about the reference speed (±4 RPM). In the third test, the CVOA-based PID controller can accurately track the reference speed among other techniques.

scholarly journals The semantics of future and an application

1999 ◽  
Vol 9 (1) ◽  
pp. 1-31 ◽  
Author(s):  
C. FLANAGAN ◽  
M. FELLEISEN
Keyword(s):  
Optimization Algorithm ◽  
Program Analysis ◽  
Operational Semantics ◽  
Functional Language ◽  
Design Issues ◽  
Simple Method ◽  
Analysis Algorithm ◽  
The Third ◽  
Parallel Tasks

The future annotation of MultiLisp provides a simple method for taming the implicit parallelism of functional programs. Prior research on future has concentrated on implementation and design issues, and has largely ignored the development of a semantic characterization of future. This paper considers an idealized functional language with futures and presents a series of operational semantics with increasing degrees of intensionality. The first semantics defines future to be a semantically transparent annotation. The second semantics interprets a future expression as a potentially parallel task. The third semantics explicates the coordination of parallel tasks by introducing placeholder objects and touch operations.We use the last semantics to derive a program analysis algorithm and an optimization algorithm that removes provably redundant touch operations. Experiments with the Gambit compiler indicate that this optimization significantly reduces the overhead imposed by touch operations.

Progress report on 21-cm observations at low latitude between longitudes (l 11) 0° and 66°

1967 ◽  
Vol 31 ◽  
pp. 177-179
Author(s):  
W. W. Shane
Keyword(s):  
Preliminary Report ◽  
Progress Report ◽  
Galactic Centre ◽  
Low Latitude ◽  
The Third ◽  
Introductory Lecture ◽  
Centre Region

In the course of several 21-cm observing programmes being carried out by the Leiden Observatory with the 25-meter telescope at Dwingeloo, a fairly complete, though inhomogeneous, survey of the regionl11= 0° to 66° at low galactic latitudes is becoming available. The essential data on this survey are presented in Table 1. Oort (1967) has given a preliminary report on the first and third investigations. The third is discussed briefly by Kerr in his introductory lecture on the galactic centre region (Paper 42). Burton (1966) has published provisional results of the fifth investigation, and I have discussed the sixth in Paper 19. All of the observations listed in the table have been completed, but we plan to extend investigation 3 to a much finer grid of positions.

The orbit of Pluto over a long interval of time

1966 ◽  
Vol 25 ◽  
pp. 227-229 ◽  
Author(s):  
D. Brouwer
Keyword(s):  
Periodic Orbit ◽  
Numerical Integration ◽  
Restricted Problem ◽  
Three Dimensional ◽  
The Third ◽  
Circular Restricted Problem ◽  
Resonance Relation

The paper presents a summary of the results obtained by C. J. Cohen and E. C. Hubbard, who established by numerical integration that a resonance relation exists between the orbits of Neptune and Pluto. The problem may be explored further by approximating the motion of Pluto by that of a particle with negligible mass in the three-dimensional (circular) restricted problem. The mass of Pluto and the eccentricity of Neptune's orbit are ignored in this approximation. Significant features of the problem appear to be the presence of two critical arguments and the possibility that the orbit may be related to a periodic orbit of the third kind.

Monte Carlo Algorithms for Moments of Transition Arrays

1988 ◽  
Vol 102 ◽  
pp. 79-81
Author(s):  
A. Goldberg ◽  
S.D. Bloom
Keyword(s):  
Monte Carlo ◽  
State Vector ◽  
Basis Vector ◽  
Collective State ◽  
Dispersion Characteristics ◽  
Dipole Strength ◽  
The Third ◽  
Monte Carlo Algorithms ◽  
Third Moment ◽  
Very High

AbstractClosed expressions for the first, second, and (in some cases) the third moment of atomic transition arrays now exist. Recently a method has been developed for getting to very high moments (up to the 12th and beyond) in cases where a “collective” state-vector (i.e. a state-vector containing the entire electric dipole strength) can be created from each eigenstate in the parent configuration. Both of these approaches give exact results. Herein we describe astatistical(or Monte Carlo) approach which requires onlyonerepresentative state-vector |RV> for the entire parent manifold to get estimates of transition moments of high order. The representation is achieved through the random amplitudes associated with each basis vector making up |RV>. This also gives rise to the dispersion characterizing the method, which has been applied to a system (in the M shell) with≈250,000 lines where we have calculated up to the 5th moment. It turns out that the dispersion in the moments decreases with the size of the manifold, making its application to very big systems statistically advantageous. A discussion of the method and these dispersion characteristics will be presented.

Probe size and 5th-order aberration

1987 ◽  
Vol 45 ◽  
pp. 134-135 ◽  
Author(s):  
Zhifeng Shao
Keyword(s):  
Electron Probe ◽  
Spherical Aberration ◽  
Wave Length ◽  
Cylindrical Symmetry ◽  
Electron Wave ◽  
Third Order ◽  
The Third ◽  
Probe Radius ◽  
Small Probe ◽  
Probe Size

A small electron probe has many applications in many fields and in the case of the STEM, the probe size essentially determines the ultimate resolution. However, there are many difficulties in obtaining a very small probe.Spherical aberration is one of them and all existing probe forming systems have non-zero spherical aberration. The ultimate probe radius is given byδ = 0.43Csl/4ƛ3/4where ƛ is the electron wave length and it is apparent that δ decreases only slowly with decreasing Cs. Scherzer pointed out that the third order aberration coefficient always has the same sign regardless of the field distribution, provided only that the fields have cylindrical symmetry, are independent of time and no space charge is present. To overcome this problem, he proposed a corrector consisting of octupoles and quadrupoles.

Sign in / Sign up

Export Citation Format

Share Document