Instead of using the total charge Green抯 function method directly to compute the two-dimensional parameters of interconnects in multi-dielectric media, the Appel抯 hierarchical algorithm is adopted to
Instead of using the total charge Green抯 function method directly to compute the two-dimensional parameters of interconnects in multi-dielectric media, the Appel抯 hierarchical algorithm is adopted to
In this work, we present a new two-stage technique to find clusters of different shapes, densities and sizes in the presence of overlapped clusters and noise. Firstly, a density-based clustering approach is developed ...
详细信息
ISBN:
(纸本)9781607506430;9781607506423
In this work, we present a new two-stage technique to find clusters of different shapes, densities and sizes in the presence of overlapped clusters and noise. Firstly, a density-based clustering approach is developed using a density function estimated by the EM algorithm and in the second stage, a hierarchical strategy is used to merge clusters according to a dissimilarity measure here introduced in order to assess the overlap and proximity of the clusters. Several synthetic and real world data sets are used to evaluate the effectiveness and the efficiency of the new algorithm, indicating that it obtains satisfactory clustering results.
Time-Series clustering is used to attain deep knowledge of the mechanism that generate the time-series and speculate the prospective values of the given time-series. Time Series clustering is shape- level if it is car...
详细信息
ISBN:
(纸本)9789380544199
Time-Series clustering is used to attain deep knowledge of the mechanism that generate the time-series and speculate the prospective values of the given time-series. Time Series clustering is shape- level if it is carried out on the many individual time-series or structure-level if it works on single long length time-series. Depending on whether Time-series clustering is working directly on unprocessed data (frequency or time domain), or indirectly with the features extracted or model built from the unprocessed data, it is categorized into three groups. The proposed work comes under the raw data based approach. In this work, DTW is utilized as a distance/similarity count in the hierarchical clustering algorithm with inter/intra-cluster-distance-based-swap. The performance of the proposed work is evaluated by using Clustering Validity indices
Researches on office building energy consumption have been hot in these years, but few researchers consider the classification of office energy consumption performance which can evaluate user behaviors in order to off...
详细信息
ISBN:
(纸本)9781479914845
Researches on office building energy consumption have been hot in these years, but few researchers consider the classification of office energy consumption performance which can evaluate user behaviors in order to offer a clear analysis of energy consumption and improve their energy saving consciousness. In this paper, we propose a novel hierarchical classification algorithm for evaluating energy consumption behaviors at a real energy management system, which combines fuzzy c-means clustering with GA (genetic algorithm)-based SVM (support vector machine) to fully utilize collected samples. The experiment results with real energy consumption data show that the proposed algorithm works well to distinguish the abnormal behaviors and classify energy consumption behaviors accurately on normal offices.
This paper focuses on the joint estimation of parameters and time delays for multi-input systems that contain unknown input delays and colored noise. A greedy pursuit hierarchical iteration algorithm is proposed, whic...
详细信息
This paper focuses on the joint estimation of parameters and time delays for multi-input systems that contain unknown input delays and colored noise. A greedy pursuit hierarchical iteration algorithm is proposed, which can reduce the estimation cost. Firstly, an over-parameterized approach is employed to construct a sparse system model of multi-input systems even in the absence of prior knowledge of time delays. Secondly, the hierarchical principle is applied to replace the unknown true noise items with their estimation values, and a greedy pursuit search based on compressed sensing is employed to find key parameters using limited sampled data. The greedy pursuit search can effectively reduce the scale of the system model and improve the identification efficiency. Then, the parameters and time delays can be estimated simultaneously while considering the known orders and found locations of key parameters by utilizing iterative methods with limited sampled data. Finally, some simulations are provided to illustrate the effectiveness of the presented algorithm in this paper.
A quasi-linear ARX neural network model (QARXNN) is a nonlinear model built using neural networks (NN). It has a linear-ARX structure where NN is an embedded system to give the parameters for the regression vector. Th...
详细信息
A quasi-linear ARX neural network model (QARXNN) is a nonlinear model built using neural networks (NN). It has a linear-ARX structure where NN is an embedded system to give the parameters for the regression vector. There are two contributions in this paper, 1) hierarchical algorithms is proposed for the training of QARXNN model, 2) an adaptive learning is implemented to update learning rate in NN training to ensure global minima. First, the system is estimated by using LSE algorithm. Second, nonlinear sub-model performed using NN is trained to refine error of LSE algorithm. The linear parameters obtained from LSE algorithm is set as bias vector for the output nodes of NN. Global minima point is reached by adjusting the learning rate based on Lyapunov stability theory to ensure convergence of error. The proposed algorithm is used for the identification and prediction of nonlinear dynamic systems. Finally, the experiments and numerical simulations reveal that the proposed method gives satisfactory results.
A novel relaxed hierarchical algorithm based on the surface equivalence principle for the volume integral equations (VIEs) is proposed in this work. The equivalent sources residing on relaxed spherical equivalence sur...
详细信息
A novel relaxed hierarchical algorithm based on the surface equivalence principle for the volume integral equations (VIEs) is proposed in this work. The equivalent sources residing on relaxed spherical equivalence surfaces are established by exact integral formulations. The equivalence surfaces are exploited hierarchically to accelerate matrix-vector product in iterative solutions for the VIEs. The computation time and memory cost complexity of the proposed algorithm for dielectric scatters scale as O (N-4/3) and O (N), respectively. Numerical examples validate the accuracy and capability of the proposed algorithm.
This paper develops a hierarchical nonlinear model predictive control (MPC) algorithm for the cooperative control of vehicle-to-vehicle (V2V) networks. In the hierarchical algorithm, an estimator is proposed as a sing...
详细信息
This paper develops a hierarchical nonlinear model predictive control (MPC) algorithm for the cooperative control of vehicle-to-vehicle (V2V) networks. In the hierarchical algorithm, an estimator is proposed as a single layer, namely, the estimated layer for generating sub-targets with local physical constraints. Then, based on an augmented simplified vehicle model, a nonlinear MPC technique is newly presented in the local layer for planning the desired trajectory with its optimization solved by a continuation/generalized minimal residual (C/GMRES) method. Note that, by considering the error components between the planned trajectory and the measured positions, a controller with a two-loop structure is adopted to improve tracking performances. Therefore, the control objective is obtained, namely, the vehicle platoon in the desired path is generated and the collisions among vehicles are avoided. The simulation results with comparisons are finally given to illustrate the effectiveness of the algorithm.
The standard Value Iteration (VI) algorithm, referred to as Value Iteration Pre-Jacobi (PJ-VI) algorithm, is the simplest Value Iteration scheme, and the well-known algorithm for solving Markov Decision Processes (MDP...
详细信息
The standard Value Iteration (VI) algorithm, referred to as Value Iteration Pre-Jacobi (PJ-VI) algorithm, is the simplest Value Iteration scheme, and the well-known algorithm for solving Markov Decision Processes (MDPs). In the literature, several versions of VI algorithm were developed in order to reduce the number of iterations: the VI Jacobi (VI-J) algorithm, the Value Iteration Pre-Gauss-Seidel (VI-PGS) algorithm and the VI Gauss-Seidel (VI-GS) algorithm. In this article, the authors combine the advantages of VI Pre Gauss-Seidel algorithm, the decomposition technique and the parallelism in order to propose a new Parallel hierarchical VI Pre-Gauss-Seidel algorithm. Experimental results show that their approach performs better than the traditional VI schemes in the case where the global problem can be decomposed into smaller problems.
The G-SGD algorithm significantly outperforms the conventional SGD algorithm in ReLU neural networks by adopting the basis path ***,how the inner mechanism of basis paths works remains mysterious,and the G-SGD algorit...
详细信息
The G-SGD algorithm significantly outperforms the conventional SGD algorithm in ReLU neural networks by adopting the basis path ***,how the inner mechanism of basis paths works remains mysterious,and the G-SGD algorithm that helps to find a basis path set is *** paper employs graph theory to investigate structure properties of basis paths in a more general and complicated neural network with unbalanced layers and *** hierarchical algorithm HBPS is proposed to find a basis path set,by decomposing the complicated network into several independent and parallel *** paper theoretically extends the study of basis paths and provides one methodology to find the basis path set in a more general neural network.
暂无评论