In our previous work, we developed a new actuator placement algorithm that is capable of selecting the best actuator placement for active noise control problems over a broad band of frequencies. The actuator selection...
详细信息
In our previous work, we developed a new actuator placement algorithm that is capable of selecting the best actuator placement for active noise control problems over a broad band of frequencies. The actuator selection algorithm is based on a novel extension of the Householder QR subset selection algorithm. The QR algorithm uses the l(2) matrix norm as a performance measure. In this paper, numerical results generated by that algorithm are compared with numerical results generated using five different performance measures. These measures, which are based on different matrix norms and functions of the actuator frequency responses, yield actuator placements that result in active noise control systems with improved performance and robustness.
Geometric dilution of precision (GDOP) has been considered as a criterion for the selection of GPS satellites. The benefit of the eigenvalue approach is that the relationship between GDOP and observation directions ca...
详细信息
Geometric dilution of precision (GDOP) has been considered as a criterion for the selection of GPS satellites. The benefit of the eigenvalue approach is that the relationship between GDOP and observation directions can be expressed explicitly. In the present paper, this benefit is used to propose a novel geometric interpretation of GDOP by using an eigenvalue approach. Based on this interpretation, two simple methods of selecting GPS satellites are derived which do not need matrix inversion calculations. (B.J.)
In this paper, algorithmic approaches to enhance damage detection and model refinement capability are developed for cases in which experimental data from multiple tests are available. The tests may include both multip...
详细信息
In this paper, algorithmic approaches to enhance damage detection and model refinement capability are developed for cases in which experimental data from multiple tests are available. The tests may include both multiple vibration tests and multiple static load tests. The use of multitest measurements are shown to be one method to address a part of the incomplete measurement problem common to system health monitoring and model refinement, namely, the mismatch in the number of measured vibration modes in comparison to the number of modes included in the analytical finite element model. Key points made in the development will be highlighted using numerical experiments.
Kernel-based methods, such as support vector regression (SVR), have demonstrated satisfactory performance in short-term load forecasting (STLF) application. However, the good performance of kernel-based method depends...
详细信息
Kernel-based methods, such as support vector regression (SVR), have demonstrated satisfactory performance in short-term load forecasting (STLF) application. However, the good performance of kernel-based method depends on the selection of an appropriate kernel function that fits the learning target, unsuitable kernel function or hyper-parameters setting may lead to significantly poor performance. To get the optimal kernel function of STLF problem, this paper proposes a kernel-based SVR combination model by using a novel individual model selection algorithm. Moreover, the proposed combination model provides a new way to kernel function selection of SVR model. The performance and electric load forecast accuracy of the proposed model are assessed by means of real data from the Australia and California Power Grid, respectively. The simulation results from numerical tables and figures show that the proposed combination model increases electric load forecasting accuracy compared to the best individual kernel-based SVR model. (c) 2014 Elsevier Ltd. All rights reserved.
To study the role of data base and data base management system, an interactive design optimization software system called IDESIGN5 is developed to solve nonlinear programming problems. Four promising algorithms are in...
详细信息
Motivated by the wavelet compression techniques and their applications, we consider the following problem: Given an unsorted array of numerical values and a threshold, what is the minimum number of elements chosen fro...
详细信息
Motivated by the wavelet compression techniques and their applications, we consider the following problem: Given an unsorted array of numerical values and a threshold, what is the minimum number of elements chosen from the array, such that the sum of these elements is not less than the threshold value. In this article, we first provide two linear time algorithms for the problem. We then demonstrate the efficacy of these algorithms through experiments. Lastly, as an application of this research, we indicate that the construction of wavelet synopses on a prescribed error bound (in L-2 metric) can be solved in linear time. (C) 2013 Elsevier Inc. All rights reserved.
A data reuse algorithm for multiple reference frame motion estimation is described. The proposed algorithm reduces memory access by modifying the reference frame search order and search centre such that the likelihood...
详细信息
A data reuse algorithm for multiple reference frame motion estimation is described. The proposed algorithm reduces memory access by modifying the reference frame search order and search centre such that the likelihood of data reuse is increased. Experimental results show that the algorithm reduces memory access by 15-30% compared to the conventional fast reference frame selection algorithm, while maintaining similar bit rate and PSNR.
As an extension of the authors published work on a search algorithm for motion generation with Grashof, transmission angle and linkage perimeter conditions [P.J. Martin, K. Russell, R.S. Sodhi, On mechanism design opt...
详细信息
As an extension of the authors published work on a search algorithm for motion generation with Grashof, transmission angle and linkage perimeter conditions [P.J. Martin, K. Russell, R.S. Sodhi, On mechanism design optimization for motion generation, Mechanism and Machine Theory 42 (10) (2007) 1251-1263], this work formulates a goal program to generate four-bar mechanism fixed and moving pivot loci that considers prescribed coupler poses, a coupler load and maximum driver static torques. Published by Elsevier Ltd.
In the paper, a traffic engineering enhancement to the QoS-OSPF routing protocol is proposed and used as the path selection algorithm in a DiffServ-MPLS network. The proposed scheme, TE-QOSPF, exploits the use of non-...
详细信息
In the paper, a traffic engineering enhancement to the QoS-OSPF routing protocol is proposed and used as the path selection algorithm in a DiffServ-MPLS network. The proposed scheme, TE-QOSPF, exploits the use of non-shortest paths to improve load-balancing and avoid network congestion. Simulation results show that the algorithm outperforms the QoS-OSPF scheme in terms of loss ratio, link utilisation, and delay.
We propose a new partition-based join algorithm, called select-partitioned join, which performs better than the sort-merge and hash-partitioned join. The proposed select-partitioned join algorithm consists of three ma...
详细信息
We propose a new partition-based join algorithm, called select-partitioned join, which performs better than the sort-merge and hash-partitioned join. The proposed select-partitioned join algorithm consists of three major steps. The first step is to determine a partitioning pattern by which the total join cost can be minimized and choose the bound values of the buckets by using a selection algorithm. The second is to partition both relations into ranged buckets according to the partitioning pattern and the bound values chosen in the previous step. And the last step is to apply the nested-block join on the partitioned bucket pairs. The selection algorithm is based on the cumulative distribution function and it is performed by a single scan of the smaller relation. The performance of the select-partitioned join is analyzed in terms of the number of I/Os and compared with the sort-merge and hash-partitioned join algorithms. Our join algorithm is better than a hash-partitioned join algorithm, which is, in general, known to be better for the join operation. Simulation experiments are conducted for the join algorithms.
暂无评论