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

Enhanced Path Prediction for Network Resource Management in Wireless LANs

IEEE Wireless communications 2003年第6期10卷 62-69页

作者： Kyriakakos, Miltiadis Frangiadakis, Nikolaos Merakos, Lazaros Hadjiefthymiades, Stathes University of Athens Department of Informatics Communication Networks Laboratory Greek Consulting Firm Advanced Services Group Ltd. Communication Networks Laboratory University of Athens University of Aegean Dept. of Information Engineering Fac. of the Hellenic Open University Patras Greece Department of Telecommunication University of Maryland College Park Communication Networks Laboratory Department of Informatics University of Athens Fac. of Elec. Eng./Computer Science University of Connecticut Storrs Faculty of Electrical Computer Engineering Department Northeastern University Boston MA Commun./Digit. Proc. Research Center Northeastern University IBM T. J. Watson Research Center Yorktown Heights NY Faculty of the University of Athens Greece Department of of Informatics Communication Network Laboratory Netwk. Oper. and Management Center

Path prediction is currently being considered for use in the context of mobile and wireless computing toward more efficient network resource management schemes. Path prediction allows the network and services to further enhance the quality of service levels the user enjoys. Such mechanisms are mostly meaningful in infrastructures like wireless LANs. In this article we present a path prediction algorithm that exploits the machine learning algorithm of learning automata. The decision of the learning automaton is driven by the movement patterns of a single user but is also affected by the aggregated patterns demonstrated by all users. Simulations of the algorithm, performed using the Realistic Mobility Pattern Generator, show increased prediction accuracy.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Empirical research methods in software engineering

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2003年 2765卷 7-23页

作者： Wohlin, Claes Höst, Martin Henningsson, Kennet Dept. of Software Engineering and Computer Science Blekinge Institute of Technology Box 520 SE-372 25 Ronneby Sweden Dept. of Communication Systems Lund University Box 118 SE-221 00 Lund Sweden

Software engineering is not only about technical solutions. It is to a large extent also concerned with organizational issues, project management and human behaviour. For a discipline like software engineering, empirical methods are crucial, since they allow for incorporating human behaviour into the research approach taken. Empirical methods are common practice in many other disciplines. This chapter provides a motivation for the use of empirical methods in software engineering research. The main motivation is that it is needed from an engineering perspective to allow for informed and well-grounded decision. The chapter continues with a brief introduction to four research methods: controlled experiments, case studies, surveys and post-mortem analyses. These methods are then put into an improvement context. The four methods are presented with the objective to introduce the reader to the methods to a level that it is possible to select the most suitable method at a specific instance. The methods have in common that they all are concerned with quantitative data. However, several of them are also suitable for qualitative data. Finally, it is concluded that the methods are not competing. On the contrary, the different research methods can preferably be used together to obtain more sources of information that hopefully lead to more informed engineering decisions in software engineering. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Motivation

来源：评论

学校读者我要写书评

暂无评论

Experimentation with usage-based reading

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2003年 2765卷 193-207页

作者： Thelin, Thomas Erlansson, Magnus Höst, Martin Wohlin, Claes Dept. of Communication Systems Lund University Box 118 SE-221 00 Lund Sweden Dept. of Software Engineering and Computer Science Blekinge Institute of Technology Box 520 SE-372 25 Ronneby Sweden

Software inspections are regarded as an important technique to detect faults throughout the software development process. The individual preparation phase of software inspections has enlarged its focus from only comprehension to also include fault searching. Hence, reading techniques to support the reviewers on fault detection are needed. Usage-based reading (UBR) is a reading technique, which focuses on the important parts from a user's point of view in a software document by using prioritized use cases. UBR has been evaluated in two previously conducted experiments, which investigate the prioritization of UBR and compare UBR against checklist-based reading (CBR). This chapter presents two controlled experiments with UBR on requirements and design specifications. The experiments include individual preparation and inspection meeting, i.e. the first steps of the traditional inspection process. For the requirements inspection, UBR is evaluated against CBR, and for the design inspection, the amount of information needed in the use cases are studied. The studies were conducted in different environments with a total of about 100 students. The result from these experiments shows that UBR is not better than CBR for requirements inspections. Results from the experiment on design inspection indicate that use cases developed in advance are preferable compared to developing them as part of the preparation phase of the inspection. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Inspection

