scholarly journals On recursive stopping of decimation of discrete-time bandlimited signals

2011 ◽  
Vol 52 ◽  
Author(s):  
Rimantas Pupeikis

For each non-decimated as well as decimated realization discrete-time Fourier series coefficient values, located at Nyquist frequency are calculated, using original speedy recursive expressions based on reverse order processing of the given realizations. The criterion for stopping of multifold decimation of discrete-time bandlimited signals has been developed. The simulation results for the bandlimited signal with a triangularshaped spectrum are presented.  

Author(s):  
Meng-Shiun Tsai ◽  
Ying-Che Huang

In this paper, an integrated acceleration/deceleration with dynamics interpolation scheme is proposed to confine the maximum contour error at the junction of linear junction. The dynamic contour error equation is derived analytically and then it is utilized for the interpolation design. Based on the derived formulations which could predict the command and dynamic errors, the advanced interpolation design could adjust the connecting velocity of the two blocks to confine the overall contour errors under the given tolerance. Simulation results validate the proposed algorithm can achieve higher accurate trajectory as compared to the other interpolation algorithm proposed in the past.


2020 ◽  
Vol 8 (6) ◽  
pp. 5186-5192

In electric power plant operation, Economic Environmental Dispatch (EED) of a thermal-wind is a significant chore to involve allocation of production amongst the running units so the price, NOx extraction status and SO2 extraction status are enhanced concurrently whilst gratifying each and every experimental constraint. This is an exceedingly controlled multiobjective optimizing issue concerning contradictory objectives having Primary and Secondary constraints. For the given work, a Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is recommended for taking care of EED issue. In simulation results that are obtained by applying the two test systems on the proposed scheme have been evaluated against Strength Pareto Evolutionary Algorithm 2 (SPEA 2).


2020 ◽  
Author(s):  
Fayyaz Minhas ◽  
Dimitris Grammatopoulos ◽  
Lawrence Young ◽  
Imran Amin ◽  
David Snead ◽  
...  

AbstractOne of the challenges in the current COVID-19 crisis is the time and cost of performing tests especially for large-scale population surveillance. Since, the probability of testing positive in large population studies is expected to be small (<15%), therefore, most of the test outcomes will be negative. Here, we propose the use of agglomerative sampling which can prune out multiple negative cases in a single test by intelligently combining samples from different individuals. The proposed scheme builds on the assumption that samples from the population may not be independent of each other. Our simulation results show that the proposed sampling strategy can significantly increase testing capacity under resource constraints: on average, a saving of ~40% tests can be expected assuming a positive test probability of 10% across the given samples. The proposed scheme can also be used in conjunction with heuristic or Machine Learning guided clustering for improving the efficiency of large-scale testing further. The code for generating the simulation results for this work is available here: https://github.com/foxtrotmike/AS.


2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Mohammed El Habib Souidi ◽  
Songhao Piao

Game Theory is a promising approach to acquire coalition formations in multiagent systems. This paper is focused on the importance of the distributed computation and the dynamic formation and reformation of pursuit groups in pursuit-evasion problems. In order to address this task, we propose a decentralized coalition formation algorithm based on the Iterated Elimination of Dominated Strategies (IEDS). This Game Theory process is common to solve problems requiring the withdrawal of dominated strategies iteratively. Furthermore, we have used the Markov Decision Process (MDP) principles to control the motion strategy of the agents in the environment. The simulation results demonstrate the feasibility and the validity of the given approach in comparison with different decentralized methods.


Sensors ◽  
2019 ◽  
Vol 19 (3) ◽  
pp. 633
Author(s):  
Semyoung Oh ◽  
Young-Dam Kim ◽  
Daejin Park

This paper proposes an optimization algorithm to determine the optimal coherent combination candidates of distributed local beams in a wireless sensor network. The beams are generated from analog uniform linear arrays of nodes and headed toward the random directions due to the irregular surface where the nodes are mounted. Our algorithm is based on one of the meta-heuristic schemes (i.e., the single-objective simulated annealing) and designed to solve the objective of minimizing the average interference-to-noise ratio (INR) under the millimeter wave channel, which leads to the reduction of sidelobes. The simulation results show that synthesizing the beams on the given system can form a deterministic mainlobe with considerable and unpredictable sidelobes in undesired directions, and the proposed algorithm can decrease the average INR (i.e., the average improvement of 12.2 dB and 3.1 dB are observed in the directions of π 6 and 2 π 3 , respectively) significantly without the severe loss of signal-to-noise ratio (SNR) in the desired direction.


