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

OASIS - An ASIS secondary library for analyzing object-oriented Ada code 6th

6th Ada-Europe International Conference on Reliable software Technologies, Ada-Europe 2001

作者： Kuchumov, Alexei Rybin, Sergey Strohmeier, Alfred Scientific Research Computer Center Moscow State University Vorob'evi Gori Moscow119899 Russia Swiss Federal Institute of Technology in Lausanne Software Engineering Lab Department of Computer Science EPFL Lausanne1015 Switzerland

ISBN: (纸本)3540421238

ASIS has proven to be an effective platform for developing various program analysis tools. However, in many cases ASIS, as defined in the ASIS ISO standard, appears to be at a very low-level of abstraction compared to the needs of the tool developer. Higher-level interfaces and common libraries for specific needs should therefore be developed. The paper describes a ASIS secondary library providing abstractions and queries for analyzing object-oriented Ada code. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

A dead reckoning algorithm with variable threshold scheme in networked virtual environment

A dead reckoning algorithm with variable threshold scheme in...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Kwang-Hyun Shim Jong-Sung Kim VR Center Computer and Software Technology Laboratory Electronics and Telecommnications Research Institute Taejon South Korea

This paper proposes a dead reckoning algorithm with variable threshold scheme and a variable transmission rate scheme to reduce the number of state update packets while maintaining user's performance requirements in client-server-based Net-VE (Networked Virtual Environment). The main idea of this paper is to send more update information of a shared-object to a close participant from it than a far one. By using Markov chain, we model dynamic behavior of a participant in Net-VE system with dead-reckoning algorithm and derive formulas to evaluate performance of the proposed schemes. We provide computer simulation results in order to investigate effect of the proposed schemes.

关键词： Dead reckoning Intelligent networks Virtual environment Network servers Telecommunication traffic computer networks computer simulation Military computing Performance analysis Virtual reality

来源：评论

学校读者我要写书评

暂无评论

An enhanced concurrency control scheme for multi-dimensional index structures 7

An enhanced concurrency control scheme for multi-dimensional...

引用

7th International Conference on Database Systems for Advanced Applications, DASFAA 2001

作者： Song, Seok Il Kim, Young Ho Yoo, Jae Soo Dept. of Comput. and Commun. Eng. Chung-Buk Nat. Univ. Cheongju Korea Republic of Electronics and Telecommunications Research Institute Computer and Software Technology Labs. Internet Service Department Korea Republic of

ISBN: (纸本)0769509967

Propose an enhanced concurrency control algorithm that minimizes the query delay efficiently. The factors that delay search operations and deteriorate the concurrency of index structures are node splits and minimum bounding region (MBR) updates in multi-dimensional index structures. In our algorithm, in order to reduce the query delay by splitting operations, we optimize the exclusive latching time on a split node. It does not hold exclusive latches throughout the whole split time but only during the physical node split time, which occupies only a small part of the whole split time. Also, to avoid the query delay caused by MBR updates, we introduce the partial lock coupling (PLC) technique. PLC increases concurrency by using lock coupling only in the case of MBR shrinking operations that are less frequent than MBR expansion operations. For performance evaluation, we implement the proposed algorithm and one of the existing link technique-based algorithms on MIDAS-III, which is the storage system of the BADA-III DBMS. We show, through various experiments, that our proposed algorithm outperforms the existing algorithm in terms of throughput and response time. © 2001 IEEE.

关键词： Locks (fasteners)

来源：评论

学校读者我要写书评

暂无评论

Adaptive hierarchical stereo matching using object segmentation and window warping

Adaptive hierarchical stereo matching using object segmentat...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Jae-Chul Kim Byoung-Ho Kang Maeng-Sub Cho Color Imaging Research Team Image Processing Department Computer and Software Technology Laboratory Electronics and Telecommunications Research Institute Taejon South Korea

