Optimization Method of Massive Data Query

2014 ◽  
Vol 602-605 ◽  
pp. 3247-3250
Author(s):  
Yu Ming Chen

Optimization method ofmassive dataquery is researched in this paper.In the modernInternet environment,the datahas the characteristics oflarge amount of information, complexity, disorder, andchaosassociation. Using traditionalqueried methodsoftenrequirea lot oflimitedconditions, witha lot of drawbacks such as time-consuming data query, moreineffective queryand low efficiency.To this end, anoptimizationmethod of massive data query based onparallel Apriori algorithm is proposed in this paper.The massive dataare made simplification processing andredundant data are deleted to providedata foundation for fast and accuratedataquery.Effectiveassociation rulesof the massive data are calculated, in order to obtain the relevantof the target data. Based onAprioriparallel algorithm,massivedata are processedto achieveaccurate query. Experimental results show thatthe use ofoptimization algorithm for massive dataquerycan improvethe query speedof target data and it has a strong superiority.

Author(s):  
H Sh Ousaloo ◽  
Gh Sharifi ◽  
B Akbarinia

The ground-based spacecraft dynamics simulator plays an important role in the implementation and validation of attitude control scenarios before a mission. The development of a comprehensive mathematical model of the platform is one of the indispensable and challenging steps during the control design process. A precise mathematical model should include mass properties, disturbances forces, mathematical models of actuators and uncertainties. This paper presents an approach for synthesizing a set of trajectories scenarios to estimate the platform inertia tensor, center of mass and aerodynamic drag coefficients. Reaction wheel drag torque is also estimated for having better performance. In order to verify the estimation techniques, a dynamics model of the satellite simulator using MATLAB software was developed, and the problem reduces to a parameter estimation problem to match the experimental results obtained from the simulator using a classical Lenevnberg-Marquardt optimization method. The process of parameter identification and mathematical model development has implemented on a three-axis spherical satellite simulator using air bearing, and several experiments are performed to validate the results. For validation of the simulator model, the model and experimental results must be carefully matched. The experimental results demonstrate that step-by-step implementation of this scenario leads to a detailed model of the platform which can be employed to design and develop control algorithms.


Author(s):  
A. Narimani ◽  
M. F. Golnaraghi

This paper presents experimental investigation of modeling and control of magnetorhological damper for transient base excitation inputs. Force characteristics of a commercially available MR damper (RD-1005-3) for shock and other transient base excitation are analytically obtained and validated using a scaled suspension model. The proposed model characterizes damper behavior more accurately and efficiently for analytical applications. The time and frequency responses of the developed model are compared with the experimental results and show good agreement. Finally, using the RMS optimization method the performance of the system for different types of controllers is compared with the optimal values of linear isolator system. Experimental results show that the performance of base isolation systems for transient and shock inputs significantly improves by utilizing a controlled semi-active damper over uncontrolled MR damper or an optimally designed passive isolator.


2012 ◽  
Vol 229-231 ◽  
pp. 795-798
Author(s):  
Yang Bai ◽  
Safakcan Tuncdemir ◽  
Jian Wang ◽  
Ji Feng Guo ◽  
Kenji Uchino

An optimization algorithm on the stator design of a dual function piezoelectric actuator was described in this paper. Four different sets of motors were investigated using various geometric parameters to determine the best design. The predicted prototype characteristics were in good agreement with the experimental results as well as the ANSYS simulation analyses. This optimization method can be used to enhance the motor output characteristics and efficiency.


2013 ◽  
Vol 765-767 ◽  
pp. 867-870 ◽  
Author(s):  
Peng Wang ◽  
Ai Xue Tian

The explosive growth in data quantity today, massive data query performance is good or bad becomes important. In order to avoid system response time is long, wasted resources from happening. We are actively exploring methods and strategies to make massive data query performance optimization. Massive data query performance optimization is a systematic project, involving many aspects, in which the index plays an important role. This article obtains from the index, based on Oracle, the paper analyzes the structure of B-tree index, the way of data scanning, as well as how to correctly use the index and rely on the index attribute to optimize massive data query performance.


2013 ◽  
Vol 411-414 ◽  
pp. 362-365 ◽  
Author(s):  
Yi Jun Wang ◽  
Han Hu Wang ◽  
Hui Li

In this paper, we study the characteristics of analytical query processing and proposed a histogram based approximate method for query processing over massive data. We implemented this approach into Hive system and evaluate it with Hive and BlinkDB cluster, the experimental results verified that our method is significantly fast than these existing techniques.


2014 ◽  
Vol 716-717 ◽  
pp. 936-939
Author(s):  
Lin Zhang

Detection speed of traditional face detection method based on AdaBoost algorithm is slow since AdaBoost asks a large number of features. Therefore, to address this shortcoming, we proposed a fast face detection method based on AdaBoost and canny operators in this paper. Firstly, we use canny operators to detect edge of face image which separates the region of the possible human face from image, and then do face detection in the separated region using Modest AdaBoost algorithm (MAB). Before using MAB to achieve face detection, utilizing canny operators to detect edge can make this algorithm effectively filter information, retain useful information, reduce the amount of information and improve detection speed. Experimental results show that the algorithm can obtain higher detection accuracy and detection speed has been significantly improved at the same time.


Author(s):  
Yugal Kumar ◽  
Gadadhar Sahoo

This chapter presents a charged system search (CSS) optimization method for finding the optimal cluster centers for a given dataset. In CSS algorithm, while the Coulomb and Gauss laws from electrostatics are applied to initiate the local search, global search is performed using Newton second law of motion from mechanics. The efficiency and capability of the proposed algorithm is tested on seven datasets and compared with existing algorithms like K-Means, GA, PSO and ACO. From the experimental results, it is found that the proposed algorithm provides more accurate and effective results in comparison to other existing algorithms.


Author(s):  
Han Liu ◽  
Zhenyu Liu ◽  
Guifang Duan ◽  
Jianrong Tan

Geometric parameters of 4D printed bilayer structure determine its deformation to a great extent. This paper proposed a geometric design method of 4D printed bilayer structures for accurate folding deformation. To precisely calculate the deformation, a folding deformation model of 4D printed bilayer structure is constructed considering thickness ratio and elastic modulus ratio. Then, for a target folding deformation, an adaptive surrogate-based optimization method is employed to obtain the geometric parameters of a given 4D printed bilayer structure. The numerical and physical experimental results show that the geometric parameters of 4D printed bilayer structure can be well designed by the proposed method.


2013 ◽  
Vol 333-335 ◽  
pp. 1247-1250 ◽  
Author(s):  
Na Xin Peng

Aiming at the problem that most of weighted association rules algorithm have not the anti-monotonicity, this paper presents a weighted support-confidence framework which supports anti-monotonicity. On this basis, Boolean weighted association rules algorithm and weighted fuzzy association rules algorithm are presented, which use pruning strategy of Apriori algorithm so as to improve the efficiency of frequent itemsets generated. Experimental results show that both algorithms have good performance.


Sign in / Sign up

Export Citation Format

Share Document