检索结果-内蒙古大学图书馆

作者： Hua, Han Yafei, Dai Xiaoming, Li Computer Networks and Distributed Systems Laboratory Department of Computer Science and Technology Peking University Beijing 100871 China

The CSFS (cryptographic storage file system) is a network file storage system that is suitable for a small-to-medium sized networks such as a campus network. In a CSFS, a lot of distributed file servers are organized in a star-liked architecture. File names are stored in a name server and file data are stored in distributed file servers. A CSFS has good scalability and is able to accommodate hundreds of file servers. We implemented a CSFS in pure Java and tested the system with a benchmark. The test results show that CSFS delivers acceptable performance for general file operations. Its performance of file upload and download is as efficient as FTP. It can support more than 450 concurrent online users. Copyright © 2005 John Wiley & Sons, Ltd.

关键词： File organization

来源：评论

学校读者我要写书评

暂无评论

Roles:From objects, security and databases perspective

Roles:From objects, security and databases perspective

引用

2005 AAAI Fall Symposium

作者： Chandra Sekharaiah, Kangaluru Janaki Ram, D. Distributed Object Systems Group Department of Computer Science and Engg. JNTU College of Engineering Hyderabad India Distributed Object Systems Lab. Department of Computer Science and Engg. Indian Institute of Technology Madras

ISBN: (纸本)1577352548

A role paradigm conformance model (RPCM) called Typehole model was developed and implemented in Java. It does not use Is-role-of inheritance and is free from the object schizophrenia (OS) problem (OSP). An extended distributed role model provides multifarious role hierarchies at different sites. Modeling object role systems is prone to OSP. OSP is the error in the RPCM design to subscribe to the viewpoints in the client space. OS and OSP are contrasted. A classification of OSPs is made. Role modeling problem is the requirement to design an OSP-free RPCM with Is-role-of inheritance. The existing object-oriented role models have been evaluated as regards OSP. No role model has strong claims as regards solving the role modeling problem. A security model was developed for RPCM-based distributed object systems and implemented on CORBA. By designing message filter hierarchies, hybrid security is developed at global and local levels for RPCM-based object systems. Role is either abstract or concrete as it can be a type or an instance. Copyright © 2005, American Association for Artificial Intelligence (***). All rights reserved.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

M2DR: A near-optimal multiclass minimum-delay routing algorithm for smart radio access networks

M2DR: A near-optimal multiclass minimum-delay routing algori...

引用

IEEE Conference on Local computer Networks - 30th Anniversary, LCN 2005

作者： Hollick, Matthias Mogre, Parag S. Krop, Tronje Huth, Hans-Peter Schmitt, Jens B. Steinmetz, Ralf Department of Electrical Engineering and Information Technology Technische Universität Darmstadt Merckstrasse 25 64283 Darmstadt Germany Siemens AG Corporate Technology Department Information and Communications Munich Germany Distributed Computer Systems Lab. Computer Science Department University of Kaiserslautern Germany

ISBN: (纸本)0769524214

Today, we witness a transformation of radio access network topologies from strictly tree-structured towards meshed architectures. Yet, these edge networks follow mostly circuit-switched paradigms to support quality of service applications such as voice or video communication. In this work, we develop a novel quality of service aware routing framework to optimize the performance of edge networks in the packet-switched domain. Starting from the Internet's best-effort routing paradigm and building on related work, we formulate a near-optimal multiclass minimum-delay routing algorithm. Our algorithm optimizes network-wide end-to-end delay and allows for differentiation of service. We exploit two orthogonal dimensions namely multipath routing and class-based service prioritization. We provide a precise description of our algorithm and a detailed experimental analysis against state of the art routing algorithms. Our algorithm is able to achieve excellent performance while maintaining the simplicity of a decentralized and distributed routing algorithm, thus matching the requirements for future radio access networks. © 2005 IEEE.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

distributed mining of partial periodic patterns in sequences

Distributed mining of partial periodic patterns in sequences

引用

作者： Hsiao, Han-Wen Tsai, Meng-Shu Tsai, Jeffrey J. P. Department of Computer Science and Information Engineering Asia University Taiwan Taiwan Institute of Information Technology Asia University Taiwan Taiwan Department of Computer Science University of Illinois Chicago United States Taichung Healthcare and Management University Department of Computer Science and Information Engineering Department of Biotechnology and Bioinformatics Department of Electrical Engineering and Computer Science University of Illinois Chicago Distributed Real-Time Intelligent Systems Laboratory

