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

1996 Winter Simulation Conference (WSC 96)

作者： Taylor, SJE Siemer, J Department of Computer Science and Information Systems Brunel University Uxbridge UB8 3PH England Department of Information Systems London School of Economics and Political Science Houghton Street London WC2A 2AE England

ISBN: (纸本)0780333837

The demand for education in the area of simulation is in the increase. This paper describes how education in the field of simulation can take advantage of the virtues of intelligent tutoring with respect to enhancing the educational process. For this purpose, this paper gives an overview of what constitutes the objectives and the content of a comprehensive course in discrete event simulation. The architecture of an intelligent tutoring system is presented and it is discussed how these sophisticated learning aids offer individualised student guidance and support within a learning environment. The paper then introduces a prototype intelligent tutoring system, the simulation tutor, and suggests how the system might be developed to enhance education in simulation.

关键词： Engineering education

来源：评论

学校读者我要写书评

暂无评论

A decision support system for solvent selection of CO2 separation processes

引用

ENERGY CONVERSION AND MANAGEMENT 1996年第6-8期37卷 941-946页

作者： Chan, CW Tontiwachwuthikul, P [a] Department of Computer Science University of Regina Regina Saskatchewan Canada S4S 0A2 [b] Process Systems Laboratory Faculty of Engineering/Energy Research Unit University of Regina Regina Saskatchewan Canada S4S 0A2

This paper presents the development of a prototype solvent selection advisory system using an deject-oriented. The system is called the Solvent Selection Advisory System (SSAS) and it is used for preliminary selection of optimal solvents for CO2 absorbers given different user specifications and plant conditions. The system can function as both an advisory and a tutorial system. The selection of solvents is based on heuristics, and visual illustrations of the problem help users learn about the domain. In this paper, we describe development of the system using the Object-Oriented Knowledge Engineering methodology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

User-level distributed file systems projects 96

User-level distributed file systems projects

引用

Proceedings of the twenty-seventh SIGCSE technical symposium on computer science education

作者： Chris McDonald Programming Languages and Systems Group Department of Computer Science The University of Western Australia Crawley Western Australia

ISBN: (纸本)9780897917575

One of the greatest benefits provided by computer networks, in particular local area networks, is the ability to access files served by other computers in a network. Whereas file system concepts are first introduced in Operating systems units, many file system concepts need to be readdressed and generalized in later computer Networks units. Moreover, as students become increasingly familiar with internetworking and programs such as ftp, many of the strong links between the Operating systems and computer Networks units may be reinforced. This paper discusses the successes experienced with two strongly related projects offered in our third year computer Networks unit. Each project requires students to support a minimal distributed file system by implementing user-level libraries which redefine a handful of operating system system calls supporting remote file access.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Anytime default inference 4th

引用

4th Pacific Rim International Conference on Artificial Intelligence, PRICAI 1996

作者： Ghose, Aditya K. Goebel, Randy Knowledge Systems Group Basser Department of Computer Science University of Sydney SyndeyNSW2006 Australia Department of Computing Science University of Alberta EdmontonABT6G 2H1 Canada

ISBN: (纸本)3540615326

Default reasoning plays a fundamental role in a variety of information processing applications. Default inference is inherently computationally hard and practical applications, specially time-bounded ones, may require that some notion of approximate inference be used. Anytime algorithms are a useful conceptualization of processes that may be prematurely terminated whenever necessary to return useful partial answers, with the quality of the answers improving in a well-defined manner with time. In his paper, we develop a repertoire of meaningful partial solutions for default inference problems and use these as the basis for specifying general classes of anytime default inference algorithms. We then present some of our earlier results on the connection between partial constraint satisfaction and default reasoning and exploit this connection to identify a large space of possible algorithms for default inference that may be defined based on partial constraint satisfaction techniques, which are inherently anytime in nature. The connection is useful because a number of existing techniques from the area of partial constraint satisfaction can be applied with little or no modification to default inference problems. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Inference engines

来源：评论

学校读者我要写书评

暂无评论

COMPOzE-intention-based music composition through constraint programming

COMPOzE-intention-based music composition through constraint...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： M. Henz S. Lauer D. Zimmermann Programming Systems Laboratory University of Saarland Saarbruecken Germany Computer Science Department University of Saarland Saarbruecken Germany Graduate School for Cognitive Science University of Saarland Saarbruecken Germany

We goal of the work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for intention based composition. COMPOzE is based on constraint programming over finite domains of integers. We argue that constraint programming provides a suitable technology for this task and that the libraries and tools available for the constraint programming system Oz effectively support the implementation of COMPOzE. This work links the research areas of automatic music composition on one hand and finite domain constraint programming on the other, and contributes the tool COMPOzE, which practically demonstrates the potential of constraint programming to open up new areas of application for automatic music composition.

关键词： Multiple signal classification Application software computer science Cognitive science Electronic mail Libraries Automatic programming Music Concrete Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