来源：评论

学校读者我要写书评

暂无评论

Information systems development through social structures 02

Information systems development through social structures

引用

14th International Conference on Software Engineering and Knowledge Engineering, SEKE '02

作者： Kolp, Manuel Giorgini, Paolo Mylopoulos, John IAG - Information Systems Unit University of Louvain 1 Place des Doyens 1348 Louvain-La-Neuve Belgium Dept. of Information and Communication Technology University of Trento 14 Via Sommerive 38100 Trento Italy Dept. of Computer Science University of Toronto 6 King's College Road Toronto ON M5S 3H5 Canada

ISBN: (纸本)1581135564

Information systems for organizations such as e-business and knowledge management systems must continually evolve to adapt to their operational environment. Unfortunately, current development methodologies do not support system evolution well, making software an obstacle to organizational changes. The paper describes a framework that develops and evolves seamlessly a system-to-be within its organizational environment. We adopt a set of social structures - organizational styles and social patterns - based on concepts of organization theory and agent approaches, as a foundation to model early and late requirements as well as architectural and detailed design. We illustrate the use of the social structures through a case study, and we specify one of the styles in Formal Tropos language. This research has been conducted within the context of the Tropos project. Copyright 2002 ACM.

关键词： Knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

On-line admission control and packet scheduling with interleaving

On-line admission control and packet scheduling with interle...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and communications Societies

作者： J.A. Garay J.S. Naor B. Yener Peng Zhao Bell Laboratories Lucent Technologies Murray Hill NJ USA Computer Science Dept. Technion Haifa Israel Department of Computer Science Bogazici University Istan-bul Turkey Department of Communication System Lausanne Switzerland Department of Communication Systems EPFL Lausanne Switzerland

This paper presents a comprehensive study of the effect of job interleaving by preemption on the throughput of a single server where requests arrive with a given processing time and slack. The problem is to decide which requests to serve so as to maximize the server's utilization. This simple model captures many situations, both at the application (e.g., delivery of video) as well as at the network/transmission levels (e.g., scheduling of packets from input to output interface of a switch). The problem is on-line in nature, and thus we use competitive analysis for measuring the performance of our scheduling algorithms. We consider two modes of operation - with and without commitment - and derive upper and lower bounds for each case. Since competitive analysis is based on the worst-case scenario, the average-case performance of the algorithms is also examined by a simulation study.

关键词： Admission control Scheduling algorithm Interleaved codes Network servers Switches Performance analysis Algorithm design and analysis Throughput Packet switching Analytical models

来源：评论

学校读者我要写书评

暂无评论

Community informatics 35

Community informatics

引用

35th Annual Hawaii International Conference on System sciences, HICSS 2002

作者： Harris, R. Vogel, D. Bieber, M. Taylor, W. Gurstein, Michael Faculty of Information Technology Universiti Malaysia Sarawak Kota SamarahanSarawak Malaysia Dept. of Information Systems City University of Hong Kong 83 Tat Chee Avenue Kowloon Hong Kong Computer and Information Science Department New Jersey Institute of Technology Information Technology Center University Heights NewarkNJ United States Faculty of Informatics and Communication Central Queensland University RockhamptonQLD Australia

来源：评论

学校读者我要写书评

暂无评论

A Method for Recognizing and Separating Trademark Image Outer Frames

引用

Journal of Advanced Computational Intelligence and Intelligent Informatics 2002年第3期6卷 116-125页

作者： Abe, Koji Kimura, Haruhiko Nagashima, Hideo Kanda, Taki Ellison Building Newcastle upon TyneNE1 8ST United Kingdom Faculty of Engineering Kanazawa University Dept. of Information and Systems Engineering 2-40-20 Kodatsuno Kanazawa920-8667 Japan Department of Computer Science and Communication Engineering Kogakuin University 1-24-2 Nishi-shinjuku Shinjuku-ku Tokyo163-8677 Japan Department of Service Management Bunri University of Hospitality 350-1336 Kashiwabarashinden Shimogawara Saitama Sayama350-1336 Japan

