The concept of concurrent signatures was introduced by Chen, Kudla and Paterson in their seminal paper in Eurocrypt 2004 which allows two entities to produce two signatures in such a way that, the signer of each signa...
详细信息
The concept of concurrent signatures was introduced by Chen, Kudla and Paterson in their seminal paper in Eurocrypt 2004 which allows two entities to produce two signatures in such a way that, the signer of each signature is ambiguous from any third party's point of view until the release of a secret, known as the keystone. Once the keystone is released, both signatures become binding to their respective signers concurrently. Later, a stronger notion called perfect concurrent signatures with two concrete schemes was proposed by Susilo, Mu and Zhang. In perfect concurrent signatures, although both signers are known to be trustworthy, the two signatures are still ambiguous to any third party. Unfortunately, Susilo et al.'s schemes are unfair. In this paper, we first show that in their schemes the initial signer can cheat the matching signer by carefully choosing some communication value and then propose fair perfect concurrent signature protocol to fix our attacks.
This paper describes the design of an outdoor Distributed Mixed Reality (DMR) system to support multi-user interaction of multi-users and virtual object manipulations in a construction simulation. The proposed DMR sys...
详细信息
This paper describes a fully automated technique for detection and categorization of the seven basic facial expressions using Support Vector Machines (SVM). Facial expressions are communicated by subtle changes in one...
详细信息
In this paper, we propose a new model for securing agent-based systems in which agents are equipped with reasoning capabilities allowing them to interact with each other. The agents can reason about the reputation of ...
详细信息
In this paper, we propose a new model for securing agent-based systems in which agents are equipped with reasoning capabilities allowing them to interact with each other. The agents can reason about the reputation of each other using their argumentation systems. The reputation is dealt with as a quantitative value computed using a set of parameters based on the interaction histories and the notion of social networks. The problem of securing autonomous interacting agents in a distributed setting is core to a number of applications, particularly the emerging semantic grid computing-based applications such as e-business. Current approaches fail to adequately address the challenges of security in these emerging applications. These approaches are either centralized on mechanisms such as digital certificates, and thus are particularly vulnerable to attacks, or are not suitable for argumentation-based agent systems in which agents use advanced reasoning capabilities
Recommendation system is one of the most important technologies applied in e-commerce. Similarity measuring method is fundamental to collaborative filtering algorithm, and traditional methods are inefficient especiall...
详细信息
Recommendation system is one of the most important technologies applied in e-commerce. Similarity measuring method is fundamental to collaborative filtering algorithm, and traditional methods are inefficient especially when the user rating data are extremely sparse. Based on the outstanding characteristics of Cloud Model on the process of transforming a qualitative concept to a set of quantitative numerical values, a novel similarity measuring method, namely the likeness comparing method based on cloud model (LICM) is proposed in this paper. LICM compares the similarity of two users on knowledge level, which can overcome the drawback of attributes' strictly matching. This work analysis traditional methods throughly and puts forward a novel collaborative filtering algorithm, which is based on the LICM method. Experiments on typical data set show the excellent performance of the present collaborative filtering algorithm based on LICM, even with extremely sparsity of data.
In this paper, combined with Tatsuoka 's Rule Space Model and the Attribute hierarchy Method (AHM), Formal Concept Analysis (FCA) is firstly applied into computerized Adaptive Testing (CAT). Based on FCA, an initi...
详细信息
In this paper, combined with Tatsuoka 's Rule Space Model and the Attribute hierarchy Method (AHM), Formal Concept Analysis (FCA) is firstly applied into computerized Adaptive Testing (CAT). Based on FCA, an initiatory and systemic CAT with cognitive diagnosis (CD) is designed, which diagnoses examinees real time. The result of Monte Carlo study shows that examinees ' knowledge states are well diagnosed and the precision in examinees ' abilities estimation is satisfied.
In a wireless sensor network for data-gathering applications, if all network data congregate to a stationary sink node hop by hop, the sensor nodes near the sink have to consume more energy on forwarding data for othe...
详细信息
In a wireless sensor network for data-gathering applications, if all network data congregate to a stationary sink node hop by hop, the sensor nodes near the sink have to consume more energy on forwarding data for other nodes, which probably causes the early function loss of the sensor network. Employing a mobile sink can alleviate the hotspot problem and balance the energy consumption among the sensor nodes. In this paper, we propose two autonomous moving schemes for the mobile sink. In our schemes, the sink makes moving decisions without complete knowledge of network topology and the energy distribution of all sensor nodes. We evaluated the performance of our moving schemes by simulation and the results show that both the two schemes can extend the network lifetime prominently.
AXML (active XML) is a framework for peer-to-peer data integration from XML sources. In AXML documents data can be presented extensionally or intentionally by including calls to local or remote Web services. In comple...
详细信息
AXML (active XML) is a framework for peer-to-peer data integration from XML sources. In AXML documents data can be presented extensionally or intentionally by including calls to local or remote Web services. In complex AXML-based systems data retrieval can be inefficient. In the paper we propose a caching mechanism for systems based on active XML. We show how it can influence network communication and data integration processes.
This paper considers the general filtering problem for a distinct class of two-dimensional (2-D) discrete linear systems, i.e. information propagation in two independent directions, known as discrete linear repetitive...
详细信息
Knowledge reduction is one of the most important issues in rough sets theory. Many works are related to connection-degree-based rough sets model to treat incomplete information systems. However, the model is not used ...
详细信息
Knowledge reduction is one of the most important issues in rough sets theory. Many works are related to connection-degree-based rough sets model to treat incomplete information systems. However, the model is not used to knowledge reduction. In this paper, a connection-degree-based rough sets model is proposed and used to knowledge reduction. Two ways for knowledge reduction are proposed and the relationships between them are shown. A knowledge reduction algorithm is also shown for incomplete information systems. The algorithm is based on elementary discernibility matrix and the significance degree of an attribute. Examples are used to show that the validity of the algorithm.
暂无评论