In this paper, a new viable bandwidth reduction algorithm for reducing the bandwidth of sparse symmetric matrices, is described. The proposed algorithm provides a reliable procedure to reduce the bandwidth and can eas...
详细信息
In this paper, a new viable bandwidth reduction algorithm for reducing the bandwidth of sparse symmetric matrices, is described. The proposed algorithm provides a reliable procedure to reduce the bandwidth and can easily be applied to the sparse symmetric matrices of any size. This algorithm is tested on structured graphs and the reduced bandwidth results obtained are compared with the gps algorithm. The bandwidth obtained by the present method is smaller than or equal to the one obtained by the gps and standard examples are included to illustrate in detail the proposed algorithm. (C) 2016 Kalasalingam University. Publishing Services by Elsevier B.V.
Background: gps tracking is increasingly used to document daily mobility, allowing refined analysis of daily exposures and health behaviour. Validation of algorithms processing raw gps data to identify activity locati...
详细信息
Background: gps tracking is increasingly used to document daily mobility, allowing refined analysis of daily exposures and health behaviour. Validation of algorithms processing raw gps data to identify activity locations and trips are lacking. Objective: Propose novel ways to evaluate gps processing algorithms data while validating an existing kernel-based algorithm with real-life gps tracks. Methods: Seven-day gps tracking and gps-prompted recall interviews were conducted among 234 adult participants of the RECORD gps Study. Raw gps data was transformed using a kernel-based algorithm. Two match and nine mismatch configurations are analysed. algorithm detection of activity locations and trips were validated. Results: Some 95.8% of available gps time was correctly classified as an activity location or a trip. The algorithm falsely identified a trip for 2.2% of the tracking time, and falsely identified an activity location 0.7% of time. Missed trips and missed activity locations counted for less than.4% of the time. Conclusion: The tested kernel-based algorithm provides histories of activity locations and trips that are highly concordant with gps-prompted follow-up interviews. (C) 2016 Elsevier Ltd. All rights reserved.
A generalized gps (Ggps) algorithm is proposed for the problem of reducing the bandwidth and profile of the stiffness matrix in infinite element problems. The algorithm has two key-points. Firstly and most importantly...
详细信息
A generalized gps (Ggps) algorithm is proposed for the problem of reducing the bandwidth and profile of the stiffness matrix in infinite element problems. The algorithm has two key-points. Firstly and most importantly, more pseudo-peripheral nodes are found, used as the origins for generating more level structures, rather than only two level structures in the gps (Gibbs-Poole-Stockmeyer) algorithm. A new level structure is constructed with all the level structures rooted at the pseudo peripheral nodes, leading to a smaller level width than the level width of any level structure's in general. Secondly, renumbering by degree is changed to be sum of the adjacent nodes codes to make a better renumbering in each level. Simulation results show that the Ggps algorithm can reduce the bandwidth by about 37.63% and 8.91% and the profiles by 0.17% and 2.29% in average for solid models and plane models, respectively, compared with the outcomes of gps algorithm. The execution time is close to the gps algorithm. Empirical results show that the Ggps is superior to the gps in reducing bandwidth and profile
In the antenna array synthesis problems, most of the works in literature utilize isotropic elements. Thus, the mutual coupling effects between the array elements are neglected. It is obvious that an array antenna synt...
详细信息
In the antenna array synthesis problems, most of the works in literature utilize isotropic elements. Thus, the mutual coupling effects between the array elements are neglected. It is obvious that an array antenna synthesized by neglecting the coupling effects cannot be used in the real world applications due to the possible incompatibilities between the desired and realized radiation patterns. In this work, two array antenna synthesis papers from literature are investigated in terms of mutual coupling effects so the necessary constraints are determined for the array geometry in order to compensate the coupling effects. Here, the same objectives of these two papers are achieved using the generalized pattern search (gps) algorithm by considering the determined constraints for the inter-element spacings between the array elements. The resulted radiation patterns are validated with the computer simulation technology (CST) software with the aim of detecting possible incompatibilities due to the mutual coupling effects between the array elements. The simulation results verify that by using the constraints determined in this work, the radiation patterns obtained by pattern multiplication can provide the desired radiation demands also in the practical applications.
暂无评论