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

Modelling code mobility and migration: An OPM/Web approach

International Journal of Web Engineering and technology 2005年第1期2卷 6-28页

作者： Reinhartz-Berger, Iris Dori, Dov Katz, Shmuel Technion Israel Institute of Technology Technion City Haifa 32000 Israel Department of Management Information Systems University of Haifa Israel Information Systems Engineering Area Faculty of Industrial Engineering and Management Technion Israel Institute of Technology Israel MIT Cambridge United States Computer Science Department Technion Israel Institute of Technology Israel Systems and Software Development Laboratory Israel

Web applications exhibit dynamic behaviour through such features as animation, rapidly changing presentations, and interactive forms. The growing complexity of web applications requires a rigorous modelling approach capable of clearly and explicitly addressing code mobility issues. While mobile agent systems and programming languages support the implementation of code mobility with features such as applets or mobile agents, existing system analysis and design methods lack the facilities to model code mobility satisfactorily. OPM/Web is an extension of object-process methodology (OPM) for modelling distributed systems and web applications that enables intuitive modelling of code mobility concepts in a single framework. We propose generic OPM/Web models for common code mobility design paradigms, including Remote Evaluation, Code-on-Demand, PUSH and Mobile Agents. An OPM/Web model of a mobile application that handles requests for Quality of Service over the internet exemplifies the use and advantages of modelling such systems in OPM/Web. Copyright © 2005 Inderscience Enterprises Ltd.

关键词： World Wide Web

来源：评论

学校读者我要写书评

暂无评论

High-Speed Networking: A Systematic Approach to High-Bandwidth Low-Latency Communications

High-Speed Networking: A Systematic Approach to High-Bandwid...

引用

13th Symposium on High Performance Interconnects, Hot Interconnects 13

作者： Sterbenz, James P. G. Department of Electrical Engineering and Computer Science Communications and Networking Systems Laboratory Information and Telecommunication Technology Center University of Kansas Lancaster University United Kingdom

ISBN: (纸本)0769524494

