Case Based Reasoning (CBR) is the process of solving new problem based on the solutions of similar previous problems. XML is a markup language that allows document owners describe their data in their own formats. Ther...
详细信息
ISBN:
(纸本)9781424474226;9780769540887
Case Based Reasoning (CBR) is the process of solving new problem based on the solutions of similar previous problems. XML is a markup language that allows document owners describe their data in their own formats. There might be the same information has been described in various ways. This makes searching those information from different formats difficult. CXDR (CBR for XML Document Recommendation) is an idea to make searching XML documents easier. CXDR applies CBR framework to collect the mostly use XML document and recommend it to its user. CBR in CXDR consists of two parts, cases and knowledge. The case is XML documents and the knowledge is an XML document recommendation. The recommendation from CXDR is the most use XML element names and structure.
In this paper, Spatial Correlation-based distributed Compressed Sensing (SCDCS) model and algorithm are presented in Wireless Sensor Networks (WSN), where spatial correlation and joint sparse models between the sensor...
详细信息
In this paper, Spatial Correlation-based distributed Compressed Sensing (SCDCS) model and algorithm are presented in Wireless Sensor Networks (WSN), where spatial correlation and joint sparse models between the sensor nodes can be exploited in order to compress and reconstruct sensor observations in an energy efficient manner based on coding/decoding algorithm of SCDCS. Finally, the analysis of relationship between reconstruction error and compression ratio in SCDCS is carried out in simulation. Simulation results show that SCDCS can achieve acceptable estimation accuracy in an energy efficient way.
In order to improve the scheduling efficiency of IEEE 802.16 mesh mode, exactly theoretical analysis is necessary. In the IEEE 802.16 mesh mode with distributed coordinated scheduling, all nodes are peers and multi-ho...
详细信息
In order to improve the scheduling efficiency of IEEE 802.16 mesh mode, exactly theoretical analysis is necessary. In the IEEE 802.16 mesh mode with distributed coordinated scheduling, all nodes are peers and multi-hop communication is allowed. Every node has to compete for transmission opportunities based on scheduling information in the two-hop neighborhood. In this paper, we use probability-based method to analyze the performance of network with different topology, different holdoff time and different node degree. The analysis and numerical results show how the three factors mentioned above affect the network throughput and delay.
A new algorithm named QRNA (Quasi Regular Node Activation) is proposed in this paper, which employ equilateral triangular structure to control topology distribution of active nodes. In QRNA, sufficient and necessary c...
详细信息
A new algorithm named QRNA (Quasi Regular Node Activation) is proposed in this paper, which employ equilateral triangular structure to control topology distribution of active nodes. In QRNA, sufficient and necessary conditions for full coverage and connectivity are deduced based on a new metric, irregularity. In addition, a distributed back-off competition scheme is designed to schedule the activation of nodes to form a quasi regular network. Simulations will show that, compared to the reference algorithms, QRNA can efficiently reduce the number of active nodes, and prolong the coverage lifetime.
In order to access sensitive documents shared over government, army and enterprise intranets, users rely on an indexing facility where they can quickly locate relevant documents they are allowed to access, (1) without...
详细信息
In order to access sensitive documents shared over government, army and enterprise intranets, users rely on an indexing facility where they can quickly locate relevant documents they are allowed to access, (1) without leaking information about the remaining documents, (2) without imposing large load on the receptionist, and (3) with a balanced load on the index servers. To address this problem, we propose Mimir, a distributed cipher retrieval system for sensitive documents. Mimir constructs the distributed indexes based on load balanced term distribution for better search efficiency and load balanced query. Mimir utilizes encryption with random key, partial key update, and access control based on role and user to protect sensitive data and improve query efficiency. Mimir uses dynamic pipelined search strategy to balance the load of the management server and reduce the search delay. Our experiments show that Mimir can effectively protect secret data and answer queries nearly as fast as an ordinary inverted index.
This paper proposes a new model checking-based test generation approach for Web applications. The Kripke structure is reconstructed to model the Web application from the end users' perspective. Test coverage crite...
详细信息
ISBN:
(纸本)9781424474226;9780769540887
This paper proposes a new model checking-based test generation approach for Web applications. The Kripke structure is reconstructed to model the Web application from the end users' perspective. Test coverage criterion is expressed as trap properties in CTL so that counterexamples can be instantiated to construct test cases. But a counterexample for each trap property is generated will result in too many redundant test cases. So, a test deduction rule and an algorithm based on the greedy heuristic are given to resolve this problem. The test sequences finally generated are those satisfy the coverage criterion and have no redundancy. Throughout the paper, a typical small case study of the WGVS (Web Grade View System) is used to illustrate our approach. This approach presented can help to generate test sequences automatically for Web application and it is a significance complement to the model checking test generation.
This paper, presents a learning automata based algorithm (LABTA) to determine an appropriate time interval for topology control, while capturing network updates and minimizing algorithm overhead. This algorithm is app...
详细信息
This paper, presents a learning automata based algorithm (LABTA) to determine an appropriate time interval for topology control, while capturing network updates and minimizing algorithm overhead. This algorithm is application dependent and it is possible to consider other parameters like delay, etc. In this paper, we describe how to merge parameters and compute the fitness. We have implemented the proposed algorithm with both of standard and distributed models of the learning automata. Simulation results show that our proposed algorithm outperforms periodic topology control. In addition, a comparison can be also found between two most well known topology control protocols; LMST and K-Neigh.
With the fast increases in the size of the scientific data, the visualization technique has been widely adopted to transform the information into an easy-tounderstand representation. Since the security clearance and a...
详细信息
With the fast increases in the size of the scientific data, the visualization technique has been widely adopted to transform the information into an easy-tounderstand representation. Since the security clearance and access rights of the end users may vary greatly in a scientific visualization system, the security mechanisms must be properly designed and deployed. In this paper, we present a key management and update approach for online visualization of atmospheric nucleation. The users are divided into multiple groups and the personal secrets are determined by combining the user identities and polynomials. The personal secrets support both user authentication and visualization result encryption. We also describe the stateless key update mechanism. The proposed approach has been integrated with our visualization system and tested with real scientific data.
Recently broadcasts on the Internet, Internet movie theaters and the growing stream of service-oriented Internet services have increased. The bottleneck created to enhance network performance to meet the needs of serv...
详细信息
Recently broadcasts on the Internet, Internet movie theaters and the growing stream of service-oriented Internet services have increased. The bottleneck created to enhance network performance to meet the needs of service users has also increased, while accommodating the needs of the system for the performance of multimedia server capacity cannot meet the server specifications. To provide distributed Interactive Applications (DIAs) such as IPTV, Teleconferencing and NetGames service in a real environment it is required to have a large amount of system resource and network bandwidth. Our analysis results show that proposed scheme can reduce the network overhead for the multicast routing tree construction and uses minimal bandwidth for data delivery.
In 2006, Jun et al presented a novel non-interactive verifiable secret sharing scheme constructed by Shamir's secret sharing scheme for secure multi-party communication protocol in distributed networks. In their s...
详细信息
暂无评论