It has been an important task of discovering frequent fragments as particular patterns from large sequence databases generated from a variety of applications. In general, the patterns to be discovered may partially and asynchronously exist in sequences, and even contain gaps. In addition, it is necessary to collect the information regarding the locations and frequencies of the patterns. How to enumerate candidate patterns for evaluation without exponentially increasing the computation is another problem. In this paper, the modified periodicity transform is proposed to meet the requirements mentioned above. Also, a distributed computing framework is implemented to perform the mining task more efficiently. Both synthetic and biological sequences are utilized to examine the approach. The experimental results demonstrate the efficiency and effectiveness the system.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

BondFlow: A system for distributed coordination of workflows over Web services

BondFlow: A system for distributed coordination of workflows...

引用

19th IEEE International Parallel and distributed Processing Symposium, IPDPS 2005

作者： Balasooriya, Janaka Padhye, Mohini Prasad, Sushil K. Navathe, Shamkant B. Georgia State University Atlanta Georgia Institute of Technology Atlanta Computer Science Department Georgia State University Yamacraw/GEDC Distributed Mobile and Embedded Systems Program College of Computing Georgia Institute of Technology Atlanta United States

ISBN: (纸本)0769523129

Today's collaborative applications over the web span domains as diverse as enterprise e-commerce applications and biomedical applications. We have previously developed and formally investigated "Web Coordination Bonds," a theoretically powerful artifact for interconnecting autonomous web objects for control and data flows, and for enforcing dependencies. Here, we describe BondFlow, a system that enables the configuration and execution of workflows using web bonds over heterogeneous web objects. The system automatically generates lightweight proxy wrapper objects to enable encapsulated web services to be interconnected through web bonds. The small footprint wrappers (less than 10 KB) can reside on Java-enabled handheld devices. We describe the design, architecture and performance of the Bond-Flow system. Our initial performance results indicate that both wrapper creation time and web bond related execution time are small. In contrast to our BondFlow system, existing systems need expert programming to create workflows, do not easily allow distributed coordination of workflows, and usually do not support heterogeneity of device, data and network. The system is preliminary, and further research is ongoing to extend its configuration and execution platforms.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Event handling for the universal enterprise

引用

Information technology and Management 2005年第1期6卷 123-148页

作者： Cilia, Mariano Bornhövd, Christof Buchmann, Alejandro P. Databases/Distributed Systems Group Department of Computer Science Darmstadt University of Technology 64289 Darmstadt Hochschulstr. 10 Germany Faculty of Sciences UNICEN Tandil Argentina IBM Almaden Research Center San Jose CA United States

Current trends in the global economy are leading to inter-enterprise interactions and to new business models that depend on the timely notification of events and the reaction to them. In this paper we present a distributed reactive middleware that supports the proactive notification of events in heterogeneous environments. The infrastructure consists of a publish/subscribe notification mechanism and a reactive functionality. We represent events that may originate from heterogeneous sources together with their ontology-based context metadata to make them self-describing beyond the boundaries of the event source. We introduce the notion of concept-based addressing to publish/subscribe systems. Concept-based addressing allows us to express subscriptions to events according to different contexts than those of the published events and yet match them successfully. By using ontologies and context definitions consistently for events, notifications, subscriptions and reactions we provide the necessary support for event handling in global enterprises. © 2005 Springer science + Business Media, Inc.

关键词： Business rules Event handling Event-based applications Publish/subscribe Reactive service Semantic data integration

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a highperformance network intrusion prevention system

Design and implementation of a highperformance network intru...

引用

20th IFIP International Information Security Conference, IFIP/SEC 2005

作者： Xinidis, Konstantinos Anagnostakis, Kostas G. Markatos, Evangelos P. Institute of Computer Science Foundation for Research and Technology Hellas P.0 Box 1385 Heraklio GR-711-10 Greece Distributed Systems Laboratory CIS Department Univ. of Pennsylvania 200 S. 33rd Street PhiladelphiaPA19104 United States

ISBN: (纸本)038725658X