1985 ◽  
Vol 107 (4) ◽  
pp. 324-331 ◽  
Author(s):  
D. B. Cherchas ◽  
A. Abdelmessih ◽  
M. Townsend

A direct digital control algorithm for control of dry bulb temperature in a single environmental space is developed. The algorithm is based on a bilinear mathematical model, developed in the paper, of the response of the space dry bulb temperature and moisture content. The algorithm is somewhat unique in that it includes feedback and feedforward terms in a manner respecting the bilinear nature of the controlled process and as well, minimizes a practical performance index. The discrete time form of the algorithm is presented and simulation results given.


Author(s):  
Ljubinko B Kevac ◽  
Mirjana M Filipovic ◽  
Ana M Djuric

Characteristic construction of cable-suspended parallel robot of artificial muscle, which presents an artificial forearm, is analyzed and synthesized. Novel results were achieved and presented. Results presented in this paper were initially driven to recognize and mathematically define undefined geometric relations of the artificial forearm since it was found that they strongly affect the dynamic response of this system. It gets more complicated when one has more complex system, which uses more artificial muscle subsystems, since these subsystems couple and system becomes more unstable. Unmodeled or insufficiently modeled dynamics can strongly affect the system’s instability. Because of that, the construction of this system and its new mathematical model are defined and presented in this paper. Generally, it can be said that the analysis of geometry of selected mechanism is the first step and very important step to establish the structural stability of these systems. This system is driven with two actuators, which need to work in a coordinated fashion. The aim of this paper is to show the importance of the geometry of this solution, which then strongly affects the system’s kinematics and dynamics. To determine the complexity of this system, it was presumed that system has rigid cables. Idea is to show the importance of good defined geometry of the system, which gives good basis for the definition of mathematical model of the system. Novel program package AMCO, artificial muscle contribution, was defined for the validation of the mathematical model of the system and for choice of its parameters. Sensitivity of the system to certain parameters is very high and hence analysis of this system needs to be done with a lot of caution. Some parameters are very influential on the possible implementation of the given task of the system. Only after choosing the parameters and checking the system through certain simulation results, control structure can be defined. In this paper, proportional–derivative controller was chosen.


Mathematics ◽  
2019 ◽  
Vol 7 (7) ◽  
pp. 651
Author(s):  
Pyotr Ivanshin

We prove the existence and uniqueness of the solution of the problem of the minimum norm function ∥ · ∥ ∞ with a given set of initial coefficients of the trigonometric Fourier series c j , j = 0 , 1 , … , 2 n . Then, we prove the existence and uniqueness of the solution of the nonnegative function problem with a given set of coefficients of the trigonometric Fourier series c j , j = 1 , … , 2 n for the norm ∥ · ∥ 1 .


Axioms ◽  
2020 ◽  
Vol 9 (3) ◽  
pp. 88
Author(s):  
David Levin

In some applications, one is interested in reconstructing a function f from its Fourier series coefficients. The problem is that the Fourier series is slowly convergent if the function is non-periodic, or is non-smooth. In this paper, we suggest a method for deriving high order approximation to f using a Padé-like method. Namely, we do this by fitting some Fourier coefficients of the approximant to the given Fourier coefficients of f. Given the Fourier series coefficients of a function on a rectangular domain in Rd, assuming the function is piecewise smooth, we approximate the function by piecewise high order spline functions. First, the singularity structure of the function is identified. For example in the 2D case, we find high accuracy approximation to the curves separating between smooth segments of f. Secondly, simultaneously we find the approximations of all the different segments of f. We start by developing and demonstrating a high accuracy algorithm for the 1D case, and we use this algorithm to step up to the multidimensional case.


Sign in / Sign up

Export Citation Format

Share Document