Using the proposed factorizations of discrete cosine transform (DCT) matrices, fast and recursive algorithms are stated. In this paper, signal flow graphs for the n-point DCT II and DCT IV algorithms are introduced. T...
详细信息
Using the proposed factorizations of discrete cosine transform (DCT) matrices, fast and recursive algorithms are stated. In this paper, signal flow graphs for the n-point DCT II and DCT IV algorithms are introduced. The proposed algorithms yield exactly the same results as with standard DCT algorithms but are faster. The arithmetic complexity and stability of the algorithms are explored, and improvements of these algorithms are compared with previously existing fast and stable DCT algorithms. A parallel hardware computing architecture for the DCT II algorithm is proposed. The computing architecture is first designed, simulated, and prototyped using a 40-nm Xilinx Virtex-6 FPGA and thereafter mapped to custom integrated circuit technology using 0.18-m CMOS standard cells from Austria Micro Systems. The performance trade-off exists between computational precision, chip area, clock speed, and power consumption. This trade-off is explored in both FPGA and custom CMOS implementation spaces. An example FPGA implementation operates at clock frequencies in excess of 230MHz for several values of system word size leading to real-time throughput levels better than 230 million 16-point DCTs per second. Custom CMOS-based results are subject to synthesis and place-and-route steps of the design flow. Physical silicon fabrication was not conducted due to prohibitive cost.
The process of optimization of chemical/ biochemical processes can often involve multiple conflicting objectives. This gives rise to a class of problems called multi-objective optimization problems. Solving such probl...
详细信息
The process of optimization of chemical/ biochemical processes can often involve multiple conflicting objectives. This gives rise to a class of problems called multi-objective optimization problems. Solving such problems results in an infinite set of points, the Pareto set, which includes all the solutions in which no objective can be improved without worsening at least one other objective. In this paper, we propose a new strategy that is inspired by branching phenomena in nature for exploring the objective space to obtain a representation of the Pareto set. The algorithm starts from a single point in the objective space, and systematically constructs branches towards the Pareto front by solving correspondingly-modified subproblems. This process continues till points that lie at the Pareto front are obtained. This way, it ensures that no region in the objective space gets explored more than a single time. Additionally, using a proximity parameter, the branches density can be controlled, consequently leading to controlling the resolution of the Pareto front. The proposed method has been applied to a numerical bi-objective optimization problem as well as the problem of the bi-objective control of a William-Otto reactor. Results show that the new algorithm has managed to obtain a Pareto front with adaptive resolution where the areas with high trade-offs are represented with higher points density.
We construct and study a mathematical model for the distribution of information transmission resource in a multiservice access node. The model considers an arbitrary number of multimedia traffic streams, which differ ...
详细信息
We construct and study a mathematical model for the distribution of information transmission resource in a multiservice access node. The model considers an arbitrary number of multimedia traffic streams, which differ in the intensity of claims arrival, the amount of resource used to service one claim, and the resource occupation time. The time intervals between the arrival of claims have an exponential distribution with a parameter depending on the number of claims being serviced in the considered flow. We construct a recursive algorithm for evaluating the characteristics. Relations are established between the integral and flow characteristics of the quality of service for the claims. We construct an efficient algorithm for estimating the amount of resource required to service given traffic flows with required quality. The efficiency of the computational procedure is achieved as a result of organizing recursion over the volume of resource and the use of normalized values of state probabilities. We consider a solution to the problem of estimating the required amount of resource for a multiservice node model, which allows to use resource reservation and dynamic distribution mechanisms when servicing elastic traffic. We show numerical examples that illustrate the features of the implementation of the constructed computational procedures.
We construct a one-parameter family of lattice models starting from a two-dimensional rational conformal field theory on a torus with a regular lattice of holes, each of which is equipped with a conformal boundary con...
详细信息
We construct a one-parameter family of lattice models starting from a two-dimensional rational conformal field theory on a torus with a regular lattice of holes, each of which is equipped with a conformal boundary condition. The lattice model is obtained by cutting the surface into triangles with clipped-off edges using open channel factorisation. The parameter is given by the hole radius. At finite radius, high energy states are suppressed and the model is effectively finite. In the zero-radius limit, it recovers the CFT amplitude exactly. In the touching hole limit, one obtains a topological field theory. If one chooses a special conformal boundary condition which we call 'cloaking boundary condition', then for each value of the radius the fusion category of topological line defects of the CFT is contained in the lattice model. The fact that the full topological symmetry of the initial CFT is realised exactly is a key feature of our lattice models. We provide an explicit recursive procedure to evaluate the interaction vertex on arbitrary states. As an example, we study the lattice model obtained from the Ising CFT on a torus with one hole, decomposed into two lattice cells. We numerically compare the truncated lattice model to the CFT expression obtained from expanding the boundary state in terms of the hole radius and we find good agreement at intermediate values of the radius.
An algorithm of the recursive parametric identification is analyzed, oriented to applying within noise-free systems. Its analytical form, conditions of the convergence and applications are specified. Theoretical infer...
详细信息
ISBN:
(纸本)9781479943159
An algorithm of the recursive parametric identification is analyzed, oriented to applying within noise-free systems. Its analytical form, conditions of the convergence and applications are specified. Theoretical inferences are confirmed by simulation results.
We construct and study a mathematical model of the distribution of the resource for transmitting information for an isolated cell of an LTE standard mobile network with the joint servicing of heterogeneous traffic fro...
详细信息
We construct and study a mathematical model of the distribution of the resource for transmitting information for an isolated cell of an LTE standard mobile network with the joint servicing of heterogeneous traffic from Internet of Things devices. The model considers an arbitrary number of streams of multimedia traffic, which differ in the intensity of the arrival of communication sessions, the size of the resource used to service one session, the time of resource occupation, and the probability of a session being allowed to transmit the information stream. We determine quality of service characteristics for incoming sessions and construct an effective algorithm for estimating the amount of resource required to service given traffic flows with required quality. Efficiency of the algorithm is achieved as a result of the implementation of recursion with respect to the available resource and the use of normalized probabilities of model states during calculations. The algorithm is computationally stable and allows to solve the resource estimation problem many times faster than traditional approaches based on calculating the probabilities of all states for each resource value and their subsequent normalization. We give numerical examples illustrating the implementation features of developed computational procedures.
The existing inverse-free incremental learning algorithm for the regularized extreme learning machine (ELM) was based on an inverse-free algorithm to update the regularized pseudo-inverse, which was deduced from an in...
详细信息
The existing inverse-free incremental learning algorithm for the regularized extreme learning machine (ELM) was based on an inverse-free algorithm to update the regularized pseudo-inverse, which was deduced from an inverse-free recursive algorithm to update the inverse of a Hermitian matrix. Before that recursive algorithm was applied in the existing inverse-free ELM, its improved version had been utilized in previous literatures. Then from the improved recursive algorithm to update the inverse, we deduce a more efficient inverse-free algorithm to update the regularized pseudo-inverse, from which we propose the inversefree incremental ELM algorithm based on regularized pseudo-inverse. Usually the above-mentioned inverse is smaller than the pseudo-inverse, while in the processor units with limited precision, the recursive algorithm to update the inverse may introduce numerical instabilities. Then to further reduce the computational complexity, we also propose the inverse-free incremental ELM algorithm based on the LDLT factors of the inverse, where the LDLT factors are updated iteratively by the inverse LDLT factorization. With respect to the existing inverse-free ELM, the proposed ELM based on regularized pseudo-inverse and that based on LDLT factors are expected to require only 3/8+M and 1/8+M of complexities, respectively, where M is the output node number. The numerical experiments show that both the proposed ELM algorithms significantly accelerate the existing inverse-free ELM, and the speedup in training time is not less than 1.41. On the Modified National Institute of Standards and Technology (MNIST) Dataset, usually the proposed algorithm based on LDLT factors is much faster than that based on regularized pseudo-inverse. On the other hand, in the numerical experiments, the original ELM, the existing inverse-free ELM and the proposed two ELM algorithms achieve the same performance in regression and classification, and result in the same solutions, which includ
This paper addresses practical implementation of summing out, expanding, and reordering of messages in Local Conditioning (LC) for undirected networks. In particular, incoming messages conditioned on potentially diffe...
详细信息
ISBN:
(纸本)9783030026837;9783030026820
This paper addresses practical implementation of summing out, expanding, and reordering of messages in Local Conditioning (LC) for undirected networks. In particular, incoming messages conditioned on potentially different subsets of the receiving node's relevant set must be expanded to be conditioned on this relevant set, then reordered so that corresponding columns of the conditioned matrices can be fused through element-wise multiplication. An outgoing message is then reduced by summing out loop cutset nodes that are upstream of the outgoing edge. The emphasis on implementation is the primary contribution over the theoretical justification of LC given in Fay et al. Nevertheless, the complexity of Local Conditioning in grid networks is still no better than that of Clustering.
The paper pays attention to particularities concerned with the defuzzification procedure in adaptive neural network based fuzzy inference systems. Specifically, the problem of constructing recursive parameter estimati...
详细信息
ISBN:
(纸本)9781538651421
The paper pays attention to particularities concerned with the defuzzification procedure in adaptive neural network based fuzzy inference systems. Specifically, the problem of constructing recursive parameter estimation algorithms is considered with regard to their convergence and stability. In the combination with various forms of the quadratic criterion, such an approach enables on to obtain strongly consistent estimation algorithms under essential generality of modeled system description;and the convergence properties are demonstrated in the comparison with conventional algorithms.
Tire-road friction is the most important characteristic defining the planar dynamics of wheeled vehicles. It has consequences on the drivability, stability and tuning of the active vehicle dynamics control systems. Th...
详细信息
Tire-road friction is the most important characteristic defining the planar dynamics of wheeled vehicles. It has consequences on the drivability, stability and tuning of the active vehicle dynamics control systems. This paper proposes two online friction estimation methods designed for the adaptation of vehicle dynamics control algorithms. The problem is framed as a classification problem where inertial measurements are used to discriminate between high and low friction regimes. The first method merges a recursive least-squares (RLS) algorithm with a heuristic bistable logic to classify the friction condition and promptly react to its changes. The second method runs a classification algorithm on the slip-acceleration characteristic. Both methods simultaneously account for the longitudinal and lateral dynamics and are tested on experimental data. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
暂无评论