Network intrusion prevention systems provide proactive defense against security threats by detecting and blocking attack-related traffic. This task can be highly complex, and therefore, software-based network intrusion prevention systems have difficulty in handling high speed links. This paper describes the design and implementation of a high-performance network intrusion prevention system that combines the use of software-based network intrusion prevention sensors and a network processor board. The network processor acts as a customized load balancing splitter that cooperates with a set of modified content-based network intrusion detection sensors in processing network traffic. We show that the components of such a system, if co-designed, can achieve high performance, while minimizing redundant processing and communication. We have implemented the system using low-cost, off-theshelf technology: an IXP1200 network processor evaluation board and commodity PCs. Our evaluation shows that our enhancements can reduce the processing load of the sensors by at least 45% resulting in a system that can handle a fully-loaded Gigabit Ethernet link using at most four commodity PCs. Copyright © 2005 by International Federation for Information Processing.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Analyzing and modifying Chord's stabilization algorithm to handle high churn rates

Analyzing and modifying Chord's stabilization algorithm to h...

引用

IEEE International Conference on Networks

作者： G. Kunzmann A. Binzenhofer R. Henjes Institute of Communication Networks Munich University of Technology Munich Germany Department of Distributed Systems Institute of Computer Science University of Würzburg Wurzburg Germany

Peer-to-peer (P2P) networks offer reliable and efficient services in different application scenarios. In particular, structured P2P protocols (like Chord (L. Stoica et al., 2001)) have to handle changes in the overlay topology fast and with as little signaling overhead as possible. This paper analyzes the ability of the Chord protocol to keep the network structure up to date, even in environments with high churn rates, i.e. nodes joining and leaving the network frequently. High churn rates occur, e.g., in mobile environments, where participants have to deal with the limited resources of their mobile devices, such as short battery lifetimes or high communication costs. In this paper, we analyze different design parameters and their influence on the stability of Chord-based network structures. We also present several modifications to the basic Chord stabilization scheme, resulting in a much more stable overlay topology.

关键词： Algorithm design and analysis Fingers Protocols Intrusion detection Network topology Routing Counting circuits Electronic mail Batteries Costs

来源：评论

学校读者我要写书评

暂无评论

Efficient content-based detection of zero-day worms

Efficient content-based detection of zero-day worms

引用

IEEE International Conference on Communications (ICC)

作者： P. Akritidis K. Anagnostakis E.P. Markatos Foundation for Research & Technology Hellas Institute for Computer Science Heraklion Greece Distributed Systems Laboratory CIS Department University of Pennsylvania Philadelphia PA USA

Recent cybersecurity incidents suggest that Internet worms can spread so fast that in-time human-mediated reaction is not possible, and therefore initial response to cyberattacks has to be automated. The first step towards combating new unknown worms is to be able to detect and identify them at the first stages of their spread. In this paper, we present a novel method for detecting new worms based on identifying similar packet contents directed to multiple destination hosts. We evaluate our method using real traffic traces that contain real worms. Our results suggest that our approach is able to identify novel worms while at the same time the generated false alarms reach as low as zero percent.

关键词： computer worms Internet computer crime Telecommunication traffic Intrusion detection IP networks Payloads Detection algorithms computer science Laboratories

来源：评论

学校读者我要写书评

暂无评论

Correlation between time and frequency domain polarisation measurements for transformer moisture assessment

Correlation between time and frequency domain polarisation m...

引用

作者： Saha, T.K. Middleton, R. Thomas, A. School of Information Technology and Electrical Engineering University of Queensland School of Electrical Engineering and Computer Science University of Newcastle Department of Electrical Engineering School of Information Technology and Electrical Engineering University of Queensland Australia Engineers Australia University of Newcastle Centre for Complex Dynamic Systems and Control CRC Board of Governors IEEE Control System Society University of Queensland's School of Information Technology and Electrical Engineering

Preventative diagnosis and maintenance of transformers has become more popular in recent times in order to improve the reliability of electric power systems. A number of transformers have recently been tested using Return Voltage (RV) and Dielectric Dissipation Factor (tanδ) measurements in the time and frequency domain, respectively. This paper outlines a circuit model which describes the dielectric behaviour of the transformer insulation system and has been parameterised from the frequency domain data. This model was then used to simulate RV and Polarisation-Depolarisation current (PDC) results. Some recommendations about the diagnosis of the transformers have been proposed. © Institution of Engineers.

关键词： Electric transformers

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：