Valid generalisation from approximate interpolation

引用

Combinatorics Probability and Computing 1996年第3期5.0卷 191-214页

作者： Anthony, Martin Bartlett, Peter Ishai, Yuval Shawe-Taylor, John Department of Mathematics London Sch. of Econ. and Polit. Sci. London WC2A 2AE Houghton Street United Kingdom Department of Systems Engineering Res. Sch. of Info. Sci. and Eng. Australian National University Canberra 0200 Australia Department of Computer Science Technion Haifa 32000 Israel Computer Science Department Royal Holloway University of London Egham Surrey TW20 0EX Egham Hill United Kingdom

Let ℋ and ℓ be sets of functions from domain X to ℝ. We say that ℋ validly generalises ℓ from approximate interpolation if and only if for each η > 0 and ε δ ∈ (0, 1) there is m0(η, ε δ) such that for any fu...

Let ℋ and ℓ be sets of functions from domain X to ℝ. We say that ℋ validly generalises ℓ from approximate interpolation if and only if for each η > 0 and ε δ ∈ (0, 1) there is m₀(η, ε δ) such that for any function t ∈ ℓ and any probability distribution ℘ on X, if m ≥ m₀ then with ℘^m-probability at least 1 - δ, a sample X = (x₁, x₂,...,x_m) ∈ X^m satisfies ∀h ∈ ℋ ιh(x_i) - t(x_i)ι <η, (1 ≤ i ≤m) ⇒ ℘({x :ιh(x) - t(x)ι ≥ η}) < e. We find conditions that are necessary and sufficient for ℋ to validly generalise ℓ from approximate interpolation, and we obtain bounds on the sample length m₀(η ε δ) in terms of various parameters describing the expressive power of ℋ. Copyright ©1996 Cambridge University Press.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Specifying over-constrained problems in default logic

Specifying over-constrained problems in default logic

引用

Workshop on Over-Constrained systems, held as part of 1st International Conference on Principles and Practice of Constraint programming, CP 1995

作者： Sattar, Abdul Ghose, Aditya K. Goebel, Randy School of Comp and Info. Technology Griffith University Brisbane4111 Australia Knowledge Systems Group Basser Department of Computer Science University of Sydney SyndeyNSW2006 Australia Department of Computing Science University of Alberta EdmontonABT6G 2H1 Canada

ISBN: (纸本)3540614796

In the previous studies, it has been shown that the classical constraint satisfaction problem (CSP) is deductive in nature, and can be formulated as a classical theorem proving problem [1, 10]. Constraint satisfaction problems for which an assignment of values to all variables which satisfy all available constraints is not possible are referred to as over-constrained problems. This paper shows how computing partial solutions to over-constrained problems can be viewed as a default reasoning problem. We propose two methods for translating over-constrained problem specifications with finite domains to two different variants of default logic. We argue that default logic provides the appropriate level of abstraction for representing and analyzing over-constrained problem even if other methods are used for actually computing solutions. © 1996, Springer Verlag. All rights reserved.

关键词： Constraint satisfaction problems

来源：评论

学校读者我要写书评

暂无评论

Electronic Hybrid Limiter (EHL)1 for Pump Displacement

Electronic Hybrid Limiter (EHL)1 for Pump Displacement

引用

ASME 1996 International Mechanical Engineering Congress and Exposition, IMECE 1996

作者： Paoluzzi, R. Zarotti, L.G. Ruggeri, M. Fantuzzi, C. CEMOTER-C.N.R. Institute for Earthmoving Machinery and of froad Vehicles Via Canalbianco 28 Ferrara Cassana44044 Italy University of Bologna Department of Electronics-Computer Science and Systems Viale Risorgimento 2 Bologna40100 Italy

ISBN: (纸本)9780791815342

The paper reports upon numerical simulation tests carried out on avariable displacement axial piston pump equipped with multiple automatic controls. The swashplate control circuit includes two classicalhydraulic stages with two tandem three way valves (the pressure compensator and the/low limiter) and a servovalve with digital control circuit acting as a hybrid torque or/and speed limiter. The dynamicresponse ofthe system is evaluated for both separate and combinedcontrolfunctions. The effect of changes in the digital control circuit isdiscussed with reference to the system response to various loaddemands with special emphasis devoted to the benefits induced by theuse offuzzy control logic. © 1996 American Society of Mechanical Engineers (ASME). All rights reserved.

关键词： Automation

来源：评论

学校读者我要写书评

暂无评论

Benchmarking implementations of functional languages with 'Pseudoknot', a float-intensive benchmark

引用

Journal of Functional programming 1996年第4期6卷 621-655页

