-
Chapter and Conference Paper
Solutions to Common Problems of Forged Steel Piston
This article focuses on two forged steel piston products of different structures and materials, through the mold stress analysis simulation mold structure optimization, die life is greatly improved, while solv...
-
Chapter and Conference Paper
Melasma Image Segmentation Using Extreme Learning Machine
This paper introduces an image segmentation method based on the extreme learning machine (ELM) to detect melasma in human face images. In this work, skin texture features are extracted and fed into ELM classif...
-
Chapter and Conference Paper
Cost-Based Optimization of Logical Partitions for a Query Workload in a Hadoop Data Warehouse
Recently, Hadoop has become a common programming framework for big data analysis on a cluster of commodity machines. To optimize queries on a large amount of data managed by the Hadoop Distributed File System ...
-
Chapter and Conference Paper
Cost-Based Join Algorithm Selection in Hadoop
In recent years, MapReduce has become a popular computing framework for big data analysis. Join is a major query type for data analysis and various algorithms have been designed to process join queries on top ...
-
Chapter and Conference Paper
Synthesizing: Art of Anonymization
Although there are a number of anonymization techniques in the microdata publication, two problems remain: (1) the privacy breaches with auxiliary knowledge; (2) the large information losses during the anonymi...
-
Chapter and Conference Paper
IWWS: A Reliability-Based WWW Collaborative Recommender System
Recommender systems using collaborative filtering are a popular technique for reducing information overload and finding products. In this paper, we present a reliability-based WWW collaborative recommender sys...
-
Chapter and Conference Paper
Multi-labeled Graph Matching – An algorithm Model for Schema Matching
Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we treat the schema matching problem as a c...
-
Chapter and Conference Paper
Schema Homomorphism – An Algebraic Framework for Schema Matching
A formal framework for SMP is important because it facilitates the building of algorithm model and the evaluation of algorithms. First, we propose a formal definition of schema matching that is named multivale...
-
Chapter and Conference Paper
An Algebraic Framework for Schema Matching
It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms. First, based on universal al...
-
Chapter and Conference Paper
Poster Summaries
-
Chapter and Conference Paper
An Efficient Learning Algorithm for Feedforward Neural Network
BP algorithm is frequently applied to train feedforward neural network, but it often suffers from slowness of convergence speed. In this paper, an efficient learning algorithm and its improved algorithm based ...
-
Chapter and Conference Paper
An Efficient Rules Induction Algorithm for Rough Set Classification
The theory of rough set provides a formal tool for knowledge discovery from imprecise and incomplete data. Inducing rules from datasets is one of the main tasks in rough set based data mining. According to Occ...
-
Chapter and Conference Paper
Multispace search: A new optimization approach
A traditional search algorithm optimizes by changing values in the value space, it is difficult for a value search algorithm to handle the pathological phenomena occurred in many combinatorial optimization pro...
-
Chapter and Conference Paper
Average time complexity of the SAT 1.2 algorithm
In this paper, we give an efficient algorithm, the SAT1.2 algorithm, for the SAT problem. For randomly generated formulas with n clauses, m variables, and l literals per clause, the average run time of the SAT1.2...
-
Chapter and Conference Paper
Design efficient local search algorithms
Local search is one of the early techniques proposed during the midsixties as a practical technique to cope with the overwhelming computational intractability of NP-hard combinatorial optimization problems. In...