Open Access. Powered by Scholars. Published by Universities.®
Social and Behavioral Sciences Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 7 of 7
Full-Text Articles in Social and Behavioral Sciences
Cost And Time Aware Ant Colony Algorithm For Data Replica In Alpha Magnetic Spectrometer Experiment, Lijuan Wang, Junzhou Luo, Jun Shen, Fang Dong
Cost And Time Aware Ant Colony Algorithm For Data Replica In Alpha Magnetic Spectrometer Experiment, Lijuan Wang, Junzhou Luo, Jun Shen, Fang Dong
Faculty of Engineering and Information Sciences - Papers: Part A
Huge collections of data have been created in recent years. Cloud computing provides a way to enable massive amounts of data to work together as data-intensive services. Considering Big Data and the cloud together, which is a practical and economical way to deal with Big Data, will accelerate the availability and acceptability of analysis of the data. Providing an efficient mechanism for optimized data-intensive services will become critical to meet the expected growth in demand. Because the competition is an extremely important factor in the marketplace, the cost model for data-intensive service provision is the key to provide a sustainable …
A Composite Quality-Guided Phase Unwrapping Algorithm For Fast 3d Profile Measurement, Ke Chen, Jiangtao Xi, Yanguang Yu, Limei Song
A Composite Quality-Guided Phase Unwrapping Algorithm For Fast 3d Profile Measurement, Ke Chen, Jiangtao Xi, Yanguang Yu, Limei Song
Faculty of Engineering and Information Sciences - Papers: Part A
Fringe pattern profilometry (FPP) is one of the most promising 3D profile measurement techniques, which has been widely applied in many areas. A challenge problem associated with FPP is the unwrapping of wrapped phase maps resulted from complex object surface shapes. Although existing quality-guided phase unwrapping algorithms are able to solve such a problem, they are usually extensively computational expensive and not able to be applied to fast 3D measurement scenarios. This paper proposes a new quality-guided phase unwrapping algorithm with higher computational efficiency than the conventional ones. In the proposed method, a threshold of quality value is used to …
Approximation Algorithm For Data Broadcasting In Duty Cycled Multi-Hop Wireless Networks, Dianbo Zhao, Kwan-Wu Chin
Approximation Algorithm For Data Broadcasting In Duty Cycled Multi-Hop Wireless Networks, Dianbo Zhao, Kwan-Wu Chin
Faculty of Engineering and Information Sciences - Papers: Part A
Broadcast is a fundamental operation in wireless networks. To this end, many past studies have studied the NP-hard, broadcast problem for always-on multi-hop networks. However, in wireless sensor networks, nodes are powered by batteries, meaning, they have finite energy. Consequently, nodes are required to have a low duty cycle, whereby they switch between active and sleep state periodically. This means that a transmission from a node may not reach all of its neighbors simultaneously. Consequently, any developed broadcast protocols must consider collisions and the wake-up times of neighboring nodes. Henceforth, this paper studies the minimum latency broadcast scheduling problem in …
Path Planning With A Lazy Significant Edge Algorithm (Lsea), Joseph Polden, Zengxi Pan, Nathan Larkin, Stephen Van Duin
Path Planning With A Lazy Significant Edge Algorithm (Lsea), Joseph Polden, Zengxi Pan, Nathan Larkin, Stephen Van Duin
Faculty of Engineering and Information Sciences - Papers: Part A
Probabilistic methods have been proven to be effective for robotic path planning in a geometrically complex environment. In this paper, we propose a novel approach, which utilizes a specialized roadmap expansion phase, to improve lazy probabilistic path planning. This expansion phase analyses roadmap connectivity information to bias sampling towards objects in the workspace that have not yet been navigated by the robot. A new method to reduce the number of samples required to navigate narrow passages is also proposed and tested. Experimental results show that the new algorithm is more efficient than the traditional path planning methodologies. It was able …
Gmc ['Gimik]: A One-Variable Monte Carlo Dose Algorithm For Proton Therapy, N Depauw, B Clasie, T Madden, Anatoly B. Rosenfeld, H Kooy
Gmc ['Gimik]: A One-Variable Monte Carlo Dose Algorithm For Proton Therapy, N Depauw, B Clasie, T Madden, Anatoly B. Rosenfeld, H Kooy
Faculty of Engineering and Information Sciences - Papers: Part A
Presentation made at the International Conference on the Use of Computers in Radiation Therapy, 6-9 May 2013, Melbourne Convention and Exhibition Centre, Australia
Condition Monitoring Of Slow Speed Slewing Bearing Based On Largest Lyapunov Exponent Algorithm And Circular-Domain Feature Extractions, Wahyu Caesarendra, Prabuono Buyung Kosasih, A Kiet Tieu, Craig A. S Moodie
Condition Monitoring Of Slow Speed Slewing Bearing Based On Largest Lyapunov Exponent Algorithm And Circular-Domain Feature Extractions, Wahyu Caesarendra, Prabuono Buyung Kosasih, A Kiet Tieu, Craig A. S Moodie
Faculty of Engineering and Information Sciences - Papers: Part A
This paper presents a combined nonlinear and circular features extraction-based condition monitoring method for low speed slewing bearing. The proposed method employs the largest Lyapunov exponent (LLE) algorithm as a signal processing method based on vibration data. LLE is used to detect chaos existence in vibration data in discrete angular positions of the shaft. From the processed data, circular features such as mean, skewness and kurtosis are calculated and monitored. It is shown that the onset and the progressively deteriorating bearing condition can be detected more clearly in circular-domain features compared to time-domain features. The application of the method is …
Economical Data-Intensive Service Provision Supported With A Modified Genetic Algorithm, Lijuan Wang, Jun Shen
Economical Data-Intensive Service Provision Supported With A Modified Genetic Algorithm, Lijuan Wang, Jun Shen
Faculty of Engineering and Information Sciences - Papers: Part A
The explosion of digital data and the dependence on data-intensive services have been recognized as the most significant characteristics of the decade. Providing efficient mechanisms for optimized data-intensive services will become critical to meet the expected growing demand. In order to create a cost minimizing data-intensive service composition solution, we design two steps and two negotiation processes over the lifetime of a data-intensive service composition. The solution for the first step is presented in this paper. The proposed service selection algorithm is based on a modified genetic algorithm, which some modifications of crossover and mutation operators are adopted in order …