This tutorial presents a comprehensive introduction to all aspects of high-speed networking, based on the book High-Speed Networking: A Systematic Approach to High-Bandwidth Low-Latency Communication, James P.G. Sterbenz and Joseph D. Touch, John Wiley, 2001. The target audience includes computer scientists and engineers who may have expertise in a narrow aspect of high-speed networking (such as switch design), but want to gain a broader understanding of all aspects of high-speed networking and the impact that their designs have on overall network performance. This tutorial is not about any particular protocols and standards, but is rather a systemic and systematic approach to the principles that guide the research and design of high-speed networks, protocols, and applications. The network is a complex system of systems, and high-speed networking does not result from the design of individual components or protocols in isolation. Thus, this tutorial presents a systemic approach to high-speed networks, where the goal is to provide high bandwidth and low latency to distributed applications, and to deal with the high bandwidth-x-delay product that results from high-speed networking over long distances. A set of fundamental axioms is presented (Know the past present and future, Application primacy, High-performance paths, Limiting constraints, and Systemic optimisation), followed by the major topics: Network architecture and topology. Network control and signalling. Communication links Switches and routers. End systems. End-to-end protocols. Networked applications. A set of design principles are defined and applied to each of the topics: 1. Selective optimisation 2. Resource tradeoffs 3. End-to-end arguments 4. Protocol layering 5. State management 6. Control mechanism latency 7. distributed data 8. Protocol data unit structure A set of design techniques (scaling time and space, masking the speed of light, specialised hardware implementation, parallelism and pipelining,

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An analysis of expressiveness and design issues for the generalized temporal role-based access control model

An analysis of expressiveness and design issues for the gene...

引用

作者： Joshi, James B. D. Bertina, Elisa Ghafoor, Arif Department of Information Sciences and Telecommunications University of Pittsburgh Pittsburgh PA 15260 United States Department of Computer Science Purdue University West Lafayette IN 47907 United States School of Electrical and Computer Engineering Purdue University West Lafayette IN 47907 United States Department of Information Sciences and Telecommunications School of Information Sciences University of Pittsburgh United States University of Pittsburgh United States Computer Science Department Purdue University United States CERIAS United States San Jose CA United States Microelectronics and Computer Technology Corporation Rutgers University Telcordia Technologies United States School of Electrical and Computer Engineering Purdue University West Lafayette IN United States Distributed Multimedia Systems Laboratory Information Infrastructure Security Research Laboratory United States

The Generalized Temporal Role-Based Access Control (GTRBAC) model provides a comprehensive set of temporal constraint expressions which can facilitate the specification of fine-grained time-based access control policies. However, the issue of the expressiveness and usability of this model has not been previously investigated. In this paper, we present an analysis of the expressiveness of the constructs provided by this model and illustrate that its constraints-set is not minimal. We show that there is a subset of GTRBAC constraints that is sufficient to express all the access constraints that can be expressed using the full set. We also illustrate that a nonminimal GTRBAC constraint set can provide better flexibility and lower complexity of constraint representation. Based on our analysis, a set of design guidelines for the development of GTRBAC-based security administration is presented. © 2005 IEEE.

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

Leveraging architectural models to inject trust into software systems

Leveraging architectural models to inject trust into softwar...

引用

2005 Workshop on Software Engineering for Secure systems - Building Trustworthy Applications, SESS 2005

作者： Banerjee, Somo Mattmann, Chris A. Medvidovic, Nenad Golubchik, Leana Computer Science Department University of Southern California Los AngelesCA90089 United States Jet Propulsion Laboratory California Institute of Technology PasadenaCA91109 United States EE-Systems Dept IMSC ISI University of Southern California Los AngelesCA90089 United States

ISBN: (纸本)1595931147

Existing software systems have become increasingly durable and their lifetimes have significantly lengthened. They are increasingly distributed and decentralized. Our dependence on them has grown tremendously. As such, the issues of trustworthiness and security have become prime concerns in designing, constructing, and evolving software systems. However, the exact meanings of these concepts are not universally agreed upon, nor is their role in the different phases of the software development lifecycle. In this paper, we argue that trustworthiness is a more broadly encompassing term than security, and that the two are often interdependent. We then identify a set of dimensions of trustworthiness. Finally, we analyze how the key elements of a software system's architecture can be leveraged in support of those trustworthiness dimensions. Our ultimate goal is to apply these ideas in the context of a concrete software architecture project. The goal of this paper is more modest: to understand the problem area and its relation to software architecture. © 2005 ACM.

关键词： Software architecture

来源：评论

学校读者我要写书评

暂无评论

Collaborative Filtering by Mining Association Rules from User Access Sequences

Collaborative Filtering by Mining Association Rules from Use...

引用

International Workshop on Challenges in Web Information Retrieval and Integration (WIRI)

作者： Mei-Ling Shyu C. Haruechaiyasak Shu-Ching Chen Na Zhao Department of Electrical and Computer Engineering University of Miami Coral Gables FL USA Information Research and Development Division National Electronics and Computer Technology Center Pathum Thani Thailand Distributed Multimedia Information System Laboratory School of Computer Science Florida International University Miami FL USA

Recent research in mining user access patterns for predicting Web page requests focuses only on consecutive sequential Web page accesses, i.e., pages which are accessed by following the hyperlinks. In this paper, we propose a new method for mining user access patterns that allows the prediction of multiple non-consecutive Web pages, i.e., any pages within the Web site. Our approach consists of two major steps. First, the shortest path algorithm in graph theory is applied to find the distances between Web pages. In order to capture user access behavior on the Web, the distances are derived from user access sequences, as opposed to static structural hyperlinks. We refer to these distances as minimum reaching distance (MRD) information. The association rule mining (ARM) technique is then applied to form a set of predictive rules which are further refined and pruned by using the MRD information. The proposed approach is applied as a collaborative filtering technique to recommend Web pages within a Web site. Experimental results demonstrate that our approach improves performance over the existing Markov model approach in terms of precision and recall, and also has a better potential of reducing the user access time on the Web

关键词： Collaboration Data mining Association rules Web pages Predictive models Information filtering Information filters Web server Research and development distributed computing

来源：评论

学校读者我要写书评

暂无评论

Journal of Information science and Engineering: Editorial notice

引用

Journal of Information science and Engineering 2005年第5期21卷 i-ii页

作者： Lee, Der-Tsai Amato, Nancy M. Chang, Shih-Fu Chen, Homer H. Chen, Tsuhan Hsu, Tsan-Sheng Hwang, Jenq-Neng Kuo, Sy-Yen Kuo, Tei-Wei Li, Chung-Sheng Tokuyama, Takeshi Wing, Jeannette Wu, Tzong-Chen Yen, John Computer Science at Texas A and M University United States Parasol Laboratory United States IEEE Transactions on Parallel and Distributed Systems Computing Research Association's Committee on the Status of Women in Computing Research CRA-W's Distributed Mentor Program United States Department of Electrical Engineering Columbia University United States Lab. United States College of Electrical Engineering and Computer Science National Taiwan University Taiwan IEEE Transactions on Circuits and Systems for Video Technology IEEE Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA United States ACM ACM SIGACT IEEE Computer Society IICM Austria Research and Development of the Department Multimedia Signal Processing Technical Committee IEEE Signal Processing Society United States IEEE Transactions on Circuits and systems for Video Technology College of Electrical Engineering and Computer Science National Taiwan Ocean University Keelung Taiwan Department of Electrical Engineering National Taiwan University Taiwan Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan IEEE Technical Committee on Real-Time Systems Computer Science Division IBM T.J. Watson Research Center United States IBM Research Division Graduate School of Information Sciences Tohoku University Japan ACM IPSJ Mathematical Society of Japan Japan Department of Computer Science Computer Science Department Carnegie Mellon University United States National Academies of Science's Computer Science and Telecommunications Board United States Microsoft's Trustworthy Academic Advisory Board Intel Research Pittsburgh's Advisory Board United States Dartmouth's Institute for Security Technology Studies Advisory Committee Canada Sloan Research Fellowships Program Committee United States ACM Taiwan China Information Sciences and Technology Pennsylvania State University United States Laboratory for Intelligent Agents Penn State's School of Info

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Processor allocation for tasks that is robust against errors in computation time estimates

Processor allocation for tasks that is robust against errors...

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： P.V. Sugavanam H.J. Siegel A.A. Maciejewski S.A. Ali M. Al-Otaibi M. Aydin K. Guru A. Horiuchi Y.G. Krishnamurthy P. Lee A. Mehta O. Oltikar R. Pichel A.J. Pippin M. Raskey V. Shestak J. Zhang Department of Electrical & Computer Engineering Colorado State University Fort Collins CO USA Department of Electrical & Computer Engineering Department of Computer Science Colorado State University Fort Collins CO USA Systems & VLSI Technology Division Hewlett Packard Company Fort Collins CO USA Linux & Open Source Laboratory Colorado State University Fort Collins CO USA School of Computer Science Salt Lake UT USA

Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures, higher than expected load, or inaccuracies in estimation of system parameters. Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that is optimized in such systems. It is important that the makespan of a resource allocation (mapping) be robust against errors in task computation time estimates. The problem of optimally mapping tasks onto machines of a heterogeneous computing environment has been shown, in general, to be NP-complete. Therefore, heuristic techniques to find near optimal solutions to this mapping problem are required. The goal of this research is to find a static mapping of tasks so that the robustness of the desired system feature, makespan, is maximized against the errors in task execution time estimates. Seven heuristics to derive near-optimal solutions and an upper bound to this problem are presented and evaluated.

关键词： Robustness Resource management State estimation Parameter estimation Educational technology Production computer science Active appearance model Very large scale integration Linux

来源：评论

学校读者我要写书评

暂无评论

Geometric spanners for routing in mobile networks

Geometric spanners for routing in mobile networks

引用

作者： Gao, Jie Guibas, Leonidas J. Hershberger, John Zhang, Li Zhu, An Department of Computer Science Stanford University Stanford CA 94305 United States Ctr. for the Math. of Information California Institute of Technology Pasadena CA 91125 United States Mentor Graphics Corporation Wilsonville OR 97070 United States Compaq Systems Research Center Palo Alto CA Information Dynamics Laboratory Hewlett Packard Laboratories Palo Alto CA 94304 United States

We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: 1) it is planar;2) between any two graph nodes there exists a path whose length, whether measured in terms of topological or Euclidean distance, is only a constant times the minimum length possible;and 3) the graph can be maintained efficiently in a distributed manner when the nodes move around. Furthermore, each node only needs constant time to make routing decisions. We show by simulation that the RDG outperforms previously proposed routing graphs in the context of the Greedy perimeter stateless routing (GPSR) protocol. Finally, we investigate theoretical bounds on the quality of paths discovered using GPSR.

关键词： Telecommunication networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：