In this paper, we propose an adaptive stereo matching algorithm to encompass stereo matching problems in projective distortion region. Since the projective distortion region can not be estimated in terms of fixed-size block matching algorithm, we tried to use adaptive window warping method in hierarchical matching process to compensate the perspective distortions. In addition, probability theory was adopted to encompass uncertainty of disparity of points over the window in this study. The proposed stereo matching algorithm has been tested on both disparity map and 3D model view. The experimental results show that remarkable improvement is obtained in the projective distortion region.

关键词： Object segmentation Optical distortion Uncertainty Cameras Solid modeling Color Image processing Laboratories software algorithms Testing

来源：评论

学校读者我要写书评

暂无评论

Component adaptation using adaptation pattern components

Component adaptation using adaptation pattern components

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Jeong Ah Kim Oh-Cheon Kwon Jihyun Lee Gyu-Sang Shin Computer Education Department Kwandong University KangNung Kangwon South Korea Computer & Software Technology Laboratory Electronics and Telecommnications Research Institute Taejon South Korea

CBD (component-based development) or COP (component-oriented programming) has recently been adopted as a better method for software development. However, in order for CBD technology to be more successful, binary components developed and deployed by a third party or a vendor should be adaptable if the components do not meet a component user's requirements. A component user usually requires component adaptation if the provided interface and the required interface of a component are mismatched, or if a component attribute and method need to be modified. In this paper, an adaptation method for binary components using adaptation pattern components is proposed. The proposed method solves the problem of a component becoming ever larger as it is continuously adapted. The conventional method of component adaptation - by a wrapping technique - repeatedly performs the wrapping of an existing component whenever component adaptation is required, even if it is for the same reason each time. However, the adaptation technique proposed in this paper provides a new mechanism for supporting component adaptation by using reusable adaptation pattern components.

关键词： Wrapping Telecommunication computing Programming profession Application software computer science education Educational programs Electronic mail Educational technology Assembly Joining processes

来源：评论

学校读者我要写书评

暂无评论

The MD-join: an operator for complex OLAP

The MD-join: an operator for complex OLAP

引用

International Conference on Data Engineering

作者： D. Chatziantoniou T. Johnson M. Akinde S. Kim Panakea Software Inc. Department of Computer Science University of Aalborg Denmark Database Research Center AT and T Research Laboratories USA Department of Computer Science Stevans Institute of Technology

ISBN: (纸本)0769510019

OLAP queries (i.e. group-by or cube-by queries with aggregation) have proven to be valuable for data analysis and exploration. Many decision support applications need very complex OLAP queries, requiring a fine degree of control over both the group definition and the aggregates that are computed. For example, suppose that the user has access to a data cube whose measure attribute is Sum(Sales). Then the user might wish to compute the sum of sales in New York and the sum of sales in California for those data cube entries in which Sum(Sales)>$1,000,000. This type of complex OLAP query is often difficult to express and difficult to optimize using standard relational operators (including standard aggregation operators). In this paper, we propose the MD-join operator for complex OLAP queries. The MD-join provides a clean separation between group definition and aggregate computation, allowing great flexibility in the expression of OLAP queries. In addition, the MD-join has a simple and easily optimizable implementation, while the equivalent relational algebra expression is often complex and difficult to optimize. We present several algebraic transformations that allow relational algebra queries that include MD-joins to be optimized.

关键词： Aggregates Data analysis Databases Marketing and sales Algebra Decision support systems computer science Application software Data warehouses Business

来源：评论

学校读者我要写书评

暂无评论

Composition method of communication system specifications in asynchronous model and its support system

Composition method of communication system specifications in...

引用

IEEE International Conference on Networks

作者： N. Maneerat R. Varakulsiripunth D. Seki K. Yoshida K. Takahashi Y. Kato B.B. Bista N. Shiratori Computer Research and Service Center King Mongkut's Institute of Technology Ladkrabang Bangkok Thailand Faculty of Engineering & Research Center for Communications and Information Technology Sendai National College of Technology Japan Faculty of Software and Information Science Iwate Prefectural University Japan Research Institute of Electrical Communication Tohoku University Japan