作者： Hartel, Pieter H. Feeley, Marc Alt, Martin Augustsson, Lennart Baumann, Peter Beemster, Marcel Chailloux, Emmanuel Flood, Christine H. Grieskamp, Wolfgang Van Groningen, John H. G. Hammond, Kevin Hausman, Bogumil Ivory, Melody Y. Jones, Richard E. Kamperman, Jasper Lee, Peter Leroy, Xavier Lins, Rafael D. Loosemore, Sandra Röjemo, Niklas Serrano, Manuel Talpin, Jean-Pierre Thackray, Jon Thomas, Stephen Walters, Pum Weis, Pierre Wentworth, Peter Department of Computer Systems University of Amsterdam 1098 SJ Amsterdam Kruislaan 403 Netherlands Dept. d'Informatique et R.o. Université de Montréal Montréal Que. H3C 3J7 succursale centre-ville Canada Informatik Universität des Saarlandes 66041 Saarbrücken 11 Germany Department of Computer Systems Chalmers University of Technology 412 96 Göteborg Sweden Department of Computer Science University of Zurich 8057 Zurich Winterthurerstr. 190 Switzerland LIENS URA 1327 du CNRS Ecl. Normale Supérieure 75230 Paris Cédex 05 45 rue d'Ulm France Laboratory for Computer Science MIT Cambridge MA 02139 545 Technology Square United States Berlin University of Technology 10587 Berlin Franklinstr. 28-29 Germany Fac. of Math. and Computer Science Univ. of Nijmegen 6525 ED Nijmegen Toernooiveld 1 Netherlands Department of Computing Science Glasgow University Glasgow G12 8QQ 17 Ulybank Gardens United Kingdom Computer Science Lab. Box 1505 S-125 25 Älvsjö Sweden Computer Research Group Inst. for Sci. Computer Research Lawrence Livermore Natl. Laboratory Livermore CA 94550 P.O. Box 808 L-419 United States Department of Computer Science University of Kent at Canterbury Canterbury Kent CT2 7NF United Kingdom CWl 1098 SJ Amsterdam Kruislaan 413 Netherlands Department of Computer Science Carnegie Mellon University Pittsburgh PA 15213 5000 Forbes Avenue United States INRIA Rocquencourt Projet Cristal 78153 Le Chesnay B.P. 105 France Departamento de Informática Universidade Federal de Pernambuco Recife PE Brazil Department of Computer Science Yale University New Haven CT United States INRIA Rocquencourt Projet Icsla 78153 Le Chesnay B.P. 105 France Europ. Comp.-Indust. Research Centre D-81925 Munich Arabella Straße 17 Germany Harlequin Ltd. Barrington Hall Barrington Cambridge CB2 5RG United Kingdom Department of Computer Science University of Nottingham Nottingham NG7 2RD United Kingdom Department of Computer Science Rhodes University Grahamstown

Over 25 implementations of different functional languages are benchmarked using the same program, a floating-point intensive application taken from molecular biology. The principal aspects studied are compile time and execution time for the various implementations that were benchmarked. An important consideration is how the program can be modified and tuned to obtain maximal performance on each language implementation. With few exceptions, the compilers take a significant amount of time to compile this program, though most compilers were faster than the then current GNU C compiler (GCC version 2.5.8). Compilers that generate C or Lisp are often slower than those that generate native code directly: the cost of compiling the intermediate form is normally a large fraction of the total compilation time. There is no clear distinction between the runtime performance of eager and lazy implementations when appropriate annotations are used: lazy implementations have clearly come of age when it comes to implementing largely strict applications, such as the Pseudoknot program. The speed of C can be approached by some implementations, but to achieve this performance, special measures such as strictness annotations are required by non-strict implementations. The benchmark results have to be interpreted with care. Firstly, a benchmark based on a single program cannot cover a wide spectrum of 'typical' applications. Secondly, the compilers vary in the kind and level of optimisations offered, so the effort required to obtain an optimal version of the program is similarly varied.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficiency Assessment of Performance of Decentralized Autonomous Multi-Robot systems

引用

Journal of Robotics and Mechatronics 1996年第3期8卷 286-291页

作者： Agah, Arvin Bekey, George A. Research Scientist Fellow Bio-Robotics Division Mechanical Engineering Laboratory 1-2 Namiki Tsukuba305 Japan Institute for Robotics and Intelligent Systems Computer Science Department University of Southern California Los AngelesCA90089 United States Robotics Research Laboratory University of Southern California Los AngelesCA90089 United States

This paper presents a new methodology for the efficiency assessment of task performance of decentralized autonomous multi-robot system. This formulation considers the types of the robots (in terms of sensing, action, and control), the description of the environment (the world), the facts (rules) of the world, and the specifications of the tasks to be performed. The performance efficiency is defined in terms of the total time required for completing the task, total energy requirement, and the comparison of the final results and the desired results. A robot colony simulator was used to perform a number of experiments, measuring the task performance efficiency, of a colony of simulated robots which perform specific tasks in a virtual world. The experimental results are presented in this paper. This paper also describes a team of four robots designed and fabricated in hardware. The physical robots were used successfully to validate the results from the simulated colony. © 1996, Fuji Technology Press. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：