967531
Performance Analysis of a Forging Manipulator Based on the Composite Modeling Method
This paper presents the performance analysis of one type of forging manipulator based on a new approach for the calculation of Jacobian matrices. The Jacobian matrix based evaluation criterions in robotics literature are studied to characterize the kinematic and dynamic manipulability, as well as the force capability of the studied manipulator. The performance measures with respect to the joint space are illustrated to describe the kinematic and dynamic capability of the manipulator intuitively. The ellipses at the best condition points are obtained. The research in this paper can be served as fundamentals of design and optimization of forging manipulators, and predict the best work conditions.
15004157
A Semantic QoS-Aware Discovery Framework for Web Services
Augmenting web services with explicit semantics forms the foundation of Service Oriented Architectures (SOAs) automation. As more and more Semantic Web Services (SWSs) are deployed, similar SWSs could have quite different quality-of-service (QoS) levels. The QoS-aware discovery becomes an important challenge. While some efforts try to solve it via Constraint Programming (CP), they suffer from the purely syntactic matchmaking method. Furthermore, the construction of constraints and the selection of services are completely dependent on the literal translation from QoS descriptions, which increase obstacles to actually apply CP. In this paper, we propose a semantic QoS-aware framework for SWSs discovery by combining the semantic matchmaking and CP. Initially, a QoS ontology is presented to define QoS data into service descriptions. Then the ontology reasoning is adopted to change previous syntactic matchmaking into a semantic way. Through confirming the compatibility of concepts, complex QoS conditions are solved as constraints and a selection algorithm is proposed to obtain the optimal offer. Finally, the prototype implementation of our framework is discussed and a SWSs discovery case is used to illustrate the comprehensive discovery process.
12111515
Algorithm of integrating QFD and TRIZ for the innovative design process
TRIZ, the Russian acronym of the Theory of Inventive Problem Solving, is a useful tool that can solve the problem of "how to do" effectively in the innovative design process, while QFD (Quality Function Deployment) is able to settle the problem of "what to do". Although the potential of using both QFD and TRIZ in the product design process is huge, there are little tools to integrate these two methods effectively. In this research, we describe an algorithm that can integrate QFD and TRIZ effectively for the purpose of the innovative design process. The core of the algorithm is to identify the contradictions in TRIZ by defining rules based on HOQ (House of Quality) in QFD. A software tool called TRIZmatrix is developed based on this algorithm. Application of the algorithm to the case of the airbag problem is studied in detail. The software application and the case study show the advantage of this algorithm for CAI (computer aided innovation) software development.
10702245
A wireless LAN-based indoor positioning technology
Context-aware computing is an emerging computing paradigm that can provide new or improved services by exploiting user context information. In this paper, we present a wireless-local-area-network-based (WLAN-based) indoor positioning technology. The wireless device deploys a position-determination model to gather location information from collected WLAN signals. A model-based signal distribution training scheme is proposed to trade off the accuracy of signal distribution and training workload. A tracking-assistant positioning algorithm is presented to employ knowledge of the area topology to assist the procedure of position determination. We have set up a positioning system at the IBM China Research Laboratory. Our experimental results indicate an accuracy of 2 m with a 90% probability for static devices and, for moving (walking) devices, an accuracy of 5 m with a 90% probability. Moreover, the complexity of the training procedure is greatly reduced compared with other positioning algorithms.
14513982
An Online Model Checking Tool for Safety and Liveness Bugs
Modern software model checkers are usually used to find safety violations. However, checking liveness properties can offer a more natural and effective way to detect errors, particularly in complex concurrent and distributed e-business systems. Specifying global liveness properties which should always eventually be true proves to be more desirable, but it is hard for existing software model checkers to verify liveness in real codes because doing so requires finding an infinite execution. For solving such a challenge, this paper proposes an online checking tool to verify the safety and liveness properties of complex systems. We adopt the linear temporal logic to describe the semantics of the finite model checking, use binary instrumentation to obtain the distribute states and apply a checking engine to dynamically verify the finite trace linear temporal logic properties. At last, we demonstrate the method in a distributed system using distributed protocol Paxos and achieve good results by experiments.
5812455
Knowledge Enhanced IT Service Management
To manage the increasing complexity of IT systems and align IT services with business is the main theme of IT Service Management (ITSM). Current ITSM architecture adopts ITU as the framework to integrate silos of operational management tools and configuration information to build an end-to-end solution based on best practices. However, it lacks of a systematic means to address an important aspect of IT operation, i.e., managing the knowledge separated in various tools and experts' minds. In this paper, a novel knowledge-enhanced architecture is proposed to improve the effectiveness and efficiency of ITSM. The essential contribution of this novel architecture is to involve a Knowledge Management Database (KMDB) which provides assistance for knowledge capture, mining, storage and sharing. The paper will discuss an approach of how to construct such a KMDB with motivating scenarios and detailed description of key components. To validate the approach, a prototype system is developed and evaluated by being applied for problem analysis on a Cisco Voice over IP (VoIP) system. The experiment results show a remarkable improvement in the effectiveness and efficiency for practical IT service management operations.
27202859
Affective interaction based on person-independent facial expression space
This paper proposes a person-independent facial expression space (PIFES) to analyze and synthesize facial expressions based on supervised locality preserving projections (SLPP), which aligns different subjects and different intensities of facial expressions on one generalized expression manifold. Interactive curves of different patterns are generated according to the input facial expression image sequence, and target responsive expression images are synthesized for different emotions. In order to synthesize arbitrary expressions for a new person with natural details, a novel approach based on local geometry preserving between the input face image and the target expression image is proposed. Experimental results clearly demonstrate the efficiency of the proposed algorithm.
8066461
Scalability of Hybrid Fuzzy C-Means Algorithm Based on Quantum-Behaved PSO
A new hybrid fuzzy clustering algorithm that incorporates the fuzzy c-means (FCM) into the quantum-behaved particle swarm optimization (QPSO) algorithm is proposed in this paper (QPSO+FCM). The QPSO has less parameters and higher convergent capability of the global optimizing than particle swarm optimization algorithm (PSO). So the iteration algorithm is replaced by the QPSO based on the gradient descent of FCM, which makes the algorithm have a strong global searching capacity and avoids the local minimum problems of FCM and in a large degree avoids depending on the initialization values. This paper also investigates the ability of FCM algorithm, PSO+FCM algorithm and GA+FCM algorithm with Iris testing data and Wine testing data. The simulation result proves that compared with other algorithms, the new algorithm not only has the favorable convergence but also has been obviously improved the clustering effect.
6690308
PEPA Analysis of MAP Effects in Hierarchical Mobile IPv6
To overcome the drawbacks of the mobile IPv6 protocol on handling local mobility management, IETF proposed the HMIPv6 protocol which introduces an intermediate mobility anchor point (MAP) to hide the movement of a mobile node within a local area. However, the MAP forms a bottleneck in the network since all the traffic destined for its served nodes has to go through it. Most research on HMIPv6 focuses on protocol optimisation, and performance analysis of HMIPv6 is usually simulation-based. In this paper, we employ a performance evaluation formalism named PEPA to investigate the performance tradeoffs of MAPs in HMIPv6. Performance measures such as response time and MAP utilisation are presented.
38699742
Dependable Transaction for Electronic Commerce
Electronic transaction becomes common practice in real world business. This paper focuses on the issue of dependability in critical transactions like electronic payment, electronic contract signing. Recent fair protocols can recover transactions from network crashes, but cannot survive local system crashes. A two-party dependable transaction protocol is proposed. During the protocol, both parties can recover the transaction from network and local system failures in a transparent way, which means that after the recovery, outcome messages would be just the same as those from a successful run of the transaction.
9889663
Feature Similarity Based Redundancy Reduction for Gene Selection
this paper we propose a feature similarity based redundancy reduction (FSRR) algorithm for high-dimensional gene expression data analysis. FSRR has two steps. First, the relevance of each feature is evaluated. Second, based on the relevance, the redundant features are removed by feature similarity. The efficiency and effectiveness of our algorithm is established through an experimental study using gene expression data. Four state-of-art feature ranking algorithms and three feature similarity measures are compared and discussed in our work. The results indicate that our algorithm has the capability of finding a well-suited feature set and improving the classification accuracy.