Within this paper an adaptive approach for parallel simulation of SystemC RTL models on future many-core architectures like the Single-chip Cloud Computer (SCC) from Intel is presented. It is based on a configurable p...
详细信息
ISBN:
(纸本)9781479957934
Within this paper an adaptive approach for parallel simulation of SystemC RTL models on future many-core architectures like the Single-chip Cloud Computer (SCC) from Intel is presented. It is based on a configurable parallel SystemC kernel that preserves the partial order defined by the SystemC delta cycles while avoiding global synchronization as far as possible. The underlying algorithm relies on a classification of existing communication relations between parallel processes. The type and topology of communication relations determines the type and number of causality conditions that need to be fulfilled during runtime. The parallel kernel is complemented by an automated tool flow that allows detecting relevant model-specific properties, performing a fine-grained model partitioning, classifying communication relations and configuring the kernel. Experiments by means of a MPSoC model show, that pure local synchronization can provide significant performance gains compared to global synchronization. Furthermore, the combination of local synchronization with fine-grained partitioning provides additional degrees of freedom for optimization.
In this paper,we discuss the conforming finite element method for a modified interior transmission eigenvalues *** present a complete theoretical analysis for the method,including the a priori and a posteriori error *...
详细信息
In this paper,we discuss the conforming finite element method for a modified interior transmission eigenvalues *** present a complete theoretical analysis for the method,including the a priori and a posteriori error *** theoretical analysis is conducted under the assumption of low regularity on the *** prove the reliability and efficiency of the a posteriori error estimators for eigenfunctions up to higher order terms,and we also analyze the reliability of estimators for ***,we report numerical experiments to show that our posteriori error estimator is effective and the approximations can reach the optimal convergence *** numerical results also indicate that the conforming finite element eigenvalues approximate the exact ones from below,and there exists a monotonic relationship between the conforming finite element eigenvalues and the refractive index through numerical experiments.
In this paper,we study some basic analytic properties of a sequence of func-tions {Sμ,σ/n} that is directly derived in an adaptive algorithm originating from the clas-sical score-based secretary *** specifically,we ...
详细信息
In this paper,we study some basic analytic properties of a sequence of func-tions {Sμ,σ/n} that is directly derived in an adaptive algorithm originating from the clas-sical score-based secretary *** specifically,we show that:*** uniqueness of maximum points of the function sequence {Sμ,σ/n };*** maximum point sequence of{Sμ,σ/n} monotone increases to infinity as n tends to *** of the proofs are elementary but nontrivial.
To reduce the computational complexity and enhance the convergence rate, this article presents set-membership least mean square adaptive algorithms based on an error-estimation time-varying bound method. The bound is ...
详细信息
To reduce the computational complexity and enhance the convergence rate, this article presents set-membership least mean square adaptive algorithms based on an error-estimation time-varying bound method. The bound is constituted by the estimation error for the previous iteration and a time-varying error adjustment factor. The set-membership (SM) method utilizes the estimation error for the current iteration and the bound to determine whether to update the weight vector. When the estimation error is larger than the bound, the weight vector is updated;otherwise, no updating is required. Then, by utilizing a nonlinear function between the step size and the estimation error, the step size is modified to further enhance the convergence rate. Compared to the traditional set-membership normalized least mean square algorithms, the simulation results show that the proposed algorithms have the following advantages: (1) fast convergence with low computational costs, (2) maintaining low, steady-state mean square error, (3) enhancing noise resistance in low-SNR environments and (4) estimating the SM bound in noisy environments without requiring noise power estimation.
Purpose: To assess the inter -rater test reliability of the EyeSpy Mobile visual acuity smartphone algorithm when administered to children by eye professionals and parent volunteers. Patients and Methods: Visual acuit...
详细信息
Purpose: To assess the inter -rater test reliability of the EyeSpy Mobile visual acuity smartphone algorithm when administered to children by eye professionals and parent volunteers. Patients and Methods: Visual acuity test -retest results were analyzed for 106 children assigned to one of three different screenings: (1) An eye technician and pediatric ophthalmologist using their typical visual acuity testing method on a M&S computer;(2) An eye technician and pediatric ophthalmologist using EyeSpy Mobile;(3) An eye technician and parent volunteer using EyeSpy Mobile. Results: All three phases demonstrated a strong agreement between the two testers, with mean test -retest equivalency results within 0.05 logMAR (2.5 letters, 90% CI). Whether testing using their typical technique on an M&S computer or using EyeSpy Mobile, eye professionals obtained statistically closer mean test -retest results than parent volunteers by 1 letter, with equivalency results within 0.03 logMAR (1.5 letters, 90% CI). Conversely, the number of retests within 2 vision lines was statistically greater when EyeSpy mobile was used by parents as compared to eye professional's customary technique on the M&S computer. Conclusion: EyeSpy Mobile provides clinically useful visual acuity test -retest results even when used by first-time parent volunteers. adaptive visual acuity algorithms have the potential to improve reliability, lessen training requirements, and expand the number of vision screening volunteers in community settings.
Formation flight of unmanned aerial vehicles (UAVs) utilizes reconfiguration procedures to handle a variety of emergencies, such as collision avoidance, malfunctions, fuel savings, and member replacement. As UAVs have...
详细信息
Formation flight of unmanned aerial vehicles (UAVs) utilizes reconfiguration procedures to handle a variety of emergencies, such as collision avoidance, malfunctions, fuel savings, and member replacement. As UAVs have limited computing power and energy resources, it is necessary to optimize the control inputs to reduce the distance travelled by UAVs while reducing the computing costs during formation reconfiguration. In this paper, the problem of multi-UAV reconfiguration is decoupled into two stages: task assignment and control input optimization of UAVs. For a solution to the above problem, we propose an adaptive hybrid particle swarm optimization and differential evolution algorithm (AHPSODE) to optimize minimize the distance of the total movement and reduce the computing cost of formation reconfiguration. Based on the idea of receding horizon control (RHC) and the nonlinear model of multi-UAV formation reconfiguration, an RHC controller using AHPSODE is designed to optimize the control input of the UAV group to obtain the shortest movement distance, and this method can reduce the computation time. We use the CEC 2017 test suit to test the performance of our proposed AHPSODE algorithm, and simulate the AHPSODE-based RHC controller to manage formation reconfiguration. The results show that our proposed AHPSODE performed well in convergence and accuracy and the RHC controller is effective.
The problem for useful signal restoring against the background of additive noise in complex cases arising during the processing of biomedical signals is considered. In particular, the possibility of effective suppress...
详细信息
ISBN:
(纸本)9798350368185;9798350368178
The problem for useful signal restoring against the background of additive noise in complex cases arising during the processing of biomedical signals is considered. In particular, the possibility of effective suppression of harmonic interference concentrated in the loaded frequency band of the useful signal and suppression of random interference of a limited level with an unknown distribution law is being investigated. The results of experimental studies on model and real data are presented, confirming the effectiveness of the developed algorithms in solving current problems of practical medicine.
A new fuzzy adaptive second-order terminal sliding mode controller (FASOTSMC) is designed for the manipulator system with external disturbance and system uncertainty, in order to achieve fast convergence of trajectory...
详细信息
ISBN:
(纸本)9798350344738;9798350344721
A new fuzzy adaptive second-order terminal sliding mode controller (FASOTSMC) is designed for the manipulator system with external disturbance and system uncertainty, in order to achieve fast convergence of trajectory tracking error and ideal tracking accuracy. Firstly, nonlinear hyperplane is used instead of linear hyperplane to improve the convergence rate of tracking error. Secondly, in order to avoid chattering, the discontinuous terms are hidden in the integral symbol, and a continuous second-order control law is obtained. At the same time, fuzzy algorithm is used to determine sliding mode surface parameters and adaptive algorithm is used to compensate external disturbance and system uncertainty, and Lyapunov stability theory is used to prove that the control system has convergence in finite time. Finally, the comparative simulation analysis is carried out. The results show that the control algorithm can realize the trajectory tracking control of the manipulator with high precision in limited time and complex factors.
Feature points loss and images mismatch in the variation of light intensity, weak texture and large angle rotation for the feature points extraction of ORB-SLAM2 are severe. To deal with the problem, a feature points ...
详细信息
Feature points loss and images mismatch in the variation of light intensity, weak texture and large angle rotation for the feature points extraction of ORB-SLAM2 are severe. To deal with the problem, a feature points extraction algorithm based on adaptive information entropy, i.e., adaptive Information Entropy Feature (AIEF) algorithm is proposed. According to the information entropy, the image blocks with less information are removed and those with more texture image information and larger gradient are selected. Then an adaptive algorithm is used to automatically calculate the optimal threshold of the image information entropy. The image blocks are homogenized to avoid that the extracted feature points are too dense and getting stuck is prevented, which makes the algorithm more robust. Finaly validation is performed using the Oxford standard data set and the performances of the AIEF algorithm are compared with those of the SIFT, SURF, and ORB-SLAM2 algorithms. Experimental results on the Oxford standard data set demonstrate that the AIEF algorithm outperforms the traditional counterparts in terms of processing time, number of feature points, correct matching number and correct matching rate.
We propose and analyze residual-based a posteriori error estimator for a new finite element method for the time-dependent Ginzburg-Landau equations with the temporal gauge of superconductivity. The magnetic potential ...
详细信息
We propose and analyze residual-based a posteriori error estimator for a new finite element method for the time-dependent Ginzburg-Landau equations with the temporal gauge of superconductivity. The magnetic potential variable is approximated by H(del x;Omega)-conforming element and the scalar order parameter is approximated by the H-1(Omega)-conforming element. Using the dual problem of a linearization of the original problem, we prove the reliability of the a posteriori error estimator, and an adaptive algorithm with the temporal and spatial refining and coarsening steps is then proposed. Numerical results are presented for illustrating the a posteriori error estimator and the adaptive algorithm in convex and nonconvex domains.
暂无评论