We present a method for recognizing the existence of outer frames in binary trademark images and segmenting a trademark that contains an outer frame into the frame and its inner figure, even if both touch. This focuses on the development of content-based image retrieval (CBIR) for trademark registration. Using our proposed method, CBIR systems examine the similarity between images using only main image components. This includes a study for describing image components. We detail criteria of trademark image outer frames and propose an algorithm for recognizing and segmenting outer frames based on the criteria. Experimental results using 1843 registered trademark images and experimental evaluation by 13 participants showed that 98.4% of recognitions agreed with human perception. © Fuji Technology Press Ltd. Creative Commons CC BY-ND: This is an Open Access article distributed under the terms of the Creative Commons Attribution-NoDerivatives 4.0 International License (http://***/licenses/by-nd/4.0/).

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A classification scheme for studies on fault-prone components

引用

Lecture Notes in computer science

作者： Runeson, Per Ohlsson, Magnus C. Wohlin, Claes Dept. of Communication Systems Lund University Box 118 LundSE-221 00 Sweden Dept. of Software Engineering & Computer Science Blekinge Institute of Technology RonnebySE-372 25 Sweden

ISBN: (纸本)3540425713

Various approaches are presented in the literature to identify faultprone components. The approaches represent a wide range of characteristics and capabilities, but they are not comparable, since different aspects are compared and different data sets are used. In order to enable a consistent and fair comparison, we propose a classification scheme, with two parts, 1) a characterisation scheme which captures information on input, output and model characteristics, and 2) an evaluation scheme which is designed for comparing different models’ capabilities. The schemes and the rationale for the elements of the schemes are presented in the paper. Important capabilities to evaluate when comparing different models are rate of misclassification, classification efficiency and total classification cost. Further, the schemes are applied in an example study to illustrate the use of the schemes. It is expected that applying these schemes would help researchers to compare different approaches and thereby enable building of a more consistent knowledge base in software engineering. In addition it is expected to help practitioners to choose a suitable prediction approach for a specific environment by filling out the characterisation scheme and making an evaluation in their own environment. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Control and data abstraction: The cornerstones of practical formal verification

引用

International Journal on Software Tools for Technology Transfer 2000年第4期2卷 328-342页

作者： Kesten, Yonit Pnueli, Amir Dept. of Communication Systems Engineering Ben Gurion University Beer-Sheva Israel Dept. of Applied Mathematics and Computer Science Weizmann Institute of Science Rehovot Israel

In spite of the impressive progress in the development of the two main methods for formal verification of reactive systems - Symbolic Model Checking and Deductive Verification, they are still limited in their ability to handle large systems. It is generally recognized that the only way these methods can ever scale up is by the extensive use of abstraction and modularization, which break the task of verifying a large system into several smaller tasks of verifying simpler systems. In this paper, we review the two main tools of compositionality and abstraction in the framework of linear temporal logic. We illustrate the application of these two methods for the reduction of an infinite-state system into a finite-state system that can then be verified using model checking. The technical contributions contained in this paper are a full formulation of abstraction when applied to a system with both weak and strong fairness requirements and to a general temporal formula, and a presentation of a compositional framework for shared variables and its application for forming network invariants. © 2000 Springer-Verlag.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for string folding problems

引用

1st IFIP International Conference on Theoretical computer science, TCS 2000

作者： Mauri, Giancarlo Pavesi, Giulio Dept. of Computer Science Systems and Communication University of Milan Bicocca Milan Italy

ISBN: (纸本)3540678239

We present polynomial{time approximation algorithms for string folding problems over any finite alphabet. Our idea is the following: describe a class of feasible solutions by means of an ambiguous contextfree grammar (i.e. there is a bijection between the set of parse trees and a subset of possible embeddings of the string);give a score to every production of the grammar, so that the total score of every parse tree (the sum of the scores of the productions of the tree) equals the score of the corresponding structure;apply a parsing algorithm to find the parse tree with the highest score, corresponding to the configuration with highest score among those generated by the grammar. Furthermore, we show how the same approach can be extended in order to deal with an infinite alphabet or different goal functions. In each case, we prove that our algorithm guarantees a performance ratio that depends on the size of the alphabet or, in case of an infinite alphabet, on the length of the input string, both for the two and three{dimensional problem. Finally, we show some experimental results for the algorithm, comparing it to other performance{guaranteed approximation algorithms. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：