One of the most important methods in communication system design, especially in protocol design, is the composition method. We propose a method for simultaneously composing service specifications and protocol specifications based on the LOTOS language. In this method, an asynchronous communication model is adopted which is more realistic in actual communication networks. We use the concept of the weak bisimulation equivalence to represent the correctness of composition. A software support system based on the proposed composition method is also described.

关键词： Access protocols Asynchronous communication Design methodology Design engineering Information technology Educational institutions Communication system software Information science Communication networks software systems

来源：评论

学校读者我要写书评

暂无评论

OPEN: a flexible OO/CBD process for software-intensive systems development, a UML exposition 01

OPEN: a flexible OO/CBD process for software-intensive syste...

引用

Proceedings of the 23rd International Conference on software Engineering

作者： Houman Younessi Brian Henderson-Sellers Rensselaer Initiative in Software Engineering (RISE) Associate Professor of Computer Science Rensselaer Polytechnic Institute Rensselaer at Hartford Centre for Object Technology Applications and Research Professor of Information Systems Faculty of Information Technology University of Technology Sydney

ISBN: (纸本)9780769510507

Object technology is an approach that is increasingly being adopted for the development of quality software and software-intensive systems. Recent experience has demonstrated that it provides a sophisticated environment to support high quality software engineering practice. However, the use of object technology should not be restricted to languages but should encompass analysis, design, V&V and many such aspects belonging to the methodological dimension of the development life-cycle. Furthermore, it should also cover other issues belonging to the technological and contextual aspects.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Taxonomy of problem management activities

Taxonomy of problem management activities

引用

(CSMR) European Conference on software Maintenance and Reengineering

作者： M. Kajko-Mattsson U. Westblom S. Forssander G. Andersson M. Medin S. Ebarasi T. Fahlgren S.-E. Johansson S. Tornquist M. Holmgren Software Maintenance Laboratory Department of Computer and Systems Sciences Stockholm University and Royal Institute of Technology Kista Sweden Research AB ABB Automation Products AB and ABB Robotics AB Software Maintenance Laboratory ABB Corporate Vasteras Sweden

ISBN: (纸本)0769510280

Maintenance categories differ too much in order to be covered by one and the same generic process model. Too general process models do not give enough guidance when building process models and when measuring processes. They often invite subjectivity and imprecision. The authors suggest a detailed taxonomy of the activities for one of the processes essential within corrective maintenance: Problem Management Process. Together with other taxonomies of the processes inherent within corrective maintenance, this taxonomy should constitute a platform for defining corrective maintenance process models and an interim reference model for future measurements of corrective software maintenance.

关键词： Taxonomy software maintenance Costs Capability maturity model Robotics and automation Laboratories software measurement software standards Preventive maintenance computer industry

来源：评论

学校读者我要写书评

暂无评论

Formalization of autonomous dynamic reconfiguration in distributed constraint satisfaction

引用

Fundamenta Informaticae 2000年第1期43卷 129-151页

作者： Hannebauer, Markus Planning and Optimization Laboratory Research Institute for Computer Architecture and Software Technology (FIRST) GMD — German National Research Center for Information Technology eMail: hannebau@first.gmd.de

Several interesting practical problems in process control, planning and scheduling can be expressed and solved using the model of constraint satisfaction problems. At least four drawbacks of this classical model directly relate to areas of distribution: complexity, scalability, privacy and robustness. Hence, research on distributed constraint satisfaction problems is a new direction in the area of multi-agent systems. A typical engineering task in distributed constraint satisfaction is the design of the distribution itself. A careful look at this task reveals that the design of distribution is critical to the quality and efficiency of the problem solving process and is itself an optimization problem. In this article we formalize different variants of this configuration problem and prove them to be all at least N P-complete. For solving these problems, we present two local operators, agent melting and agent splitting, that can be combined to allow for an autonomous and dynamic reconfiguration of the organizational structure of the problem-solving agents. We prove sequences of these operators to be sufficient for solving any given configuration problem. We also briefly describe what practical steps are necessary to exploit the rather theoretical result of the proof in realistic applications.

关键词： multi-agent systems distributed constraint satisfaction autonomous dynamic reconfiguration partitioning agent melting agent splitting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：