检索结果-南通市图书馆

Dynamically Authorized Role-Based Access Control for Grid Applications

在线全文

学校读者我要写书评

暂无评论

Geo-Spatial Information Science 2006年第3期9卷 223-228,233页

作者： YAO Hanbing HU Heping lu zhengding LI Ruixuan College of Computer Science and Technology Huazhong University of Science and Technology Guanshan Wuhan 430074 China

Grid computing is concerned with the sharing and coordinated use of diverse resources in distributed “virtual organizations”. The heterogeneous, dynamic and multi-domain nature of these environments makes challenging security issues that demand new technical approaches. Despite the recent advances in access control approaches applicable to Grid computing, there remain issues that impede the development of effective access control models for Grid applications. Among them there are the lack of context-based models for access control, and reliance on identity or capability-based access control schemes. An access control scheme that resolve these issues is presented, and a dynamically authorized role-based access control (D-RBAC) model extending the RBAC with context constraints is proposed. The D-RABC mechanisms dynamically grant permissions to users based on a set of contextual information collected from the system and user’s environments, while retaining the advantages of RBAC model. The implementation architecture of D-RBAC for the Grid application is also described.

关键词： Grid security RBAC context-based access control

A New Clustering Algorithm for Categorical Attributes

在线全文

学校读者我要写书评

暂无评论

International Journal of Minerals,Metallurgy and Materials 2000年第4期14卷 318-322页

作者： Songfeng lu, zhengding lu (College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China) College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

In traditional data clustering, similarity of a cluster of objects is measured by distance between objects. Such measures are not appropriate for categorical data. A new clustering criterion to determine the similarity between points with categorical attributes is pre- sented. Furthermore, a new clustering algorithm for categorical attributes is addressed. A single scan of the dataset yields a good clus- tering, and more additional passes can be used to improve the quality further.

关键词： data mining clustering similarity Information

A Routing Algorithm for Risk-Scanning Agents Using Ant Colony Algorithm in P2P Network

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2006年第5期11卷 1097-1103页

作者： TANG Zhuo lu zhengding LI Ruixuan College of Computer Science and Technology HuazhongUniversity of Science and Technology Wuhan 430074H ubei China

This paper describes a routing algorithm for risk scanning agents using ant colony algorithm in P2P（peerto peer） network. Every peer in the P2P network is capable of updating its routing table in a real-time way, which enables agents to dynamically and automatically select, according to current traffic condition of the network, the global optimal traversal path. An adjusting mechanism is given to adjust the routing table when peers join or leave. By means of exchanging pheromone intensity of part of paths, the algorithm provides agents with more choices as to which one to move and avoids prematurely reaching local optimal path. And parameters of the algorithm are determined by lots of simulation testing. And we also compare with other routing algorithms in unstructured P2P network in the end.

关键词： risk ant colony algorithm P2P

A Formal Model for BPEL4WS Description of Web Service Composition

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2006年第5期11卷 1311-1319页

作者： GU Xiwu lu zhengding College of Computer Science and Technology HuazhongUniversity of Science and Technology Wuhan 430074Hubei China

Communicating Sequential Processes （CSP） is a kind of process algebra, which is suitable for modeling and verifying Web service composition. This paper describes how to model Web service composition with CSP. A set of rules for translating composition constructor of Business Process Execution Language for Web Services （BPEL4WS） to CSP notations is defined. According to the rules that have been defined, the corresponding translation algorithm is designed and illustrated with examples . The methods for model checking, model verification and model simulation are also introduced.

关键词： communicating sequential processes Web service Web service composition business process execution language for Web services

Using Link Analysis Technique with a Modified Shortest-Path Algorithm to Fight Money Laundering

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2006年第5期11卷 1352-1356页

作者： CHEN Yunkai MAI Quanwe lu zhengding College of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 Hubei China Department of Informaiton State Administration ofForeign Exchange Beijing 100037 China

Effective link analysis techniques are needed to help law enforcement and intelligence agencies fight money laundering. This paper presents a link analysis technique that uses a modified shortest-path algorithms to identify the strongest association paths between entities in a money laundering network. Based on two-tree Dijkstra and Priority＇First-Search （PFS） algorithm, a modified algorithm is presented. To apply the algorithm, a network representation transformation is made first.

关键词： link analysis shortest-path algorithm fight money laundering

Time-Based Dynamic Trust Model Using Ant Colony Algorithm

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2006年第6期11卷 1462-1466页

作者： TANG Zhuo lu zhengding LI Kai College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 Hubei China

The trust in distributed environment is uncertain, which is variation for various factors. This paper introduces TDTM, a model for time-based dynamic trust. Every entity in the distribute environment is endowed with a trust-vector, which figures the trust intensity between this entity and the others. The trust intensity is dynamic due to the time and the inter-operation between two entities, a method is proposed to quantify this change based on the mind of ant colony algorithm and then an algorithm for the transfer of trust relation is also proposed. Furthermore, this paper analyses the influence to the trust intensity among all entities that is aroused by the change of trust intensity between the two entities, and presents an algorithm to resolve the problem. Finally, we show the process of the trusts＇ change that is aroused by the time＇s lapse and the inter-operation through an instance.

关键词： dynamic trust ant colony algorithm Inter-operation time-based

TSPN: Term-Based Semantic Peer-to-Peer Networks

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2012年第1期17卷 31-35页

作者： GAO Guoqiang LI Ruixuan lu zhengding School of Computer Science and Technology HuazhongUniversity of Science and Technology Wuhan 430074 HubeiChina School of Media and Communication Wuhan TextileUniversity Wuhan 430073 Hubei China

In this paper, we propose Term-based Semantic Peerto-Peer Networks （TSPN） to achieve semantic search. For each peer, TSPN builds a full text index of its documents. Through the analysis of resources, TSPN obtains series of terms, and distributes these terms into the network. Thus, TSPN can use query terms to locate appropriate peers to perform semantic search. Moreover, unlike the traditional structured P2P networks, TSPN uses the terms, not the peers, as the logical nodes of DHT. This can withstand the impact of network chum. The experimental results show that TSPN has better performance compared with the existing P2P semantic searching algorithms.

关键词： Term-based Semantic Peer-to-Peer Networks (TSPN) peer-to-peer semantic parsing semantic DHT

Resolution for Conflicts of Inter-Operation in Multi-Domain Environment

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2007年第5期12卷 955-960页

作者： lu zhengding WEN Zhumu TANG Zhuo LI Ruixuan College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 Hubei China

This paper proposes a method to formalize the interoperation in multi-domain environment. Through employing the algebra method, we conclude four types of the conflicts for the interoperation, and analyzes the cause of the policy conflicts. For each type of conflicts, we formalize it and proposes the method of detection and resolution. Finally, the method is illuminated be effective through comparing our work with others.

关键词： conflicts inter-operation multi-domain

A Novel Web Query Automatic Expansion Based on Rough Set

在线全文

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2006年第5期11卷 1167-1171页

作者： YI Gaoxiang HU Heping lu zhengding LI Ruixuan College of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 Hubei China China Academy of Safety Science and Technology Beijing 100029 China

One of important reasons caused low precision was presented, which was due to inaccurate express of the query. So a new method of automatic query expansion based on tolerance rough was put forward. In the algorithm, the uncertain connection between query terms and retrial documents was described as term tolerance class. The upper approximation set of query sentence was considered as query expansion. The new additional terms were also given weight numbers. The results of experiment on collection of Google 5 000 Web pages showed that the approach was effective on query expansion and high search precision was gained.

关键词： Web query query expansion rough set