We propose a global optimal fuzzy tracking controller for continuous time-invariant fuzzy tracking system to trace moving or model-following targets under an infinite-horizon (time) quadratic performance index. We als...
详细信息
ISBN:
(纸本)0780358775
We propose a global optimal fuzzy tracking controller for continuous time-invariant fuzzy tracking system to trace moving or model-following targets under an infinite-horizon (time) quadratic performance index. We also demonstrate that the stability of the closed-loop fuzzy tracking systems can be ensured by the designed optimal fuzzy tracking controllers. One example is given to illustrate the proposed optimal fuzzy tracker design scheme and to show the proved stability property.
The processing elements, logic resources, and on-chip block RAMs of modern FPGAs can not only be used for prototyping custom hardware modules, but also for parallel processing purposes by implementing multiple process...
详细信息
ISBN:
(纸本)1424408989
The processing elements, logic resources, and on-chip block RAMs of modern FPGAs can not only be used for prototyping custom hardware modules, but also for parallel processing purposes by implementing multiple processors for a single task. This paper compares the performance of a single-processor implementation with two types of dual-processor implementations for a widely used radix-2 n-point FFT algorithm (Kooley and Tuckey, 1965) in terms of processing speed and FPGA resource utilization. In the first dual-processor implementation, the partitioning is performed based on the computation complexity - O(nlog(n)) of the radix-2 FFT algorithm. In the second implementation, the partitioning is based on a detailed profiling procedure applied to each line of the code in the single-processor implementation. Results obtained show that the speedup of the first dual-processor implementation is on average 1.3times faster than the single-processor implementation, whereas the second dual-processor implementation is about 1.9times faster which is very close to the expected speedup. This result shows that detailed profiling is crucial in identifying the bottlenecks of an algorithm (i.e., all the factors are taken into consideration) and consequently the algorithm can be efficiently mapped on a multiprocessor system based on the correct decision
Rough sets theory is often used for extracting if-then rules from categorical data sets with an objective function. In the conventional rough sets theory, the decision matrix method is known as one of the method extra...
详细信息
Rough sets theory is often used for extracting if-then rules from categorical data sets with an objective function. In the conventional rough sets theory, the decision matrix method is known as one of the method extracting the rules. However, devising an efficient algorithm for the decision matrix method has seldom been reported to date. Consequently, this paper studies the process of reducing the decision matrix, finds several properties useful for the rule extraction, and proposes an effective algorithm for the extraction. The algorithm is implemented in a piece of software and a simulation experiment is conducted to compare the reduced time of the software base on the proposed algorithm with that of LEM2 software which is open to the public on the Internet, and is widely used throughout the world. As the results, the newly developed software is confirmed to perform exceptionally well under taxing conditions.
Fault-tolerant software approaches require the users to writer N versions of the algorithm which should be as different as possible to avoid correlated errors (where all or most versions fail with the same input value...
详细信息
Fault-tolerant software approaches require the users to writer N versions of the algorithm which should be as different as possible to avoid correlated errors (where all or most versions fail with the same input value). The degree of difference is known as the diversity level of the versions. A new way to improve diversity is proposed. It consists of taking advantage of the higher degree of freedom provided by parallel implementations of an algorithm. Many paradigms for parallel algorithms have been developed, including divide-and-conquer, pipelined/systolic, graph function, and compute-aggregate-broadcast. By writing an algorithm using different parallel paradigms its diversity level can be increased. software metrics can be used to quantify this level of difference.< >
In the paper, the third stages dichotomous-differential method of digital images compression is carried out. The advantages on compression level are described.
In the paper, the third stages dichotomous-differential method of digital images compression is carried out. The advantages on compression level are described.
The distortion of antenna reflector can degrade the antenna performances obviously with the higher work frequency band. A new algorithm used for accurately analyzing the distorted reflectors and computing the axial, n...
详细信息
The distortion of antenna reflector can degrade the antenna performances obviously with the higher work frequency band. A new algorithm used for accurately analyzing the distorted reflectors and computing the axial, normal and radial deviations of distorted surface is developed. The analysis method with simulation values only one third of analysis results of ANSYS software is verified by calculating surface errors and gain losses of a 7.3-m parabolic antenna under different working conditions and comparing the results of accurate algorithm and ANSYS software method. Its application in both large space and ground antennas will greatly improve the design efficiency, reduce cost, and also provide the detailed precise distortion information for electrical designers.
This work gives an overview of real-time visualisation algorithms developed under the EC-funded project Multimod to support a novel paradigm for the virtual representation of musculo-skeletal structures. These algorit...
详细信息
This work gives an overview of real-time visualisation algorithms developed under the EC-funded project Multimod to support a novel paradigm for the virtual representation of musculo-skeletal structures. These algorithms are fully integrated into the Multimod Application Framework (MAF), an open-source freely-available software framework for the rapid development of medical visualisation applications. MAF is based on the visualisation toolkit (VTK) and other specialised toolkits, e.g. for image registration and segmentation, collision detection or numerical computation. MAF provides a range of high-level components that can be easily combined for rapid construction of visualisation applications that support synchronised views. The majority of algorithms available within the standard underlying MAF toolkits were frequently either too slow or too general for our purposes. We have thus implemented computationally efficient versions of existing algorithms, e.g. for surface and volume rendering, and more importantly, developed new techniques, e.g. for X-ray rendering and designing volume rendering transfer functions. To achieve interactive rendering we have employed a scheme for space partitioning. The emphasis is on exploiting the characteristics of medical datasets (e.g. density value homogeneity) but further utilising the hardware-accelerated capabilities of modern graphics cards. In this context, calculations are moved into hardware as appropriate while avoiding dependency on specialised features of particular manufacturers so as to ensure real code portability.
This paper outlines the procedure for validating cryptographic modules that implement Post Quantum Cryptography (PQC) algorithms. It highlights public key encryption schemes, particularly PKE as well as the Module Lat...
详细信息
ISBN:
(数字)9798350351972
ISBN:
(纸本)9798350351989
This paper outlines the procedure for validating cryptographic modules that implement Post Quantum Cryptography (PQC) algorithms. It highlights public key encryption schemes, particularly PKE as well as the Module Lattice based Key Encapsulation Mechanism (KEM) for CRYSTALS Kyber, both of which are included in the proposed standard NIST FIPS 203. The validation process entails submitting test vectors to the Implementation Under Test (IUT), aligning with NIST's validation methods, akin to those used for various FIPS approved algorithms like AES and SHA3. These PQC algorithms can be implemented by the vendors across various platforms, including hardware, software, and firmware. The test vectors generated act as basis for the Cryptographic Module Validation Testing (CMVT) to authenticate encryption components that incorporate these PQC algorithms.
This paper presents a novel method for finding frequent items in data streams using a homogeneous counter-based hardware array. The presented array is a close hardware adaptation of the well-known Space-Saving algorit...
详细信息
ISBN:
(数字)9781728197104
ISBN:
(纸本)9781728197111
This paper presents a novel method for finding frequent items in data streams using a homogeneous counter-based hardware array. The presented array is a close hardware adaptation of the well-known Space-Saving algorithm. The array can identify frequent items with frequencies larger than a specified threshold with a single pass through the input dataset. When implemented on an Intel Arria 10 FPGA, 40% of the FPGA resources are sufficient for 1000+ hardware counters. This is enough to guarantee the identification of all frequent items with frequency thresholds as low as 0.1% of the size of any dataset, regardless of the input distribution. Compared to other hardware implementations, the presented architecture is the fastest on average, and the first to retain the guarantee property of the Space-Saving algorithm on the reported frequent items. In addition, test results on synthetic and real datasets showed that the presented method can achieve more than 11x throughput speedup compared to software implementations of the algorithm and up to 50% better precision compared to other hardware implementations.
暂无评论