7181717
A Biased Support Vector Machine Approach to Web Filtering
Web filtering is an inductive process which automatically builds a filter by learning the description of user interest from a set of pre-assigned web pages, and uses the filter to assign unprocessed web pages. In web filtering, content similarity analysis is the core problem, the automatic-learning and relativity-analysis abilities of machine learning algorithms help solve the above problems and make ML useful in web filtering. While in practical applications, different filtering task implies different userinterest and thus implies different filtering result. This work studies how to adjust the web filtering results to be more fit for the user interest. The web filtering result are divided into three categories: relative pages, similar pages and homologous pages according to different user interest. A Biased Support Vector Machine (BSVM) algorithm, which imports a stimulant function, uses training examples distribution n+/n−− and a user-adaptable parameter k to deal imbalancedly different classes of the pre-assigned pages, is introduced to adjust the filtering result to be best fit for the user interest. Experiments show that BSVM can greatly improve the web filtering performance.
34644832
On-Line Signature Verification Based on PCA (Principal Component Analysis) and MCA (Minor Component Analysis)
On-line signature verification is still an active topic in the field of biometrics. This paper proposes a novel method based on PCA (Principal Component Analysis) and MCA (Minor Component Analysis). Different from the application of PCA in other fields, both principal and minor components are used to signature verification, and MC plays a very important role. Comparing with DTW and the discriminance of Euclidean distance, the method based on PCA and MCA is better. With 1215 signatures contributed by 81 signers of which numbers of reference signatures, genuine signatures and forgeries (skilled) are 5 respectively, the EER is about 5%.
10266533
Configuration representation and reconfiguration optimization for the reconfigurable robots with independent manipulation
Single module of the reconfigurable robots with independent manipulation can perform the actions of locomotion and manipulation. In conformity with the request for achieving autonomous operation in the unstructurized environment instead of fixed operation in the structurized environment, these robots are applied in the complicated and dangerous environment. The existing researches on the configuration theory focus on the reconfigurable robots with limited locomotion and the ones with independent locomotion, not being applicable to the reconfigurable robots with independent manipulation. The vector configuration is put forward, the research content of which contains the topology and locomotion direction of configuration, the posture and orientation and connection relation between modules. Module state vector and configuration state matrix are proposed for representation methodology for the swarm configuration of these reconfigurable robots, which supports transformation operation to represent and trigger behavior motion of the module and reconfiguration between configurations. Optimization algorithm of assembly reconfiguration applying workload as the optimization target is presented, as well as optimization algorithm of transformation reconfiguration applying the integration of posture orientation workload and connection workload. The result of optimization is the relation of state transformation between the initial configuration and the object one as the basic of reconfiguration plan and control.
11047335
Dynamic modeling for locomotion-manipulation of a snake-like robot by using geometric methods
A snake-like robot can locomote in various environments; and it can manipulate objects when one end is fixed. A method of dynamic modeling for locomotion-manipulation of the snake-like robot is developed in order to unify the dynamic equations of two states. A virtual structure for orientation and position and the product-of-exponentials formula describe the mechanism and the kinematics of the robot. The dynamics of the robot are established in a Riemannian manifold. Furthermore, the dynamics of manipulation can be directly degenerated from those of locomotion. This method unifies the dynamics of locomotion and manipulation of the snake-like robot in the differential geometry formulation. Finally, simulation results of the method are presented.
1252893
A Configurable Web Service Performance Testing Framework
More and more softwares based on web service technologies are developed. Before their releases on the Internet, it is necessary to evaluate these systems' performance, especially their response time under different workload pressures. However, existing performance testing benchmarks and tools for web service applications are difficult to adapt to various user-specific testing purposes. This paper proposes a configurable web service performance testing framework which contains client module, application server module and database module. Client module, by using the network cooperation method that one central client drives several other clients, adapts to a great number of concurrent customers to request web services. Application server module contains web services under testing and external supporting web services, each of which is configured as a plug-in. The process to realize mixed ratio of web service interactions is similar to dealing cards and adapts to different commercial application characteristics. In database module, the data model including table and attribute dependence can be customized, and the data scale initialization can be resized according to the topology of above dependence. As such, this framework allows testers to dynamically define their data model, customize their scale of database, configure their transaction characteristics, deploy their application strategies and confirm their performance metrics..
12820927
A Policy Language for Adaptive Web Services Security Framework
How to resolve access control on Web services has become one of the important research tasks about the application of Web services. In this paper, we propose a policy based adaptive Web services security framework. In this framework, the ReiT policy is a declarative language based on the rules and ontologies. The non-structural knowledge is represented by rules and the structural temporal knowledge is represented by ontology. Moreover, we propose a mixer reasoning mechanism to evaluate the ReiT policy. The access control policy including the context of the user and Web services is evaluated by the reasoner. According to the evaluated result agent authorizes the access control of the Web services.
15998088
Understand behavior and performance of Real Coded Optimization Algorithms via NK-linkage model
Classical NK-landcape model was designed for analyzing optimization and evolution process in binary solution space, so it can not be used to analyze real coded optimization algorithms (RCOAs) directly, which work in continuous solution space directly. In this paper, the concept of NK-landscape model is extended to the continuous space, and a new NK-landscape model with continuous space is proposed. The new model is powerful and comprehensive with simple structure and flexible formula. Therefore, it can be used to construct test functions of various types of linkages for analyzing various performances of RCOAs. The feasibility of the proposed model is testified via experiments with 3 well-known RCOAs, ( i.e. covariance matrix adapting evolutionary strategy (CMA-ES), differential evolution (DE), neighborhood search differential evolution (NSDE)). The results show that the new model can reveal the merits and demerits of RCOAs effectively.