7375220
Dynamic User Modeling for Sketch-Based User Interface
This paper presents a strategy of dynamic user modeling for sketch-based user interface. A user model is defined as an incremental decision tree for a specific user. A drawing style modeling process is designed to model user's temporal drawing performances among inputting strokes, and to predict the possible shape in term of fuzzy matching. A user mediation process is proposed based on relevance feedback to capture users' drawing intentions and refine the recognition results. Experiments prove efficiency of the method.
43513684
A representation theorem for recovering contraction relations satisfying wci
A notion of an image structure associated with the canonical epistemic state is introduced. Based on it, we get a representation result for recovering contraction inference relations satisfying the condition weak conjunctive inclusion (wci) in terms of F-standard epistemic AGM states. In effect, this result establishes a representation theorem for belief contraction functions satisfying AGM postulates (k-1) - (k-7), and Rott's (wci) and (k-8c), and hence generalizes Rott's corresponding result in the finite framework.
2517026
On Dynamic and Concurrent Model of Web Service Components
The researches of Web service fasten on composition process, and are lack of the formalized description on dynamic attributes of service component itself. Aiming to these, a new dynamic and concurrent model of Web service component is presented. Firstly, this paper analyzes the process of state transition of service component under certain actions, and then depicts the dynamic transition process of service component with the state transition graph. At last, the physical representation method in memory and the algorithms to judge equivalence of state transition graph are given. Comparing with existing researches, the dynamic evolvement of service component under the actions is considered, and the algorithm to judge equivalence of service components provides an effective tool for model verification.
15542808
An Agent-based Policy Aware Framework for Web Services Security
The security of Web services has become one of the important research topics about the application of Web services. In this paper, we propose an agent-based policy aware framework for Web services security. In this framework, a policy language called ReiT which is a declarative language based on the rules and ontologies is introduced. The non-structural knowledge is represented by rules and the structural temporal knowledge is represented by ontology. Moreover, we propose a mixed 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. In addition, we present a policy aware BOID agent to authorize the access control of the Web services. And we implement the policy aware BOID agent by extending the JADE platform.
16775013
A Dynamic Trust Model for the Multi-agent Systems
Internet provides a fertile medium for new breeds of computer viruses. Many people who have access to a wealth of information via Internet are attacked by more computer viruses than they can effectively process. We present a dynamic computer virus detection model that can detect known viruses and previously unknown viruses to prevent information systems from damage. This model is inspired by biological immune systems that protect the body against damage from pathogens. The architecture of this model, the formal definitions of self nonself antigen, antibody, and vaccine gene library are introduced. Furthermore, the evolution of self and nonself, the generation of the antibody, the evolution of the virus vaccine gene, and the detection of the antigen are depicted. Experiment results show that this model has better capacity of self-adaptability and self-learning in detecting unknown viruses than traditional models.
8899940
Sketch retrieval based on spatial relations
In this paper, we propose an effective approach for sketch retrieval. Given sketches are firstly decomposed into basic geometric primitives and represented as a topological graph that encodes both the intrinsic attributes of the primitives and their relationships. The graph spectrum descriptor is then adopted to translate the graph-match into the computation of vector distances. Sketches retrieval is finally done by means of similarity calculation of feature vectors based on dimensionality reduction. The relevance feedback is also introduced to refine the retrieval results. Experiments prove the effectiveness and efficiency of the proposed method in sketch content retrieval and user independent.
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.
40380992
The Deformed Cube: A Visualization Technique for 3D Velocity Vector Field
This paper presents a visualization method called the deformed cube for visualizing 3D velocity vector field. Based on the decomposition of the tensor which describes the changes of the velocity, it provides a technique for visualizing local flow. A deformed cube,a cube transformed by a tensor in a local coordinate frame, shows the local stretch, shear and rigid body rotation of the local flow corresponding to the decomposed component of the tensor. User can interactively view the local deformation or any component of the changes. The animation of the deformed cube moving along a streamline achieves a more global impression of the flow field. This method is intended as a complement to global visualization methods.
3197098
A Multi-Objective Hw-sw Co-Synthesis Algorithm Based on Quantum-Inspired Evolutionary Algorithm
Hardware–Software (HW–SW) co-synthesis is one of the key steps in modern embedded system design. Generally, HW–SW co-synthesis is to optimally allocate processors, assign tasks to processors, and schedule the processing of tasks to achieve a good balance among performance, cost, power consumption, etc. Hence, it is a typical multi-objective optimization problem. In this paper, a new multi-objective HW–SW co-synthesis algorithm based on the quantum-inspired evolutionary algorithm (MQEAC) is proposed. MQEAC utilizes multiple quantum probability amplitude vectors to model the promising areas of solution space. Meanwhile, this paper presents a new crossover operator to accelerate the convergence to the Pareto front and introduces a PE slot-filling strategy to improve the efficiency of scheduling. Experimental results show that the proposed algorithm can solve the typical multi-objective co-synthesis problems effectively and efficiently.
1210599
Joint error concealment and error recovery for consecutive frame losses under the unbalanced multiple description coding architecture
Real-time video transmission over error-prone wireless networks often experiences consecutive frame losses due to either temporary link outages or traffic congestion. Although error concealment (EC) techniques have been extensively studied, they usually cannot handle the problem. Thus, we envision using EC under the unbalanced multiple description coding (UMDC) architecture. UMDC has almost no coding delay and can produce two descriptions at any bit-rates adaptive to different path bandwidths. In this paper, we propose an iterative EC algorithm able to adaptively exploit both the high-resolution (HR) and low-resolution (LR) information via multi-hypothesis weights. It is applied to both lost HR frames and following undecoded ones. Considering error propagation, we design an interframe error recovery (ER) algorithm for the undecoded HR frames. It iteratively uses multi-frame recovery principle to frame-by-frame reduce error drift in the HR stream with respect to the intermediate information from EC. The joint design of EC and ER can be applied to most UMD approaches. Extensive experiments have been carried out under different conditions. The proposed EC technique exhibits high PSNR gains versus the usual ones under the UMDC architecture and the classical ones without the support of UMDC. The proposed ER technique is efficient in reducing error drift. In conclusion, joint EC and ER can provide satisfactory performance on both PSNR and visual quality.
16377263
Personal Name Recognition Based on Categorized Linguistic Knowledge
This paper proposes an integrated approach for personal name recognition (PNR) in Chinese by utilizing both statistical language models and categorized linguistic knowledge. Various formulas are proposed for calculating personal name credibility and context credibility for different types of personal names. Experiment is conducted on large-scale corpus to evaluate the approach and the F-1 scores has reached 98.85% and 92.73% respectively in close and open test.