1572278
#*OQL[C++]: Extending C++ with an Object Query Capability.
#@José A. Blakeley
#year1995
#confModern Database Systems
#citation12
#index0
#arnetid2

#*Transaction Management in Multidatabase Systems.
#@Yuri Breitbart,Hector Garcia-Molina,Abraham Silberschatz
#year1995
#confModern Database Systems
#citation16
#index1
#arnetid3

#*Overview of the ADDS System.
#@Yuri Breitbart,Tom C. Reyes
#year1995
#confModern Database Systems
#citation0
#index2
#arnetid4

#*Multimedia Information Systems: Issues and Approaches.
#@Stavros Christodoulakis,Leonidas Koveos
#year1995
#confModern Database Systems
#citation-1
#index3
#arnetid5

#*Active Database Systems.
#@Umeshwar Dayal,Eric N. Hanson,Jennifer Widom
#year1995
#confModern Database Systems
#citation167
#index4
#arnetid6

#*Where Object-Oriented DBMSs Should Do Better: A Critique Based on Early Experiences.
#@Angelika Kotz Dittrich,Klaus R. Dittrich
#year1995
#confModern Database Systems
#citation15
#index5
#arnetid7

#*Distributed Databases.
#@Hector Garcia-Molina,Meichun Hsu
#year1995
#confModern Database Systems
#citation-1
#index6
#arnetid8

#*An Object-Oriented DBMS War Story: Developing a Genome Mapping Database in C++.
#@Nathan Goodman
#year1995
#confModern Database Systems
#citation30
#index7
#arnetid9

#*Cooperative Transactions for Multiuser Environments.
#@Gail E. Kaiser
#year1995
#confModern Database Systems
#citation32
#index8
#arnetid10

#*Schema Architecture of the UniSQL/M Multidatabase System
#@William Kelley,Sunit K. Gala,Won Kim,Tom C. Reyes,Bruce Graham
#year1995
#confModern Database Systems
#citation39
#index9
#arnetid11

#*Physical Object Management.
#@Alfons Kemper,Guido Moerkotte
#year1995
#confModern Database Systems
#citation13
#index10
#arnetid12

#*Introduction to Part 1: Next-Generation Database Technology.
#@Won Kim
#year1995
#confModern Database Systems
#citation-1
#index11
#arnetid13

#*Object-Oriented Database Systems: Promises, Reality, and Future.
#@Won Kim
#year1995
#confModern Database Systems
#citation97
#index12
#arnetid14

#*Introduction to Part 2: Technology for Interoperating Legacy Databases.
#@Won Kim
#year1995
#confModern Database Systems
#citation4
#index13
#arnetid15

#*On Resolving Schematic Heterogeneity in Multidatabase Systems.
#@Won Kim,Injun Choi,Sunit K. Gala,Mark Scheevel
#year1995
#confModern Database Systems
#citation261
#index14
#arnetid16

#*Requirements for a Performance Benchmark for Object-Oriented Database Systems.
#@Won Kim,Jorge F. Garza
#year1995
#confModern Database Systems
#citation1
#index15
#arnetid17

#*On View Support in Object-Oriented Databases Systems.
#@Won Kim,William Kelley
#year1995
#confModern Database Systems
#citation-1
#index16
#arnetid18

#*The POSC Solution to Managing E&P Data.
#@Vincent J. Kowalski
#year1995
#confModern Database Systems
#citation2
#index17
#arnetid19

#*C++ Bindings to an Object Database.
#@David Krieger,Tim Andrews
#year1995
#confModern Database Systems
#citation3
#index18
#arnetid20

#*Authorization in Object-Oriented Databases.
#@Teresa F. Lunt
#year1995
#confModern Database Systems
#citation8
#index19
#arnetid21

#*Query Processing in Multidatabase Systems.
#@Weiyi Meng,Clement T. Yu
#year1995
#confModern Database Systems
#citation42
#index20
#arnetid22

#*Management of Uncerainty in database Systems.
#@Amihai Motro
#year1995
#confModern Database Systems
#citation-1
#index21
#arnetid23

#*Parallel Relational Database Systems.
#@Edward Omiecinski
#year1995
#confModern Database Systems
#citation5
#index22
#arnetid24

#*Query Processing in Object-Oriented Database Systems.
#@M. Tamer Özsu,José A. Blakeley
#year1995
#confModern Database Systems
#citation24
#index23
#arnetid25

#*Specification and Execution of Transactional Workflows.
#@Marek Rusinkiewicz,Amit P. Sheth
#year1995
#confModern Database Systems
#citation278
#index24
#arnetid26

#*Spatial Data Structures.
#@Hanan Samet
#year1995
#confModern Database Systems
#citation2743
#index25
#arnetid27
#%165
#!An overview is presented of the use of spatial data structures in spatial databases. The focus is on hierarchical data structures, including a number of variants of quadtrees, which sort the data with respect to the space occupied by it. Such techniques are known as spatial indexing methods. Hierarchical data structures are based on the principle of recursive decomposition. They are attractive because they are compact and depending on the nature of the data they save space as well as time and also facilitate operations such as search. Examples are given of the use of these data structures in the representation of different data types such as regions, points, rectangles, lines, and volumes.

#*Spatial Data Models and Query Processing.
#@Hanan Samet,Walid G. Aref
#year1995
#confModern Database Systems
#citation73
#index26
#arnetid28

#*Pegasus: A Heterogeneous Information Management System.
#@Ming-Chien Shan,Rafi Ahmed,Jim Davis,Weimin Du,William Kent
#year1995
#confModern Database Systems
#citation45
#index27
#arnetid29

#*Temporal Object-Oriented Databases: A Critical Comparison.
#@Richard T. Snodgrass
#year1995
#confModern Database Systems
#citation104
#index28
#arnetid30

#*The OMG Object Model.
#@Richard Mark Soley,William Kent
#year1995
#confModern Database Systems
#citation-1
#index29
#arnetid31

#*EDA/SQL.
#@Ralph L. Stout
#year1995
#confModern Database Systems
#citation2
#index30
#arnetid32

#*The Changing Database Standards Landscape.
#@Craig W. Thompson
#year1995
#confModern Database Systems
#citation2
#index31
#arnetid33

#*Modern Database Systems: The Object Model, Interoperability, and Beyond.
#@Won Kim
#year1995
#confModern Database Systems
#citation375
#index32
#arnetid34

#*Inequalities: Theory of Majorization and Its Application.
#@Albert W. Marshall,Ingram Olkin
#year1979
#conf
#citation-1
#index33
#arnetid35

#*Version Control in an Object-Oriented Architecture.
#@Anders Björnerstedt,Christer Hulten
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation85
#index34
#arnetid36

#*The GemStone Data Management System.
#@Robert Bretl,David Maier,Allen Otis,D. Jason Penney,Bruce Schuchardt,Jacob Stein,E. Harold Williams,Monty Williams
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation-1
#index35
#arnetid37

#*Storage Management in EXODUS.
#@Michael J. Carey,David J. DeWitt,Joel E. Richardson,Eugene J. Shekita
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation3
#index36
#arnetid38

#*A Distributed Object Manager for the Smalltalk-80 System.
#@Dominique Decouchant
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation10
#index37
#arnetid39

#*Objects, Messages, and Rules in Database Design.
#@Jim Diederich,Jack Milton
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation9
#index38
#arnetid40

#*Active Objects: Ealities and Possibilities.
#@Clarence A. Ellis,Simon J. Gibbs
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation21
#index39
#arnetid41

#*Overview of the Iris DBMS.
#@Daniel H. Fishman,Jurgen Annevelink,David Beech,E. C. Chow,Tim Connors,J. W. Davis,Waqar Hasan,C. G. Hoch,William Kent,S. Leichner,Peter Lyngbæk,Brom Mahbod,Marie-Anne Neimat,Tore Risch,Ming-Chien Shan,W. Kevin Wilkinson
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation-1
#index40
#arnetid42

#*Features of the ORION Object-Oriented Database System.
#@Won Kim,Nat Ballou,Hong-Tai Chou,Jorge F. Garza,Darrell Woelk
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation167
#index41
#arnetid43

#*Indexing Techniques for Object-Oriented Databases.
#@Won Kim,Kyung-Chang Kim,Alfred G. Dale
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation164
#index42
#arnetid44

#*My Cat Is Object-Oriented.
#@Roger King
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation51
#index43
#arnetid45

#*Making Database Systems Fast Enough for CAD Applications.
#@David Maier
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation52
#index44
#arnetid46

#*Optimizing Smalltalk Message Performance.
#@Fred Mellender,Steve Riegel,Andrew Straw
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation4
#index45
#arnetid47

#*The Common List Object-Oriented Programming Language Standard.
#@David A. Moon
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation0
#index46
#arnetid48

#*Object Orientation as Catalyst for Language-Database Inegration.
#@J. Eliot B. Moss
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation-1
#index47
#arnetid49

#*A Survey of Object-Oriented Concepts.
#@Oscar Nierstrasz
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation151
#index48
#arnetid50

#*Integrated Office Systems.
#@Oscar Nierstrasz,Dennis Tsichritzis
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation19
#index49
#arnetid51

#*Proteus: A Frame-Based Nonmonotonic Inference System.
#@David M. Russinoff
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation11
#index50
#arnetid52

#*Concurrency Control and Object-Oriented Databases.
#@Andrea H. Skarra,Stanley B. Zdonik
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation74
#index51
#arnetid53

#*A Shared View of Sharing: The Treaty of Orlando.
#@Lynn Andrea Stein,Henry Lieberman,David Ungar
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation-1
#index52
#arnetid54

#*Pogo: A Declarative Representation System for Graphics.
#@Mark A. Tarlton,P. Nong Tarlton
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation11
#index53
#arnetid55

#*Concurrent Object-Oriented Programming Languages.
#@Chris Tomlinson,Mark Scheevel
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation33
#index54
#arnetid56

#*Directions in Object-Oriented Research.
#@Dennis Tsichritzis,Oscar Nierstrasz
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation18
#index55
#arnetid57

#*A Proposal for a Formal Model of Objects.
#@Yair Wand
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation138
#index56
#arnetid58

#*OZ+: An Object-Oriented Database System.
#@Stephen P. Weiser,Frederick H. Lochovsky
#year1989
#confObject-Oriented Concepts, Databases, and Applications
#citation19
#index57
#arnetid59

#*The Commercial INGRES Epilogue.
#@Lawrence A. Rowe,Michael Stonebraker
#year1986
#confThe INGRES Papers
#citation10
#index58
#arnetid60

#*Design of Relational Systems (Introduction to Section 1).
#@Michael Stonebraker
#year1986
#confThe INGRES Papers
#citation0
#index59
#arnetid61

#*Supporting Studies on Relational Systems (Introduction to Section 2).
#@Michael Stonebraker
#year1986
#confThe INGRES Papers
#citation0
#index60
#arnetid62

#*Distributed Database Systems (Introduction to Section 3).
#@Michael Stonebraker
#year1986
#confThe INGRES Papers
#citation0
#index61
#arnetid63

#*The Design and Implementation of Distributed INGRES.
#@Michael Stonebraker
#year1986
#confThe INGRES Papers
#citation-1
#index62
#arnetid64

#*User Interfaces for Database Systems (Introduction to Section 4).
#@Michael Stonebraker
#year1986
#confThe INGRES Papers
#citation0
#index63
#arnetid65

#*Extended Semantics for the Relational Model (Introduction to Section 5).
#@Michael Stonebraker
#year1986
#confThe INGRES Papers
#citation0
#index64
#arnetid66

#*Database Design (Introduction to Section 6).
#@Michael Stonebraker
#year1986
#confThe INGRES Papers
#citation0
#index65
#arnetid67

#*Title, Preface, Contents.
#@
#year1986
#confThe INGRES Papers
#citation0
#index66
#arnetid68

#*References.
#@
#year1986
#confThe INGRES Papers
#citation0
#index67
#arnetid69

#*TeX: The Program
#@Donald E. Knuth
#year1986
#conf
#citation128
#index68
#arnetid70

#*Foundations of Databases.
#@Serge Abiteboul,Richard Hull,Victor Vianu
#year1995
#conf
#citation2877
#index69
#arnetid71

#*LaTeX: User's Guide & Reference Manual
#@Leslie Lamport
#year1986
#conf
#citation-1
#index70
#arnetid72

#*The Design and Analysis of Computer Algorithms.
#@Alfred V. Aho,John E. Hopcroft,Jeffrey D. Ullman
#year1974
#conf
#citation-1
#index71
#arnetid73

#*Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers
#@Leslie Lamport
#year2002
#conf
#citation395
#index72
#arnetid74
#!From the Book: This book will teach you how to write specifications of computer systems, using the language TLA+. It's rather long, but most people will read only Part I, which comprises the first 83 pages. That part contains all that most engineers need to know about writing specifications; it assumes only the basic background in computing and knowledge of mathematics expected of an undergraduate studying engineering or computer science. Part II contains more advanced material for more sophisticated readers. The remainder of the book is a reference manual—Part III for the TLA+ tools and Part IV for the language itself. The TLA World Wide Web page contains material to accompany the book, including the TLA+ tools, exercises, references to the literature, and a list of corrections. There is a link to the TLA Web page on http://lamport.org.What Is a Specification?Writing is nature's way of letting you know how sloppy your thinking is.-GuindonA specification is a written description of what a system is supposed to do. Specifying a system helps us understand it. It's a good idea to understand a system before building it, so it's a good idea to write a specification of a system before implementing it.This book is about specifying the behavioral properties of a system—also called its functional or logical properties. These are the properties that specify what the system is supposed to do. There are other important kinds of properties that we don't consider, including performance properties. Worst-case performance can often be expressed as a behavioral property—forexample, Chapter 9 explains how to specify that a system must react within a certain length of time. However, specifying average performance is beyond the scope of the methods described here.Our basic tool for writing specifications is mathematics. Mathematics is nature's way of letting you know how sloppy your writing is. It's hard to be precise in an imprecise language like English or Chinese. In engineering, imprecision can lead to errors. To avoid errors, science and engineering have adopted mathematics as their language.The mathematics we use is more formal than the math you've grown up with. Formal mathematics is nature's way of letting you know how sloppy your mathematics is. The mathematics written by most mathematicians and scientists is not really precise. It's precise in the small, but imprecise in the large. Each equation is a precise assertion, but you have to read the accompanying words to understand how the equations relate to one another and exactly what the theorems mean. Logicians have developed ways of eliminating those words and making the mathematics completely formal, and hence completely precise.Most mathematicians and scientists think that formal mathematics, without words, is long and tiresome. They're wrong. Ordinary mathematics can be expressed compactly in a precise, completely formal language. It takes only about two dozen lines to define the solution to an arbitrary differential equation in the Differential Equations module of Chapter 11. But few specifications need such sophisticated mathematics. Most require only simple application of a few standard mathematical concepts.Why TLA+?We specify a system by describing its allowed behaviors—what it may do in the course of an execution. In 1977, Amir Pnueli introduced the use of temporal logic for describing system behaviors. In principle, a system could be described by a single temporal logic formula. In practice, it couldn't. Pnueli's temporal logic was ideal for describing some properties of systems, but awkward for others. So, it was usually combined with a more traditional way of describing systems.In the late 1980s, I invented TLA, the Temporal Logic of Actions—a simple variant of Pnueli's original logic. TLA makes it practical to describe a system by a single formula. Most of a TLA specification consists of ordinary, nontemporal mathematics. Temporal logic plays a significant role only in describing those properties that it's good at describing. TLA also provides a nice way to formalize the style of reasoning about systems that has proved to be most effective in practice—a style known as assertional reasoning. However, this book is about specification; it says almost nothing about proofs.Temporal logic assumes an underlying logic for expressing ordinary mathematics. There are many ways to formalize ordinary math. Most computer scientists prefer one that resembles their favorite programming language. I chose instead the one that most mathematicians prefer—the one logicians call first-order logic and set theory.TLA provides a mathematical foundation for describing systems. To write specifications, we need a complete language built atop that foundation. I initially thought that this language should be some sort of abstract programming language whose semantics would be based on TLA. I didn't know what kind of programming language constructs would be best, so I decided to start writing specifications directly in TLA. I intended to introduce programming constructs as I needed them. To my surprise, I discovered that I didn't need them. What I needed was a robust language for writing mathematics.Although mathematicians have developed the science of writing formulas, they haven't turned that science into an engineering discipline. They have developed notations for mathematics in the small, but not for mathematics in the large. The specification of a real system can be dozens or even hundreds of pages long. Mathematicians know how to write 20-line formulas, not 20-page formulas. So, I had to introduce notations for writing long formulas. What I took from programming languages were ideas for modularizing large specifications.The language I came up with is called TLA+. I refined TLA+ in the course of writing specifications of disparate systems. But it has changed little in the last few years. I have found TLA+ to be quite good for specifying a wide class of systems—from program interfaces (APIs) to distributed systems. It can be used to write a precise, formal description of almost any sort of discrete system. It's especially well suited to describing asynchronous systems—that is, systems with components that do not operate in strict lock-step.About This BookPart I, consisting of Chapters 1 through 7, is the core of the book and is meant to be read from beginning to end. It explains how to specify the class of properties known as safety properties. These properties, which can be specified with almost no temporal logic, are all that most engineers need to know about. After reading Part I, you can read as much of Part II as you like. Each of its chapters is independent of the others. Temporal logic comes to the fore in Chapter 8, where it is used to specify the additional class of properties known as liveness properties. Chapter 9 describes how to specify real-time properties, and Chapter 10 describes how to write specifications as compositions. Chapter 11 contains more advanced examples. The three chapters in Part III serve as the reference manual for three TLA+ tools: the Syntactic Analyzer, the TLATEX typesetting program, and the TLC model checker. If you want to use TLA+, then you probably want to use these tools. They are available from the TLA Web page. TLC is the most sophisticated of them. The examples on the Web can get you started using it, but you'll have to read Chapter 14 to learn to use TLC effectively.Part IV is a reference manual for the TLA+ language. Part I provides a good enough working knowledge of the language for most purposes. You need look at Part IV only if you have questions about the fine points of the syntax and semantics. Chapter 15 gives the syntax of TLA+. Chapter 16 describes the precise meanings and the general forms of all the built-in operators of TLA+; Chapter 17 describes the precise meaning of all the higher-level TLA+ constructs such as definitions. Together, these two chapters specify the semantics of the language. Chapter 18 describes the standard modules—except for module RealTime, described in Chapter 9, and module TLC, described in Chapter 14. You might want to look at this chapter if you're curious about how standard elementary mathematics can be formalized in TLA+.Part IV does have something you may want to refer to often: a mini-manual that compactly presents lots of useful information. Pages 268-273 list all TLA+ operators, all user-definable symbols, the precedence of all operators, all operators defined in the standard modules, and the ASCII representation of symbols.

#*Data Structures and Algorithms.
#@Alfred V. Aho,John E. Hopcroft,Jeffrey D. Ullman
#year1983
#conf
#citation2536
#index73
#arnetid75

#*Databases and Transaction Processing: An Application-Oriented Approach
#@Philip M. Lewis,Arthur J. Bernstein,Michael Kifer
#year2001
#conf
#citation113
#index74
#arnetid76

#*The AWK Programming Language
#@Alfred V. Aho,Brian W. Kernighan,Peter J. Weinberger
#year1988
#conf
#citation551
#index75
#arnetid77

#*The Java Virtual Machine Specification
#@Tim Lindholm,Frank Yellin
#year1997
#conf
#citation2
#index76
#arnetid78

#*Compilers: Princiles, Techniques, and Tools.
#@Alfred V. Aho,Ravi Sethi,Jeffrey D. Ullman
#year1986
#conf
#citation-1
#index77
#arnetid79

#*Algorithms
#@Robert Sedgewick
#year1983
#conf
#citation22
#index78
#arnetid80
#!This presentation is a tutorial on AutoView, an AutoMod extension package that recreates model animation according to a user-defined script. AutoView allows users to restart animation and move back and forth in time and 3-D space. Animation is created using text files generated from an AutoMod simulation model. By creating a user-defined camera description file, animation can take place that allows for panning from one view to another, as well as for attaching the camera to a simulated load or vehicle and traveling with that entity during portions of the animation. The animation is provided at an enhanced response time because it does not have the logical and statistical processes of AutoMod (which can slow animation). This tutorial demonstrates several animation scripts previously constructed with AutoView, discusses the creation of AutoView files from AutoMod, and describes the development of a camera description file.

#*The Java Programming Language
#@Ken Arnold,James Gosling
#year1996
#conf
#citation8
#index79
#arnetid81

#*Algorithms, 2nd Edition
#@Robert Sedgewick
#year1988
#conf
#citation22
#index80
#arnetid82

#*The Java Programming Language, Second Edition
#@Ken Arnold,James Gosling
#year1999
#conf
#citation-1
#index81
#arnetid83

#*Operating System Concepts, 4th edition.
#@Abraham Silberschatz,Peter Galvin
#year1994
#conf
#citation-1
#index82
#arnetid84

#*The Java Programming Language, Third Edition
#@Ken Arnold,James Gosling,David Holmes
#year2000
#conf
#citation-1
#index83
#arnetid85

#*The TeXbook
#@Donald E. Knuth
#year1986
#conf
#citation1105
#index84
#arnetid86

#*Modern Information Retrieval
#@Ricardo A. Baeza-Yates,Berthier A. Ribeiro-Neto
#year1999
#conf
#citation8062
#index85
#arnetid87
#!:This is a rigorous and complete textbook for a first course on information retrieval from the computer science (as opposed to a user-centred) perspective. The advent of the Internet and the enormous increase in volume of electronically stored information generally has led to substantial work on IR from the computer science perspective - this book provides an up-to-date student oriented treatment of the subject.

#*Conceptual Structures: Information Processing in Mind and Machine
#@John F. Sowa
#year1984
#conf
#citation3274
#index86
#arnetid88

#*Concurrency Control and Recovery in Database Systems.
#@Philip A. Bernstein,Vassos Hadzilacos,Nathan Goodman
#year1987
#conf
#citation4304
#index87
#arnetid89

#*Code Reading: The Open Source Perspective
#@Diomidis Spinellis
#year2003
#conf
#citation62
#index88
#arnetid90

#*Intelligent Database Systems
#@Elisa Bertino,Barbara Catania,Gian Piero Zarri
#year2001
#conf
#citation78
#index89
#arnetid91
#!:a valuable resource for anyone working on intelligent database systems. Good background coverage of both the field of databases and that of AI are provided in the first part of the book, and later there are some excellent analytical discussions of relevant projects. The authors adopt a very readable style which enables a complex topic to become much more accessible." - Jenny Carter, Department of Computer Science, De Montfort University This book provides a state of the art guide to the new developments in expert database systems, from the unique perspective of both the database and AI areas. It gives complete and detailed coverage of the latest research and practice, including all the need-to-know technical and theoretical approaches in the area. Drawing on their extensive experience, the authors evaluate how AI techniques can be integrated with present and future database systems and knowledge based management systems, incorporating AI expertise into system design. The book also addresses the techniques developed recently which are directly used, or are the basis, for data retrieval across the world wide web. If you are a designer or developer working in the database community, with database and AI products or applications, this book will help you to understand crucial research developments and to apply the results in practice. Includes: · Mechanisms for handling data and knowledge including XML, web indexing, search engines & data mining · Object Oriented Database Management Systems and object-relational DBMS · Data modeling including techniques suchas Entity Relationship, Functional Data & Semantic Database models, as well as using the notations for modeling (OMT & UML) Plus! Extended case studies of commercial systems About the authors: Elisa Bertino is a well known expert in the integration of AI and database techniques, areas of O-O, distributed, deductive and multimedia databases and database security. She has chaired and given tutorials at many international conferences and published hundreds of journal papers and a book. Elisa is currently a professor of computer science at the University of Milan. Barbara Catania is an assistant professor of computer science at the University of Genova, specializing in deductive and multimedia databases, and indexing techniques in object-oriented and constraint databases. She has presented at a number of international conferences and co-authored a book. Gian Piero Zarri is an internationally renowned consultant and researcher in the areas of knowledge-based systems, natural-language processing, databases and information retrieval systems. He is on the editorial board of a number of international scientific journals and on the program committee of many conferences on Knowledge-Based Systems. Gian Piero currently works as Research Director for CNRS, the French National Centre for Scientific Research.

#*How to Set Up and Maintain a World Wide Web Site: The Guide for Information Providers.
#@Lincoln Stein
#year1995
#conf
#citation30
#index90
#arnetid92

#*Object-Oriented Database Systems
#@Elisa Bertino,Lorenzo Martino
#year1993
#conf
#citation-1
#index91
#arnetid93

#*Advanced Programming in the UNIX Environment
#@W. Richard Stevens
#year1992
#conf
#citation10
#index92
#arnetid94

#*PROLOG Programming for Artificial Intelligence, Second Edition
#@Ivan Bratko
#year1990
#conf
#citation-1
#index93
#arnetid95

#*TCP/IP Illustrated, Volume 1: The Protocols
#@W. Richard Stevens
#year1994
#conf
#citation2
#index94
#arnetid96
#!TCP/IP Illustrated, Volume 1 is a complete and detailed guide to the entire TCP/IP protocol suite - with an important difference from other books on the subject. Rather than just describing what the RFCs say the protocol suite should do, this unique book uses a popular diagnostic tool so you may actually watch the protocols in action.By forcing various conditions to occur - such as connection establishment, timeout and retransmission, and fragmentation - and then displaying the results, TCP/IP Illustrated gives you a much greater understanding of these concepts than words alone could provide. Whether you are new to TCP/IP or you have read other books on the subject, you will come away with an increased understanding of how and why TCP/IP works the way it does, as well as enhanced skill at developing aplications that run over TCP/IP.

#*Database Security.
#@Silvana Castano,Maria Grazia Fugini,Giancarlo Martella,Pierangela Samarati
#year1995
#conf
#citation548
#index95
#arnetid97

#*TCP/IP Illustrated, Volume 3: TCP for Transactions, HTTP, NNTP, and the UNIX Domain Protocolls
#@W. Richard Stevens
#year1996
#conf
#citation-1
#index96
#arnetid98

#*Object Data Management: Object-Oriented and Extended Relational Database Systems
#@R. G. G. Cattell
#year1991
#conf
#citation297
#index97
#arnetid99

#*Object Data Management: Object-Oriented and Extended Relational Database Systems (Revised Edition)
#@R. G. G. Cattell
#year1994
#conf
#citation-1
#index98
#arnetid100

#*The C++ Programming Language, First Edition
#@Bjarne Stroustrup
#year1986
#conf
#citation-1
#index99
#arnetid101

#*Designing Database Applications with Objects and Rules: The IDEA Methodology
#@Stefano Ceri,Piero Fraternali
#year1997
#conf
#citation136
#index100
#arnetid102

#*The C++ Programming Language, Second Edition
#@Bjarne Stroustrup
#year1991
#conf
#citation-1
#index101
#arnetid103

#*The Java Developers Almanac 1999
#@Patrick Chan
#year1999
#conf
#citation-1
#index102
#arnetid104

#*Introduction to Data Mining
#@Pang-Ning Tan,Michael Steinbach,Vipin Kumar
#year2005
#conf
#citation1720
#index103
#arnetid105

#*The Java Class Libraries - An Annotated Reference
#@Patrick Chan,Rosanna Lee
#year1997
#conf
#citation77
#index104
#arnetid106

#*Datenmodelle, Datenbanksprachen und Datenbank-Management-Systeme
#@Gottfried Vossen
#year1990
#conf
#citation-1
#index105
#arnetid107

#*The Java Class Libraries, Second Edition, Volume 2
#@Patrick Chan,Rosanna Lee
#year1998
#conf
#citation-1
#index106
#arnetid108

#*Datenmodelle, Datenbanksprachen und Datenbank-Management-Systeme. 2. Auflage
#@Gottfried Vossen
#year1994
#conf
#citation-1
#index107
#arnetid109

#*The Java Class Libraries, Second Edition, Volume 1
#@Patrick Chan,Rosanna Lee,Douglas Kramer
#year1998
#conf
#citation-1
#index108
#arnetid110

#*Das DB2-Handbuch.
#@Gottfried Vossen,Kurt-Ulrich Witt
#year1990
#conf
#citation-1
#index109
#arnetid111

#*The Java Class Libraries, Second Edition, Volume 1, Supplement for the Java 2 Platform Standard Edition, v1.2
#@Patrick Chan,Rosanna Lee,Douglas Kramer
#year1999
#conf
#citation-1
#index110
#arnetid112

#*Time Series Prediction: Forecasting the Future and Understanding the Past.
#@Andreas S. Weigend,Neil A. Gerschenfeld
#year1994
#conf
#citation922
#index111
#arnetid113

#*The Relational Model for Database Management, Version 2
#@E. F. Codd
#year1990
#conf
#citation532
#index112
#arnetid114
#!From the Preface (See Front Matter for full Preface) An important adjunct to precision is a sound theoretical foundation. The relational model is solidly based on two parts of mathematics: firstorder predicate logic and the theory of relations. This book, however, does not dwell on the theoretical foundations, but rather on all the features of the relational model that I now perceive as important for database users, and therefore for DBMS vendors. My perceptions result from 20 years of practical experience in computing and data processing (chiefly, but not exclusively, with large-scale customers of IBM), followed by another 20 years of research. I believe that this is the first book to deal exclusively with the relational approach. It does, however, include design principles in Chapters 21 and 22. It is also the first book on the relational model by the originator of that model. All the ideas in the relational model described in this book are mine, except in cases where I explicitly credit someone else. In developing the relational model, I have tried to follow Einstein's advice, "Make it as simple as possible, but no simpler." I believe that in the last clause he was discouraging the pursuit of simplicity to the extent of distorting reality. So why does the book contain 30 chapters and two appendixes? To answer this question, it is necessary to look at the history of research and development of the relational model.

#*Java Platform Performance - Strategies and Tactics
#@Steve Wilson,Jeff Kesselman
#year2000
#conf
#citation74
#index113
#arnetid115
#!:This book addresses a vital issue for all those developing software for the Java™ platform: how to achieve maximum performance and scalability for their applications. Drawing on the authors' knowledge of the Java programming language and their extensive experience working on performance issues, the book reveals common mistakes and misconceptions concerning the performance characteristics of Java technologies. It offers overall development strategies and concrete, battle-tested techniques to dramatically improve the performance of applications constructed with the Java programming language. Java™ Platform Performance highlights the importance of integrating performance evaluation into the application development process and discusses measurement techniques. The book then presents practical tactics for enhancing application performance in the areas of I/O, RAM footprint, small object management, algorithms, data structures, Swing, and deployment. Specific topics covered include: Incorporating performance evaluation into the development process Profiling and benchmarking Building scalable, fast Swing GUIs Using high-speed I/O Computing and controlling the RAM footprint Reducing the number of classes Eliminating temporary objects Selecting high-performance algorithms and data structures Using Java native code and applet packaging efficiently Garbage collection Java HotSpot™ technology With an understanding of the performance issues and specific techniques for reducing overhead discussed in this book, you will have theinformation you need to enhance the efficiency, speed, and scalability of your software.

#*Advanced C++: Programming Syles and Idioms
#@James Coplien
#year1992
#conf
#citation659
#index114
#arnetid116

#*Deductive Databases and Logic Programming
#@Subrata Kumar Das
#year1992
#conf
#citation150
#index115
#arnetid117

#*High performance compilers for parallel computing
#@Michael Wolfe
#year1996
#conf
#citation9
#index116
#arnetid118

#*An Introduction to Database Systems
#@C. J. Date
#year1975
#conf
#citation17
#index117
#arnetid119
#!:The sixth edition of this well-respected text/reference--which has been almost completely rewritten--continues to be the most comprehensive and up-to-date treatment of database technology currently available. Readers will gain a strong working knowledge of the overall structure, concepts, and objectives of database systems and will become familiar with the theoretical principles underlying the construction of such systems.

#*TCP/IP Illustrated, Volume 2: The Implementation
#@Gary R. Wright,W. Richard Stevens
#year1995
#conf
#citation599
#index118
#arnetid120

#*An Introduction to Database Systems, 2nd Edition
#@C. J. Date
#year1977
#conf
#citation17
#index119
#arnetid121

#*Human Behaviour and the Principle of Least Effort: an Introduction to Human Ecology
#@George Kingsley Zipf
#year1949
#conf
#citation5748
#index120
#arnetid122

#*An Introduction to Database Systems, 3rd Edition
#@C. J. Date
#year1981
#conf
#citation-1
#index121
#arnetid123
#!:For over 25 years, C. J. Date's An Introduction to Database Systems has been the authoritative resource for readers interested in gaining insight into and understanding of the principles of database systems. This revision continues to provide a solid grounding in the foundations of database technology and to provide some ideas as to how the field is likely to develop in the future.. "Readers of this book will gain a strong working knowledge of the overall structure, concepts, and objectives of database systems and will become familiar with the theoretical principles underlying the construction of such systems.

#*The INGRES Papers: Anatomy of a Relational Database System
#@Michael Stonebraker
#year1986
#conf
#citation67
#index122
#arnetid124

#*An Introduction to Database Systems, Volume II.
#@C. J. Date
#year1983
#conf
#citation17
#index123
#arnetid125

#*A Guide to DB2, 1st Edition
#@C. J. Date
#year1984
#conf
#citation-1
#index124
#arnetid126

#*An Introduction to Database Systems, Volume I, 4th Edition.
#@C. J. Date
#year1986
#conf
#citation17
#index125
#arnetid127

#*An Introduction to Database Systems, Volume I, 5th Edition.
#@C. J. Date
#year1990
#conf
#citation17
#index126
#arnetid128

#*An Introduction to Database Systems, 6th Edition.
#@C. J. Date
#year1995
#conf
#citation17
#index127
#arnetid129

#*Relational Database Writings 1989-1991
#@C. J. Date,Hugh Darwen
#year1992
#conf
#citation6
#index128
#arnetid130

#*A Guide to SQL Standard, 3rd Edition
#@C. J. Date,Hugh Darwen
#year1993
#conf
#citation-1
#index129
#arnetid131

#*A Guide to SQL Standard, 4th Edition
#@C. J. Date,Hugh Darwen
#year1997
#conf
#citation-1
#index130
#arnetid132

#*A Guide to DB2, 2nd Edition
#@C. J. Date,Colin J. White
#year1988
#conf
#citation-1
#index131
#arnetid133

#*A Guide to DB2, 3rd Edition
#@C. J. Date,Colin J. White
#year1990
#conf
#citation-1
#index132
#arnetid134

#*Cryptography and Data Security
#@Dorothy E. Denning
#year1982
#conf
#citation1881
#index133
#arnetid135
#!From the Preface (See Front Matter for full Preface) Electronic computers have evolved from exiguous experimental enterprises in the 1940s to prolific practical data processing systems in the 1980s. As we have come to rely on these systems to process and store data, we have also come to wonder about their ability to protect valuable data. Data security is the science and study of methods of protecting data in computer and communication systems from unauthorized disclosure and modification. The goal of this book is to introduce the mathematical principles of data security and to show how these principles apply to operating systems, database systems, and computer networks. The book is for students and professionals seeking an introduction to these principles. There are many references for those who would like to study specific topics further. Data security has evolved rapidly since 1975. We have seen exciting developments in cryptography: public-key encryption, digital signatures, the Data Encryption Standard (DES), key safeguarding schemes, and key distribution protocols. We have developed techniques for verifying that programs do not leak confidential data, or transmit classified data to users with lower security clearances. We have found new controls for protecting data in statistical databases--and new methods of attacking these databases. We have come to a better understanding of the theoretical and practical limitations to security.

#*The Annotated C++ Reference Manual.
#@Margaret A. Ellis,Bjarne Stroustrup
#year1990
#conf
#citation1308
#index134
#arnetid136

#*Functional Programming
#@A. J. Field,Peter G. Harrison
#year1988
#conf
#citation453
#index135
#arnetid137

#*Relational Databases and Knowledge Bases
#@Georges Gardarin,Patrick Valduriez
#year1989
#conf
#citation117
#index136
#arnetid138

#*Natural Language Processing in PROLOG
#@Gerald Gazdar,Chris Mellish
#year1989
#conf
#citation2
#index137
#arnetid139

#*Genetic Algorithms in Search Optimization and Machine Learning
#@David E. Goldberg
#year1989
#conf
#citation36067
#index138
#arnetid140

#*Smalltalk-80: The Language and Its Implementation.
#@Adele Goldberg,David Robson
#year1983
#conf
#citation5145
#index139
#arnetid141
#!From the Preface (See Front Matter for full Preface) Advances in the design and production of computer hardware have brought many more people into direct contact with computers. Similar advances in the design and production of computer software are required in order that this increased contact be as rewarding as possible. The Smalltalk-80 system is a result of a decade of research into creating computer software that is appropriate for producing highly functional and interactive contact with personal computer systems. This book is the first detailed account of the Smalltalk-80 system. It is divided into four major parts: Part One -- an overview of the concepts and syntax of the programming language. Part Two -- an annotated and illustrated specification of the system's functionality. Part Three -- an example of the design and implementation of a moderate-size application. Part Four -- a specification of the Smalltalk-80 virtual machine.

#*The Java™ Language Specification.
#@James Gosling,William N. Joy,Guy L. Steele Jr.
#year1996
#conf
#citation-1
#index140
#arnetid142

#*A Retargetable C Compiler: Design and Implementation
#@David R. Hanson,Christopher W. Fraser
#year1995
#conf
#citation-1
#index141
#arnetid143

#*Objektorientierte Datenbanken: Konzepte, Modelle, Systeme.
#@Andreas Heuer
#year1992
#conf
#citation-1
#index142
#arnetid144

#*Objektorientierte Datenbanken: Konzepte, Modelle, Systeme, 2. Auflage.
#@Andreas Heuer
#year1997
#conf
#citation-1
#index143
#arnetid145

#*Introduction to Automata Theory, Languages and Computation.
#@John E. Hopcroft,Jeffrey D. Ullman
#year1979
#conf
#citation90
#index144
#arnetid146

#*An Introduction to Parallel Algorithms
#@Joseph JáJá
#year1992
#conf
#citation-1
#index145
#arnetid147

#*Introduction to Expert Systems, 1st Edition.
#@Peter Jackson
#year1986
#conf
#citation-1
#index146
#arnetid148

#*Introduction to Expert Systems, 2nd Edition.
#@Peter Jackson
#year1990
#conf
#citation-1
#index147
#arnetid149
#!:The third edition of Peter Jackson's book, Introduction to Expert Systems, updates the technological base of expert systems research and embeds those results in the context of a wide variety of application areas. The earlier chapters take a more practical approach to the basic topics than the previous editions, while the later chapters introduce new topic areas, such as case-based reasoning, connectionist systems, and hybrid systems. Results in related areas, such as machine learning and reasoning with uncertainty are also accorded a thorough treatment.

#*Introduction to Expert Systems, 3rd Edition.
#@Peter Jackson
#year1999
#conf
#citation-1
#index148
#arnetid150
#!:The third edition of Peter Jackson's book, Introduction to Expert Systems, updates the technological base of expert systems research and embeds those results in the context of a wide variety of application areas. The earlier chapters take a more practical approach to the basic topics than the previous editions, while the later chapters introduce new topic areas, such as case-based reasoning, connectionist systems, and hybrid systems. Results in related areas, such as machine learning and reasoning with uncertainty are also accorded a thorough treatment.

#*The Practice of Programming
#@Brian W. Kernighan,Rob Pike
#year1999
#conf
#citation-1
#index149
#arnetid151

#*Object-Oriented Concepts, Databases, and Applications.
#@Won Kim,Frederick H. Lochovsky
#year1989
#conf
#citation563
#index150
#arnetid152

#*The Art of Computer Programming, Volume I: Fundamental Algorithms
#@Donald E. Knuth
#year1968
#conf
#citation809
#index151
#arnetid153

#*The Art of Computer Programming, Volume II: Seminumerical Algorithms
#@Donald E. Knuth
#year1969
#conf
#citation707
#index152
#arnetid154

#*The Art of Computer Programming, Volume III: Sorting and Searching
#@Donald E. Knuth
#year1973
#conf
#citation707
#index153
#arnetid155

#*The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition.
#@Donald E. Knuth
#year1973
#conf
#citation809
#index154
#arnetid156

#*The Art of Computer Programming, Volume II: Seminumerical Algorithms, 2nd Edition
#@Donald E. Knuth
#year1981
#conf
#citation707
#index155
#arnetid157

#*Inside the C++ Object Model
#@Stanley B. Lippman
#year1996
#conf
#citation128
#index156
#arnetid158
#!Inside the C++ Object Model focuses on the underlying mechanisms that support object-oriented programming within C++: constructor semantics, temporary generation, support for encapsulation, inheritance, and "the virtuals"-virtual functions and virtual inheritance. This book shows how your understanding the underlying implementation models can help you code more efficiently and with greater confidence. Lippman dispells the misinformation and myths about the overhead and complexity associated with C++, while pointing out areas in which costs and trade offs, sometimes hidden, do exist. He then explains how the various implementation models arose, points out areas in which they are likely to evolve, and why they are what they are. He covers the semantic implications of the C++ object model and how that model affects your programs.Highlights Explores the program behavior implicit in the C++ Object Model's support of object-oriented programming. Explains the basic implementation of the object-oriented features and the trade offs implicit in those features. Examines the impact on performance in terms of program transformation. Provides abundant program examples, diagrams, and performance measurements to relate object-oriented concepts to the underlying object model.If you are a C++ programmer who desires a fuller understanding of what is going on "under the hood," then Inside the C++ Object Model is for you!

#*Introduction to Linear and Nonlinear Programming.
#@David G. Luenberger
#year1973
#conf
#citation2181
#index157
#arnetid159

#*Design of Relational Databases
#@Heikki Mannila,Kari-Jouko Räihä
#year1992
#conf
#citation-1
#index158
#arnetid160

#*Tcl and the Tk Toolkit
#@John K. Ousterhout
#year1994
#conf
#citation13
#index159
#arnetid161
#!From the Book:Tcl was born of frustration. In the early 1980s my students and I developed a number of interactive tools at the University of California at Berkeley, mostly for integrated circuit design, and we found ourselves spending a lot of time building bad command languages. Each tool needed to have a command language of some sort, but our main interest was in the tool rather than its command language. We spent as little time as possible on the command language and always ended up with a language that was weak and quirky. Furthermore, the command language for one tool was never quite right for the next tool, so we ended up building a new bad command language for each tool. This became increasingly frustrating.In the fall of 1987 it occurred to me that the solution was to build a reusable command language. If a general-purpose scripting language could be built as a C library package, then perhaps it could be reused for many different purposes in many different applications. Of course, the language would need to be extensible so that each application could add its own specific features to the core provided by the library. In the spring of 1988 I decided to implement such a language, and the result was Tcl. Tk was also born of frustration. The basic idea for Tk arose in response to Apple's announcement of HyperCard in the fall of 1987. HyperCard generated tremendous excitement because of the power of the system and the way in which it allowed many different interactive elements to be scripted and work together. However, I was discouraged. The HyperCard system had obviously taken a large development effort, and it seemed unlikely to me that a small group such as a university researchproject could ever mount such a massive effort. This suggested that we would not be able to participate in the development of new forms of interactive software in the future.I concluded that the only hope for us was a component approach. Rather than building a new application as a self-contained monolith with hundreds of thousands of lines of code, we needed to find a way to divide applications into many smaller reusable components. Ideally each component would be small enough to be implemented by a small group, and interesting applications could be created by assembling components. In this environment it should be possible to create an exciting new application by developing one new component and then combining it with existing components.The component-based approach requires a powerful and flexible "glue"for assembling the components, and it occurred to me that perhaps a shared scripting language could provide that glue. Out of this thinking grew Tk, an X11 toolkit based on Tcl. Tk allows components to be either individual user-interface controls or entire applications; in either case components can be developed independently and Tcl can be used to assemble the components and communicate between them.I started writing Tcl and Tk as a hobby in my spare time. As other people began to use the systems I found myself spending more and more time on them, to the point where today they occupy almost all of my waking hours and many of my sleeping ones.Tcl and Tk have succeeded beyond my wildest dreams. The Tcl/Tk developer community now numbers in the tens of thousands and there are thousands of Tcl applications in existence or under development. The application areas for Tcl and Tk cover virtually the entire spectrum of graphical and engineering applications, including computer-aided design, software development, testing, instrument control, scientific visualization, and multimedia. Tcl is used by itself in many applications, and Tcl and Tk are used together in many others. Tcl and Tk are being used by hundreds of companies, large and small, as well as universities and research laboratories.One benefit that came as a surprise to me is that it is possible to create interesting graphical user interfaces (GUIs) entirely as Tcl scripts. I had always assumed that every Tcl application would contain some new C code that implements new Tcl commands, plus some Tcl scripts that combine the new commands with the built-in facilities provided by Tcl. However, once a simple Tcl/Tk application called wish became available, many people began creating user interfaces by writing Tcl scripts for it, without writing any C code at all! It turned out that the Tcl and Tk commands provide a high-level interface to GUI programming that hides many of the details faced by a C programmer. As a result, it is much easier to learn how to use wish than a C-based toolkit, and user interfaces can be written with much less code. Most Tcl/Tk users never write any C code at all and most of the Tcl/Tk applications consist solely of Tcl scripts.This book is intended as an introduction to Tcl and Tk for programmers who plan to write or modify Tcl/Tk applications. I assume that readers have programmed in C and have at least passing familiarity with a shell such as sh or csh or ksh. I also assume that readers have used the X Window System and are familiar with basic ideas such as using the mouse, resizing windows, etc. No prior experience with Tcl or Tk is needed in order to read this book, and you need not have written X applications using other toolkits such as Motif.The book is organized so that you can learn Tcl without learning Tk if you wish. Also, the discussion of how to write Tcl scripts is separate from the discussion of how to use the C library interfaces provided by Tcl and Tk. The first two parts of the book describe Tcl and Tk at the level of writing scripts, and the last two parts describe the C interfaces for Tcl and Tk; if you are like the majority of Tcl/Tk users who only write scripts, you can stop after reading the first two parts.In spite of my best efforts, I'm sure that there are errors in this edition of the book. I'm interested in hearing about any problems that you encounter, whether they are typos, formatting errors, sections or ideas that are hard to understand, or bugs in the examples. I'll attempt to correct the problems in future printings of the book. The best way to report problems is with electronic mail sent to tclbookbugs@cs.berkeley.edu.Many people have helped in the creation of this book. First and foremost I would like to thank Brian Kernighan, who reviewed several drafts of the manuscript with almost terrifying thoroughness and uncovered numerous problems both large and small. I am also grateful for the detailed comments provided by the other Addison-Wesley technical reviewers: Richard Blevins, Gerard Holzmann, Curt Horkey, Ron Hutchins, Stephen Johnson, Oliver Jones, David Korn, Bill Leggett, Don Libes, Kent Margraf, Stuart McRobert, David Richardson, Alexei Rodrigues, Gerald Rosenberg, John Slater, and Win Treese. Thanks also to Bob Sproull, who read the next-to-last draft from cover to cover and provided countless bug fixes and suggestions.I made early drafts of the manuscript available to the Tcl/Tk community via the Internet and received countless comments and suggestions from all over the world in return. I'm afraid that I didn't keep careful enough records to acknowledge all the people who contributed in this way, but the list of contributors includes at least the following people: Marvin Aguero, Miriam Amos Nihart, Jim Anderson, Frederik Anheuser, Jeff Blaine, John Boller, David Boyce, Terry Brannon, Richard Campbell, J. Cazander, Wen Chen, Richard Cheung, Peter Chubb, De Clarke, Peter Collinson, Peter Costantinidis, Alistair Crooks, Peter Davies, Tal Dayan, Akim Demaille, Mark Diekhans, Matthew Dillon, Tuan Doan, Tony Duarte, Paul DuBois, Anton Eliens, Marc R. Ewing, Luis Fernandes, Martin Forssen, Ben Fried, Matteo Frigo, Andrej Gabara, Steve Gaede, Sanjay Ghemawat, Bob Gibson, Michael Halle, Jun Hamano, Stephen Hansen, Brian Harrison, Marti Hearst, Fergus Henderson, Kevin Hendrix, David Herron, Patrick Hertel, Carsten Heyl, Leszek Holenderski, Jamie Honan, Rob W.W. Hooft, Nick Hounsome, Christopher Hylands, Jonathan Jowett, Poul-Henning Kamp, Karen L. Karavanic, Sunil Khatri, Vivek Khera, Jon Knight, Roger Knopf, Ramkumar Krishnan, Dave Kristol, Peter LaBelle, Tor-Erik Larsen, Tom Legrady, Will E. Leland, Kim Lester, Joshua Levy, Don Libes, Oscar Linares, David C.P. Linden, Toumas J. Lukka, Steve Lord, Steve Lumetta, Earlin Lutz, David J. Mackenzie, B.G. Mahesh, John Maline, Graham Mark, Stuart McRobert, George Moon, Michael Morris, Russell Nelson, Dale K. Newby, Richard Newton, Peter Nguyen, David Nichols, Marty Olevitch, Rita Ousterhout, John Pierce, Stephen Pietrowicz, Anna Pluzhnikov, Nico Poppelier, M.V.S. Ramanath, Cary D. Renzema, Mark Roseman, Samir Tiongson Saxena, Jay Schmidgall, Dan M. Serachitopol, Hume Smith, Frank Stajano, Larry Streepy, John E. Stump, Michael Sullivan, Holger Teutsch, Bennett E. Todd, Glenn Trewitt, D.A. Vaughan-Pope, Richard Vieregge, Larry W. Virden, David Waitzman, Matt Wartell, Glenn Waters, Wally Wedel, Juergen Weigert, Mark Weiser, Brent Welch, Alex Woo, Su-Lin Wu, Kawata Yasuro, Chut Ngeow Yee, Richard Yen, Stephen Ching-SingYen, and Mike Young.Many many people have made significant contributions to the development of Tcl and Tk. Without all of their efforts there would have been nothing of interest to write about in this book. Although I cannot hope to acknowledge all the people who helped to make Tcl and Tk what they are today, I would like to thank the following people specially: Don Libes, for writing the first widely used Tcl application; Mark Diekhans and Karl Lehenbauer, for TclX; Alastair Fyfe, for supporting the early development of Tcl; Mary Ann May-Pumphrey, for developing the original Tcl test suite; George Howlett, Michael McLennan, and Sani Nassif, for the BLT extensions; Kevin Kenny, for showing that Tcl can be used to communicate with almost any imaginable program; Joel Bartlett, for many challenging conversations and for inspiring Tk's canvas widget with his ezd program; Larry Rowe, for developing Tcl-DP and for providing general advice and support; Sven Delmas, for developing the XF application builder based on Tk; and Andrew Payne, for the widget tour and for meritorious Tcl evangelism.Several companies have provided financial support for the development of Tcl and Tk, including Digital Equipment Corporation, Hewlett-Packard Corporation, Sun Microsystems, and Computerized Processes Unlimited. I am particularly grateful to Digital's Western Research Laboratory and its director, Richard Swan, for providing me with a one-day-per-week hideaway where I could go to gather my thoughts and work on Tcl and Tk.Terry Lessard-Smith and Bob Miller have provided fabulous administrative support for this and all my other projects. I don't know how I would get anything done without them.Finally, I owe a special debt to my colleague and friend Dave Patterson, whose humor and sage advice have inspired and shaped much of my professional career, and to my wife Rita and daughters Kay and Amy, who have tolerated my workaholic tendencies with more cheer and affection than I deserve. John Ousterhout Berkeley, California February, 1994

#*Functional Programming and Parallel Graph Rewriting
#@Marinus J. Plasmeijer,Marko C. J. D. van Eekelen
#year1993
#conf
#citation14
#index160
#arnetid162

#*Web Caching and Replication
#@Michael Rabinovich,Oliver Spatscheck
#year2001
#conf
#citation304
#index161
#arnetid163
#!Web caching and replication provides essential material based on the extensive real-world experience of two experts from AT & T Labs. This comprehensive examination of caching, replication, and load-balacing practices for the Web brings together information from and for the commercial world, including real-life products; technical standards communities, such as IETF and W3C; and academic research.

#*Mehrrechner-Datenbanksysteme - Grundlagen der verteilten und parallelen Datenbankverarbeitung.
#@Erhard Rahm
#year1994
#conf
#citation64
#index162
#arnetid164

#*Advanced Prolog: Techniques and Examples
#@Peter Ross
#year1989
#conf
#citation24
#index163
#arnetid165

#*Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer.
#@Gerard Salton
#year1989
#conf
#citation24
#index164
#arnetid166

#*The Design and Analysis of Spatial Data Structures
#@Hanan Samet
#year1990
#conf
#citation17
#index165
#arnetid167

#*Temporal Deductive Databases.
#@Marianne Baudinet,Jan Chomicki,Pierre Wolper
#year1993
#confTemporal Databases
#citation85
#index166
#arnetid168

#*The Historical Relational Data Model (HRDM) Revisited.
#@James Clifford,Albert Croker
#year1993
#confTemporal Databases
#citation42
#index167
#arnetid169

#*On the Completeness of Query Languages for Grouped and Ungrouped Historical Data Models.
#@James Clifford,Albert Croker,Alexander Tuzhilin
#year1993
#confTemporal Databases
#citation-1
#index168
#arnetid170

#*A Temporal Model and Query Language for EER Databases.
#@Ramez Elmasri,Gene T. J. Wuu,Vram Kouramajian
#year1993
#confTemporal Databases
#citation143
#index169
#arnetid171

#*The Time Index and the Monotonic B+-tree.
#@Ramez Elmasri,Gene T. J. Wuu,Vram Kouramajian
#year1993
#confTemporal Databases
#citation46
#index170
#arnetid172

#*Ben-Zvi's Pioneering Work in Relational Temporal Databases.
#@Shashi K. Gadia
#year1993
#confTemporal Databases
#citation6
#index171
#arnetid173

#*Temporal Databases: A Prelude to Parametric Data.
#@Shashi K. Gadia,Sunil S. Nair
#year1993
#confTemporal Databases
#citation70
#index172
#arnetid174

#*Object and Spreadsheet Histories.
#@Seymour Ginsburg
#year1993
#confTemporal Databases
#citation2
#index173
#arnetid175

#*Differential Query Processing in Transaction-Time Databases.
#@Christian S. Jensen,Leo Mark
#year1993
#confTemporal Databases
#citation8
#index174
#arnetid176

#*Indexing Techniques for Historical Databases.
#@Curtis P. Kolovson
#year1993
#confTemporal Databases
#citation0
#index175
#arnetid177

#*Stream Processing: Temporal Query Processing and Optimization.
#@T. Y. Cliff Leung,Richard R. Muntz
#year1993
#confTemporal Databases
#citation44
#index176
#arnetid178

#*Transaction-Time Databases.
#@David B. Lomet,Betty Salzberg
#year1993
#confTemporal Databases
#citation56
#index177
#arnetid179

#*The Interval-extended Relational Model and Its Applications to Valid-time Databases.
#@Nikos A. Lorentzos
#year1993
#confTemporal Databases
#citation45
#index178
#arnetid180

#*temporal Reasoning.
#@Angelo Montanari,Barbara Pernici
#year1993
#confTemporal Databases
#citation28
#index179
#arnetid181

#*Temporal Extensions to the Relational Model and SQL.
#@Shamkant B. Navathe,Rafi Ahmed
#year1993
#confTemporal Databases
#citation59
#index180
#arnetid182

#*HSQL: A Historical Query Language.
#@Nandlal L. Sarda
#year1993
#confTemporal Databases
#citation46
#index181
#arnetid183

#*Join Processing and Optimization in Temporal Relational Databases.
#@Arie Segev
#year1993
#confTemporal Databases
#citation13
#index182
#arnetid184

#*A Temporal Data Model Based on Time Sequences.
#@Arie Segev,Arie Shoshani
#year1993
#confTemporal Databases
#citation56
#index183
#arnetid185

#*An Overview of TQuel.
#@Richard T. Snodgrass
#year1993
#confTemporal Databases
#citation46
#index184
#arnetid186

#*A Generalized relational Framework for Modeling Temporal Data.
#@Abdullah Uz Tansel
#year1993
#confTemporal Databases
#citation19
#index185
#arnetid187

#*Applications of temporal Databases to Knowledge-based Simulations.
#@Alexander Tuzhilin
#year1993
#confTemporal Databases
#citation7
#index186
#arnetid188

#*Integrating Temporal Data in a Heterogeneous Environment.
#@Gio Wiederhold,Sushil Jajodia,Witold Litwin
#year1993
#confTemporal Databases
#citation53
#index187
#arnetid189

#*A Uniform Model for Temporal and Versioned Object-oriented Databases.
#@Gene T. J. Wuu,Umeshwar Dayal
#year1993
#confTemporal Databases
#citation71
#index188
#arnetid190

#*Relational Database Theory
#@Paolo Atzeni,Valeria De Antonellis
#year1993
#conf
#citation206
#index189
#arnetid191

#*Conceptual Database Design: An Entity-Relationship Approach.
#@Carlo Batini,Stefano Ceri,Shamkant B. Navathe
#year1992
#conf
#citation1174
#index190
#arnetid192

#*Object-Oriented Design with Applications
#@Grady Booch
#year1990
#conf
#citation488
#index191
#arnetid193

#*Fundamentals of Database Systems
#@Ramez Elmasri,Shamkant B. Navathe
#year1989
#conf
#citation3
#index192
#arnetid194

#*Fundamentals of Database Systems, 2nd Edition.
#@Ramez Elmasri,Shamkant B. Navathe
#year1994
#conf
#citation-1
#index193
#arnetid195
#!:Fundamentals of Database Systems combines clear explanations of theory and design, broad coverage of models and real systems, and excellent examples with up-to-date introductions to modern database technologies. This edition is completely revised and updated, and reflects the latest trends in technological and application development. Professors Elmasri and Navathe focus on the relational model and include coverage of recent object-oriented developments. They also address advanced modeling and system enhancements in the areas of active databases, temporal and spatial databases, and multimedia information systems. This edition also surveys the latest application areas of data warehousing, data mining, web databases, digital libraries, GIS, and genome databases. New to the Third Edition Reorganized material on data modeling to clearly separate entity relationship modeling, extended entity relationship modeling, and object-oriented modeling Expanded coverage of the object-oriented and object/relational approach to data management, including ODMG and SQL3 Uses examples from real database systems including OracleTM and Microsoft AccessAE Includes discussion of decision support applications of data warehousing and data mining, as well as emerging technologies of web databases, multimedia, and mobile databases Covers advanced modeling in the areas of active, temporal, and spatial databases Provides coverage of issues of physical database tuning Discusses current database application areas of GIS, genome, and digital libraries

#*Crafting a Compiler with C
#@Charles N. Fischer,Richard J. LeBlanc
#year1991
#conf
#citation0
#index194
#arnetid196

#*Introduction to Parallel Computing.
#@Vipin Kumar,Ananth Grama,Anshul Gupta,George Karypis
#year1994
#conf
#citation600
#index195
#arnetid197

#*Computing with Logic: Logic Programming with Prolog
#@David Maier,David Scott Warren
#year1988
#conf
#citation117
#index196
#arnetid198

#*Temporal Databases: Theory, Design, and Implementation
#@Abdullah Uz Tansel,James Clifford,Shashi K. Gadia,Sushil Jajodia,Arie Segev,Richard T. Snodgrass
#year1993
#conf
#citation670
#index197
#arnetid199

#*Automaten, Sprachen und Maschinen für Anwender
#@Jürgen Albert,Thomas Ottmann
#year1983
#confReihe Informatik
#citation18
#index198
#arnetid200

#*Rechnerorganisation
#@Wolfgang Everling
#year1990
#confReihe Informatik
#citation2
#index199
#arnetid201

#*Rechnerorganisation, 2. Auflage
#@Wolfgang Everling
#year1993
#confReihe Informatik
#citation0
#index200
#arnetid202

#*Computer-Grafik
#@Dieter W. Fellner
#year1988
#confReihe Informatik
#citation2
#index201
#arnetid203

#*Computer-Grafik, 2. Auflage
#@Dieter W. Fellner
#year1992
#confReihe Informatik
#citation0
#index202
#arnetid204

#*Planen: Einführung in die Planerstellungsmethoden der künstlichen Intelligenz
#@Joachim Hertzberg
#year1989
#confReihe Informatik
#citation29
#index203
#arnetid205

#*Kryptologie
#@Patrick Horster
#year1985
#confReihe Informatik
#citation26
#index204
#arnetid206

#*Theoretische Grundlagen relationaler Datenbanksysteme
#@Peter Kandzia,Hans-Joachim Klein
#year1993
#confReihe Informatik
#citation-1
#index205
#arnetid207

#*Rechnernetzwerksystemarchitekturen und Datenkommunikation
#@Franz-Joachim Kauffels
#year1987
#confReihe Informatik
#citation-1
#index206
#arnetid208

#*Datenbankmaschinen: Performanz durch Parallelität
#@Daniel A. Keim,Edy S. Prawirohardjo
#year1992
#confReihe Informatik
#citation-1
#index207
#arnetid209

#*Parallele Transaktionen in Datenbanksystemen
#@Udo Kelter
#year1985
#confReihe Informatik
#citation4
#index208
#arnetid210

#*Syntaxanalyse, 3. Auflage
#@Otto Mayer
#year1986
#confReihe Informatik
#citation0
#index209
#arnetid211

#*C
#@Michael Mock
#year1990
#confReihe Informatik
#citation-1
#index210
#arnetid212

#*Algorithmen und Datenstrukturen
#@Thomas Ottmann,Peter Widmayer
#year1990
#confReihe Informatik
#citation363
#index211
#arnetid213

#*Algorithmen und Datenstrukturen, 2. Auflage
#@Thomas Ottmann,Peter Widmayer
#year1993
#confReihe Informatik
#citation-1
#index212
#arnetid214

#*Künstliche Intelligenz: Überblick und Grundlagen; grundlegende Konzepte und Methoden zur Realisierung von Systemen der künstlichen Intelligenz
#@Peter Schefe
#year1986
#confReihe Informatik
#citation2
#index213
#arnetid215

#*Geo-Datenbanksysteme: Eine Speicher- und Zugriffsarchitektur
#@Ralf Schneider
#year1993
#confReihe Informatik
#citation6
#index214
#arnetid216

#*Logik für Informatiker
#@Uwe Schöning
#year1987
#confReihe Informatik
#citation178
#index215
#arnetid217

#*Logik für Informatiker, 2. Auflage
#@Uwe Schöning
#year1989
#confReihe Informatik
#citation220
#index216
#arnetid218

#*Logik für Informatiker, 3. Auflage
#@Uwe Schöning
#year1992
#confReihe Informatik
#citation220
#index217
#arnetid219

#*Softwaretechnologie: Eine Einführung, 3. Auflage
#@Franz Stetter
#year1984
#confReihe Informatik
#citation-1
#index218
#arnetid220

#*Softwaretechnologie: Eine Einführung, 4. Auflage
#@Franz Stetter
#year1987
#confReihe Informatik
#citation-1
#index219
#arnetid221

#*Mikroprozessoren: vom Bauteil zur Anwendung, 2. Auflage
#@Heinz Waller,Peter Hilgers
#year1985
#confReihe Informatik
#citation0
#index220
#arnetid222

#*Objektorientierte Schemaentwicklung: Ein kategorialer Ansatz für Datenbanken und Programmierung
#@Hartmut Wedekind
#year1992
#confReihe Informatik
#citation-1
#index221
#arnetid223

#*Datenbanksysteme I
#@Hartmut Wedekind,Theo Härder
#year1974
#confReihe Informatik
#citation0
#index222
#arnetid224

#*Datenbanksysteme II
#@Hartmut Wedekind,Theo Härder
#year1976
#confReihe Informatik
#citation10
#index223
#arnetid225

#*Datenbanksysteme I, 2. Auflage
#@Hartmut Wedekind,Theo Härder
#year1981
#confReihe Informatik
#citation0
#index224
#arnetid226

#*Datenbanksysteme I, 3. Auflage
#@Hartmut Wedekind,Theo Härder
#year1991
#confReihe Informatik
#citation0
#index225
#arnetid227

#*Compilerbau I: Analyse
#@Hans P. Zima
#year1982
#confReihe Informatik
#citation-1
#index226
#arnetid228

#*Compilerbau II: Synthese und Optimierung
#@Hans P. Zima
#year1983
#confReihe Informatik
#citation-1
#index227
#arnetid229

#*Betriebssysteme: Parallele Prozesse, 3. Auflage
#@Hans P. Zima
#year1986
#confReihe Informatik
#citation-1
#index228
#arnetid230

#*Compilerbau I: Analyse, 2. Auflage
#@Hans P. Zima
#year1988
#confReihe Informatik
#citation-1
#index229
#arnetid231

#*Information Retrieval.
#@C. J. van Rijsbergen
#year1979
#conf
#citation3
#index230
#arnetid232

#*Building an Optimizing Compiler.
#@C. Robert Morgan
#year1998
#conf
#citation-1
#index231
#arnetid233

#*Introduction to Knowledge Base Systems
#@Richard A. Frost
#year1986
#conf
#citation197
#index232
#arnetid234

#*Debuggers for Programming Languages.
#@Sanjeev Kumar Aggarwal,M. Sarath Kumar
#year2002
#confThe Compiler Design Handbook
#citation1
#index233
#arnetid235

#*Software Pipelining.
#@Vicki H. Allan,Stephen J. Allan
#year2002
#confThe Compiler Design Handbook
#citation-1
#index234
#arnetid236

#*Compilation for Distributed Memory Architectures.
#@Alok N. Choudhary,Mahmut T. Kandemir
#year2002
#confThe Compiler Design Handbook
#citation0
#index235
#arnetid237

#*Dynamic Compilation.
#@Evelyn Duesterwald
#year2002
#confThe Compiler Design Handbook
#citation7
#index236
#arnetid238

#*Register Allocation.
#@K. Gopinath
#year2002
#confThe Compiler Design Handbook
#citation3
#index237
#arnetid239

#*Instruction Scheduling.
#@Ramaswamy Govindarajan
#year2002
#confThe Compiler Design Handbook
#citation18
#index238
#arnetid240

#*Data Flow Testing.
#@Rajiv Gupta,Neelam Gupta
#year2002
#confThe Compiler Design Handbook
#citation-1
#index239
#arnetid241

#*Profile-Guided Compiler Optimizations.
#@Rajiv Gupta,Eduard Mehofer,Youtao Zhang
#year2002
#confThe Compiler Design Handbook
#citation18
#index240
#arnetid242

#*Data Flow Analysis.
#@Uday P. Khedker
#year2002
#confThe Compiler Design Handbook
#citation16
#index241
#arnetid243

#*Optimizations for Object-Oriented Languages.
#@Andreas Krall,R. Nigel Horspool
#year2002
#confThe Compiler Design Handbook
#citation0
#index242
#arnetid244

#*Program Slicing.
#@G. B. Mund,Diganta Goswami,Rajib Mall
#year2002
#confThe Compiler Design Handbook
#citation1
#index243
#arnetid245

#*Automatic Generation of Code Optimizers from Formal Specifications.
#@Vineeth Kumar Paleri
#year2002
#confThe Compiler Design Handbook
#citation3
#index244
#arnetid246

#*Introduction to Operational Semantics.
#@Sanjiva Prasad,S. Arun-Kumar
#year2002
#confThe Compiler Design Handbook
#citation3
#index245
#arnetid247

#*Architecture Description Languages for Retargetable Compilation.
#@Wei Qin,Sharad Malik
#year2002
#confThe Compiler Design Handbook
#citation31
#index246
#arnetid248

#*Retargetable Very Long Instuction Word Compiler Framework for Digital Signal Processors.
#@Subramanian Rajagopalan,Sharad Malik
#year2002
#confThe Compiler Design Handbook
#citation0
#index247
#arnetid249

#*Dependence Analysis and Parallelizing Transformations.
#@Sanjay V. Rajopadhye
#year2002
#confThe Compiler Design Handbook
#citation7
#index248
#arnetid250

#*Automatic Data Distribution.
#@J. Ramanujam
#year2002
#confThe Compiler Design Handbook
#citation0
#index249
#arnetid251

#*Instruction Selection Using Tree Parsing.
#@Priti Shankar
#year2002
#confThe Compiler Design Handbook
#citation0
#index250
#arnetid252

#*Scalar Compiler Optimizations on the Static Single Assignment Form and the Flow Graph.
#@Y. N. Srikant
#year2002
#confThe Compiler Design Handbook
#citation0
#index251
#arnetid253

#*Type Systems in Programming Languages.
#@Ramesh Subrahmanyam
#year2002
#confThe Compiler Design Handbook
#citation0
#index252
#arnetid254

#*Compiling Safe Mobile Code.
#@R. Venugopal,Ravindra B. Keskar
#year2002
#confThe Compiler Design Handbook
#citation0
#index253
#arnetid255

#*Shape Analysis and Applications.
#@Reinhard Wilhelm,Thomas W. Reps,Shmuel Sagiv
#year2002
#confThe Compiler Design Handbook
#citation8
#index254
#arnetid256

#*A Comparative Case Study of Distributed Network Architectures for Different Automotive Applications.
#@Jakob Axelsson,Joakim Fröberg,Hans Hansson,Christer Norström,Kristian Sandström,Björn Villing
#year2005
#confThe Industrial Information Technology Handbook
#citation6
#index255
#arnetid257

#*LonWorks/EIA-709 Networks EIA 709 Protocol (Lon Talk).
#@Dietmar Loy
#year2005
#confThe Industrial Information Technology Handbook
#citation5
#index256
#arnetid258

#*Distributed Components in Microsoft Platforms - Technology Overview.
#@Marcos Ribeiro Pereira Barretto,Paulo Marcelo Porto Alves Blanco,Marco Antonio Poli
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index257
#arnetid259

#*The Quest for Real-Time Behavior in Ethernet.
#@Paulo Pedreiras,Luís Almeida,José Alberto Fonseca
#year2005
#confThe Industrial Information Technology Handbook
#citation4
#index258
#arnetid260

#*CORBA in Manufacturing - Technology Overview.
#@Marcos Ribeiro Pereira Barretto,Paulo Marcelo Porto Alves Blanco,Marco Antonio Poli
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index259
#arnetid261

#*IPv6, IPSec, and VPNs.
#@Walter T. Penzhorn,Johann Amsenga
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index260
#arnetid262

#*Overview and Classification of IP Routing Protocols - IP Routing: Interior and Exterior Routing Protocols.
#@Lucia Lo Bello,Enzo Palumbo
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index261
#arnetid263

#*Java Technology and Industrial Applications.
#@Jörn Peschke,Arndt Lüder
#year2005
#confThe Industrial Information Technology Handbook
#citation3
#index262
#arnetid264

#*Internal Architecture and Features of Real-Time Embedded Operation Systems.
#@Ivan Cibrario Bertolotti
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index263
#arnetid265

#*Middleware.
#@Andreas Polze
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index264
#arnetid266

#*Network On-Chip Design for Gigascale Systems-on-Chip.
#@Davide Bertozzi,Luca Benini,Giovanni De Micheli
#year2005
#confThe Industrial Information Technology Handbook
#citation8
#index265
#arnetid267

#*Principles and Features of PROFINET.
#@Manfred Popp,Joachim Feld,Ralph Büsgen
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index266
#arnetid268

#*Knowledge Connect - An Approach for an Industrial IT Service Tool.
#@Carsten Beuthel,Paul George,Ulrich Topp
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index267
#arnetid269

#*Intelligent Space and Mobile Robots.
#@Joo-Ho Lee,Kazuyuki Morioka,Hideki Hashimoto
#year2005
#confThe Industrial Information Technology Handbook
#citation10
#index268
#arnetid270

#*Software for Wireless Sensor Networks.
#@Jan Blumenthal,Frank Golatowski,Marc Haase,Matthias Handy
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index269
#arnetid271

#*Web-based Enterprise Computing Development using J2EE.
#@Jiang B. Liu
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index270
#arnetid272

#*Holonic Manufacturing Systems: A Technical Overview.
#@Robert W. Brennan,James H. Christensen,William A. Gruver,Dilip B. Kotak,Douglas H. Norrie,Edwin H. van Leeuwen
#year2005
#confThe Industrial Information Technology Handbook
#citation12
#index271
#arnetid273

#*The GRAFCET Specification Language.
#@Paulo Portugal,Adriano Carvalho
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index272
#arnetid274

#*The IDA Standard.
#@Martin Buchwitz
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index273
#arnetid275

#*Embedded Software in the SoC World. The Concept of HdS in View of the HW and SW Design Challenge.
#@Frank Pospiech
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index274
#arnetid276

#*Platform-Based and Derivative Design.
#@Luca P. Carloni,Fernando De Bernardinis,Alberto L. Sangiovanni-Vincentelli,Marco Sgroi
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index275
#arnetid277

#*Internet Programming Languages.
#@Wolfgang Radinger,Martin Jandl
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index276
#arnetid278

#*FOUNDATION Fieldbus: History and Features.
#@Salvatore Cavalieri
#year2005
#confThe Industrial Information Technology Handbook
#citation3
#index277
#arnetid279

#*MPLS - Multiprotocol Label Switching.
#@José Ruela,Manuel Ricardo
#year2005
#confThe Industrial Information Technology Handbook
#citation2
#index278
#arnetid280

#*Operating Principles and Features of CAN Networks.
#@Gianluca Cena,Adriano Valenzano
#year2005
#confThe Industrial Information Technology Handbook
#citation3
#index279
#arnetid281

#*Robot Tactile Sensing.
#@R. Andrew Russell
#year2005
#confThe Industrial Information Technology Handbook
#citation53
#index280
#arnetid282

#*Hardware/Software Interfaces Design for SoC.
#@Wander O. Cesário,Flávio Rech Wagner,Ahmed Amine Jerraya
#year2005
#confThe Industrial Information Technology Handbook
#citation2
#index281
#arnetid283

#*Giving Robots a Sense of Smell.
#@R. Andrew Russell
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index282
#arnetid284

#*Mail Transfer and File Transfer Protocol.
#@Suvendi Chinnappen
#year2005
#confThe Industrial Information Technology Handbook
#citation0
#index283
#arnetid285

#*The Integrated Services Architecture and RSVP.
#@Henning Sanneck
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index284
#arnetid286

#*Collaborative (Agent-Based) Factory Automation.
#@Armando W. Colombo,Ronald Schoop,Ralf Neubert
#year2005
#confThe Industrial Information Technology Handbook
#citation14
#index285
#arnetid287

#*Linking Factory Floor and the Internet.
#@Thilo Sauter
#year2005
#confThe Industrial Information Technology Handbook
#citation2
#index286
#arnetid288

#*Which Network for Which Application.
#@Jean-Dominique Decotignie
#year2005
#confThe Industrial Information Technology Handbook
#citation2
#index287
#arnetid289

#*Internet Firewalls.
#@Günter Schäfer
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index288
#arnetid290

#*Interconnection of Wireline and Wireless Fieldbusses.
#@Jean-Dominique Decotignie
#year2005
#confThe Industrial Information Technology Handbook
#citation7
#index289
#arnetid291

#*IEEE 1394 for Factory Automation.
#@Michael Scholles,Uwe Schelinski,Petra Nauber
#year2005
#confThe Industrial Information Technology Handbook
#citation1
#index290
#arnetid292

#*Intelligent Sensors: Analysis and Design.
#@Eric Dekneuvel
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index291
#arnetid293

#*Securtity in Automation Networks.
#@Christian Schwaiger
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index292
#arnetid294

#*Integration Technologies of Field Devices in Distributed Control and Engineering Systems.
#@Christian Diedrich
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index293
#arnetid295

#*The Standard Message Specification for Industrial Automation Systems -ISO 9506 (MMS).
#@Karlheinz Schwarz
#year2005
#confThe Industrial Information Technology Handbook
#citation0
#index294
#arnetid296

#*RTP, RTCP, and RTSP - Internet Protocols for Real-Time Multimedia Communication.
#@Arjan Durresi,Raj Jain
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index295
#arnetid297

#*Smart Power Systems Rely on Standards for Information Models and Messaging - IEC 61850.
#@Karlheinz Schwarz
#year2005
#confThe Industrial Information Technology Handbook
#citation0
#index296
#arnetid298

#*The Fundamentals of Web Services.
#@Klaus-Peter Eckert
#year2005
#confThe Industrial Information Technology Handbook
#citation4
#index297
#arnetid299

#*Open System Architecture for Controls within Automation Systems (OSACA).
#@Michael Seyfarth,Andreas Kahmen
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index298
#arnetid300

#*Programming Web Services with .net and java.
#@Klaus-Peter Eckert
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index299
#arnetid301

#*A Survey of Congestion and QoS Control Mechanisms for the Internet.
#@Dorgham Sisalem,Adam Wolisz
#year2005
#confThe Industrial Information Technology Handbook
#citation0
#index300
#arnetid302

#*Languages for Embedded Systems.
#@Stephen Edwards
#year2005
#confThe Industrial Information Technology Handbook
#citation4
#index301
#arnetid303

#*Switched Ethernet in Automation Networking.
#@Tor Skeie,Svein Johannessen,Øyvind Holmeide
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index302
#arnetid304

#*Enterprise-Manufacturing Data Exchange Using XML.
#@David Emerson
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index303
#arnetid305

#*Programming with the IEC 61131-3 Languages and the MatPLC.
#@Mário de Sousa,Adriano Carvalho
#year2005
#confThe Industrial Information Technology Handbook
#citation0
#index304
#arnetid306

#*The Dynamic Host Configuration Protocol.
#@Michael Eyrich
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index305
#arnetid307

#*Security in Embedded Systems.
#@Andreas Steffen
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index306
#arnetid308

#*The Internet Protocol.
#@Jürgen Falb
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index307
#arnetid309

#*PROFIsafe - Safety Technology with PROFIBUS.
#@Wolfgang Stripf,Herbert Barthel
#year2005
#confThe Industrial Information Technology Handbook
#citation2
#index308
#arnetid310

#*ARP - Address Resolution Protocol.
#@Jürgen Falb
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index309
#arnetid311

#*XML for the Exchange of Automation Project Information.
#@Alexander Fay
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index310
#arnetid312

#*The WORLDFIP Fieldbus.
#@Jean-Pierre Thomesse
#year2005
#confThe Industrial Information Technology Handbook
#citation3
#index311
#arnetid313

#*IP-Mobility for Cellular and Wireless Networks.
#@Andreas Festag,Adam Wolisz
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index312
#arnetid314

#*Unified Modeling Language: The Industry Standard for Software Development.
#@Kleanthis Thramboulidis
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index313
#arnetid315

#*A Survey on Self-Organizing Wireless Sensor Networks.
#@Shashidhar Gandham,Ravi Musunuri,Praveen Rentala,Udit Saxena
#year2005
#confThe Industrial Information Technology Handbook
#citation6
#index314
#arnetid316

#*Web Servers, Clients, and Browsers.
#@Robert Tolksdorf
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index315
#arnetid317

#*The Hypertext Transfer Protocol and Uniform Resource Identifier.
#@Karl M. Göschka
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index316
#arnetid318

#*Introduction to Multisensor Data Fusion.
#@Pascal Vasseur,El Mustapha Mouaddib,Claude Pégard
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index317
#arnetid319

#*Models of Computation for Embedded Systems.
#@Luís Gomes,João Paulo Barros
#year2005
#confThe Industrial Information Technology Handbook
#citation0
#index318
#arnetid320

#*Industrial IT-Based Network Management.
#@Yauheni Veryha,Peter Bort
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index319
#arnetid321

#*Hardware-level Design Languages.
#@Luís Gomes,Anikó Costa
#year2005
#confThe Industrial Information Technology Handbook
#citation0
#index320
#arnetid322

#*Integration Between Production and Business Systems.
#@Claus Vetter,Thomas Werner
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index321
#arnetid323

#*From Holonic Control to Virtual Enterprises: The Multi-Agent Approach.
#@Pavel Vrba,Vladimír Marík
#year2005
#confThe Industrial Information Technology Handbook
#citation8
#index322
#arnetid324

#*Acheiving Reconfigurability of Automation Systems by Using the New International Standard IEC 61499: A Developer's View.
#@Hans-Michael Hanisch,Valeriy Vyatkin
#year2005
#confThe Industrial Information Technology Handbook
#citation3
#index323
#arnetid325

#*IP-QoS: Scalable and Flexible Quality-of-Service with Differentiated Services.
#@Klaus Wehrle
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index324
#arnetid326

#*Real-Time Systems.
#@Hans Hansson,Mikael Nolin,Thomas Nolte
#year2005
#confThe Industrial Information Technology Handbook
#citation2
#index325
#arnetid327

#*Wireless LAN Technology for the Factory Floor.
#@Andreas Willig
#year2005
#confThe Industrial Information Technology Handbook
#citation6
#index326
#arnetid328

#*Internet Still Image and Video Formats.
#@Guido Heising,Kai Uwe Barthel
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index327
#arnetid329

#*Principles of Lower-Layer Protocols for Data Communications.
#@Andreas Willing,Hagen Woesner
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index328
#arnetid330

#*Network Management: Basic Notions and Frameworks.
#@T. T. Mai Hoang
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index329
#arnetid331

#*Multicast.
#@Tanja Zseby
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index330
#arnetid332

#*HTTP Digest Authentication - Theory and Practice.
#@Thomas P. von Hoff,Mario Crevatin
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index331
#arnetid333

#*Web Services for Integrated Automation Systems - Challenges, Solutions and Future.
#@Zaijun Hu,Eckhard Kruse
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index332
#arnetid334

#*Verification Languages.
#@Aarti Gupta,Ali Alphan Bayazit,Yogesh S. Mahajan
#year2005
#confThe Industrial Information Technology Handbook
#citation5
#index333
#arnetid335

#*Mobile IP Routing.
#@Karin Anna Hummel,Helmut Hlavacs
#year2005
#confThe Industrial Information Technology Handbook
#citation0
#index334
#arnetid336

#*Remote Monitoring and Control over the Internet.
#@Hans-Arno Jacobsen
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index335
#arnetid337

#*Power Aware Embedded Computing.
#@Margarida F. Jacome,Anand Ramachandran
#year2005
#confThe Industrial Information Technology Handbook
#citation1
#index336
#arnetid338

#*Robot Vision.
#@Ray Jarvis
#year2005
#confThe Industrial Information Technology Handbook
#citation3671
#index337
#arnetid339

#*Bluetooth.
#@Thomas Jatschka,Robert Tschofen
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index338
#arnetid340

#*PROFIBUS - Open Solutions for the World of Automation.
#@Ulrich Jecht,Wolfgang Stripf,Peter Wenzel
#year2005
#confThe Industrial Information Technology Handbook
#citation9
#index339
#arnetid341

#*The Fundamentals of the Quality of Service.
#@Wolfgang Kampichler
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index340
#arnetid342

#*Ad Hoc Networks.
#@Holger Karl
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index341
#arnetid343

#*Applications of Haptics in Design and Manufacturing.
#@Thenkurussi Kesavadas,Arvind Balijepalli,Cartik Sharma
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index342
#arnetid344

#*Implementation af a Virtual Factory Communication System using the Manufacturing Message Specification Standard.
#@Dongsung Kim,Zygmunt J. Haas,Wook Hyun Kwon
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index343
#arnetid345

#*Ultrasonic Sensors in Robotics.
#@Lindsay Kleeman
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index344
#arnetid346

#*Microsoft's .NET.
#@Martin von Löwis,Peter Tröger
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index345
#arnetid347

#*Multiagent-based Architecture for Plant Automation.
#@Axel Klostermeyer,Eckehardt Klemm
#year2005
#confThe Industrial Information Technology Handbook
#citation3
#index346
#arnetid348

#*Introduction to e-Manufacturing.
#@Muammer Koc,Jun Ni,Jay Lee,Pulak Bandyopadhyay
#year2005
#confThe Industrial Information Technology Handbook
#citation52
#index347
#arnetid349

#*Time-Triggered Communication Networks.
#@Hermann Kopetz,Günther Bauer
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index348
#arnetid350

#*Internet-Based Telemanipulation.
#@Peter Korondi,Peter Tamas Szemes,P. Hashimoto
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index349
#arnetid351

#*Network Security and Secure Applications.
#@Christopher Krügel
#year2005
#confThe Industrial Information Technology Handbook
#citation0
#index350
#arnetid352

#*Simple Network Management Protocol SNMP.
#@Michael Kunes
#year2005
#confThe Industrial Information Technology Handbook
#citation28
#index351
#arnetid353

#*TCP/IP Architecture, Protocols, and Services.
#@Christian Kurz,Helmut Hlavacs
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index352
#arnetid354

#*OPC - Openness, Productivity, and Connectivity.
#@Jürgen Lange,Frank Iwanitz
#year2005
#confThe Industrial Information Technology Handbook
#citation2
#index353
#arnetid355

#*Design of Embedded Systems.
#@Luciano Lavagno,Claudio Passerone
#year2005
#confThe Industrial Information Technology Handbook
#citation6
#index354
#arnetid356

#*A Smart Transducer Interface Standard for Sensors and Actuators.
#@Kang Lee
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index355
#arnetid357

#*LonWorksTM over IP.
#@Dietmar Loy,Stefan Soucek
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index356
#arnetid358

#*The Transmission Control Protocol.
#@Aleksander Malinowski,Bogdan M. Wilamowski
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index357
#arnetid359

#*Multidimensional Databases.
#@Torben Bach Pedersen,Christian S. Jensen
#year2005
#confThe Industrial Information Technology Handbook
#citation6
#index358
#arnetid360

#*The User Datagram protocol.
#@Aleksander Malinowski,Bogdan M. Wilamowski
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index359
#arnetid361

#*Networked Control Systems Overview.
#@Pau Martí,Ricard Villá,Josep M. Fuertes,Gerhard Fohler
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index360
#arnetid362

#*System-on-Chip and Network-on-Chip Design.
#@Grant Martin
#year2005
#confThe Industrial Information Technology Handbook
#citation1
#index361
#arnetid363

#*Wireless Local Area Networks and Wireless Personal Area Networks (WLANs and WPANs).
#@Kirsten Matheus
#year2005
#confThe Industrial Information Technology Handbook
#citation2
#index362
#arnetid364

#*Open Controller Enabled by an Advanced Real-Time Network (OCEAN).
#@Fabrizio Meo
#year2005
#confThe Industrial Information Technology Handbook
#citation2
#index363
#arnetid365

#*IT Security for Automation Systems.
#@Martin Naedele
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index364
#arnetid366

#*The JEVIS Service Platform - Distributed Energy Data Acquisition and Management.
#@Peter Palensky
#year2005
#confThe Industrial Information Technology Handbook
#citation8
#index365
#arnetid367

#*An Introductory Survey of Networked Embedded Systems.
#@Hiren D. Patel,Sumit Gupta,Sandeep K. Shukla,Rajesh Gupta
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index366
#arnetid368

#*Thread Management for Shared-Memory Multiprocessors.
#@Thomas E. Anderson,Brian N. Bershad,Edward D. Lazowska,Henry M. Levy
#year1997
#confThe Computer Science and Engineering Handbook
#citation4
#index367
#arnetid369

#*Parallelizing Compilers.
#@Michael Wolfe
#year1997
#confThe Computer Science and Engineering Handbook
#citation14
#index368
#arnetid370
#%832280
#%574798

#*Renderman®: An Interface for Image Synthesis.
#@Anthony A. Apodaca
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index369
#arnetid371

#*Object-Oriented Databases.
#@François Bancilhon
#year1997
#confThe Computer Science and Engineering Handbook
#citation2
#index370
#arnetid372

#*Network and Internet Security.
#@Steven M. Bellovin
#year1997
#confThe Computer Science and Engineering Handbook
#citation5
#index371
#arnetid373

#*Concurrent/Distributed Programming Paradigm.
#@Andrew P. Bernat
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index372
#arnetid374

#*Parallel Algorithms.
#@Guy E. Blelloch,Bruce M. Maggs
#year1997
#confThe Computer Science and Engineering Handbook
#citation15
#index373
#arnetid375
#%145
#%702

#*Formal Models and the Specification Process.
#@Jonathan P. Bowen,Michael G. Hinchey
#year1997
#confThe Computer Science and Engineering Handbook
#citation14
#index374
#arnetid376

#*User Interface Design Activities.
#@Ruven E. Brooks
#year1997
#confThe Computer Science and Engineering Handbook
#citation2
#index375
#arnetid377

#*Virtual Reality.
#@Steve Bryson
#year1997
#confThe Computer Science and Engineering Handbook
#citation860
#index376
#arnetid378

#*Memory Systems.
#@Doug Burger,James R. Goodman,Gurindar S. Sohi
#year1997
#confThe Computer Science and Engineering Handbook
#citation6
#index377
#arnetid379

#*Type Systems.
#@Luca Cardelli
#year1997
#confThe Computer Science and Engineering Handbook
#citation348
#index378
#arnetid380

#*Computational Fluid Dynamics.
#@David A. Caughey
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index379
#arnetid381

#*Rules in Data-Based Systems.
#@Stefano Ceri,Raghu Ramakrishnan
#year1997
#confThe Computer Science and Engineering Handbook
#citation25
#index380
#arnetid382

#*Combinatorial Optimization.
#@Vijay Chandru,M. R. Rao
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index381
#arnetid383

#*Distributed and Multiprocessor Scheduling.
#@Steve J. Chapin
#year1997
#confThe Computer Science and Engineering Handbook
#citation27
#index382
#arnetid384
#%1127683
#%1075516

#*Computational Reacting Flow.
#@Paquale Cinnella,Carey F. Cox
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index383
#arnetid385

#*Logic Programming and Constraint Logic Programming.
#@Jacques Cohen
#year1997
#confThe Computer Science and Engineering Handbook
#citation7
#index384
#arnetid386
#%951441
#%770728
#%773455
#%833067

#*Pattern Matching and Text Compression Algorithms.
#@Maxime Crochemore,Thierry Lecroq
#year1997
#confThe Computer Science and Engineering Handbook
#citation45
#index385
#arnetid387
#%688
#%2020
#%2485
#%2373
#%3772

#*Process and Device Scheduling.
#@Robert D. Cupper
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index386
#arnetid388

#*Explanation-Based Learning.
#@Gerald DeJong
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index387
#arnetid389

#*Planning and Scheduling.
#@Thomas Dean,Subbarao Kambhampati
#year1997
#confThe Computer Science and Engineering Handbook
#citation17
#index388
#arnetid390

#*Traditional Software Design.
#@Steven A. Demurjian
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index389
#arnetid391

#*Virtual Memory.
#@Peter J. Denning
#year1997
#confThe Computer Science and Engineering Handbook
#citation519
#index390
#arnetid392
#%1117320
#!Virtual memory is the simulation of a storage space so large that programmers do not need to reprogram or recompile their works when the capacity of a local memory or the configuration of a network changes. The name, borrowed from optics, recalls the virtual images formed by mirrors and lenses--images that are not there but behave as if they are. The designers of the Atlas Computer at the University of Manchester invented virtual memory in the 1950s to eliminate a looming programming problem: planning and scheduling data transfers between main and secondary memory and recompiling programs for each change of size of main memory. Virtual memory is even more useful in the computers of the 1990s, which have more things to hide-on-chip caches, separate RAM chips, local disk storage, network file servers (q.v.), large numbers of separately compiled program modules, other computers on the local bus or local network, or the Internet. The story of virtual memory from then to now is a story about machines helping programmers solve problems in storage allocation, protection of information, sharing and reuse of objects, and linking of program components. Virtual memory, common in all computers and operating systems from the smallest microprocessor to the largest supercomputer, is now invading the Internet.

#*Algebraic Algorithms.
#@Angel Díaz,Erich Kaltofen,Victor Y. Pan
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index391
#arnetid393

#*Distributed File Systems and Distributed Memory.
#@Thomas W. Doeppner Jr.
#year1997
#confThe Computer Science and Engineering Handbook
#citation3
#index392
#arnetid394
#%613052
#%543627
#%1081808

#*Real-Time and Embedded Systems.
#@John A. Stankovic
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index393
#arnetid395
#%808011
#%1071725

#*Output Devices and Techniques.
#@Colin Ware
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index394
#arnetid396

#*Interactive Techniques.
#@Jürgen Ziegler
#year1997
#confThe Computer Science and Engineering Handbook
#citation15
#index395
#arnetid397
#%912335
#%774713

#*Advanced Geometric Modeling.
#@David S. Ebert
#year1997
#confThe Computer Science and Engineering Handbook
#citation14
#index396
#arnetid398

#*Digital Logic.
#@James Feldman
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index397
#arnetid399

#*Malicious Software and Hacking.
#@David Ferbrache,Stuart Mort
#year1997
#confThe Computer Science and Engineering Handbook
#citation2
#index398
#arnetid400

#*What Is an Operating System?
#@Raphael A. Finkel
#year1997
#confThe Computer Science and Engineering Handbook
#citation8
#index399
#arnetid401

#*Data Structures.
#@Roberto Tamassia,Bryan Cantrill
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index400
#arnetid402

#*Mainstream Rendering Techniques.
#@Alan Watt
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index401
#arnetid403

#*Qualitative Reasoning.
#@Kenneth D. Forbus
#year1997
#confThe Computer Science and Engineering Handbook
#citation131
#index402
#arnetid404

#*Genetic Algorithms.
#@Stephanie Forrest
#year1997
#confThe Computer Science and Engineering Handbook
#citation575
#index403
#arnetid405
#%1009362

#*Concurrency Control and Recovery.
#@Michael J. Franklin
#year1997
#confThe Computer Science and Engineering Handbook
#citation11
#index404
#arnetid406

#*Verification and Validation.
#@John D. Gannon
#year1997
#confThe Computer Science and Engineering Handbook
#citation6
#index405
#arnetid407

#*Software Qualities and Principles.
#@Carlo Ghezzi,Mehdi Jazayeri,Dino Mandrioli
#year1997
#confThe Computer Science and Engineering Handbook
#citation10
#index406
#arnetid408

#*Functional Programming Languages.
#@Benjamin Goldberg
#year1997
#confThe Computer Science and Engineering Handbook
#citation12
#index407
#arnetid409
#%832651

#*The Organizational Context of Development and Use.
#@Jonathan Grudin
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index408
#arnetid410
#%806594

#*The Object-Oriented Language Paradigm.
#@Stuart Hirshfield,Raimund K. Ege
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index409
#arnetid411

#*Overview of Three-Dimensional Graphics.
#@Donald H. House
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index410
#arnetid412

#*International User-Interface Standardization.
#@Wolfgang Dzida
#year1997
#confThe Computer Science and Engineering Handbook
#citation7
#index411
#arnetid413

#*Busses.
#@Windsor W. Hsu,Jih-Kwon Peir
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index412
#arnetid414

#*Parallel Architectures.
#@Michael J. Flynn,Kevin W. Rudd
#year1997
#confThe Computer Science and Engineering Handbook
#citation58
#index413
#arnetid415
#%116

#*Interactive Software Technology.
#@Peter Wegner
#year1997
#confThe Computer Science and Engineering Handbook
#citation35
#index414
#arnetid416

#*Computer Vision.
#@Daniel P. Huttenlocher
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index415
#arnetid417

#*Query Optimization.
#@Yannis E. Ioannidis
#year1997
#confThe Computer Science and Engineering Handbook
#citation150
#index416
#arnetid418
#%598922
#%598917
#%832669
#%1196257
#%832823
#%599551
#%599752

#*Input Devices and Techniques.
#@Robert J. K. Jacob
#year1997
#confThe Computer Science and Engineering Handbook
#citation10
#index417
#arnetid419

#*Database Security and Privacy.
#@Sushil Jajodia
#year1997
#confThe Computer Science and Engineering Handbook
#citation40
#index418
#arnetid420
#%938279
#%832194
#%95
#%133

#*Formal Models and Computability.
#@Tao Jiang,Ming Li,Bala Ravikumar
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index419
#arnetid421

#*The Imperative Language Paradigm.
#@Michael J. Jipping,Kim B. Bruce
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index420
#arnetid422

#*Ethical Issues for Computer Scientists and Engineers.
#@Deborah G. Johnson,Keith W. Miller
#year1997
#confThe Computer Science and Engineering Handbook
#citation9
#index421
#arnetid423

#*Neural Networks.
#@Michael I. Jordan,Christopher M. Bishop
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index422
#arnetid424
#!We present an overview of current research on artificial neural networks, emphasizing a statistical perspective. We view neural networks as parameterized graphs that make probabilistic assumptions about data, and view learning algorithms as methods for finding parameter values that look probable in the light of the data. We discuss basic issues in representation and learning, and treat some of the practical issues that arise in fitting networks to data. We also discuss links between neural networks and the general formalism of graphical models.

#*Digital Computer Architecture.
#@David R. Kaeli
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index423
#arnetid425

#*Computational Ocean Modeling.
#@Lakshmi Kantha,Steve Piacsek
#year1997
#confThe Computer Science and Engineering Handbook
#citation11
#index424
#arnetid426

#*Volume Visualization.
#@Arie E. Kaufman
#year1997
#confThe Computer Science and Engineering Handbook
#citation453
#index425
#arnetid427
#%806930
#%1119327
#%1133850

#*Graph and Network Algorithms.
#@Samir Khuller,Balaji Raghavachari
#year1997
#confThe Computer Science and Engineering Handbook
#citation11
#index426
#arnetid428
#%2020
#%2614

#*Task Analysis and the Design of Functionality.
#@David E. Kieras
#year1997
#confThe Computer Science and Engineering Handbook
#citation45
#index427
#arnetid429

#*Computational Biology.
#@David T. Kingsbury
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index428
#arnetid430

#*Search.
#@Danny Kopec,T. Anthony Marsland
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index429
#arnetid431

#*Case Study in Algorithms: VLSI Layout.
#@Andrea S. LaPaugh
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index430
#arnetid432

#*Protection (Security) Models and Policy.
#@Carl E. Landwehr
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index431
#arnetid433

#*Computational Geometry.
#@D. T. Lee
#year1997
#confThe Computer Science and Engineering Handbook
#citation17
#index432
#arnetid434
#%3480
#%724

#*Robotics.
#@Frank L. Lewis,M. Fitzgerald,Kai Liu
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index433
#arnetid435

#*Compilers and Interpreters.
#@Kenneth C. Louden
#year1997
#confThe Computer Science and Engineering Handbook
#citation1
#index434
#arnetid436

#*Complexity Theory.
#@Michael C. Loui
#year1997
#confThe Computer Science and Engineering Handbook
#citation2
#index435
#arnetid437

#*Logic-Based Deductive Reasoning.
#@James J. Lu,Erik Rosenthal
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index436
#arnetid438

#*Computer Animation.
#@Nadia Magnenat-Thalmann,Daniel Thalmann
#year1997
#confThe Computer Science and Engineering Handbook
#citation182
#index437
#arnetid439

#*Secondary Storage and File Systems.
#@Marshall K. McKusick
#year1997
#confThe Computer Science and Engineering Handbook
#citation3
#index438
#arnetid440

#*The SQL Language: A Case Study.
#@Jim Melton
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index439
#arnetid441

#*Randomized Algorithms.
#@Rajeev Motwani,Prabhakar Raghavan
#year1997
#confThe Computer Science and Engineering Handbook
#citation3631
#index440
#arnetid442

#*Overview of Distributed Operating Systems.
#@Sape J. Mullender
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index441
#arnetid443

#*Interface Software Technology.
#@Brad A. Myers
#year1997
#confThe Computer Science and Engineering Handbook
#citation1
#index442
#arnetid444

#*Security and Privacy Issues in Computer and Communication Systems.
#@Peter G. Neumann
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index443
#arnetid445

#*Computational Structural Mechanics.
#@Ahmed K. Noor
#year1997
#confThe Computer Science and Engineering Handbook
#citation1
#index444
#arnetid446

#*Distributed and Parallel Database Systems.
#@M. Tamer Özsu,Patrick Valduriez
#year1997
#confThe Computer Science and Engineering Handbook
#citation82
#index445
#arnetid447
#%2319
#%17459
#%2612
#%856209

#*Routing Protocols.
#@Radia J. Perlman
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index446
#arnetid448

#*Development Strategies and Project Management.
#@Roger S. Pressman
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index447
#arnetid449

#*Internetworking.
#@Brian K. Reid,Stephen Stuart
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index448
#arnetid450

#*Software Tools and Environments.
#@Steven P. Reiss
#year1997
#confThe Computer Science and Engineering Handbook
#citation25
#index449
#arnetid451
#%578678
#%2617

#*Geometric Primitives.
#@Alyn P. Rockwood
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index450
#arnetid452

#*Access Methods.
#@Betty Salzberg
#year1997
#confThe Computer Science and Engineering Handbook
#citation13
#index451
#arnetid453
#%890367
#%642506
#%599182
#%2618

#*Testing: Principles and Practice.
#@Stephen R. Schach
#year1997
#confThe Computer Science and Engineering Handbook
#citation20
#index452
#arnetid454
#%101057
#%996537
#%1071153

#*Online Support Systems: Tutorials, Documentation, and Help.
#@Stuart A. Selber,Johndan Johnson-Eilola,Brad Mehlenbacher
#year1997
#confThe Computer Science and Engineering Handbook
#citation17
#index453
#arnetid455

#*Computational Electromagnetics.
#@Joseph S. Shang
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index454
#arnetid456

#*Scientific Visualization.
#@William R. Sherman,Alan B. Craig,M. Pauline Baker,Colleen Bushell
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index455
#arnetid457

#*Data Models.
#@Abraham Silberschatz,Henry F. Korth,S. Sudarshan
#year1997
#confThe Computer Science and Engineering Handbook
#citation20
#index456
#arnetid458
#%493

#*Network Organization and Topologies.
#@William Stallings
#year1997
#confThe Computer Science and Engineering Handbook
#citation1
#index457
#arnetid459

#*Computer Science and Engineering: The Discipline and Its Impact.
#@Allen B. Tucker,Peter Wegner
#year1997
#confThe Computer Science and Engineering Handbook
#citation7
#index458
#arnetid460

#*Process Synchronization and Interprocess Communications.
#@Craig E. Wills
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index459
#arnetid461

#*Usability Engineering.
#@Jakob Nielsen
#year1997
#confThe Computer Science and Engineering Handbook
#citation216
#index460
#arnetid462
#!:Written by the author of the best-selling HyperText & HyperMedia, this book provides an excellent guide to the methods of usability engineering. Special features: emphasizes cost-effective methods that will help developers improve their user interfaces immediately, shows you how to avoid the four most frequently listed reasons for delay in software projects, provides step-by-step information about which methods to use at various stages during the development life cycle, and offers information on the unique issues relating to informational usability. You do not need to have previous knowledge of usability to implement the methods provided, yet all of the latest research is covered.

#*Knowledge-Based Systems for Natural Language Processing.
#@Sergei Nirenburg,Kavi Mahesh
#year1997
#confThe Computer Science and Engineering Handbook
#citation4
#index461
#arnetid463

#*Run Time Environments and Memory Management.
#@Robert E. Noonan,William L. Bynum
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index462
#arnetid464

#*Database Performance Measurement.
#@Patrick E. O'Neil
#year1997
#confThe Computer Science and Engineering Handbook
#citation8
#index463
#arnetid465

#*Graphical Models for Probabilistic and Causal Reasoning.
#@Judea Pearl
#year1997
#confThe Computer Science and Engineering Handbook
#citation55
#index464
#arnetid466

#*Foundational Calculi for Programming Languages.
#@Benjamin C. Pierce
#year1997
#confThe Computer Science and Engineering Handbook
#citation43
#index465
#arnetid467

#*Decision Trees and Instance-Based Classifiers.
#@J. Ross Quinlan
#year1997
#confThe Computer Science and Engineering Handbook
#citation20
#index466
#arnetid468

#*Basic Techniques for Design and Analysis of Algorithms.
#@Edward M. Reingold
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index467
#arnetid469
#%2020
#%832796

#*Text Databases and Information Retrieval.
#@Ellen Riloff,Lee A. Hollaar
#year1997
#confThe Computer Science and Engineering Handbook
#citation42
#index468
#arnetid470
#%769894
#%164

#*The Human Factor in Programming and Software Development.
#@Mary Beth Rossen
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index469
#arnetid471

#*Authentication, Access Controls, and Intrusion Detection.
#@Ravi S. Sandhu,Pierangela Samarati
#year1997
#confThe Computer Science and Engineering Handbook
#citation70
#index470
#arnetid472

#*Programming Language Semantics.
#@David A. Schmidt
#year1997
#confThe Computer Science and Engineering Handbook
#citation26
#index471
#arnetid473
#!Like English, French, and other "natural" languages, a programming language possesses both a syntax (grammatical laws that define the well-formed sentences) and a semantics (rules for giving meaning to programming language is a simple enough "artificial" language that precise definitions can be formulated for its syntax and semantics. The benefits of such precise definitions are: (1) the definitions standardize the programming language, so that implementors and users can agree on how the language bahaves; (2) the definitions can be analyzed for correctness and effciency properties; and (3) they can be used as input to automated prototyping tools like complier generators.

#*Understanding Spoken Language.
#@Stephanie Seneff,Victor Zue
#year1997
#confThe Computer Science and Engineering Handbook
#citation0
#index472
#arnetid474

#*Tuning Database Design for High Performance.
#@Dennis Shasha
#year1997
#confThe Computer Science and Engineering Handbook
#citation1
#index473
#arnetid475

#*Software Support Challenges for Heterogeneous Computing.
#@Howard Jay Siegel,Henry G. Dietz,John K. Antonio
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index474
#arnetid476

#*Software Process Models.
#@Ian Sommerville
#year1997
#confThe Computer Science and Engineering Handbook
#citation35
#index475
#arnetid477
#%447324
#%1071153
#%1129443

#*Geometry-Grid Generation.
#@Bharat K. Soni,Nigel P. Weatherill
#year1997
#confThe Computer Science and Engineering Handbook
#citation4
#index476
#arnetid478

#*High-Speed Computer Arithmetic.
#@Earl E. Swartzlander Jr.
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index477
#arnetid479

#*Sampling, Reconstruction, and Antialiasing.
#@George Wolberg
#year1997
#confThe Computer Science and Engineering Handbook
#citation2
#index478
#arnetid480

#*Multimedia.
#@James L. Alty
#year1997
#confThe Computer Science and Engineering Handbook
#citation-1
#index479
#arnetid481

#*The Industrial Information Technology Handbook
#@Richard Zurawski
#year2005
#confThe Industrial Information Technology Handbook
#citation-1
#index480
#arnetid482

#*Design of Compilers - Techniques of Programming Language Translation
#@Karen A. Lemone
#year1992
#conf
#citation14
#index481
#arnetid483

#*Handbook of Applied Cryptography
#@Alfred Menezes,Paul C. van Oorschot,Scott A. Vanstone
#year1996
#conf
#citation8539
#index482
#arnetid484

#*The Computer Science and Engineering Handbook
#@Allen B. Tucker
#year1997
#conf
#citation62
#index483
#arnetid485

#*The Compiler Design Handbook: Optimizations and Machine Code Generation
#@Y. N. Srikant,Priti Shankar
#year2002
#confThe Compiler Design Handbook
#citation42
#index484
#arnetid486

#*Fundamentals of Computer Algorithms.
#@Ellis Horowitz,Sartaj Sahni
#year1978
#conf
#citation1183
#index485
#arnetid487

#*The Theory of Relational Databases.
#@David Maier
#year1983
#conf
#citation1484
#index486
#arnetid488

#*A Logical Language for Data and Knowledge Bases.
#@Shamim A. Naqvi,Shalom Tsur
#year1989
#conf
#citation433
#index487
#arnetid489

#*The Theory of Database Concurrency Control
#@Christos H. Papadimitriou
#year1986
#conf
#citation398
#index488
#arnetid490

#*Introduction to Compiler Construction
#@Thomas W. Parsons
#year1992
#conf
#citation57
#index489
#arnetid491

#*Data Compression: Methods and Theory.
#@James A. Storer
#year1988
#conf
#citation466
#index490
#arnetid492

#*Principles of Database Systems, 1st Edition
#@Jeffrey D. Ullman
#year1980
#conf
#citation2069
#index491
#arnetid493

#*Principles of Database Systems, 2nd Edition
#@Jeffrey D. Ullman
#year1982
#conf
#citation2069
#index492
#arnetid494

#*Principles of Database and Knowledge-Base Systems, Volume I
#@Jeffrey D. Ullman
#year1988
#conf
#citation4068
#index493
#arnetid495

#*Principles of Database and Knowledge-Base Systems, Volume II
#@Jeffrey D. Ullman
#year1989
#conf
#citation4068
#index494
#arnetid496

#*Algorithmic Studies in Mass Storage Systems.
#@C. K. Wong
#year1983
#conf
#citation17
#index495
#arnetid497

#*An Introduction to Unification-Based Approaches to Grammar
#@Stuart M. Shieber
#year1986
#confCSLI Lecture Notes
#citation1258
#index496
#arnetid498

#*Word Order and Constituent Structure in German
#@Hans Uszkoreit
#year1987
#confCSLI Lecture Notes
#citation237
#index497
#arnetid499

#*Nonmonotonic Reasoning: An Overview
#@Gerhard Brewka,Jürgen Dix,Kurt Konolige
#year1997
#confCSLI Lecture Notes
#citation-1
#index498
#arnetid500

#*Specification Language.
#@Jean-Raymond Abrial,Stephen A. Schuman,Bertrand Meyer
#year1980
#confOn the Construction of Programs
#citation138
#index499
#arnetid501

#*An Introduction to Pascal-Plus.
#@David W. Bustard
#year1980
#confOn the Construction of Programs
#citation1
#index500
#arnetid502

#*Algorithms for Parallel Computers.
#@Maurice Clint,Ronald H. Perrott
#year1980
#confOn the Construction of Programs
#citation0
#index501
#arnetid503

#*Concurrent Pascal - An Appraisal.
#@Derek Coleman
#year1980
#confOn the Construction of Programs
#citation6
#index502
#arnetid504

#*A Model for Communicating Sequential Processes.
#@C. A. R. Hoare
#year1980
#confOn the Construction of Programs
#citation13492
#index503
#arnetid505

#*Modules and Visibility in the Ada Programming Language.
#@Jean Ichbiah,John G. P. Barnes,J. C. Heliard,Bernd Krieg-Brückner,Olivier Roubine,Brian A. Wichmann
#year1980
#confOn the Construction of Programs
#citation1
#index504
#arnetid506

#*Information Systems: Modelling, Sequencing and Transformations.
#@M. A. Jackson
#year1980
#confOn the Construction of Programs
#citation41
#index505
#arnetid507
#%362106
#!Specification and design of an information system conventionally starts from consideration of the system function. This paper argues that consideration may more properly be given first to the system as a model of the reality with which it is concerned, the function being subsequently superimposed on the model. The form of model proposed is a network of sequential processes communicating by serial data streams. Such a model permits a clear representation of change or activity over time, and it also prevents over-specification of sequencing by separating problem-oriented from solution-oriented sequencing constraints. The model, however, cannot be efficiently executed on uniprocessor hardware without transformation. Some relevant kinds of transformation are mentioned, and the derivation, by means of them, of conventional information system configurations from the proposed model.

#*A Structured Operating System.
#@R. M. McKeag
#year1980
#confOn the Construction of Programs
#citation3
#index506
#arnetid508

#*Languages for Parallel Computers.
#@Ronald H. Perrott
#year1980
#confOn the Construction of Programs
#citation1
#index507
#arnetid509

#*Parallel Processing in Ada.
#@Olivier Roubine,J. C. Heliard
#year1980
#confOn the Construction of Programs
#citation10
#index508
#arnetid510

#*A Structured Compiler.
#@Jim Welsh
#year1980
#confOn the Construction of Programs
#citation0
#index509
#arnetid511

#*Compiling with Continuations
#@Andrew W. Appel
#year1992
#conf
#citation971
#index510
#arnetid512
#!This book shows how continuation-passing style is used as an intermediate representation to perform optimizations and program transformations. Continuations can be used to compile most programming languages. The method is illustrated in a compiler for the programming language Standard ML. Prior knowledge of ML, however, is not necessary, as the author carefully explains each concept as it arises. This is the first book to show how concepts from the theory of programming languages can be applied to the production of practical optimizing compilers for modern languages like ML. All the details of compiling are covered, including the interface to a runtime system and garbage collector.

#*Modern Compiler Implementation in Java: Basic Techniques
#@Andrew W. Appel
#year1997
#conf
#citation-1
#index511
#arnetid513
#!:This textbook describes all phases of a modern compiler. It includes good coverage of current techniques in code generation and register allocation, as well as functional and object-oriented languages, that is missing from most books. In a concise way, the author describes the most accepted and successful techniques, rather than giving an exhaustive catalog of every possible variant. Detailed descriptions of the interfaces between modules of a compiler are illustrated with actual Java classes. A unique feature of the book is a well designed compiler implementation project in Java, including front-end and high-tech back-end phases, giving a practical example of Java programming for students which will also interest computer professionals.

#*Modern Compiler Implementation in C: Basic Techniques
#@Andrew W. Appel
#year1997
#conf
#citation-1
#index512
#arnetid514
#!:This textbook describes all phases of a modern compiler. It includes good coverage of current techniques in code generation and register allocation, as well as functional and object-oriented languages, that is missing from most books. In a concise way, the author describes the most accepted and successful techniques, rather than giving an exhaustive catalog of every possible variant. Detailed descriptions of the interfaces between modules of a compiler are illustrated with actual C header files. A unique feature of the book is a well designed compiler implementation project in C, including front-end and high-tech back-end phases, useful for undergraduate and graduate students as well as computer professionals needing a reference on compiler implementation.

#*Modern Compiler Implementation in ML: Basic Techniques
#@Andrew W. Appel
#year1997
#conf
#citation-1
#index513
#arnetid515
#!:This textbook describes all phases of a modern compiler. It includes good coverage of current techniques in code generation and register allocation, as well as functional and object-oriented languages, that is missing from most books. In a concise way, the author describes the most accepted and successful techniques, rather than giving an exhaustive catalog of every possible variant. Detailed descriptions of the interfaces between modules of a compiler are illustrated with actual ML signatures. A unique feature of the book is a well designed compiler implementation project in ML, including front-end and high-tech back-end phases, useful for undergraduate and graduate students as well as computer professionals needing a reference on compiler implementation.

#*Modern Compiler Implementation in Java
#@Andrew W. Appel
#year1998
#conf
#citation592
#index514
#arnetid516

#*Modern Compiler Implementation in C
#@Andrew W. Appel
#year1998
#conf
#citation506
#index515
#arnetid517

#*Modern Compiler Implementation in ML
#@Andrew W. Appel
#year1998
#conf
#citation506
#index516
#arnetid518

#*Modern Compiler Implementation in Java, 2nd edition.
#@Andrew W. Appel
#year2002
#conf
#citation-1
#index517
#arnetid519

#*An Introduction to Mathematical Taxonomy
#@G. Dunn,B. Everitt
#year1982
#conf
#citation318
#index518
#arnetid520

#*Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids
#@Richard Durbin,Sean R. Eddy,Anders Krogh,Graeme J. Mitchison
#year1998
#conf
#citation-1
#index519
#arnetid521

#*Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology
#@Dan Gusfield
#year1997
#conf
#citation2322
#index520
#arnetid522

#*Introduction to Combinators and Lambda-Calculus.
#@J. Roger Hindley,Jonathan P. Seldin
#year1986
#conf
#citation926
#index521
#arnetid523

#*On the Construction of Programs
#@R. M. McKeag,A. M. Macnaughten
#year1980
#conf
#citation6
#index522
#arnetid524

#*LEDA: A Platform for Combinatorial and Geometric Computing.
#@Kurt Mehlhorn,Stefan Näher
#year1999
#conf
#citation1405
#index523
#arnetid525
#%610121
#%185994
#%2020
#!Combinatorial and geometric computing is a core area of computer science (CS). In fact, most CS curricula contain a course in data structures and algorithms. The area deals with objects such as graphs, sequences, dictionaries, trees, shortest paths, flows, matchings, points, segments, lines, convex hulls, and Voronoi diagrams and forms the basis for application areas such as discrete optimization, scheduling, traffic control, CAD, and graphics. There is no standard library of the data structures and algorithms of combinatorial and geometric computing. This is in sharp contrast to many other areas of computing. There are, for example, packages in statistics (SPSS), numerical analysis (LINPACK, EISPACK), symbolic computation (MAPLE, MATHEMATICA), and linear programming (CPLEX).

#*Randomized Algorithms.
#@Rajeev Motwani,Prabhakar Raghavan
#year1995
#conf
#citation3631
#index524
#arnetid526

#*Numerical Recipes in C, 2nd Edition.
#@William H. Press,Saul A. Teukolsky,William T. Vetterling,Brian P. Flannery
#year1992
#conf
#citation-1
#index525
#arnetid527

#*Data Refinement: Model-oriented Proof Theories and their Comparison
#@Willem P. de Roever,Kai Engelhardt
#year1998
#confCambridge Tracts in Theoretical Computer Science
#citation-1
#index526
#arnetid528

#*Concurrency Verification: Introduction to Compositional and Noncompositional Methods
#@Willem P. de Roever,Frank S. de Boer,Ulrich Hannemann,Jozef Hooman,Yassine Lakhnech,Mannes Poel,Job Zwiers
#year2001
#confCambridge Tracts in Theoretical Computer Science
#citation-1
#index527
#arnetid529

#*Wiki - Planen, Einrichten, Verwalten
#@Christoph Lange
#year2005
#conf
#citation5
#index528
#arnetid530

#*Technologiebewusstes Design von Web-Anwendungen.
#@Gerhard Austaller,Markus Lauff,Fernando Lyardet,Max Mühlhäuser
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation1
#index529
#arnetid531

#*Semantisches Web - Das Netz der Bedeutungen im Netz der Dokumente.
#@Wernher Behrendt
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation0
#index530
#arnetid532

#*Sicherheit von Web-Anwendungen.
#@Cristina Buchholz
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation1
#index531
#arnetid533

#*Betrieb und Wartung von Web-Anwendungen.
#@Arno Ebner,Hannes Werthner
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation2
#index532
#arnetid534

#*Architektur von Web-Anwendungen.
#@Christian Eichinger
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation2
#index533
#arnetid535

#*Entwicklungsprozess von Web-Anwendungen.
#@Gregor Engels,Marc Lohmann,Annika Wagner
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation2
#index534
#arnetid536

#*Implementierungstechnologien für Web-Anwendungen.
#@Martin Gaedke,Martin Nussbaumer,Oliver Jung,Markus Dieckmann
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation1
#index535
#arnetid537

#*Requirements Engineering für Web-Anwendungen.
#@Paul Grünbacher
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation-1
#index536
#arnetid538

#*Usability von Web-Anwendungen.
#@Martin Hitz,Gerhard Leitner
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation0
#index537
#arnetid539

#*Web Engineering - Die Disziplin zur systematischen Entwicklung von Web-Anwendungen.
#@Gerti Kappel,Birgit Pröll,Siegfried Reich,Werner Retschitzegger
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation5
#index538
#arnetid540

#*Performanz von Web-Anwendungen.
#@Gabriele Kotsis
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation0
#index539
#arnetid541

#*Web-Projektmanagement.
#@Herwig Mayr
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation-1
#index540
#arnetid542

#*Modellierung von Web-Anwendungen.
#@Wieland Schwinger,Nora Koch
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation8
#index541
#arnetid543

#*Testen von Web-Anwendungen.
#@Christoph Steindl,Rudolf Ramler,Josef Altmann
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation1
#index542
#arnetid544

#*Semistrukturierte Datenmodelle und XML.
#@Wolfgang Benn,Oliver Langer
#year2003
#confWeb & Datenbanken
#citation6
#index543
#arnetid545

#*Benchmarking von XML-Datenbanksystemen.
#@Timo Böhme,Erhard Rahm
#year2003
#confWeb & Datenbanken
#citation0
#index544
#arnetid546

#*Indexstrukturen für XML.
#@Sven Helmer,Guido Moerkotte
#year2003
#confWeb & Datenbanken
#citation-1
#index545
#arnetid547

#*Web-basiertes Lernen: Eine Übersicht über Stand und Entwicklungen.
#@Peter Jaeschke,Andreas Oberweis,Gottfried Vossen
#year2003
#confWeb & Datenbanken
#citation0
#index546
#arnetid548

#*Architektur von Web-Informationssystemen.
#@Gerti Kappel,Werner Retschitzegger,Birgit Pröll,Rainer Unland,Bahram Vojdani
#year2003
#confWeb & Datenbanken
#citation3
#index547
#arnetid549

#*Web Services.
#@Markus Keidl,Alfons Kemper,Stefan Seltzsam,Konrad Stocker
#year2003
#confWeb & Datenbanken
#citation-1
#index548
#arnetid550

#*Speicherung von XML-Dokumenten.
#@Meike Klettke,Holger Meyer,Werner Retschitzegger,Rainer Unland
#year2003
#confWeb & Datenbanken
#citation0
#index549
#arnetid551

#*Anfragen, Ändern und Transformieren von XML.
#@Georg Lausen,Wolfgang May
#year2003
#confWeb & Datenbanken
#citation-1
#index550
#arnetid552

#*Kommerzielle Systeme zur Speicherung, Verwaltung und Anfrage von XML-Dokumenten.
#@Holger Meyer,Meike Klettke
#year2003
#confWeb & Datenbanken
#citation0
#index551
#arnetid553

#*Data-Warehouse-Einsatz zur Web-Zugriffsanalyse.
#@Erhard Rahm,Thomas Stöhr
#year2003
#confWeb & Datenbanken
#citation4
#index552
#arnetid554

#*Datenintegration und Mediatoren.
#@Kai-Uwe Sattler,Stefan Conrad,Gunter Saake
#year2003
#confWeb & Datenbanken
#citation1
#index553
#arnetid555

#*XML Schema.
#@Harald Schöning,Walter Waterfeld
#year2003
#confWeb & Datenbanken
#citation-1
#index554
#arnetid556

#*Suchmaschinen.
#@Gunnar Weber,Ilvio Bruder,Andreas Heuer
#year2003
#confWeb & Datenbanken
#citation-1
#index555
#arnetid557

#*Web Caching.
#@Gerhard Weikum
#year2003
#confWeb & Datenbanken
#citation110
#index556
#arnetid558

#*Object-Oriented Reengineering Patterns
#@Serge Demeyer,Stéphane Ducasse,Oscar Nierstrasz
#year2002
#conf
#citation293
#index557
#arnetid559
#!:The documentation is missing or obsolete, and the original developers have departed. Your team has limited understanding of the system, and unit tests are missing for many, if not all, of the components. When you fix a bug in one place, another bug pops up somewhere else in the system. Long rebuild times make any change difficult. All of these are signs of software that is close to the breaking point. Many systems can be upgraded or simply thrown away if they no longer serve their purpose. Legacy software, however, is crucial for operations and needs to be continually available and upgraded. How can you reduce the complexity of a legacy system sufficiently so that it can continue to be used and adapted at acceptable cost? Based on the authors' industrial experiences, this book is a guide on how to reverse engineer legacy systems to understand their problems, and then reengineer those systems to meet new demands. Patterns are used to clarify and explain the process of understanding large code bases, hence transforming them to meet new requirements. The key insight is that the right design and organization of your system is not something that can be evident from the initial requirements alone, but rather as a consequence of understanding how these requirements evolve.

#*Objektorientierte Datenbanksysteme. Ein Praktikum.
#@Andreas Geppert
#year1996
#conf
#citation8
#index558
#arnetid560

#*Digitale Bibliotheken - Informatik-Lösungen für globale Wissensmärkte
#@Albert Endres,Dieter W. Fellner
#year2000
#conf
#citation11
#index559
#arnetid561

#*Objektrelationale und objektorientierte Datenbankkonzepts und -systeme
#@Andreas Geppert
#year2002
#conf
#citation2
#index560
#arnetid562

#*Mobile Datenbanken und Informationssysteme: Konzepte und Techniken
#@Hagen Höpfner,Can Türker,Birgitta König-Ries
#year2005
#conf
#citation-1
#index561
#arnetid563

#*Web Engineering: Systematische Entwicklung von Web-Anwendungen
#@Gerti Kappel,Birgit Proll,Siegfried Reich,Werner Retschitzegger
#year2003
#confWeb Engineering: Systematische Entwicklung von Web-Anwendungen
#citation15
#index562
#arnetid564

#*Linux Sicherheit: Security mit Open-Source-Software, Grundlagen und Praxis
#@Tobias Klein
#year2001
#conf
#citation1
#index563
#arnetid565

#*Informationsintegration: Architekturen und Methoden zur Integration verteilter und heterogener Datenquellen.
#@Ulf Leser,Felix Naumann
#year2006
#conf
#citation14
#index564
#arnetid566

#*Systemsoftware: Grundlagen moderner Betriebssysteme
#@Jürgen Nehmer,Peter Sturm
#year1998
#conf
#citation9
#index565
#arnetid567

#*Web & Datenbanken. Konzepte, Architekturen, Anwendungen
#@Erhard Rahm,Gottfried Vossen
#year2003
#conf
#citation2
#index566
#arnetid568

#*Datenbanken & Java - JDBC, SQLJ und ODMG
#@Gunter Saake,Kai-Uwe Sattler
#year2000
#conf
#citation-1
#index567
#arnetid569

#*HTML & XHTML - die Sprachen des Web, Lehrgang und Referenz, 5. Auflage
#@Robert Tolksdorf
#year2002
#conf
#citation0
#index568
#arnetid570

#*SQL:1999 & SQL:2003 - Objektrelationales SQL, SQLJ & SQL/XML
#@Can Türker
#year2003
#conf
#citation8
#index569
#arnetid571

#*Wissensbasierte Textverarbeitung: Schriftsatz und Typographie - Möglichkeiten einer intelligenteren Textverarbeitung
#@Frank Oemig,Armin B. Cremers,Gerhard Heyer
#year1991
#conf
#citation-1
#index570
#arnetid572

#*Anfrageverarbeitung in Komplexobjekt-Datenbanksystemen
#@Harald Schöning
#year1993
#conf
#citation7
#index571
#arnetid573

#*A Formal Model for Lazy Implementations of a Prolog-Compatible Functional Language.
#@Marco Bellia,Enrico Dameri,Pierpaolo Degano,Giorgio Levi,Maurizio Martelli
#year1984
#confImplementations of Prolog
#citation5
#index572
#arnetid574

#*Garbage Collection in Prolog Interpreters.
#@Maurice Bruynooghe
#year1984
#confImplementations of Prolog
#citation18
#index573
#arnetid575

#*Deduction Revision by Intelligent Backtracking.
#@Maurice Bruynooghe,Luís Moniz Pereira
#year1984
#confImplementations of Prolog
#citation125
#index574
#arnetid576

#*Should Prolog be List or Record Oriented.
#@John A. Campbell,Steve Hardy
#year1984
#confImplementations of Prolog
#citation1
#index575
#arnetid577

#*Finding Backtrack Points for Intelligent Backtracking.
#@Philip T. Cox
#year1984
#confImplementations of Prolog
#citation-1
#index576
#arnetid578

#*POLER - Implementation of a POP-2-based PLANNER.
#@Julian Davies
#year1984
#confImplementations of Prolog
#citation2
#index577
#arnetid579

#*A Note on Micro-Planer.
#@Mark Dowson
#year1984
#confImplementations of Prolog
#citation-1
#index578
#arnetid580

#*An Interpreting Algorithm for Prolog Programs.
#@Maarten H. van Emden
#year1984
#confImplementations of Prolog
#citation32
#index579
#arnetid581

#*What the naive user wants from Prolog.
#@Richard Ennals,Jonathan Briggs,Derek R. Brough
#year1984
#confImplementations of Prolog
#citation2
#index580
#arnetid582

#*A Prolog Interpreter Working with Infinite Terms.
#@Miguel Filgueiras
#year1984
#confImplementations of Prolog
#citation19
#index581
#arnetid583

#*Exeter Prolog - some thoughts on Prolog design by a LISP user.
#@Rabbe Fogelholm
#year1984
#confImplementations of Prolog
#citation0
#index582
#arnetid584

#*The Control of Searching and Backtracking in String Pattern Matching.
#@Ralph E. Griswold
#year1984
#confImplementations of Prolog
#citation2
#index583
#arnetid585

#*Efficient Implementation of Unification of Cyclic Structures.
#@Seif Haridi,Dan Sahlin
#year1984
#confImplementations of Prolog
#citation17
#index584
#arnetid586

#*How to Implement Prolog on a LISP Machine.
#@Kenneth M. Kahn,Mats Carlsson
#year1984
#confImplementations of Prolog
#citation24
#index585
#arnetid587

#*The 'Marseille Interpreter' - a Personal Perspective.
#@Feliks Kluzniak
#year1984
#confImplementations of Prolog
#citation2
#index586
#arnetid588

#*Prolog - a Panacea?
#@Feliks Kluzniak,Stan Szpakowicz
#year1984
#confImplementations of Prolog
#citation1
#index587
#arnetid589

#*Integrating Prolog in the POPLOG Environment.
#@Chris Mellish,Steve Hardy
#year1984
#confImplementations of Prolog
#citation-1
#index588
#arnetid590
#!Although Prolog undoubtedly has its good points, there are some tasks (such as writing a screen editor or network interface controller) for which it is not the language of choice. The most natural computational concepts [2] for these tasks are hard to reconcile with Prolog's declarative nature. Just as there is a need for even the most committed Prolog programmer to use "conventional" languages for some tasks, so too is there a need for "logic" oriented components in conventional applications programs, such as CAD systems [7] and relational databases [5]. At Sussex, the problems of integrating logic with procedural programming are being addressed by two projects. One of these [4] involves a distributed ring of processors communicating by message passing. The other project is the POPLOG system, a mixed language AI programming environment which runs on conventional hardware. This paper describes the way in which we have integrated Prolog into POPLOG.

#*A Proposal for Distributed Programming in Logic.
#@Luís Monteiro
#year1984
#confImplementations of Prolog
#citation20
#index589
#arnetid591

#*Associative Evaluation of Prolog Programs.
#@Katsuhiko Nakamura
#year1984
#confImplementations of Prolog
#citation3
#index590
#arnetid592

#*The World's Shortest Prolog Interpreter?
#@Martin Nilsson
#year1984
#confImplementations of Prolog
#citation10
#index591
#arnetid593

#*Formal Vienna-Definition-Method Models of Prolog.
#@Jørgen Fischer Nilsson
#year1984
#confImplementations of Prolog
#citation8
#index592
#arnetid594

#*Logic Control with Logic.
#@Luís Moniz Pereira
#year1984
#confImplementations of Prolog
#citation-1
#index593
#arnetid595

#*Epilog: A Language for Extended Programming in Logic.
#@António Porto
#year1984
#confImplementations of Prolog
#citation25
#index594
#arnetid596

#*W-Grammars for Logic Programming.
#@Stephen John Turner
#year1984
#confImplementations of Prolog
#citation9
#index595
#arnetid597

#*The Taming of the Sleuth.
#@Mark Warner
#year1984
#confImplementations of Prolog
#citation0
#index596
#arnetid598

#*EPILOG: Re-interpreting and Extending Prolog for a Multiprocessor Environment.
#@Michael J. Wise
#year1984
#confImplementations of Prolog
#citation6
#index597
#arnetid599

#*System Simulation and Cooperative Problem-solving on a Prolog Basis.
#@Ivan Futó,János Szeredi
#year1984
#confImplementations of Prolog
#citation10
#index598
#arnetid600

#*On Prolog DBMS Connections: A Step Forward from Educe.
#@Jorge B. Bocca,Philip J. Pearson
#year1988
#confProlog and Databases
#citation8
#index599
#arnetid601

#*Grid Files for Efficient Prolog Clause Access.
#@Michael Freeston
#year1988
#confProlog and Databases
#citation11
#index600
#arnetid602

#*A Source-to-Source Meta-Translation System for Database Query Languages - Implementation in Prolog.
#@D. I. Howells,N. J. Fiddian,W. A. Gray
#year1988
#confProlog and Databases
#citation9
#index601
#arnetid603

#*A Flexible Prolog-Based Lexical Database System.
#@William G. Imlah,Bart Demoen
#year1988
#confProlog and Databases
#citation0
#index602
#arnetid604

#*A Generalized Interface Between Prolog and Relational Databases.
#@T. Irving
#year1988
#confProlog and Databases
#citation9
#index603
#arnetid605

#*A Prolog-Relational Database Interface.
#@Robert J. Lucas,G. A. Le Vine
#year1988
#confProlog and Databases
#citation6
#index604
#arnetid606

#*TREQL (Thornton Research Easy Query Language): An Intelligent Front-End to a Relational Database.
#@K. Lunn,I. G. Archibald
#year1988
#confProlog and Databases
#citation2
#index605
#arnetid607

#*Modular Commitment in Persistent Prolog.
#@David S. Moffat
#year1988
#confProlog and Databases
#citation5
#index606
#arnetid608

#*Implementing Query Languages in Prolog.
#@F. Mouta,M. Howard Williams,J. C. Neves
#year1988
#confProlog and Databases
#citation-1
#index607
#arnetid609

#*On Transaction Processing, Knowledge-Based Systems and Databases.
#@T. Nomura,S. Lunn
#year1988
#confProlog and Databases
#citation1
#index608
#arnetid610

#*An Object-Oriented Database for Storage and Analysis of Protein Structure Data.
#@Norman W. Paton,Peter M. D. Gray
#year1988
#confProlog and Databases
#citation6
#index609
#arnetid611

#*The NU-Prolog Deductive Database System.
#@Kotagiri Ramamohanarao,John Shepherd,Isaac Balbin,Graeme S. Port,Lee Naish,James A. Thom,Justin Zobel,Philip W. Dart
#year1988
#confProlog and Databases
#citation-1
#index610
#arnetid612

#*Software Configuration Management Using Prolog.
#@Paul Singleton,C. D. Farris
#year1988
#confProlog and Databases
#citation3
#index611
#arnetid613

#*Guarded Default Databases: A Prototype Implementation.
#@Carol Small
#year1988
#confProlog and Databases
#citation0
#index612
#arnetid614

#*An Interface from Prolog to a Binary Relational Database.
#@S. Todd
#year1988
#confProlog and Databases
#citation0
#index613
#arnetid615

#*A Data-Driven Execution Mechanism for Transaction-Oriented Information Systems.
#@Raf Venken,D. Donner
#year1988
#confProlog and Databases
#citation0
#index614
#arnetid616

#*The Interaction Between BIM-Prolog and Relational Databases.
#@Raf Venken,Anne Mulkers
#year1988
#confProlog and Databases
#citation4
#index615
#arnetid617

#*Recursive Query Processing: Fundamental Algorithms and the DedGin System.
#@Laurent Vieille
#year1988
#confProlog and Databases
#citation5
#index616
#arnetid618

#*The TRACE Club Expert System and Databases.
#@G. Williams
#year1988
#confProlog and Databases
#citation-1
#index617
#arnetid619

#*Benchmarking Prolog for Database Applications.
#@M. Howard Williams,P. A. Massey,Jim A. Crammond
#year1988
#confProlog and Databases
#citation6
#index618
#arnetid620

#*Abstract Interpretation of Declarative Languages
#@Samson Abramsky,Chris Hankin
#year1987
#conf
#citation324
#index619
#arnetid621

#*Statistical and Scientific Databases
#@Zbigniew Michalewicz
#year1992
#conf
#citation74
#index620
#arnetid622

#*Machine Learning, Neural and Statistical Classification
#@Donald Michie,David J. Spiegelhalter,C. C. Taylor
#year1994
#conf
#citation1903
#index621
#arnetid623

#*Pascal Implementation: The P4 Compiler and Interpreter
#@Steven Pemberton,Martin Daniels
#year1982
#conf
#citation-1
#index622
#arnetid624

#*Classical Type Theory.
#@Peter B. Andrews
#year2001
#confHandbook of Automated Reasoning
#citation30
#index623
#arnetid625
#%640
#%71230
#%647
#%71097
#%71550
#%71568
#%71210
#%71208
#%71835
#%628
#%71143
#%949513
#%954577
#%624639
#%792
#%629364
#%954790
#%624771
#%629409
#%2470
#%71704
#%71790
#%951322

#*Unification Theory.
#@Franz Baader,Wayne Snyder
#year2001
#confHandbook of Automated Reasoning
#citation456
#index624
#arnetid626

#*Normal Form Transformations.
#@Matthias Baaz,Uwe Egly,Alexander Leitsch
#year2001
#confHandbook of Automated Reasoning
#citation44
#index625
#arnetid627

#*Automated Deduction for Many-Valued Logics.
#@Matthias Baaz,Christian G. Fermüller,Gernot Salzer
#year2001
#confHandbook of Automated Reasoning
#citation38
#index626
#arnetid628
#%71845
#%126919
#%744246
#%487012
#%624669
#%440664
#%949795
#%994608
#%79284
#%993605
#%71396
#%124528
#%487165
#%1079585
#%984559
#%124705
#%1113284
#%440224
#%576366
#%951441
#%889319
#%1094441
#%71856
#%441354
#%39728
#%994650

#*Resolution Theorem Proving.
#@Leo Bachmair,Harald Ganzinger
#year2001
#confHandbook of Automated Reasoning
#citation252
#index627
#arnetid629

#*Proof-Assistants Using Dependent Type Systems.
#@Henk Barendregt,Herman Geuvers
#year2001
#confHandbook of Automated Reasoning
#citation80
#index628
#arnetid630
#%647
#%631811
#%631813
#%993582
#%887506
#%628850
#%631899
#%484768
#%628785
#%484960
#%1093832
#%507696
#%628853
#%994423
#%628872
#%889394
#%483974
#%888400
#%631832

#*Solving Numerical Constraints.
#@Alexander Bockmayr,Volker Weispfenning
#year2001
#confHandbook of Automated Reasoning
#citation34
#index629
#arnetid631

#*The Automation of Proof by Mathematical Induction.
#@Alan Bundy
#year2001
#confHandbook of Automated Reasoning
#citation92
#index630
#arnetid632

#*Reasoning in Expressive Description Logics.
#@Diego Calvanese,Giuseppe De Giacomo,Maurizio Lenzerini,Daniele Nardi
#year2001
#confHandbook of Automated Reasoning
#citation110
#index631
#arnetid633
#%646
#%484737
#%624659
#%1118164
#%1112456
#%12124
#%160072
#%544887
#%12172
#%12171
#%544893
#%299597
#%950010
#%12913
#%469096
#%887949
#%479649
#%744783
#%1091585
#%950583
#%675787
#%703
#%643112
#%745572
#%951370
#%486406
#%745620
#%33896
#%480064
#%745826
#%479976
#%889528
#%304145
#%486471
#%269121
#%623206
#%973052

#*Automated Reasoning in Geometry.
#@Shang-Ching Chou,Xiao-Shan Gao
#year2001
#confHandbook of Automated Reasoning
#citation15
#index632
#arnetid634

#*Model Checking.
#@Edmund M. Clarke,Bernd-Holger Schlingloff
#year2001
#confHandbook of Automated Reasoning
#citation6873
#index633
#arnetid635

#*Inductionless Induction.
#@Hubert Comon
#year2001
#confHandbook of Automated Reasoning
#citation70
#index634
#arnetid636

#*The Early History of Automated Deduction.
#@Martin Davis
#year2001
#confHandbook of Automated Reasoning
#citation25
#index635
#arnetid637

#*The Inverse Method.
#@Anatoli Degtyarev,Andrei Voronkov
#year2001
#confHandbook of Automated Reasoning
#citation30
#index636
#arnetid638

#*Equality Reasoning in Sequent-Based Calculi.
#@Anatoli Degtyarev,Andrei Voronkov
#year2001
#confHandbook of Automated Reasoning
#citation34
#index637
#arnetid639

#*Rewriting.
#@Nachum Dershowitz,David A. Plaisted
#year2001
#confHandbook of Automated Reasoning
#citation152
#index638
#arnetid640

#*Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations.
#@Jürgen Dix,Ulrich Furbach,Ilkka Niemelä
#year2001
#confHandbook of Automated Reasoning
#citation56
#index639
#arnetid641
#%71552
#%71144
#%477822
#%71667
#%71146
#%2246
#%468992
#%487613
#%744251
#%624685
#%327599
#%469019
#%744328
#%949795
#%487634
#%887257
#%1089373
#%544738
#%624719
#%624721
#%519116
#%487662
#%954555
#%1089645
#%744448
#%519117
#%624686
#%487678
#%544881
#%744529
#%3146
#%1112559
#%949988
#%744615
#%174359
#%439860
#%477524
#%816287
#%1090767
#%1118309
#%487629
#%744760
#%744758
#%328070
#%12925
#%888035
#%624748
#%700
#%745178
#%479815
#%745282
#%938690
#%888686
#%951000
#%951002
#%954851
#%479839
#%951091
#%951123
#%485374
#%888982
#%469154
#%882153
#%624823
#%487821
#%954984
#%745716
#%745722
#%487741
#%745786
#%599701
#%487748
#%486751
#%477354
#%71954
#%328702
#%545039
#%545043
#%950388

#*Higher-Order Unification and Matching.
#@Gilles Dowek
#year2001
#confHandbook of Automated Reasoning
#citation69
#index640
#arnetid642
#%623
#%83676
#%628
#%611912
#%993655
#%124399
#%887506
#%950077
#%1090615
#%71334
#%1090625
#%628850
#%628852
#%1014660
#%563380
#%1091025
#%487151
#%71438
#%484768
#%484184
#%71568
#%214080
#%39023
#%563469
#%563474
#%1093373
#%994327
#%71716
#%1093650
#%71728
#%933109
#%628865
#%631772
#%628853
#%484272
#%647
#%484531
#%71813
#%546651
#%83700
#%626682
#%546730
#%71918
#%994619
#%628892
#%252262

#*Resolution Decision Procedures.
#@Christian G. Fermüller,Alexander Leitsch,Ullrich Hustadt,Tanel Tammet
#year2001
#confHandbook of Automated Reasoning
#citation-1
#index641
#arnetid643
#%484703
#%72011
#%646
#%477301
#%469019
#%994608
#%993565
#%631
#%3146
#%71742
#%124459
#%3230
#%487113
#%950795
#%71667
#%71746
#%994435
#%624836
#%994473
#%951441
#%745826
#%951607
#%62010
#%95937

#*Tableaux and Related Methods.
#@Reiner Hähnle
#year2001
#confHandbook of Automated Reasoning
#citation77
#index642
#arnetid644

#*Model Elimination and Connection Tableau Procedures.
#@Reinhold Letz,Gernot Stenz
#year2001
#confHandbook of Automated Reasoning
#citation38
#index643
#arnetid645
#%71217
#%71598
#%71168
#%71175
#%651
#%71960
#%1499758
#%71503
#%71627
#%71146
#%77
#%949513
#%65526
#%624685
#%954647
#%418468
#%624711
#%71901
#%954843
#%951000
#%951002
#%951006
#%487249
#%954893
#%624818
#%994473
#%955001
#%71870
#%157259

#*Paramodulation-Based Theorem Proving.
#@Robert Nieuwenhuis,Albert Rubio
#year2001
#confHandbook of Automated Reasoning
#citation243
#index644
#arnetid646

#*Computing Small Clause Normal Forms.
#@Andreas Nonnengart,Christoph Weidenbach
#year2001
#confHandbook of Automated Reasoning
#citation113
#index645
#arnetid647

#*Encoding Two-Valued Nonclassical Logics in Classical Logic.
#@Hans Jürgen Ohlbach,Andreas Nonnengart,Maarten de Rijke,Dov M. Gabbay
#year2001
#confHandbook of Automated Reasoning
#citation53
#index646
#arnetid648
#%640
#%484703
#%626
#%485071
#%647
#%646
#%623
#%628
#%631
#%71743
#%994328
#%639
#%621910
#%71341
#%641
#%3230
#%484702
#%484737
#%620306
#%484739
#%3299
#%745014
#%625154
#%114327
#%950795
#%643
#%71685
#%71747
#%71753
#%71755
#%954924
#%71757
#%648
#%986988
#%650
#%651

#*Logical Frameworks.
#@Frank Pfenning
#year2001
#confHandbook of Automated Reasoning
#citation154
#index647
#arnetid649
#%640
#%71788
#%623
#%628
#%484531
#%628831
#%887381
#%628842
#%487081
#%628844
#%628850
#%563380
#%180569
#%180570
#%71376
#%71393
#%2469
#%628739
#%1091489
#%950446
#%83689
#%1091735
#%484768
#%126854
#%484769
#%631867
#%485006
#%180520
#%984596
#%546556
#%523728
#%485110
#%1057044
#%71739
#%646
#%628853
#%818584
#%818585
#%70809
#%485078
#%542776
#%71791
#%71820
#%626658
#%189005
#%71842
#%628881
#%71874
#%951563
#%563665

#*Term Indexing.
#@I. V. Ramakrishnan,R. C. Sekar,Andrei Voronkov
#year2001
#confHandbook of Automated Reasoning
#citation70
#index648
#arnetid650
#%72011
#%651
#%71439
#%71964
#%2133
#%626421
#%563282
#%327801
#%949988
#%984276
#%543129
#%546059
#%1123439
#%469164
#%697
#%950493
#%563315
#%563317
#%3299
#%954769
#%950671
#%188881
#%626570
#%219759
#%188861
#%954843
#%620624
#%487233
#%484241
#%954871
#%954877
#%954893
#%951269
#%484275
#%328617
#%328625
#%268885
#%546660
#%269020
#%71924
#%71954
#%72000
#%889647
#%543373
#%955102

#*Preface.
#@John Alan Robinson,Andrei Voronkov
#year2001
#confHandbook of Automated Reasoning
#citation-1
#index649
#arnetid651

#*Connections in Nonclassical Logics.
#@Arild Waaler
#year2001
#confHandbook of Automated Reasoning
#citation22
#index650
#arnetid652
#%71168
#%646
#%38351
#%71674
#%71753
#%949513
#%624667
#%624699
#%477304
#%949736
#%624798
#%624662
#%881693
#%624724
#%71605
#%71612
#%624776
#%888581
#%643
#%954866
#%624830
#%624829
#%624831
#%71820
#%951441
#%71881
#%624885

#*Combining Superposition, Sorts and Splitting.
#@Christoph Weidenbach
#year2001
#confHandbook of Automated Reasoning
#citation2
#index651
#arnetid653
#%640
#%71748
#%484533
#%477301
#%71195
#%993714
#%950185
#%71437
#%744968
#%950493
#%563391
#%950795
#%71685
#%954877
#%1498198
#%648
#%951441
#%1094441
#%933922
#%71924
#%951655
#%72000
#%955034
#%71975
#%951844

#*Computer-Aided Database Design: the DATAID approach.
#@Antonio Albano,Valeria De Antonellis,Antonio Di Leva
#year1985
#confComputer-Aided Database Design: the DATAID approach
#citation3
#index652
#arnetid654

#*A Software Engineering Approach to Database Design: The Galileo Project.
#@Antonio Albano,Renzo Orsini
#year1985
#confComputer-Aided Database Design: the DATAID approach
#citation2
#index653
#arnetid655

#*A Tool for Modeling Dynamics in Conceptual Design.
#@Valeria De Antonellis,Bruna Zonta
#year1985
#confComputer-Aided Database Design: the DATAID approach
#citation0
#index654
#arnetid656

#*GINCOD: A Graphical Tool for Conceptual Design of Data Base Applications.
#@Carlo Batini,Enrico Nardelli,Maurizio Talamo,Roberto Tamassia
#year1985
#confComputer-Aided Database Design: the DATAID approach
#citation5
#index655
#arnetid657

#*The Logical Design in the DATAID Project: The EASYMAP System.
#@M. N. Bert,Gianfranco Ciardo,G. Barbara Demo,Antonio Di Leva,Piercarlo Giolito,C. Iacobelli,V. Marrone
#year1985
#confComputer-Aided Database Design: the DATAID approach
#citation-1
#index656
#arnetid658

#*A Workbench for Conceptual Design in Galileo.
#@Maurizio Capaccioli,M. Eugenia Occhiuto
#year1985
#confComputer-Aided Database Design: the DATAID approach
#citation1
#index657
#arnetid659

#*DATAID-D: Methodology for Distributed Database Design.
#@Stefano Ceri,Barbara Pernici
#year1985
#confComputer-Aided Database Design: the DATAID approach
#citation9
#index658
#arnetid660

#*Dynamics in Logical Database Design.
#@G. Barbara Demo,Antonio Di Leva,Piercarlo Giolito
#year1985
#confComputer-Aided Database Design: the DATAID approach
#citation1
#index659
#arnetid661

#*Architecture of a Physical Design Tool for Relational DBMSs.
#@Dario Maio,Claudio Sartori,Maria Rita Scalas
#year1985
#confComputer-Aided Database Design: the DATAID approach
#citation-1
#index660
#arnetid662

#*Important Issues in Database Design Methodologies and Tools.
#@Shamkant B. Navathe
#year1985
#confComputer-Aided Database Design: the DATAID approach
#citation2
#index661
#arnetid663

#*Integrated Tools for Physical Database Design in CODASYL Environment.
#@Salvatore Orlando,Pasquale Rullo,Domenico Saccà,Witold Staniszkis
#year1985
#confComputer-Aided Database Design: the DATAID approach
#citation1
#index662
#arnetid664

#*Concepts, Implementation, and Applications of a Typed Logic Programming Language.
#@Christoph Beierle
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation15
#index663
#arnetid665

#*Combinatorial Problem Solving in Constraint Logic Programming with Cooperating Solvers.
#@Henri Beringer,Bruno De Backer
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation93
#index664
#arnetid666

#*The WAM - Definition and Compiler Correctness.
#@Egon Börger,Dean Rosenzweig
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation127
#index665
#arnetid667

#*Using Constraint Logic Programming for Industrial Scheduling Problems.
#@Silvia Breitinger,Hendrik C. R. Lock
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation7
#index666
#arnetid668

#*Temporal Logic Programming Applied to Image Sequence Evaluation.
#@Christoph Brzoska,Karl Schäfer
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation4
#index667
#arnetid669

#*Goal-Directed Forward Chaining: Tuple-oriented Bottom-up Approach.
#@Wolfram Burgard
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation1
#index668
#arnetid670

#*Logic Program Modules for Interoperable Information Systems.
#@Armin B. Cremers,Thomas Lemke,Mechthild Rohen
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation2
#index669
#arnetid671

#*Robot Control Systems as Contextual Logic Programs.
#@Enrico Denti,Antonio Natali,Andrea Omicini,Francesco Zanichelli
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation7
#index670
#arnetid672

#*Logic Programming - Past or Future?
#@Hervé Gallaire
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation2
#index671
#arnetid673

#*Polymorphic Feature Types.
#@Gregor Meyer
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation2
#index672
#arnetid674

#*Automatic Verification of Parallel Logic Programs: Termination.
#@Lutz Plümer
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation3
#index673
#arnetid675

#*Scheduling and Meta-Scheduling.
#@Jürgen Sauer
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation5
#index674
#arnetid676

#*Efficient Object-Oriented Programming in Prolog.
#@Peter Schachte,Georges Saab
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation6
#index675
#arnetid677

#*A Generic Scheduling Framework developed in Prolog.
#@Leon Sterling,Venkatesh Srinivasan
#year1995
#confLogic Programming: Formal Methods and Practical Applications
#citation1
#index676
#arnetid678

#*Dialogo: An Interactive Environment for Conceptual Design in Galileo.
#@Antonio Albano,Renzo Orsini
#year1983
#confMethodology and Tools for Data Base Design
#citation7
#index677
#arnetid679

#*Requirements Collection and Analysis.
#@Valeria De Antonellis,G. Barbara Demo
#year1983
#confMethodology and Tools for Data Base Design
#citation13
#index678
#arnetid680

#*INCOD-DTE: A System for Interative Conceptual Design of Data, Transactions and Events.
#@Paolo Atzeni,Carlo Batini,Enzo Carboni,Valeria De Antonellis,Maurizio Lenzerini,Fulvio Villanelli,Bruna Zonta
#year1983
#confMethodology and Tools for Data Base Design
#citation1
#index679
#arnetid681

#*Views Integration.
#@Carlo Batini,Maurizio Lenzerini,Marina Moscarini
#year1983
#confMethodology and Tools for Data Base Design
#citation33
#index680
#arnetid682

#*Logical Design in Codasyl and Relational Environment.
#@P. Bertaina,Antonio Di Leva,Piercarlo Giolito
#year1983
#confMethodology and Tools for Data Base Design
#citation18
#index681
#arnetid683

#*A Separability-Based Method for Secondary Index Selection in Physical Database Design.
#@Flavio Bonfatti,Dario Maio,Paolo Tiberio
#year1983
#confMethodology and Tools for Data Base Design
#citation18
#index682
#arnetid684

#*A Set of Integrated Tools for the Conceptual Design of Database Schemas and Transactions.
#@Giampio Bracchi,Stefano Ceri,Giuseppe Pelagatti
#year1983
#confMethodology and Tools for Data Base Design
#citation2
#index683
#arnetid685

#*Views Conceptual Design.
#@U. Bussolati,Stefano Ceri,Valeria De Antonellis,Bruna Zonta
#year1983
#confMethodology and Tools for Data Base Design
#citation18
#index684
#arnetid686

#*Methodology and Tools for Data Base Design in the DATAID Project.
#@Stefano Ceri
#year1983
#confMethodology and Tools for Data Base Design
#citation0
#index685
#arnetid687

#*NLDA: A Natural Language Reasoning System for the Analysis of Data Base Requirements.
#@Marco Colombetti,Giovanni Guida,Marco Somalvico
#year1983
#confMethodology and Tools for Data Base Design
#citation11
#index686
#arnetid688

#*Physical Data Base Design for Codasyl DBMS.
#@Witold Staniszkis,Domenico Saccà,F. Manfredi,A. Mecchia
#year1983
#confMethodology and Tools for Data Base Design
#citation4
#index687
#arnetid689

#*Algorithms for Finding Patterns in Strings.
#@Alfred V. Aho
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation312
#index688
#arnetid690

#*Logic Programming.
#@Krzysztof R. Apt
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation-1
#index689
#arnetid691

#*Functional Programming and Lambda Calculus.
#@Hendrik Pieter Barendregt
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation86
#index690
#arnetid692

#*Context-Free Languages.
#@Jean Berstel,Luc Boasson
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation28
#index691
#arnetid693

#*Machine Models and Simulation.
#@Peter van Emde Boas
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation16
#index692
#arnetid694

#*The Complexity of Finite Functions.
#@Ravi B. Boppana,Michael Sipser
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation305
#index693
#arnetid695

#*Graph Rewriting: An Algebraic and Logic Approach.
#@Bruno Courcelle
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation389
#index694
#arnetid696

#*Recursive Applicative Program Schemes.
#@Bruno Courcelle
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation106
#index695
#arnetid697

#*Methods and Logics for Proving Programs.
#@Patrick Cousot
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation151
#index696
#arnetid698

#*Rewrite Systems.
#@Nachum Dershowitz,Jean-Pierre Jouannaud
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation1732
#index697
#arnetid699

#*Temporal and Modal Logic.
#@E. Allen Emerson
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation2497
#index698
#arnetid700

#*Semantic Domains.
#@Carl A. Gunter,Dana S. Scott
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation295
#index699
#arnetid701

#*A Catalog of Complexity Classes.
#@David S. Johnson
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation547
#index700
#arnetid702

#*Elements of Relational Database Theory.
#@Paris C. Kanellakis
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation227
#index701
#arnetid703
#!The goal of this paper is to provide a systematic and unifying introduction to relational database theory, including some of the recent developments in database logic programming. The first part of the presentation covers the two basic components of the relational data model: its specification component, that is the database scheme with dependencies, and its operational component, that is the relational algebra query language. The choice of basic constructs for specifying the semantically meaningful databases and for querying them is justified through an in-depth investigation of their properties. Some important research themes are reviewed in this context: the analysis of the hypergraph syntax of a database scheme and the extensions of the query language using deduction or universal relation assumptions. The subsequent parts of the presentation are structured around the two fundamental concepts illustrated in the first part, dependencies and queries. The main themes of dependency theory are implication problems and applications to database scheme design. Queries are classified in a variety of ways, with emphasis on the connections between the expressibility of query languages, finite model theory and logic programming. The theory of queries is very much related to research on database logic programs, which are an elegant formalism for the study of the principles of knowledge base systems. The optimization of such programs involves both techniques developed for the relational data model and new methods for analyzing recursive definitions. The exposition closes with a discussion of how relational database theory deals with the problems of complex objects, incomplete information and database updates.

#*Parallel Algorithms for Shared-Memory Machines.
#@Richard M. Karp,Vijaya Ramachandran
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation664
#index702
#arnetid704

#*Logics of Programs.
#@Dexter Kozen,Jerzy Tiuryn
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation322
#index703
#arnetid705
#!None Available

#*Distributed Computing: Models and Methods.
#@Leslie Lamport,Nancy A. Lynch
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation156
#index704
#arnetid706

#*Graph Algorithms.
#@Jan van Leeuwen
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation189
#index705
#arnetid707

#*VLSI Theory.
#@Thomas Lengauer
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation35
#index706
#arnetid708

#*Algorithms in Number Theory.
#@Arjen K. Lenstra,Hendrik W. Lenstra Jr.
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation175
#index707
#arnetid709

#*Kolmogorov Complexity and its Applications.
#@Ming Li,Paul M. B. Vitányi
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation3
#index708
#arnetid710

#*Data Structures.
#@Kurt Mehlhorn,Athanasios K. Tsakalidis
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation74
#index709
#arnetid711

#*Operational and Algebraic Semantics of Concurrent Processes.
#@Robin Milner
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation276
#index710
#arnetid712

#*Type Systems for Programming Languages.
#@John C. Mitchell
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation287
#index711
#arnetid713

#*Denotational Semantics.
#@Peter D. Mosses
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation202
#index712
#arnetid714

#*Finite Automata.
#@Dominique Perrin
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation254
#index713
#arnetid715

#*Communication Networks.
#@Nicholas Pippenger
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation52
#index714
#arnetid716

#*Cryptography.
#@Ronald L. Rivest
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation61
#index715
#arnetid717

#*Formal Language and Power Series.
#@Arto Salomaa
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation0
#index716
#arnetid718

#*Algorithmic Motion Planning in Robotics.
#@Jacob T. Schwartz,Micha Sharir
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation57
#index717
#arnetid719

#*Machine-Independent Complexity Theory.
#@Joel I. Seiferas
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation16
#index718
#arnetid720

#*Algebraic Complexity Theory.
#@Volker Strassen
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation97
#index719
#arnetid721

#*Automata on Infinite Objects.
#@Wolfgang Thomas
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation1345
#index720
#arnetid722

#*General Purpose Parallel Architectures.
#@Leslie G. Valiant
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation430
#index721
#arnetid723

#*Average-Case Analysis of Algorithms and Data Structures.
#@Jeffrey Scott Vitter,Philippe Flajolet
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation148
#index722
#arnetid724

#*Algebraic Specification.
#@Martin Wirsing
#year1990
#confHandbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
#citation672
#index723
#arnetid725

#*Computational Geometry.
#@F. Frances Yao
#year1990
#confHandbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
#citation47
#index724
#arnetid726

#*Suffix, prefix and maximal tree codes.
#@Philippe Aigrain,Maurice Nivat
#year1992
#confTree Automata and Languages
#citation2
#index725
#arnetid727

#*Fixed point characterization of weak monadic logic definable sets of trees.
#@André Arnold,Damian Niwinski
#year1992
#confTree Automata and Languages
#citation49
#index726
#arnetid728

#*Recognizing sets of labelled acyclic graphs.
#@Paola Bonizzoni,Giancarlo Mauri,Giovanni Pighizzini,Nicoletta Sabadini
#year1992
#confTree Automata and Languages
#citation1
#index727
#arnetid729

#*Recognizable sets of unrooted trees.
#@Bruno Courcelle
#year1992
#confTree Automata and Languages
#citation8
#index728
#arnetid730

#*Structural complexity of classes of tree languages.
#@Max Dauchet,Sophie Tison
#year1992
#confTree Automata and Languages
#citation14
#index729
#arnetid731

#*Decidability of the inclusion in monoids generated by tree transformation classes.
#@Zoltán Fülöp,Sándor Vágvölgyi
#year1992
#confTree Automata and Languages
#citation8
#index730
#arnetid732

#*Unification procedures in automated deduction methods based on matings: A survey.
#@Jean H. Gallier
#year1992
#confTree Automata and Languages
#citation6
#index731
#arnetid733

#*Algebraic specification of action trees and recursive processes.
#@Martin Große-Rhode,Christian Dimitrovici
#year1992
#confTree Automata and Languages
#citation2
#index732
#arnetid734

#*Trees and algebraic semantics.
#@Irène Guessarian
#year1992
#confTree Automata and Languages
#citation4
#index733
#arnetid735

#*Tree-adjoining grammars and lexicalized grammars.
#@Aravind K. Joshi,Yves Schabes
#year1992
#confTree Automata and Languages
#citation-1
#index734
#arnetid736

#*Computing trees with graph rewriting systems with priorities.
#@Igor Litovsky,Yves Métivier
#year1992
#confTree Automata and Languages
#citation29
#index735
#arnetid737

#*Binary tree codes.
#@Maurice Nivat
#year1992
#confTree Automata and Languages
#citation16
#index736
#arnetid738

#*A monoid approach to tree automata.
#@Andreas Podelski
#year1992
#confTree Automata and Languages
#citation19
#index737
#arnetid739

#*A survey of tree transductions.
#@Jean-Claude Raoult
#year1992
#confTree Automata and Languages
#citation16
#index738
#arnetid740

#*Rational and recognizable infinite tree sets.
#@Ahmed Saoudi
#year1992
#confTree Automata and Languages
#citation1
#index739
#arnetid741

#*Automata on infinite trees and rational control.
#@Ahmed Saoudi,Paola Bonizzoni
#year1992
#confTree Automata and Languages
#citation0
#index740
#arnetid742

#*Interpretability and tree automata: A simple way to solve algorithmic problems on graphs closely related to trees.
#@Detlef Seese
#year1992
#confTree Automata and Languages
#citation22
#index741
#arnetid743

#*Ambiguity and valuedness.
#@Helmut Seidl
#year1992
#confTree Automata and Languages
#citation1
#index742
#arnetid744

#*A short proof of the factorization forest theorem.
#@I. Simon
#year1992
#confTree Automata and Languages
#citation18
#index743
#arnetid745

#*A theory of tree language varieties.
#@Magnus Steinby
#year1992
#confTree Automata and Languages
#citation48
#index744
#arnetid746

#*Computer-Aided Database Design: the DATAID approach.
#@Antonio Albano,Valeria De Antonellis,Antonio Di Leva
#year1985
#conf
#citation3
#index745
#arnetid747

#*Computability, Complexity, Logic (English translation of "Berechenbarkeit, Komplexität, Logik" from 1985)
#@Egon Börger
#year1989
#confStudies in Logic and the Foundations of Mathematics
#citation3
#index746
#arnetid748

#*Methodology and Tools for Data Base Design.
#@Stefano Ceri
#year1983
#conf
#citation105
#index747
#arnetid749

#*Data and Reality, 1st edition.
#@William Kent
#year1978
#conf
#citation-1
#index748
#arnetid750

#*Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
#@Jan van Leeuwen
#year1990
#conf
#citation-1
#index749
#arnetid751

#*Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics
#@Jan van Leeuwen
#year1990
#conf
#citation4
#index750
#arnetid752

#*Tree Automata and Languages.
#@Maurice Nivat,Andreas Podelski
#year1992
#conf
#citation28
#index751
#arnetid753

#*Handbook of Automated Reasoning (in 2 volumes)
#@John Alan Robinson,Andrei Voronkov
#year2001
#conf
#citation-1
#index752
#arnetid754

#*Classification, Estimation and Pattern Recognition.
#@Tzay Y. Young,Thomas W. Calvert
#year1974
#conf
#citation294
#index753
#arnetid755

#*Méthodes de Programmation, 1st edition
#@Bertrand Meyer,Claude Baudoin
#year1978
#conf
#citation-1
#index754
#arnetid756

#*Méthodes de Programmation, 3rd edition
#@Bertrand Meyer,Claude Baudoin
#year1984
#conf
#citation-1
#index755
#arnetid757

#*LogOut - Warum Computer nichts im Klassenzimmer zu suchen haben und andere High-Tech-Ketzereien
#@Clifford Stoll
#year2002
#conf
#citation25
#index756
#arnetid758

#*Fractal Geometry of Nature.
#@Benoit Mandelbrot
#year1977
#conf
#citation27
#index757
#arnetid759

#*Fractals, Chaos, Power Laws: Minutes From an Infinite Paradise.
#@Manfred Schroeder
#year1991
#conf
#citation1236
#index758
#arnetid760

#*Computers and Intractability: A Guide to the Theory of NP-Completeness.
#@M. R. Garey,David S. Johnson
#year1979
#conf
#citation5
#index759
#arnetid761

#*Spatial Analysis and GIS.
#@A. Stewart Fotheringham,Peter A. Rogerson
#year1994
#conf
#citation209
#index760
#arnetid762

#*Deterministic Translation Grammars
#@Benjamin M. Brosgol
#year1973
#confOutstanding Dissertations in the Computer Sciences
#citation33
#index761
#arnetid763

#*The Analysis of a Practical and Nearly Optimal Priorty Queue
#@Mark R. Brown
#year1977
#confOutstanding Dissertations in the Computer Sciences
#citation20
#index762
#arnetid764

#*Queueing Network Models of Multiprogramming
#@Jeffrey P. Buzen
#year1971
#confOutstanding Dissertations in the Computer Sciences
#citation178
#index763
#arnetid765

#*A Practical Formal Semantic Definition and Verification System for TYPED LISP
#@Robert Cartwright
#year1976
#confOutstanding Dissertations in the Computer Sciences
#citation20
#index764
#arnetid766

#*Linear Lists and Prorty Queues as Balanced Binary Trees
#@Clark A. Crane
#year1972
#confOutstanding Dissertations in the Computer Sciences
#citation-1
#index765
#arnetid767

#*Computer Display of Curved Surfaces
#@Henry Gouraud
#year1971
#confOutstanding Dissertations in the Computer Sciences
#citation135
#index766
#arnetid768

#*The Application of Theorem Proving to Question-Answering Systems
#@C. Cordell Green
#year1969
#confOutstanding Dissertations in the Computer Sciences
#citation94
#index767
#arnetid769

#*Decidability Questions for Petri Nets
#@Michel Hack
#year1975
#confOutstanding Dissertations in the Computer Sciences
#citation187
#index768
#arnetid770
#!An understanding of the mathematical properties of Petri Nets is essential when one wishes to use Petri Nets as an abstract model for concurrent systems. The decidability of various problems which arise in this context is an important aspect of this question. The fact that these problems also arise in the context of other mathematical theories, such as commutative semigroups, closure under linear relations, Matrix Context-Free grammars, or Weak Counter Automata, provides further motivation. The Reachability Problem for Vector Addition Systems - whose decidability is still an open question - is of central importance. We show that a number of Petri Net problems are recursively equivalent to this problem. These include the Liveness Problem (e.g. can a system reach a deadlocked state?), the persistence problem (can a given transition ever be disabled by the firing of another transition?), and the membership and emptiness problems for certain classes of languages generated by Petri Nets. The power of the unrestricted Petri Net model is illustrated by various undecidable equivalence results. In particular, we show that the equality of Reachability Sets and the equivalence of two Petri Nets in terms of their language-generating capability are recursive undecidable. It is hoped that the constructions used to prove our results will shed some light on the source of the complexities of the unrestricted Petri Net model, and may eventually permit us to achieve an optimal balance between representational transparency and analytical power of the Petri Net model.

#*Control-Theoretic Formulation of Operating Systems Resource Management Policies
#@Rajendra K. Jain
#year1978
#confOutstanding Dissertations in the Computer Sciences
#citation11
#index769
#arnetid771

#*The Metanovel: Writing Stories by Computer
#@James R. Meehan
#year1976
#confOutstanding Dissertations in the Computer Sciences
#citation184
#index770
#arnetid772

#*A Processor Design for the Efficient Implementation of APL
#@Charles Russell Minter
#year1976
#confOutstanding Dissertations in the Computer Sciences
#citation0
#index771
#arnetid773

#*The Design and Construction of Flexible and Efficient Interactive Programming Systems
#@James G. Mitchell
#year1970
#confOutstanding Dissertations in the Computer Sciences
#citation30
#index772
#arnetid774

#*Reasoning from Incomplete Knowledge in a Procedural Deduction System
#@Robert C. Moore
#year1975
#confOutstanding Dissertations in the Computer Sciences
#citation5
#index773
#arnetid775

#*Axiomatic Proof Techniques for Parallel Programs
#@Susan S. Owicki
#year1975
#confOutstanding Dissertations in the Computer Sciences
#citation857
#index774
#arnetid776
#!This thesis presents an axiomatic method for proving certain correctness properties of parallel programs. Axioms and inference rules for partial correctness are given for two parallel programming languages: The General Parallel Language and the Restricted Parallel Language. The General Language is flexible enough to represent most standard synchronizers (e.g. semaphores, events), so that programs using these synchronizers may be verified using the GPL deductive system. However, proofs for GPL programs are in general quite complex. The Restricted Language reduces this complexity by requiring shared variables to be protected by critical sections, so that only one process at a time has access to them. This discipline does not significantly reduce the power of the language, and it greatly simplifies the process of program verification. Although the axioms and inference rules are primarily intended for proofs of partial correctness, there are a number of other important properties of parallel programs. We give some practical techniques which use information obtained from a partial correctness proof to derive other correctness properties, including program termination, mutual exclusion, and freedom from deadlock. A number of examples of such proofs are given. Finally, the axioms and inference rules are shown to be consistent and complete (in a special sense) with respect to an interpretive model of parallel execution. Thus the deductive system gives an accurate description of program execution and is powerful enough to yield a proof of any true partial correctness formula.

#*Shellsort and Sorting Networks
#@Vaughan R. Pratt
#year1972
#confOutstanding Dissertations in the Computer Sciences
#citation42
#index775
#arnetid777

#*Machine Perception of Three-Dimensional Solids
#@Lawrence G. Roberts
#year1963
#confOutstanding Dissertations in the Computer Sciences
#citation1006
#index776
#arnetid778

#*Source Language Debugging Tools
#@Edwin H. Satterthwaite
#year1975
#confOutstanding Dissertations in the Computer Sciences
#citation1
#index777
#arnetid779

#*Quicksort
#@Robert Sedgewick
#year1975
#confOutstanding Dissertations in the Computer Sciences
#citation82
#index778
#arnetid780

#*Queueing Models for Computer Systems with General Service Time Distributions
#@Annie W. Shum
#year1976
#confOutstanding Dissertations in the Computer Sciences
#citation16
#index779
#arnetid781

#*A Data Definition Facility for Programming Languages
#@Thomas A. Standish
#year1967
#confOutstanding Dissertations in the Computer Sciences
#citation30
#index780
#arnetid782

#*Sketchpad, A Man-Machine Graphical Communication System
#@Ivan E. Sutherland
#year1963
#confOutstanding Dissertations in the Computer Sciences
#citation-1
#index781
#arnetid783
#!The Sketchpad system makes it possible for a man and a computer to converse rapidly through the medium of line drawings. Heretofore, most interaction between man and computers has been slowed down by the need to reduce all communication to written statements that can be typed; in the past, we have been writing letters to rather than conferring with our computers. For many types of communication, such as describing the shape of a mechanical part or the connections of an electrical circuit, typed statements can prove cumbersome. The Sketchpad system, by eliminating typed statements (except for legends) in favor of line drawings, opens up a new area of man-machine communication.

#*Automatic Verification of Programs with Complex Data Structures
#@Norihisa Suzuki
#year1976
#confOutstanding Dissertations in the Computer Sciences
#citation32
#index782
#arnetid784

#*Studies in Extensible Programming Languages
#@Ben Wegbreit
#year1970
#confOutstanding Dissertations in the Computer Sciences
#citation10
#index783
#arnetid785

#*Automatic Generation of Assemblers
#@John D. Wick
#year1975
#confOutstanding Dissertations in the Computer Sciences
#citation20
#index784
#arnetid786

#*Understanding Goal-Based Stories
#@Robert Wilensky
#year1978
#confOutstanding Dissertations in the Computer Sciences
#citation243
#index785
#arnetid787

#*Predicate-Oriented Database Search Algorithms
#@Dan E. Willard
#year1978
#confOutstanding Dissertations in the Computer Sciences
#citation41
#index786
#arnetid788

#*Semantics For a Question-Answering System
#@William A. Woods
#year1967
#confOutstanding Dissertations in the Computer Sciences
#citation50
#index787
#arnetid789

#*The Hensel Lemma in Algebraic Manipulation
#@David Y. Y. Yun
#year1973
#confOutstanding Dissertations in the Computer Sciences
#citation40
#index788
#arnetid790

#*Cluster Analysis.
#@B. S. Everitt
#year1993
#conf
#citation-1
#index789
#arnetid791

#*Objektorientierte Softwareentwicklung
#@Bertrand Meyer
#year1990
#conf
#citation547
#index790
#arnetid792

#*Erfolgsschlüssel Objekttechnologie -- Managerführer zur Neuorganisation des Softwareprozesses
#@Bertrand Meyer
#year1995
#conf
#citation-1
#index791
#arnetid793

#*Logic for Computer Science: Foundations of Automatic Theorem Proving
#@Jean H. Gallier
#year1986
#conf
#citation473
#index792
#arnetid794

#*An Introduction to Compiler Contruction
#@William M. Waite,Lynn Robert Carter
#year1993
#conf
#citation18
#index793
#arnetid795

#*Artificial Intelligence Architectures for Composition and Performance Environment.
#@Antonio Camurri
#year2000
#confReadings in Music and Artificial Intelligence
#citation0
#index794
#arnetid796

#*Dynamic Programming for Interactive Music Systems.
#@Roger B. Dannenberg
#year2000
#confReadings in Music and Artificial Intelligence
#citation2
#index795
#arnetid797

#*The Mechanization of Intelligence and the Human Aspects of Music.
#@Carlos Gustavo Guerra
#year2000
#confReadings in Music and Artificial Intelligence
#citation0
#index796
#arnetid798

#*Artificial Intelligence in Music Education: A Critical Review.
#@Simon Holland
#year2000
#confReadings in Music and Artificial Intelligence
#citation18
#index797
#arnetid799

#*Music, Intelligence and Artificiality.
#@Alan Marsden
#year2000
#confReadings in Music and Artificial Intelligence
#citation6
#index798
#arnetid800

#*Regarding Music, Machines, Intelligence and the Brain: An Introduction to Music and AI.
#@Eduardo Reck Miranda
#year2000
#confReadings in Music and Artificial Intelligence
#citation7
#index799
#arnetid801

#*Computer Analysis of Jazz Chord Sequence: Is Solar a Blues?
#@François Pachet
#year2000
#confReadings in Music and Artificial Intelligence
#citation32
#index800
#arnetid802

#*Musical Pattern Extraction and Similarity Assessment.
#@Pierre-Yves Rolland,Jean-Gabriel Ganascia
#year2000
#confReadings in Music and Artificial Intelligence
#citation54
#index801
#arnetid803

#*Interactive Music Systems in Ensemble Performance.
#@Robert Rowe
#year2000
#confReadings in Music and Artificial Intelligence
#citation2
#index802
#arnetid804

#*Symbolic AI versus Connectionism in Music Research.
#@Petri Toiviainen
#year2000
#confReadings in Music and Artificial Intelligence
#citation17
#index803
#arnetid805

#*On the Potential of Machine Learning for Music Research.
#@Gerhard Widmer
#year2000
#confReadings in Music and Artificial Intelligence
#citation5
#index804
#arnetid806

#*Musical Knowledge: What can Artificial Intelligence Bring to the Musician?
#@Geraint A. Wiggins,Alan Smaill
#year2000
#confReadings in Music and Artificial Intelligence
#citation13
#index805
#arnetid807

#*Artificial Intelligence and Music Education.
#@Matt Smith
#year2000
#confReadings in Music and Artificial Intelligence
#citation-1
#index806
#arnetid808

#*Readings in Music and Artificial Intelligence
#@Eduardo Reck Miranda
#year2000
#confReadings in Music and Artificial Intelligence
#citation35
#index807
#arnetid809

#*Information Extraction from Free-Text Business Documents.
#@Witold Abramowicz,Jakub Piskorski
#year2003
#confEffective databases for text & document management
#citation-1
#index808
#arnetid810
#%773064
#%107170
#%107221
#%41444
#%41438
#%41743
#!The objective of this chapter is an investigation of the applicability of information extraction techniques in real-world business applications dealing with textual data since business relevant data is mainly transmitted through free-text documents. In particular, we give an overview of the information extraction task, designing information extraction systems and some examples of existing information extraction systems applied in the financial, insurance and legal domains. Furthermore, we demonstrate the enormous indexing potential of lightweight linguistic text processing techniques applied in information extraction systems and other closely related fields of information technology which concern processing vast amounts of textual data.

#*Active Rules and Active Databases: Concepts and Application.
#@Juan M. Ale,Mauricio Minuto Espil
#year2003
#confEffective databases for text & document management
#citation-1
#index809
#arnetid811
#%627781
#%832924
#%1118163
#%599769
#%1118216
#%845598
#%1118201
#%642542
#%642233
#%641954
#%642177
#%642330
#%300256
#%299726
#%598295
#%544804
#%1112321
#%1113480
#%1118218
#%673803
#%598825
#%144761
#%1064851
#%938705
#%599935
#%642187
#%1064688
#!This chapter surveys the topic of active rules and active databases. We analyze the state of the art of active databases and active rules, their properties and applications. In particular, we describe the case of triggers following the SQL-1999 Standard Committee point of view. Then, we consider the case of dynamic constraints for which we use a temporal logic formalism. Finally, we discuss the applicability, limitations and partial solutions found when attempting to ensure the satisfaction of dynamic constraints.

#*Applying JAVA-Triggers for X-Link Management in the Industrial Framework.
#@Abraham Alvarez,Youssef Amghar
#year2003
#confEffective databases for text & document management
#citation0
#index810
#arnetid812
#%627781
#%832762
#%833171
#%832384
#%832863
#%87354
#%776544
#%793808
#%591889
#%772530
#%592081
#%169983
#%256281
#%256215
#%383546
#%642546
#%256240
#%256117
#%774803
#%769744
#%256150
#%1138101
#%176430
#%832264
#%95553
#%248833
#%772519
#%169899
#%1064851
#%599845
#!This chapter focuses on referential link integrity problems. In the industrial context, the life cycle of a document plays a central role in describing the "steps out" of a product. Users realize some manipulations like creation, edition, suppression and querying under a multi-user environment, risking possible destruction or the alteration of the document's integrity. A classical impact is the infamous "Error 404: file not found." However, the user needs a notification alert mechanism to prevent and warrant the coherence of manipulations over all the life cycle processes of a product. The main objective of this chapter is to provide a generic relationship validation mechanism to remedy this shortcoming. We believe in the combination of some standard features of XML, specifically XLL specification as a support for integrity management and Java-Triggers approach as an alert method. This study, compared with actual approaches, proposes a solution based on active functionalities.

#*Novel Indexing Method of Relations Between Salient Objects.
#@Richard Chbeir,Youssef Amghar,André Flory
#year2003
#confEffective databases for text & document management
#citation0
#index811
#arnetid813
#%63242
#%150064
#%1120053
#%1031490
#%1011391
#%637894
#%598012
#%772441
#%1113858
#%617631
#!Since the last decade, images have been integrated into several application domains such as GIS, medicine, etc. This integration necessitates new managing methods particularly in image retrieval. Queries should be formulated using different types of features such as low-level features of images (histograms, color distribution, etc.), spatial and temporal relations between salient objects, semantic features, etc. In this chapter, we propose a novel method for identifying and indexing several types of relations between salient objects. Spatial relations are used here to show how our method can provide high expressive power to relations in comparison to the traditional methods.

#*On the Computation of Recursion in Relational Databases.
#@Yangjun Chen
#year2003
#confEffective databases for text & document management
#citation1
#index812
#arnetid814
#%299364
#%598837
#%1118405
#%598475
#%95196
#%1113592
#%1118199
#%1118417
#%642115
#%641818
#%1127400
#%1118153
#!A composite object represented as a directed graph is an important data structure which requires efficient support in CAD/CAM, CASE, office systems, software management, Web databases and document databases. It is cumbersome to handle such an object in relational database systems when it involves recursive relationships. In this chapter, we present a new encoding method to support the efficient computation of recursion. In addition, we devise a linear time algorithm to identify a sequence of reachable trees (w.r.t.) a directed acyclic graph (DAG), which covers all the edges of the graph. Together with the new encoding method, this algorithm enables us to compute recursion w.r.t, a DAG in time O(e), where e represents the number of edges of the DAG. More importantly, this method is especially suitable for a relational environment.

#*Building Signature-Trees on Path Signatures in Document Databases.
#@Yangjun Chen,Gerald Huck
#year2003
#confEffective databases for text & document management
#citation-1
#index813
#arnetid815
#%149400
#%598387
#%643719
#%643721
#%654503
#%2518
#%832515
#!Java is a prevailing implementation platform for XML-based systems. Several high-quality in-memory implementations for the standardized XML-DOM API are available. However, persistency support has not been addressed. In this chapter, we discuss this problem and introduce PDOM (persistent DOM) to accommodate documents as permanent object sets. In addition, we propose a new indexing technique: path signatures to speed up the evaluation of path-oriented queries against document object sets, which is further enhanced by combining the technique of signature-trees with it to expedite scanning of signatures stored in a physical file.

#*Dealing with Relationship Cardinality Constraints in Relational Database Design.
#@Dolores Cuadra Fernández,Paloma Martínez Fernández,Elena Castro Galán
#year2003
#confEffective databases for text & document management
#citation0
#index814
#arnetid816
#%828
#%635148
#%1118297
#%598522
#%832924
#%845886
#%1064758
#%845643
#%183652
#%74526
#%95243
#%2024
#%2625
#%846199
#%190
#%2617
#%1089778
#%125
#%833140
#%832654
#%832930
#!Conceptual models are well-known tools to achieve a good design of information systems. Nevertheless, the understanding and use of all the constructs and constraints which are presented in such models are not an easy task and sometimes it is cause of loss of interest.In this chapter we have tried to study in depth and clarify the meaning of the features of conceptual models. The disagreements between main conceptual models, the confusion in the use of some of their constructs and some open problems in these models are shown. Another important topic treated in this chapter is the conceptual-to-logic schemata transformation process.Some solutions are presented in order to clarify the relationship construct and to extend the cardinality constraint concept in ternary relationships. How to preserve the cardinality constraint semantics in binary and ternary relationships for their implementation in a DBMS with active capabilities has also been developed.

#*Repairing and Querying Inconsistent Databases.
#@Gianluigi Greco,Sergio Greco,Ester Zumpano
#year2003
#confEffective databases for text & document management
#citation4
#index815
#arnetid817
#%105865
#%115847
#%544764
#%745410
#%745408
#%545299
#%984666
#%1118685
#%627161
#%328118
#%304213
#%643119
#%643122
#%299320
#%1118309
#%1112319
#%1064674
#%808476
#%605435
#%493
#%1118555
#!The integration of knowledge from multiple sources is an important aspect in several areas such as data warehousing, database integration, automated reasoning systems, active reactive databases and others. Thus a central topic in databases is the construction of integration systems, designed for retrieving and querying uniform data stored in multiple information sources. This chapter illustrates recent techniques for computing repairs as well as consistent answers over inconsistent databases. Often databases may be inconsistent with respect to a set of integrity constraints, that is, one or more integrity constraints are not satisfied. Most of the techniques for computing repairs and queries over inconsistent databases work for restricted cases and only recently there have been proposals to consider more general constraints. In this chapter we give an informal description of the main techniques proposed in the literature.

#*Unifying Access to Heterogeneous Document Databases Through Contextual Metadata.
#@Virpi Lyytikäinen,Pasi Tiitinen,Airi Salminen
#year2003
#confEffective databases for text & document management
#citation2
#index816
#arnetid818
#%1492686
#%247737
#%237093
#%47881
#%979731
#%927674
#%956952
#%414735
#%247738
#%89888
#%237286
#!Document databases available on the Internet carry massive information resources. To a person needing a piece of information on a specific domain, finding the piece, however, is often quite problematic even though there were a representative collection of databases available on the domain. The languages used in the content, the names of document types, their structures, the ways documents are organized and their retrieval techniques often vary in the databases. The databases containing legal information on the Internet offer a typical example. For finding relevant documents and for being able to interpret the content of the documents correctly, the user may need information about the context where the documents have been created. In this chapter we introduce a method for collecting contextual metadata and for representing the metadata to the users by graphical models. The solution is demonstrated by a case of retrieving information from distributed European legal databases.

#*Managing Document Taxonomies in Relational Databases.
#@Ido Millet
#year2003
#confEffective databases for text & document management
#citation0
#index817
#arnetid819
#%145183
#!This chapter addresses the challenge of applying relational database technologies to manage taxonomies, which are commonly used to classify documents, knowledge and websites into a hierarchy of topics. It first describes how denormalizing the data model can facilitate data retrieval from such topic hierarchies. It then shows how the typical data maintenance difficulties associated with denormalized data models can be solved using database triggers.

#*Database Management Issues in the Web Environment.
#@José Francisco Aldana Montes,Antonio C. Gomez Lora,Nathalie Moreno Vergara,María del Mar Roldán García
#year2003
#confEffective databases for text & document management
#citation0
#index818
#arnetid820
#%2294
#%817561
#%817554
#%598099
#%599606
#%982076
#%472239
#%11922
#%643631
#%642702
#%643605
#%299894
#%299563
#%643120
#%643263
#%654566
#%1064640
#%599636
#%599411
#%544868
#%674016
#%1065267
#%559865
#%493
#%1118211
#!The focus of this chapter is on the progressive adaptation of database techniques to Web usage in a way quite similar to the evolution from integrated file management systems to database management systems. We review related and open issues, such as the semi-structured data and XML, integrity problem, query optimization problem, and integration issues in both the Web and Semantic Web environments. The representation of meta-information along with data opens up a new way to automatically process Web information due to the use of explicit semantic information. We hope that researchers will take into account traditional database techniques and how they can assist new Web technologies. In this sense, the amalgamation of Web and database technology appears to be very promising.

#*Interactive Indexing of Documents with a Multilingual Thesaurus.
#@Ulrich Schiel,Ianna M. S. F. de Sousa
#year2003
#confEffective databases for text & document management
#citation1
#index819
#arnetid821
#%746169
#%95561
#%956895
#%247094
#!With the growing significance of digital libraries and the Internet, more and more electronic texts become accessible to a wide and geographically disperse public. This requires adequate tools to facilitate indexing, storage and retrieval of documents written in different languages. We present a method for semi-automatic indexing of electronic documents and construction of a multilingual thesaurus, which can be used for query formulation and information retrieval. We use special dictionaries and user interaction in order to solve ambiguities and find adequate canonical terms in the language and an adequate abstract language-independent term. The abstract thesaurus is updated incrementally by new indexed documents and is used to search for documents using adequate terms.

#*Understanding Functional Dependency.
#@Robert A. Schultz
#year2003
#confEffective databases for text & document management
#citation1
#index820
#arnetid822
#%1118316
#!In explaining functional dependency to students, I have noticed in texts a mixture of two types of elements: intensional (or psychological or meaning) and extensional (patterns of repetition in the data). In this chapter I examine whether it is possible to consider functional dependency, in particular, in second and third normal forms, solely on an extensional basis. The Microsoft Access Analyzer utility seems to do so. I illustrate the mix of intensional and extensional elements in textbook definitions of functional dependency. I conclude that although in principle first, second and third normal form can be done solely by extensional means, in practice intensional considerations are indispensable. Finally, I discuss these questions with respect to the "higher order" normal forms, namely Boyce-Codd, fourth, fifth and Domain/Key normal form.

#*Keyword-Based Queries Over Web Databases.
#@Altigran Soares da Silva,Pável Calado,Rodrigo C. Vieira,Alberto H. F. Laender,Berthier A. Ribeiro-Neto
#year2003
#confEffective databases for text & document management
#citation1
#index821
#arnetid823
#%149570
#%62602
#%1065248
#%595718
#%85
#%2025
#%95186
#%595604
#%956539
#%642614
#%642405
#%738609
#%1120350
#!In this chapter, we propose an approach to using keywords (as in a Web search engine) for querying databases over the Web. The approach is based on a Bayesian network model and provides a suitable alternative to the use of interfaces based on multiple forms with several fields. Two major steps are involved when querying a Web database using this approach. First, structured (database-like) queries are derived from a query composed only of the keywords specified by the user. Next, the structured queries are submitted to a Web database, and the retrieved results are presented to the user as ranked answers. To demonstrate the feasibility of the approach, a simple prototype Web search system based on the approach is presented. Experimental results obtained with this system indicate that the approach allows for accurately structuring the user queries and retrieving appropriate answers with minimum intervention from the user.

#*System of Information Retrieval in XML Documents.
#@Saliha Smadhi
#year2003
#confEffective databases for text & document management
#citation0
#index822
#arnetid824
#%95378
#%62602
#%157513
#%1113781
#%595906
#%595535
#%936632
#!This chapter introduces the process to retrieve units (or subdocuments) of relevant information from XML documents. For this, we use the Extensible Markup Language (XML) which is considered as a new standard for data representation and exchange on the Web. XML opens opportunities to develop a new generation of Information Retrieval System (IRS) to improve the interrogation process of document bases on the Web.Our work focuses instead on end-users who do not have expertise in the domain (like a majority of the end-users). This approach supports keyword-based searching like classical IRS and integrates structured searching with the search attributes notion. It is based on an indexing method of document tree leafs which authorize a content-oriented retrieval. The retrieval subdocuments are ranked according to their similarity with the user's query. We use a similarity measure which is a compromise between two measures: exhaustiveness and specificity.

#*A Taxonomy for Object-Relational Queries.
#@David Taniar,J. Wenny Rahayu,Prakash Gaurav Srivastava
#year2003
#confEffective databases for text & document management
#citation0
#index823
#arnetid825
#%2364
#%642095
#%642594
#!A comprehensive study of object-relational queries gives not only an understanding of full capability of object-relational query language but also a direction for query processing and optimization. This chapter classifies object-relational queries into REF queries, aggregate queries and inheritance queries. REF queries are queries involving REF pointers, whereas aggregation queries use either nested table structures or index on clusters. Finally, inheritance queries are queries on inheritance hierarchies.

#*Re-Engineering and Automation of Business Processes: Criteria for Selecting Supporting Tools.
#@Aphrodite Tsalgatidou,Mara Nikolaidou
#year2003
#confEffective databases for text & document management
#citation0
#index824
#arnetid826
#%855968
#%929052
#%121852
#!Re-engineering of business processes and their automation is an activity very common in most organizations in order to keep or create a competitive business advantage in the changing business environment. Business Process Modeling Tools (BPMTs) and Workflow Management Systems (WFMSs) are the most popular tools used for business process transformation and automation of the redesigned business processes within and outside organization's boundaries. This chapter describes a set of criteria for selecting appropriate BPMTs and WFMSs among the diversity of the tools offered in the market in order to assist the interested manager or business process engineer to more successfully manage the business process transformation. While establishing the proposed criteria, we considered currently available technology and standards for visual enterprise support and inter-organizational business process modeling and automation.

#*Metrics for Data Warehouse Quality.
#@Manuel A. Serrano,Coral Calero,Mario Piattini
#year2003
#confEffective databases for text & document management
#citation8
#index825
#arnetid827
#%1127425
#%979762
#%1127603
#%772016
#%807748
#%492901
#%1129799
#!This chapter proposes a set of metrics to assess data warehouse quality. A set of data warehouse metrics is presented, and the formal and empirical validations that have been done with them. As we consider that information is the main organizational asset, one of our primary duties should be assuring its quality. Although some interesting guidelines have been proposed for designing "good" data models for data warehouses, more objective indicators are needed. Metrics are a useful objective mechanism for improving the quality of software products and also for determining the best ways to help professionals and researchers. In this way, our goal is to elaborate a set of metrics for measuring data warehouse quality which can help designers in choosing the best option among more than one alternative design.

#*Integrity Constraints in an Active Database Environment.
#@Juan M. Ale,Mauricio Minuto Espil
#year2002
#confDatabase Integrity
#citation0
#index826
#arnetid828
#%1118163
#%1118216
#%1118218
#%642177
#%642187
#%1118201
#%1064688
#%598295
#%642233
#%845598
#%299726
#%642542
#%1064851
#%598825
#%938705
#%832924
#%1113480
#%599769
#%144761
#%599935
#!This chapter surveys the interaction between active rules and integrity constraints. First, we analyze the static case following the SQL-1999 Standard Committee point of view which, up to date, represents the state of the art. Then, we consider the case of dynamic constraints for which we use a temporal logic formalism. finally, we discuss the applicabilty, limitations and partial solutions found when attempting to ensure the satisfaction of dynamic constraints.

#*Integrity Constraints in Spatial Databases.
#@Karla A. V. Borges,Clodoveu A. Davis,Alberto H. F. Laender
#year2002
#confDatabase Integrity
#citation8
#index827
#arnetid829
#%232818
#%883570
#%617605
#%883604
#%2020
#%232867
#%232794
#%183514
#%883581
#%3480
#%2617

#*Preserving Relationship Cardinality Constraints in Relational Schemata.
#@Dolores Cuadra,Carlos Nieto,Paloma Martínez,Elena Castro,Manuel Velasco
#year2002
#confDatabase Integrity
#citation5
#index828
#arnetid830
#%1089778
#%125
#%1118297
#%193
#%845643
#%832654
#%95243
#%1092987
#%2344
#%832924
#%74526
#%832930
#%2024
#%2617
#%846199
#%833140
#%863883
#%2625
#%137913
#%1118714

#*Translating Advanced Integrity Checking Technology to SQL.
#@Hendrik Decker
#year2002
#confDatabase Integrity
#citation12
#index829
#arnetid831
#%597957
#%598042
#%176256
#%299645
#%642177
#%3146
#%1118211
#%642330
#%520824
#%303906
#%137209
#%327892
#%176337
#%950129
#%930823
#%951363
#%544992
#%832481
#%439997
#%598768
#%300035
#%545110
#%938620
#%643122
#%984589
#%2344
#%599341
#%599423
#%599634
#%2260
#%599825
#%493
#%216781

#*Introduction.
#@Jorge Horacio Doorn,Laura C. Rivero,Viviana E. Ferraggine
#year2002
#confDatabase Integrity
#citation-1
#index830
#arnetid832

#*Consistent Queries Over Databases with Integrity Constraints.
#@Sergio Greco,Ester Zumpano
#year2002
#confDatabase Integrity
#citation0
#index831
#arnetid833
#%544764
#%299320
#%1112319
#%627161
#%115847
#%1118309
#%605435
#%105865
#%328118
#%745410
#%745408
#%1118685
#%493

#*Integrity Issues in the Web: Beyond Distributed Databases.
#@José Francisco Aldana Montes,Mariemma Inmaculada Yagüe del Valle,Antonio C. Gomez Lora
#year2002
#confDatabase Integrity
#citation0
#index832
#arnetid834
#%2294
#%1064640
#%817554
#%817561
#%544868
#%673845
#%1118211
#%299563
#%674016
#%299894
#%654566
#%559865
#%1065267
#%643120
#%643263
#%599411
#%493

#*Functional Dependencies for Value Based Identification in Object-Oriented Databases.
#@Jochen Rasch,Hans-Joachim Klein
#year2002
#confDatabase Integrity
#citation0
#index833
#arnetid835
#%2154
#%160026
#%190
#%845570
#%979731
#%183049
#%544976
#%183298
#%938608
#%12
#%1503295
#%145100
#%1065252
#%1065265
#%951070
#%183560
#%183566
#%1118522
#%183669
#%938811
#%521239
#%2617
#%938902
#%1118692
#%845795
#%791855
#%1118717
#%184141
#%599998

#*Database Integrity: Fundamental and Current Implementations.
#@Laura C. Rivero,Jorge Horacio Doorn,Viviana E. Ferraggine
#year2002
#confDatabase Integrity
#citation-1
#index834
#arnetid836
#%1138211
#%642177
#%642330
#%112
#%2315
#%1064953
#%568393
#%2305
#!In Part I, this chapter survyes the state of the art of the semantic integrity constraints in some relational and object relational available database systems. In Part II, it also provides an overview of the SQL standard integrity issues and describes semantic integrity support in the following DBMSs: Oracle, IBM DB2, Informix, sybase and PostgreSQL.The major differences and similarities among these systems are analyzed in relation to the definition, semantics and fidelity to the SQL standard prescriptions.

#*Integrity Maintenance in Extensible Databases.
#@Ulrich Schiel
#year2002
#confDatabase Integrity
#citation0
#index835
#arnetid837
#%979731
#%643663
#%1118668
#%2625

#*Project Management in Graduate Education.
#@Daniel Brandon
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index836
#arnetid838

#*Alignment of Business and Knowledge Management Strategy.
#@El-Sayed Abou-Zeid
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index837
#arnetid839

#*Project Management Best Practices to Increase Success.
#@Jeffrey L. Brewer
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index838
#arnetid840

#*Autopoietic Approach for Information System Development.
#@El-Sayed Abou-Zeid
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index839
#arnetid841

#*Sponsorship in IT Project Management.
#@David Bryde,David Petie
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index840
#arnetid842

#*A Systematic Approach for Information Systems Evaluation.
#@Ala Abu-Samaha
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation14
#index841
#arnetid843

#*Organizing Multimedia Objects by Using Class Algebra.
#@Daniel J. Buehrer
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index842
#arnetid844

#*ICT-Supported Gaming for Competitive Intelligence.
#@Jan Achterbergh
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index843
#arnetid845

#*Virtual Communities in Practice.
#@Chris Kimble,Paul Hildreth
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index844
#arnetid846

#*Concepts and Dynamics of the Application Service Provider Industry.
#@Dohoon Kim
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index845
#arnetid847

#*IT Supporting Strategy Formulation.
#@Jan Achterbergh
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index846
#arnetid848

#*Credit Card Users' Data Mining.
#@André Carlos Ponce Leon Ferreira de Carvalho,Antônio de Pádua Braga,Teresa Bernarda Ludermir
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index847
#arnetid849

#*Better Executive Information with the Dashboard Approach.
#@Frédéric Adam,Jean-Charles Pomerol
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index848
#arnetid850

#*Project Management Models in IT.
#@Marly Monteiro de Carvalho,Fernando José Barbin Laurindo,Marcelo Schneck de Paula Pessôa
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index849
#arnetid851

#*Human Motion Tracking and Recognition.
#@Niki Aifanti,Angel Domingo Sappa,Nikos Grammalidis,Sotiris Malassiotis
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index850
#arnetid852

#*Expanding Data Mining Power with System Dynamics.
#@Edilberto Casado
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index851
#arnetid853

#*Enhancing Competitiveness of B2B and B2C E-Commerce.
#@Henry Aigbedo
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index852
#arnetid854

#*Natural Computing.
#@Leandro Nunes de Castro
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation5
#index853
#arnetid855

#*Information Technology Usage in Nigeria.
#@Isola Ajiferuke,Wole Olatokun
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation1
#index854
#arnetid856

#*Distance Education Success Factors.
#@Cathy Cavanaugh
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation21
#index855
#arnetid857

#*Impacts of the Intranet on PDO.
#@Khamis Al-Gharbi,Abdulwahed Mohammed Khalfan
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index856
#arnetid858

#*Online Learning as a Form of Accomodation.
#@Terence Cavanaugh
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index857
#arnetid859

#*SMEs Amidst Global Technological Changes.
#@Nabeel A. Y. Al-Qirim
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index858
#arnetid860

#*Legal Issues of Virtual Organizations.
#@Claudia Cevenini
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index859
#arnetid861

#*Telemedicine in Healthcare Organisations.
#@Nabeel A. Y. Al-Qirim
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index860
#arnetid862

#*Multicast Routing Protocols, Algorithms and its QoS Extensions.
#@Debasish Chakraborty,Goutam Chakraborty,Norio Shiratori
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index861
#arnetid863

#*Triggers, Rules and Constraints in Databases.
#@Juan M. Ale,Mauricio Minuto Espil
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index862
#arnetid864

#*Data Mining for Combining Forecasts in Inventory Management.
#@Chi Kin Chan
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index863
#arnetid865

#*Spatial Modeling of Risk Factors for Gender-Specific Child Mortality.
#@Mohammad Ali,Christine Ashley,M. Zahirul Huq,Peter Kim Streatfield
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index864
#arnetid866

#*Content-Based Retrieval Concept.
#@Yung-Kuan Chan,Chin-Chen Chang
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index865
#arnetid867

#*Knowledge Management and Social Learning.
#@Irena M. Ali,Leoni Warne
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index866
#arnetid868

#*Interface Design Issues for Mobile Commerce.
#@Susy S. Chan,Xiaowen Fang
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index867
#arnetid869

#*Perturbations, Accuracy and Robustness in Neural Networks.
#@Cesare Alippi,Giovanni Vanini
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index868
#arnetid870

#*A Duplicate Chinese Document Image Retrieval System.
#@Yung-Kuan Chan,Yu-An Ho,Hsien-Chu Wu,Yen-Ping Chu
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index869
#arnetid871

#*Multimedia Evaluations Based on Cognitive Science Findings.
#@Eshaa M. Alkhalifa
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation1
#index870
#arnetid872

#*One-to-One Video-Conferencing Education.
#@Hock Chuan Chan,Bernard C. Y. Tan,Wei-Ping Tan
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index871
#arnetid873

#*International Digital Studies Approach for Examining International Online Interactions.
#@Kirk St. Amant
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index872
#arnetid874

#*Structure- and Content-Based Retrieval for XML Documents.
#@Jae-Woo Chang
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index873
#arnetid875

#*Strategic Utilization of Data Mining.
#@Chandra S. Amaravadi
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index874
#arnetid876

#*Incorporating Data Stream Analysis into Decision Support Systems.
#@Damianos Chatziantoniou,George Doukidis
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index875
#arnetid877

#*Semantic Web Fundamentals.
#@Grigoris Antoniou,Vassilis Christophides,Dimitris Plexousakis
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation1
#index876
#arnetid878

#*Novel Indexing Method of Relations Between Salient Objects.
#@Richard Chbeir,Kokou Yétongnon
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index877
#arnetid879

#*Democratic E-Governance.
#@Ari-Veikko Anttiroiko
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index878
#arnetid880

#*Graph Encoding and Recursion Computation.
#@Yangjun Chen
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index879
#arnetid881

#*Strategic Knowledge Management in Public Organizations.
#@Ari-Veikko Anttiroiko
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index880
#arnetid882

#*Organization and Management Issues of End User Computing.
#@Jason C. H. Chen,Robert W. Holt,D. Bruce Sun
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index881
#arnetid883

#*Management Considerations for B2B Online Exchanges.
#@Norman P. Archer
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index882
#arnetid884

#*Behavioral Perspective of Groupware Adoption.
#@Yining Chen,Hao Lou
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index883
#arnetid885

#*Addressing the Central Problem in Cyber Ethics through Stories.
#@John M. Artz
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index884
#arnetid886

#*Data Mining in Practice.
#@Sherry Y. Chen,Xiaohui Liu
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index885
#arnetid887

#*Web Technologies And Data Warehousing Strategies.
#@John M. Artz
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index886
#arnetid888

#*Similarity Web Pages Retrieval Technologies on the Internet.
#@Rung Ching Chen,Ming Yung Tsai,Chung Hsun Hsieh
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index887
#arnetid889

#*Content Description for Face Animation.
#@Ali Arya
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation4
#index888
#arnetid890

#*Data Mining in Franchise Organizations.
#@Ye-Sho Chen,Bin Zhang,Bob Justis
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index889
#arnetid891

#*Diffusion of E-Learning as an Educational Innovation.
#@Petek Askar,Ugur Halici
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index890
#arnetid892

#*Franchising and Information Technology.
#@Ye-Sho Chen,Bin Zhang,Bob Justis
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index891
#arnetid893

#*Diffusion of Innovations in Organisations.
#@Davood Askarany
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation4
#index892
#arnetid894

#*Neural Networks for Automobile Insurance Customers.
#@Ai Cheo
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index893
#arnetid895

#*Project Management for IT Projects.
#@Len Asprey
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index894
#arnetid896

#*Incremental Expansion of a Distributed Database Systems.
#@Amita Goyal Chin
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index895
#arnetid897

#*Integrative Document and Content Management Solutions.
#@Len Asprey,Michael Middleton
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation1
#index896
#arnetid898

#*Managing Strategic IT Investment Decisions.
#@Tzu-Chuan Chou,Robert G. Dyson,Philip L. Powell
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index897
#arnetid899

#*Innovative Thinking in Software Development.
#@Aybüke Aurum
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index898
#arnetid900

#*Effective Learning Through Optimum Distance Among Team Members.
#@Bishwajit Choudhary
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index899
#arnetid901

#*User Spreadsheet Systems Development.
#@Anders Avdic
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation4
#index900
#arnetid902

#*History and Future Development of Group Support Systems.
#@Ta-Tao Chuang,Wayne W. Huang,Yue (Jeff) Zhang
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index901
#arnetid903

#*Migrating Legacy Systems to the Web.
#@Lerina Aversano,Gerardo Canfora,Andrea De Lucia
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index902
#arnetid904

#*Evaluation of an Open Learning Environment.
#@Geraldine Clarebout,Jan Elen,Joost Lowyck,Jef Van den Enden,Erwin Van den Ende
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index903
#arnetid905

#*Reasoning About User Preferences.
#@Tamara Babaian
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index904
#arnetid906

#*Portable Portals for M-Commerce.
#@Irvine Clarke III,Theresa Flaherty
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index905
#arnetid907

#*Collective Intentional Action in Virtual Communities.
#@Richard P. Bagozzi,Utpal M. Dholakia
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation1
#index906
#arnetid908

#*Communication Management for Large Modules.
#@Elayne W. Coakes,Dianne Willis
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index907
#arnetid909

#*Building Police/Community Relations Through Virtual Communities.
#@Susan A. Baim
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index908
#arnetid910

#*Critical Success Factors of ERP Implementation.
#@Leopoldo E. Colmenares,Jim O. Otieno
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation3
#index909
#arnetid911

#*Executive Judgement in E-Business Strategy.
#@Valerie Baker,Tim Coltman
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index910
#arnetid912

#*Mobile Transaction Models Framework.
#@Andrés Coratella,Miguel Felder,Roberto Hirsch,Eduardo Rodríguez
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index911
#arnetid913

#*Audience Response Systems and Face-to-Face Learning.
#@David A. Banks
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index912
#arnetid914

#*Isoluminance Contours for Animated Visualization.
#@Marion Cottingham
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index913
#arnetid915

#*Data Warehouse Development.
#@José María Cavero Barca,Esperanza Marcos Martínez,Mario Piattini,Adolfo Sanchez de Miguel
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index914
#arnetid916

#*Web Initiatives and E-Commerce Strategy.
#@Ron Craig
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index915
#arnetid917

#*IS Implementation in the UK Health Sector.
#@Stuart J. Barnes
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index916
#arnetid918

#*Geographic Information Systems as Decision Tools.
#@Martin D. Crossland
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index917
#arnetid919

#*Macromedia Flash on the Client and the Server.
#@Robert Barone
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index918
#arnetid920

#*Relationship Cardinality Constraints in Relational Database Design.
#@Dolores Cuadra,Paloma Martínez,Elena Castro
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index919
#arnetid921

#*Outsourcing Information Technology in Australia.
#@Nicholas Beaumont
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index920
#arnetid922

#*Virtual Teams as Sociotechnical Systems.
#@Haydee M. Cuevas,Stephen M. Fiore,Eduardo Salas,Clint A. Bowers
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation16
#index921
#arnetid923

#*Web Access by Older Adult Users.
#@Shirley Ann Becker
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index922
#arnetid924

#*Market of Resources for Agile/Virtual Enterprise Integration.
#@Maria Manuela Cunha,Goran D. Putnik
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation5
#index923
#arnetid925

#*Web Usability.
#@Shirley Ann Becker
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation146
#index924
#arnetid926

#*Challenges in Quality of Service for Tomorrow's Networks.
#@Luiz A. DaSilva
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index925
#arnetid927

#*Artificial Intelligence Techniques in Medicine and Healthcare.
#@Rezaul K. Begg
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation1
#index926
#arnetid928

#*Methods for Understanding IS Failures.
#@Darren Dalcher
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index927
#arnetid929

#*Women in the IT Profession.
#@Catherine M. Beise,Janette Moody,Martha E. Myers,Amy B. Woszczynski
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index928
#arnetid930

#*Exception Rules in Data Mining.
#@Olena Daly,David Taniar
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index929
#arnetid931

#*Virtual Work Research Agenda.
#@France Belanger
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index930
#arnetid932

#*Web Caching.
#@Antonios Danalis
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index931
#arnetid933

#*Governance in IT Outsourcing Partnerships.
#@Erik Beulen
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation2
#index932
#arnetid934

#*Context-Aware Framework for ERP.
#@Farhad Daneshgar
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index933
#arnetid935

#*Usability Evaluation of Online Learning Programs.
#@Bernard Blandin
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation2
#index934
#arnetid936

#*Hypothetical Reasoning Over Databases.
#@Lei Dang,Suzanne M. Embury
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index935
#arnetid937

#*Computer Attitude and Anxiety.
#@Pieter J. Blignaut,Andries J. Burger,Theo McDonald,Janse Tolmie
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation2
#index936
#arnetid938

#*Tertiary Education and the Internet.
#@Paul Darbyshire,Stephen Burgess
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index937
#arnetid939

#*Trust in Technology Partnerships.
#@Kirsimarja Blomqvist
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation7
#index938
#arnetid940

#*Object Database Benchmarks.
#@Jérôme Darmont
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index939
#arnetid941

#*Hyper Video for Distance Learning.
#@Mario A. Bochicchio,Nicola Fiore
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index940
#arnetid942

#*Rotating Banner Advertisements on the World Wide Web.
#@Subhasish Dasgupta,Rajesh Chandrashekaran
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index941
#arnetid943

#*New Perspectives on Rewards and Knowledge Sharing.
#@Gee-Woo Bock,Chen Way Siew,Young-Gul Kim
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index942
#arnetid944

#*Formal Methods in Software Engineering.
#@Aristides Dasso,Ana Funes
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index943
#arnetid945

#*Design Levels for Distance and Online Learning.
#@Judith V. Boettcher
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation5
#index944
#arnetid946

#*Concepts of Emergence Index in Image Databases.
#@Sagarmay Deb
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation6
#index945
#arnetid947
#%331478

#*Interactivity and Amusement in Electronic Commerce.
#@Yuan Gao
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation2
#index946
#arnetid948

#*Media and Personal Involvement in the Perceptions of Data Quality.
#@Andrew Borchers
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index947
#arnetid949

#*Principles of Advanced Database Integrity Checking.
#@Hendrik Decker
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index948
#arnetid950

#*eCRM in a Manufacturing Environment.
#@Aberdeen Leila Borders,Wesley J. Johnston
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index949
#arnetid951

#*Alignment of Information Technology and Human Resources Strategies.
#@Kristine F. Dery,Danny A. Samson
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index950
#arnetid952

#*Integrating Security in the Development Process with UML.
#@Folker den Braber,Mass Soldal Lund,Ketil Stølen,Fredrik Vraalsen
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation9
#index951
#arnetid953

#*Principles to Guide the Integration and Implementation of Educational Technology.
#@Sara Dexter
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index952
#arnetid954

#*Strategic Vision for Information Technology.
#@Mary Elizabeth Brabston
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index953
#arnetid955

#*The CRM-KDD Nexus.
#@Nikhilesh Dholakia,Jounghae Bang,Lutz Hamel,Seung-Kyoon Shin
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index954
#arnetid956

#*Balancing Risks and Rewards of ERP.
#@Joseph Bradley
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index955
#arnetid957

#*From Digital Divide to Digital Dividend.
#@Nikhilesh Dholakia,Nir Kshetri
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation2
#index956
#arnetid958

#*Business Model Application of UML Stereotypes.
#@Daniel Brandon
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index957
#arnetid959

#*Motivation for Using Microcomputers.
#@Donaldo de Souza Dias
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index958
#arnetid960

#*Globalization of Consumer E-Commerce.
#@Daniel Brandon
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index959
#arnetid961

#*Journalism Online in Peru.
#@Antonio Díaz-Andrade
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index960
#arnetid962

#*Object-Oriented Software Reuse in Business Systems.
#@Daniel Brandon
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index961
#arnetid963

#*Global Implications of E-Commerce Tool and Artifact Creation.
#@Deborah Bunker
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index962
#arnetid964

#*Impediments for Knowledge Sharing in Professional Service Firms.
#@Georg Disterer
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index963
#arnetid965

#*Issues and Challenges in IT in Small Business.
#@Stephen Burgess
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index964
#arnetid966

#*Audio Analysis Applications for Music.
#@Simon Dixon
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index965
#arnetid967

#*Web-Based Distance Learning and the Second Digital Divide.
#@Sheryl Burgstahler
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation3
#index966
#arnetid968
#!Web-based distance learning programs promise learning options anywhere, anytime, to anyone. However, some individuals with disabilities are locked out of these opportunities when courses are designed in such a way that they are inaccessible to individuals using assistive technology. This chapter provides an overview of access challenges for people with disabilities; suggestions for course developers on creating accessible courses; and suggestions for administrators on developing accessiblity policies, guidelines, and procedures.

#*Data Communications and E-Learning.
#@Michael W. Dixon,Johan M. Karlsson,Tanya J. McGill
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index967
#arnetid969

#*Online Academic Libraries and Distance Learning.
#@Merilyn Burke,Bruce Lubotsky Levin,Ardis Hanson
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index968
#arnetid970

#*Use Cases and the UML.
#@Brian Dobing,Jeffrey Parsons
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index969
#arnetid971

#*U.S. Disabilities Legislation Affecting Information Technology.
#@Deborah Bursa,Lorraine Justice,Mimi Kessler
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index970
#arnetid972

#*Critical Realism as an Underlying Philosophy for IS Research.
#@Philip J. Dobson
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index971
#arnetid973

#*Engineering Emotionally Intelligent Agents.
#@Penny Baillie de Byl,Mark A. Toleman
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index972
#arnetid974

#*Managing the Organisational Impacts of Information Systems.
#@Neil F. Doherty,Malcolm King
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index973
#arnetid975

#*Learning Portals as New Academic Spaces.
#@Katy Campbell
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index974
#arnetid976

#*Database Integrity.
#@Jorge Horacio Doorn
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index975
#arnetid977

#*Critical Realism in IS Research.
#@Sven A. Carlsson
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation1
#index976
#arnetid978

#*Informationbase - A New Information System Layer.
#@Kovach Dragan
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index977
#arnetid979

#*Building Educational Technology Partnerships Through Participatory Design.
#@John M. Carroll
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index978
#arnetid980

#*Self-Organizing Networked Learning Environments.
#@Jon Dron
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index979
#arnetid981

#*Recursive Nature of the Market for Enterprise Applications.
#@Fergal Carton,Frédéric Adam
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index980
#arnetid982

#*E-Commerce Training for SMEs.
#@Yanqing Duan
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index981
#arnetid983

#*Decision Support Systems in Small Businesses.
#@Yanqing Duan,Mark Xu
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index982
#arnetid984

#*Learnability.
#@Philip C. Duchastel
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index983
#arnetid985

#*Contingency Theory, Agent-Based Systems and a Virtual Advisor.
#@John R. Durrett,Lisa J. Burnell,John W. Priest
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index984
#arnetid986

#*Process-Aware Information Systems for Virtual Teamwork.
#@Schahram Dustdar
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index985
#arnetid987

#*Assessing the Value of Information Systems Investments.
#@Charlene A. Dykman
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index986
#arnetid988

#*Business Processes and Knowledge Management.
#@John S. Edwards
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation4
#index987
#arnetid989

#*Moderator in Governmen t-Initiated Online Discussions.
#@Arthur R. Edwards
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index988
#arnetid990

#*Wireless Ad Hoc Networking.
#@Fazli Erbas
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index989
#arnetid991

#*Knowledge Management Systems Acceptance.
#@Frederick Ericsson,Anders Avdic
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation8
#index990
#arnetid992
#%1499071
#%1500232
#!This chapter introduces a framework of knowledge management systems acceptance labeled Requirements of Acceptance Model (RAM). It argues that acceptance of knowledge management systems is dependent on perceived relevance, systems accessibility, and management support. Together these components constitute the RAM. Further, it argues that implementation of systems is at large a process of acceptance where the requirements of acceptance are attained. Finally, it argues that to achieve the requirements of acceptance, implementation should be iterative and cooperative between users and developers by continually developing, implementing, and testing prototypes.

#*An ERP Life-Cycle Costs Model.
#@José Esteves,Joan Antoni Pastor
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index991
#arnetid993

#*Socio-Cognitive Model of Trust.
#@Rino Falcone,Cristiano Castelfranchi
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation5
#index992
#arnetid994

#*Video Content-Based Retrieval Techniques.
#@Waleed E. Farag
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index993
#arnetid995

#*Forward Engineering of UML Static Models.
#@Liliana Favre,Liliana Martinez,Claudia Pereira
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index994
#arnetid996

#*Reuse of Formal Specifications.
#@Laura Felice,Daniel Riesco
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index995
#arnetid997

#*Trust Placement Process in Metateam Projects.
#@Walter D. Fernández
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index996
#arnetid998

#*Issues of E-Learning in Third World Countries.
#@Shantha Fernando
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index997
#arnetid999

#*Teams and Electronic Technologies.
#@Sharmila Pixy Ferris,Maureen C. Minielli
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index998
#arnetid1000

#*Unified Modeling Language.
#@Peter Fettke
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation2
#index999
#arnetid1001

#*Functional Integration of Decision Making Support.
#@Guisseppi A. Forgionne
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1000
#arnetid1002

#*Stickiness and Web-Based Customer Loyalty.
#@Guisseppi A. Forgionne,Supawadee Ingsriswang
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1001
#arnetid1003

#*Decision-Making Support Systems.
#@Guisseppi A. Forgionne,Manuel Mora,Jatinder N. D. Gupta,Ovsei Gelman
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation4
#index1002
#arnetid1004

#*Collaborative Learning On-Demand.
#@Giancarlo Fortino
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation2
#index1003
#arnetid1005

#*Enterprise Resource Planning for Intelligent Enterprises.
#@Jose M. Framiñan
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation2
#index1004
#arnetid1006

#*E-Mail Usage in South Pacific Distance Education.
#@Jonathan Frank,Janet Toland,Karen D. Schenk
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1005
#arnetid1007

#*Privacy-Dangers and Protections.
#@William H. Friedman
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1006
#arnetid1008

#*Usability of Online Learning Systems and Course Materials.
#@Elizabeth Furtado
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1007
#arnetid1009

#*Software Contracts for Component-Based Web Engineering.
#@Martin Gaedke,Martin Nussbaumer,Emma Tonkin
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1008
#arnetid1010

#*Translation of Natural Language Patterns to Object and Process Modeling.
#@Alexandra Galatescu
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1009
#arnetid1011

#*Client/Server and the Knowledge Directory.
#@Stuart D. Galup,Ronald Dattero,Richard C. Hicks
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1010
#arnetid1012

#*Multilingual Electronic Commerce in a Global Economy.
#@Aryya Gangopadhyay,Zhensen Huang
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1011
#arnetid1013

#*Census Data for Health Preparedness and Response.
#@Jane L. Garb,Richard B. Wait
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation1
#index1012
#arnetid1014

#*Using Geographic Information Systems to Solve Community Problems.
#@Jane L. Garb,Richard B. Wait
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation1
#index1013
#arnetid1015

#*Agent- and Web-Based Employment Marketspaces in the U.S. Department of Defense.
#@William R. Gates,Mark E. Nissen
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1014
#arnetid1016

#*Parallel and Distributed Multimedia Databases.
#@Stefan Geisler,Odej Kao
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1015
#arnetid1017

#*Knowledge, IT, and the Firm.
#@Petros Gelepithis
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1016
#arnetid1018

#*Information Systems and Systems Theory.
#@Ovsei Gelman,Manuel Mora T.,Guisseppi A. Forgionne,Francisco Cervantes-Pérez
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1017
#arnetid1019

#*Heuristics in Medical Data Mining.
#@Susan E. George
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1018
#arnetid1020

#*Optical Music Recognition with Wavelets.
#@Susan E. George
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1019
#arnetid1021

#*Marketplace Architecture for Enterprise Integration.
#@Hamada Ghenniwa,Michael N. Huhns
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1020
#arnetid1022

#*Mobile Location Services.
#@George M. Giaglis
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1021
#arnetid1023

#*Software and Systems Engineering Integration.
#@Rick Gibson
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1022
#arnetid1024

#*Ethics of New Technologies.
#@Joseph Gilbert
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1023
#arnetid1025

#*Supporting Assurnace and Compliance Monitoring.
#@Peter Goldschmidt
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1024
#arnetid1026

#*Infocratic Perspective on the Delivery of Personal Financial Services.
#@Steven Gordon,Paul Mulligan
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1025
#arnetid1027

#*Benefits and Challenges of Blended Learning Environments.
#@Charles R. Graham,Stephanie Allen,Donna Ure
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation27
#index1026
#arnetid1028

#*Computer-Mediated Learning Groups.
#@Charles R. Graham,Melanie Misanchuk
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1027
#arnetid1029

#*Quality Assurance Issues for Online Universities.
#@Floriana Grasso,Paul H. Leng
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1028
#arnetid1030

#*Consistent Queries Over Databases with Integrity Constraints.
#@Sergio Greco,Ester Zumpano
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1029
#arnetid1031

#*User Perceptions and Groupware Use.
#@Gina Green,John Day,Hao Lou,Craig Van Slyke
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1030
#arnetid1032

#*The Changing Library Education Curriculum.
#@Vicki L. Gregory
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation1
#index1031
#arnetid1033

#*Diffusion Patterns of the Internet Technology Cluster in Irish SMEs.
#@James Griffin
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1032
#arnetid1034

#*Internet Abuse and Addiction in the Workplace.
#@Mark Griffiths
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1033
#arnetid1035

#*Application Service Provision for Intelligent Enterprises.
#@Matthew W. Guah,Wendy L. Currie
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1034
#arnetid1036

#*Agents and Payment Systems in E-Commerce.
#@Sheng Uei Guan
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index1035
#arnetid1037

#*Mobile Agent Authentication and Authorization in E-Commerce.
#@Sheng Uei Guan
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1036
#arnetid1038

#*Ontology-Based Query Formation and Information Retrieval.
#@Sheng Uei Guan
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1037
#arnetid1039

#*Theoretical Framework for CRM Outsourcing.
#@Babita Gupta,Lakshmi S. Iyer
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1038
#arnetid1040

#*Packet Inter-Arrival Distributions in Computer Network Workloads.
#@Dennis Guster,David Robinson,Paul Safonov
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1039
#arnetid1041

#*Information Modeling in UML and ORM.
#@Terry A. Halpin
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1040
#arnetid1042

#*Web-Based Supply Chain Strategy.
#@Hanns-Christian L. Hanebeck
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1041
#arnetid1043

#*Metadata for Electronic Documents Using the Dublin Core.
#@Till Hänisch
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation1
#index1042
#arnetid1044

#*Overcoming Barriers in the Planning of a Virtual Library.
#@Ardis Hanson
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1043
#arnetid1045

#*Library Management and Organizational Change.
#@Ardis Hanson,Phyllis Ruscella,Kathy Arsenault,Joan Pelland,Derrie Perez,Beverly Shattuck
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1044
#arnetid1046

#*Technology of Formal Education.
#@Donald A. Hantula,Darleen M. DeRosa
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1045
#arnetid1047

#*Security Issues in Distributed Transaction Processing Systems.
#@Ramzi A. Haraty
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1046
#arnetid1048

#*Offshore Software Development Outsourcing.
#@Stephen Hawk,Kate M. Kaiser
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1047
#arnetid1049

#*Successful Health Information System Implementation.
#@Kristiina Häyrinen,Kaija Saranto
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation4
#index1048
#arnetid1050

#*Space Opera- GIS Basics.
#@Paul N. J. Hendricks
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1049
#arnetid1051

#*Chief Knowledge Officers.
#@Richard T. Herschel
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1050
#arnetid1052

#*Intelligent Software Agents.
#@Alexa Heucke,Georg Peters,Roger Tagg
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1051
#arnetid1053

#*VRML-Based System for a 3D Virtual Museum.
#@José Fernando Díez Higuera,Francisco Javier Díaz Pernas
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1052
#arnetid1054

#*Dot-Comming SMEs in Singapore for a New Economy.
#@Leo Tan Wee Hin,R. Subramaniam
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index1053
#arnetid1055

#*Electronic Government Strategies and Research in the U.S..
#@Charles C. Hinnant,Steven Burton Sawyer
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation2
#index1054
#arnetid1056

#*Process-Based Data Mining.
#@Karim K. Hirji
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1055
#arnetid1057

#*Automation of American Criminal Justice.
#@J. William Holland
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1056
#arnetid1058

#*Measurement Issues in Decision Support Systems.
#@William K. Holstein,Jakov Crnkovic
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1057
#arnetid1059
#!After a brief discussion on the history of decision-making, this chapter focuses on metrics for justifying investment in information systems and technology and for measuring business and management performance. The discussion of metrics is linked to current practices in decision support systems and focuses on the needs for future systems. With several examples drawn from contemporary practice, we introduce implementation guidelines for DSS development incorporating new metrics that go beyond ROI and Balanced Scorecard-like measures. Suggested guidelines include simplicity, selectivity, a focus on research and learning, and benchmarking. These guidelines suggest that future metrics to support decision support systems should be grouped into meaningful categories and tied more closely to system architecture.

#*ICTs as Participatory Vehicles.
#@Marc Holzer,Richard Schwester
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1058
#arnetid1060

#*Content Management in Organizations.
#@Anne Honkaranta,Pasi Tyrväinen
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation1
#index1059
#arnetid1061

#*Current Multicast Technology.
#@Gábor Hosszú
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1060
#arnetid1062

#*Technology's Role in Distance Education.
#@Caroline Howard,Murray Turoff,Richard Discenza
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1061
#arnetid1063

#*Dimensions of Database Quality.
#@John A. Hoxmeier
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation5
#index1062
#arnetid1064

#*World Wide Web Search Technologies.
#@Wen-Chen Hu,Hung-Jen Yang,Jyh-haw Yeh,Chung-wei Lee
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation8
#index1063
#arnetid1065

#*Information Systems and Small Business.
#@M. Gordon Hunter
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1064
#arnetid1066

#*Trust in Knowledge-Based Organizations.
#@Maija-Leena Huotari,Mirja Iivonen
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation2
#index1065
#arnetid1067

#*Enterprise Resource Planning and Systems Integration.
#@Mark I. Hwang
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1066
#arnetid1068

#*Instant Messaging Moves From the Home to the Office.
#@Ha Sung Hwang,Concetta M. Stewart
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1067
#arnetid1069

#*Electronic Commerce Policies for Dutch SMEs.
#@Maria-Eugenia Iacob,Piet Boekhoudt,Freek Ebeling
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index1068
#arnetid1070

#*Measuring Collaboration in Online Communications.
#@Albert L. Ingram
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1069
#arnetid1071

#*Electronic/Digital Government Innovation, and Publishing Trends with IT.
#@Yukiko Inoue,Suzanne T. Bell
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1070
#arnetid1072

#*E-Government, E-Democracy and the Politicians.
#@Birgit Jaeger
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1071
#arnetid1073

#*Simulation for Business Engineering of Electronic Markets.
#@Marijn Janssen
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1072
#arnetid1074

#*The Past, Present, and Future of End-User Performance.
#@I. M. Jawahar
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1073
#arnetid1075

#*Adoption of E-Commerce in the Value Chain by SMEs.
#@Judith Jeffcoate
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1074
#arnetid1076

#*Internet Support for Knowledge Management Systems.
#@Murray E. Jennex
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1075
#arnetid1077

#*Case-Based Learning in Computer Information Systems.
#@Morgan Jennings,Charles H. Mawhinney,Janos Fustos
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1076
#arnetid1078

#*A Language/Action Based Approach to Information Modeling.
#@Paul Johannesson
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation5
#index1077
#arnetid1079

#*Harmonizing IT and Business Strategies.
#@Kevin Johnston
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation1
#index1078
#arnetid1080
#%1009081
#!This chapter proposes that all business strategies should be harmonized into a single strategy, rather than attempt to align IT strategy with business strategy. It focuses on two hypotheses: firstly, that IT strategy is not widely aligned with business strategy; and secondly, that IT is still thought of as "something different" in businesses. The chapter proposes that rather than attempt to align IT strategy with business strategy, the strategies should be harmonized into a single strategy. The chapter attempts to use lessons from geese to outline the process of strategic development.

#*Intelligent Metabusiness.
#@Luiz Antonio Joia
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1079
#arnetid1081

#*Small Busines Transformation Through Knowledge Management.
#@Nory B. Jones,Jatinder N. D. Gupta
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1080
#arnetid1082

#*Fundamentals of Multirate Systems.
#@Gordana Jovanovic-Dolecek
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1081
#arnetid1083

#*Simple Methods for Design of Narrowband Highpass FIR Filters.
#@Gordana Jovanovic-Dolecek
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1082
#arnetid1084

#*One Method for Design of Narrowband Lowpass Filters.
#@Gordana Jovanovic-Dolecek,Javier Díaz-Carmona
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1083
#arnetid1085
#!This chapter describes a design of a narrowband lowpass finite impulse response (FIR) filter using a small number of multipliers per output sample (MPS). The method is based on the use of a frequency-improved recursive running sum (RRS), called the sharpening RRS filter, and the interpolated finite impulse response (IFIR) structure. The filter sharpening technique uses multiple copies of the same filter according to an amplitude change function (ACF), which maps a transfer function before sharpening to a desired form after sharpening. Three ACFs are used in the design, as illustrated in the accompanying examples.

#*Flexible Job-Shop Scheduling Problems.
#@Imed Kacem
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1084
#arnetid1086

#*The Software Industry in Egypt.
#@Sherif Kamel
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation1
#index1085
#arnetid1087

#*On the Relativity of Ontological Domains and Their Specifications.
#@Epaminondas Kapetanios
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1086
#arnetid1088

#*E-Collaboration Support Systems Issues to be Addressed.
#@Nikos I. Karacapilidis
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation4
#index1087
#arnetid1089

#*Cross-Cultural Research in MIS.
#@Elena Karahanna,J. Roberto Evaristo,Mark Srite
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index1088
#arnetid1090

#*Standards for Web-Based Integration Adapters.
#@Bill Karakostas
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1089
#arnetid1091

#*Interoperability in Geospatial Information Systems.
#@Hassan A. Karimi,Ratchata Peachavanish
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation1
#index1090
#arnetid1092

#*Usability and Learnability Evaluation of Web-Based ODL Programs.
#@Athanasis Karoulis,Andreas S. Pombortsis
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1091
#arnetid1093

#*Facial and Body Feature Extraction for Emotionally-Rich HCI.
#@Kostas Karpouzis,Athanasios I. Drosopoulos,Spiros Ioannou,Amaryllis Raouzaiou,Nicolas Tsapatsoulis,Stefanos D. Kollias
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1092
#arnetid1094

#*Gender and Computer Anxiety.
#@Sue E. Kase,Frank E. Ritter
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1093
#arnetid1095

#*Cache Management for Web-Powered Databases.
#@Dimitrios Katsaros,Yannis Manolopoulos
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation6
#index1094
#arnetid1096

#*E-Learning Environment.
#@Mizue Kayama,Toshio Okamoto
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index1095
#arnetid1097

#*Formal Development of Reactive Agent-Based Systems.
#@Petros Kefalas,Mike Holcombe,George Eleftherakis,Marian Gheorghe
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1096
#arnetid1098

#*Contracting Mechanisms in IS/IT Outsourcing Phenomenon.
#@Abdulwahed Mohammed Khalfan,Majed Z. Al-Hajery,Khamis Al-Gharbi
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index1097
#arnetid1099

#*Archival Issues Related to Digital Creations.
#@Mark Kieler,Michael J. West
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1098
#arnetid1100

#*Curriculum Development in Web-Based Education.
#@Johanna Lammintakanen,Sari Rissanen
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1099
#arnetid1101

#*Online Communities and Community Building.
#@Martin Christof Kindsmüller,Sandro Leuchter,Leon Urbas
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1100
#arnetid1102

#*Information Resources Development Challenges in a Cross-Cultural Environment.
#@Wai Law
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation2
#index1101
#arnetid1103
#!Organizations in the Western world devote much attention to the development of information systems as strategic resources. The transfer of this management practice to a different cultural environment generates new challenges as reported in the experience of a Pacific Basin public institution with Western affiliation, while under strong influence of local cultures and practices. The value of the investment in information resources is judged not only on technical merits, but also on the ability of the organization to properly address the cultural and organizational issues related to information usage.

#*Real Options Analysis in Strategic Information Technology Adoption.
#@Xiaotong Li
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1102
#arnetid1104

#*Virtualization and Its Role in Business.
#@Jerzy Kisielnicki
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1103
#arnetid1105
#!This chapter presents some of the aspects of virtualisation and its role in modern society. In today's world, a controlled virtualisation process creates enormous opportunity for economic growth of those countries and organisations, which, so far, due to various restrictions, have had no chance to become competitive in the global market. Those people and organisations that know how to make use of the opportunities presented by virtualisation may become more effective in business. Moreover, virtualisation creates the best options for intellectual enterprise development. Virtualisation is a very complex process. The author would like to discusses both the positive impact virtualisation can have on society and also some dangers or problems.

#*Information Technology Strategic Alignment.
#@Fernando José Barbin Laurindo,Marly Monteiro de Carvalho,Tamio Shimizu
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1104
#arnetid1106

#*Promotion of e-Government in Japan and Its Operation.
#@Ikuo Kitagaki
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1105
#arnetid1107

#*Knowledge Discovery Using Heuristics.
#@Alina Lazar
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1106
#arnetid1108

#*Artificial Neural Networks Used in Automobile Insurance Underwriting.
#@Fred L. Kitchens
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1107
#arnetid1109

#*Modeling ERP Acedemic Deployment via AST.
#@Cynthia LeRouge,Harold W. Webb
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1108
#arnetid1110

#*Scenarios for Web-Enhanced Learning.
#@Jane E. Klobas,Stefano Renzi
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation1
#index1109
#arnetid1111

#*Business Model Innovation in the Digital Economy.
#@Chung-Shing Lee
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation7
#index1110
#arnetid1112

#*Enterprise Resource Planning Maintenance Concepts.
#@Celeste See Pui Ng
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1111
#arnetid1113

#*Multimedia Content Adaption.
#@David Knight,Marios C. Angelides
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1112
#arnetid1114

#*Triangular Strategic Analysis for Hybrid E-Retailers.
#@In Lee
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1113
#arnetid1115

#*E-Commerce Curriculum.
#@Linda V. Knight,Susy S. Chan
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1114
#arnetid1116

#*Virtual Organization in the Human Mind.
#@Jinyoul Lee
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1115
#arnetid1117

#*Experiential Perspective on Knowledge Management.
#@Vivekanand P. Kochikar,J. K. Suresh
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1116
#arnetid1118

#*Mobile Commerce Technology.
#@Chung-wei Lee,Wen-Chen Hu,Jyh-haw Yeh
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1117
#arnetid1119

#*Bridging the Industry-University Gap through Action Research.
#@Ned Kock
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1118
#arnetid1120

#*Challenges in M-Commerce.
#@Pouwan Lei,Chris R. Chatwin,Rupert C. D. Young
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1119
#arnetid1121

#*Contemporary IT-Assisted Retail Management.
#@Herbert Kotzab
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index1120
#arnetid1122

#*Security and Trust of Online Auction Systems.
#@Pouwan Lei,Chris R. Chatwin,Rupert C. D. Young
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1121
#arnetid1123

#*Quality of UML.
#@John Krogstie
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation4
#index1122
#arnetid1124

#*MESH Object-Oriented Hypermedia Framework.
#@Wilfried Lemahieu
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1123
#arnetid1125

#*Usable M-Commerce Systems.
#@John Krogstie
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1124
#arnetid1126

#*Application of Fuzzy Logic Fraud Detection.
#@Mary Jane Lenard,Pervaiz Alam
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index1125
#arnetid1127

#*Structural Text Mining.
#@Vladimir A. Kulyukin,John Nicholson
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1126
#arnetid1128

#*The Impact of Sound Relationships on Achieving Alignment.
#@Awie Leonard
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1127
#arnetid1129

#*Internet Data Mining Using Statistical Techniques.
#@Kuldeep Kumar
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1128
#arnetid1130

#*Business Modelling with Client-Oriented Requirements Strategy.
#@Maria Carmen Leonardi
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index1129
#arnetid1131

#*Adaptive Mobile Applications.
#@Thomas Kunz,Abdulbaset Gaddah
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation1
#index1130
#arnetid1132

#*Technology and Work in the Virtual Organization.
#@Paul M. Leonardi
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1131
#arnetid1133

#*Enterprise Resource Planning and Integration.
#@Karl Kurbel
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1132
#arnetid1134

#*Database Support for M-Commerce.
#@Hong Va Leong
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1133
#arnetid1135

#*Minorities and the Digital Divide.
#@Lynette Kvasny,Fay Cobb Payton
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation5
#index1134
#arnetid1136

#*Eight Key Elements of Successful Self-Funding E-Learning Programs.
#@Yair Levy,Michelle M. Ramim
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1135
#arnetid1137

#*DRM Technology for Mobile Multimedia.
#@Sai Ho Kwok
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1136
#arnetid1138

#*Empirical Study of E-Commerce Adoption SMEs in Thailand.
#@Chalermsak Lertwongsatien,Nitaya Wongpinunwatana
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index1137
#arnetid1139

#*Information Resources Development in China.
#@Maosheng Lai,Xin Fu,Liyang Zhang
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1138
#arnetid1140

#*Certifying Software Product and Processes.
#@Hareton Leung
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1139
#arnetid1141

#*Comparing Conventional and Non-Parametric Option Pricing.
#@Paul Lajbcygier
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1140
#arnetid1142

#*Contextual Metadata for Document Databases.
#@Virpi Lyytikäinen,Pasi Tiitinen,Airi Salminen
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1141
#arnetid1143

#*Bayesian Machine Learning.
#@Eitel J. M. Lauría
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1142
#arnetid1144

#*Intelligent Business Portals.
#@Xue Li
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1143
#arnetid1145

#*Implementation Management of an E-Commerce-Enabled Enterprise Information System.
#@William S. Lightfoot
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1144
#arnetid1146

#*Culture and Anonymity in GSS Meetings.
#@Moez Limayem
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1145
#arnetid1147
#%1286233
#%248841
#%1286219
#%857378
#%1009158

#*Public Sector Case Study on the Benefits of IS/IT.
#@Chad Lin,Graham Pervan
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1146
#arnetid1148

#*Faculty Perceptions and Participation in Distance Education.
#@James R. Lindner,Kim E. Dooley,Chanda Elbert,Timothy H. Murphy,Theresa P. Murghrey
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1147
#arnetid1149

#*Spatial Analysis in a Public Health Setting.
#@Robert Lipton,D. M. Gorman,William F. Wieczorek,Paul Gruenewald
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation1
#index1148
#arnetid1150

#*User Experiences of the E-commerce Site with the Standard User Interface.
#@Shin-Ping Liu,Dennis Tucker
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1149
#arnetid1151

#*Newcomer Assimilation in Virtual Team Socialization.
#@Shawn D. Long,Gary F. Kohut,Gaelle Picherit-Duthler
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation2
#index1150
#arnetid1152

#*Softening the MIS Curriculum for a Technology-Based Profession.
#@Glenn Lowry,Rodney Turner
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation1
#index1151
#arnetid1153

#*Strategic Alignment of Organizational Strategies.
#@Sam Lubbe
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1152
#arnetid1154

#*Introducing Java to the IT Master's Curriculum.
#@Wendy T. Lucas
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1153
#arnetid1155

#*Inexperienced and Global Software Teams.
#@Kim Man Lui,Keith C. C. Chan
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1154
#arnetid1156

#*Simulation and Gaming in IT Education.
#@Norman Pendegraft
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1155
#arnetid1157

#*Systems Thinking and the Internet.
#@Kambiz Maani
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation1
#index1156
#arnetid1158

#*Speech and Audio Signal Applications.
#@Héctor M. Pérez Meana,Mariko Nakano-Miyatake
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1157
#arnetid1159

#*Wireless Middleware.
#@Kenneth J. MacGregor
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1158
#arnetid1160

#*Trust in B2C E-Commerce for the New Zealand Maori.
#@Konrad J. Peszynski
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1159
#arnetid1161

#*Technology Planning in Schools.
#@Julie Mackey
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation1
#index1160
#arnetid1162

#*Multimedia Information Filtering.
#@Minaz J. Parmar,Marios C. Angelides
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1161
#arnetid1163

#*Designing OMIS-Based Collaboration for Learning Organizations.
#@Kan Hou Vat
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1162
#arnetid1164

#*Personal Internet Usage and Quality of Work Life.
#@Pruthikrai Mahatanankoon
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1163
#arnetid1165

#*Trends in Information Technology Governance.
#@Ryan Peterson
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1164
#arnetid1166

#*Bridging the Digital Divide in Scotland.
#@Anna Malina
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1165
#arnetid1167

#*Critical Strategies for IS Projects.
#@Dane Peterson,Chung S. Kim
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1166
#arnetid1168

#*Behavioral Factors in Strategic Alliances.
#@Purnendu Mandal,Dale H. Shao,Chong W. Kim
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1167
#arnetid1169

#*Multiple Internet Technologies in In-Class Education.
#@Mihir A. Parikh,Neeraj Parolia
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1168
#arnetid1170

#*Business Process and Workflow Modeling in Web Services.
#@Vincent Yen
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1169
#arnetid1171

#*Signature-Based Indexing Techniques for Web Access Logs.
#@Yannis Manolopoulos,Alexandros Nanopoulos,Mikolaj Morzy,Tadeusz Morzy,Marek Wojciechowski,Maciej Zakrzewicz
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1170
#arnetid1172

#*Transfering Technology to the Developing World.
#@Stacie C. Petter,Galen Sevcik,Detmar W. Straub
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1171
#arnetid1173

#*Qos-Oriented MAC Protocols for Future Mobile Applications.
#@Alexander Markhasin,Stephan Olariu,Petia Todorova
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1172
#arnetid1174

#*Learning Systems Engineering.
#@Valentina Plekhanova
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1173
#arnetid1175

#*Delivering Web-Based Education.
#@Kathryn A. Marold
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1174
#arnetid1176

#*Object-Oriented Software Metrics.
#@Jana Polgar
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1175
#arnetid1177

#*Critical Success Factors for Distance Education Programs.
#@Ben Martz,Venkat Reddy
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1176
#arnetid1178

#*Designing Agents with Negotiation Capabilities.
#@Jana Polgar,Tony Polgar
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1177
#arnetid1179

#*INFOSEC Policy - The Foundation for an Effective Security Program.
#@Herbert J. Mattord,Michael E. Whitman
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1178
#arnetid1180

#*Decision-Making Support Systems and Representation Levels.
#@Jean-Charles Pomerol,Frédéric Adam
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index1179
#arnetid1181

#*Integrating Requirements Engineering Techniques and Formal Methods.
#@María Virginia Mauco,Daniel Riesco
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1180
#arnetid1182

#*Future of Small Business E-Commerce.
#@Simpson Poon
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1181
#arnetid1183

#*Staying Up-to-Date with Changes in IT.
#@Tanya J. McGill,Michael W. Dixon
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1182
#arnetid1184

#*Complex Adaptive Enterprises.
#@Anet Potgieter,Kurt April,Judith Bishop
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation6
#index1183
#arnetid1185

#*Success Surrogates in Representational Decision Support Systems.
#@Roger McHaney
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1184
#arnetid1186

#*Cooperation of Geographic and Multidimensional Databases.
#@Elaheh Pourabbas
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1185
#arnetid1187

#*Managing Value-Creation In The Digital Economy.
#@John C. McIntosh,Keng L. Siau
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1186
#arnetid1188

#*Hierarchies in Multidimensional Databases.
#@Elaheh Pourabbas
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1187
#arnetid1189

#*E-Mail as a Strategic Tool in Organizations.
#@Denise McManus,Houston Hume Carr
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1188
#arnetid1190

#*Decision Support Systems Concept.
#@Daniel J. Power
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index1189
#arnetid1191

#*IS Project Management Contemporary Research Challenges.
#@Maggie McPherson
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1190
#arnetid1192

#*Classification-Rule Discovery with an Ant Colony Algorithm.
#@Rafael S. Parpinelli,Heitor Silvério Lopes,Alex Alves Freitas
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation8
#index1191
#arnetid1193

#*Internet Diffusion in the Hospitality Industry.
#@Luiz Augusto Machado Mendes-Filho,Anatália Saraiva Martins Ramos
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1192
#arnetid1194

#*A Web-Geographical Information System to Support Territorial Data Integration.
#@Giuseppe Pozzi,Fabio A. Schreiber,Letizia Tanca,Luca Tosi
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1193
#arnetid1195

#*Educating the Business Information Technologist.
#@John Mendonca
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1194
#arnetid1196

#*Text Mining in the Context of Business Intelligence.
#@Hércules Antonio do Prado,José Palazzo Moreira de Oliveira,Edilson Ferneda,Leandro Krug Wives,Edilberto Magalhães Silva,Stanley Loh
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1195
#arnetid1197

#*Web Search via Learning from Relevance Feedback.
#@Xiannong Meng,Zhixiang Chen
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1196
#arnetid1198

#*Animated Characters within the MPEG-4 Standard.
#@Françoise J. Prêteux,Marius Preda
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation1
#index1197
#arnetid1199

#*Bayesian Modelling for Machine Learning.
#@Kerrie L. Mengersen,Paul Rippon
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index1198
#arnetid1200

#*Current Network Security Software.
#@Göran Pulkkis,Kaj Grahn,Peik Åström
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index1199
#arnetid1201

#*Building and Management of Trust in Information Systems.
#@István Mezgár
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1200
#arnetid1202

#*Sharing Organizational Knowledge through Knowledge Repositories.
#@Muhammad Asim Qayyum
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1201
#arnetid1203

#*Efficient Multirate Filtering.
#@Ljiljana D. Milic
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index1202
#arnetid1204

#*Basic Notions on Multidimensional Aggregate Data.
#@Maurizio Rafanelli
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation2
#index1203
#arnetid1205

#*Managing Hierarchies and Taxonomies in Relational Databases.
#@Ido Millet
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1204
#arnetid1206

#*Intelligent Software Agents in E-Commerce.
#@Mahesh S. Raisinghani,Christopher Klassen,Lawrence L. Schkade
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1205
#arnetid1207

#*Innovation Link Between Organization Knowledge and Customer Knowledge.
#@Helen J. Mitchell
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1206
#arnetid1208

#*Intelligent Agents For Competitive Advantage.
#@Mahesh S. Raisinghani,John H. Nugent
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1207
#arnetid1209

#*Technology and Knowledge Management.
#@Helen J. Mitchell
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation2
#index1208
#arnetid1210

#*E-Commerce Taxation Issues.
#@Mahesh S. Raisinghani,Dan S. Petty
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1209
#arnetid1211

#*Policy Frameworks for Secure Electronic Business.
#@Andreas Mitrakas
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation3
#index1210
#arnetid1212

#*A Socio-Technical Case Study of Bangladesh.
#@Mahesh S. Raisinghani,Mahboobur Rahman
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1211
#arnetid1213

#*Strategically-Focused Enterprise Knowledge Management.
#@Robert J. Mockler,Dorothy G. Dologite
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation2
#index1212
#arnetid1214

#*Data Mining for Supply Chain Management Complex Networks.
#@Mahesh S. Raisinghani,Manoj K. Singh
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index1213
#arnetid1215

#*Functionalities and Position of Manufacturing Execution Systems.
#@Vladimír Modrák
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index1214
#arnetid1216

#*Constructionist Perspective of Organizational Data Mining.
#@Isabel Ramos,João Alvaro Carvalho
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1215
#arnetid1217

#*Next-Generation ERP.
#@Charles Møller
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1216
#arnetid1218

#*Evolution of ERP Systems.
#@Mohammad A. Rashid
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1217
#arnetid1219

#*Database Technologies on the Web.
#@José Francisco Aldana Montes,Antonio C. Gomez Lora,Nathalie Moreno Vergara,Ismael Navas Delgado,María del Mar Roldán García
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1218
#arnetid1220

#*Modeling for E-Learning Systems.
#@Maria Alexandra Rentroia-Bonito,Joaquim Armando Pires Jorge
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1219
#arnetid1221

#*Limited-Perspective Bias in Technology Projects.
#@Jo Ellen Moore,Lisa A. Burke
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1220
#arnetid1222

#*XML Schema Integration and E-Commerce.
#@Kalpdrum Passi,Louise Lane,Sanjay Kumar Madria,Mukesh K. Mohania
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1221
#arnetid1223

#*Web Accessibility and the Law.
#@Holly Yu
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1222
#arnetid1224

#*Geospatial Information Systems and Enterprise Collaboration.
#@Donald R. Morris-Jones,Dedric A. Carter
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1223
#arnetid1225

#*Discovery of Classification Rules from Databases.
#@Graeme Richards,Beatriz de la Iglesia
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1224
#arnetid1226

#*Technological Collaboration and Trust in Virtual Teams.
#@Steven A. Morris,Thomas E. Marshall,R. Kelly Rainer Jr.
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1225
#arnetid1227

#*Change Process Drivers for E-Business.
#@Howard D. Richards,Harris Charalampos Makatsorsis,Yoon S. Chang
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index1226
#arnetid1228

#*Relating Cognitive Problem-Solving Style to User Resistance.
#@Michael J. Mullany
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1227
#arnetid1229
#%773035
#%775592
#%790595

#*Antecedents of Trust in Online Communities.
#@Catherine M. Ridings,David Gefen
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation2
#index1228
#arnetid1230

#*Digital Government and Individual Privacy.
#@Patrick R. Mullen
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation2
#index1229
#arnetid1231
#!The growth of the Internet and digital government has dramatically increased the Federal government's ability to collect, analyze, and disclose personal information about many private aspects of citizens' lives. Personal information once available only on paper to a limited number of people is now instantly retrievable anywhere in the world by anyone with a computer and an Internet connection. Over time, there has also been a declining level of trust by Americans in government, and currently, many perceive the government as a potential threat to their privacy. Given these forces at work in our society, one should not be surprised to read the results of surveys that show privacy as a top concern of citizens in the 21st century. If citizens do not believe that the government is adequately protecting the privacy of their individual information, they may be less willing to provide this information. Such reluctance could compromise the ability of government to collect important information necessary to develop, administer and evaluate the impact of various policies and programs. Privacy issues discussed in this chapter include challenges regarding (1) protecting personal privacy; (2) ensuring confidentiality of data collected; and (3) implementing appropriate security controls. Perspectives on privacy and stewardship responsibilities of agencies are also discussed.

#*Dynamic Multidimensional Data Cubes for Interactive Analysis of Massive Datasets.
#@Mirek Riedewald,Divyakant Agrawal,Amr El Abbadi
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1230
#arnetid1232

#*Virtual Work, Trust and Rationality.
#@Peter Murphy
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1231
#arnetid1233

#*Extensions to UML Using Stereotypes.
#@Daniel Riesco,Marcela Daniele,Daniel Romero,German Montejano
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index1232
#arnetid1234
#%471553
#%770779
#%243515
#%684118
#%247845
#%684154
#%243455

#*Agent-Based Negotiation in E-Marketing.
#@Venu K. Murthy,E. V. Krishnamurthy
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1233
#arnetid1235

#*Risk Management in the Digital Economy.
#@Bob Ritchie,Clare Brindley
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1234
#arnetid1236

#*Contract-Based Workflow Design Patterns in M-Commerce.
#@Venu K. Murthy,E. V. Krishnamurthy
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1235
#arnetid1237

#*Modeling Information Systems in UML.
#@Peter Rittgen
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1236
#arnetid1238

#*E-Business Transaction in Web Integrated Network Environment.
#@Venu K. Murthy,Edayathu V. Krishnamurthy
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1237
#arnetid1239

#*Inclusion Dependencies.
#@Laura C. Rivero
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1238
#arnetid1240

#*Multimedia Computing Environment for Telemedical Applications.
#@Venu K. Murthy,Edayathu V. Krishnamurthy
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation1
#index1239
#arnetid1241

#*Conducting Ethical Research in Virtual Environments.
#@Lynne D. Roberts,Leigh M. Smith,Clare M. Pollock
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1240
#arnetid1242

#*Technology-Mediated Progressive Inquiry in Higher Education.
#@Hanni Muukkonen,Minna Lakkala,Kai Hakkarainen
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation3
#index1241
#arnetid1243

#*Adaptive Playout Control Schemes for Speech over the Internet.
#@Marco Roccetti,Stefano Ferretti
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation1
#index1242
#arnetid1244

#*Issues in Delivering Course Material via the Web.
#@Karen S. Nantz
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1243
#arnetid1245

#*How Teachers Use Instructional Design in Real Classrooms.
#@Patricia Rogers
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1244
#arnetid1246

#*Strategic Experimentation and Knowledge Management.
#@Vadake K. Narayanan
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1245
#arnetid1247

#*Trends and Perspectives in Online Education.
#@Bruce Rollier,Fred Niederman
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1246
#arnetid1248

#*Evaluating Computer-Supported Learning Initiatives.
#@John B. Nash,Christoph Richter,Heidrun Allert
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1247
#arnetid1249

#*Designing Web Applications.
#@Gustavo Rossi,Daniel Schwabe
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1248
#arnetid1250

#*Innovations for Online Collaborative Learning in Mathematics.
#@Rodney Nason,Earl Woodruff
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1249
#arnetid1251

#*Shaping the Evolution of Mobile Commerce.
#@Andreas Rülke,Anand Iyer,Greg Chiasson
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1250
#arnetid1252

#*Basics of the Triune Continuum Paradigm.
#@Andrey Naumenko
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation2
#index1251
#arnetid1253

#*A University/Community Partnership to Bridge the Digital Divide.
#@David Ruppel,Cynthia P. Ruppel
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1252
#arnetid1254

#*Data Mining and Mobile Business Data.
#@Richi Nayak
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index1253
#arnetid1255

#*Virtual Schools.
#@Glenn Russell
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation8
#index1254
#arnetid1256

#*Wireless Technologies to Enable Electronic Business.
#@Richi Nayak
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1255
#arnetid1257

#*Developing Dynamic Balanced Scorecards.
#@Pallab Saha
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1256
#arnetid1258

#*Music Score Watermarking.
#@Paolo Nesi,Marius B. Spinu
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1257
#arnetid1259

#*Non-Functional Requirements and UML Stereotypes.
#@Guadalupe Salazar-Zárate,Pere Botella
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1258
#arnetid1260

#*Knowledge-Based Support Environment.
#@Karen Neville,Phillip Powell
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation1
#index1259
#arnetid1261

#*Combining Local and Global Expertise in Services.
#@Hannu Salmela,Juha Pärnistö
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1260
#arnetid1262

#*Bibliomining for Library Decision-Making.
#@Scott Nicholson,Jeffrey Stanton
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1261
#arnetid1263

#*Defining and Understanding ERP Systems.
#@David Sammon,Frédéric Adam
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1262
#arnetid1264

#*Interoperability of Information Systems.
#@Christophe Nicolle,Jean-Claude Simon,Kokou Yétongnon
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation2
#index1263
#arnetid1265

#*Survey of 3D Human Body Representations.
#@Angel Domingo Sappa,Niki Aifanti,Nikos Grammalidis,Sotiris Malassiotis
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1264
#arnetid1266

#*Classroom Communication on a Different Blackboard.
#@Jennifer Paige Nightingale
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1265
#arnetid1267

#*Implementing an Online Academic Evaluation System.
#@Joseph Sarkis,R. P. Sundarraj
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1266
#arnetid1268

#*Delineating Knowledge Flows for Enterprise Agility.
#@Mark E. Nissen
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1267
#arnetid1269

#*The Organizational Context in the Use of a Workflow System.
#@Anabela Sarmento
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1268
#arnetid1270

#*Critical Trends in Telecommunications.
#@John H. Nugent
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1269
#arnetid1271

#*Social Responsibility and the Technology Paradigm in Latin America.
#@Herberto J. Ochoa-Morales
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1270
#arnetid1272

#*Distributed Recommender Systems for Internet Commerce.
#@Badrul M. Sarwar,Joseph A. Konstan,John Riedl
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index1271
#arnetid1273

#*Model-Supported Alignment of IS Architecture.
#@Andreas L. Opdahl
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1272
#arnetid1274

#*A Primer on E-Government.
#@Shannon Howle Schelin
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation1
#index1273
#arnetid1275

#*Enhancing Workplaces with Constructine Online Recreation.
#@Jo Ann Oravec
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index1274
#arnetid1276

#*Digitization of Library Information and its Accessibilty for People with Disabilities.
#@Axel Schmetzke
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index1275
#arnetid1277

#*Progammed Instruction, Programmed Branching, and Learning Outcomes.
#@Robert S. Owen,Bosede Aworuwa
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1276
#arnetid1278

#*Software Requirements Risk and Maintainability.
#@Norman F. Schneidewind
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1277
#arnetid1279

#*Human Body Part Classification and Activity Recognition for Real-Time Systems.
#@Burak Ozer,Tiehan Lv,Wayne Wolf
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1278
#arnetid1280

#*Functional Dependency and Other Related Dependancies.
#@Robert A. Schultz
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index1279
#arnetid1281

#*Software Reuse in Hypermedia Applications.
#@Roberto Paiano
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1280
#arnetid1282

#*Computing Curriculum Analysis and Development.
#@Anthony Scime
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1281
#arnetid1283

#*Storage and Access Control Issues for XML Documents.
#@George Pallis,Konstantina Stoupa,Athena Vakali
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation3
#index1282
#arnetid1284

#*Strategies of E-Commerce Business Value Optimization.
#@Ada Scupola
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1283
#arnetid1285

#*Developing Trust in Virtual Teams.
#@Niki Panteli
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1284
#arnetid1286

#*Software Agents in E-Commerce Systems.
#@Juergen Seitz
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1285
#arnetid1287

#*New SQL Standard in Database Modeling.
#@Eric Pardede,J. Wenny Rahayu,David Taniar
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1286
#arnetid1288

#*Leader-Facilitated Relationship Building in Virtual Teams.
#@David J. Pauleen
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1287
#arnetid1289

#*Program Execution and Visualization on the Web.
#@Cristóbal Pareja-Flores,J. Ángel Velázquez-Iturbide
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation5
#index1288
#arnetid1290
#%1182782
#%590085
#%589808
#%590962
#%1322812
#%590717
#%832296
#%1322995
#%591238
#%774996
#%90375
#%794309
#%1322955
#%591090
#%590831
#%590446
#%912657
#%699214
#%640767
#%641079
#%640954
#!Programming is a demanding task with an education program that requires the assistance of complex tools such as programming environments, algorithm animators, problem graders, etc. In this chapter, we give a comprehensive presentation of tools for program execution and visualization on the Web. We summarize the technical evolution of these tools, describe educational uses, report lessons learned, and look at formal evaluations of their educational effectiveness. We also deal with a closely related matter, namely, collections of Web documents containing programming exercises. Finally, we outline our view of future trends in the use of the Web for programming education, and we give our personal conclusions. This chapter is of interest to educators and researchers, because it gives a comprehensive presentation of the main issues and results of a field where most of the contributions are sparse in the literature.

#*Metrics for Data Warehouse Quality.
#@Manuel A. Serrano,Coral Calero,Mario Piattini
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation8
#index1289
#arnetid1291

#*Institutional Dimensions of Information Systems Evaluation.
#@Vassilis Serafeimidis
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation5
#index1290
#arnetid1292

#*IT Productivity Impacts in Manufacturing Contexts.
#@Kristina Setzekorn,Arun Rai,Arlyn Melcher
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1291
#arnetid1293

#*Obstacles for SMEs for E-Adoption in the Asia Pacific Region.
#@Sushil K. Sharma,Nilmini Wickramasinghe
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1292
#arnetid1294

#*SMEs in Knowledge-Based Economies.
#@Sushil K. Sharma,Nilmini Wickramasinghe,Jatinder N. D. Gupta
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1293
#arnetid1295

#*End-User Computing Success Measurement.
#@Conrad Shayo,Ruth A. Guthrie
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index1294
#arnetid1296

#*Essentials of Functional and Object-Oriented Methodology.
#@Peretz Shoval,Judith Kabeli
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1295
#arnetid1297

#*Students' Perceptions of Online Courses.
#@Judith C. Simon,Lloyd D. Brooks,Ronald B. Wilkes
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1296
#arnetid1298

#*Information Systems and Technology in South Africa.
#@Anesh Maniraj Singh
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1297
#arnetid1299

#*Departure of the Expert Systems Project Champion.
#@Janice C. Sipior
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1298
#arnetid1300

#*The Social Contract Revised.
#@Robert Joseph Skovira
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1299
#arnetid1301

#*Observations on Implementing Specializations Within an IT Program.
#@Erick Slazinski
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1300
#arnetid1302

#*Citizenship and New Technologies.
#@Peter J. Smith,Elizabeth Smythe
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1301
#arnetid1303

#*Changing Trends in the Preparation of Print Media.
#@Mark Snyder
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1302
#arnetid1304

#*Generic Framework for Defining Domain-Specific Models.
#@Arnor Solberg,Jon Oldevik,Audun Jensvoll
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1303
#arnetid1305

#*Management of Cognitive and Affective Trust to Support Collaboration.
#@Diane H. Sonnenwald
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1304
#arnetid1306

#*Life Cycle of ERP Systems.
#@Cesar Alexandre de Souza,Ronaldo Zwicker
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1305
#arnetid1307

#*Liability for System and Data Quality.
#@Robert D. Sprague
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1306
#arnetid1308

#*Uses and Gratifications for the World Wide Web.
#@Thomas F. Stafford
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1307
#arnetid1309

#*Tailorable Information Systems.
#@Dimitrios S. Stamoulis,Dimitrios Theotokis,Drakoulis Martakos
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1308
#arnetid1310

#*Best Practices for Effective Virtual Teams.
#@D. Sandy Staples,Ian K. Wong,Ann Frances Cameron
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1309
#arnetid1311

#*System Development for E-Business.
#@Theresa A. Steinbach,Linda V. Knight
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1310
#arnetid1312

#*Public-Key Cryptography.
#@Eberhard Stickel
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1311
#arnetid1313

#*Component-Oriented Approach for Designing Enterprise Architecture.
#@Zoran Stojanovic,Ajantha Dahanayake
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1312
#arnetid1314

#*Digital Asset Management Concepts.
#@Ramesh Subramanian
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1313
#arnetid1315

#*Organizational Hypermedia Document Management Through Metadata.
#@Woojong Suh,Garp Choong Kim
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1314
#arnetid1316

#*Governance Structures for IT in the Health Care Industry.
#@Reima Suomi
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1315
#arnetid1317

#*Histogram Generation from the HSV Color Space.
#@Shamik Sural,A. Vadivel,Arun K. Majumdar
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation1
#index1316
#arnetid1318

#*Legal Expert Systems in Administrative Organizations.
#@Jörgen S. Svensson
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1317
#arnetid1319

#*Technology in the Foreign Language Classroom.
#@William J. Switala
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation1
#index1318
#arnetid1320

#*Integration Framework for Complex Systems.
#@Edward Szczerbicki
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1319
#arnetid1321

#*Personal Information Privacy and Internet Technology.
#@Edward J. Szewczak
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation2
#index1320
#arnetid1322

#*Cognitive Research in Information Systems.
#@Felix B. Tan,M. Gordon Hunter
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1321
#arnetid1323

#*Mobile Telecommunications and M-Commerce Applications.
#@Clarence N. W. Tan,Tiok-Woo Teo
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1322
#arnetid1324

#*Agent-Based Intelligence Infrastructure.
#@Zaiyong Tang,Subramanian Sivaramakrishnan
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1323
#arnetid1325

#*ERP Adoption by Indian Organizations.
#@Monideepa Tarafdar
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index1324
#arnetid1326

#*Information Laws.
#@Andrew S. Targowski
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1325
#arnetid1327

#*Cross-Culture Communication.
#@Andrew S. Targowski,Ali Metwalli
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1326
#arnetid1328

#*Bridging the Growing Digital Divide.
#@Ionnis Tarnanas,Vassilios Kikis
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1327
#arnetid1329

#*Actor-Network Theory in Information Systems Research.
#@Arthur Tatnall
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation114
#index1328
#arnetid1330

#*Modelling Technological Change in Small Business.
#@Arthur Tatnall
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1329
#arnetid1331

#*Actor-Network Theory and Adoption of E-Commerce in SMEs.
#@Arthur Tatnall,Stephen Burgess
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation1
#index1330
#arnetid1332

#*Ecological Models and Information Systems Curriculum.
#@Arthur Tatnall,Bill Davey
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1331
#arnetid1333

#*Knowledge Exchange in Electronic Networks of Practice.
#@Robin Teigland,Molly McLure Wasko
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1332
#arnetid1334

#*Designing Hypertext and the Web.
#@Yin Leng Theng
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index1333
#arnetid1335

#*Business Strategy, Structure and IT Alignment.
#@Petros Theodorou
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1334
#arnetid1336

#*Building Local Capacity via Scaleable Web-Based Services.
#@Helen Thompson
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1335
#arnetid1337

#*Querying Multidimensional Data.
#@Leonardo Tininini
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1336
#arnetid1338
#%145180
#%145038
#%484520
#%545094
#%1065442
#%950880
#%598304
#%544889
#%544945
#%544778
#%597957
#%641852
#%299360
#%641889
#%159888
#%617840
#%176266
#%598303
#%642285
#%1064719
#%176154
#%544986
#%1128174
#%598680
#%159960
#%832546
#%300022
#%580432
#%642688
#%642699
#%1065090
#%642865
#%176452
#%618097
#%95644
#%972499
#%545337
#%255796
#%1065420
#%599433
#%1118587
#%1065458
#%643602
#%176521
#%1129485
#%643807
#%176614
#%1118706
#%96032
#%600013
#!A powerful and easy-to-use querying environment is certainly one of the most important components in a multidimensional database, and its effectiveness is influenced by many other aspects, both logical (data model, integration, policy of view materialization, etc.) and physical (multidimensional or relational storage, indexes, etc.). As is evident, multidimensional querying is often based on the metaphor of the data cube and on the concepts of facts, measures, and dimensions. In contrast to conventional transactional environments, multidimensional querying is often an exploratory process, performed by navigating along the dimensions and measures, increasing/decreasing the level of detail and focusing on specific subparts of the cube that appear to be "promising" for the required information.In this chapter we focus on the main languages proposed in the literature to express multidimensional queries, particularly those based on: (i) an algebraic approach, (ii) a declarative paradigm (calculus), and (iii) visual constructs and syntax. We analyze the problem of evaluation, i.e., the issues related to the efficient data retrieval and calculation, possibly (often necessarily) using some pre-computed data, a problem known in the literature as the problem of rewriting a query using views. We also illustrate the use of particular index structures to speed up the query evaluation process.

#*Improving Virtual Teams Through Creativity.
#@Teresa Torres-Coronas,Mila Gascó-Hernández
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1337
#arnetid1339

#*Leapfrogging an IT Sector.
#@Eileen M. Trauth
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1338
#arnetid1340

#*Qualitative Methods in IS Research.
#@Eileen M. Trauth
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1339
#arnetid1341

#*E-Business Systems Security for Intelligent Enterprise.
#@Denis Trcek
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1340
#arnetid1342

#*Implementing the Shared Event Paradigm.
#@Dirk Trossen,Erik Molenaar
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1341
#arnetid1343

#*Audience-Driven Web Site Design.
#@Olga De Troyer
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1342
#arnetid1344

#*Web Tools for Molecular Biological Data Analysis.
#@Denise Fukumi Tsunoda,Heitor Silvério Lopes,Ana Tereza R. Vasconcelos
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1343
#arnetid1345

#*Monitoring Strategies for Internet Technologies.
#@Andrew Urbaczewski
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation-1
#index1344
#arnetid1346

#*Digital Literacy and the Position of the End-User.
#@Steven Utsi,Joost Lowyck
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1345
#arnetid1347

#*Intranet Use and Emergence of Networks of Practice.
#@Emmanuelle Vaast
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1346
#arnetid1348

#*Metrics for the Evaluation of Test Delivery Systems.
#@Salvatore Valenti
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1347
#arnetid1349

#*Face Expression and Motion Analysis over Monocular Images.
#@Ana C. Andrés del Valle
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1348
#arnetid1350

#*Artificial Neural Networks in Financial Trading.
#@Bruce J. Vanstone,Clarence N. W. Tan
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation3
#index1349
#arnetid1351

#*Surveying Mobile Commerce Environments.
#@Jari Veijalainen,Mathias Weske
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1350
#arnetid1352

#*Content-Based Image Retrieval Query Paradigms.
#@Colin C. Venters,Richard J. Hartley,William T. Hewitt
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1351
#arnetid1353

#*Analyzing the Quality of Virtual Teams.
#@Robert M. Verburg,J. H. Erik Andriessen,Joris P. G. de Rooij
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index1352
#arnetid1354

#*Bayesian Analysis of Geographical Variation in Disease Risk.
#@Carmen L. Vidal-Rodeiro,M. I. Santiago-Pérez,E. Vázquez-Fernández,María Esther López-Vizcaíno,Xurxo Hervada-Vidal
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation-1
#index1353
#arnetid1355

#*Simulation in Information Systems Research.
#@Theresa M. Vitolo,Chris Coulston
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1354
#arnetid1356

#*Cluster Analysis Using Rough Clustering and k-Means Clustering.
#@Kevin E. Voges
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation1
#index1355
#arnetid1357

#*Networks and Electronic Commerce Adoption in Small Businesses.
#@Lejla Vrazalic,Robert Mac Gregor,Deborah Bunker
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1356
#arnetid1358

#*Information and Communication Technology Tools for Competitive Intelligence.
#@Dirk Vriens
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation3
#index1357
#arnetid1359

#*Supporting the Evaluation of Intelligent Sources.
#@Dirk Vriens
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1358
#arnetid1360

#*Data Dissemination in Mobile Databases.
#@Agustinus Borgy Waluyo,Bala Srinivasan,David Taniar
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index1359
#arnetid1361

#*Trust in B2C E-Commerce Interface.
#@Ye Diana Wang
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1360
#arnetid1362

#*GIS-Based Accessibility Measures and Application.
#@Fahui Wang,Wei Lou
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1361
#arnetid1363

#*IT Industry Success in Finland and New Zealand.
#@Rebecca Watson
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1362
#arnetid1364

#*Enhanced Knowledge Warehouse.
#@Krzysztof Wecel,Witold Abramowicz,Pawel Jan Kalczynski
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation1
#index1363
#arnetid1365

#*Learning 3D Face Animation Model.
#@Zhen Wen,Pengyu Hong,Jilin Tu,Thomas S. Huang
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1364
#arnetid1366

#*E-Governement Interoperability.
#@Dirk Werth
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation-1
#index1365
#arnetid1367

#*Data Collection Methodologies for Web-Based Experiments.
#@Stu Westin
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1366
#arnetid1368

#*Ethical Implications of Investigating Internet Relationships.
#@Monica T. Whitty
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1367
#arnetid1369

#*"Anytime, Anywhere" in the Context of Mobile Work.
#@Mikael Wiberg
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation2
#index1368
#arnetid1370

#*Knowledge Discovery Solutions for Intelligent Enterprises.
#@Nilmini Wickramasinghe,Sushil K. Sharma
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1369
#arnetid1371

#*Evaluating IS Quality as a Measure of IS Effectiveness.
#@Carla Wilkin
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1370
#arnetid1372

#*E-Mail and Communication.
#@Dianne Willis
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation3
#index1371
#arnetid1373

#*IT Implementation in Small Business.
#@Elaine R. Winston,Dorothy G. Dologite
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1372
#arnetid1374

#*Trust in Virtual Enterprises.
#@T. T. Wong
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1373
#arnetid1375

#*Designing High Performance Virtual Teams.
#@Ian K. Wong,D. Sandy Staples
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1374
#arnetid1376

#*Improving Public Sector Service Delivery through Knowledge Sharing.
#@Gillian H. Wright,W. Andrew Taylor
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1375
#arnetid1377

#*Traversal Pattern Mining in Web Usage Data.
#@Jenq-Foung Yao,Zongqiao Xiao
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1376
#arnetid1378

#*Applying a Metadata Framework to Improve Data Quality.
#@Victoria Y. Yoon,Peter Aiken,Tor Guimaraes
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation0
#index1377
#arnetid1379

#*Java 2 Micro Edition for Wireless Enterprose.
#@Kin Choong Yow,Nadia Nalaningrum Moertiyoso
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1378
#arnetid1380

#*Distributed Construction through Participatory Design.
#@Panayiotis Zaphiris,Andrew Laghos,Giorgos Zacharia
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1379
#arnetid1381

#*Tactic Knowledge and Discourse Analysis.
#@Michele Zappavigna-Lee,Jon Patrick
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation-1
#index1380
#arnetid1382

#*Advanced Techniques for Object-Based Image Retrieval.
#@Yu-Jin Zhang
#year2005
#confEncyclopedia of Information Science and Technology (I)
#citation1
#index1381
#arnetid1383

#*Knowledge Management on the Web.
#@Ruidong Zhang
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation1
#index1382
#arnetid1384

#*Neural Networks for Retail Sales Forecasting.
#@Guoqiang Peter Zhang
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation0
#index1383
#arnetid1385

#*New Advancements in Image Segmentation for CBIR.
#@Yu-Jin Zhang
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation2
#index1384
#arnetid1386

#*The Impact of IT on Business Partnerships and Organizational Structures.
#@Fang Zhao
#year2005
#confEncyclopedia of Information Science and Technology (V)
#citation0
#index1385
#arnetid1387

#*Open Source Software Development Model.
#@Luyin Zhao,Fadi P. Deek
#year2005
#confEncyclopedia of Information Science and Technology (IV)
#citation2
#index1386
#arnetid1388

#*Fault Tolerance for Distributed and Networked Systems.
#@Wenbing Zhao,Louise E. Moser,P. M. Melliar-Smith
#year2005
#confEncyclopedia of Information Science and Technology (II)
#citation0
#index1387
#arnetid1389

#*Isochronus Distributed Multimedia Synchronization.
#@Zhonghua Yang,Yanyan Yang,Yaolin Gu,Robert K. L. Gay
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation0
#index1388
#arnetid1390

#*Integrated-Services Architecture for Building Internet Multimedia Applications.
#@Zhonghua Yang,Yanyan Yang,Yaolin Gu,Robert K. L. Gay
#year2005
#confEncyclopedia of Information Science and Technology (III)
#citation-1
#index1389
#arnetid1391

#*Knowledge Discovery from Databases.
#@José Hernández-Orallo
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1390
#arnetid1392

#*Discovering Association Rules in Temporal Databases.
#@Juan M. Ale,Gustavo Rossi
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1391
#arnetid1393

#*Kernelized Database Systems Security.
#@Ramzi A. Haraty
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1392
#arnetid1394

#*Collective Knowledge Composition in a P2P Network.
#@Boanerges Aleman-Meza,Christian Halaschek-Wiener,Ismailcem Budak Arpinar
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1393
#arnetid1395

#*E-Government Databases.
#@Catherine Horiuchi
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1394
#arnetid1396

#*Converting a Legacy Database to Object-Oriented Database.
#@Reda Alhajj,Faruk Polat
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1395
#arnetid1397

#*E-Mail Data Stores.
#@Catherine Horiuchi
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1396
#arnetid1398

#*Proper Placement of Derived Classes in the Class Hierarchy.
#@Reda Alhajj,Faruk Polat
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1397
#arnetid1399

#*Replication Mechanisms Over a Set of Distributed UDDI Registries.
#@Zakaria Maamar
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1398
#arnetid1400

#*Logic Databases and Inconsistency Handling.
#@José A. Alonso-Jiménez,Joaquín Borrego-Díaz,Antonia M. Chávez-González
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1399
#arnetid1401

#*High Quality Conceptual Schemes.
#@Esko Marjomaa
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1400
#arnetid1402

#*A Rhetorical Perspective on Localization and International Outsourcing.
#@Kirk St. Amant
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1401
#arnetid1403

#*Hierarchical Architecture of Expert Systems for Database Management.
#@R. Manjunath
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1402
#arnetid1404

#*Ontological Assumptions in Information Modeling.
#@John M. Artz
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation2
#index1403
#arnetid1405

#*Intension Mining.
#@Héctor Oscar Nigro,Sandra Elizabeth González Císaro
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1404
#arnetid1406

#*Integrative Document and Content Management Systems Architecture.
#@Len Asprey,Rolf Green,Michael Middleton
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1405
#arnetid1407

#*Dataveillance and Panoptic Marketspaces.
#@Nikhilesh Dholakia,Detlev Zwick,Anil M. Pandya
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1406
#arnetid1408

#*Advanced Query Optimization.
#@Antonio Badia
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1407
#arnetid1409

#*Main Memory Databases.
#@Matthias Meixner
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1408
#arnetid1410

#*Business Rules in Databases.
#@Antonio Badia
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1409
#arnetid1411

#*Database Replication Protocols.
#@Francesc D. Muñoz-Escoí,Luis Irún-Briz,Hendrik Decker
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1410
#arnetid1412

#*Data Warehouses.
#@Antonio Badia
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1411
#arnetid1413

#*Text Databases.
#@Gonzalo Navarro
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation2
#index1412
#arnetid1414

#*Relational, Object-Oriented and Object-Relational Data Models.
#@Antonio Badia
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1413
#arnetid1415

#*Online Data Mining.
#@Héctor Oscar Nigro,Sandra Elizabeth González Císaro
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1414
#arnetid1416

#*Extended Entity Relationship Modeling.
#@Sikha Bagui
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1415
#arnetid1417

#*Symbolic Objects and Symbolic Data Analysis.
#@Héctor Oscar Nigro,Sandra Elizabeth González Císaro
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1416
#arnetid1418

#*Integration of Data Semantics in Heterogeneous Database Federations.
#@Herman Balsters
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1417
#arnetid1419

#*Query Operators in Temporal XML Databases.
#@Kjetil Nørvåg
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1418
#arnetid1420

#*Raster Databases.
#@Peter Baumann
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1419
#arnetid1421
#!Since the launch of Google Earth at the latest it is clear that online services for multi-Terabyte satellite imagery are becoming integral part of our Internet experience. Actually, 2-D imagery is but the tip of the iceberg - the general concept of multi-dimensional spatio-temporal raster data covers 1-D sensor time series, 2-D imagery, 3-D image time series (x/y/t) and exploration data (x/y/z), 4-D climate models (x/y/z/t), and many more.

#*Ensuring Serializability for Mobile-Client Data Caching.
#@Shin Parker,Zhengxin Chen
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1420
#arnetid1422

#*Databases for Mobile Applications.
#@Indranil Bose,Wang Ping,Mok Wai Shan,Wong Ka Shing,Yip Yee Shing,Chan Lit Tin,Shiu Ka Wai
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1421
#arnetid1423

#*Rough Sets.
#@Zdzislaw Pawlak,Lech Polkowski,Andrzej Skowron
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1422
#arnetid1424

#*Data Model Versioning and Database Evolution.
#@Hassina Bounif
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1423
#arnetid1425

#*Vertical Database Design for Scalable Data Mining.
#@William Perrizo,Qiang Ding,Masum Serazi,Taufik Abidin,Baoying Wang
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1424
#arnetid1426

#*Ontology-Based Data Integration.
#@Agustina Buccella,Alejandra Cechich,Nieves R. Brisaboa
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation2
#index1425
#arnetid1427

#*Database Support for Workflow Management Systems.
#@Francisco A. C. Pinheiro
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1426
#arnetid1428

#*Real-Time Databases.
#@Alejandro P. Buchmann
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1427
#arnetid1429

#*Object Modeling of RDBMS Based Applications.
#@Giuseppe Polese,Vincenzo Deufemia,Gennaro Costagliola,Genny Tortora
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1428
#arnetid1430

#*Business-to-Business Integration.
#@Christoph Bussler
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1429
#arnetid1431

#*Knowledge Mining.
#@Mahesh S. Raisinghani
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1430
#arnetid1432

#*Enterprise Application Integration.
#@Christoph Bussler
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1431
#arnetid1433

#*Moving Objects Databases.
#@Maria Andrea Rodríguez-Tastets
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation5
#index1432
#arnetid1434

#*Database Engineering Focusing on Modern Dynamism Crises.
#@Luiz Camolesi Jr.,Marina Teresa Pires Vieira
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1433
#arnetid1435

#*Multimedia Databases.
#@Mariana Hentea
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1434
#arnetid1436

#*Using Views to Query XML Documents.
#@Mario Cannataro,Sophie Cluet,Giuseppe Tradigo,Pierangelo Veltri,Dan Vodislav
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1435
#arnetid1437

#*Open Source Software and Information Systems on the Web.
#@Antonio Cartelli
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1436
#arnetid1438

#*Set Valued Attributes.
#@Karthikeyan Ramasamy,Prasad M. Deshpande
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1437
#arnetid1439

#*Normalizing Multimedia Databases.
#@Shi-Kuo Chang,Vincenzo Deufemia,Giuseppe Polese
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1438
#arnetid1440

#*Consistency in Spatial Databases.
#@Maria Andrea Rodríguez-Tastets
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1439
#arnetid1441

#*Metric Databases.
#@Edgar Chávez,Gonzalo Navarro
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation2
#index1440
#arnetid1442

#*Storing XML Documents in Databases.
#@Albrecht Schmidt,Stefan Manegold,Martin L. Kersten
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1441
#arnetid1443

#*Path-Oriented Queries and Tree Inclusion Problems.
#@Yangjun Chen
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1442
#arnetid1444

#*Ubiquitous Computing and Databases.
#@George Roussos,Michael Zoumboulakis
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1443
#arnetid1445

#*Signature Files and Signature File Construction.
#@Yangjun Chen,Yong Shi
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1444
#arnetid1446

#*Semantic Information Management.
#@David G. Schwartz,Zvi Schreiber
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1445
#arnetid1447

#*Sensors, Uncertainty Models, and Probabilistic Queries.
#@Reynold Cheng,Sunil Prabhakar
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation4
#index1446
#arnetid1448

#*Data Warehousing and OLAP.
#@José Hernández-Orallo
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1447
#arnetid1449

#*The Information Quality of Databases.
#@InduShobha N. Chengalur-Smith,M. Pamela Neely,Thomas Tribunella
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation2
#index1448
#arnetid1450

#*Text Categorization.
#@Fabrizio Sebastiani
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1449
#arnetid1451

#*Active Database Management Systems.
#@Mariano Cilia
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1450
#arnetid1452

#*Querical Data Networks.
#@Cyrus Shahabi,Farnoush Banaei Kashani
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1451
#arnetid1453

#*Query Processing in Spatial Databases.
#@Antonio Corral,Michael Vassilakopoulos
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1452
#arnetid1454

#*Extraction-Transformation-Loading Processes.
#@Alkis Simitsis,Panos Vassiliadis,Timos K. Sellis
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1453
#arnetid1455

#*Free Software and Open Source Databases.
#@Hugo J. Curti
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1454
#arnetid1456

#*Open Source Database Management Systems.
#@Sulayman K. Sowe,Ioannis Samoladas,Ioannis Stamelos
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1455
#arnetid1457

#*Set Comparison in Relational Query Languages.
#@Mohammad Dadashzadeh
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1456
#arnetid1458

#*Biological Data Mining.
#@George Tzanis,Christos Berberidis,Ioannis P. Vlahavas
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation5
#index1457
#arnetid1459

#*Deriving Spatial Integrity Constraints from Geographic Application Schemas.
#@Clodoveu A. Davis,Karla A. V. Borges,Alberto H. F. Laender
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1458
#arnetid1460

#*Query Processing for RDF Data.
#@Heiner Stuckenschmidt
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1459
#arnetid1461

#*Data Warehousing, Multi-Dimensional Data Models, and OLAP.
#@Prasad M. Deshpande,Karthikeyan Ramasamy
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1460
#arnetid1462

#*Modeling and Querying Temporal Data.
#@Abdullah Uz Tansel
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1461
#arnetid1463

#*Temporal Databases.
#@Mahesh S. Raisinghani,Christopher Klassen
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1462
#arnetid1464

#*Benchmarking and Data Generation in Moving Objects Databases.
#@Theodoros Tzouramanis
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1463
#arnetid1465

#*Mathematics of Generic Specifications for Model Management, I.
#@Zinovy Diskin
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation11
#index1464
#arnetid1466

#*Spatio-Temporal Indexing Techniques.
#@Michael Vassilakopoulos,Antonio Corral
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1465
#arnetid1467

#*Mathematics of Generic Specifications for Model Management, II.
#@Zinovy Diskin
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation11
#index1466
#arnetid1468

#*Active Federated Database Systems.
#@Genoveva Vargas-Solar
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1467
#arnetid1469

#*Generic Model Management.
#@Zinovy Diskin,Boris Kadish
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation10
#index1468
#arnetid1470

#*Digital Media Warehouses.
#@Menzo Windhouwer,Martin L. Kersten
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1469
#arnetid1471

#*Semantically Modeled Enterprise Databases.
#@Cheryl L. Dunn,Severin V. Grabski
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1470
#arnetid1472

#*Biometric Databases.
#@Mayank Vatsa,Richa Singh,Phalguni Gupta,A. K. Kaushik
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1471
#arnetid1473

#*Knowledge Discovery and Geographical Databases.
#@Sami Faïz
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1472
#arnetid1474

#*Multiparticipant Decision Making and Balanced Scorecard Collaborative.
#@Daniel Xodo
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1473
#arnetid1475

#*Semantic Enrichment of Geographical Databases.
#@Sami Faïz,Khaoula Mahmoudi
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1474
#arnetid1476

#*Knowledge Management in Tourism.
#@Daniel Xodo,Héctor Oscar Nigro
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1475
#arnetid1477

#*Syntactical and Semantical Correctness of Pictorial Queries for GIS.
#@Fernando Ferri,Maurizio Rafanelli
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation2
#index1476
#arnetid1478

#*Ontologies and Their Practical Implementation.
#@Gian Piero Zarri
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1477
#arnetid1479

#*Data Dissemination.
#@Ludger Fiege
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1478
#arnetid1480

#*Using Semantic Web Tools for Ontologies Construction.
#@Gian Piero Zarri
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1479
#arnetid1481

#*Repairing Inconsistent XML Data with Functional Dependencies.
#@Sergio Flesca,Filippo Furfaro,Sergio Greco,Ester Zumpano
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1480
#arnetid1482

#*Geometric Quality in Geographic Information.
#@José Francisco Zelasco,Gaspar Porta,José Luis Fernandez Ausinaga
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1481
#arnetid1483

#*Managing Inconsistent Databases Using Active Integrity Constraints.
#@Sergio Flesca,Sergio Greco,Ester Zumpano
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1482
#arnetid1484

#*Object-Relational Modeling in the UML.
#@Jaroslav Zendulka
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation3
#index1483
#arnetid1485

#*Replication Methods and Their Properties.
#@Lars Frank
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation3
#index1484
#arnetid1486

#*Service Mechanism Quality for Enhanced Mobile Multimedia Database Query Processing.
#@Yanpu Zhang,Zhengxin Chen
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1485
#arnetid1487

#*Transaction Concurrency Methods.
#@Lars Frank
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1486
#arnetid1488

#*Common Information Model.
#@James A. Fulton
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1487
#arnetid1489

#*Document Versioning in Digital Libraries.
#@M. Mercedes Martínez-González
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1488
#arnetid1490

#*Multilevel Databases.
#@Alban Gabillon
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1489
#arnetid1491

#*Component-Based Generalized Database Index Model.
#@Ashraf Gaffar
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1490
#arnetid1492

#*An XML Multi-Tier Pattern Dissemination System.
#@Ashraf Gaffar,Ahmed Seffah
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1491
#arnetid1493

#*Bioinformatics Data Management and Data Mining.
#@Boris Galitsky
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1492
#arnetid1494

#*Natural Language Front-End for a Database.
#@Boris Galitsky
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1493
#arnetid1495

#*Applying Database Techniques to the Semantic Web.
#@María del Mar Roldán García,Ismael Navas Delgado,José Francisco Aldana Montes
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1494
#arnetid1496

#*Preferred Repairs for Inconsistent Databases.
#@Sergio Greco,Cristina Sirangelo,Irina Trubitsyna,Ester Zumpano
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation22
#index1495
#arnetid1497

#*Rewriting and Efficient Computation of Bound Disjunctive Datalog Queries.
#@Sergio Greco,Ester Zumpano
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation3
#index1496
#arnetid1498

#*Rewriting and Efficient Computation of Bound Disjunctive Datalog Queries.
#@Sergio Greco,Ester Zumpano
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation3
#index1497
#arnetid1499

#*Transformation-Based Database Engineering.
#@Jean-Luc Hainaut
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation19
#index1498
#arnetid1500

#*CASE Tools for Database Engineering.
#@Jean-Luc Hainaut,Jean Henrard,Jean-Marc Hick,Didier Roland,Vincent Englebert
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1499
#arnetid1501

#*Checking Integrity Constraints in a Distributed Database.
#@Hamidah Ibrahim
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1500
#arnetid1502

#*Optimization of Continual Queries.
#@Sharifullah Khan
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1501
#arnetid1503

#*Security Controls for Database Technology and Applications.
#@Zoltán Kincses
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1502
#arnetid1504

#*Similarity Search in Time Series Databases.
#@Maria Kontaki,Apostolos N. Papadopoulos,Yannis Manolopoulos
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1503
#arnetid1505

#*Database Query Personalization.
#@Georgia Koutrika
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation1
#index1504
#arnetid1506

#*Data Quality Assessment.
#@Juliusz L. Kulikowski
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation2
#index1505
#arnetid1507

#*A Development Environment for Customer-Oriented Web Business.
#@Choongseok Lee,Woojong Suh,Heeseok Lee
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation-1
#index1506
#arnetid1508

#*Transactional Support for Mobile Databases.
#@Hong Va Leong
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1507
#arnetid1509

#*Engineering Information Modeling in Databases.
#@Zongmin Ma
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1508
#arnetid1510

#*Fuzzy Database Modeling.
#@Zongmin Ma
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1509
#arnetid1511

#*Semistructured Data and its Conceptual Models.
#@Murali Mani,Antonio Badia
#year2005
#confEncyclopedia of Database Technologies and Applications
#citation0
#index1510
#arnetid1512

#*Management of Large Moving Objects Datasets: Indexing, Benchmarking and Uncertainty in Movement Representation.
#@Talel Abdessalem,Cédric du Mouza,José Moreira,Philippe Rigaux
#year2005
#confSpatial Databases
#citation2
#index1511
#arnetid1513

#*Approximate Computation of Distance-Based Queries.
#@Antonio Corral,Michael Vassilakopoulos
#year2005
#confSpatial Databases
#citation0
#index1512
#arnetid1514

#*Spatiotemporal Prediction using Data Mining Tools.
#@Margaret H. Dunham,Nathaniel Ayewah,Zhigang Li,Kathryn Bean,Jie Huang
#year2005
#confSpatial Databases
#citation3
#index1513
#arnetid1515

#*Object-Relational Spatial Indexing.
#@Hans-Peter Kriegel,Martin Pfeifle,Marco Pötke,Thomas Seidl,Jost Enderle
#year2005
#confSpatial Databases
#citation5
#index1514
#arnetid1516

#*Integrating Web Data and Geographic Knowledge into Spatial Databases.
#@Alberto H. F. Laender,Karla A. V. Borges,Joyce C. P. Carvalho,Claudia Bauzer Medeiros,Altigran Soares da Silva,Clodoveu A. Davis
#year2005
#confSpatial Databases
#citation8
#index1515
#arnetid1517

#*Spatial Joins: Algorithms, Cost Models and Optimization Techniques.
#@Nikos Mamoulis,Yannis Theodoridis,Dimitris Papadias
#year2005
#confSpatial Databases
#citation-1
#index1516
#arnetid1518

#*Quadtree-Based Image Representation and Retrieval.
#@Maude Manouvrier,Marta Rukoz,Geneviève Jomier
#year2005
#confSpatial Databases
#citation0
#index1517
#arnetid1519

#*Similarity Learning in GIS: An Overview of Definitions, Prerequisites and Challenges.
#@Giorgos Mountrakis,Peggy Agouris,Anthony Stefanidis
#year2005
#confSpatial Databases
#citation0
#index1518
#arnetid1520

#*Survey on Spatial Data Modelling Approaches.
#@Jose Ramon Rios Viqueira,Nikos A. Lorentzos,Nieves R. Brisaboa
#year2005
#confSpatial Databases
#citation6
#index1519
#arnetid1521

#*Indexing Multi-Dimensional Trajectories for Similarity Queries.
#@Michail Vlachos,Marios Hadjieleftheriou,Eamonn J. Keogh,Dimitrios Gunopulos
#year2005
#confSpatial Databases
#citation0
#index1520
#arnetid1522

#*Mining in Spatiotemporal Databases.
#@Junmei Wang,Wynne Hsu,Mong-Li Lee
#year2005
#confSpatial Databases
#citation0
#index1521
#arnetid1523

#*Applications of Moving Objects Databases.
#@Ouri Wolfson,Eduardo Mena
#year2005
#confSpatial Databases
#citation4
#index1522
#arnetid1524

#*Simple and Incremental Nearest-Neighbor Search for Spatiotemporal Databases.
#@Katerina Raptopoulou,Apostolos N. Papadopoulos,Yannis Manolopoulos
#year2005
#confSpatial Databases
#citation0
#index1523
#arnetid1525

#*Source Integration for Data Warehousing.
#@Andrea Calì,Domenico Lembo,Maurizio Lenzerini,Riccardo Rosati
#year2003
#confMultidimensional Databases
#citation-1
#index1524
#arnetid1526
#%182918
#%62603
#%545094
#%845948
#%1118134
#%544889
#%544945
#%599984
#%567106
#%544892
#%544778
#%832301
#%544838
#%642024
#%845594
#%182895
#%12172
#%12171
#%559797
#%2304
#%621652
#%299694
#%299949
#%938487
#%1112812
#%300034
#%1065090
#%598860
#%545154
#%950747
#%938582
#%950882
#%599085
#%643121
#%982289
#%938725
#%643213
#%938818
#%982326
#%300826
#%643522
#%176564
#%300902
#%1113440
#%1138173
#%304145
#%137913
#%95975
#%808476
#%982378
#!While the main goal of a data warehouse is to provide support for data analysis and management's decisions, a fundamental aspect in design of a data warehouse system is the process of acquiring the raw data from a set of relevant information sources. We will call source integration system the component of a data warehouse system dealing with this process. The main goal of a source integration system is to deal with the transfer of data from the set of sources constituting the application-oriented operational environment, to the data warehouse. Since sources are typically autonomous, distributed, and heterogeneous, this task has to deal with the problem of cleaning, reconciling, and integrating data coming from the sources. The design of a source integration system is a very complex task, which comprises several different issues. The purpose of this chapter is to discuss the most important problems arising in the design of a source integration system, with special emphasis on schema integration, processing queries for data integration, and data cleaning and reconciliation.

#*Incomplete Information in Multidimensional Databases.
#@Curtis E. Dyreson,Torben Bach Pedersen,Christian S. Jensen
#year2003
#confMultidimensional Databases
#citation4
#index1525
#arnetid1527
#%1118499
#%1065442
#%641852
#%641953
#%1112325
#%1064657
#%642169
#%642452
#%299966
#%1065004
#%642654
#%300022
#%598831
#%1112876
#%642865
#%618097
#%1118505
#%1113206
#%2344
#%300740
#%643488
#%643487
#%938917
#%95887
#%643754
#%96032
#%644052
#%1113785
#!While incomplete information is endemic to real-world data, current multidimensional data models are not engineered to manage incomplete information in base data, derived data, and dimensions. This chapter presents several strategies for managing incomplete information in multidimensional databases. Which strategy to use is dependent on the kind of incomplete information present, and also on where it occurs in the multidimensional database. A relatively simple strategy is to replace incomplete information with appropriate, complete information. The advantage of this strategy is that all multidimensional databases can manage complete information. Other strategies require more substantial changes to the multidimensional database. One strategy is to reflect the incompleteness in computed aggregates, which is possible only if the multidimensional database allows incomplete values in its hierarchies. Another strategy is to measure the amount of incompleteness in aggregated values by tallying how much uncertain information went into their production.

#*Privacy in Multidimensional Databases.
#@Francesco M. Malvestuto,Marina Moscarini
#year2003
#confMultidimensional Databases
#citation4
#index1526
#arnetid1528
#%837173
#%832194
#%864128
#%1061099
#%950001
#%1112552
#%133
#%1059410
#%1059607
#%1113181
#%1118525
#%618123
#%1059908
#%620
#%492
#!When answering queries that ask for, summary statistics, the query-system of a multidimensional database should guard confidential data, that is, it should avoid revealing (directly or indirectly) individual data, which could be exactly calculated or accurately estimated from the values of answered queries. In order to prevent the disclosure of confidential data, the query-system should be provided with an auditing procedure which, each time a new query is processed, checks that its answer does not allow a (knowledgeable) user to disclose any sensitive data. A promising approach consists in keeping track of (or auditing) answered queries by means a dynamic graphical data structure, here called the answer map, whose size increases with the number of answered queries and with the number of dimensions of the database, so that the problem of the existence of an efficient auditing procedure naturally arises. This chapter reviews recent results on this problem for "additive" queries (such as COUNT and SUM queries) by listing some polynomially solvable problems as well as some hard problems, and suggests directions for future work.

#*Time in Multidimensional Databases.
#@Alberto O. Mendelzon,Alejandro A. Vaisman
#year2003
#confMultidimensional Databases
#citation7
#index1527
#arnetid1529
#%145248
#%145182
#%950880
#%159980
#%145143
#%303896
#%643281
#%2000
#%160161
#%96032
#%176658
#!In spite of the obvious importance of time in data warehousing and OLAP, current commercial systems do not support tracking the history of a data warehouse, either at the schema or instance level. In this chapter we address this issue, introducing the Temporal Multidimensional Model and a query language, denoted TOLAP, allowing expressing temporal OLAP queries at a high level of abstraction. Further, we show that previous work in temporal databases needs to be extended in order to handle evolution and versioning in OLAP. Finally, we present an implementation, along with preliminary experimental results.

#*Materialized Viewsin Multidimensional Databases.
#@Stefano Paraboschi,Giuseppe Sindoni,Elena Baralis,Ernest Teniente
#year2003
#confMultidimensional Databases
#citation2
#index1528
#arnetid1530

#*Cooperation with Geographic Databases.
#@Elaheh Pourabbas
#year2003
#confMultidimensional Databases
#citation17
#index1529
#arnetid1531
#%971271
#%299360
#%617815
#%176266
#%617943
#%642556
#%300022
#%642699
#%618097
#%1118587
#%1113382
#%618225
#%385460
#%617685
#%95887
#%599849
#%493
#!The purpose of this chapter is to create cooperation between geographic databases (GDBs) and multidimensional databases (MDDBs), which are considered as the most promising and efficient information technologies for supporting decision making. We focus on the common key elements between geographic and multidimensional data which allow effective support in data cooperating. These elements are basically time and space, which are present implicitly or explicitly in MDDB and are modeled on the dimensions, Time and Location. Thus, because GDBs are primarily concerned with geographic data, we will focus on space as a bridge element for cooperating MDDBs and GDBs. We propose an approach that extends the geographic data structure through special attributes, called binding attributes, in order to describe all phenomena represented by MDDBs. This extension will make it possible to answer more specific "OLAP-based" queries within GDBs without modifying the physical organization of data in both environments.

#*Hierarchies.
#@Elaheh Pourabbas,Maurizio Rafanelli
#year2003
#confMultidimensional Databases
#citation4
#index1530
#arnetid1532
#!In this chapter we will focus on the rules of aggregation hierarchies in analysis dimensions of a cube. We give an overview of the related works on the basic concepts of the different types of aggregation hierarchies. We then discuss the hierarchies from two different points of view: mapping between domain values and hierarchical structures. In relation to them, we introduce the characterization of some OLAP operators on hierarchies and give a set of operators that concern the change in the hierarchy structure. Finally, we propose an enlargement of the operator set concerning hierarchies.

#*Basic Notions.
#@Maurizio Rafanelli
#year2003
#confMultidimensional Databases
#citation2
#index1531
#arnetid1533
#%150489
#%1118668
#%950880
#%641852
#%299360
#%617884
#%617946
#%1128174
#%300056
#%642699
#%598831
#%176452
#%1118525
#%643261
#%618192
#%1118587
#%938917
#%618223
#%1113382
#%618225
#%643749
#%95887
#%1129485
#%643754
#%301347
#!This chapter presents the basic notions regarding multidimensional (aggregate) databases by referring to different definitions given for them in the literature. It illustrates the important concepts of micro, macro, and metadata; presents a formal definition of the aggregation process, discussing the concepts of dimension and dimension hierarchies; describes the multidimensional aggregate data structure, distinguishing between simple, complex, and composite structure; illustrates the different types of null values; and discusses differences and similarities which exist between multidimensional aggregate data (generally called statistical data because they are used mainly by statisticians) and the On-Line-Analytic Processing (OLAP) of multidimensional data represented by different data cubes, also discussing the different (symmetric and nonsymmetric) treatment of dimensions and measures required by OLAP and aggregate multidimensional databases. Finally it discusses a graph model and a tabular model for this kind of data, and gives a set of definitions regarding the OLAP terminology.

#*Operators for Multidimensional Aggregate Data.
#@Maurizio Rafanelli
#year2003
#confMultidimensional Databases
#citation6
#index1532
#arnetid1534
#%145038
#%1065442
#%599467
#%950880
#%299360
#%617884
#%617840
#%617946
#%1128174
#%300022
#%642699
#%598970
#%176452
#%618097
#%95644
#%618147
#%618192
#%1118587
#%938917
#%618223
#%1065459
#%1113382
#%618225
#%643749
#%95887
#%1129485
#%600013
#!In this chapter the author proposes the different approaches for defining operators able to manipulate this multidimensional structure. In particular, he initially considers operators for multidimensional aggregate data which extend relational algebra and relational calculus (the so-called enlarged relational model). Then he discusses operators for multidimensional aggregate data defined in a tabular environment. In both the cases the author defines such data as statistical (aggregate) data. Subsequently he introduces the operators for OLAP applications, giving a terminology correspondence between the multidimensional aggregate (statistical) databases and OLAP areas. Then he defines the fundamental operators deduced from the previous ones, which form the basic algebra for the manipulation of multidimensional aggregate data, giving their formal definitions and some explanatory examples.

#*Dynamic Multidimensional Data Cubes.
#@Mirek Riedewald,Divyakant Agrawal,Amr El Abbadi
#year2003
#confMultidimensional Databases
#citation1
#index1533
#arnetid1535
#%598070
#%950325
#%641953
#%1064719
#%642256
#%832609
#%300056
#%304022
#%598831
#%598867
#%599137
#%643154
#%599385
#%301029
#%545430
#%269249
#%951821
#!Data cubes are ubiquitous tools in data warehousing, online analytical processing, and decision support applications. Based on a selection of pre-computed and materialized aggregate values, they can dramatically speed up aggregation and summarization over large data collections. Traditionally, the emphasis has been on lowering query costs with little regard to maintenance, i.e., update cost issues. We argue that current trends require data cubes to be not only query-efficient, but also dynamic at the same time, and we also show how this can be achieved. Several array-based techniques with different tradeoffs between query and update cost are discussed in detail. We also survey selected approaches for sparse data and the popular data cube operator, CUBE. Moreover, this work includes an overview of future trends and their impact on data cubes.

#*Multidimensionality in Statistical, OLAP, and Scientific Databases.
#@Arie Shoshani
#year2003
#confMultidimensional Databases
#citation2
#index1534
#arnetid1536
#%145038
#%883525
#%140458
#%598017
#%832253
#%176266
#%938347
#%300022
#%1138049
#%598831
#%642938
#%1113037
#%95606
#%618097
#%643488
#%95759
#%833031
#%643698
#%643749
#%1129485
#%643752
#%95887
#%618322
#%96063
#!The term "multidimensional databses" refers to data that can be viewed conceptually in a multidimensional space, where each dimension represents some attributes of the data. Viewing data in this form is natural for many applications, yet the concepts are not treated in a uniform way in the database literature. In this chapter, we show the commonality of concepts between three database areas: statistical, OLAP, and scientific databases. We show that these domains have two main structural concepts: the cross-product space of the dimensions, and the classification hierarchy structure associated with each dimension. In the first part of this chapter we describe how these structures are sed to represent data in statistical and OLAP databases and how summarization operators can be applied to them. Further, we discuss how these structures can be extended to represent related information using federated database concepts. In the second part of the chapter we show that these concepts are common to many scientific database application. In particular, we discuss the importance of supporting classification structures and the difficulty in representing them as tables in relational databases. We also discuss data structures to support multidimensional databases, emphasizing space-time representation, clustering in multidimensional space, indexing in multidimensional space, and supporting classification structures. We conclude by arguing that the concepts of multidimensionality and classification structures as well as the operation over them should be elevated to "first class" object types. These object types should be visible by the application user explicitly in the conceptual schemas as well as exposing them in the user interfaces.

#*Querying Multidimensional Data.
#@Leonardo Tininini
#year2003
#confMultidimensional Databases
#citation0
#index1535
#arnetid1537
#!A powerful and easy-to-use querying environment is certainly one of the most important components in a multidimensional database, and its effectiveness is influenced by many other aspects, both logical (data model, integration, policy of view materialization, etc.) and physical (multidimensional or relational storage, indexes, etc.). As is evident, multidimensional querying is often based on the metaphor of the data cube and on the concepts of facts, measures, and dimensions. In contrast to conventional transactional environments, multidimensional querying is often an exploratory process, performed by navigating along the dimensions and measures, increasing/decreasing the level of detail and focusing on specific subparts of the cube that appear to be "promising" for the required information.In this chapter we focus on the main languages proposed in the literature to express multidimensional queries, particularly those based on: (i) an algebraic approach, (ii) a declarative paradigm (calculus), and (iii) visual constructs and syntax. We analyze the problem of evaluation, i.e., the issues related to the efficient data retrieval and calculation, possibly (often necessarily) using some pre-computed data, a problem known in the literature as the problem of rewriting a query using views. We also illustrate the use of particular index structures to speed up the query evaluation process.

#*Conceptual Multidimensional Models.
#@Riccardo Torlone
#year2003
#confMultidimensional Databases
#citation23
#index1536
#arnetid1538
#%1491954
#%150489
#%150380
#%145038
#%151019
#%1065775
#%641852
#%299360
#%190
#%617884
#%176266
#%617840
#%642285
#%1064719
#%1064738
#%183090
#%642452
#%598713
#%300022
#%642699
#%598831
#%642865
#%176452
#%618094
#%618097
#%95644
#%643281
#%618205
#%938917
#%1113382
#%599558
#%183943
#%95887
#%197
#%618281
#!A variety of multidimensional data models have recently been proposed by both academic and industry communities. but consensus on formalism or even a common terminology has not yet emerged. In this chapter, we first discuss the requirements that an ideal conceptual multidimensional model should fulfill. These requirements are suggested by general information system modeling principles and the specific characteristics of OLAP applications. Building on these requirements, we then present a general conceptual multidimensional data model and show how it can be used to describe the basic aspects of a business application in a way that is easy to understand and independent of the criteria for actual data organization in the various systems. Starting from the characteristics of the model proposed, we summarize the general features that a multidimensional conceptual model should support. We then survey various multidimensional models proposed and relate their characteristics to these general features. Finally, we discuss the main points raised in the chapter and some problems that remain to be solved in this context.

#*Towards an Autopoietic Approach for Information Systems Development.
#@El-Sayed Abou-Zeid
#year2001
#confInformation Modeling in the New Millennium
#citation-1
#index1537
#arnetid1539

#*Business Action and Information Modeling - the Task of the Next Millennium.
#@Pär J. Ågerfalk,Göran Goldkuhl
#year2001
#confInformation Modeling in the New Millennium
#citation-1
#index1538
#arnetid1540

#*Event Modeling.
#@Lars Bækgaard
#year2001
#confInformation Modeling in the New Millennium
#citation9
#index1539
#arnetid1541

#*Information System Design Based on Reuse of Conceptual Components.
#@Paola Bertolazzi,Maria Grazia Fugini,Barbara Pernici
#year2001
#confInformation Modeling in the New Millennium
#citation1
#index1540
#arnetid1542

#*An Environment for Managing Enterprise Domain Ontology.
#@Zhan Cui,Michael Cox,Dean M. Jones
#year2001
#confInformation Modeling in the New Millennium
#citation1
#index1541
#arnetid1543

#*Spatial and Topological Data Models.
#@Ying Deng,Peter Z. Revesz
#year2001
#confInformation Modeling in the New Millennium
#citation0
#index1542
#arnetid1544

#*Coherent, Consistent, and Comprehensive Modeling of Communication, Information, Action, and Organization.
#@Jan L. G. Dietz
#year2001
#confInformation Modeling in the New Millennium
#citation3
#index1543
#arnetid1545

#*A Unifying Translation of Natural Language Patterns to Object and Process Modeling.
#@Alexandra Galatescu
#year2001
#confInformation Modeling in the New Millennium
#citation-1
#index1544
#arnetid1546

#*An Information Management Environment Based on the Model of Object Primitives.
#@Nektarios Georgalas
#year2001
#confInformation Modeling in the New Millennium
#citation0
#index1545
#arnetid1547

#*Designing Model-Based Intelligent Dialogue Systems.
#@Dina Goren-Bar
#year2001
#confInformation Modeling in the New Millennium
#citation5
#index1546
#arnetid1548

#*Conceptual Modeling Process and the Notion of a Concept.
#@Pramila Gupta,James A. Sykes
#year2001
#confInformation Modeling in the New Millennium
#citation11
#index1547
#arnetid1549

#*Integrating Fact-oriented Modeling with Object-oriented Modeling.
#@Terry A. Halpin
#year2001
#confInformation Modeling in the New Millennium
#citation11
#index1548
#arnetid1550

#*A Language/action Based Approach to Information Modeling.
#@Paul Johannesson
#year2001
#confInformation Modeling in the New Millennium
#citation5
#index1549
#arnetid1551

#*From Information Model to Controllable Implementation.
#@Hilary J. Kahn,Nick Filer
#year2001
#confInformation Modeling in the New Millennium
#citation1
#index1550
#arnetid1552

#*Modeling of Customers' Interactive Control of Service Processes.
#@Heiko Ludwig
#year2001
#confInformation Modeling in the New Millennium
#citation0
#index1551
#arnetid1553

#*On the Convergence of Analysis and Design Methods for Multi-agent, Component-based and Object-oriented systems.
#@Bernard Moulin
#year2001
#confInformation Modeling in the New Millennium
#citation0
#index1552
#arnetid1554

#*Requirements for Web Engineering Methodologies.
#@Harri Oinas-Kukkonen,Toni Alatalo,Jouko Kaasila,Henri Kivelä,Sami Sivunen
#year2001
#confInformation Modeling in the New Millennium
#citation8
#index1553
#arnetid1555

#*A Genre-Based Method for Information Systems Planning.
#@Tero Päivärinta,Veikko Halttunen,Pasi Tyrväinen
#year2001
#confInformation Modeling in the New Millennium
#citation18
#index1554
#arnetid1556

#*Metrics for Managing Quality in Information Modeling.
#@Mario Piattini,Marcela Genero,Coral Calero,Macario Polo,Francisco Ruiz
#year2001
#confInformation Modeling in the New Millennium
#citation2
#index1555
#arnetid1557

#*Preface.
#@Matti Rossi,Keng Siau
#year2001
#confInformation Modeling in the New Millennium
#citation-1
#index1556
#arnetid1558

#*Object-Oriented Web Applications Modeling.
#@Gustavo Rossi,Daniel Schwabe
#year2001
#confInformation Modeling in the New Millennium
#citation10
#index1557
#arnetid1559

#*Information Modeling in the Internet Age - Challenges, Issues, and Research Directions.
#@Keng Siau,Matti Rossi
#year2001
#confInformation Modeling in the New Millennium
#citation-1
#index1558
#arnetid1560

#*Conceptual Web Site Modeling.
#@Bernhard Strauch,Robert Winter
#year2001
#confInformation Modeling in the New Millennium
#citation2
#index1559
#arnetid1561

#*Information Models for Document Engineering.
#@James A. Thom
#year2001
#confInformation Modeling in the New Millennium
#citation1
#index1560
#arnetid1562

#*Audience-driven Web Design.
#@Olga De Troyer
#year2001
#confInformation Modeling in the New Millennium
#citation55
#index1561
#arnetid1563

#*A Systematic Relationship Analysis for Modeling Information Domains.
#@Joonhee Yoo,Michael Bieber
#year2001
#confInformation Modeling in the New Millennium
#citation5
#index1562
#arnetid1564

#*HMT: Modeling Interactive and Adaptive Hypermedia Applications.
#@Peter Zoller
#year2001
#confInformation Modeling in the New Millennium
#citation-1
#index1563
#arnetid1565

#*Mapping UML Techniques to Design Activities.
#@Ashley A. Bush,Sandeep Purao
#year2001
#confInformation Modeling in the New Millennium
#citation3
#index1564
#arnetid1566

#*Seamless Formalizing the UML Semantics through Metamodels.
#@José Luis Fernández Alemán,José Ambrosio Toval Álvarez
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation5
#index1565
#arnetid1567

#*The Whole-Part Relationship in the Unified Modeling Language: A New Approach.
#@Franck Barbier,Brian Henderson-Sellers,Andreas L. Opdahl,Martin Gogolla
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation-1
#index1566
#arnetid1568

#*Temporal OCL Meeting Specification Demands for Business Components.
#@Stefan Conrad,Klaus Turowski
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation35
#index1567
#arnetid1569

#*A Systematic Approach to Transform UML Static Models to Object-Oriented Code.
#@Liliana Favre,Silvia Clerici
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation9
#index1568
#arnetid1570

#*An Interactive Viewpoint on the Role of UML.
#@Dina Q. Goldin,David Keil,Peter Wegner
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation17
#index1569
#arnetid1571

#*Supplementing UML with concepts from ORM.
#@Terry A. Halpin
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation14
#index1570
#arnetid1572

#*Systematic Design of Web Applications with UML.
#@Rolf Hennicker,Nora Koch
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation47
#index1571
#arnetid1573

#*RUP - A process model for working with UML.
#@Wolfgang Hesse
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation16
#index1572
#arnetid1574

#*Extension of the Unified Modeling Language for Mobile Agents.
#@Cornel Klein,Andreas Rausch,Marc Sihling,Zhaojun Wen
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation28
#index1573
#arnetid1575

#*Using a Semiotic Framework to Evaluate UML for the Development of Models of High Quality.
#@John Krogstie
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation31
#index1574
#arnetid1576

#*Rendering Distributed Systems in UML.
#@Patricia Lago
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation4
#index1575
#arnetid1577

#*Linking UML with Integrated Formal Techniques.
#@Jing Liu,Jin Song Dong,Brendan P. Mahony,Kun Shi
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation6
#index1576
#arnetid1578

#*Data Modeling And UML.
#@Devang Shah,Sandra Slaughter
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation2
#index1577
#arnetid1579

#*Rational Unified Process and Unified Modeling Language - A GOMS Analysis.
#@Keng Siau
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation1
#index1578
#arnetid1580

#*Preface.
#@Keng Siau,Terry A. Halpin
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation-1
#index1579
#arnetid1581

#*UML Modeling Support for Early Reuse Decisions in Component-Based Development.
#@J. A. Sykes,P. Gupta
#year2001
#confUnified Modeling Language: Systems Analysis, Design and Development Issues
#citation6
#index1580
#arnetid1582

#*Modeling of Business Rules for Active Database Application Specification.
#@Youssef Amghar,Madjid Meziane,André Flory
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation4
#index1581
#arnetid1583
#%832924
#%1118163
#%1118216
#%642546
#%74099
#%1077768
#%1138101
#%176430
#%2617
#%597983
#%771140
#%1064851
#%772599
#%795360
#%191
#%599845
#!Active database applications require the classic cycle of analysis, design, prototyping and implementation. During analysis and design steps of the information system engineering process, modeling behavior is an important task. This task is both essential and crucial when information system is centered on active databases, which allow the replacement of parts of application programs with active rules. For that reason, the specification of business rules during analysis and design steps becomes an actual requirement. Business rules ensure the well-functioning of information system. They are descriptive (integrity constraints) or functional (derivation rules and active rules). To relieve programmers from using either traditional or ad hoc techniques to design active databases, it is necessary to develop new techniques to model business rules. These techniques have to enhance the specification of dynamic aspect through a high-level description language able to express precisely and completely rule semantic. In this chapter, we propose a uniform approach to model business rules (active rules, integrity constraints, etc.). To improve the behavior specification we extend the state diagrams that are widely used for dynamic modeling. This extension is a transformation of state transitions according to rule semantics. In addition, we outline new functionalities of Computer-Aided System Engineering (CASE) to take into consideration the active database specificities. In this way, the designer can be assisted to control, maintain and reuse a set of rules.

#*CMU-WEB: A Conceptual Model with Metrics for Testing and Designing Usability in Web Applications.
#@Akhilesh Bajaj,Ramayya Krishnan
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation0
#index1582
#arnetid1584
#%1498019
#%776544
#%772031
#%773009
#%256641
#%770060
#%668373
#%795628
#%928823
#%659492
#%1120068
#%806144
#!With the ubiquitous availability of browsers and Internet access, the last few years have seen a tremendous growth in the number of applications being developed on the World Wide Web (WWW). Models for analyzing and designing these applications are only just beginning to emerge. In this work, we propose a three-dimensional classification space for WWW applications, consisting of a degree of structure of pages dimension, a degree of support for interrelated events dimension and a location of processing dimension. Next, we propose usability design metrics for WWW applications along the structure of pages dimension. To measure these, we propose CMU-WEB-a conceptual model that can be used to design WWW applications, such that its schema provide values for the design metrics. This work represents the first effort, to the best of our knowledge, to provide a conceptual model that measures quantifiable metrics that can be used for the design of more usable Web applications, and that can also be used to compare the usability of existing Web applications, without empirical testing.

#*Enforcing Cardinality Constraints in the ER Model with Integrity Methods.
#@Mira Balaban,Peretz Shoval
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation3
#index1583
#arnetid1585
#%845863
#%979731
#%845635
#%137068
#%643112
#!Entity-Relationship (ER) schemas include cardinality constraints that restrict the dependencies among entities within a relationship type. The cardinality constraints have direct impact on application transactions, since insertions or deletions of entities or relationships might affect related entities. Application transactions can be strengthened to preserve the consistency of a database with respect to the cardinality constraints in a schema. Yet, once an ER schema is translated into a logical database schema, the direct correlation between the cardinality constraints and application transaction is lost, since the components of the ER schema might be decomposed among those of the logical database schema.We suggest extending the Enhanced-ER (EER) data model with integrity methods that can enforce the cardinality constraints. The integrity methods can be fully defined by the cardinality constraints, using a small number of primitive update methods, and are automatically created for a given EER diagram. A translation of an EER schema into a logical database schema can create integrity routines by translating the primitive update methods alone. These integrity routines may be implemented as database procedures, if a relational DBMS is utilized, or as class methods, if an object-oriented DBMS is utilized.

#*Algorithm Development, Simulation Analysis, and Parametric Studies for Data Allocation in Distributed Database Systems.
#@Amita Goyal Chin
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation0
#index1584
#arnetid1586
#%982200
#%95156
#%1118731
#%117
#%299594
#%95078
#%1112629
#%617360
#%642044
#%813312
#%812851
#%813967
#%1118181
#%1065664
#%1127840
#!In a distributed database system, an increase in workload typically necessitates the installation of additional database servers followed by the implementation of expensive data reorganization strategies. We present the Partial REALLOCATE and Full REALLOCATE heuristics for efficient data reallocation. Complexity is controlled and cost minimized by allowing only incremental introduction of servers into the distributed database system. Using first simple examples and then, a simulator, our framework for incremental growth and data reallocation in distributed database systems is shown to produce near optimal solutions when compared with exhaustive methods.

#*Object-Oriented Database Benchmarks.
#@Jérôme Darmont,Michel Schneider
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation1
#index1585
#arnetid1587
#%149845
#%951043
#%599303
#%521950
#%176335
#%642568
#%172895
#%771261
#%599859
#%303963
#%1073689
#%176233

#*The Role of Use Cases in the UML: A Review and Research Agenda.
#@Brian Dobing,Jeffrey Parsons
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation3
#index1586
#arnetid1588
#%832641
#%776687
#%979731
#%774929
#%2610
#%2617
#%522328
#%521804
#!A use case is a description of a sequence of actions constituting a complete task or transaction in an application. Use cases were first proposed by Jacobson (1987) and have since been incorporated as one of the key modeling constructs in the UML(Booch, Jacobson, & Rumbaugh, 1999) and the Unified Software Development Process(Jacobson, Booch, & Rumbaugh, 1999). This chapter traces the development of use cases, and identifies a number of problems with both their application and theoretical underpinnings. From an application perspective, the use-case concept is marked by a high degree of variety in the level of abstraction versus implementation detail advocated by various authors. In addition, use cases are promoted as a primary mechanism for identifying objects in an application, even though they focus on processes rather than objects. Moreover, there is an apparent inconsistency between the so-called naturalness of object models and the commonly held view that use cases should be the primary means of communicating and verifying requirements with users. From a theoretical standpoint, the introduction of implementation issues in use cases can be seen as prematurely anchoring the analysis to particular implementation decisions. In addition, the fragmentation of objects across use cases creates conceptual difficulties in developing a comprehensive class diagram from a set of use cases. Moreover, the role of categorization in human thinking suggests that class diagrams may serve directly as a good mechanism for communicating and verifying application requirements with users. We conclude by outlining a framework for further empirical research to resolve issues raised in our analysis.

#*Object-Process Methodology Applied to Modeling Credit Card Transactions.
#@Dov Dori
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation24
#index1587
#arnetid1589
#%776819
#%773044
#%835490
#%1129194
#%2617
#!Object-Process Methodology (OPM) is a system development and specification approach that combines the major system aspects-function, structure and behavior-within a single graphic and textual model. Having applied OPM in a variety of domains, this chapter specifies an electronic commerce system in a hierarchical manner, at the top of which are the processes of managing a generic product supply chain before and after the product is manufactured. Focusing on the post-product supply chain management, we gradually refine the details of the fundamental, almost "classical" electronic commerce interaction between the retailer and the end-customer, namely payment over the Internet using the customer's credit card. The specification results in a set of Object-Process Diagrams and a corresponding equivalent set of Object-Process Language sentences. The synergy of combining structure and behavior within a single formal model, expressed both graphically and textually, yields a highly expressive system modeling and specification tool. The comprehensive, unambiguous treatment of this basic electronic commerce process is formal, yet intuitive and clear, suggesting that OPM is a prime candidate for becoming a common standard vehicle for defining, specifying, and analyzing electronic commerce and supply chain management systems.

#*Information Analysis in UML and ORM: A Comparison.
#@Terry A. Halpin
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation5
#index1588
#arnetid1590
#%2348
#%979793
#%845565
#%845777
#%938550
#%160571
#%183299
#%182780
#%184028
#%182778
#%73897
#%979731
#%1548
#%1570
#!Since its adoption by the Object Management Group as a language for object-oriented analysis and design, the Unified Modeling Language (UML) has become widely used for designing object-oriented code. However, UML has had only minimal adoption among practitioners for the purposes of information analysis and database design. One main reason for this is that the class diagrams used in UML for data modeling provide only weak, and awkward, support for the kinds of business rules found in data-intensive applications. Moreover, UML's graphical language does not lend itself readily to verbalization and multiple instantiation for validating data models with domain experts. These defects can be remedied by using a fact-oriented approach for information analysis, from which UML class diagrams may be derived. Object-Role Modeling (ORM) is currently the most popular fact-oriented modeling approach. This chapter examines the relative strengths and weaknesses of UML and ORM for conceptual data modeling, and indicates how models in one notation can be translated into the other.

#*Cooperative Query Processing via Knowledge Abstraction and Query Relaxation.
#@Soon-Young Huh,Kae-Hyun Moon,Jin-Kyun Ahn
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation-1
#index1589
#arnetid1591
#%47549
#%982157
#%440198
#%299736
#%643755
#%1113267
#%1112620
#%1113265
#%1113657
#%1128444
#%925396
#%1120224
#!As database users adopt a query language to obtain information from a database, a more intelligent query answering system is increasingly needed that cooperates with the users to provide informative responses by understanding the intent behind a query. The effectiveness of decision support would improve significantly if the query answering system returned approximate answers rather than a null information response when there is no matching data available. Even when exact answers are found, neighboring information is still useful to users if the query is intended to explore some hypothetical information or abstract general fact. This chapter proposes an abstraction hierarchy as a framework to practically derive such approximate answers from ordinary everyday databases. It provides a knowledge abstraction database to facilitate the approximate query answering. The knowledge abstraction database specifically adopts an abstraction approach to extract semantic data relationships from the underlying database, and uses a multi-level hierarchy for coupling multiple levels of abstraction knowledge and data values. In cooperation with the underlying database, the knowledge abstraction database allows the relaxation of query conditions so that the original query scope can be broadened and thus information approximate to exact answers can be obtained. Conceptually abstract queries can also be posed to provide a less rigid query interface. A prototype system has been implemented at KAIST and is being tested with a personnel database system to demonstrate the usefulness and practicality of the knowledge abstraction database in ordinary database systems.

#*Ternary Relationships: Semantic Requirements and Logically Correct Alternatives.
#@Trevor H. Jones,Il-Yeol Song
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation1
#index1590
#arnetid1592
#%151666
#%845835
#%183560
#%95243
#%95241
#%1118533

#*A Case Study of the Use of the Viable System Model in the Organization of Software Development.
#@Peter Kawalek,David Graham Wastell
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation2
#index1591
#arnetid1593
#%200760
#!This chapter considers the usefulness of the Viable System Model (VSM) in the study of organizational adaptation. The VSM is a rigorous organizational model that was developed from the study of cybernetics and has been given considerable attention by management science research. The chapter presents a longitudinal case study that focuses upon a software development team. The VSM was useful in diagnosing the likely consequences of different organizational designs and in prescribing an alternative solution.

#*Using Weakly Structured Documents at the User-Interface Level to Fill in a Classical Database.
#@Frédérique Laforest,André Flory
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation2
#index1592
#arnetid1594
#%1138031
#%2294
#%594941
#%32170
#%793881
#%598225
#%598385
#%595197
#%183151
#%642616
#%1065304
#%595776
#%29623
#%595160
#%1118461
#%95272
#%1064650
#%559865
#%775644
#!Electronic documents have become a universal way of communication due to Web expansion. But using structured information stored in databases is still essential for data coherence management, querying facilities, etc. We thus face a classical problem-known as "impedance mismatch" in the database world; two antagonist approaches have to collaborate. Using documents at the end-user interface level provides simplicity and flexibility. But it is possible to take documents as data sources only if helped by a human being; automatic document analysis systems have a significant error rate. Databases are an alternative as semantics and format of information are strict; queries via SQL provide 100% correct responses. The aim of this work is to provide a system that associates document capture freedom with database storage structure.The system we propose does not intend to be universal. It can be used in specific cases where people usually work with technical documents dedicated to a particular domain. Our examples concern medicine and more explicitly medical records. Computerization has very often been rejected by physicians because it necessitates too much standardization and form-based user interfaces are not easily adapted to their daily practice. In this domain, we think that this study provides a viable alternative approach. This system offers freedom to doctors; they would fill in documents with the information they want to store, in a convenient order and in a freer way. We have developed a system that allows a database to fill in quasi-automatically from documents paragraphs.The database used is an already existing database that can be queried in a classical way for statistical studies or epidemiological purposes. In this system, the document fund and the database containing extractions from dccuments coexist. Queries are sent to the database, answers include data from the database and references to source documents.

#*Extending UML for Space- and Time-Dependent Applications.
#@Rosanne Price,Nectaria Tryfona,Christian S. Jensen
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation7
#index1593
#arnetid1595
#%149263
#%232926
#%883525
#%883666
#%938374
#%183777
#%635333
#%232870
#%627581
#%74762
#%979731
#%1113270
#%232832
#%232897
#%684506

#*Changing the Face of War through Telemedicine and Mobile E-commerce.
#@James A. Rodger,Parag C. Pendharkar,Mehdi Khosrowpour
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation0
#index1594
#arnetid1596
#%247188
#%1009060
#%1009036
#%776514
#%1008999
#%1009038
#%1008940
#%807324

#*FOOM - Functional and Object-Oriented Methodology for Analysis and Design of Information Systems.
#@Peretz Shoval,Judith Kabeli
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation1
#index1595
#arnetid1597
#%845863
#%979731
#%2617
#%684783
#%913330
#%191
#%938976
#!FOOM is an integrated methodology for analysis and design of information systems, which combines the two essential software-engineering paradigms: the functional- (or process-) oriented approach and the object-oriented (OO) approach. In FOOM, system analysis includes both functional and data modeling activities, thereby producing both a functional model and a data model. These activities can be performed either by starting with functional analysis and continuing with data modeling, or vice versa. FOOM products of the analysis phase include:a)a hierarchy of OO-DFDs (object-oriented data flow diagrams), and b) an initial object schema, which can be created directly from the user requirements specification or from an entity-relationship diagram (ERD) that is mapped to that object schema. System design is performed according to the OO approach. The products of the design phase include: a) a complete object schema, consisting of the classes and their relationships, attributes, and method interfaces; b) object classes for the menus, forms and reports; and c) a behavior schema, which consists of detailed descriptions of the methods and the application transactions, expressed in pseudo-code and message diagrams. The seamless transition from analysis to design is attributed to ADISSA methodology, which facilitates the design of the menus, forms and reports classes, and the system behavior schema, from DFDs and the application transactions.

#*The Psychology of Information Modeling.
#@Keng Siau
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation6
#index1596
#arnetid1598
#%248057
#%772930
#%183321
#%74653
#%74654
#%938979
#%118991
#%112
#%772803
#!Information modeling is the cornerstone of information systems analysis and design. Information models, the products of information modeling, not only provide the abstractions required to facilitate communication between the analysts and end-users, but they also provide a formal basis for developing tools and techniques used in information systems development. The process of designing, constructing, and adapting information modeling methods for information systems development is known as method engineering. Despite the pivotal role of modeling methods in successful information systems development, most modeling methods are designed based on common sense and intuition of the method designers with little or no theoretical foundation or empirical evidence. Systematic scientific approach is missing! This chapter proposes the use of cognitive psychology as a reference discipline for information modeling and method engineering. Theories in cognitive psychology are reviewed in this chapter and their application to information modeling and method engineering is discussed.

#*How Complex Is the Unified Modeling Language?
#@Keng Siau,Qing Cao
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation8
#index1597
#arnetid1599
#%248057
#%996491
#%773402
#%979762
#%979793
#%840057
#%74653
#%74654
#%979731
#%979745
#%938979
#%1071883
#%1578
#%1129799
#%769822
#!Unified Modeling Language (UML)has emerged as the software industry's dominant modeling language. It is the de facto modeling language standard for specifying, visualizing, constructing, and documenting the components of software systems. Despite its prominence and status as the standard modeling language, UML has its critics. Opponents argue that it is complex and difficult to learn. Some question the rationale of having nine diagramming techniques in UML and the raison d'être of those nine techniques in UML. Others point out that UML lacks a comprehensive methodology to guide its users, which makes the language even more convoluted. A few studies on UML can be found in the literature. However, no study exists to provide a quantitative measure of UML complexity or to compare UML with other object-oriented techniques. In this research, we evaluate the complexity of UML using complexity metrics. The objective is to provide a reliable and accurate quantitative measure of UML complexity. A comparison of the complexity metrical values of UML with other object-oriented techniques was also carried out. Our findings suggest that each diagram in UML is not distinctly more complex than techniques in other modeling methods. But as a whole, UML is very complex-2-11 times more complex than other modeling methods.

#*Managing Organizational Hypermedia Documents: A Meta-information System.
#@Woojong Suh,Heeseok Lee
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation0
#index1598
#arnetid1600
#%246918
#%246686
#%794278
#%979822
#%1009111
#%1064635
#%1065083
#%2013
#%1065016
#%1064608
#%74651
#%805916
#%773293
#%794561
#%244824
#%248530
#!Recently, many organizations have attempted to build hypermedia systems to expand their working areas into Internet-based virtual work places. Increasingly, it becomes more important than ever to manage organizational hypermedia documents (OHDs); metadata plays a critical role for managing these documents. This chapter redefines metadata roles and proposes a metadata classification and the corresponding metadata schema for OHDs. Furthermore, a meta-information system, HyDoMiS (Hyperdocument Meta-information System) built on the basis of this schema is proposed. HyDoMiS performs three functions: metadata management, search, and reporting. The metadata management function is concerned with workflow, documents, and databases. The system is more likely to help implement and maintain hypermedia information systems effectively.

#*Formal Approaches to Systems Analysis Using UML: An Overview.
#@Jon Whittle
#year2002
#confAdvanced Topics in Database Research, Vol. 1
#citation29
#index1599
#arnetid1601
#%471553
#%239170
#%71900
#%71835
#%363376
#%183826
#%220990
#%51547
#%440205
#%979731
#%601052
#%450817
#%1128386
#%1127575
#%684445
#%662109
#%662100
#%1056831

#*Implementation Techniques For Extensible Object Storage Systems.
#@Jung-Ho Ahn,Ha-Joo Song,Hyoung-Joo Kim
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation0
#index1600
#arnetid1602

#*A Review of Experiments on Natural Language Interfaces.
#@Hock Chuan Chan,John Lim
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation2
#index1601
#arnetid1603

#*A Framework for Analyzing Mobile Transaction Models.
#@Andrés Coratella,Miguel Felder,Roberto Hirsch,Eduardo Rodríguez
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation6
#index1602
#arnetid1604

#*Methodology Evaluation Framework for Component-Based System Development.
#@A. N. W. Dahanayake,Henk G. Sol,Zoran Stojanovic
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation10
#index1603
#arnetid1605

#*Considering Mobility in Query Processing for Mobile Commerce Systems.
#@Chih-Horng Ke,Chiang Lee
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation1
#index1604
#arnetid1606

#*A Run-Time Based Technique to Optimize Queries in Distributed Internet Databases.
#@Latifur Khan,Arunkumar Ponnusamy,Dennis McLeod,Cyrus Shahabi
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation0
#index1605
#arnetid1607

#*Towards Flexible Specification, Composition, and Coordination of Workflow Activities.
#@Ling Liu,Calton Pu
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation0
#index1606
#arnetid1608

#*On The Representation Of Temporal Dynamics.
#@Salvatore T. March,Gove N. Allen
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation2
#index1607
#arnetid1609

#*Software Agents for Mobile Commerce Services Support.
#@Mihhail Matskin,Amund Tveit
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation3
#index1608
#arnetid1610

#*The Development of Ordered SQL Packages in Peer-to-Peer Warehousing Environment.
#@Wilfred Ng,Mark Levene
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation0
#index1609
#arnetid1611

#*Performance Implication of Knowledge Discovery Techniques in Databases.
#@Balaji Rajagopalan,Ravindra Krovi
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation0
#index1610
#arnetid1612

#*Applying UML For Designing Multidimensional Databases And OLAP Applications.
#@Juan Trujillo,Sergio Luján-Mora,Il-Yeol Song
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation6
#index1611
#arnetid1613

#*Meta-model Based Information Mediation.
#@Luyin Zhao,Keng Siau
#year2003
#confAdvanced Topics in Database Research, Vol. 2
#citation0
#index1612
#arnetid1614

#*Federated Process Framework for Transparent Process Monitoring in Business Process Outsourcing.
#@Kyoung-Il Bae,Soon-Young Huh
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation-1
#index1613
#arnetid1615

#*Fuzzy Aggregations and Fuzzy Specializations in Eindhoven Fuzzy EER Model.
#@José Galindo,Angélica Urrutia,Mario Piattini
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation1
#index1614
#arnetid1616

#*Using DEMO and ORM in Concert: A Case Study.
#@Jan L. G. Dietz,Terry A. Halpin
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation10
#index1615
#arnetid1617

#*Improving the Understandability of Dynamic Semantics: An Enhanced Metamodel for UML State Machines.
#@Eladio Domínguez,Angel Luis Rubio,María Antonia Zapata
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation0
#index1616
#arnetid1618

#*Online Analytic Mining for Web Access Patterns.
#@Joseph Fong,Hing Kwok Wong,Anthony S. Fong
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation0
#index1617
#arnetid1619

#*Modeling Motion: Building Blocks of a Motion Database.
#@Roy Gelbard,Israel Spiegler
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation-1
#index1618
#arnetid1620

#*Comparing Metamodels for ER, ORM and UML Data Models.
#@Terry A. Halpin
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation18
#index1619
#arnetid1621

#*Regression Test Selection for Database Applications.
#@Ramzi A. Haraty,Nashat Mansour,Bassel Daou
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation3
#index1620
#arnetid1622

#*Framework for the Rapid Development of Modeling Environments.
#@Ákos Lédeczi,Miklos Maroti,Péter Völgyesi
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation-1
#index1621
#arnetid1623

#*Revisiting Workflow Modeling with Statecharts.
#@Wai Yin Mok,David P. Paper
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation0
#index1622
#arnetid1624

#*Normalization of Relations with Nulls in Candidate Keys: Traditional and Domain Key Normal Forms.
#@George C. Philip
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation0
#index1623
#arnetid1625

#*Metrics for Workflow Design: How an Information Processing View on Business Processes Helps to Make Good Designs.
#@Hajo A. Reijers
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation0
#index1624
#arnetid1626

#*Preface.
#@Keng Siau
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation-1
#index1625
#arnetid1627

#*Agile Development Methods and Component-Orientation: A Review and Analysis.
#@Zoran Stojanovic,A. N. W. Dahanayake,Henk G. Sol
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation0
#index1626
#arnetid1628

#*An Evaluation Framework for Component-Based and Service-Oriented System Development Methodologies.
#@Zoran Stojanovic,A. N. W. Dahanayake,Henk G. Sol
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation-1
#index1627
#arnetid1629

#*Toward an Extended Framework for Human Factors Research on Data Modeling.
#@Heikki Topi,V. Ramesh
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation0
#index1628
#arnetid1630

#*An Attempt to Establish a Correspondence between Development Methods and Problem Domains.
#@Óscar Dieste Tubío,Marcela Genero,Natalia Juristo Juzgado,Ana María Moreno
#year2004
#confAdvanced Topics in Database Research, Vol. 3
#citation-1
#index1629
#arnetid1631

#*Evaluation of Component-Based Development Methods.
#@Nicky Boertien,Maarten van Steen,Henk Jonkers
#year2005
#confInformation Modeling Methods and Methodologies
#citation10
#index1630
#arnetid1632

#*Two Meta-Models for Object-Role Modeling.
#@Dave Cuyler,Terry A. Halpin
#year2005
#confInformation Modeling Methods and Methodologies
#citation-1
#index1631
#arnetid1633

#*Comprehension of Hierarchical ER Diagrams Compared to Flat ER Diagrams.
#@Revital Danoch,Peretz Shoval,Mira Balaban
#year2005
#confInformation Modeling Methods and Methodologies
#citation0
#index1632
#arnetid1634

#*Analyzing and Comparing Ontologies with Meta-Methods.
#@Islay Davies,Peter Green,Simon Milton,Michael Rosemann
#year2005
#confInformation Modeling Methods and Methodologies
#citation0
#index1633
#arnetid1635

#*Participatory Development of Enterprise Process Models.
#@Reidar Gjersvik,John Krogstie,Asbjørn Følstad
#year2005
#confInformation Modeling Methods and Methodologies
#citation6
#index1634
#arnetid1636

#*Constraints on Conceptual Join Paths.
#@Terry A. Halpin
#year2005
#confInformation Modeling Methods and Methodologies
#citation9
#index1635
#arnetid1637

#*Evaluating Conceptual Coherence in Multi-Modeling Techniques.
#@Bart-Jan Hommes
#year2005
#confInformation Modeling Methods and Methodologies
#citation1
#index1636
#arnetid1638

#*A Comparison of the FOOM and OPM Methodologies for User Comprehension of Analysis Specifications.
#@Judith Kabeli,Peretz Shoval
#year2005
#confInformation Modeling Methods and Methodologies
#citation-1
#index1637
#arnetid1639

#*An Empirical Investigation of Requirements Specification Languages: Detecting Defects While Formalizing Requirements.
#@Erik Kamsties,Antje von Knethen,Jan Philipps,Bernhard Schätz
#year2005
#confInformation Modeling Methods and Methodologies
#citation1
#index1638
#arnetid1640

#*Goal Modeling in Requirements Engineering: Analysis and Critique of Current Methods.
#@Evangelia Kavakli,Pericles Loucopoulos
#year2005
#confInformation Modeling Methods and Methodologies
#citation-1
#index1639
#arnetid1641

#*Assessing Enterprise Modeling Languages Using a Generic Quality Framework.
#@John Krogstie,Sofie de Flon Arnesen
#year2005
#confInformation Modeling Methods and Methodologies
#citation8
#index1640
#arnetid1642

#*Preface.
#@John Krogstie,Terry A. Halpin,Keng Siau
#year2005
#confInformation Modeling Methods and Methodologies
#citation-1
#index1641
#arnetid1643

#*Validating an Evaluation Framework for Requirements Engineering Tools.
#@Raimundas Matulevicius
#year2005
#confInformation Modeling Methods and Methodologies
#citation8
#index1642
#arnetid1644

#*An Approach for Evolution-Driven Method Engineering.
#@Jolita Ralyté,Colette Rolland,Mohamed Ben Ayed
#year2005
#confInformation Modeling Methods and Methodologies
#citation7
#index1643
#arnetid1645

#*A Taxonomic Class Modeling Methodology for Object-Oriented Analysis.
#@Il-Yeol Song,Kurt Yano,Juan Trujillo,Sergio Luján-Mora
#year2005
#confInformation Modeling Methods and Methodologies
#citation-1
#index1644
#arnetid1646

#*A Service-Oriented Component Modeling Approach.
#@Zoran Stojanovic,A. N. W. Dahanayake,Henk G. Sol
#year2005
#confInformation Modeling Methods and Methodologies
#citation2
#index1645
#arnetid1647

#*Using a Semiotic Framework for a Comparative Study of Ontology Languages and Tools.
#@Xiaomeng Su,Lars Ilebrekke
#year2005
#confInformation Modeling Methods and Methodologies
#citation9
#index1646
#arnetid1648

#*Using Logic for Querying XML Data.
#@Nick Bassiliades,Ioannis P. Vlahavas,Demetrios G. Sampson
#year2003
#confWeb-Powered Databases
#citation12
#index1647
#arnetid1649

#*Ubiquitous Access to Web Databases.
#@Athman Bouguettaya,Brahim Medjahed,Mourad Ouzzani,Yao Meng
#year2003
#confWeb-Powered Databases
#citation0
#index1648
#arnetid1650

#*Protecting Datasources over the Web: Policies, Models, and Mechanisms.
#@Silvana Castano,Elena Ferrari
#year2003
#confWeb-Powered Databases
#citation2
#index1649
#arnetid1651

#*Practical Case Study of a Web-based Tutor Payment System.
#@Tanguy Chateau,Cecile Leroy,J. Wenny Rahayu,David Taniar
#year2003
#confWeb-Powered Databases
#citation0
#index1650
#arnetid1652

#*Web Content Management and Dynamic Web Pages - A Tutorial.
#@Esther Gelle,Viktor Schepik
#year2003
#confWeb-Powered Databases
#citation0
#index1651
#arnetid1653

#*Cache Management for Web-Powered Databases.
#@Dimitrios Katsaros,Yannis Manolopoulos
#year2003
#confWeb-Powered Databases
#citation6
#index1652
#arnetid1654

#*Database-Driven Product Catalog System.
#@J. Wenny Rahayu,Andrew Flahive,David Taniar
#year2003
#confWeb-Powered Databases
#citation0
#index1653
#arnetid1655

#*The Development of On-line Tests Based on Multiple Choice Questions.
#@Geoffrey G. Roy,Jocelyn Armarego
#year2003
#confWeb-Powered Databases
#citation2
#index1654
#arnetid1656

#*Web Mining to Create a Domain Specific Web Portal Database.
#@Anthony Scime
#year2003
#confWeb-Powered Databases
#citation0
#index1655
#arnetid1657

#*CODAR - A POA-based CORBA Database Adaptor for Web Service Infrastructures.
#@Zahir Tari,Abdelkamel Tari,Surya Setiawan
#year2003
#confWeb-Powered Databases
#citation0
#index1656
#arnetid1658

#*Web-Powered Databases: The Low Level in C++.
#@Claude Del Vigna
#year2003
#confWeb-Powered Databases
#citation0
#index1657
#arnetid1659

#*Effective Databases for Text & Document Management.
#@Shirley A. Becker
#year2003
#conf
#citation1
#index1658
#arnetid1660

#*Database Integrity: Challenges and Solutions
#@Jorge Horacio Doorn,Laura C. Rivero
#year2002
#conf
#citation9
#index1659
#arnetid1661

#*Encyclopedia of Information Science and Technology (5 Volumes)
#@Mehdi Khosrow-Pour
#year2005
#conf
#citation-1
#index1660
#arnetid1662

#*Encyclopedia of Database Technologies and Applications
#@Laura C. Rivero,Jorge Horacio Doorn,Viviana E. Ferraggine
#year2005
#conf
#citation4
#index1661
#arnetid1663

#*Multidimensional Databases: Problems and Solutions
#@Maurizio Rafanelli
#year2003
#conf
#citation34
#index1662
#arnetid1664

#*Information Modeling in the New Millennium
#@Matti Rossi,Keng Siau
#year2001
#conf
#citation-1
#index1663
#arnetid1665

#*Unified Modeling Language: Systems Analysis, Design and Development Issues
#@Keng Siau,Terry A. Halpin
#year2001
#conf
#citation37
#index1664
#arnetid1666

#*Advanced Topics in Database Research, Vol. 1
#@Keng Siau
#year2002
#conf
#citation0
#index1665
#arnetid1667

#*Advanced Topics in Database Research, Vol. 2
#@Keng Siau
#year2003
#conf
#citation0
#index1666
#arnetid1668

#*Advanced Topics in Database Research, Vol. 3
#@Keng Siau
#year2004
#conf
#citation0
#index1667
#arnetid1669

#*Information Modeling Methods and Methodologies
#@John Krogstie,Terry A. Halpin,Keng Siau
#year2005
#conf
#citation9
#index1668
#arnetid1670

#*Spatial Databases: Technologies, Techniques and Trends
#@Yannis Manolopoulos,Apostolos Papadopoulos,Michael Vassilakopoulos
#year2005
#confSpatial Databases
#citation13
#index1669
#arnetid1671

#*Web-Powered Databases
#@David Taniar,J. Wenny Rahayu
#year2003
#conf
#citation2
#index1670
#arnetid1672

#*Advances in Real-Time Systems.
#@John A. Stankovic,Krithi Ramamritham
#year1993
#conf
#citation111
#index1671
#arnetid1673

#*Ein Datenbankkern zur Speicherung variabel strukturierter Feature-Terme. Implementierungstechniken.
#@Michael Ley
#year1993
#confDISKI
#citation-1
#index1672
#arnetid1674

#*Eine fallbasierte Lernkomponente als integraler Bestandteil der MOLTKE-Werkbank zur Diagnose technischer Systeme.
#@Klaus-Dieter Althoff
#year1993
#confDISKI
#citation0
#index1673
#arnetid1675

#*Oberflächenbasierte Segmentierung von Tiefenbildern.
#@Haibin Liu
#year1993
#confDISKI
#citation-1
#index1674
#arnetid1676

#*Ein planbasierter Ansatz zur Generierung multimedialer Präsentationen.
#@Elisabeth André
#year1995
#confDISKI
#citation-1
#index1675
#arnetid1677

#*Effiziente Pufferverwaltung in parallelen relationalen Datenbanksystemen.
#@Andreas Listl
#year1996
#confDISDBIS
#citation-1
#index1676
#arnetid1678

#*Operationalisierung des Modells der Expertise mit KARL.
#@Jürgen Angele
#year1993
#confDISKI
#citation36
#index1677
#arnetid1679

#*Integration of Active and Deductive Database Rules.
#@Bertram Ludäscher
#year1998
#confDISDBIS
#citation15
#index1678
#arnetid1680

#*Indexierung und Retrieval von Feature-Bäumen am Beispiel der linguistischen Analyse von Textkorpora.
#@Hans Argenton
#year1998
#confDISDBIS
#citation3
#index1679
#arnetid1681

#*Inkrementelle wörterbuchbasierte Wortschatzerweiterungen in sprachverarbeitenden Systemen. Entwurf einer konstruktiven Lexikonkonzeption.
#@Petra Ludewig
#year1993
#confDISKI
#citation-1
#index1680
#arnetid1682

#*Parallele Modelle für Deduktionssysteme.
#@Ulrich Aßmann
#year1992
#confDISKI
#citation-1
#index1681
#arnetid1683

#*HAMVIS: Generierung von Visualisierungen in einem Rahmensystem zur systematischen Entwicklung von Benutzungsschnittstellen.
#@Ralf Möller
#year1996
#confDISKI
#citation2
#index1682
#arnetid1684

#*Ein modellgestütztes Analysesystem zum Bildverstehen strukturierter Dokumente.
#@Thomas Bayer
#year1993
#confDISKI
#citation-1
#index1683
#arnetid1685

#*Verwendung von Bildauswertungsmethoden zur Erkennung und Lagebestimmung von generischen polyedrischen Objekten im Raum.
#@Claus Müller
#year1992
#confDISKI
#citation7
#index1684
#arnetid1686

#*Implementierung einer effizienten Anfrageauswertung für ein deduktives Datenbanksystem.
#@Stefan Benzschawel
#year1996
#confDISDBIS
#citation-1
#index1685
#arnetid1687

#*Fehlertolerante und effiziente automatische Analyse digitalisierter Dokumente zur Gewinnung von Hypertextstrukturen.
#@Andreas Myka
#year1999
#confDISDBIS
#citation0
#index1686
#arnetid1688

#*Effizientes Problemlösen durch flexible Wiederverwendung von Fällen auf verschiedenen Abstraktionsebenen.
#@Ralph Bergmann
#year1996
#confDISKI
#citation-1
#index1687
#arnetid1689

#*Modellkonstruktion in MIKE. Methoden und Werkzeuge.
#@Susanne Neubert
#year1994
#confDISKI
#citation5
#index1688
#arnetid1690

#*Steuerungsansätze auf der Basis Neuronaler Netze für sechsbeinige Laufmaschinen.
#@Karsten Berns
#year1993
#confDISKI
#citation-1
#index1689
#arnetid1691

#*Validierung konzeptueller Schemata.
#@Andrea Neufeld
#year1994
#confDISKI
#citation0
#index1690
#arnetid1692

#*Fuzzy-Techniken in objektorientierten Datenbanksystemen zur Unterstützung von Entwurfsprozessen.
#@Birgit Boss
#year1996
#confDISDBIS
#citation-1
#index1691
#arnetid1693

#*Pragmatische Programmsynthese.
#@Gerd Neugebauer
#year1992
#confDISKI
#citation2
#index1692
#arnetid1694
#!Dear KV, I hope you don't mind if I ask you about a non-work-related problem, though I guess if you do mind you just won't answer. I work on an open source project when I have the time, and we have some annoying nontechnical problems. The problems are really people, and I think you know the ones I mean: people who constantly fight with other members of the project over what seem to be the most trivial points, or who contribute very little to the project but seem to require a huge amount of help for their particular needs. I find myself thinking it would be nice if such people just went away, but I don't think starting a flame war on our mailing lists over these things would really help. Any thoughts on this nontechnical problem?

#*Ein Informationsmodell für Ableitungsprozesse und ihre Ergebnisse im Wissensgewinnungsprozeß.
#@Christoph Breitner
#year1998
#confDISDBIS
#citation-1
#index1693
#arnetid1695

#*Separierung und Resolution multipler Perspektiven in der konzeptuellen Modellierung.
#@Hans W. Nissen
#year1997
#confDISDBIS
#citation6
#index1694
#arnetid1696

#*Erweiterung der Wissensbasierten CAD-Konstruktion um Restriktionsnetztechniken.
#@Hans-Christian Brüning
#year1993
#confDISKI
#citation0
#index1695
#arnetid1697

#*Zur Darstellung und Verarbeitung von Wissen über Himmelsrichtungen.
#@Yong Cao
#year1993
#confDISKI
#citation0
#index1696
#arnetid1698

#*Adaptive Neuronale Netze und ihre Anwendung als Modelle der Entwicklung kortikaler Karten.
#@Klaus Obermayer
#year1993
#confDISKI
#citation9
#index1697
#arnetid1699

#*Das 3-stufige Frame-Repräsentationsschema - eine mehrdimensional modulare Basis für die Entwicklung von Expertensystemkernen.
#@Roman Cunis
#year1992
#confDISKI
#citation-1
#index1698
#arnetid1700

#*Extraktion von linienförmigen Merkmalen und Ermittlung des optischen Flusses mit seinen Ableitungen aus Voll- und Halbbildfolgen.
#@Michael Otte
#year1994
#confDISKI
#citation-1
#index1699
#arnetid1701

#*Verfeinerung in objektorientierten Spezifikationen.
#@Grit Denker
#year1996
#confDISDBIS
#citation-1
#index1700
#arnetid1702

#*Analyse und Optimierung von Indexstrukturen in Geo-Datenbanksystemen.
#@Bernd-Uwe Pagel
#year1996
#confDISDBIS
#citation-1
#index1701
#arnetid1703

#*Externe Schemata in objektorientierten Datenbansystemen.
#@Michael Dobrovnik
#year1997
#confDISDBIS
#citation-1
#index1702
#arnetid1704

#*Erklärungsbasiertes Computer-Sehen von Bildfolgen.
#@Josef Pauli
#year1993
#confDISKI
#citation-1
#index1703
#arnetid1705

#*Zur natürlichsprachlichen interaktiven Unterstützung im Datenbankentwurf.
#@Antje Düsterhöft
#year1997
#confDISDBIS
#citation-1
#index1704
#arnetid1706

#*Optimierung deklarativer Anfragen in Objektbanken.
#@Klaus Peithner
#year1996
#confDISDBIS
#citation4
#index1705
#arnetid1707

#*Die Bildanalysesprache TRIAS.
#@Wolfgang Eckstein
#year1993
#confDISKI
#citation1
#index1706
#arnetid1708

#*Deduktion mit Shannongraphen für Prädikatenlogik erster Stufe.
#@Joachim Posegga
#year1993
#confDISKI
#citation21
#index1707
#arnetid1709

#*Parallele Suche mit randomisiertem Wettbewerb in Inferenzsystemen.
#@Wolfgang Ertel
#year1993
#confDISKI
#citation16
#index1708
#arnetid1710

#*Erklärungen für komplexe Wissensbasen.
#@Reinhard Prechtel
#year1993
#confDISKI
#citation-1
#index1709
#arnetid1711

#*Wissensbasierte Verfahren zur Synthese mathematischer Beweise: Eine kombinatorische Anwendung.
#@Jutta Eusterbrock
#year1992
#confDISKI
#citation3
#index1710
#arnetid1712

#*Definition of Behavior in Object-Oriented Databases by View Integration.
#@Günter Preuner
#year1999
#confDISDBIS
#citation5
#index1711
#arnetid1713

#*Schematransformationen in Datenbanken.
#@Christian Fahrner
#year1997
#confDISDBIS
#citation1
#index1712
#arnetid1714

#*Ein Regelsystem zur Integrtätssicherung in aktiven relationalen Datenbanksystemen.
#@Joachim Reinert
#year1996
#confDISDBIS
#citation6
#index1713
#arnetid1715

#*Verteiltes und kooperatives Planen in einer flexiblen Fertigungsumgebung.
#@Klaus Fischer
#year1993
#confDISKI
#citation18
#index1714
#arnetid1716

#*Eine parallele Architektur zur inkrementellen Generierung multimodaler Dialogbeiträge.
#@Norbert Reithinger
#year1992
#confDISKI
#citation-1
#index1715
#arnetid1717

#*View Integration für objektorientierte Datenbanken.
#@Heinz Frank
#year1997
#confDISDBIS
#citation-1
#index1716
#arnetid1718

#*Grammatikentwicklung mit Constraint Logik Programmierung. Implementierung einer Grammatik für das Deutsche mit PROLOG III.
#@Christoph Lehner
#year1993
#confDISKI
#citation-1
#index1717
#arnetid1719

#*Replikationsmanagement in verteilten Informationssystemen.
#@Rainer Gallersdörfer
#year1997
#confDISDBIS
#citation1
#index1718
#arnetid1720

#*A Tour on TriGS. Devolopment of an Active System and Application of Rule Patterns for Active Database Design.
#@Werner Retschitzegger
#year1997
#confDISDBIS
#citation4
#index1719
#arnetid1721

#*Optimierung von Speicherzugriffskosten in Objektbanken: Clustering und Prefetching.
#@Carsten Andreas Gerlhof
#year1996
#confDISDBIS
#citation5
#index1720
#arnetid1722

#*Transaction Services for Knowledge Base Management Systems. Modeling Aspects, Architectural Issues, and Realization Techniques.
#@Fernando de Ferreira Rezende
#year1997
#confDISDBIS
#citation7
#index1721
#arnetid1723

#*Diagnosis and Repair of Constraint Violations in Database Systems.
#@Michael Gertz
#year1996
#confDISDBIS
#citation15
#index1722
#arnetid1724

#*Föderierte Datenbanktechnologie für die Molekularbiologie: Konzepte, Einsatz und Nutzen.
#@Barbara Rieche
#year1996
#confDISDBIS
#citation-1
#index1723
#arnetid1725

#*Das digital lecture board. Konzeption, Design und Entwicklung eines Whiteboards für synchrones Teleteaching.
#@Werner Geyer
#year1999
#confDISDBIS
#citation20
#index1724
#arnetid1726

#*DB-gestützte Kooperationsdienste für technische Entwurfsanwendungen.
#@Norbert Ritter
#year1997
#confDISDBIS
#citation-1
#index1725
#arnetid1727

#*Bedarfsorientierte Dienstvermittlung in vernetzten Systemen.
#@Arnd G. Grosse
#year1999
#confDISDBIS
#citation0
#index1726
#arnetid1728

#*Materialisation and Parallelism in the Mapping of an Object Model to a Relational Multi-processor System.
#@Michael Rys
#year1998
#confDISDBIS
#citation5
#index1727
#arnetid1729

#*Flexible Kontrolle in Expertensystemen zur Planung und Konfigurierung in technischen Domänen.
#@Andreas Günter
#year1992
#confDISKI
#citation2
#index1728
#arnetid1730

#*Wissensbasiertes Lösen von Ablaufplanungsproblemen durch explizite Heuristiken.
#@Jürgen Sauer
#year1993
#confDISKI
#citation-1
#index1729
#arnetid1731

#*Ein Basisdienst für die zuverlässige Abwicklung langdauernder Aktivitäten.
#@Roger Günthör
#year1997
#confDISDBIS
#citation-1
#index1730
#arnetid1732

#*Interoperabilität von Datenbanksystemen bei struktureller Heterogenität. Architektur, Beschreibungs- und Ausführungsmodell zur Unterstützung der Integration und Migration.
#@Günter Sauter
#year1998
#confDISDBIS
#citation-1
#index1731
#arnetid1733

#*Konzeptionelle Modellierung von Informationssystemen als verteilte Objektsysteme.
#@Peter Hartel
#year1997
#confDISDBIS
#citation23
#index1732
#arnetid1734

#*Trabsaktionsverwaltung in heterogenen, föderierten Datenbanksystemen.
#@Werner Schaad
#year1996
#confDISDBIS
#citation-1
#index1733
#arnetid1735

#*Entwurf einer Sprache für die verhaltensorientierte konzeptionelle Modellierung von Informationssystemen.
#@Thorsten Hartmann
#year1996
#confDISDBIS
#citation-1
#index1734
#arnetid1736

#*Schemaintegration für den Entwurf föderierter Datenbanken.
#@Ingo Schmitt
#year1998
#confDISDBIS
#citation-1
#index1735
#arnetid1737

#*Kommunikationsoptimierung für mobile Agenten durch hierarchisches Klonen.
#@Jörn Hartroth
#year1999
#confDISDBIS
#citation-1
#index1736
#arnetid1738

#*Erwartungsgestützte Analyse medizinischer Befundungstexte. Ein wissensbasiertes Modell zur Sprachverarbeitung.
#@Martin Schröder
#year1994
#confDISKI
#citation-1
#index1737
#arnetid1739

#*Einheitliche Theorie für korrekte parallele und fehlertolerante Ausführung von Datenbanktransaktionen.
#@Haiyan Hasse-Ye
#year1996
#confDISDBIS
#citation-1
#index1738
#arnetid1740

#*Architektur verteilter Workflow-Management-Systeme.
#@Hans Schuster
#year1998
#confDISDBIS
#citation10
#index1739
#arnetid1741

#*ALCP - Ein hybrider Ansatz zur Modellierung von Unsicherheit in terminologischen Logiken.
#@Jochen Heinsohn
#year1994
#confDISKI
#citation8
#index1740
#arnetid1742

#*Das Konzept der Transaktionshülle zur konsistenten Spezifikation von Abhänigigkeiten in komplexen Anwendungen.
#@Kerstin Schwarz
#year1999
#confDISDBIS
#citation-1
#index1741
#arnetid1743

#*Kognitives Parsing: Repräsentation und Verarbeitung sprachlichen Wissens.
#@Barbara Hemforth
#year1993
#confDISKI
#citation-1
#index1742
#arnetid1744

#*Dynamische, situationsbezogene Hypertext-Handbücher für komplexe Tätigkeiten.
#@Lothar Simon
#year1993
#confDISKI
#citation-1
#index1743
#arnetid1745

#*Effiziente Konsistenzprüfunf in Datenbanksystemen.
#@Uwe Herzog
#year1996
#confDISDBIS
#citation-1
#index1744
#arnetid1746

#*MoKon - Ein Ansatz zur Wissensbasierten Konfiguration von Variantenerzeugnissen.
#@Claudia Sommer
#year1993
#confDISKI
#citation2
#index1745
#arnetid1747

#*Skalierbare Multicast-Kommunikation in Weitverkehrsnetzen.
#@Markus Hofmann
#year1998
#confDISDBIS
#citation7
#index1746
#arnetid1748

#*Source-to-Source Transformationen zur Erklärung des Programmverhaltens bei deduktiven Datenbanken.
#@Günther Specht
#year1993
#confDISKI
#citation-1
#index1747
#arnetid1749

#*Symbolisches Lösen mathematischer Probleme durch Kooperation algorithmischer und logischer Systeme.
#@Karsten Homann
#year1997
#confDISKI
#citation-1
#index1748
#arnetid1750

#*Situationsanalyse bei Kontakten während der Ausführung von Roboterbewegungen in unsicheren Umgebungen.
#@Michael Spreng
#year1993
#confDISKI
#citation-1
#index1749
#arnetid1751

#*Begleitende Montageablaufplanung für ein sensorgestütztes Zweiarm-Manipulatorsystem.
#@Andreas Hörmann
#year1992
#confDISKI
#citation-1
#index1750
#arnetid1752

#*Sichtenmanagement in Client-Server-Systemen.
#@Martin Staudt
#year1997
#confDISDBIS
#citation1
#index1751
#arnetid1753

#*Dynamische Modularisierung lexikalischer Informationen in einem Wiederverwendungsszenario.
#@Wilfried Hötker
#year1997
#confDISKI
#citation3
#index1752
#arnetid1754

#*Wissensbasierte Analyse medizinischer Bilder - das Biotop-Verfahren.
#@Thorsten von Stein
#year1994
#confDISKI
#citation0
#index1753
#arnetid1755

#*Benutzeranpaßbare semantische Sprachanalyse und Begriffsrepräsentation für die medizinische Dokumentation.
#@Josef Ingenerf
#year1993
#confDISKI
#citation-1
#index1754
#arnetid1756

#*Heuristic and Randomised Optimisation Techniques in Object-Oriented Database Systems.
#@Michael Steinbrunn
#year1996
#confDISDBIS
#citation3
#index1755
#arnetid1757

#*Änderungskontrolle in deduktiven Datenbanken.
#@Manfred A. Jeusfeld
#year1992
#confDISKI
#citation-1
#index1756
#arnetid1758

#*Verdeckungen und spezielle Sichten bei der Polyederrekonstruktion.
#@Volker Steinhage
#year1993
#confDISKI
#citation0
#index1757
#arnetid1759

#*Access Control in Object-Oriented Federated Database Systems.
#@Dirk Jonscher
#year1998
#confDISDBIS
#citation8
#index1758
#arnetid1760

#*Generierung domänenspezifischer Wissensrepräsentationssysteme und Transformation von Wissensbasen mit einer Anwendung in der Rechtsinformatik.
#@Andreas Strasser
#year1992
#confDISKI
#citation-1
#index1759
#arnetid1761

#*Interaktive Akquisition elementarer Roboterfähigkeiten.
#@Michael Kaiser
#year1997
#confDISKI
#citation30
#index1760
#arnetid1762

#*Modulare Problemlösungsarchitekturen für Konstruktionssysteme.
#@Ingo Syska
#year1992
#confDISKI
#citation-1
#index1761
#arnetid1763

#*Toleranz- und Kongruenzrelationen in relationalen Datenbanken.
#@Claus Kaldeich
#year1997
#confDISDBIS
#citation1
#index1762
#arnetid1764

#*Modellierung von Expertise über Konfigurierungsaufgaben.
#@Wolfgang Tank
#year1992
#confDISKI
#citation-1
#index1763
#arnetid1765

#*Reduktion zur effizienten Programmierung von Methoden in deduktiven objektorientierten Datenbanken.
#@Paul-Thomas Kandzia
#year1998
#confDISDBIS
#citation0
#index1764
#arnetid1766

#*An Approach to Query Processing in Advanced Database Systems.
#@Joachim Thomas
#year1996
#confDISDBIS
#citation4
#index1765
#arnetid1767

#*Metadata-Based Middleware for Integrating Information Systems.
#@Elisabeth Kapsammer
#year1999
#confDISDBIS
#citation0
#index1766
#arnetid1768

#*Semantic Integrity Constraints in Federated Database Schemata.
#@Can Türker
#year1999
#confDISDBIS
#citation16
#index1767
#arnetid1769

#*MODEL-K: Modellierung und Operationalisierung von Selbsteinschätzung und -steuerung durch Reflexion und Metawissen.
#@Werner Karbach
#year1994
#confDISKI
#citation-1
#index1768
#arnetid1770

#*EMSY - Ein Modellierungskonzept für ökologische und biologische Systeme unter besonderer Berücksichtigung ihrer dynamischen Veränderung.
#@Adelinde Uhrmacher
#year1992
#confDISKI
#citation-1
#index1769
#arnetid1771

#*Akquisition von Integritätsbedingungen in Datenbanken.
#@Meike Klettke
#year1998
#confDISDBIS
#citation-1
#index1770
#arnetid1772

#*Inkrementelle, domänenunabhängige Thesauruserstellung in dokumentbasierten Informationssystemen durch Kombination von Konstruktionsverfahren.
#@Johannes Viegener
#year1997
#confDISDBIS
#citation-1
#index1771
#arnetid1773

#*Unterstützung anwendungsspezifischer Zugriffsprofile in Objektbanksystemen.
#@Christoph Kliger
#year1996
#confDISDBIS
#citation-1
#index1772
#arnetid1774

#*Dynamische Beziehungen als Modell der Kooperation in verteilten Objektsystemen.
#@Hans-Dirk Walter
#year1996
#confDISDBIS
#citation0
#index1773
#arnetid1775

#*Eine mehrschichtige Architektur zur Fehlerdiagnose und Fehlerbehebung bei der Entwicklung logischer Programme.
#@Karlhorst Klotz
#year1993
#confDISKI
#citation1
#index1774
#arnetid1776

#*Entwurf eines objektorientierten Datenbankmodells Für relationale Datenbanksysteme.
#@Gerhard Wanner
#year1998
#confDISDBIS
#citation2
#index1775
#arnetid1777

#*Vorgangsmodelle. Ein Ansatz zur Repräsentation und Analyse zeitabhängigen Verhaltens bei der Überwachung und Diagnose technischer Systeme.
#@Sabine Kockskämper
#year1996
#confDISKI
#citation-1
#index1776
#arnetid1778

#*Terminierung und Konfluenz in einer aktiven objektorientierten Datenbank.
#@Thomas Weik
#year1997
#confDISDBIS
#citation0
#index1777
#arnetid1779

#*Integration von Aktionsplanung und Konfigurierung.
#@Axel Köhne
#year1993
#confDISKI
#citation0
#index1778
#arnetid1780

#*Distributed Machine Learning.
#@Gerhard Weiß
#year1995
#confDISKI
#citation-1
#index1779
#arnetid1781

#*Detektion, Verfolgung und Klassifikation bewegter Objekte in monokularen Bildfolgen am Beispiel von Straßenverkehrsszenen.
#@Dieter Koller
#year1992
#confDISKI
#citation-1
#index1780
#arnetid1782

#*Produkorientierte automatische Planung von Prüfoperationen bei der robotergestützten Montage.
#@Gerhard Werling
#year1993
#confDISKI
#citation-1
#index1781
#arnetid1783

#*Ein Verfahren zur semi-automatischen Generierung von Mediatorspezifikationen.
#@Birgitta König-Ries
#year1999
#confDISDBIS
#citation3
#index1782
#arnetid1784

#*Wissensbasierte Verkehrsszenenanalyse zur Fahrerunterstützung.
#@Dirk Wetzel
#year1996
#confDISKI
#citation-1
#index1783
#arnetid1785

#*Replikation in vernetzten Systemen mit mobilen Teilnehmern.
#@Dietmar A. Kottmann
#year1996
#confDISDBIS
#citation6
#index1784
#arnetid1786

#*Funktionsorientiertes Management heterogener ATM-Netzwerke.
#@Hajo R. Wiltfang
#year1999
#confDISDBIS
#citation1
#index1785
#arnetid1787

#*Control Mechanisms in Distributed Object Bases. Synchronization, Deadlock Detection, Migration.
#@Natalija Krivokapic
#year1999
#confDISDBIS
#citation0
#index1786
#arnetid1788

#*Zeitrepräsentation und merkmalsgesteuerte Suche zur Terminplanung.
#@Andreas Winklhofer
#year1994
#confDISKI
#citation-1
#index1787
#arnetid1789

#*Aktive Mechanismen zur Konsistenzsicherung in Föderationen heterogener und autonomer Datenbanken.
#@Thomas Kudrass
#year1997
#confDISDBIS
#citation-1
#index1788
#arnetid1790

#*Modellbildung und Architektur von verteilten Workflow-Management-Systemen.
#@Dirk Wodtke
#year1997
#confDISDBIS
#citation3
#index1789
#arnetid1791

#*Flexible Steuerung eines sprachverstehenden Systems mit homogener Wissensbasis.
#@Franz Kummert
#year1992
#confDISKI
#citation22
#index1790
#arnetid1792

#*Wissensbasierte Greifplanung für Mehrfinger-Roboterhände.
#@Günter Wöhlke
#year1992
#confDISKI
#citation-1
#index1791
#arnetid1793

#*Entwicklung verteilter Objektstrukturen für skalierbare und hochgradig verfügbare Informationssysteme.
#@Jan-Hardy Kusch
#year1996
#confDISDBIS
#citation-1
#index1792
#arnetid1794

#*Konzeption eines regelbasierten Systems für Produktdatenmanagement in CIM.
#@Wolfram Wöß
#year1999
#confDISDBIS
#citation0
#index1793
#arnetid1795

#*Digitale und Allgemeine Topologie in der bildhaften Wissensrepräsentation.
#@Longin Jan Latecki
#year1992
#confDISKI
#citation-1
#index1794
#arnetid1796

#*Einbettung von Konzepthierarchien in ein Deduktives Datenbanksystem.
#@Albert Maier
#year1993
#confDISKI
#citation1
#index1795
#arnetid1797

#*Typsichere Objektbankmigration.
#@Andreas Zachmann
#year1997
#confDISDBIS
#citation0
#index1796
#arnetid1798

#*MISTRAL: Processing Relational Queries using a Multidimensional Access Technique.
#@Volker Markl
#year1999
#confDISDBIS
#citation36
#index1797
#arnetid1799

#*Wissensintensives Lernen für zeitkritische technische Diagnoseaufgaben.
#@Kai Zercher
#year1992
#confDISKI
#citation-1
#index1798
#arnetid1800

#*Selbstorganisierende neuronale Netzwerkmodelle zur Bewegungssteuerung.
#@Thomas Martinetz
#year1992
#confDISKI
#citation10
#index1799
#arnetid1801

#*Lernen durch Genetisch-Neuronale Evolution: Aktive Anpassung an unbekannte Umgebungen mit selbstentwickelten parallelen Netzwerken.
#@Byoung-Tak Zhang
#year1992
#confDISKI
#citation3
#index1800
#arnetid1802

#*Schema-unabhängige Anfragesprachen für relationale Datenbanken.
#@Ute Masermann
#year1999
#confDISDBIS
#citation-1
#index1801
#arnetid1803

#*Qualitative Analyse im Rahmen qualitativen und modellbasierten Schließens.
#@Jun Zhao
#year1994
#confDISKI
#citation-1
#index1802
#arnetid1804

#*Ein Dialogmodul für ein Spracherkennungs- und Dialogsystem.
#@Marion Mast
#year1993
#confDISKI
#citation-1
#index1803
#arnetid1805

#*Cyclops - Wissensbasierte Bildanalyse in der Medizin.
#@Aldo von Wangenheim
#year1997
#confDISKI
#citation0
#index1804
#arnetid1806

#*Hypermediabasiertes Knowledge Engineering für verteilte wissensbasierte Systeme.
#@Frank Maurer
#year1993
#confDISKI
#citation-1
#index1805
#arnetid1807

#*Anfrageoptimierung in objektrelationalen Datenbanken durch kostenbedingte Termersetzungen
#@Mazeyar E. Makoui
#year2007
#confDISDBIS
#citation1
#index1806
#arnetid1808

#*Dynamische semantische Netze - Zur Kontextabhängigkeit von Wortbedeutungen.
#@Stephan Mehl
#year1993
#confDISKI
#citation-1
#index1807
#arnetid1809

#*Extending the Stratification Approach for Deductive Database Systems.
#@Michael Meskes
#year1997
#confDISDBIS
#citation3
#index1808
#arnetid1810

#*Wissensbasierte Synthese von Bildanalyseprogrammen.
#@Tilo Messer
#year1992
#confDISKI
#citation4
#index1809
#arnetid1811

#*Adaptive Roboterkontrolle mit konnektionistischen Systemen.
#@Knut Möller
#year1992
#confDISKI
#citation1
#index1810
#arnetid1812

#*Design and Implementation of a Database Programming Language for XML-based Applications.
#@Henrike Schuhart
#year2006
#confDISDBIS
#citation1
#index1811
#arnetid1813

#*Towards the Intelligent On-line Home Office.
#@Stefano Antoniazzi,Matteo Pampolini
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1812
#arnetid1814

#*The IT Leap and the Sektornet.
#@Kurt Bøge
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1813
#arnetid1815

#*Technology as the Catalyst of Users' Acceptance in Electronic Commerce.
#@Mirna Boscolo,Mirella Mastretti,Ettore Paolillo
#year1999
#confFlexible Working - New Network Technologies
#citation2
#index1814
#arnetid1816

#*Introduction by the Editors.
#@Birte Christensen-Dalsgaard,William Donnelly,Michael Griffith
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1815
#arnetid1817

#*ACCORD Solutions for Flexible Working.
#@Paolo Conforto,Vincenzo Marziale,Giacinto Losquadro
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1816
#arnetid1818

#*Flexible Quality-of-Service Technology for Supporting Voice/Data-Integrated Nomadic Networking.
#@Hendrik Decker,Michael Krautgärtner
#year1999
#confFlexible Working - New Network Technologies
#citation2
#index1817
#arnetid1819

#*The Telco's Goldmine - 50 Mb/s to the General Public over the Local Telephone Lines.
#@Einar Edvardsen
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1818
#arnetid1820

#*Support Services for Business Process Oriented Telework. The COBIP Project.
#@João José Pinto Ferreira,Wilhelm Dangelmaier,Jörg Goletz,Pedro Araújo
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1819
#arnetid1821

#*New Ways of Flexible Working: The Contribution of ACTS, and Issues for IST.
#@Michael Griffith
#year1999
#confFlexible Working - New Network Technologies
#citation-1
#index1820
#arnetid1822

#*Interoperability for Multimedia Services: The Approach of the Standards Bodies - An Overview Based on ACTS Guideline SII G06.
#@Renata Guarnieri,Cees J. M. Lanting
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1821
#arnetid1823

#*Net Working in the Knowledge Economy.
#@Josef Hochgerner
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1822
#arnetid1824

#*Internet Service Architectures and ATM - The ELISA Approach.
#@Berthold F. Koch,Christian Prehofer
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1823
#arnetid1825

#*Developing a Reference Model for Networked Flexible Work through Industry Trials.
#@David Leevers
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1824
#arnetid1826

#*New Business Paradigms.
#@Horace Mitchell
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1825
#arnetid1827

#*UMPTIDUMPTI - Anytime, Anywhere, Anybody - UMTS for ALL.
#@Alistair Munro
#year1999
#confFlexible Working - New Network Technologies
#citation2
#index1826
#arnetid1828

#*Giving Mobile Users Access to Net-Based Services - A Mobile Agent Approach.
#@Riccardo Pascotto,Björn Schiemann,Ernö Kovacs
#year1999
#confFlexible Working - New Network Technologies
#citation2
#index1827
#arnetid1829

#*Gestalt - On-line Education and Training - State of the Art.
#@Kevin Riley
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1828
#arnetid1830

#*TECODIS. The Experience of Teleworking for Software Developers.
#@Julio López Roldan
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1829
#arnetid1831

#*Flexible Working Technology for Sustainable Development and Social Inclusion.
#@Frank Wilson
#year1999
#confFlexible Working - New Network Technologies
#citation0
#index1830
#arnetid1832

#*On Modeling Conformance for Flexible Transformation over Data Models.
#@Shawn Bowers,Lois M. L. Delcambre
#year2003
#confKnowledge Transformation for the Semantic Web
#citation21
#index1831
#arnetid1833

#*Knowledge Representation and Transformation in Ontology-based Data Integration.
#@Silvana Castano,Alfio Ferrara
#year2003
#confKnowledge Transformation for the Semantic Web
#citation6
#index1832
#arnetid1834

#*The 'Family of Languages' Approach to Semantic Interoperability.
#@Jérôme Euzenat,Heiner Stuckenschmidt
#year2003
#confKnowledge Transformation for the Semantic Web
#citation0
#index1833
#arnetid1835

#*UML for the Semantic Web: Transformation-Based Approaches.
#@Kateryna Falkovych,Marta Sabou,Heiner Stuckenschmidt
#year2003
#confKnowledge Transformation for the Semantic Web
#citation73
#index1834
#arnetid1836

#*Tracing Data Lineage Using Schema Transformation Pathways.
#@Hao Fan,Alexandra Poulovassilis
#year2003
#confKnowledge Transformation for the Semantic Web
#citation-1
#index1835
#arnetid1837

#*Transforming UML Domain Descriptions into Configuration Knowledge Bases.
#@Alexander Felfernig,Gerhard Friedrich,Dietmar Jannach,Markus Stumptner,Markus Zanker
#year2003
#confKnowledge Transformation for the Semantic Web
#citation-1
#index1836
#arnetid1838

#*Transforming Data Models with UML.
#@Martin Gogolla,Arne Lindow
#year2003
#confKnowledge Transformation for the Semantic Web
#citation12
#index1837
#arnetid1839

#*Schema Conversion Methods between XML and Relational Models.
#@Dongwon Lee,Murali Mani,Wesley W. Chu
#year2003
#confKnowledge Transformation for the Semantic Web
#citation-1
#index1838
#arnetid1840

#*RDFT: A Mapping Meta-Ontology for Web Service Integration.
#@Borys Omelayenko
#year2003
#confKnowledge Transformation for the Semantic Web
#citation6
#index1839
#arnetid1841

#*A Logic Programming Approach to RDF Document and Query Transformation.
#@Joachim Peer
#year2003
#confKnowledge Transformation for the Semantic Web
#citation10
#index1840
#arnetid1842

#*Ontology Extraction for Distributed Environments.
#@Derek H. Sleeman,Stephen Potter,David Robertson,W. Marco Schorlemmer
#year2003
#confKnowledge Transformation for the Semantic Web
#citation13
#index1841
#arnetid1843

#*Knowledge Transformation for the Semantic Web
#@Borys Omelayenko,Michel C. A. Klein
#year2003
#confFrontiers in Artificial Intelligence and Applications
#citation6
#index1842
#arnetid1844

#*Machine Reconstruction of Human Control Strategies
#@Dorian Suc
#year2003
#confFrontiers in Artificial Intelligence and Applications
#citation27
#index1843
#arnetid1845

#*Flexible Working - New Network Technologies
#@Birte Christensen-Dalsgaard,William Donnelly,Michael Griffith
#year1999
#conf
#citation1
#index1844
#arnetid1846

#*Natural Language Processing for Online Applications: Text Retrieval, Extraction & Categorization
#@Peter Jackson,Isabelle Moulinier
#year2002
#conf
#citation-1
#index1845
#arnetid1847

#*WFMS: The Next Generation of Distributed Processing Tools.
#@Gustavo Alonso,C. Mohan
#year1997
#confAdvanced Transaction Models and Architectures
#citation-1
#index1846
#arnetid1848

#*Semantic-Based Decomposition of Transactions.
#@Paul Ammann,Sushil Jajodia,Indrakshi Ray
#year1997
#confAdvanced Transaction Models and Architectures
#citation0
#index1847
#arnetid1849

#*An Extensible Approach to Realizing Advanced Transaction Models.
#@Eman Anwar,Sharma Chakravarthy,Marisa S. Viveros
#year1997
#confAdvanced Transaction Models and Architectures
#citation6
#index1848
#arnetid1850

#*The Reflective Transaction Framework.
#@Roger S. Barga,Calton Pu
#year1997
#confAdvanced Transaction Models and Architectures
#citation3
#index1849
#arnetid1851

#*Customizable Concurrency Control for Persistent Java.
#@Laurent Daynès,Malcolm P. Atkinson,Patrick Valduriez
#year1997
#confAdvanced Transaction Models and Architectures
#citation23
#index1850
#arnetid1852

#*Inter- and Intra-Transaction Parallelism for Combined OLTP/OLAP Workloads.
#@Christof Hasse,Gerhard Weikum
#year1997
#confAdvanced Transaction Models and Architectures
#citation-1
#index1851
#arnetid1853

#*Transaction Optimization Techniques.
#@Abdelsalam Helal,Y. Kim,Marian H. Nodine,Ahmed K. Elmagarmid,Abdelsalam Heddaya
#year1997
#confAdvanced Transaction Models and Architectures
#citation3
#index1852
#arnetid1854

#*Towards Distributed Real-Time Concurrency and Coordination Control.
#@Paul A. Jensen,Nandit Soparkar,Malek Tayara
#year1997
#confAdvanced Transaction Models and Architectures
#citation-1
#index1853
#arnetid1855

#*Flexible Commit Protocols for Advanced Transaction Processing.
#@Luigi V. Mancini,Indrajit Ray,Sushil Jajodia,Elisa Bertino
#year1997
#confAdvanced Transaction Models and Architectures
#citation7
#index1854
#arnetid1856

#*Toward Formalizing Recovery of (Advanced) Transactions.
#@Cris Pedregal Martin,Krithi Ramamritham
#year1997
#confAdvanced Transaction Models and Architectures
#citation7
#index1855
#arnetid1857

#*ConTracts Revisited.
#@Andreas Reuter,Kerstin Schneider,Friedemann Schwenkreis
#year1997
#confAdvanced Transaction Models and Architectures
#citation44
#index1856
#arnetid1858

#*Transaction Processing in Broadcast Disk Environments.
#@Jayavel Shanmugasundaram,Arvind Nithrakashyap,Jitendra Padhye,Rajendran M. Sivasankaran,Ming Xiong,Krithi Ramamritham
#year1997
#confAdvanced Transaction Models and Architectures
#citation15
#index1857
#arnetid1859

#*Transactions in Transactional Workflows.
#@Devashish Worah,Amit P. Sheth
#year1997
#confAdvanced Transaction Models and Architectures
#citation26
#index1858
#arnetid1860

#*Logical Handling of Inconsistent and Default Information.
#@Philippe Besnard,Luis Fariñas del Cerro,Dov M. Gabbay,Anthony Hunter
#year1996
#confUncertainty Management in Information Systems
#citation4
#index1859
#arnetid1861

#*Approximate Reasoning Systems: Handling Uncertainty and Imprecision in Information Systems.
#@Piero P. Bonissone
#year1996
#confUncertainty Management in Information Systems
#citation0
#index1860
#arnetid1862

#*An Introduction to the Fuzzy Set and Possibility Theory-Based Treatment of Flexible Queries and Uncertain or Imprecise Databases.
#@Patrick Bosc,Henri Prade
#year1996
#confUncertainty Management in Information Systems
#citation-1
#index1861
#arnetid1863

#*Uncertainty in Intelligent Databases.
#@Robert Demolombe
#year1996
#confUncertainty Management in Information Systems
#citation9
#index1862
#arnetid1864

#*A Bibliography on Uncertainty Management in Information Systems.
#@Curtis E. Dyreson
#year1996
#confUncertainty Management in Information Systems
#citation34
#index1863
#arnetid1865

#*Probabilistic and Bayesian Representations of Uncertainty in Information Systems: A Pragmatic Introduction.
#@Max Henrion,Henri Jacques Suermondt,David Heckerman
#year1996
#confUncertainty Management in Information Systems
#citation-1
#index1864
#arnetid1866

#*Uncertain, Incomplete, and Inconsistent Data in Scientific and Statistical Databases.
#@Stephen K. Kwan,Frank Olken,Doron Rotem
#year1996
#confUncertainty Management in Information Systems
#citation20
#index1865
#arnetid1867

#*On the Classification of Uncertainty Techniques in Relation to the Application Needs.
#@E. H. Mamdani
#year1996
#confUncertainty Management in Information Systems
#citation3
#index1866
#arnetid1868

#*Introduction.
#@Amihai Motro
#year1996
#confUncertainty Management in Information Systems
#citation-1
#index1867
#arnetid1869

#*Sources of Uncertainty, Imprecision, and Inconsistency in Information Systems.
#@Amihai Motro
#year1996
#confUncertainty Management in Information Systems
#citation-1
#index1868
#arnetid1870

#*Knowledge Discovery and Acquisition From Imperfect Information.
#@Gregory Piatetsky-Shapiro
#year1996
#confUncertainty Management in Information Systems
#citation1
#index1869
#arnetid1871

#*Imperfect Information: Imprecision and Uncertainty.
#@Philippe Smets
#year1996
#confUncertainty Management in Information Systems
#citation101
#index1870
#arnetid1872

#*The Transferable Belief Model for Belief Representation.
#@Philippe Smets,Rudolf Kruse
#year1996
#confUncertainty Management in Information Systems
#citation16
#index1871
#arnetid1873

#*Uncertainty in Information Retrieval Systems.
#@Howard R. Turtle,W. Bruce Croft
#year1996
#confUncertainty Management in Information Systems
#citation29
#index1872
#arnetid1874

#*Imperfect Information in Relational Databases.
#@Esteban Zimányi,Alain Pirotte
#year1996
#confUncertainty Management in Information Systems
#citation36
#index1873
#arnetid1875

#*STORM: An Object-Oriented Multimedia DBMS.
#@Michel E. Adiba
#year1996
#confMultimedia Database Systems
#citation17
#index1874
#arnetid1876

#*Synchronization and User Interaction in Distributed Multimedia Presentation Systems.
#@Donald A. Adjeroh,Moon-Chuen Lee
#year1996
#confMultimedia Database Systems
#citation6
#index1875
#arnetid1877

#*Database Approach for the Management of Multimedia Information.
#@Scott T. Campbell,Soon Myoung Chung
#year1996
#confMultimedia Database Systems
#citation-1
#index1876
#arnetid1878

#*A Visual Multimedia Query Language for Temporal Analysis of Video Data.
#@Stacie Hibino,Elke A. Rundensteiner
#year1996
#confMultimedia Database Systems
#citation35
#index1877
#arnetid1879

#*A Multimedia Query Specification Language.
#@Na'el Hirzalla,Ahmed Karmouch
#year1996
#confMultimedia Database Systems
#citation24
#index1878
#arnetid1880

#*Searching and Browsing a Shared Video Database.
#@Rune Hjelsvold,Roger Midtstraum,Olav Sandstå
#year1996
#confMultimedia Database Systems
#citation37
#index1879
#arnetid1881

#*Load-Balanced Data Placement for Variable-Rate Continuous Media Retrieval.
#@Taeck-Geun Kwon,Sukho Lee
#year1996
#confMultimedia Database Systems
#citation4
#index1880
#arnetid1882

#*Multimedia DBMS - Reality of Hype?
#@Cyril U. Orji
#year1996
#confMultimedia Database Systems
#citation0
#index1881
#arnetid1883

#*Model for Interactive Retrieval of Videos and Still Images.
#@Brigitte Simonnot,Malika Smaïl
#year1996
#confMultimedia Database Systems
#citation6
#index1882
#arnetid1884

#*Playout Management in Multimedia Database Systems.
#@Heiko Thimm,Wolfgang Klas
#year1996
#confMultimedia Database Systems
#citation14
#index1883
#arnetid1885

#*An Object-Oriented Modeling of Multimedia Database Objects and Applications.
#@Michalis Vazirgiannis
#year1996
#confMultimedia Database Systems
#citation6
#index1884
#arnetid1886

#*Integration of Simulation and Multimedia in Automatically Generated Internet Courses.
#@Manuel Alfonseca,Juan de Lara
#year2000
#confComputers and Education in the 21st Century
#citation4
#index1885
#arnetid1887

#*A Visual Simulation Environment for MIPS Based on VHDL.
#@J. M. Álvarez,N. Pavón,J. Ballesteros
#year2000
#confComputers and Education in the 21st Century
#citation-1
#index1886
#arnetid1888

#*An Authoring Environment for the SimulNet Educational Platform.
#@Luis E. Anido-Rifón,Martín Llamas Nistal,Manuel J. Fernández Iglesias,Juan C. Burguillo-Rial,C. Brandin,Juan M. Santos,Manuel Caeiro
#year2000
#confComputers and Education in the 21st Century
#citation-1
#index1887
#arnetid1889

#*BabelWin: An environment for learning and monitoring reading and writing skills.
#@L. Aranda,S. Torres,Mónica Trella,Ricardo Conejo
#year2000
#confComputers and Education in the 21st Century
#citation3
#index1888
#arnetid1890

#*An Internet Distance-Learning Operating Model.
#@Jesus Boticario,Elena Gaudioso
#year2000
#confComputers and Education in the 21st Century
#citation5
#index1889
#arnetid1891

#*Synchronous Drawing Actions in Environments of Collaborative Learning of Design.
#@Crescencio Bravo,Miguel A. Redondo,José Bravo,Manuel Ortega,M. Lacruz
#year2000
#confComputers and Education in the 21st Century
#citation3
#index1890
#arnetid1892

#*Interconnecting Courseware Modules via WWW.
#@Juan C. Burguillo-Rial,Luis E. Anido-Rial,J. V. Benlloch,Félix Buendía
#year2000
#confComputers and Education in the 21st Century
#citation-1
#index1891
#arnetid1893

#*APRISA: A Tool for Teaching the Interconnection of Open Systems.
#@E. M. De la Calzada,Belén Curto,Ana María Moreno,Vidal Moreno,Francisco J. Blanco,F. J. García
#year2000
#confComputers and Education in the 21st Century
#citation0
#index1892
#arnetid1894

#*Adaptive Internet-based learning with the TANGOW system.
#@Rosa M. Carro,Estrella Pulido,Pilar Rodríguez
#year2000
#confComputers and Education in the 21st Century
#citation0
#index1893
#arnetid1895

#*Interactive Mathematics Teaching with Mathedu.
#@Fernando Díez,Roberto Moriyón
#year2000
#confComputers and Education in the 21st Century
#citation0
#index1894
#arnetid1896

#*Teaching Support Units.
#@Ramón Fabregat,José-Luis Marzo,Clara Inés Peña de Carrillo
#year2000
#confComputers and Education in the 21st Century
#citation18
#index1895
#arnetid1897

#*The Interactive Physics Course on the Internet.
#@A. Franco
#year2000
#confComputers and Education in the 21st Century
#citation-1
#index1896
#arnetid1898

#*Task Based Training of Application Users.
#@F. García,F. Moriyón
#year2000
#confComputers and Education in the 21st Century
#citation0
#index1897
#arnetid1899

#*SUMA Project (Open Murcia University Services).
#@A. Gómez,P. García,Jesús Egea,Jose Jaime Meseguer,Tomas Jiménez
#year2000
#confComputers and Education in the 21st Century
#citation0
#index1898
#arnetid1900

#*Introducing Waves Using Simulations Controled From Html Files.
#@M. A. Hernández,J. M. Zamarro,E. Martín
#year2000
#confComputers and Education in the 21st Century
#citation-1
#index1899
#arnetid1901

#*Using Bayesian Networks in Computerized Adaptive Tests.
#@Eva Millán,Mónica Trella,José-Luis Pérez-de-la-Cruz,Ricardo Conejo
#year2000
#confComputers and Education in the 21st Century
#citation2
#index1900
#arnetid1902

#*XML-based Integration of Hypermedia Design and Component-Based Techniques in the Production of Educational Applications.
#@Antonio Navarro,José Luis Sierra,Baltasar Fernández-Manjón,Alfredo Fernández-Valmayor
#year2000
#confComputers and Education in the 21st Century
#citation3
#index1901
#arnetid1903

#*Computers in Education: the Near Future.
#@Manuel Ortega
#year2000
#confComputers and Education in the 21st Century
#citation14
#index1902
#arnetid1904

#*Learning Basque in a Distance-Adaptive way.
#@Tomás A. Pérez,R. López,Julián Gutiérrez Serrano,A. González
#year2000
#confComputers and Education in the 21st Century
#citation5
#index1903
#arnetid1905

#*Collaborative planning for problem solution in distance learning.
#@Miguel A. Redondo,Crescencio Bravo,José Bravo,Manuel Ortega
#year2000
#confComputers and Education in the 21st Century
#citation1
#index1904
#arnetid1906

#*High Level Design of Web-Based Environments for Distance Education.
#@Miguel Rodríguez-Artacho,M. Felisa Verdejo
#year2000
#confComputers and Education in the 21st Century
#citation1
#index1905
#arnetid1907

#*M.A.C. A Hypermedia System for Learning Electronics.
#@Angel Salaverría,María José Moure,María Dolores Valdés,Enrique Mandado,Manuel Pérez Cota
#year2000
#confComputers and Education in the 21st Century
#citation0
#index1906
#arnetid1908

#*Computer-Human Learning.
#@Pedro P. Sánchez-Villalón
#year2000
#confComputers and Education in the 21st Century
#citation0
#index1907
#arnetid1909

#*Natural Language Processing in Educational Computer Science.
#@Antonio Vaquero
#year2000
#confComputers and Education in the 21st Century
#citation0
#index1908
#arnetid1910

#*Educational Web Sites: Some Issues for Evaluation.
#@M. Felisa Verdejo
#year2000
#confComputers and Education in the 21st Century
#citation0
#index1909
#arnetid1911

#*Building a Virtual Learning Environment Using Agents.
#@A. A. Rodon,Enric Mor,Francesc Santanach Delisau
#year2000
#confComputers and Education in the 21st Century
#citation0
#index1910
#arnetid1912

#*Approach to Intelligent Adaptive Testing.
#@N. Neira,Alfredo Alguero,José Antonio López Brugos,Víctor G. García
#year2000
#confComputers and Education in the 21st Century
#citation-1
#index1911
#arnetid1913

#*Evaluation Criteria for Hypermedia Educational Systems.
#@Ignacio Aedo,Paloma Díaz
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation7
#index1912
#arnetid1914

#*Using teachers as heuristics evaluators of educational software interfaces.
#@E. R. de Almeida,M. Levacov,José Valdeni de Lima,M. Soares
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation-1
#index1913
#arnetid1915

#*Creating Collaborative Environments for Web-based Training Scenarios.
#@Luis E. Anido-Rifón,Manuel Caeiro,Martín Llamas Nistal,Manuel J. Fernández Iglesias
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation-1
#index1914
#arnetid1916

#*The Next Step in Computer Based Education: the Learning Technologies Standardisation.
#@Luis E. Anido-Rifón,Martín Llamas Nistal,Manuel J. Fernández Iglesias,Juan M. Santos,Manuel Caeiro
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation-1
#index1915
#arnetid1917

#*Advanced Learning Environments: Changed Views and Future Perspectives.
#@Rosa Maria Bottino
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation22
#index1916
#arnetid1918

#*Development of Didactic Resources for Distance Learning based on Simulation.
#@Félix Buendía,J. V. Benlloch,J. M. Gómez
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation3
#index1917
#arnetid1919

#*TutorMap. Past, Present and Future of a Mathematics Tutoring System.
#@R. Criado,A. Gallinari,J. Ángel Velázquez-Iturbide
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation0
#index1918
#arnetid1920

#*Learning Communities in the Web: Concepts and strategies.
#@Paulo Dias
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation6
#index1919
#arnetid1921

#*Symbolic Calculus Training by Means of MathTrainer.
#@Fernando Díez,Roberto Moriyón
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation1
#index1920
#arnetid1922

#*EJS: An Authoring Tool to Develop Java Applications.
#@F. Esquembre,J. M. Zamarro
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation4
#index1921
#arnetid1923

#*ADAM CASE. Using upper CASE tools in Software Engineering Laboratory.
#@Francisco José García Peñalvo,M. N. Moreno,Ana María Moreno,G. González,Belén Curto,Francisco J. Blanco
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation1
#index1922
#arnetid1924

#*SICAS. Interactive system for algorithm development and simulation.
#@A. Gomes,A. J. Mendes
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation12
#index1923
#arnetid1925

#*Simurob and JRF. Teaching tools for robot simulation and programming.
#@J. L. Gómez,I. Álvarez,Francisco J. Blanco,F. J. García,Belén Curto
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation0
#index1924
#arnetid1926

#*Collares Ortofónicos. System for the training of the suprasegmental parameters of intensity and rhythm of the articulated sound.
#@F. J. González,S. Torres,Ricardo Conejo
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation0
#index1925
#arnetid1927

#*EXercita. A System for Archiving and Publishing Programming Exercises.
#@Carlos Gregorio-Rodríguez,Luis Fernando Llana Díaz,R. Martínez,Pedro Palao-Gostanza,Cristóbal Pareja-Flores,J. Ángel Velázquez-Iturbide
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation2
#index1926
#arnetid1928

#*Interactive Design of Adaptive Courses.
#@José Antonio Macías Iglesias,Pablo Castells
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation7
#index1927
#arnetid1929

#*Using Simulation and Virtual Reality for Distance Education.
#@Juan de Lara,Manuel Alfonseca
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation1
#index1928
#arnetid1930

#*ED68K. A design framework for the development of digital systems based on MC68000.
#@Marisa Luisa López-Vallejo,J. M. Fernández Freire,J. Colás
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation0
#index1929
#arnetid1931

#*An Experience on Virtual Teaching: AulaNet.
#@A. J. López,R. Pérez
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation10
#index1930
#arnetid1932

#*Guided Collaborative Chess Tutoring through Game History Analysis.
#@Miguel Angel Mora,Roberto Moriyón
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation5
#index1931
#arnetid1933

#*Using Analysis, Design and Development of Hypermedia Applications in the Educational Domain.
#@Antonio Navarro,Alfredo Fernández-Valmayor,Baltasar Fernández-Manjón,José Luis Sierra
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation0
#index1932
#arnetid1934

#*Ubiquitous Computing and Collaboration. New interaction paradigms in the classroom for the 21st Century.
#@Manuel Ortega,Miguel A. Redondo,Maximiliano Paredes,Pedro P. Sánchez-Villalón,Crescencio Bravo,José Bravo
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation-1
#index1933
#arnetid1935

#*Shared Whiteboard Manager and Student Notebook for the PLAN-G Telematic Platform.
#@Clara Inés Peña de Carrillo,Ramón Fabregat,Anna Urra,Monserrat Vallès Rocha,José-Luis Marzo
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation0
#index1934
#arnetid1936

#*Creation of a Multimedia System for Learning about Oscillations.
#@G. Pedrós Pérez,A. Pontes,P. Martínez-Jiménez,A. Amo
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation-1
#index1935
#arnetid1937

#*Guiding the user. An element to aid knowledge construction in adaptive hypermedia systems.
#@Tomás A. Pérez,Julián Gutiérrez Serrano,Ricardo López Pietro,A. González,José Ángel Vadillo Zorita
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation1
#index1936
#arnetid1938

#*Pedagogical Strategies With Hypermedia. Limiting access to hyperspace for educational purposes.
#@Tomás A. Pérez,Julián Gutiérrez Serrano,Ricardo López Pietro,A. González,José Ángel Vadillo Zorita
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation0
#index1937
#arnetid1939

#*Artificial Intelligence in the HyperClass: Design Issues.
#@John Tiffin,Nobuyoshi Terashima,Lalita Rajasingham
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation0
#index1938
#arnetid1940

#*Improving the Language Mastery through Responsive Environments.
#@Antonio Vaquero,Fernando Sáenz,A. Barco
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation6
#index1939
#arnetid1941

#*Test Construction and Management with Network Adaptive Control.
#@J. A. Díaz Villalta,Ángel Neira,Alfredo Alguero,José Antonio López Brugos
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation-1
#index1940
#arnetid1942

#*Foundations of Programming: a Teaching Improvement.
#@María-Victoria Belmonte,Carlos Cotta,Antonio J. Fernández,I. Gómez,Jose Luis Pastrana,J. A. Pedreira,Francisco Rus,Enrique Soler
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation1
#index1941
#arnetid1943

#*HCI Curricula in Spain. A cooperatively designed, free Web-access syllabus.
#@Jesús Lorés,Julio Abascal,José J. Cañas,Ignacio Aedo,Miguel Gea,M. Ortega,Luis Alfonso Ureña López,P. M. Valero,M. Velez
#year2001
#confComputers and Education. Towards an Interconnected Society
#citation1
#index1942
#arnetid1944

#*SQL-92 Compatibility Issues.
#@Michael D. Soo,Nick Kline,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation4
#index1943
#arnetid1945

#*Temporal Data Types.
#@Michael D. Soo,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation2
#index1944
#arnetid1946

#*Aggregates
#@Nick Kline,Richard T. Snodgrass,T. Y. Cliff Leung
#year1995
#confThe TSQL2 Temporal Query Language
#citation-1
#index1945
#arnetid1947

#*Modification.
#@T. Y. Cliff Leung,Christian S. Jensen,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation-1
#index1946
#arnetid1948

#*A Second Example.
#@Richard T. Snodgrass,Christian S. Jensen,Curtis E. Dyreson,Wolfgang Käfer,Nick Kline,John F. Roddick
#year1995
#confThe TSQL2 Temporal Query Language
#citation-1
#index1947
#arnetid1949

#*Schema Specification.
#@Richard T. Snodgrass,Christian S. Jensen,Fabio Grandi
#year1995
#confThe TSQL2 Temporal Query Language
#citation-1
#index1948
#arnetid1950

#*The From Clause.
#@Richard T. Snodgrass,Christian S. Jensen,Fabio Grandi
#year1995
#confThe TSQL2 Temporal Query Language
#citation-1
#index1949
#arnetid1951

#*Rationale for a Temporal Extension to SQL.
#@Richard T. Snodgrass,Henry Kucera
#year1995
#confThe TSQL2 Temporal Query Language
#citation-1
#index1950
#arnetid1952

#*Supporting Multiple Calendars.
#@Richard T. Snodgrass,Michael D. Soo
#year1995
#confThe TSQL2 Temporal Query Language
#citation3
#index1951
#arnetid1953

#*The Surrogate Data Type.
#@Christian S. Jensen,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation2
#index1952
#arnetid1954

#*Vacuuming.
#@Christian S. Jensen
#year1995
#confThe TSQL2 Temporal Query Language
#citation22
#index1953
#arnetid1955

#*The Data Model for Time.
#@Curtis E. Dyreson,Michael D. Soo,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation9
#index1954
#arnetid1956

#*A Timestamp Representation.
#@Curtis E. Dyreson,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation7
#index1955
#arnetid1957

#*Temporal Granularity.
#@Curtis E. Dyreson,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation30
#index1956
#arnetid1958

#*Temporal Indeterminancy.
#@Curtis E. Dyreson,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation14
#index1957
#arnetid1959

#*The Baseline Clock.
#@Curtis E. Dyreson,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation5
#index1958
#arnetid1960

#*``Now''.
#@James Clifford,Curtis E. Dyreson,Richard T. Snodgrass,Tomás Isakowitz,Christian S. Jensen
#year1995
#confThe TSQL2 Temporal Query Language
#citation-1
#index1959
#arnetid1961

#*Valid-Time Selection and Projection.
#@Suchen H. Hsu,Christian S. Jensen,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation0
#index1960
#arnetid1962

#*Cursors.
#@Christian S. Jensen,Richard T. Snodgrass,T. Y. Cliff Leung
#year1995
#confThe TSQL2 Temporal Query Language
#citation-1
#index1961
#arnetid1963

#*The TSQL2 Data Model.
#@Christian S. Jensen,Richard T. Snodgrass,Michael D. Soo
#year1995
#confThe TSQL2 Temporal Query Language
#citation26
#index1962
#arnetid1964

#*Transaction Time Support.
#@John F. Roddick,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation-1
#index1963
#arnetid1965

#*Schema Versioning.
#@John F. Roddick,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation-1
#index1964
#arnetid1966

#*Introduction to TSQL2.
#@Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation-1
#index1965
#arnetid1967

#*TSQL2 Tutorial.
#@Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation-1
#index1966
#arnetid1968

#*Event Tables.
#@Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation3
#index1967
#arnetid1969

#*An Algebra for TSQL2
#@Michael D. Soo,Christian S. Jensen,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation23
#index1968
#arnetid1970

#*An Architectural Framework.
#@Michael D. Soo,Christian S. Jensen,Richard T. Snodgrass
#year1995
#confThe TSQL2 Temporal Query Language
#citation0
#index1969
#arnetid1971

#*Frontmatter.
#@
#year1995
#confThe TSQL2 Temporal Query Language
#citation0
#index1970
#arnetid1972

#*References, Author Index, Syntax Index, Subject Index.
#@
#year1995
#confThe TSQL2 Temporal Query Language
#citation0
#index1971
#arnetid1973

#*Language Specification.
#@
#year1995
#confThe TSQL2 Temporal Query Language
#citation0
#index1972
#arnetid1974

#*Clustering in Metric Spaces with Applications to Information Retrieval.
#@Ricardo A. Baeza-Yates,Benjamin Bustos,Edgar Chávez,Norma Herrera,Gonzalo Navarro
#year2003
#confClustering and Information Retrieval
#citation2
#index1973
#arnetid1975

#*Techniques for Textual Document Indexing and Retrieval Knowledge Sources and Data Mining.
#@Wesley W. Chu,Zhenyu Liu,Wenlei Mao
#year2003
#confClustering and Information Retrieval
#citation5
#index1974
#arnetid1976

#*A Science Data System Architecture for Information Retrieval.
#@Daniel J. Crichton,J. Steven Hughes,Sean C. Kelly
#year2003
#confClustering and Information Retrieval
#citation14
#index1975
#arnetid1977

#*Finding Topics in Collections of Documents: A Shared Nearest Neighbor Approach.
#@Levent Ertöz,Michael Steinbach,Vipin Kumar
#year2003
#confClustering and Information Retrieval
#citation54
#index1976
#arnetid1978

#*Techniques for Clustering Massive Data Sets.
#@Sudipto Guha,Rajeev Rastogi,Kyuseok Shim
#year2003
#confClustering and Information Retrieval
#citation4
#index1977
#arnetid1979

#*On Quantitative Evaluation of Clustering Systems.
#@Ji He,Ah-Hwee Tan,Chew Lim Tan,Sam Yuan Sung
#year2003
#confClustering and Information Retrieval
#citation60
#index1978
#arnetid1980

#*Document Clustering, Visualization, and Retrieval Link Mining.
#@Steven Noel,Vijay V. Raghavan,Chee-Hung Henry Chu
#year2003
#confClustering and Information Retrieval
#citation-1
#index1979
#arnetid1981

#*Clustering Techniques for Large Database Cleansing.
#@Sam Yuan Sung,Zhao Li,Tok Wang Ling
#year2003
#confClustering and Information Retrieval
#citation-1
#index1980
#arnetid1982

#*Query Clustering in the Web Context.
#@Ji-Rong Wen,HongJiang Zhang
#year2003
#confClustering and Information Retrieval
#citation14
#index1981
#arnetid1983

#*Granular Computing for the Design of Information Retrieval Support Systems.
#@Yiyu Yao
#year2003
#confClustering and Information Retrieval
#citation65
#index1982
#arnetid1984

#*Indexing Techniques for Advanced Database Systems
#@Elisa Bertino,Beng Chin Ooi,Ron Sacks-Davis,Kian-Lee Tan,Justin Zobel,Boris Shidlovsky,Barbara Catania
#year1997
#conf
#citation105
#index1983
#arnetid1985

#*Advanced Relational Programming: Mathematics and Its Applications.
#@Filippo Cacace,Gianfranco Lamperti
#year1996
#confMathematics and Its Applications
#citation-1
#index1984
#arnetid1986

#*Mining the World Wide Web: An Information Search Approach
#@George Jyh-Shian Chang,Marcus J. Healey,James A. M. McHugh,Jason Tsong-Li Wang
#year2001
#conf
#citation71
#index1985
#arnetid1987

#*Logics for Databases and Information Systems (the book grow out of the Dagstuhl Seminar 9529: Role of Logics in Information Systems, 1995)
#@Jan Chomicki,Gunter Saake
#year1998
#conf
#citation-1
#index1986
#arnetid1988

#*The Discovery of the Artificial. Behavior, Mind and Machines Before and Beyond Cybernetics
#@Roberto Cordeschi
#year2002
#confStudies in Cognitive Systems
#citation42
#index1987
#arnetid1989

#*Multimedia Mining: A Highway to Intelligent Multimedia Documents
#@Chabane Djeraba
#year2002
#confMultimedia Systems and Applications
#citation17
#index1988
#arnetid1990

#*Client Data Caching: A Foundation for High Performance Object Oriented Database Systems
#@Michael J. Franklin
#year1996
#conf
#citation-1
#index1989
#arnetid1991

#*Software Prototyping in Data and Knowledge Engineering
#@Giovanni Guida,Gianfranco Lamperti,Marina Zanella
#year1999
#conf
#citation4
#index1990
#arnetid1992

#*Advanced Transaction Models and Architectures
#@Sushil Jajodia,Larry Kerschberg
#year1997
#conf
#citation160
#index1991
#arnetid1993

#*Advanced Database Indexing
#@Yannis Manolopoulos,Yannis Theodoridis,Vassilis J. Tsotras
#year1999
#confAdvances in Databases Systems
#citation91
#index1992
#arnetid1994

#*Advanced Signature Indexing for Multimedia and Web Applications
#@Yannis Manolopoulos,Alexandros Nanopoulos,Eleni Tousidou
#year2003
#confAdvances in Databases Systems
#citation1
#index1993
#arnetid1995
#!:Advanced Signature Indexing for Multimedia and Web Applications is an excellent reference for professionals involved in the development of applications in multimedia databases or the Web and may also serve as a textbook for advanced level courses in database and information retrieval systems.

#*Ontology-Based Query Processing for Global Information Systems
#@Eduardo Mena,Arantza Illarramendi
#year2001
#conf
#citation54
#index1994
#arnetid1996
#!Ontology-based query processing for global information systems describes an initiative for enhancing query processing in a global information system. The following are some of the relevant features: Providing semantic descriptions of data repositories using ontologies. Dealing with different vocabularies so that users are not forced to use a common one. Defining a strategy that permits the incremental enrichment of answers by visiting new ontologies. Managing imprecise answers and estimations of the incurred loss of information.

#*Compression and Coding Algorithms
#@Alistair Moffat,Andrew Turpin
#year2002
#conf
#citation87
#index1995
#arnetid1997

#*Open Source GIS: A GRASS GIS Approach
#@Markus Neteler,Helena Mitásová
#year2002
#conf
#citation333
#index1996
#arnetid1998

#*Computers and Education in the 21st Century
#@Manuel Ortega,Jose Bravo
#year2000
#conf
#citation7
#index1997
#arnetid1999

#*Computers and Education. Towards an Interconnected Society
#@Manuel Ortega,Jose Bravo
#year2001
#conf
#citation-1
#index1998
#arnetid2000

#*The Design and Implementation of a Log-Structured File-System.
#@Mendel Rosenblum
#year1995
#conf
#citation1462
#index1999
#arnetid2001
#!This dissertation presents a new technique for disk storage management called a log-structured file system. The technique writes all file system changes in large sequential transfers to a log-like structure on disk. The key benefit is a high write performance that is independent of the workload. The large transfers also enable the efficient use of large disk arrays such as RAIDs. The technique minimizes the overhead of computing the redundancy information required by large RAIDs. A log-structured file system achieves high write rates without sacrificing file retrieval performance. Files are read back from the log efficiently due to the indexing information that is maintained The log structure also permits fast recovery from system crashes. Using a recovery system based on checkpoints and roll-forward the log-structured file system can quickly restore the disk to a consistent state. An important focus of this dissertation is the technique used for free space management in a log-structured file system. The approach taken was to divide the disk into large segments to which the log was written. A segment cleaner mechanism exists to compress the live information from heavily fragmented segments. The mechanism reads in the fragmented segments, compacts the live data, and writes the data back to segments on disk. The dissertation includes a series of simulations that demonstrate the efficiency of a simple segment cleaning policy based on cost and benefit. The segment cleaner decides which segments to clean based on a function of the fraction alive in the segment and the age of the data in the segment. I have implemented a prototype log-structured file system called Sprite LFS; it outperforms current Unix file systems by an order of magnitude for small-file writes and matches or exceeds Unix performance for reads and large writes. Even when the overhead for cleaning is included, Sprite LFS can use 70% of the disk bandwidth for writing. Unix file systems typically can use only 5-10%.

#*The TSQL2 Temporal Query Language
#@Richard T. Snodgrass
#year1995
#conf
#citation587
#index2000
#arnetid2002

#*Data Quality
#@Richard Y. Wang,Mostapha Ziad,Yang W. Lee
#year2001
#conf
#citation121
#index2001
#arnetid2003

#*Clustering and Information Retrieval
#@Weili Wu,Hui Xiong,Shashi Shekhar
#year2003
#conf
#citation24
#index2002
#arnetid2004

#*Loop Tiling for Parallelism
#@Jingling Xue
#year2000
#confKluwer International Series in Engineering and Computer Science
#citation79
#index2003
#arnetid2005

#*A Framework for Meta-Information in Digital Libraries.
#@Kate Beard,Terence R. Smith
#year1998
#confMultimedia Data Management
#citation13
#index2004
#arnetid2006

#*Metadata Handling in HyperStorM.
#@Klemens Böhm
#year1998
#confMultimedia Data Management
#citation2
#index2005
#arnetid2007

#*Overview on Using Metadata to manage Multimedia Data.
#@Susanne Boll,Wolfgang Klas,Amit P. Sheth
#year1998
#confMultimedia Data Management
#citation41
#index2006
#arnetid2008

#*Metadata for Mixed-Media Access.
#@Francine Chen,Marti A. Hearst,Don Kimber,Julian Kupiec,Jan O. Pedersen,Lynn Wilcox
#year1998
#confMultimedia Data Management
#citation27
#index2007
#arnetid2009

#*Content-Based Image Retrieval using Metadata and Relaxation Techniques.
#@Wesley W. Chu,Chih-Cheng Hsu,Ion Tim Ieong,Ricky K. Taira
#year1998
#confMultimedia Data Management
#citation8
#index2008
#arnetid2010

#*Metadata Management for Geographic Information Discovery and Exchange.
#@Pamela Drew,Jerry Ying
#year1998
#confMultimedia Data Management
#citation8
#index2009
#arnetid2011

#*Using Metadata for the Intelligent Browsing of Structured Media Objects.
#@William I. Grosky,Farshad Fotouhi,Zhaowei Jiang
#year1998
#confMultimedia Data Management
#citation41
#index2010
#arnetid2012
#%772530
#%256477
#%893881
#%300029
#%833934
#%256340

#*Metadata in Geographic and Environmental Data Management.
#@Oliver Günther,Agnès Voisard
#year1998
#confMultimedia Data Management
#citation25
#index2011
#arnetid2013

#*Video Data Management Systems: Metadata and Architecture.
#@Arun Hampapur,Ramesh Jain
#year1998
#confMultimedia Data Management
#citation17
#index2012
#arnetid2014

#*A Metadatabase System for Semantic Image Search by a Mathematical Model of Meaning.
#@Yasushi Kiyoki,Takashi Kitagawa,Takanari Hayama
#year1998
#confMultimedia Data Management
#citation138
#index2013
#arnetid2015
#%805928
#!In the design of multimedia database systems, one of the most important issues is to extract images dynamically according to the user's impression and the image's contents. In this paper, we present a metadatabase system which realizes the semantic associative search for images by giving keywords representing the user's impression and the image's contents.This metadatabase system provides several functions for performing the semantic associative search for images by using the metadata representing the features of images. These functions are realized by using our proposed mathematical model of meaning. The mathematical model of meaning is extended to compute specific meanings of keywords which are used for retrieving images unambiguously and dynamically. The main feature of this model is that the semantic associative search is performed in the orthogonal semantic space. This space is created for dynamically computing semantic equivalence or similarity between the metadata items of the images and keywords.

#*The Use of Metadata for the Rendering of Personalized Video Delivery.
#@William Klippgen,Thomas D. C. Little,Gulrukh Ahanger,Dinesh Venkatesh
#year1998
#confMultimedia Data Management
#citation9
#index2014
#arnetid2016

#*Metadata for Content-based Retrieval of Speech Recording.
#@Martin Wechsler,Peter Schäuble
#year1998
#confMultimedia Data Management
#citation-1
#index2015
#arnetid2017

#*Microsoft SQL Server (Chapter 27)
#@Sameet Agarwal,José A. Blakeley,Thomas Casey,Kalen Delaney,César A. Galindo-Legaria,Goetz Graefe,Michael Rys,Michael J. Zwilling
#year2001
#confDatabase System Concepts, 4th Edition.
#citation1
#index2016
#arnetid2018

#*Database Systems - Concepts, Languages and Architectures
#@Paolo Atzeni,Stefano Ceri,Stefano Paraboschi,Riccardo Torlone
#year1999
#conf
#citation111
#index2017
#arnetid2019

#*SQL - The Standard Handbook
#@Stephen J. Cannan,Gerard A. M. Otten
#year1993
#conf
#citation4
#index2018
#arnetid2020

#*Distributed Databases: Principles and Systems
#@Stefano Ceri,Giuseppe Pelagatti
#year1984
#conf
#citation969
#index2019
#arnetid2021

#*Introduction to Algorithms
#@Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest
#year1989
#conf
#citation33
#index2020
#arnetid2022

#*Introduction to Algorithms, Second Edition
#@Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,Clifford Stein
#year2001
#conf
#citation-1
#index2021
#arnetid2023

#*Oracle (Chapter 25)
#@Håkan Jakobsson
#year2001
#confDatabase System Concepts, 4th Edition.
#citation0
#index2022
#arnetid2024

#*IBM DB2 Universal Database (Chapter 26)
#@Sriram Padmanabhan
#year2001
#confDatabase System Concepts, 4th Edition.
#citation0
#index2023
#arnetid2025

#*Database Management Systems.
#@Raghu Ramakrishnan
#year1998
#conf
#citation1460
#index2024
#arnetid2026

#*Introduction to Modern Information Retrieval.
#@Gerard Salton,Michael McGill
#year1984
#conf
#citation8440
#index2025
#arnetid2027

#*Multimedia Data Management: Using Metadata to Integrate and Apply Digital Media
#@Amit P. Sheth,Wolfgang Klas
#year1998
#conf
#citation-1
#index2026
#arnetid2028

#*Database System Concepts, 1st Edition.
#@Abraham Silberschatz,Henry F. Korth
#year1986
#conf
#citation0
#index2027
#arnetid2029

#*Database System Concepts, 2nd Edition.
#@Abraham Silberschatz,Henry F. Korth
#year1991
#conf
#citation0
#index2028
#arnetid2030

#*Database System Concepts, 4th Edition.
#@Abraham Silberschatz,Henry F. Korth,S. Sudarshan
#year2001
#conf
#citation0
#index2029
#arnetid2031
#!:This acclaimed revision of a classic database systems text offers a complete background in the basics of database design, languages, and system implementation. It provides the latest information combined with real-world examples to help readers master concepts. All concepts are presented in a technically complete yet easy-to-understand style with notations kept to a minimum. A running example of a bank enterprise illustrates concepts at work. To further optimize comprehension, figures and examples, rather than proofs, portray concepts and anticipate results.

#*Database System Concepts, 3rd Edition.
#@Abraham Silberschatz,Henry F. Korth,S. Sudarshan
#year1997
#conf
#citation0
#index2030
#arnetid2032
#!:This acclaimed revision of a classic database systems text offers a complete background in the basics of database design, languages, and system implementation. It provides the latest information combined with real-world examples to help readers master concepts. All concepts are presented in a technically complete yet easy-to-understand style with notations kept to a minimum. A running example of a bank enterprise illustrates concepts at work. To further optimize comprehension, figures and examples, rather than proofs, portray concepts and anticipate results.

#*Database Design, Revised 2nd Edition.
#@Gio Wiederhold
#year2001
#confDatabase Design
#citation0
#index2031
#arnetid2033

#*Database Design.
#@Gio Wiederhold
#year1977
#conf
#citation473
#index2032
#arnetid2034

#*Database Design, Second Edition.
#@Gio Wiederhold
#year1983
#conf
#citation-1
#index2033
#arnetid2035

#*File Organisation for Database Design.
#@Gio Wiederhold
#year1987
#conf
#citation-1
#index2034
#arnetid2036

#*Extracting Reaction Information from Chemical Databases.
#@C.-S. Ai,Paul E. Blower Jr.,Robert H. Ledwith
#year1991
#confKnowledge Discovery in Databases
#citation6
#index2035
#arnetid2037

#*Integrated Learning in a Real Domain.
#@Francesco Bergadano,Attilio Giordana,Lorenza Saitta,Filippo Brancadori,Davide De Marchi
#year1991
#confKnowledge Discovery in Databases
#citation8
#index2036
#arnetid2038

#*Attribute-Oriented Induction in Relational Databases.
#@Yandong Cai,Nick Cercone,Jiawei Han
#year1991
#confKnowledge Discovery in Databases
#citation-1
#index2037
#arnetid2039

#*Statistical Technique for Extracting Classificatory Knowledge from Databases.
#@Keith C. C. Chan,Andrew K. C. Wong
#year1991
#confKnowledge Discovery in Databases
#citation76
#index2038
#arnetid2040

#*Summary Data Estimation Using Decision Trees.
#@Meng Chang Chen,Lawrence McNamee
#year1991
#confKnowledge Discovery in Databases
#citation10
#index2039
#arnetid2041

#*Information Discovery through Hierarchical Maximum Entropy Discretization and Synthesis.
#@David K. Y. Chiu,Andrew K. C. Wong,B. Cheung
#year1991
#confKnowledge Discovery in Databases
#citation73
#index2040
#arnetid2042

#*Using Functions to Encode Domain and Contextual Knowledge in Statistical Induction.
#@William J. Frawley
#year1991
#confKnowledge Discovery in Databases
#citation6
#index2041
#arnetid2043

#*Knowledge Discovery in Databases: An Overview.
#@William J. Frawley,Gregory Piatetsky-Shapiro,Christopher J. Matheus
#year1991
#confKnowledge Discovery in Databases
#citation1256
#index2042
#arnetid2044

#*The Trade-Off between Knowledge and Data in Knowledge Acquisition.
#@Brian R. Gaines
#year1991
#confKnowledge Discovery in Databases
#citation24
#index2043
#arnetid2045

#*Automated Knowledge Generation From a CAD Database.
#@Avelino J. Gonzalez,Harley R. Myler,Massood Towhidnejad,Frederic D. McKenzie,Robin R. Kladke
#year1991
#confKnowledge Discovery in Databases
#citation3
#index2044
#arnetid2046

#*Incremental Discovery of Rules and Structure by Hierarchical and Parallel Clustering.
#@J. Hong,C. Mao
#year1991
#confKnowledge Discovery in Databases
#citation21
#index2045
#arnetid2047

#*A Support System for Interpreting Statistical Data.
#@Peter Hoschka,Willi Klösgen
#year1991
#confKnowledge Discovery in Databases
#citation57
#index2046
#arnetid2048

#*Mining for Knowledge in Databases: Goals and General Description of the INLEN System.
#@Kenneth A. Kaufman,Ryszard S. Michalski,Larry Kerschberg
#year1991
#confKnowledge Discovery in Databases
#citation80
#index2047
#arnetid2049

#*Automating the Discovery of Causal Relationships in a Medical Records Database: The POSCH AI Project.
#@John M. Long,E. A. Irani,James R. Slagle
#year1991
#confKnowledge Discovery in Databases
#citation-1
#index2048
#arnetid2050

#*Induction of Decision Trees from Complex Structured Data.
#@Michel Manago,Yves Kodratoff
#year1991
#confKnowledge Discovery in Databases
#citation26
#index2049
#arnetid2051

#*Discovery of Medical Diagnostic Information: An Overview of Methods and Results.
#@Mary McLeish,P. Yao,M. Garg,T. Stirtzinger
#year1991
#confKnowledge Discovery in Databases
#citation6
#index2050
#arnetid2052

#*Knowledge Discovery as a Threat to Database Security.
#@Daniel E. O'Leary
#year1991
#confKnowledge Discovery in Databases
#citation71
#index2051
#arnetid2053

#*Minimal-Length Encoding and Inductive Inference.
#@Edwin P. D. Pednault
#year1991
#confKnowledge Discovery in Databases
#citation15
#index2052
#arnetid2054

#*Discovery, Analysis, and Presentation of Strong Rules
#@Gregory Piatetsky-Shapiro
#year1991
#confKnowledge Discovery in Databases
#citation685
#index2053
#arnetid2055

#*On Evaluation of Domain-Independent Scientific Function-Finding Systems.
#@C. Schaffer
#year1991
#confKnowledge Discovery in Databases
#citation2
#index2054
#arnetid2056

#*Justification-Based Refinement of Expert Knowledge.
#@Jeffrey C. Schlimmer,Tom M. Mitchell,John P. McDermott
#year1991
#confKnowledge Discovery in Databases
#citation4
#index2055
#arnetid2057

#*Rule Discovery for Query Optimization.
#@Michael Siegel,Edward Sciore,Sharon C. Salveter
#year1991
#confKnowledge Discovery in Databases
#citation11
#index2056
#arnetid2058

#*Unsupervised Discovery in an Operational Control Setting.
#@Barry G. Silverman,M. R. Hieb,Toufic M. Mezher
#year1991
#confKnowledge Discovery in Databases
#citation1
#index2057
#arnetid2059

#*Rule Induction Using Information Theory.
#@Padhraic Smyth,Rodney M. Goodman
#year1991
#confKnowledge Discovery in Databases
#citation231
#index2058
#arnetid2060

#*Learning Useful Rules from Inconclusive Data.
#@Ramasamy Uthurusamy,Usama M. Fayyad,W. Scott Spangler
#year1991
#confKnowledge Discovery in Databases
#citation46
#index2059
#arnetid2061

#*Integration of Heuristic and Bayesian Approaches in a Pattern-Classification System.
#@Q. Wu,Paul Suetens,André Oosterlinck
#year1991
#confKnowledge Discovery in Databases
#citation4
#index2060
#arnetid2062

#*Discovering Functional Relationships from Observational Data.
#@Y.-H. Wu,S. Wang
#year1991
#confKnowledge Discovery in Databases
#citation14
#index2061
#arnetid2063

#*On Linguistic Summaries of Data.
#@Ronald R. Yager
#year1991
#confKnowledge Discovery in Databases
#citation110
#index2062
#arnetid2064

#*The Discovery, Analysis, and Representation of Data Dependencies in Databases.
#@Wojciech Ziarko
#year1991
#confKnowledge Discovery in Databases
#citation187
#index2063
#arnetid2065

#*Interactive Mining of Regularities in Databases.
#@Jan M. Zytkow,J. Baker
#year1991
#confKnowledge Discovery in Databases
#citation56
#index2064
#arnetid2066

#*Fast Discovery of Association Rules.
#@Rakesh Agrawal,Heikki Mannila,Ramakrishnan Srikant,Hannu Toivonen,A. Inkeri Verkamo
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation2086
#index2065
#arnetid2067

#*Predicting Equity Returns from Securities Data.
#@Chidanand Apté,Se June Hong
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation-1
#index2066
#arnetid2068

#*Finding Patterns in Time Series: A Dynamic Programming Approach.
#@Donald J. Berndt,James Clifford
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation294
#index2067
#arnetid2069

#*The Process of Knowledge Discovery in Databases.
#@Ronald J. Brachman,Tej Anand
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation416
#index2068
#arnetid2070

#*Graphical Models for Discivering Knowledge.
#@Wray L. Buntine
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation-1
#index2069
#arnetid2071

#*Bayesian Classification (AutoClass): Theory and Results.
#@Peter Cheeseman,John Stutz
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation1024
#index2070
#arnetid2072

#*Inductive Logic Programming and Knowledge Discovery in Databases.
#@Saso Dzeroski
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation112
#index2071
#arnetid2073

#*A Statistical Perspective on Knowledge Discovery in Databases.
#@John F. Elder IV,Daryl Pregibon
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation151
#index2072
#arnetid2074

#*Automating the Analysis and Cataloging of Sky Surveys.
#@Usama M. Fayyad,S. George Djorgovski,Nicholas Weir
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation140
#index2073
#arnetid2075

#*From Data Mining to Knowledge Discovery: An Overview.
#@Usama M. Fayyad,Gregory Piatetsky-Shapiro,Padhraic Smyth
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation2006
#index2074
#arnetid2076

#*Transformation Rules and Trees.
#@Brian R. Gaines
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation1
#index2075
#arnetid2077

#*Discovering Informative Patterns and Data Cleaning.
#@Isabelle Guyon,Nada Matic,Vladimir Vapnik
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation174
#index2076
#arnetid2078

#*Attribute-Oriented Induction in data Mining.
#@Jiawei Han,Yongjian Fu
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation-1
#index2077
#arnetid2079

#*Bayesian Networks for Knowledge Discovery.
#@David Heckerman
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation166
#index2078
#arnetid2080

#*Data Surveyor: Searching the Nuggets in Parallel.
#@Marcel Holsheimer
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation54
#index2079
#arnetid2081

#*Using Inductive Learning To Generate Rules for Semantic Query Optimization.
#@Chun-Nan Hsu,Craig A. Knoblock
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation42
#index2080
#arnetid2082

#*Explora: A Multipattern and Multistrategy Discovery Assistant.
#@Willi Klösgen
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation254
#index2081
#arnetid2083

#*Knowledge Discovery in Database Terminology.
#@Willi Klösgen,Jan M. Zytkow
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation-1
#index2082
#arnetid2084

#*Selecting and reporting What Is Interesting.
#@Christopher J. Matheus,Gregory Piatetsky-Shapiro,Dwight McNeill
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation96
#index2083
#arnetid2085

#*Data Mining and Knowledge Discovery Internet Resources.
#@Gregory Piatetsky-Shapiro
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation2
#index2084
#arnetid2086

#*Metaqueries for Data Mining.
#@Wei-Min Shen,KayLiang Ong,Bharat G. Mitbander,Carlo Zaniolo
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation100
#index2085
#arnetid2087

#*Integrating Inductive and Deductive Reasoning for Data Mining.
#@Evangelos Simoudis,Brian Livezey,Randy Kerber
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation36
#index2086
#arnetid2088

#*Modeling Subjective Uncertainty in Image Annotation.
#@Padhraic Smyth,Usama M. Fayyad,Michael C. Burl,Pietro Perona
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation13
#index2087
#arnetid2089

#*From Data Mining to Knowledge Discovery: Current Challenges and Future Directions.
#@Ramasamy Uthurusamy
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation35
#index2088
#arnetid2090

#*From Contingency Tables to Various Forms of Knowledge in Databases.
#@Robert Zembowicz,Jan M. Zytkow
#year1996
#confAdvances in Knowledge Discovery and Data Mining
#citation61
#index2089
#arnetid2091

#*Conceptual Modeling of Workflows.
#@Fabio Casati,Stefano Ceri,Barbara Pernici,Giuseppe Pozzi
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation0
#index2090
#arnetid2092

#*A Behaviorally Driven Approach to Object-Oriented Analysis and Design with Object Oriented Data Modeling.
#@Lois M. L. Delcambre,Earl F. Ecklund Jr.
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation3
#index2091
#arnetid2093

#*Coordinated Collaboration of Objects.
#@Gregor Engels,Luuk Groenewegen,Gerti Kappel
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation11
#index2092
#arnetid2094

#*Identifying Objects by Declarative Queries.
#@Martin Gogolla
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation5
#index2093
#arnetid2095

#*Temporally Enhanced Database Design.
#@Christian S. Jensen,Richard T. Snodgrass
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation15
#index2094
#arnetid2096

#*An Active, Object-Oriented, Model-Equivalent Programming Language.
#@Stephen W. Liddle,David W. Embley,Scott N. Woodfield
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation14
#index2095
#arnetid2097

#*Mapping an Extended Entity-Relationship into a Schema of Complex Objects.
#@Rokia Missaoui,Robert Godin,Jean-Marc Gagnon
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation6
#index2096
#arnetid2098

#*Advances in Object-Oriented Modeling.
#@Moira C. Norrie
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation-1
#index2097
#arnetid2099

#*Leveraging Relational Data Assets.
#@Mike P. Papazoglou,Willem-Jan van den Heuvel
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation0
#index2098
#arnetid2100

#*Modeling Object Dynamics.
#@Mike P. Papazoglou,Bernd J. Krämer
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation4
#index2099
#arnetid2101

#*Database Integration: The Key to Data Interoperability.
#@Christine Parent,Stefano Spaccapietra
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation43
#index2100
#arnetid2102

#*On the Design of Behavior Consistent Specializations of Object Life Cycles in OBD and UML.
#@Michael Schrefl,Markus Stumptner
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation8
#index2101
#arnetid2103

#*Objects and Events as Modeling Drivers.
#@Maguelonne Teisseire,Pascal Poncelet,Rosine Cicchetti
#year2000
#confAdvances in Object-Oriented Data Modeling
#citation0
#index2102
#arnetid2104

#*The Type System of LML.
#@Bruno Bertolino,Luigi Meo,Dino Pedreschi,Franco Turini
#year1992
#confTypes in Logic Programming
#citation1
#index2103
#arnetid2105

#*A Regular Type Language for Logic Programs.
#@Philip W. Dart,Justin Zobel
#year1992
#confTypes in Logic Programming
#citation76
#index2104
#arnetid2106

#*Logic Programming with Type Specifications.
#@Michael Hanus
#year1992
#confTypes in Logic Programming
#citation30
#index2105
#arnetid2107

#*Semantic Types for Logic Programs.
#@Nevin Heintze,Joxan Jaffar
#year1992
#confTypes in Logic Programming
#citation27
#index2106
#arnetid2108

#*A Semantics for Typed Logic Programs.
#@Patricia M. Hill,Rodney W. Topor
#year1992
#confTypes in Logic Programming
#citation67
#index2107
#arnetid2109

#*A Pragmatic View of Types for Logic Programs.
#@Dean Jacobs
#year1992
#confTypes in Logic Programming
#citation1
#index2108
#arnetid2110

#*The Type System of a Higher-Order Logic Programming Language.
#@Gopalan Nadathur,Frank Pfenning
#year1992
#confTypes in Logic Programming
#citation29
#index2109
#arnetid2111
#!The type system of the logic programming language $\lambda$Prolog is discussed. The incorporation of higher-order notions within this language requires the use of a typing scheme to distinguish between expressions of different function types. Thus $\lambda$Prolog is a (strongly) typed language, in contrast to the typeless language that underlies the idea of descriptive types in logic programming. The typing discipline that is employed in the language is based on the notion of simple types in the $\lambda$-calculus. This form of typing enforces arity restrictions on functions and predicates and provides a builtin functional hierarchy over terms. The language contains a facility for defining new primitive types and thus permits finer grained distinctions to be introduced by the user. Further, the use of type variables and type constructors provides a form of polymorphism that is similar in certain respects to that present in the language ML. The notion of type checking in $\lambda$Prolog is discussed and shown to be an operation that can be performed at the time of compilation. The value of typing distinctions in determining the clarity of programs and their usefulness in conjunction with type checking in preventing run-time errors due to type violations is also discussed. In addition to their function in type checking, types also have a major role in determining computations in the logic programming context. We discuss this aspect of types that is in contrast to their behavior in other programming paradigms and we show how this leads to a presence of types in the runtime environment. While typing has several advantages, it is sometimes to the programmer''s advantage to be able to omit their mention. Type reconstruction provides a means for filling missing type information in and we discuss issues pertinent to this process in the context of $\lambda$Prolog.

#*Types and the Intended Meaning of Logic Programs.
#@Lee Naish
#year1992
#confTypes in Logic Programming
#citation36
#index2110
#arnetid2112

#*Dependent Types in Logic Programming.
#@Frank Pfenning
#year1992
#confTypes in Logic Programming
#citation120
#index2111
#arnetid2113

#*Polymorphically Typed Logic Programs.
#@Eyal Yardeni,Thom W. Frühwirth,Ehud Y. Shapiro
#year1992
#confTypes in Logic Programming
#citation32
#index2112
#arnetid2114

#*Using Moded Type Systems to Support Abstraction in Logic Programs.
#@Joseph L. Zachary,Katherine A. Yelick
#year1992
#confTypes in Logic Programming
#citation0
#index2113
#arnetid2115

#*Actors: A Conceptual Foundation for Concurrent Object-Oriented Programming.
#@Gul Agha,Carl Hewitt
#year1987
#confResearch Directions in Object-Oriented Programming
#citation97
#index2114
#arnetid2116

#*Groundwork for an Object Database Model.
#@David Beech
#year1987
#confResearch Directions in Object-Oriented Programming
#citation15
#index2115
#arnetid2117

#*Definition Groups: Making Sources into First-Class Objects.
#@Daniel G. Bobrow,David S. Fogelsong,Mark S. Miller
#year1987
#confResearch Directions in Object-Oriented Programming
#citation5
#index2116
#arnetid2118

#*Object-Oriented Specifications.
#@Ole-Johan Dahl
#year1987
#confResearch Directions in Object-Oriented Programming
#citation7
#index2117
#arnetid2119

#*Unifying Functional, Object-Oriented and Relational Programming with Logical Semantics.
#@Joseph A. Goguen,José Meseguer
#year1987
#confResearch Directions in Object-Oriented Programming
#citation253
#index2118
#arnetid2120

#*A Model for Object-Based Inheritance.
#@Brent Hailpern,Van Nguyen
#year1987
#confResearch Directions in Object-Oriented Programming
#citation18
#index2119
#arnetid2121

#*Vulcan: Logical Concurrent Objects.
#@Kenneth M. Kahn,Eric Dean Tribble,Mark S. Miller,Daniel G. Bobrow
#year1987
#confResearch Directions in Object-Oriented Programming
#citation-1
#index2120
#arnetid2122

#*The BETA Programming Language.
#@Bent Bruun Kristensen,Ole Lehrmann Madsen,Birger Møller-Pedersen,Kristen Nygaard
#year1987
#confResearch Directions in Object-Oriented Programming
#citation146
#index2121
#arnetid2123

#*Block-Structure and Object-Oriented Languages.
#@Ole Lehrmann Madsen
#year1987
#confResearch Directions in Object-Oriented Programming
#citation40
#index2122
#arnetid2124

#*Development and Implementation of an Object-Oriented DBMS.
#@David Maier,Jacob Stein
#year1987
#confResearch Directions in Object-Oriented Programming
#citation176
#index2123
#arnetid2125

#*A Mechanism for Specifying the Structure of Large, Layered Systems.
#@Harold Ossher
#year1987
#confResearch Directions in Object-Oriented Programming
#citation29
#index2124
#arnetid2126

#*An Object-Oriented Framework for Conceptual Programming.
#@Steven P. Reiss
#year1987
#confResearch Directions in Object-Oriented Programming
#citation-1
#index2125
#arnetid2127

#*Type Evolution in an Object-Oriented Database.
#@Andrea H. Skarra,Stanley B. Zdonik
#year1987
#confResearch Directions in Object-Oriented Programming
#citation135
#index2126
#arnetid2128

#*A Substrate for Object-Oriented Interface Design.
#@Reid G. Smith,Paul Barth,Robert Young
#year1987
#confResearch Directions in Object-Oriented Programming
#citation22
#index2127
#arnetid2129

#*Inheritance and the Development of Encapsulated Software Systems.
#@Alan Snyder
#year1987
#confResearch Directions in Object-Oriented Programming
#citation38
#index2128
#arnetid2130

#*The Object-Oriented Classification Paradigm.
#@Peter Wegner
#year1987
#confResearch Directions in Object-Oriented Programming
#citation132
#index2129
#arnetid2131

#*Workflow Management: Models, Methods, and Systems
#@Wil M. P. van der Aalst,Kees M. van Hee
#year2002
#conf
#citation1141
#index2130
#arnetid2132

#*Structure and Interpretation of Computer Programs
#@Harold Abelson,Gerald J. Sussman
#year1985
#conf
#citation7
#index2131
#arnetid2133

#*Structure and Interpretation of Computer Programs, Second Edition
#@Harold Abelson,Gerald J. Sussman
#year1996
#conf
#citation-1
#index2132
#arnetid2134

#*Warren's Abstract Machine: A Tutorial Reconstruction
#@Hassan Aït-Kaci
#year1991
#conf
#citation486
#index2133
#arnetid2135

#*Digital Library Use: Social Practice in Design and Evaluation
#@Ann Peterson Bishop,Nancy A. Van House,Barbara P. Buttenfield
#year2003
#conf
#citation80
#index2134
#arnetid2136

#*Visual Reconstruction
#@Andrew Blake,Andrew Zisserman
#year1987
#conf
#citation1745
#index2135
#arnetid2137

#*Vector Models for Data-Parallel Computing
#@Guy E. Blelloch
#year1990
#conf
#citation489
#index2136
#arnetid2138

#*From Gutenberg to the Global Information Infrastructure
#@Christine L. Borgman
#year2000
#conf
#citation54
#index2137
#arnetid2139

#*Advances in Knowledge Discovery and Data Mining.
#@Usama M. Fayyad,Gregory Piatetsky-Shapiro,Padhraic Smyth,Ramasamy Uthurusamy
#year1996
#conf
#citation3112
#index2138
#arnetid2140

#*Introduction to Object-Oriented Databases
#@Won Kim
#year1990
#conf
#citation611
#index2139
#arnetid2141

#*Advances in Object-Oriented Data Modeling
#@Mike P. Papazoglou,Stefano Spaccapietra,Zahir Tari
#year2000
#conf
#citation-1
#index2140
#arnetid2142

#*Knowledge Discovery in Databases
#@Gregory Piatetsky-Shapiro,William J. Frawley
#year1991
#conf
#citation688
#index2141
#arnetid2143

#*Concepts, Techniques, and Models of Computer Programming
#@Peter Van Roy,Seif Haridi
#year2004
#conf
#citation221
#index2142
#arnetid2144

#*The Art of Prolog - Advanced Programming Techniques
#@Leon Sterling,Ehud Y. Shapiro
#year1986
#conf
#citation4
#index2143
#arnetid2145

#*The Art of Prolog - Advanced Programming Techniques, 2nd Ed.
#@Leon Sterling,Ehud Y. Shapiro
#year1994
#conf
#citation-1
#index2144
#arnetid2146

#*The Intellectual Foundation of Information Organization
#@Elaine Svenonius
#year2000
#conf
#citation299
#index2145
#arnetid2147
#!Instant electronic access to digital information is the single most distinguishing attribute of the information age. The elaborate retrieval mechanisms that support such access are a product of technology. But technology is not enough. The effectiveness of a system for accessing information is a direct function of the intelligence put into organizing it. Just as the practical field of engineering has theoretical physics as its underlying base, the design of systems for organizing information rests on an intellectual foundation. The subject of this book is the systematized body of knowledge that constitutes this foundation.Integrating the disparate disciplines of descriptive cataloging, subject cataloging, indexing, and classification, the book adopts a conceptual framework that views the process of organizing information as the use of a special language of description called a bibliographic language. The book is divided into two parts. The first part is an analytic discussion of the intellectual foundation of information organization. The second part moves from generalities to particulars, presenting an overview of three bibliographic languages: work languages, document languages, and subject languages. It looks at these languages in terms of their vocabulary, semantics, and syntax. The book is written in an exceptionally clear style, at a level that makes it understandable to those outside the discipline of library and information science.Digital Libraries and Electronic Publishing series

#*Research Directions in Object-Oriented Programming
#@Bruce Shriver,Peter Wegner
#year1987
#conf
#citation95
#index2146
#arnetid2148

#*Journey to Data Quality
#@Yang W. Lee,Leo Pipino,James D. Funk,Richard Y. Wang
#year2006
#conf
#citation62
#index2147
#arnetid2149
#!All organizations today confront data quality problems, both systemic and structural. Neither ad hoc approaches nor fixes at the systems levelinstalling the latest software or developing an expensive data warehousesolve the basic problem of bad data quality practices. Journey to Data Quality offers a roadmap that can be used by practitioners, executives, and students for planning and implementing a viable data and information quality management program. This practical guide, based on rigorous research and informed by real-world examples, describes the challenges of data management and provides the principles, strategies, tools, and techniques necessary to meet them. The authors, all leaders in the data quality field for many years, discuss how to make the economic case for data quality and the importance of getting an organization's leaders on board. They outline different approaches for assessing data, both subjectively (by users) and objectively (using sampling and other techniques). They describe real problems and solutions, including efforts to find the root causes of data quality problems at a healthcare organization and data quality initiatives taken by a large teaching hospital. They address setting company policy on data quality and, finally, they consider future challenges on the journey to data quality.

#*Self-Stabilization
#@Shlomi Dolev
#year2000
#conf
#citation636
#index2148
#arnetid2150

#*Heterogenous Active Agents
#@V. S. Subrahmanian,Piero A. Bonatti,Jürgen Dix,Thomas Eiter,Sarit Kraus,Fatma Ozcan,Robert B. Ross
#year2000
#conf
#citation0
#index2149
#arnetid2151

#*Digital Libraries
#@William Y. Arms
#year2000
#conf
#citation410
#index2150
#arnetid2152

#*Datenbanken: Konzepte und Sprachen
#@Andreas Heuer,Gunter Saake
#year1995
#conf
#citation209
#index2151
#arnetid2153

#*Datenbanken: Implementierungstechniken
#@Gunter Saake,Andreas Heuer
#year1999
#conf
#citation68
#index2152
#arnetid2154

#*Datenbanken: Konzepte und Sprachen, 3. Auflage
#@Gunter Saake,Kai-Uwe Sattler,Andreas Heuer
#year2008
#conf
#citation-1
#index2153
#arnetid2155

#*Object Identity as a Query Language Primitive.
#@Serge Abiteboul,Paris C. Kanellakis
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation650
#index2154
#arnetid2156
#%544803
#%545171
#%545267
#%544801
#%938902
#%545154
#%544780
#%579417
#%544811
#%70763
#%832272
#%493
#%139
#%545158
#%62387
#%598261
#!We demonstrate the power of object identities (oid's) as a database query language primitive. We develop an object-based data model, whose structural part generalizes most of the known complex-object data models: cyclicity is allowed in both its schemas and instances. Our main contribution is the operational part of the data model, the query language IQL, which uses oid's for three critical purposes: (1) to represent data-structures with sharing and cycles, (2) to manipulate sets and (3) to express any computable database query. IQL can be statically type checked, can be evaluated bottom-up and naturally generalizes most popular rule-based database languages. The model can also be extended to incorporate type inheritance, without changes to IQL. Finally, we investigate an analogous value-based data model, whose structural part is founded on regular infinite trees and whose operational part is IQL.

#*Method Schemas.
#@Serge Abiteboul,Paris C. Kanellakis,Emmanuel Waller
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation62
#index2155
#arnetid2157
#!The concept of method schemas is proposed as a simple model for object-oriented programming with features such as classes with methods and inheritance, method name overloading, and late binding. An important issue is to check whether a given method schema can possibly lead to inconsistencies in some interpretations. The consistency problem for method schemas is studied. The problem is shown to be undecidable in general. Decidability is obtained for monadic and/or recursion-free method schemas. The effect of covariance is considered. The issues of incremental consistency checking and of a sound algorithm for the general case are briefly discussed.

#*Self-explained Toolboxes.
#@Gustavo Arango
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation0
#index2156
#arnetid2158

#*The Object-Oriented Database System Manifesto.
#@Malcolm P. Atkinson,François Bancilhon,David J. DeWitt,Klaus R. Dittrich,David Maier,Stanley B. Zdonik
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation1183
#index2157
#arnetid2159

#*A Query Language for O2.
#@François Bancilhon,Sophie Cluet,Claude Delobel
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation21
#index2158
#arnetid2160

#*Introduction to Languages.
#@François Bancilhon,David Maier
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation1
#index2159
#arnetid2161

#*LISP O2: a Persistent Object-Oriented Lisp.
#@Gilles Barbedette
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation-1
#index2160
#arnetid2162

#*Clustering Strategies in O2: An Overview.
#@Véronique Benzaken,Claude Delobel,Gilbert Harrus
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation11
#index2161
#arnetid2163

#*Handling Distribution in the O2 System.
#@Guy Bernard,Dominique Stève
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation0
#index2162
#arnetid2164

#*The O2 Programming Environment.
#@Patrick Borras,Anne Doucet,Patrick Pfeffer,Didier Tallot
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation1
#index2163
#arnetid2165

#*Integrating Concurrency Control into an Object-Oriented Database System.
#@Michèle Cart,Jean Ferrié
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation44
#index2164
#arnetid2166

#*Consistency of Versions in Object-Oriented Databases.
#@Wojciech Cellary,Geneviève Jomier
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation146
#index2165
#arnetid2167

#*Reloop, an Algebra Based Query Language for an Object-Oriented Database System.
#@Sophie Cluet,Claude Delobel,Christophe Lécluse,Philippe Richard
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation89
#index2166
#arnetid2168

#*Three Alternative Workstation-Server Architectures.
#@David J. DeWitt,Philippe Futtersack,David Maier,Fernando Vélez
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation2
#index2167
#arnetid2169

#*Introduction to the Programming Environment.
#@Claude Delobel,Paris C. Kanellakis,Didier Plateau
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation0
#index2168
#arnetid2170

#*Introduction to the System.
#@Claude Delobel,Fernando Vélez
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation-1
#index2169
#arnetid2171

#*The Story of O2.
#@O. Deux
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation323
#index2170
#arnetid2172

#*Using a Database System to Implement a Debugger.
#@Anne Doucet,Patrick Pfeffer
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation-1
#index2171
#arnetid2173

#*Using Database Applications to Compare Programming Languages.
#@Sophie Gamerman,Catherine Lanquette,Fernando Vélez
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation3
#index2172
#arnetid2174

#*A Guided Tour of an O2 Applications.
#@Constance Grosselin,T. Mark James
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation-1
#index2173
#arnetid2175

#*Introduction to the Data Model.
#@Paris C. Kanellakis,Christophe Lécluse,Philippe Richard
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation13
#index2174
#arnetid2176

#*Incremental Compilation in O2.
#@Jean-Marie Larchevêque
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation0
#index2175
#arnetid2177

#*The O2 Database Programming Language.
#@Christophe Lécluse,Philippe Richard
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation112
#index2176
#arnetid2178
#%1137947
#%522378
#%832327
#%544811
#%984188
#%832272
#%522718
#%139
#%304108
#%598261
#%2154

#*O2, an Object-Oriented Data Model.
#@Christophe Lécluse,Philippe Richard,Fernando Vélez
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation274
#index2177
#arnetid2179
#!The Altair group is currently designing an object-oriented data base system called O2. This paper presents a formal description of the object-oriented data model of this system. It proposes a type system defined in the framework of a set-and-tuple data model. It models the well known inheritance mechanism and enforces strong typing.

#*Building User Interfaces with Looks.
#@Didier Plateau,Patrick Borras,Didier Lévêque,Jean-Claude Mamou,Didier Tallot
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation11
#index2178
#arnetid2180

#*Geographic Applications: An Experience with O2.
#@Michel Scholl,Agnès Voisard
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation5
#index2179
#arnetid2181

#*The O2 Object Manager: An Overview.
#@Fernando Vélez,Guy Bernard,Vineeta Darnis
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation-1
#index2180
#arnetid2182
#%2787
#%521198
#%17459
#%643056
#%642099
#%643678
#%1073689
#%522346
#%1120181
#%521219
#%42
#%2497

#*A Framework for Schema Updates In An Object-Oriented Database System.
#@Roberto Zicari
#year1992
#confBuilding an Object-Oriented Database System, The Story of O2
#citation179
#index2181
#arnetid2183

#*All Your Data: The Oracle Extensibility Architecture.
#@Sandeepan Banerjee,Vishu Krishnamurthy,Ravi Murthy
#year2001
#confCompontent Database Systems
#citation10
#index2182
#arnetid2184

#*Enabling Component Databases with OLE DB.
#@José A. Blakeley,Michael Pizzo
#year2001
#confCompontent Database Systems
#citation2
#index2183
#arnetid2185

#*The Architecture of a Database System for Mobile and Embedded Devices.
#@Heiko Bobzin
#year2001
#confCompontent Database Systems
#citation-1
#index2184
#arnetid2186

#*Distributed Component Database Management Systems.
#@Paul Brown
#year2001
#confCompontent Database Systems
#citation2
#index2185
#arnetid2187

#*Extensible Indexing Support in DB2 Universal Database.
#@Stefan Deßloch,Weidong Chen,Jyh-Herng Chow,You-Chin Fuh,Jean Grandbois,Michelle Jou,Nelson Mendonça Mattos,Raiko Nitzsche,Brian T. Tran,Yun Wang
#year2001
#confCompontent Database Systems
#citation1
#index2186
#arnetid2188

#*Component Database Systems: Introduction, Foundations, and Overview.
#@Andreas Geppert,Klaus R. Dittrich
#year2001
#confCompontent Database Systems
#citation8
#index2187
#arnetid2189

#*Conclusions and Perspectives.
#@Andreas Geppert,Klaus R. Dittrich
#year2001
#confCompontent Database Systems
#citation0
#index2188
#arnetid2190

#*Foreword.
#@Peter C. Lockemann
#year2001
#confCompontent Database Systems
#citation119
#index2189
#arnetid2191

#*Building Component Database Systems Using CORBA.
#@M. Tamer Özsu,Benjamin Bin Yao
#year2001
#confCompontent Database Systems
#citation5
#index2190
#arnetid2192

#*An Architecture for Transparent Access to Diverse Data Sources.
#@Mary Tork Roth,Peter M. Schwarz,Laura M. Haas
#year2001
#confCompontent Database Systems
#citation4
#index2191
#arnetid2193

#*Transaction Management in Database Systems
#@Divyakant Agrawal,Amr El Abbadi
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation21
#index2192
#arnetid2194

#*A Transaction Model for Active Distributed Object Systems
#@Alejandro P. Buchmann,M. Tamer Özsu,Dimitrios Georgakopoulos,Frank Manola
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation132
#index2193
#arnetid2195

#*ACTA: The SAGA Continues
#@Panos K. Chrysanthis,Krithi Ramamritham
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation140
#index2194
#arnetid2196
#!ACTA is a comprehensive transaction framework that permits a transaction modeler to specify the effects of extended transactions on each other and on objects in the database. ACTA allows the specification of (1) the interactions between transactions in terms of relationships between significant (transaction manage- ment) events, such as begin, commit, abort, delegate, split, and join, pertaining to different transactions and (2) transactions'' effects on objects'' state and concur- rency status (i.e., synchronization state). Various extended traditional models have been proposed to deal with applica- tions that involve reactive (endless), open-ended (long-lived) and collaborative (interactive) activities. One such model is Sagas [GS87] independent (component) transactions T1, T2,..., Tn which can interleave in any way with component trans- actions of other Sagas. Components can commit even before the Saga commits. However, if the Saga subsequently aborts, effects of the committed components are nullified through the invocation of compensating transactions. After giving a brief introduction to the modeling primitives of ACTA, we illustrate their use by giving a complete formal characterization of Sagas. Sub- sequently, the reasoning power of ACTA is shown by proving properties of Sagas. Finally, the flexibility of ACTA is displayed through a series of variations to the original model of Sagas, each variation coming out of changes to the formal characterization of Sagas.

#*Introduction to Advanced Transaction Models
#@Ahmed K. Elmagarmid,Yungho Leu,James G. Mullen,Omran A. Bukhres
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation31
#index2195
#arnetid2197

#*A Flexible Framework for Transaction Management in Engineering Environments
#@Sandra Heiler,Sara Haradhvala,Stanley B. Zdonik,Barbara T. Blaustein,Arnon Rosenthal
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation23
#index2196
#arnetid2198

#*Dynamic Restructuring of Transactions
#@Gail E. Kaiser,Calton Pu
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation64
#index2197
#arnetid2199

#*Multidatabase Transaction and Query Processing in Logic
#@eva Kühn,Franz Puntigam,Ahmed K. Elmagarmid
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation13
#index2198
#arnetid2200

#*A Transaction Model for an Open Publication Environment
#@Peter Muth,Thomas C. Rakow,Wolfgang Klas,Erich J. Neuhold
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation29
#index2199
#arnetid2201

#*A Cooperative Transaction Model for Design Databases
#@Marian H. Nodine,Sridhar Ramaswamy,Stanley B. Zdonik
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation83
#index2200
#arnetid2202

#*Using Polytransactions to Manage Interdependent Data
#@Amit P. Sheth,Marek Rusinkiewicz,George Karabatis
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation70
#index2201
#arnetid2203

#*Facility for Non Standard Database Systems
#@Rainer Unland,Gunter Schlageter
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation-1
#index2202
#arnetid2204

#*The S-transaction Model
#@Jari Veijalainen,Frank Eliassen,Bernhard Holtkamp
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation36
#index2203
#arnetid2205

#*The ConTract Model
#@Helmut Wächter,Andreas Reuter
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation320
#index2204
#arnetid2206

#*Concepts and Applications of Multilevel Transactions and Open Nested Transactions
#@Gerhard Weikum,Hans-Jörg Schek
#year1992
#confDatabase Transaction Models for Advanced Applications
#citation253
#index2205
#arnetid2207

#*An Analysis of a Dynamic Query Optimization Scheme for Different Data Distributions.
#@Carel A. van den Berg,Martin L. Kersten
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation23
#index2206
#arnetid2208

#*A Survey of Indexing Techniques for Object-Oriented Database Management Systems.
#@Elisa Bertino
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation34
#index2207
#arnetid2209

#*Towards a Unification of Rewrite-Based Optimization Techniques for Object-Oriented Queries.
#@Sophie Cluet,Claude Delobel
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation14
#index2208
#arnetid2210

#*Algebraic Query Optimization in the CoOMS Structurally Object-Oriented Database System.
#@Birgit Demuth,Andreas Geppert,Thorsten Gorchs
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation9
#index2209
#arnetid2211

#*Extensible Query Optimization and Parallel Execution in Volcano.
#@Goetz Graefe,Richard L. Cole,Diane L. Davison,William J. McKenna,Richard H. Wolniewicz
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation56
#index2210
#arnetid2212

#*Tagging as an Alternative to Object Creation.
#@Marc Gyssens,Lawrence V. Saxton,Dirk Van Gucht
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation11
#index2211
#arnetid2213

#*Query Optimization in Deductive Object Bases.
#@Manfred A. Jeusfeld,Martin Staudt
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation35
#index2212
#arnetid2214

#*Query Optimization in Object Bases: Exploiting Relational Techniques.
#@Alfons Kemper,Guido Moerkotte
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation38
#index2213
#arnetid2215

#*ADT-based Type System for SQL.
#@Krishna G. Kulkarni,Jonathan Bauer,Umeshwar Dayal,Mike Kelley,Jim Melton
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation4
#index2214
#arnetid2216

#*Evaluation Aspects of an Object-oriented Deductive Database Language.
#@Georg Lausen,Beate Marx
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation3
#index2215
#arnetid2217
#!Recently, F-logic has been proposed as an attempt to extend deductive databases by typical concepts of object-oriented languages. Among these concepts are complex objects, (term-based) object identity, methods, classes, typing, inheritance and browsing. In Kifer et al. syntax and model-theoretic semantics is discussed; however many algorithmic aspects which arise when computing the corresponding models are left open. In this paper we start to bridge this gap. Several topics in the context of the evaluation of programs are discussed in detail; among these are weak recursion, global stratification and dynamic type-checking.

#*Challenges for Query Processing in Object-Oriented Databases.
#@David Maier,Scott Daniels,Thomas Keller,Bennet Vance,Goetz Graefe,William J. McKenna
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation18
#index2216
#arnetid2218

#*Integration of Composite Objects into Relational Query Processing: The SQL/XNF Approach.
#@Bernhard Mitschang,Hamid Pirahesh
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation2
#index2217
#arnetid2219

#*Physical Database Design for an Object-Oriented Database System.
#@Marc H. Scholl
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation15
#index2218
#arnetid2220

#*Optimization of Complex-Object Queries in PRIMA - Statement of Problems.
#@Harald Schöning
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation1
#index2219
#arnetid2221

#*Implementation of the Object-Oriented Data Model TM.
#@Hennie J. Steenhagen,Peter M. G. Apers
#year1991
#confQuery Processing for Advanced Database Systems, Dagstuhl
#citation0
#index2220
#arnetid2222

#*An Engineering Database benchmark.
#@R. G. G. Cattell
#year1991
#confThe Benchmark Handbook
#citation78
#index2221
#arnetid2223

#*The Wisconsin Benchmark: Past, Present, and Future.
#@David J. DeWitt
#year1991
#confThe Benchmark Handbook
#citation113
#index2222
#arnetid2224

#*Benchmark Software Distribution: Release 1.0.
#@Michael J. Franklin
#year1991
#confThe Benchmark Handbook
#citation0
#index2223
#arnetid2225

#*Introduction.
#@Jim Gray
#year1991
#confThe Benchmark Handbook
#citation-1
#index2224
#arnetid2226
#!Do we all look at homeless people in the same way? The innocence of kids can teach us how to look at the world in a different way.

#*The Neal Nelson Database Benchmark: A Benchmark Based on the Realities of Business.
#@Neal Nelson
#year1991
#confThe Benchmark Handbook
#citation0
#index2225
#arnetid2227

#*The Set Query Benchmark.
#@Patrick E. O'Neil
#year1991
#confThe Benchmark Handbook
#citation31
#index2226
#arnetid2228

#*Doing Your Own Benchmark.
#@Tom Sawyer
#year1991
#confThe Benchmark Handbook
#citation5
#index2227
#arnetid2229

#*The History of DebitCredit and the TPC.
#@Omri Serlin
#year1991
#confThe Benchmark Handbook
#citation17
#index2228
#arnetid2230

#*TPC Benchmark A: Standard Specification.
#@
#year1991
#confThe Benchmark Handbook
#citation0
#index2229
#arnetid2231

#*TPC Benchmark B: Standard Specification.
#@
#year1991
#confThe Benchmark Handbook
#citation0
#index2230
#arnetid2232

#*ASAP: An ANSI SQL Standard Scaleable and Portable Benchmark for Relational Database Systems.
#@Carolyn Turbyfill,Cyril U. Orji,Dina Bitton
#year1991
#confThe Benchmark Handbook
#citation29
#index2231
#arnetid2233

#*TPC Benchmark B: Standard Specification.
#@
#year1993
#confThe Benchmark Handbook
#citation0
#index2232
#arnetid2234

#*Doing Your Own Benchmark.
#@Tom Sawyer
#year1993
#confThe Benchmark Handbook
#citation5
#index2233
#arnetid2235

#*TPC-D: Benchmarking for Decision Support.
#@Carrie Ballinger
#year1993
#confThe Benchmark Handbook
#citation5
#index2234
#arnetid2236

#*The Engineering Database Benchmark.
#@R. G. G. Cattell
#year1993
#confThe Benchmark Handbook
#citation78
#index2235
#arnetid2237

#*Overview of the Full-Text Document Retrieval Benchmark.
#@Samuel DeFazio
#year1993
#confThe Benchmark Handbook
#citation5
#index2236
#arnetid2238

#*The Wisconsin Benchmark: Past, Present, and Future.
#@David J. DeWitt
#year1993
#confThe Benchmark Handbook
#citation113
#index2237
#arnetid2239

#*Overview of the SPEC Benchmarks.
#@Kaivalya M. Dixit
#year1993
#confThe Benchmark Handbook
#citation12
#index2238
#arnetid2240

#*Database and Transaction Processing Performance Handbook.
#@Jim Gray
#year1993
#confThe Benchmark Handbook
#citation17
#index2239
#arnetid2241

#*The Set Query Benchmark.
#@Patrick E. O'Neil
#year1993
#confThe Benchmark Handbook
#citation31
#index2240
#arnetid2242

#*TPC-C - The Standard Benchmark for Online transaction Processing (OLTP).
#@Francois Raab
#year1993
#confThe Benchmark Handbook
#citation8
#index2241
#arnetid2243

#*The History of DebitCredit and the TPC.
#@Omri Serlin
#year1993
#confThe Benchmark Handbook
#citation17
#index2242
#arnetid2244

#*ASAP - An ANSI SQL Standard Scaleable and Portable Benchmark for Relational Database Systems.
#@Carolyn Turbyfill,Cyril U. Orji,Dina Bitton
#year1993
#confThe Benchmark Handbook
#citation29
#index2243
#arnetid2245

#*The Neal Nelson Database Benchmark: A Benchmark Based on the Realities of Business.
#@
#year1993
#confThe Benchmark Handbook
#citation0
#index2244
#arnetid2246

#*TPC Benchmark A: Standard Specification.
#@
#year1993
#confThe Benchmark Handbook
#citation0
#index2245
#arnetid2247

#*Towards a Theory of Declarative Knowledge.
#@Krzysztof R. Apt,Howard A. Blair,Adrian Walker
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation1224
#index2246
#arnetid2248

#*Performance Evaluation of Data Intensive Logic Programs.
#@François Bancilhon,Raghu Ramakrishnan
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation117
#index2247
#arnetid2249

#*Foundations of Semantic Query Optimization for Deductive Databases
#@Upen S. Chakravarthy,John Grant,Jack Minker
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation104
#index2248
#arnetid2250

#*Converting AND-Control to OR-Control by Program Transformation.
#@Maarten H. van Emden,Péter Szeredi
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation-1
#index2249
#arnetid2251

#*Negation as Failure Using Tight Derivations for General Logic Programs.
#@Allen Van Gelder
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation302
#index2250
#arnetid2252

#*Compiling the GCWA in Indefinite Deductive Databases.
#@Lawrence J. Henschen,Hyung-Sik Park
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation13
#index2251
#arnetid2253

#*Intelligent Query Answering in Rule Based Systems
#@Tomasz Imielinski
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation104
#index2252
#arnetid2254

#*Logic Programming and Parallel Complexity
#@Paris C. Kanellakis
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation53
#index2253
#arnetid2255

#*Unification Revisited
#@Jean-Louis Lassez,Michael J. Maher,Kim Marriott
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation498
#index2254
#arnetid2256

#*On the Declarative Semantics of Logic Programs with Negation.
#@Vladimir Lifschitz
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation124
#index2255
#arnetid2257

#*Equivalences of Logic Programs
#@Michael J. Maher
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation2
#index2256
#arnetid2258

#*A Logic-based Language for Database Updates.
#@Sanjay Manchanda,David Scott Warren
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation115
#index2257
#arnetid2259

#*Introduction
#@Jack Minker
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation-1
#index2258
#arnetid2260
#!UML is at a crossroads. Which of the proposed revisions will bring it closer to meeting user needs and winning tool-vendor commitment? What if UML2 instead combined the best features of each proposal?

#*On the Declarative Semantics of Deductive Databases and Logic Programs.
#@Teodor C. Przymusinski
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation684
#index2259
#arnetid2261

#*A Theorem-Proving Approach to Database Integrity.
#@Fariba Sadri,Robert A. Kowalski
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation139
#index2260
#arnetid2262

#*Optimizing Datalog Programs.
#@Yehoshua Sagiv
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation196
#index2261
#arnetid2263
#!Datalog programs, i.e., Prolog programs without function symbols, are considered It is assumed that a variable appearing in the head of a rule must also appear in the body of the rule. The input of a program is a set of ground atoms (which are given in addition to the program's rules) and, therefore, can be viewed as an assignment of relations to some of the program's predicates. Two programs are equivalent if they produce the same result for all possible assignments of relations to the extensional predicates (i.e., the predicates that do not appear as heads of rules). Two programs are uniformly equivalent if they produce the same result for all possible assignments of initial relations to all the predicates (i.e., both extensional and intentional). The equivalence problem for Datalog programs is known to be undecidable. It is shown that uniform equivalence is decidable, and an algorithm is given for minimizing a Datalog program under uniform equivalence. A technique for removing parts of a program that are redundant under equivalence (but not under uniform equivalence) is developed. A procedure for testing uniform equivalence is also developed for the case in which the database satisfies some constraints.

#*Negation in Logic Programming.
#@John C. Shepherdson
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation244
#index2262
#arnetid2264

#*A Superjoin Algorithm for Deductive Databases.
#@James A. Thom,Kotagiri Ramamohanarao,Lee Naish
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation31
#index2263
#arnetid2265

#*On Domain Independent Databases.
#@Rodney W. Topor,Liz Sonenberg
#year1988
#confFoundations of Deductive Databases and Logic Programming.
#citation-1
#index2264
#arnetid2266

#*Middleware for Location-Based Services.
#@Hans-Arno Jacobsen
#year2004
#confLocation-Based Services
#citation11
#index2265
#arnetid2267

#*Database Aspects of Location-Based Services.
#@Christian S. Jensen
#year2004
#confLocation-Based Services
#citation21
#index2266
#arnetid2268

#*Data Transmission in Mobile Communication Systems.
#@Holger Karl
#year2004
#confLocation-Based Services
#citation2
#index2267
#arnetid2269

#*LBS Interoperability Through Standards.
#@Lance McKee
#year2004
#confLocation-Based Services
#citation2
#index2268
#arnetid2270

#*Data Collection.
#@Jörg Roth
#year2004
#confLocation-Based Services
#citation-1
#index2269
#arnetid2271

#*Introduction.
#@Jochen H. Schiller,Agnès Voisard
#year2004
#confLocation-Based Services
#citation-1
#index2270
#arnetid2272

#*Navigation Systems: A Spatial Database Perspective.
#@Shashi Shekhar,Ranga Raju Vatsavai,Xiaobin Ma,Jin Soung Yoo
#year2004
#confLocation-Based Services
#citation8
#index2271
#arnetid2273

#*General Aspects of Location Based Services.
#@Sarah Spiekermann
#year2004
#confLocation-Based Services
#citation33
#index2272
#arnetid2274

#*Case Study: The Development of the Find Friends Application.
#@Mark Strassman,Clay Collier
#year2004
#confLocation-Based Services
#citation-1
#index2273
#arnetid2275

#*Active Rule Management in Chimera
#@Stefano Ceri,Piero Fraternali,Stefano Paraboschi,Letizia Tanca
#year1996
#confActive Database Systems: Triggers and Rules For Advanced Database Processing
#citation90
#index2274
#arnetid2276

#*The HiPAC Project
#@Umeshwar Dayal,Alejandro P. Buchmann,Sharma Chakravarthy
#year1996
#confActive Database Systems: Triggers and Rules For Advanced Database Processing
#citation51
#index2275
#arnetid2277

#*Active Database Facilities in Ode
#@Narain H. Gehani,H. V. Jagadish
#year1996
#confActive Database Systems: Triggers and Rules For Advanced Database Processing
#citation40
#index2276
#arnetid2278

#*The Ariel Project
#@Eric N. Hanson
#year1996
#confActive Database Systems: Triggers and Rules For Advanced Database Processing
#citation13
#index2277
#arnetid2279

#*The POSTGRES Rules System
#@Spyros Potamianos,Michael Stonebraker
#year1996
#confActive Database Systems: Triggers and Rules For Advanced Database Processing
#citation20
#index2278
#arnetid2280

#*The A-RDL System
#@Eric Simon,Jerry Kiernan
#year1996
#confActive Database Systems: Triggers and Rules For Advanced Database Processing
#citation24
#index2279
#arnetid2281

#*The Starburst Rule System
#@Jennifer Widom
#year1996
#confActive Database Systems: Triggers and Rules For Advanced Database Processing
#citation27
#index2280
#arnetid2282

#*Introduction to Active Database Systems
#@Jennifer Widom,Stefano Ceri
#year1996
#confActive Database Systems: Triggers and Rules For Advanced Database Processing
#citation30
#index2281
#arnetid2283

#*Standards and Commercial Systems
#@Jennifer Widom,Stefano Ceri
#year1996
#confActive Database Systems: Triggers and Rules For Advanced Database Processing
#citation0
#index2282
#arnetid2284

#*Applications of Active Databases
#@Jennifer Widom,Stefano Ceri
#year1996
#confActive Database Systems: Triggers and Rules For Advanced Database Processing
#citation0
#index2283
#arnetid2285

#*Conclusions and Future Directions
#@Jennifer Widom,Stefano Ceri
#year1996
#confActive Database Systems: Triggers and Rules For Advanced Database Processing
#citation1
#index2284
#arnetid2286

#*Introduction to Spatial Databases: Applications to GIS
#@Philippe Rigaux,Michel Scholl,Agnès Voisard
#year2000
#conf
#citation-1
#index2285
#arnetid2287

#*Optimizing Compilers for Modern Architectures: A Dependence-based Approach
#@Randy Allen,Ken Kennedy
#year2001
#conf
#citation7
#index2286
#arnetid2288

#*Universal Database Management: A Guide to Object/Relational Technology
#@Cynthia Maro Saracco
#year1998
#conf
#citation18
#index2287
#arnetid2289

#*Building an Object-Oriented Database System, The Story of O2
#@Francois Bancilhon,Claude Delobel,Paris C. Kanellakis
#year1992
#conf
#citation479
#index2288
#arnetid2290

#*Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery
#@Gerhard Weikum,Gottfried Vossen
#year2002
#conf
#citation261
#index2289
#arnetid2291

#*Principles of Transaction Processing for Systems Professionals.
#@Philip A. Bernstein,Eric Newcomer
#year1996
#conf
#citation-1
#index2290
#arnetid2292

#*Computer Systems That Learn: Classification and Prediction Methods from Statistics, Neural Nets, Machine Learning and Expert Systems
#@Sholom M. Weiss,Casimir A. Kulikowski
#year1990
#conf
#citation819
#index2291
#arnetid2293

#*Migrating Legacy Systems: Gateways, Interfaces, and the Incremental Approach
#@Michael L. Brodie,Michael Stonebraker
#year1995
#conf
#citation323
#index2292
#arnetid2294

#*Data Warehousing: Using the Wal-Mart Model
#@Paul Westerman
#year2000
#conf
#citation65
#index2293
#arnetid2295

#*Data on the Web: From Relations to Semistructured Data and XML
#@Serge Abiteboul,Peter Buneman,Dan Suciu
#year1999
#conf
#citation8
#index2294
#arnetid2296

#*Stochastic Local Search: Foundations & Applications
#@Holger H. Hoos,Thomas Stützle
#year2004
#conf
#citation4
#index2295
#arnetid2297

#*The Object Data Standard: ODMG 3.0
#@R. G. G. Cattell,Douglas K. Barry
#year2000
#conf
#citation482
#index2296
#arnetid2298

#*How to Build a Digital Libary
#@Ian H. Witten,David Bainbridge
#year2003
#conf
#citation223
#index2297
#arnetid2299
#!:Given modern society's need to control its ever-increasing body of information, digital libraries will be among the most important and influential institutions of this century. With their versatility, accessibility, and economy, these focused collections of everything digital are fast becoming the "banks" in which the world's wealth of information is stored. How to Build a Digital Library is the only book that offers all the knowledge and tools needed to construct and maintain a digital library-no matter how large or small. Two internationally recognized experts provide a fully developed, step-by-step method, as well as the software that makes it all possible. How to Build a Digital Library is the perfectly self-contained resource for individuals, agencies, and institutions wishing to put this powerful tool to work in their burgeoning information treasuries. Features Sketches the history of libraries-both traditional and digital-and their impact on present practices and future directions Offers in-depth coverage of today's practical standards used to represent and store information digitally Uses Greenstone, freely accessible open-source software-available with interfaces in the world's major languages (including Spanish, Chinese, and Arabic) Written for both technical and non-technical audiences Web-enhanced with software documentation, color illustrations, full-text index, source code, and more Author Biography: Ian H. Witten is a professor of computer science at the University of Waikato in New Zealand. He directs the New Zealand Digital Library research project. His research interests include information retrieval, machine learning, text compression, and programming by demonstration. He received an MA in Mathematics from Cambridge University, England; an MSc in Computer Science from the University of Calgary, Canada; and a PhD in Electrical Engineering from Essex University, England. He is a fellow of the ACM and of the Royal Society of New Zealand. He has published widely on digital libraries, machine learning, text compression, hypertext, speech synthesis and signal processing, and computer typography. He has written several books, the latest being Managing Gigabytes (1999) and Data Mining (2000), both from Morgan Kaufmann. David Bainbridge is a senior lecturer in Computer Science at the University of Waikato, New Zealand. He holds a PhD in Optical Music Recognition from the University of Canterbury, New Zealand where he studied as a Commonwealth Scholar. Since moving to Waikato in 1996 he has continued to broadened his interest in digital media, while retaining a particular emphasis on music. An active member of the New Zealand Digital Library project, he manages the group's digital music library, Meldex, and has collaborated with several United Nations Agencies, the BBC and various public libraries. David has also worked as a research engineer for Thorn EMI in the area of photo-realistic imaging and graduated from the University of Edinburgh in 1991 as the class medalist in Computer Science.

#*The Object Database Standard: ODMG-93
#@R. G. G. Cattell
#year1993
#conf
#citation10
#index2298
#arnetid2300

#*Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations
#@Ian H. Witten,Eibe Frank
#year1999
#conf
#citation38
#index2299
#arnetid2301

#*The Object Database Standard: ODMG-93 (Release 1.1)
#@R. G. G. Cattell
#year1994
#conf
#citation-1
#index2300
#arnetid2302

#*Managing Gigabytes: Compressing and Indexing Documents and Images, Second Edition
#@Ian H. Witten,Alistair Moffat,Timothy C. Bell
#year1999
#conf
#citation-1
#index2301
#arnetid2303

#*The Object Database Standard: ODMG-93 (Release 1.2)
#@R. G. G. Cattell
#year1996
#conf
#citation2
#index2302
#arnetid2304

#*Priniples of Database Query Processing for Advanced Applications
#@Clement T. Yu,Weiyi Meng
#year1997
#conf
#citation203
#index2303
#arnetid2305

#*The Object Database Standard: ODMG 2.0
#@R. G. G. Cattell
#year1997
#conf
#citation10
#index2304
#arnetid2306

#*Advanced Database Systems.
#@Carlo Zaniolo,Stefano Ceri,Christos Faloutsos,Richard T. Snodgrass,V. S. Subrahmanian,Roberto Zicari
#year1997
#conf
#citation5
#index2305
#arnetid2307

#*SQL for Smarties: Advanced SQL Programming
#@Joe Celko
#year1995
#conf
#citation2
#index2306
#arnetid2308

#*Readings in Object-Oriented Database Systems
#@Stanley B. Zdonik,David Maier
#year1990
#conf
#citation346
#index2307
#arnetid2309

#*Joe Celko's SQL Puzzles & Answers
#@Joe Celko
#year1997
#conf
#citation3
#index2308
#arnetid2310

#*Active Database Systems: Triggers and Rules For Advanced Database Processing.
#@Jennifer Widom,Stefano Ceri
#year1996
#conf
#citation720
#index2309
#arnetid2311

#*SQL for Smarties: Advanced SQL Programming, Second Edition
#@Joe Celko
#year1999
#conf
#citation2
#index2310
#arnetid2312

#*Practical File System Design with the Be File System
#@Dominic Giampaolo
#year1999
#conf
#citation82
#index2311
#arnetid2313

#*Joe Celko's Data and Databases: Concepts in Practice
#@Joe Celko
#year1999
#conf
#citation12
#index2312
#arnetid2314

#*Unleashing Web 2.0: From Concepts to Creativity
#@Gottfried Vossen,Stephan Hagemann
#year2007
#conf
#citation101
#index2313
#arnetid2315
#!Vossen is both an IS & CS Professor at the University of Muenster, and also served as European Editor-in-Chief for Elseviers international information systems journal. Hagemann is his PhD student whose area of research is Web technology.

#*Using the New DB2: IBM's Object-Relational Database System.
#@Donald D. Chamberlin
#year1996
#conf
#citation-1
#index2314
#arnetid2316

#*A Complete Guide to DB2 Universal Database
#@Donald D. Chamberlin
#year1998
#conf
#citation106
#index2315
#arnetid2317

#*Engineering a Compiler
#@Keith D. Cooper,Linda Torczon
#year2004
#conf
#citation176
#index2316
#arnetid2318

#*Fuzzy Modeling Tools for Data Mining and Knowledge Discovery: Knowledge Discovery, Fuzzy Rule Induction, and Autonomous Agents for Databases and Spreadsheets
#@Earl Cox
#year2000
#conf
#citation-1
#index2317
#arnetid2319

#*Component Database Systems
#@Klaus R. Dittrich,Andreas Geppert
#year2000
#conf
#citation43
#index2318
#arnetid2320

#*Database Transaction Models for Advanced Applications.
#@Ahmed K. Elmagarmid
#year1992
#conf
#citation842
#index2319
#arnetid2321

#*Camelot and Avalon: A Distributed Transaction Facility
#@Jeffrey L. Eppinger,Lily B. Mummert,Alfred Z. Spector
#year1991
#conf
#citation153
#index2320
#arnetid2322

#*Information Visualization in Data Mining and Knowledge Discovery
#@Usama M. Fayyad,Georges G. Grinstein,Andreas Wierse
#year2000
#conf
#citation331
#index2321
#arnetid2323

#*Information Visualization in Data Mining and Knowledge Discovery
#@Usama M. Fayyad,Georges G. Grinstein,Andreas Wierse
#year2001
#conf
#citation331
#index2322
#arnetid2324

#*Database-Driven Web Sites
#@Jesse Feiler
#year1999
#conf
#citation5
#index2323
#arnetid2325

#*Query Processing for Advanced Database Systems, Selected Contributions from a Workshop on "Query Processing in Object-Oriented, Complex-Object and Nested Relation Databases", Interationales Begegnungs- und Forschungszentrum für Informatik, Schloss Dagstuhl, Germany, June 1991
#@Johann Christoph Freytag,David Maier,Gottfried Vossen
#year1994
#conf
#citation-1
#index2324
#arnetid2326

#*Essentials of Artificial Intelligence
#@Matthew L. Ginsberg
#year1993
#conf
#citation284
#index2325
#arnetid2327

#*The Benchmark Handbook for Database and Transaction Systems (1st Edition).
#@Jim Gray
#year1991
#conf
#citation-1
#index2326
#arnetid2328

#*The Benchmark Handbook for Database and Transaction Systems (2nd Edition).
#@Jim Gray
#year1993
#conf
#citation-1
#index2327
#arnetid2329

#*Transaction Processing: Concepts and Techniques
#@Jim Gray,Andreas Reuter
#year1993
#conf
#citation3447
#index2328
#arnetid2330

#*Moving Objects Databases
#@Ralf Hartmut Güting,Markus Schneider
#year2005
#conf
#citation209
#index2329
#arnetid2331

#*Web Farming for the Data Warehouse
#@Richard D. Hackathorn
#year1998
#conf
#citation97
#index2330
#arnetid2332

#*Data Mining: Concepts and Techniques
#@Jiawei Han,Micheline Kamber
#year2000
#conf
#citation10075
#index2331
#arnetid2333

#*Computer Architecture: A Quantitative Approach, 2nd Edition
#@John L. Hennessy,David A. Patterson
#year1996
#conf
#citation-1
#index2332
#arnetid2334

#*Recovery in Parallel Database Systems, Second Edition
#@Svein-Olaf Hvasshovd
#year1999
#conf
#citation-1
#index2333
#arnetid2335

#*Web Dragons: Inside the Myths of Search Engine Technology
#@Ian H. Witten,Marco Gori,Teresa Numerico
#year2006
#conf
#citation26
#index2334
#arnetid2336

#*A Guide to Developing Client/Server SQL Applications
#@Setrag Khoshafian,Arvola Chan,Anna Wong,Harry K. T. Wong
#year1992
#conf
#citation23
#index2335
#arnetid2337

#*The Jasmine Object Database: Multimedia Applications for the Web
#@Setrag Khoshafian,Surapol Dasananda
#year1998
#conf
#citation23
#index2336
#arnetid2338

#*Elements of Machine Learning.
#@Pat Langley
#year1994
#conf
#citation480
#index2337
#arnetid2339

#*Practical Digital Libraries: Books, Bytes, and Bucks
#@Michael Lesk
#year1997
#conf
#citation354
#index2338
#arnetid2340

#*Distributed Algorithms
#@Nancy A. Lynch
#year1996
#conf
#citation3087
#index2339
#arnetid2341
#!:In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers and researchers. Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others. The material is organized according to the system model - first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference. The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable. The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms - to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.

#*Atomic Transactions
#@Nancy A. Lynch,Michael Merritt,William E. Weihl,Alan Fekete
#year1993
#conf
#citation32
#index2340
#arnetid2342

#*Understanding SQL and Java Together: A Guide to SGLJ, JDBC, and Related Technologies
#@Jim Melton
#year2000
#conf
#citation31
#index2341
#arnetid2343

#*Understanding the New SQL: A Complete Guide, Second Edition, Volume I
#@Jim Melton
#year2000
#conf
#citation-1
#index2342
#arnetid2344

#*Understanding SQL Stored Procedures: A Complete Guide to SQL/PSM
#@Jim Melton
#year1998
#conf
#citation19
#index2343
#arnetid2345

#*Understanding the New SQL: A Complete Guide
#@Jim Melton,Alan R. Simon
#year1993
#conf
#citation-1
#index2344
#arnetid2346

#*Foundations of Deductive Databases and Logic Programming
#@Jack Minker
#year1988
#conf
#citation358
#index2345
#arnetid2347

#*Advanced Compiler Design and Implementation
#@Steven S. Muchnick
#year1997
#conf
#citation2362
#index2346
#arnetid2348

#*Commonsense Reasoning
#@Erik T. Mueller
#year2006
#conf
#citation105
#index2347
#arnetid2349

#*Database Design for Smarties: Using UML for Data Modeling
#@Robert J. Muller
#year1999
#conf
#citation-1
#index2348
#arnetid2350

#*Machine Learning: A Theoretical Approach.
#@Balas K. Natarajan
#year1991
#conf
#citation315
#index2349
#arnetid2351

#*Database Principles, Programming, Performance
#@Patrick E. O'Neil
#year1994
#conf
#citation-1
#index2350
#arnetid2352

#*Database: Principles, Programming, and Performance, Second Edition
#@Patrick E. O'Neil,Elizabeth J. O'Neil
#year2000
#conf
#citation-1
#index2351
#arnetid2353

#*Data Quality: The Accuracy Dimension
#@Jack E. Olson
#year2003
#conf
#citation120
#index2352
#arnetid2354

#*Computer Architecture: A Quantitative Approach.
#@David A. Patterson,John L. Hennessy
#year1990
#conf
#citation1874
#index2353
#arnetid2355

#*Computer Organization & Design: The Hardware/Software Interface
#@David A. Patterson,John L. Hennessy
#year1994
#conf
#citation1582
#index2354
#arnetid2356

#*Computer Organization & Design: The Hardware/Software Interface, Second Edition
#@David A. Patterson,John L. Hennessy
#year1997
#conf
#citation-1
#index2355
#arnetid2357

#*MICO: An Open Source CORBA Implementation
#@Arno Puder,Kay Römer
#year2000
#conf
#citation63
#index2356
#arnetid2358

#*Data Preparation for Data Mining
#@Dorian Pyle
#year1999
#conf
#citation832
#index2357
#arnetid2359

#*C4.5: Programs for Machine Learning
#@J. Ross Quinlan
#year1993
#conf
#citation15864
#index2358
#arnetid2360
#!:Classifier systems play a major role in machine learning and knowledge-based systems, and Ross Quinlan's work on ID3 and C4.5 is widely acknowledged to have made some of the most significant contributions to their development. This book is a complete guide to the C4.5 system as implemented in C for the UNIX environment. It contains a comprehensive guide to the system's use , the source code (about 8,800 lines), and implementation notes. The source code and sample datasets are also available on a 3.5-inch floppy diskette for a Sun workstation. C4.5 starts with large sets of cases belonging to known classes. The cases, described by any mixture of nominal and numeric properties, are scrutinized for patterns that allow the classes to be reliably discriminated. These patterns are then expressed as models, in the form of decision trees or sets of if-then rules, that can be used to classify new cases, with emphasis on making the models understandable as well as accurate. The system has been applied successfully to tasks involving tens of thousands of cases described by hundreds of properties. The book starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting. Advantages and disadvantages of the C4.5 approach are discussed and illustrated with several case studies. This book and software should be of interest to developers of classification-based intelligent systems and to students in machine learning and expert systems courses.

#*Introduction to Data Compression
#@Khalid Sayood
#year1996
#conf
#citation1394
#index2359
#arnetid2361

#*Location-Based Services
#@Jochen H. Schiller,Agnes Voisard
#year2004
#conf
#citation244
#index2360
#arnetid2362

#*Developing Time-Oriented Database Applications in SQL
#@Richard T. Snodgrass
#year1999
#conf
#citation255
#index2361
#arnetid2363

#*Readings in Database Systems, First Edition
#@Michael Stonebraker
#year1988
#conf
#citation-1
#index2362
#arnetid2364

#*Readings in Database Systems, Second Edition
#@Michael Stonebraker
#year1994
#conf
#citation-1
#index2363
#arnetid2365

#*Object-Relational DBMSs: The Next Great Wave
#@Michael Stonebraker,Dorothy Moore
#year1996
#conf
#citation-1
#index2364
#arnetid2366
#!:Discover why object-relational technology is ideal for supporting a broad spectrum of data types and application areas, from financial services to multimedia data. In this completely revised and updated edition, database experts Michael Stonebraker and Paul Brown explore the object-relational paradigm and examine the most recent developments in the field. Specially written for database application programmers, database analysts, and IT managers, this book includes detailed information on how to classify DBMS applications, where object-relational DBMSs fit in the database world, and what mechanisms are required to support such an engine.

#*Readings in Database Systems, Third Edition
#@Michael Stonebraker,Joseph M. Hellerstein
#year1998
#conf
#citation-1
#index2365
#arnetid2367

#*The Mathematics of Inheritance Systems
#@David S. Touretzky
#year1986
#conf
#citation503
#index2366
#arnetid2368

#*Object-Relational DBMSs, Second Edition
#@Michael Stonebraker,Paul Brown,Dorothy Moore
#year1998
#conf
#citation-1
#index2367
#arnetid2369

#*A Many-Sorted Calculus Based on Resolution and Paramodulation.
#@Christoph Walther
#year1987
#conf
#citation181
#index2368
#arnetid2370
#%951441
#!The first-order calculus whose well formed formulas are clauses and whose sole inference rules are factorization, resolution and paramodulation is extended to a many-sorted calculus. As a basis for Automated Theorem Proving, this many-sorted calculus leads to a remarkable reduction of the search space and also to simpler proofs. The soundness and completeness of the new calculus and the Sort-Theorem, which relates the many-sorted calculus to its one-sorted counterpart, are shown. In addition results about term rewriting and unification in a many-sorted calculus are obtained. Practical examples and a proof protocol of an automated theorem prover based on the many-sorted calculus are presented.

#*Principles of Multimedia Database Systems
#@V. S. Subrahmanian
#year1998
#conf
#citation255
#index2369
#arnetid2371

#*Database Modeling & Design, Third Edition
#@Toby J. Teorey
#year1998
#conf
#citation-1
#index2370
#arnetid2372

#*Inside ODBC.
#@Kyle Geiger
#year1995
#conf
#citation80
#index2371
#arnetid2373

#*Inside COM.
#@Dale Rogerson
#year1997
#conf
#citation357
#index2372
#arnetid2374

#*The Data Compression Book, 2nd Edition
#@Mark Nelson,Jean-Loup Gailly
#year1996
#conf
#citation584
#index2373
#arnetid2375

#*Managing Gigabytes: Compressing and Indexing Documents and Images.
#@Ian H. Witten,Alistair Moffat,Timothy C. Bell
#year1994
#conf
#citation1764
#index2374
#arnetid2376

#*Plattformen.
#@Wolfgang Appelt
#year2004
#confCSCL-Kompendium
#citation-1
#index2375
#arnetid2377

#*CSCL im Fernstudium.
#@Patricia Arnold
#year2004
#confCSCL-Kompendium
#citation1
#index2376
#arnetid2378

#*Selbst organisierte Szenarien.
#@Patricia Arnold,Eva Hornecker
#year2004
#confCSCL-Kompendium
#citation-1
#index2377
#arnetid2379

#*CSCL in Hochschulseminaren: Zwei Beispielszenarien aus der Praxis.
#@Angela Carell,Andrea Kienle,Thomas Herrmann
#year2004
#confCSCL-Kompendium
#citation-1
#index2378
#arnetid2380

#*Virtuelle kooperative Lernräume.
#@Peter Dawabi
#year2004
#confCSCL-Kompendium
#citation-1
#index2379
#arnetid2381

#*Kooperation in größeren Lerngruppen.
#@Wolfgang Effelsberg,Hans Christian Liebig,Nicolai Scheele,Jürgen Vogel
#year2004
#confCSCL-Kompendium
#citation-1
#index2380
#arnetid2382

#*CSCL als Herausforderung an die Lehrerbildung.
#@Christian Görlich,Ludger Humbert
#year2004
#confCSCL-Kompendium
#citation0
#index2381
#arnetid2383

#*Kollaboratives Lernen Studierender mit Hilfe von Knowledge Forum.
#@Franz Gramlinger
#year2004
#confCSCL-Kompendium
#citation2
#index2382
#arnetid2384

#*Pädagogische und didaktische Grundlagen.
#@Christian Grune,Claudia deWitt
#year2004
#confCSCL-Kompendium
#citation-1
#index2383
#arnetid2385

#*Einleitung und Begriffe.
#@Jörg M. Haake,Gerhard Schwabe,Martin Wessner
#year2004
#confCSCL-Kompendium
#citation-1
#index2384
#arnetid2386

#*Entwicklungsprozess.
#@Jörg M. Haake,Gerhard Schwabe,Martin Wessner
#year2004
#confCSCL-Kompendium
#citation-1
#index2385
#arnetid2387

#*Kooperative Lernräume.
#@Jörg M. Haake,Martin Wessner
#year2004
#confCSCL-Kompendium
#citation-1
#index2386
#arnetid2388

#*Software- und Systementwicklung.
#@Andreas Harrer,Sam Zeini,Heinz Ulrich Hoppe
#year2004
#confCSCL-Kompendium
#citation-1
#index2387
#arnetid2389

#*Informatikgrundlagen und Mensch-Computer-Kommunikation.
#@Ronald Hartwig,Michael Herczeg
#year2004
#confCSCL-Kompendium
#citation2
#index2388
#arnetid2390

#*Problemorientiertes Lernen.
#@Nicole Hoffmann
#year2004
#confCSCL-Kompendium
#citation-1
#index2389
#arnetid2391

#*Kooperation in kleineren Lerngruppen.
#@Torsten Holmer,Friedricke Jödick
#year2004
#confCSCL-Kompendium
#citation-1
#index2390
#arnetid2392

#*Einführung und Bereitstellung.
#@Iver Jackewitz,Bernd Pape
#year2004
#confCSCL-Kompendium
#citation-1
#index2391
#arnetid2393

#*Lern- und kommunikationspsychologische Grundlagen.
#@Monique Janneck
#year2004
#confCSCL-Kompendium
#citation7
#index2392
#arnetid2394

#*Projektorientierung.
#@Michael Janneck
#year2004
#confCSCL-Kompendium
#citation3
#index2393
#arnetid2395

#*Gruppen und Gruppenarbeit.
#@Michael Janneck,Monique Janneck
#year2004
#confCSCL-Kompendium
#citation7
#index2394
#arnetid2396

#*Mediendidaktische Konzeption.
#@Michael Kerres,Axel Nattland,Ilke Nübel
#year2004
#confCSCL-Kompendium
#citation3
#index2395
#arnetid2397

#*Konzepte für die Lerngruppe.
#@Andrea Kienle,Thomas Herrmann
#year2004
#confCSCL-Kompendium
#citation-1
#index2396
#arnetid2398

#*Qualitätssicherung.
#@Ute Linder
#year2004
#confCSCL-Kompendium
#citation-1
#index2397
#arnetid2399

#*Spezifikationen, Normen und Standards für Lernmaterialien.
#@R. Lindner
#year2004
#confCSCL-Kompendium
#citation-1
#index2398
#arnetid2400

#*Kooperatives Lernen in Organisationen.
#@Stefanie N. Lindstaedt,Johannes Farmer
#year2004
#confCSCL-Kompendium
#citation8
#index2399
#arnetid2401

#*CSCL in der betrieblichen Weiterbildung.
#@Stefanie N. Lindstaedt,Johannes Farmer,Tobias Ley
#year2004
#confCSCL-Kompendium
#citation1
#index2400
#arnetid2402

#*Neue Lernformen in der Berufsausbildung: Eine Fallstudie.
#@Claudia Lohr,Rolf Meyer
#year2004
#confCSCL-Kompendium
#citation0
#index2401
#arnetid2403

#*CSCL in der Schule.
#@Johannes Magenheim
#year2004
#confCSCL-Kompendium
#citation0
#index2402
#arnetid2404

#*Forschungsmethoden.
#@Hans-Rüdiger Pfister
#year2004
#confCSCL-Kompendium
#citation5
#index2403
#arnetid2405

#*Koordinationswerkzeuge zur Bildung von Lerngruppen.
#@Tim Reichling,Andreas Becks,Oliver Bresser,Volker Wulf
#year2004
#confCSCL-Kompendium
#citation3
#index2404
#arnetid2406

#*Moderation.
#@Birgit Schenk
#year2004
#confCSCL-Kompendium
#citation-1
#index2405
#arnetid2407

#*Coaching.
#@Claudia Schlienger-Merki,Helmut Schauer
#year2004
#confCSCL-Kompendium
#citation-1
#index2406
#arnetid2408

#*Konzepte zur Administration.
#@Franziska Schneider,Helmut Schauer
#year2004
#confCSCL-Kompendium
#citation-1
#index2407
#arnetid2409

#*Kommunikation.
#@Till Schümmer,Jörg M. Haake
#year2004
#confCSCL-Kompendium
#citation-1
#index2408
#arnetid2410

#*Medienwahl.
#@Gerhard Schwabe
#year2004
#confCSCL-Kompendium
#citation-1
#index2409
#arnetid2411
#!The Software Abstract is intended to tell its reader enough about the software to know where to find all the other information that exists about it, anywhere. A copy of the Abstract opens every document about the software. It has a fairly rigid format, so a sequence of Abstracts can be scanned swiftly, the same information always being found at the same place. The format of the Software Abstract is defined in Figure 1. Although most Software Abstracts are written to define individual programs, the format is also an effective tool for describing any software entity: subroutine, program, software system or subsystem, data file, or library. It has even been used successfully to document books and articles about documenting (Schneider, French, Lucas 77). The Abstract is constrained to fit on one side of one sheet of paper. This is the reason that certain sections of the Abstract are considered optional.An Example of Software Abstract is shown in Figure 2. The example demonstrates the considerable informational latitude that can be incorporated into a Software Abstract without violating the strict format guidelines. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player

#*Adaptivität für individuelles Lernen.
#@Cornelia Seeberg
#year2004
#confCSCL-Kompendium
#citation-1
#index2410
#arnetid2412

#*Werkzeuge für spezielle Lernmethoden.
#@Sabine Seufert,Martin Wessner
#year2004
#confCSCL-Kompendium
#citation-1
#index2411
#arnetid2413

#*Kommunikationskonzepte.
#@Gerry Stahl,Angela Carell
#year2004
#confCSCL-Kompendium
#citation2
#index2412
#arnetid2414

#*CSCL für Lernbehinderte und Hochbegabte.
#@Harald Weber
#year2004
#confCSCL-Kompendium
#citation-1
#index2413
#arnetid2415

#*Motivation.
#@Armin Weinberger,Frank Fischer
#year2004
#confCSCL-Kompendium
#citation-1
#index2414
#arnetid2416

#*Lerngruppen.
#@Martin Wessner
#year2004
#confCSCL-Kompendium
#citation4
#index2415
#arnetid2417

#*Perspektiven.
#@Martin Wessner,Jörg M. Haake,Gerhard Schwabe
#year2004
#confCSCL-Kompendium
#citation-1
#index2416
#arnetid2418

#*Konzepte für den Lehrenden.
#@Martin Wessner,Gerhard Schwabe,Jörg M. Haake
#year2004
#confCSCL-Kompendium
#citation-1
#index2417
#arnetid2419

#*Bedarfsanalysen.
#@Katrin Allmendinger
#year2004
#confCSCL-Kompendium
#citation1
#index2418
#arnetid2420

#*Sicherheit: Gewährleistung und Begrenzung des Informationsflusses.
#@Joachim Biskup
#year1991
#confEntwicklungstendenzen bei Datenbanksystemen
#citation-1
#index2419
#arnetid2421

#*Logikorientierte Datenbanken - eine Einführung.
#@Bernhard Convent
#year1991
#confEntwicklungstendenzen bei Datenbanksystemen
#citation-1
#index2420
#arnetid2422

#*Konzepte objektorientierter Datenmodelle.
#@Andreas Heuer
#year1991
#confEntwicklungstendenzen bei Datenbanksystemen
#citation2
#index2421
#arnetid2423

#*Eine Einführung in Frame-Logik.
#@Georg Lausen,Beate Marx
#year1991
#confEntwicklungstendenzen bei Datenbanksystemen
#citation1
#index2422
#arnetid2424

#*Natürlichsprachliche Interaktion mit Datenbanken.
#@Jörg Noack
#year1991
#confEntwicklungstendenzen bei Datenbanksystemen
#citation-1
#index2423
#arnetid2425

#*Konzepte des Datenbank-Entwurfs.
#@Bernhard Thalheim
#year1991
#confEntwicklungstendenzen bei Datenbanksystemen
#citation5
#index2424
#arnetid2426

#*Modellbildung für Datenbank-Transaktionen.
#@Gottfried Vossen
#year1991
#confEntwicklungstendenzen bei Datenbanksystemen
#citation-1
#index2425
#arnetid2427

#*Datenbankkonzepte für wissensbasierte Systeme.
#@Bernd Walter
#year1991
#confEntwicklungstendenzen bei Datenbanksystemen
#citation-1
#index2426
#arnetid2428

#*Datenstrukturen für Geodatenbanken.
#@Peter Widmayer
#year1991
#confEntwicklungstendenzen bei Datenbanksystemen
#citation-1
#index2427
#arnetid2429
#!Dieser Bericht gibt eine Uebersicht ueber den gegenwaertigen Stand des Entwurfs effizienter Zugriffsstrukturen fur geometrische Objekte in Datenbanken.

#*Operationen und Kalküle für komplex strukturierte Werte und Objekte.
#@Kurt-Ulrich Witt
#year1991
#confEntwicklungstendenzen bei Datenbanksystemen
#citation-1
#index2428
#arnetid2430

#*Studien- und Forschungsführer Informatik der neuen Bundesländer (Fakultätentag Informatik, Arbeitskreis "Informatik an Deutschen Universitäten und Wissenschaftlichen Hochschulen"), 2. Aufl.
#@Hans-Jürgen Appelrath,Roland Zimmerling
#year1991
#conf
#citation-1
#index2429
#arnetid2431

#*Theoretische Informatik: Eine anwendungsorientierte Einführung, 2. Auflage
#@Norbert Blum
#year2001
#conf
#citation10
#index2430
#arnetid2432

#*Java 2, Von den Grundlagen bis zu Threads und Netzen, 2. Auflage
#@Ernst-Wolfgang Dieterich
#year2001
#conf
#citation7
#index2431
#arnetid2433

#*Einführung in die objektorientierte Programmierung mit Java, 2. Auflage
#@Ernst-Erich Doberkat,Stefan Dißmann
#year2002
#conf
#citation-1
#index2432
#arnetid2434

#*Einführung in die objektorientierte Programmierung mit Java, 1. Auflage
#@Ernst-Erich Doberkat,Stefan Dißmann
#year1999
#conf
#citation-1
#index2433
#arnetid2435

#*Einführung in die Theoretische Informatik: Formale Sprachen und Automatentheorie
#@Ulrich Hedtstück
#year2000
#conf
#citation-1
#index2434
#arnetid2436

#*Übersetzerbau
#@Uwe Kastens
#year1990
#conf
#citation-1
#index2435
#arnetid2437

#*Datenbanksysteme - Eine Einführung, 4. Auflage
#@Alfons Kemper,André Eickler
#year2001
#conf
#citation-1
#index2436
#arnetid2438

#*Datenbanksysteme - Eine Einführung, 5. Auflage
#@Alfons Kemper,André Eickler
#year2004
#conf
#citation-1
#index2437
#arnetid2439

#*Datenbanksysteme - Eine Einführung, 6. Auflage
#@Alfons Kemper,André Eickler
#year2006
#conf
#citation-1
#index2438
#arnetid2440

#*Algorithmen in Java
#@Hans-Werner Lang
#year2003
#conf
#citation21
#index2439
#arnetid2441

#*Rechneraufbau und Rechnerstrukturen, 9. Auflage
#@Walter Oberschelp,Gottfried Vossen
#year2003
#conf
#citation-1
#index2440
#arnetid2442

#*Datenbanken im Unternehmen: Analyse, Modellbildung und Einsatz
#@Günther Pernul,Rainer Unland
#year2001
#conf
#citation17
#index2441
#arnetid2443

#*Ähnlichkeitssuche in Multimedia-Datenbanken - Retrieval, Suchalgorithmen und Anfragebehandlung
#@Ingo Schmitt
#year2005
#conf
#citation0
#index2442
#arnetid2444

#*Ideen der Informatik: Grundlegende Modelle und Konzepte
#@Uwe Schöning
#year2002
#conf
#citation10
#index2443
#arnetid2445

#*Datenmodelle, Datenbanksprachen und Datenbankmanagementsysteme, 4. Auflage
#@Gottfried Vossen
#year2000
#conf
#citation-1
#index2444
#arnetid2446

#*CSCL-Kompendium. Lehr- und Handbuch zum computerunterstützten kooperativen Lernen
#@Jorg M. Haake,Gerhard Schwabe,Martin Wessner
#year2004
#confCSCL-Kompendium
#citation-1
#index2445
#arnetid2447

#*Datenmodelle, Datenbanksprachen und Datenbankmanagementsysteme, 5. Auflage
#@Gottfried Vossen
#year2008
#conf
#citation-1
#index2446
#arnetid2448

#*Datenbanksysteme - Eine Einführung, 7. Auflage
#@Alfons Kemper,André Eickler
#year2009
#conf
#citation-1
#index2447
#arnetid2449

#*Übungsbuch Datenbanksysteme, 2. Auflage
#@Alfons Kemper,Martin Wimmer
#year2009
#conf
#citation-1
#index2448
#arnetid2450

#*JavaServer Pages
#@Hans Bergsten
#year2001
#conf
#citation-1
#index2449
#arnetid2451
#!:JavaServer Pages (JSP) technology provides an easy way to create dynamic web pages. JSP uses a component-based approach that allows web developers to easily combine static HTML for look-and-feel with Java components for dynamic features. The simplicity of this component-based model, combined with the cross-platform power of Java, allows a web development environment with enormous potential. JavaServer Pages shows how to develop Java-based web applications without having to be a hardcore programmer. The author provides an overview of JSP concepts and discusses how JSP fits into the larger picture of web applications. Web page authors will benefit from the chapters on generating dynamic content, handling session information, accessing databases, authenticating users, and personalizing content. In the programming-oriented chapters, Java programmers learn how to create Java components and custom JSP tags for web authors to use in JSP pages. About the Author: Hans Bergsten is the founder of Gefion Software, whose main product is a servlet-based component suite for developing web applications. Hans is also an active participant in the development of the JSP specification.

#*Java Cookbook
#@Ian F. Darwin
#year2001
#conf
#citation35
#index2450
#arnetid2452

#*Java Examples in a Nutshell
#@David Flanagan
#year2000
#conf
#citation124
#index2451
#arnetid2453
#!:This book is a companion volume to Java in a Nutshell. While Java in a Nutshell is a quick-reference at heart, it also includes an accelerated introduction to Java programming. Java Examples in a Nutshell picks up where that book leaves off, providing a suite of example programs for novice Java programmers and experts alike. This book doesn't hold your hand or supply detailed explanations of Java syntax or method calls; it simply delivers well-commented, working examples that explore the wide range of what is possible with Java 1.1. Each chapter concludes with programming exercises that suggest further avenues for building on what you have learned.

#*Java in a Nutshell - A Desktop Quick Reference for Java Programmers, Covers Java 1.0
#@David Flanagan
#year1996
#conf
#citation0
#index2452
#arnetid2454

#*Java Power Reference
#@David Flanagan
#year1999
#conf
#citation5
#index2453
#arnetid2455

#*Java Foundation Classes in a Nutshell
#@David Flanagan
#year1999
#conf
#citation-1
#index2454
#arnetid2456

#*Java Fundamental Classes Reference
#@Mark Grand,Jonathan Knudsen
#year1997
#conf
#citation21
#index2455
#arnetid2457

#*XML in a Nutshell
#@Elliotte Rusty Harold,W. Scott Means
#year2001
#conf
#citation493
#index2456
#arnetid2458
#!This authoritative new edition of XML in a Nutshell provides developers with a complete guide to the rapidly evolving XML space. Serious users of XML will find topics on just about everything they need, including fundamental syntax rules, details of DTD and XML Schema creation, XSLT transformations, and APIs used for processing XML documents. Simply put, this is the only reference of its kind among XML books.

#*Java 2D Graphics
#@Jonathan Knudsen
#year1999
#conf
#citation50
#index2457
#arnetid2459
#!One weakness of Java has been its graphics capabilities. Java 1.0 and 1.1 only included simple primitives for line drawing: lines could only be one pixel wide, they could only be solid, and there wasn't any good way to draw curves. Font management and color management were also weak. Java 2D (collectively called the "2D API") signals a major improvement in Java's graphics capabilities. It covers many of the classes in Java 1.2 that address graphics handling and improves on many weaknesses that were present in the previous versions of Java. The 2D API allows you to produce high-quality, professional images on a screen or printer. Java 2D Graphics describes the 2D API from top to bottom, demonstrating how to set line styles and pattern fills as well as more advanced techniques of image processing and font handling. You'll see how to create and manipulate the three types of graphics objects: shapes, text, and images. Other topics include image data storage, color management, font glyphs, and printing. Java 2D Graphics assumes no prior knowledge of graphics. Chock full of detailed explanations and examples, this book provides beginning Java programmers with a solid foundation in 2D graphics and helps more advanced programmers create and use high-quality images in their applications. Topics covered in the book include: The rendering pipelineShapes and pathsGeometryPainting with solid colors, gradients, and texturesStroking paths, including dashed linesTransformations: translation, rotation, shearing, and scalingAlpha compositingClippingRasterizing and antialiasingFonts and textFont metricsGlyphsColors and color spacessRGB and CIEXYZICC color profilesImages, image color models, and image dataImage processingImage data storageGraphics devicesPrinting

#*Java and XML
#@Brett McLaughlin
#year2000
#conf
#citation328
#index2458
#arnetid2460
#!Java revolutionized the programming world by providing a platform-independent programming language. XML takes the revolution a step further with a platform-independent language for interchanging data. Java and XML shows how to put the two together, building real-world applications in which both the code and the data are truly portable.

#*Java Virtual Machine
#@Jon Meyer,Troy Downing
#year1997
#conf
#citation231
#index2459
#arnetid2461

#*Windows 98 in a Nutshell
#@Tim O'Reilly,Troy Mott,Walter Glenn
#year1999
#conf
#citation-1
#index2460
#arnetid2462

#*Database Programming with JDBC and Java
#@George Reese
#year1997
#conf
#citation213
#index2461
#arnetid2463

#*Java Performance Tuning
#@Jack Shirazi
#year2000
#conf
#citation106
#index2462
#arnetid2464

#*CJKV Information Processing: Chinese, Japanese, Korean & Vietnamese Computing
#@Ken Lunde
#year1999
#conf
#citation26
#index2463
#arnetid2465

#*CGI Programming on the World Wide Web, 1st Edition
#@Shishir Gundavaram
#year1996
#conf
#citation-1
#index2464
#arnetid2466

#*Programming the Be Operating System: Writing Programs for the Be Operating System
#@Dan Parks Sydow
#year1999
#conf
#citation-1
#index2465
#arnetid2467

#*Natural Language Processing with Thought Treasure
#@Erik T. Mueller
#year1998
#conf
#citation-1
#index2466
#arnetid2468

#*Tree Automata
#@Ferenc Gécseg,Magnus Steinby
#year1984
#conf
#citation603
#index2467
#arnetid2469

#*Unification theory.
#@Franz Baader,Jörg H. Siekmann
#year1994
#confHandbook of Logic in Artificial Intelligence and Logic Programming (2)
#citation456
#index2468
#arnetid2470

#*Classical vs non-classical logics (the universality of classical logic).
#@Dov M. Gabbay
#year1994
#confHandbook of Logic in Artificial Intelligence and Logic Programming (2)
#citation33
#index2469
#arnetid2471

#*Higher order logic.
#@Daniel Leivant
#year1994
#confHandbook of Logic in Artificial Intelligence and Logic Programming (2)
#citation52
#index2470
#arnetid2472

#*Meta-languages, reflection principles, and self-reference.
#@Donald Perlis,V. S. Subrahmanian
#year1994
#confHandbook of Logic in Artificial Intelligence and Logic Programming (2)
#citation17
#index2471
#arnetid2473

#*Mathematical induction.
#@Christoph Walther
#year1994
#confHandbook of Logic in Artificial Intelligence and Logic Programming (2)
#citation84
#index2472
#arnetid2474

#*Logical basis for the automation of reasoning: Case studies.
#@Larry Wos,Robert Veroff
#year1994
#confHandbook of Logic in Artificial Intelligence and Logic Programming (2)
#citation2
#index2473
#arnetid2475

#*MEME, MAST, and Meta-MEME: New Tools for Motif Discovery in Protein Sequences.
#@Timothy L. Bailey,Michael E. Baker,Charles Elkan,William Noble Grundy
#year1999
#confPattern Discovery in Biomolecular Data
#citation12
#index2474
#arnetid2476

#*Discovering Concepts in Structural Data.
#@Diane J. Cook,Lawrence B. Holder,Gehad Galal
#year1999
#confPattern Discovery in Biomolecular Data
#citation0
#index2475
#arnetid2477

#*Motif Discovery in Protein Structure Databases.
#@Janice I. Glasgow,Evan W. Steeg,Suzanne Fortier
#year1999
#confPattern Discovery in Biomolecular Data
#citation5
#index2476
#arnetid2478

#*Assembling Blocks.
#@Jorja G. Henikoff
#year1999
#confPattern Discovery in Biomolecular Data
#citation0
#index2477
#arnetid2479

#*A Framework for Biological Pattern Discovery on Networks of Workstations.
#@Bin Li,Dennis Shasha,Jason Tsong-Li Wang
#year1999
#confPattern Discovery in Biomolecular Data
#citation0
#index2478
#arnetid2480

#*Discovering Patterns in DNA Sequences by the Algorithmic Significance Method.
#@Aleksandar Milosavljevic
#year1999
#confPattern Discovery in Biomolecular Data
#citation1
#index2479
#arnetid2481

#*RNA Structure Analysis: A Multifaceted Approach.
#@Bruce A. Shapiro,Wojciech Kasprzak,Jin Chu Wu,Kathleen M. Currey
#year1999
#confPattern Discovery in Biomolecular Data
#citation1
#index2480
#arnetid2482

#*Systematic Detection of Protein Structural Motifs.
#@Kentaro Tomii,Minoru Kanehisa
#year1999
#confPattern Discovery in Biomolecular Data
#citation3
#index2481
#arnetid2483

#*Pattern Discovery and Classification in Biosequences.
#@Jason Tsong-Li Wang,Thomas G. Marr,Steve Rozen,Dennis Shasha
#year1999
#confPattern Discovery in Biomolecular Data
#citation0
#index2482
#arnetid2484

#*Overview: A System for Tracking and Managing the Results from Sequence Comparison Programs.
#@David P. Yee,Judith Bayard Cushing,Tim Hunkapiller,Elizabeth Kutter
#year1999
#confPattern Discovery in Biomolecular Data
#citation1
#index2483
#arnetid2485

#*Representation and Matching of Small Flexible Molecules in Large Databases of 3D Molecular Information.
#@Isidore Rigoutsos,Daniel E. Platt,Andrea Califano,B. David Silverman
#year1999
#confPattern Discovery in Biomolecular Data
#citation3
#index2484
#arnetid2486

#*Text Algorithms
#@Maxime Crochemore,Wojciech Rytter
#year1994
#conf
#citation695
#index2485
#arnetid2487

#*Handbook of Logic in Artificial Intelligence and Logic Programming, Volume2, Deduction Methodologies
#@Dov M. Gabbay,Christopher J. Hogger,J. A. Robinson,Jorg H. Siekmann
#year1994
#confHandbook of Logic in Artificial Intelligence and Logic Programming, Volume 2
#citation-1
#index2486
#arnetid2488

#*Pattern Discovery in Biomolecular Data: Tools, Techniques and Applications
#@Jason Tsong-Li Wang,Bruce A. Shapiro,Dennis Shasha
#year1999
#conf
#citation86
#index2487
#arnetid2489

#*The Vbase Object Database Environment.
#@Timothy Andrews
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation7
#index2488
#arnetid2490

#*CommonLoops: Merging Lisp and Object-Oriented Programming.
#@Daniel G. Bobrow,Kenneth M. Kahn,Gregor Kiczales,Larry Masinter,Mark Stefik,Frank Zdybel
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation316
#index2489
#arnetid2491
#!CommonLoops blends object-oriented programming smoothly and tightly with the procedure-oriented design of Lisp. Functions and methods are combined in a more general abstraction. Message passing is invoked via normal Lisp function call. Methods are viewed as partial descriptions of procedures. Lisp data types are integrated with object classes. With these integrations, it is easy to incrementally move a program between the procedure and object-oriented styles.One of the most important properties of CommonLoops is its extensive use of meta-objects. We discuss three kinds of meta-objects: objects for classes, objects for methods, and objects for discriminators. We argue that these meta-objects make practical both efficient implementation and experimentation with new ideas for object-oriented programming.CommonLoops' small kernel is powerful enough to implement the major object-oriented systems in use today.

#*Complex Entities for Engineering Applications.
#@Klaus R. Dittrich,Willi Gotthard,Peter C. Lockemann
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation35
#index2490
#arnetid2492

#*Overview of the Iris DBMS.
#@Daniel H. Fishman,David Beech,Jurgen Annevelink,E. C. Chow,Tim Connors,J. W. Davis,Waqar Hasan,C. G. Hoch,William Kent,S. Leichner,Peter Lyngbæk,Brom Mahbod,Marie-Anne Neimat,Tore Risch,Ming-Chien Shan,W. Kevin Wilkinson
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation-1
#index2491
#arnetid2493

#*Database Description with SDM: A Semantic Database Model
#@Michael Hammer,Dennis McLeod
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation777
#index2492
#arnetid2494

#*A Tutorial on Semantic Database Modeling
#@Richard Hull,Roger King
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation11
#index2493
#arnetid2495

#*SIM: A Database System Based on the Semantic Data Model.
#@D. Jagannathan,R. L. Guck,B. L. Fritchman,J. P. Thompson,D. M. Tolbert
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation27
#index2494
#arnetid2496
#%1118449
#%1118668
#%544973
#%183149
#%299397
#%599866
#%125

#*PICQUERY: A High Level Query Language for Pictorial Database Management.
#@Thomas Joseph,Alfonso F. Cardenas
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation161
#index2495
#arnetid2497
#!A reasonably comprehensive set of data accessing and manipulation operations that should be supported by a generalized pictorial database management system (PDBMS) is proposed. A corresponding high-level query language, PICQUERY, is presented and illustrated through examples. PICQUERY has been designed with a flavor similar to QBE as the highly nonprocedural and conservational language for the pictorial database management system PICDMS. PICQUERY and a relational QBE-like language would form the language by which a user could access conventional relational databases and at the same time pictorial databases managed by PICDMS or other robust PDBMS. This languageinterface is part of an architecture aimed toward data heterogeneity transparency over pictorial and nonpictorial databases.

#*Managing Change in a Computer-Aided Design Database.
#@Randy H. Katz,Ellis E. Chang
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation101
#index2496
#arnetid2498
#!Object-oriented concepts can make a design database more reactive to changes in its contents. By embedding change semantics in the database model, the design engineer can be relieved of managing the detailed effects of changes. However, mechanisms are needed to limit the scope of change propagation and to unambiguously identify the objects to which propagated changes should apply. We propose new mechanisms based on group check-in/check-out, browser contexts and paths, configuration constraints, and rules, to support a powerful automatic change capability within a design database.

#*Integrating an Object-Oriented Programming System with a Database System.
#@Won Kim,Nat Ballou,Jay Banerjee,Hong-Tai Chou,Jorge F. Garza,Darrell Woelk
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation143
#index2497
#arnetid2499
#%1066671
#%299397
#%644022
#%642294
#%131789
#%598077
#%1118306
#%522378
#%139
#!There are two major issues to address to achieve integration of an object-oriented programming system with a database system. One is the language issue: an object-oriented programming language must be augmented with semantic data modeling concepts to provide a robust set of data modeling concepts to allow modeling of entities for important real-world applications. Another is the computational-model issue: application programmers should be able to access and manipulate objects as though the objects are in an infinite virtual memory; in other words, they should not have to be aware of the existence of a database system in their computations with the data structures the programming language allows. This paper discusses these issues and presents the solutions which we have incorporated into the ORION object-oriented database system at MCC.

#*Object Management in Distributed Information Systems.
#@Peter Lyngbæk,Dennis McLeod
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation-1
#index2498
#arnetid2500

#*Development of an Object-Oriented DBMS.
#@David Maier,Jacob Stein,Allen Otis,Alan Purdy
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation479
#index2499
#arnetid2501
#!We describe the results of developing the GemStone object-oriented database server, which supports a model of objects similar to that of Smalltalk-80. We begin with a summary of the goals and requirements for the system: an extensible data model that captures behavioral semantics, no artificial bounds on the number or size of database objects, database amenities (concurrency, transactions, recovery, associative access, authorization) and an interactive development environment. Object-oriented languages, Smalltalk in particular, answer some of these requirements. We discuss satisfying the remaining requirements in an object oriented context, and report briefly on the status of the development efforts. This paper is directed at an audience familiar with object-oriented languages and their implementation, but perhaps unacquainted with the difficulties and techniques of database system development. It updates the original report on the project [CM], and expands upon a more recent article [MDP].

#*The POSTGRES Data Model.
#@Lawrence A. Rowe,Michael Stonebraker
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation268
#index2500
#arnetid2502

#*Type Evolution in an Object-Oriented Database.
#@Andrea H. Skarra,Stanley B. Zdonik
#year1990
#confResearch Foundations in Object-Oriented and Semantic Database Systems
#citation135
#index2501
#arnetid2503

#*A Prological Definition of HASL: A Purely Functional Language with Unification-Based Conditional Binding Expressions.
#@Harvey Abramson
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation14
#index2502
#arnetid2504

#*Constraining-Unification and the Programming Language UNICORN.
#@Robert G. Bandes
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation7
#index2503
#arnetid2505
#%3451
#%1123596
#%1123269
#!Up to this point direct implementations of axiomatic or equational specifications have been limited because the implementation mechanisms used are incapable of capturing the full semantics of the specifications. The programming language Unicorn was designed and implemented with the intention of exploring the full potential of programming with equations. Unicorn introduces a new language mechanism, called constraining-unification. When coupled with semantic unification, constraining-unification closely models the semantics of equational specifications thereby allowing for the implementation of a wider class of specifications. Unlike the language mechanisms of rewrite-rule and logic programming, constraining-unification is free of order dependencies. The same results are produced regardless of the order in which the axioms are stated. The use of viewpoints contributes to the flexibility of the Unicorn language. Preconditions for partial operations can be specified without added machinery.

#*LEAF: A Language which Integrates Logic, Equations and Functions.
#@Roberto Barbuti,Marco Bellia,Giorgio Levi,Maurizio Martelli
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation50
#index2504
#arnetid2506

#*The APPLOG Language.
#@Shimon Cohen
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation8
#index2505
#arnetid2507

#*The Unification of Functional and Logic Languages.
#@John Darlington,A. J. Field,Helen Pull
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation74
#index2506
#arnetid2508

#*EQLOG: Equality, Types, and Generic Modules For Logic Programming.
#@Joseph A. Goguen,José Meseguer
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation277
#index2507
#arnetid2509

#*Logic Programming Language Scheme.
#@Joxan Jaffar,Jean-Louis Lassez,Michael J. Maher
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation91
#index2508
#arnetid2510

#*UNIFORM - A Language Based Upon Unification Which Unifies (much of) LISP, PROLOG, and ACT 1.
#@Kenneth M. Kahn
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation19
#index2509
#arnetid2511
#%951441
#%773455
#!Uniform is an AI programming language under development based upon augmented unification. It is an attempt to combine, in a simple coherent-framework, the most important features of Lisp, actor languages such as Act 1 and SmallTalk, and logic programming languages such as Prolog. Among the unusual abilities of the language is its ability to use the same program as a function, an inverse function, a predicate, a pattern, or a generator. All of these uses can be performed upon concrete, symbolic, and partially instantiated data. Uniform features automatic inheritance from multiple super classes, facilities for manipulation of programs, a limited ability to determine program equivalence, and a unification-oriented database.

#*Equality For Prolog.
#@William A. Kornfeld
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation82
#index2510
#arnetid2512
#%71886
#!The language Prolog has been extended by allowing the inclusion of assertions about equality. When a unification of two terms that do not unify syntactically is attempted, an equality theorem may be used to prove the two terms equal. If it is possible to prove that the two terms are equal the unification succeeds with the variable bindings introduced by the equality proof. It is shown that this mechanism significantly improves the power of Prolog. Sophisticated data abstraction with all the advantages of object-oriented programming is available. Techniques for passing partially instantiated data are described that extends the "multiuse" capabilities of the language, improve the efficiency of some programs, and allow the implementation of arithmetic relations that are both general and efficient. The modifications to standard Prolog are simple and straightforward and in addition the computational overhead for the extra linguistic power is not significant. Equality theorems will probably play an important role in future logic programming systems.

#*TABLOG: A New Approach To Logic Programming.
#@Yonathan Malachi,Zohar Manna,Richard J. Waldinger
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation10
#index2511
#arnetid2513

#*On the Relationship Between Logic and Functional Languages.
#@Uday S. Reddy
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation75
#index2512
#arnetid2514

#*QUTE: A Functional Language Based on Unification.
#@Masahiko Sato,Takafumi Sakurai
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation24
#index2513
#arnetid2515

#*FRESH: A Higher-Order Language With Unification and Multiple Results.
#@Gert Smolka
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation-1
#index2514
#arnetid2516

#*FUNLOG: A Computational Model Integrating Logic Programming and Functional Programming.
#@P. A. Subrahmanyam,Jia-Huai You
#year1986
#confLogic Programming: Functions, Relations, and Equations
#citation40
#index2515
#arnetid2517

#*Introduction to Data Structures and Algorithms Related to Information Retrieval.
#@Ricardo A. Baeza-Yates
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation52
#index2516
#arnetid2518

#*String Searching Algorithms.
#@Ricardo A. Baeza-Yates
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation19
#index2517
#arnetid2519

#*Signature Files.
#@Christos Faloutsos
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation88
#index2518
#arnetid2520
#!The Student Forum will provide an opportunity for students working in the area of dependable computing to present and discuss their research objectives, approaches and preliminary results. The Forum is centered around a conference track during which the selected "student research papers" are presented.

#*File Organizations for Optical Disks.
#@Daniel Alexander Ford,Stavros Christodoulakis
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation2
#index2519
#arnetid2521

#*Lexical Analysis and Stoplists.
#@Christopher J. Fox
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation-1
#index2520
#arnetid2522

#*Extended Boolean Models.
#@Edward A. Fox,S. Betrabet,M. Koushik,Whay C. Lee
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation28
#index2521
#arnetid2523

#*Introduction to Information Storage and Retrieval Systems.
#@William B. Frakes
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation50
#index2522
#arnetid2524

#*Stemming Algorithms.
#@William B. Frakes
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation284
#index2523
#arnetid2525

#*New Indices for Text: Pat Trees and Pat Arrays.
#@Gaston H. Gonnet,Ricardo A. Baeza-Yates,Tim Snider
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation257
#index2524
#arnetid2526

#*Relevance Feedback and Other Query Modification Techniques.
#@Donna Harman
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation192
#index2525
#arnetid2527

#*Ranking Algorithms.
#@Donna Harman
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation239
#index2526
#arnetid2528

#*Inverted Files.
#@Donna Harman,Edward A. Fox,Ricardo A. Baeza-Yates,Whay C. Lee
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation109
#index2527
#arnetid2529

#*Special-Purpose Hardware for Information Retrieval.
#@Lee A. Hollaar
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation4
#index2528
#arnetid2530

#*Clustering Algorithms.
#@Edie M. Rasmussen
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation422
#index2529
#arnetid2531

#*Thesaurus Construction.
#@Padmini Srivasan
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation52
#index2530
#arnetid2532

#*Parallel Information Retrieval Algorithms.
#@Craig Stanfill
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation7
#index2531
#arnetid2533

#*Boolean Operations.
#@Steven P. Wartik
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation21
#index2532
#arnetid2534

#*Hashing Algorithms.
#@Steven P. Wartik,Edward A. Fox,Lenwood S. Heath,Qi Fan Chen
#year1992
#confInformation Retrieval: Data Structures & Algorithms
#citation5
#index2533
#arnetid2535

#*Multimedia Communications - Synchronization.
#@Shahab Baqai,M. Farrukh Khan,Arif Ghafoor
#year1997
#confHandbook of Multimedia Information Management
#citation-1
#index2534
#arnetid2536

#*Design of Large-Scale Multimedia-on-Demand Storage Servers and Storage Hierarchies.
#@Milind M. Buddhikot,Guru M. Parulkar,Srihari Sampath Kumar,P. Venkat Rangan
#year1997
#confHandbook of Multimedia Information Management
#citation2
#index2535
#arnetid2537

#*Third-Generation Distributed Hypermedia Systems.
#@John F. Buford,Lloyd Rutledge
#year1997
#confHandbook of Multimedia Information Management
#citation4
#index2536
#arnetid2538

#*Visual Interfaces to Multimedia Databases.
#@Shi-Kuo Chang,Maria Francesca Costabile
#year1997
#confHandbook of Multimedia Information Management
#citation-1
#index2537
#arnetid2539

#*Video and Image Content Representation and Retrieval.
#@Nevenka Dimitrova,Forouzan Golshani
#year1997
#confHandbook of Multimedia Information Management
#citation10
#index2538
#arnetid2540

#*Modeling Time-Based Media.
#@Simon J. Gibbs,Christian Breiteneder,Dennis Tsichritzis
#year1997
#confHandbook of Multimedia Information Management
#citation3
#index2539
#arnetid2541

#*Image Database Prototypes.
#@Carole A. Goble
#year1997
#confHandbook of Multimedia Information Management
#citation6
#index2540
#arnetid2542

#*Composite Models.
#@Rei Hamakawa,A. Atarashi
#year1997
#confHandbook of Multimedia Information Management
#citation-1
#index2541
#arnetid2543

#*Document Model Issues for Hypermedia.
#@Lynda Hardman,Dick C. A. Bulterman
#year1997
#confHandbook of Multimedia Information Management
#citation9
#index2542
#arnetid2544

#*Content-Based Indexing and Retrieval.
#@H. V. Jagadish
#year1997
#confHandbook of Multimedia Information Management
#citation13
#index2543
#arnetid2545

#*Video Database Systems - Recent Trends in Research and Development Activities.
#@Eitetsu Oomoto,Katsumi Tanaka
#year1997
#confHandbook of Multimedia Information Management
#citation13
#index2544
#arnetid2546

#*Video Segmentation for Video Data Management.
#@Nilesh V. Patel,Ishwar K. Sethi
#year1997
#confHandbook of Multimedia Information Management
#citation16
#index2545
#arnetid2547

#*Multimedia Interfaces - Multimedia Content Indication.
#@Yoshinobu Tonomura
#year1997
#confHandbook of Multimedia Information Management
#citation1
#index2546
#arnetid2548

#*Memory Management: Codecs.
#@Bhaskaran Vasudev,Wei Li
#year1997
#confHandbook of Multimedia Information Management
#citation0
#index2547
#arnetid2549

#*Concurrency Control Performance Modeling: Alternatives and Implications.
#@Rakesh Agrawal,Michael J. Carey,Miron Livny
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation415
#index2548
#arnetid2550
#%642734
#%643149
#%1118611
#%951376
#%1118616
#%1118695
#%598255
#%545060
#%598927
#%642025
#%643492
#%771510
#%1386658
#%543649
#%1117443
#%599849
#%1127282
#%1118151
#%1064571
#%1196211
#%1118311
#%1118332
#%1118609
#%1196280
#%58
#%1118693
#!A number of recent studies have examined the performance of concurrency control algorithms for database management systems. The results reported to date, rather than being definitive, have tended to be contradictory. In this paper, rather than presenting “yet another algorithm performance study,” we critically investigate the assumptions made in the models used in past studies and their implications. We employ a fairly complete model of a database environment for studying the relative performance of three different approaches to the concurrency control problem under a variety of modeling assumptions. The three approaches studied represent different extremes in how transaction conflicts are dealt with, and the assumptions addressed pertain to the nature of the database system's resources, how transaction restarts are modeled, and the amount of information available to the concurrency control algorithm about transactions' reference strings. We show that differences in the underlying assumptions explain the seemingly contradictory performance results. We also address the question of how realistic the various assumptions are for actual database systems.

#*On Mixing Queries and Transactions via Multiversion Locking.
#@Paul M. Bober,Michael J. Carey
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation-1
#index2549
#arnetid2551

#*Conflict Detection Tradeoffs for Replicated Data.
#@Michael J. Carey,Miron Livny
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation172
#index2550
#arnetid2552
#%643149
#%1118616
#%1118695
#%1118698
#%599763
#%1118305
#%17459
#%642007
#%643407
#%642471
#%642107
#%613303
#%773608
#%543649
#%2548
#%1118260
#%598267
#%2019
#%1117523
#%1118551
#%1037294

#*Serializability-Based Correctness Criteria.
#@Panos K. Chrysanthis
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation3
#index2551
#arnetid2553

#*Database Concurrency Control Using Data Flow Graphs.
#@Margaret H. Eich,David L. Wells
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation14
#index2552
#arnetid2554
#%597920
#%1118144
#%598496
#%598155
#%492
#%771510
#%1196211
#!A specialized data flow graph, Database Flow Graph (DBFG) is introduced. DBFGs may be used for scheduling database operations, particularly in an MIMD database machine environment. A DBFG explicitly maintains intertransaction and intratransaction dependencies, and is constructed from the Transaction Flow Graphs (TFG) of active transactions. A TFG, in turn, is the generalization of a query tree used, for example, in DIRECT [15]. All DBFG schedules are serializable and deadlock free. Operations needed to create and maintain the DBFG structure as transactions are added or removed from the system are discussed. Simulation results show that DBFG scheduling performs as well as two-phase locking.

#*Firm Real-Time Concurrency Control.
#@Jayant R. Haritsa,Michael J. Carey,Miron Livny
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation1
#index2553
#arnetid2555

#*Reduction in Transaction Conflicts Using Semantics-Based Concurrency Control.
#@Sushil Jajodia,Ravi Mukkamala
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation-1
#index2554
#arnetid2556
#!In this chapter, we consider algorithms that permit every site in a partitioned database system to perform new updates. Since this may result in independent updates to items in different partitions, conflicts among transactions are bound to occur. Commutative transactions can be used to reduce the number of these conflicts. We develop a probabilistic model to estimate the possible reduction in conflicts if we incorporate this notion of commutativity. The results show that the additional efforts to recognize this commutativity is not beneficial unless the number of transactions that commute with each other is significantly large.

#*Concurrency Control Mechanisms and Their Taxonomy.
#@Vijay Kumar
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation1
#index2555
#arnetid2557

#*Transactions and Database Processing.
#@Vijay Kumar,Meichun Hsu
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation0
#index2556
#arnetid2558

#*Extensibility and Asynchrony in the Brown-Object Storage System.
#@David E. Langworthy,Stanley B. Zdonik
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation6
#index2557
#arnetid2559

#*Performance of Concurrency Control Algorithms for Real-Time Database Systems.
#@Juhnyoung Lee,Sang Hyuk Son
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation-1
#index2558
#arnetid2560

#*The Design and Performance Evaluation of a Lock Manager for a Memory-Resident Database System.
#@Tobin J. Lehman,Vibby Gottemukkala
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation4
#index2559
#arnetid2561

#*Concurrency Control and Recovery Methods for B+-Tree Indexes: ARIES/KVL and ARIES/IM.
#@C. Mohan
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation24
#index2560
#arnetid2562

#*Commit_LSN: A Novel and Simple Method for Reducing Locking and Latching in Transaction Processing Systems.
#@C. Mohan
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation77
#index2561
#arnetid2563

#*A Two-Phase Approach to Predictably Scheduling Real-Time Transactions.
#@Patrick E. O'Neil,Krithi Ramamritham,Calton Pu
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation18
#index2562
#arnetid2564

#*An Analytic Model of Transaction Interference.
#@Andreas Reuter
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation0
#index2563
#arnetid2565

#*Synchronizing Long-Lived Computations.
#@Friedemann Schwenkreis,Andreas Reuter
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation4
#index2564
#arnetid2566

#*Two-Phase Locking Performance and Its Thrashing Behavior.
#@Alexander Thomasian
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation45
#index2565
#arnetid2567
#%300659
#%1118616
#%101850
#%2548
#%299274
#%125
#%1118332
#%1118334
#%299908
#%299907
#%1036694
#%1118386
#%643313
#%1118550
#%599361
#%951265
#%951488
#%1129387
#%1037106
#%599704
#%1118693
#%951703
#%301238
#%301239
#%301237
#%1065747
#%1129659
#%597651
#%1129662
#%1129661
#%1386658
#%951727

#*Implementation Considerations and Performance Evaluation of Object-Based Concurrency Control Protocols.
#@Shehan Xavier,Krithi Ramamritham
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation2
#index2566
#arnetid2568

#*Modeling and Analysis of Concurrency Control Schemes.
#@Philip S. Yu
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation2
#index2567
#arnetid2569

#*Modeling Performance Impact of Hot Spots.
#@Bin Zhang,Meichun Hsu
#year1996
#confPerformance of Concurrency Control Mechanisms in Centralized Database Systems
#citation5
#index2568
#arnetid2570

#*Database Design Based on Entity and Realtionship.
#@Peter P. Chen
#year1985
#confPrinciples of Database Design (I)
#citation-1
#index2569
#arnetid2571

#*Data Models and the ANSI/SPARC Architecture.
#@Eric K. Clemons
#year1985
#confPrinciples of Database Design (I)
#citation6
#index2570
#arnetid2572

#*Network Database Design Methods.
#@Alan R. Hevner,S. Bing Yao
#year1985
#confPrinciples of Database Design (I)
#citation2
#index2571
#arnetid2573

#*Compter-Assisted Hierarchical Database Design.
#@George U. Hubbard
#year1985
#confPrinciples of Database Design (I)
#citation3
#index2572
#arnetid2574

#*Requirement Specification Techniques.
#@Beverly K. Kahn
#year1985
#confPrinciples of Database Design (I)
#citation4
#index2573
#arnetid2575

#*Semantic Data Models.
#@Roger King,Dennis McLeod
#year1985
#confPrinciples of Database Design (I)
#citation20
#index2574
#arnetid2576

#*Relational Database Design.
#@Y. Edmund Lien
#year1985
#confPrinciples of Database Design (I)
#citation8
#index2575
#arnetid2577

#*Schema Implemetation and Restructuring.
#@Shamkant B. Navathe
#year1985
#confPrinciples of Database Design (I)
#citation4
#index2576
#arnetid2578

#*Processing-Requirement Modeling and Its Applications in Logical Database Design.
#@Stanley Y. W. Su
#year1985
#confPrinciples of Database Design (I)
#citation6
#index2577
#arnetid2579

#*An Interactive System for Database Design and Integration.
#@S. Bing Yao,Vance E. Waddle,Barron C. Housel
#year1985
#confPrinciples of Database Design (I)
#citation1
#index2578
#arnetid2580

#*The Design of the UNIX Operating System.
#@Maurice J. Bach
#year1986
#conf
#citation1110
#index2579
#arnetid2581

#*Syntax of Programming Languages: Theory and Practice
#@Roland Carl Backhouse
#year1979
#conf
#citation86
#index2580
#arnetid2582

#*Graph Drawing: Algorithms for the Visualization of Graphs
#@Giuseppe Di Battista,Peter Eades,Roberto Tamassia,Ioannis G. Tollis
#year1999
#conf
#citation1236
#index2581
#arnetid2583

#*Linear Programming: Active Set Analysis and Computer Programs.
#@Michael J. Best,Klaus Ritter
#year1985
#conf
#citation106
#index2582
#arnetid2584

#*Object-Oriented Multidatabase Systems: A Solution for Advanced Applications
#@Omran A. Bukhres,Ahmed K. Elmagarmid
#year1996
#conf
#citation-1
#index2583
#arnetid2585

#*Research Foundations in Object-Oriented and Semantic Database System
#@Alfonso F. Cardenas,Dennis McLeod
#year1990
#conf
#citation25
#index2584
#arnetid2586

#*Operating Systems Theory
#@Edward G. Coffman Jr.,Peter J. Denning
#year1973
#conf
#citation847
#index2585
#arnetid2587

#*Internetworking with TCP/IP - Principles, Protocols, and Architectures, Fourth Edition
#@Douglas Comer
#year2000
#conf
#citation2
#index2586
#arnetid2588

#*How to Program Advanced Java
#@Harvey M. Deitel,Paul J. Deitel,Sean E. Santry
#year2001
#conf
#citation-1
#index2587
#arnetid2589

#*A Discipline of Programming.
#@Edsger W. Dijkstra
#year1976
#conf
#citation2
#index2588
#arnetid2590

#*Data Mining: Introductory and Advanced Topics
#@Margaret H. Dunham
#year2002
#conf
#citation769
#index2589
#arnetid2591

#*Information Retrieval: Data Structures & Algorithms
#@William B. Frakes,Ricardo A. Baeza-Yates
#year1992
#conf
#citation1935
#index2590
#arnetid2592

#*Database System Implementation
#@Hector Garcia-Molina,Jeffrey D. Ullman,Jennifer Widom
#year2000
#conf
#citation448
#index2591
#arnetid2593

#*Graphic Java 2, Mastering the JFC: Volume II: Swing, 3rd Edition
#@David M. Geary
#year1999
#conf
#citation-1
#index2592
#arnetid2594

#*Handbook of Multimedia Information Management.
#@William I. Grosky,Ramesh Jain,Rajiv Mehrotra
#year1997
#conf
#citation50
#index2593
#arnetid2595

#*Brinch Hansen on Pascal Compilers
#@Per Brinch Hansen
#year1985
#conf
#citation31
#index2594
#arnetid2596

#*Communicating Sequential Processes
#@C. A. R. Hoare
#year1985
#conf
#citation13266
#index2595
#arnetid2597
#!This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. When combined with a development of Dijkstra's guarded command, these concepts are surprisingly versatile. Their use is illustrated by sample solutions of a variety of familiar programming exercises.

#*Algorithms for Clustering Data
#@Anil K. Jain,Richard C. Dubes
#year1988
#conf
#citation6064
#index2596
#arnetid2598

#*The Implementation of Functional Programming Languages.
#@Simon L. Peyton Jones
#year1987
#conf
#citation6
#index2597
#arnetid2599

#*Object-Oriented Database Management: Applications in Engineering and Computer Science
#@Alfons Kemper,Guido Moerkotte
#year1994
#conf
#citation149
#index2598
#arnetid2600

#*The C Programming Language
#@Brian W. Kernighan,Dennis Ritchie
#year1978
#conf
#citation4991
#index2599
#arnetid2601

#*The C Programming Language, Second Edition
#@Brian W. Kernighan,Dennis Ritchie
#year1988
#conf
#citation-1
#index2600
#arnetid2602

#*Elements of the Theory of Computation
#@Harry R. Lewis,Christos H. Papadimitriou
#year1981
#conf
#citation1305
#index2601
#arnetid2603

#*Object Databases in Practice.
#@Mary E. S. Loomis,Akmal B. Chaudhri
#year1997
#conf
#citation19
#index2602
#arnetid2604

#*The .NET Training Course
#@Bertrand Meyer
#year2001
#conf
#citation3
#index2603
#arnetid2605

#*Object-Oriented Software Construction, 1st editon
#@Bertrand Meyer
#year1988
#conf
#citation6910
#index2604
#arnetid2606
#!:Object-Oriented Software Construction, second edition is the comprehensive reference on all aspects of object technology, from design principles to Object-Oriented techniques, Design by Contract, Object-Oriented analysis, concurrency, persistence, abstract data types and many more. Written by a pioneer in the field, contains an in-depth analysis of both methodological and technical issues.Two-color printing provides for clear figures and readable software extracts. Comes with a CD-ROM containing: the complete hyperlinked text, for easy reference; software to read the text on major industry platforms; supplementary material (reusable components, mathematical complements); and a complete graphical Object-Oriented development environment supporting the concepts of the book.

#*Introduction to the Theory of Programming Languages
#@Bertrand Meyer
#year1990
#conf
#citation176
#index2605
#arnetid2607

#*Eiffel: The Language
#@Bertrand Meyer
#year1991
#conf
#citation3
#index2606
#arnetid2608

#*An Object-Oriented Environment: Principles and Applications
#@Bertrand Meyer
#year1994
#conf
#citation33
#index2607
#arnetid2609

#*Reusable Software: The Base Object-Oriented Component Libraries
#@Bertrand Meyer
#year1994
#conf
#citation179
#index2608
#arnetid2610

#*Object Success
#@Bertrand Meyer
#year1995
#conf
#citation32
#index2609
#arnetid2611

#*Object-Oriented Software Construction, 2nd Edition
#@Bertrand Meyer
#year1997
#conf
#citation6910
#index2610
#arnetid2612

#*Object-Oriented Applications
#@Bertrand Meyer,Jean-Marc Nerson
#year1993
#conf
#citation-1
#index2611
#arnetid2613

#*Principles of Distributed Database Systems.
#@M. Tamer Özsu,Patrick Valduriez
#year1991
#conf
#citation2
#index2612
#arnetid2614

#*Principles of Distributed Database Systems, Second Edition
#@M. Tamer Özsu,Patrick Valduriez
#year1999
#conf
#citation-1
#index2613
#arnetid2615

#*Combinatorial Optimization: Algorithms and Complexity
#@Christos H. Papadimitriou,Kenneth Steiglitz
#year1982
#conf
#citation4919
#index2614
#arnetid2616

#*The Art of Compiler Design: Theory and Practice
#@Thomas Pittman,James Peters
#year1992
#conf
#citation63
#index2615
#arnetid2617

#*UNIX Database Management Systems
#@Ulka Rodgers
#year1990
#conf
#citation6
#index2616
#arnetid2618

#*Object-Oriented Modeling and Design
#@James E. Rumbaugh,Michael R. Blaha,William J. Premerlani,Frederick Eddy,William E. Lorensen
#year1991
#conf
#citation7966
#index2617
#arnetid2619

#*File Structures: An Analytic Approach.
#@Betty Salzberg
#year1988
#conf
#citation100
#index2618
#arnetid2620

#*Database Tuning - A Principled Approach
#@Dennis Shasha
#year1992
#conf
#citation-1
#index2619
#arnetid2621

#*Computer Networks
#@Andrew S. Tanenbaum
#year1981
#conf
#citation3
#index2620
#arnetid2622
#!From the Book:This book is now in its third edition. Each edition has corresponded to a different phase in the way computer networks were used. When the first edition appeared in 1980, networks were an academic curiosity. When the second edition appeared in 1988, networks were used by universities and large businesses. When the third edition appeared in 1996, computer networks, especially the worldwide Internet, had become a daily reality for millions of people. Furthermore, the networking hardware and software have completely changed since the second edition appeared In 1988, nearly all networks were based on copper wire. Now, many are based on fiber optics or wireless communication. Proprietary networks, such as SNA have become far less important than public networks, especially the Internet. The OSI protocols have quietly vanished,, and the TCP/IP protocol suite has become dominant. In fact, so much has changed, the book has almost been rewritten from scratch. Although Chap. 1 has the same introductory function as it did in the second edition, the contents have been completely revised and brought up to date. For example, instead of basing the hook on the seven-layer OSI model. a five-layer hybrid model (shown in Fig. 1-21) is now used and introduced in Chap. 1. While not exactly identical to the TCP/IP model, it is much closer to the TCP/IP model in spirit than it is to the OSI model used in the second edition. Also, the new running examples used throughout the book - the Internet and Al M networks are introduced here, along with some gigabit networks and other popular networks. In Chap. 2, the focus has moved from copper wire to fiber optics and wireless communication,since these arc the technologies of the future. The telephone system has become almost entirely digital in the past decade, so the material on it has been largely rewritten, with new material on broadband ISDN added. The material on cellular radio has been greatly expanded, and new material on low-orbit satellites has been added to the chapter. The order of discussion of the data link layer and the MAC sublayer has been reversed, since experience with students shows that they understand the MAC sublayer better after they have studied the data link layer. The example protocols there have been kept, as they have proven very popular, but they have been rewritten in C. New material on the Internet and ATM data link layers has been added. The MAC sublayer principles of Chap. 4. have been revised to reflect new protocols, including wavelength division multiplexing, wireless LANs, and digital radio. The discussion of bridges has been revised, and new material has been added on high-speed LANs. Most of the routing algorithms of Chap. 5 have been replaced by more modern ones, including distance vector and link state routing. The sections on congestion control have been completely redone, and material on the running examples, the Internet and ATM is all new. Chap. 6 is still about the transport layer, but here, too, major changes have occurred, primarily, the addition of a large amount of new material about the Internet, ATM, and network performance. Chap. 7, on the application layer, is now the longest chapter in the book. The material on network security has been doubled in length, and new material has been added on DNS, SNMP, email, USENET, the World Wide Web, HTML, Java, multimedia, video on demand, and the MBone. Of the 395 figures in the third edition, 276 (70 percent) are completely new and some of the others have been revised. Of the 371 references to the literature, 282 (76 percent) are to books and papers that have appeared since the second edition was published. Of these, over 100 are to works published in 1995 and 1996 alone. All in all, probably 75 percent of the entire book is brand new, and parts of the remaining 25 percent have been heavily revised. Since this is effectively a new book, the cover was redesigned to avoid confusion with the second edition. Computer books are full of acronyms. This one is no exception. By the time you are finished reading this one, all of the following should ring a bell: AAL, AMPS, ARP, ASN, ATM, BGP, CDMA, CDPD, CSMA, DQDB, DNS, FAQ, FDM, FTP, FTTC, FTTH, GSM, HDLC, HEC, HlPPl, TAB, lCMP, IDEA, IETF, 1Pv6, ISO, ITU, LATA, MAC, MACA, MAN, MIB, MIME, NAP, NNTP, NSA, NSAP, OSI, OSPF, PCM, PCN, PCS, PEM, PGP, PPP, PSTN, PTT, PVC, QAM, RARP, RFC, RSA, SABME, SAP, SAR, SDH, SDLC, SHA, SMI, SNA, SNMP, SNRME, SPX, TCP, UDP, VHF, VLF, VSAT, WARC, WDM, WWV, and WWW. But don't worry. Each one will be carefully defined before it is used. To help instructors using this book as a text for course, the author has prepared three teaching aids: A problem solutions manual. PostScript files containing all the figures (for making overhead sheets). A simulator (written in C) for the example protocols of Chap. 3. The solutions manual is available from Prentice Hall (but only to instructors). The file with the figures and the simulator are available via the World Wide Web. To get them, please see the author's home page: http://www.cs.vu.nl/~ast/. The book was typeset in Times Roman using Troff, which, after all these years, is still the only way to go. While Troff is not as trendy as WYSIWYG systems, the reader is invited to compare the typesetting quality of this book with books produced by WYSIWYG systems. My only concession to PCs and desktop publishing is that for the first time, the art was produced using Adobe Illustrator, instead of being drawn on paper. Also for the first time, the book was produced entirely electronically. The PostScript output from Troff was sent over the Internet to the printer, where the film for making the offset plates was produced. No intermediate paper copy was printed and photographed, as is normally done. Andrew S. Tanenbaum

#*Modern Operating Systems
#@Andrew S. Tanenbaum
#year1992
#conf
#citation2135
#index2621
#arnetid2623

#*Design of Database Structures
#@Toby J. Teorey,James P. Fry
#year1982
#conf
#citation229
#index2622
#arnetid2624

#*Geographic Information Systems and Cartographic Modelling.
#@C. Dana Tomlin
#year1990
#conf
#citation3
#index2623
#arnetid2625

#*Core Swing: Advanced Programming
#@Kim Topley
#year2000
#conf
#citation17
#index2624
#arnetid2626

#*A First Course in Database Systems.
#@Jeffrey D. Ullman,Jennifer Widom
#year1997
#conf
#citation426
#index2625
#arnetid2627

#*PCTE - The Standard for Open Repositories.
#@Lois Wakeman,Jonathan Jowett
#year1993
#conf
#citation137
#index2626
#arnetid2628

#*Seamless Object-Oriented Software Architecture - Analysis and Design of Reliable Systems
#@Kim Walden,Jean-Marc Nerson
#year1994
#conf
#citation2
#index2627
#arnetid2629

#*A Model Implementation of Standard Pascal
#@Jim Welsh,Atholl Hay
#year1986
#conf
#citation23
#index2628
#arnetid2630

#*Principles of Database Design, Volume I: Logical Organizations
#@S. Bing Yao
#year1985
#conf
#citation-1
#index2629
#arnetid2631

#*Konstruktion von Anfrageoptimierern für Objektbanken.
#@Guido Moerkotte
#year1995
#conf
#citation-1
#index2630
#arnetid2632

#*On the Complexity of Broadcast and Gossip in Different Communication Modes.
#@Ralf Klasing
#year1996
#conf
#citation7
#index2631
#arnetid2633

#*Branching Programs and Binary Decision Diagrams
#@Ingo Wegener
#year2000
#conf
#citation4
#index2632
#arnetid2634

#*Topological Concepts for Hierarchies of variables, Types and Controls.
#@Rudolf F. Albrecht
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation6
#index2633
#arnetid2635

#*Modifications of the Oettli-Prager Theorem with Application to the Eigenvalue Problem.
#@Götz Alefeld,Vladik Kreinovich,Günter Mayer
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation0
#index2634
#arnetid2636

#*Introduction: Symbolic Algebraic Methods and Verification Methods.
#@Götz Alefeld,Jiri Rohn,Siegfried M. Rump,Tetsuro Yamamoto
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation-1
#index2635
#arnetid2637

#*Symbolic-Numeric Algorithms for Polynomials: Some recent Results.
#@Robert M. Corless
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation0
#index2636
#arnetid2638

#*On the Isoefficiency of the Parallel Descartes Method.
#@Thomas Decker,Werner Krandick
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation-1
#index2637
#arnetid2639

#*Matrix Methods for Solving Algebraic Systems.
#@Ioannis Z. Emiris
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation1
#index2638
#arnetid2640

#*A Feasibility Result for Interval Gaussian Elimination Relying on Graph Structure.
#@Andreas Frommer
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation7
#index2639
#arnetid2641

#*Solution of Systems of Polynomial Equation by Using Bernstein Expansion.
#@Jürgen Garloff,Andrew P. Smith
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation16
#index2640
#arnetid2642

#*Symbolic-Algebraic Computations in Modeling Language for Mathematical Programming.
#@David M. Gay
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation-1
#index2641
#arnetid2643

#*Translation of Taylor Series into LFT Expansions.
#@Reinhold Heckmann
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation6
#index2642
#arnetid2644

#*Quasi Convex-Concave Extension.
#@Christian Jansson
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation0
#index2643
#arnetid2645

#*Rewriting, Induction and Decision Procedures: A Case Study of Presburger Arithmetic.
#@Deepak Kapur
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation4
#index2644
#arnetid2646

#*Derivative-Based Subdivision in Multi-dimensional Verified Gaussian Quadrature.
#@Bruno Lang
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation3
#index2645
#arnetid2647

#*On the Shape of the Fixed Points of [f]([c])=[A][x]+[b].
#@Günter Mayer,I. Warnke
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation-1
#index2646
#arnetid2648

#*Exact Computation with leda_real - Theory and geometric Applications.
#@Kurt Mehlhorn,Stefan Schirra
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation15
#index2647
#arnetid2649

#*Numerical Verification Method for Solutions of Nonlinear Hyperbolic Equations.
#@Teruya Minamoto
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation0
#index2648
#arnetid2650

#*Geometric Series Bounds for the Local errors of Taylor Methods for Linear n-th-Order ODEs.
#@Markus Neher
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation16
#index2649
#arnetid2651

#*Safe Numerical Error Bounds for Solutions of Nonlinear Elliptic Boundary Value Problems.
#@Michael Plum
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation0
#index2650
#arnetid2652

#*Fast Verification Algorithms in MATLAB.
#@Siegfried M. Rump
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation0
#index2651
#arnetid2653

#*The Linear Complementarity Problem with Interval Data.
#@Uwe Schäfer
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation0
#index2652
#arnetid2654

#*Some Numerical Methods for Nonlinear Least Squares Problems.
#@Stepan Shakhno
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation1
#index2653
#arnetid2655

#*A New Insight of the Shortley-Weller Approximation for Dirichlet Problems.
#@Tetsuro Yamamoto
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation6
#index2654
#arnetid2656

#*How Orthogonality is Lost in Krylov Methods.
#@Jens-Peter M. Zemke
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation1
#index2655
#arnetid2657

#*Symbolic-Numeric QD-Algorithms with Application in Function Theory and Linear Algebra.
#@Annie A. M. Cuyt
#year2001
#confSymbolic Algebraic Methods and Verification Methods
#citation0
#index2656
#arnetid2658

#*Content-Based Querying.
#@Anastasia Analyti,Stavros Christodoulakis
#year1997
#confMultimedia Databases in Perspective
#citation5
#index2657
#arnetid2659

#*Searching Distributed Hypermedia.
#@Peter M. G. Apers
#year1997
#confMultimedia Databases in Perspective
#citation0
#index2658
#arnetid2660

#*Query Processing.
#@Elisa Bertino,Barbara Catania,Elena Ferrari
#year1997
#confMultimedia Databases in Perspective
#citation3
#index2659
#arnetid2661

#*Introduction [Requirements for a Multimedia Database].
#@Henk M. Blanken
#year1997
#confMultimedia Databases in Perspective
#citation0
#index2660
#arnetid2662

#*User Interaction in a Virtual World Environment.
#@Christian Breiteneder
#year1997
#confMultimedia Databases in Perspective
#citation0
#index2661
#arnetid2663

#*Operating System Support [for Multimedia Databases].
#@Tatjana Burkow,Sape J. Mullender
#year1997
#confMultimedia Databases in Perspective
#citation0
#index2662
#arnetid2664

#*Communication Support [for Multimedia Databases].
#@Wolfgang Effelsberg
#year1997
#confMultimedia Databases in Perspective
#citation0
#index2663
#arnetid2665

#*Indexing of Multimedia Data.
#@Christos Faloutsos
#year1997
#confMultimedia Databases in Perspective
#citation21
#index2664
#arnetid2666

#*Critical Success Factors [for Multimedia Databases].
#@Maurice A. W. Houtsma,Wouter B. Teeuw,Manfred van Gurchom
#year1997
#confMultimedia Databases in Perspective
#citation0
#index2665
#arnetid2667

#*Multimedia and its Impact on Database System Architectures.
#@Wolfgang Klas,Karl Aberer
#year1997
#confMultimedia Databases in Perspective
#citation15
#index2666
#arnetid2668

#*Current and Emerging Applications [Requirements for a Multimedia Database].
#@Wolfgang Klas,Arjen P. de Vries,Christian Breiteneder
#year1997
#confMultimedia Databases in Perspective
#citation-1
#index2667
#arnetid2669

#*The SQL3 Server Interface.
#@Peter Pistor,Henk M. Blanken
#year1997
#confMultimedia Databases in Perspective
#citation8
#index2668
#arnetid2670

#*The SGML/HyTime Server Interface.
#@Peter A. C. Verkoulen,Henk M. Blanken
#year1997
#confMultimedia Databases in Perspective
#citation0
#index2669
#arnetid2671

#*An Expert Interface for Effective Man-Machine Interaction.
#@Giorgio Brajnik,Giovanni Guida,Carlo Tasso
#year1986
#confCooperative Interfaces to Information Systems
#citation14
#index2670
#arnetid2672

#*An Interactive Customization Program for a Natural Language Database Query System.
#@Fred Damerau
#year1986
#confCooperative Interfaces to Information Systems
#citation0
#index2671
#arnetid2673

#*Talking it Over: The Natural Language Dialog System HAM-ANS.
#@Wolfgang Hoeppner,Katharina Morik,Heinz Marburger
#year1986
#confCooperative Interfaces to Information Systems
#citation27
#index2672
#arnetid2674

#*The Semantic-Based Natural Language Interface to Relational Databases.
#@Jürgen M. Janas
#year1986
#confCooperative Interfaces to Information Systems
#citation-1
#index2673
#arnetid2675

#*Studies in the Evaluation of a Domain-Independent Natural Language Query System.
#@Matthias Jarke,Jürgen Krause,Yannis Vassiliou
#year1986
#confCooperative Interfaces to Information Systems
#citation2
#index2674
#arnetid2676

#*DIAGRAM: A Grammar for Dialogues.
#@Jane J. Robinson
#year1986
#confCooperative Interfaces to Information Systems
#citation126
#index2675
#arnetid2677
#!An explanatory overview is given of DIAGRAM, a large and complex grammar used in an artificial intelligence system for interpreting English dialogue. DIAGRAM is an augmented phrase-structure grammar with rule procedures that allow phrases to inherit attributes from their constituents and to acquire attributes from the larger phrases in which they themselves are constituents. These attributes are used to set context-sensitive constraints on the acceptance of an analysis. Constraints can be imposed by conditions on dominance as well as by conditions on constituency. Rule procedures can also assign scores to an analysis to rate it as probable or unlikely. Less likely analyses can be ignored by the procedures that interpret the utterance. For every expression it analyzes, DIAGRAM provides an annotated description of the structure. The annotations supply important information for other parts of the system that interpret the expression in the context of a dialogue. Major design decisions are explained and illustrated. Some contrasts with transformational grammars are pointed out and problems that motivate a plan to use metarules in the future are discussed. (Metarules derive new rules from a set of base rules to achieve the kind of generality previously captured by transformational grammars but without having to perform transformations on syntactic analyses.)

#*Considerations for the Development of Natural-Language Interfaces to Database Management Systems.
#@Marjorie Templeton,John D. Burger
#year1986
#confCooperative Interfaces to Information Systems
#citation14
#index2676
#arnetid2678

#*An Engine for Intelligent Graphics.
#@Frank Zdybel
#year1986
#confCooperative Interfaces to Information Systems
#citation0
#index2677
#arnetid2679

#*Algorithmic Number Theory and Its Relationship to Computational Complexity.
#@Leonard M. Adleman
#year1995
#confComputer Science Today
#citation0
#index2678
#arnetid2680

#*Algorithmic Techniques for Geometric Optimization.
#@Pankaj K. Agarwal,Micha Sharir
#year1995
#confComputer Science Today
#citation10
#index2679
#arnetid2681

#*Programming Satan's Computer.
#@Ross J. Anderson,Roger M. Needham
#year1995
#confComputer Science Today
#citation173
#index2680
#arnetid2682

#*Differential BDDs.
#@Anuchit Anuchitanukul,Zohar Manna,Tomás E. Uribe
#year1995
#confComputer Science Today
#citation9
#index2681
#arnetid2683

#*Templates for Linear Algebra Problems.
#@Zhaojun Bai,David Day,James Demmel,Jack Dongarra,Ming Gu,Axel Ruhe,Henk A. van der Vorst
#year1995
#confComputer Science Today
#citation8
#index2682
#arnetid2684

#*The ART behind IDEAS.
#@Thomas Beth,Andreas Klappenecker,Torsten Minkwitz,Armin Nückel
#year1995
#confComputer Science Today
#citation-1
#index2683
#arnetid2685

#*A Quantum Jump in Computer Science.
#@Gilles Brassard
#year1995
#confComputer Science Today
#citation29
#index2684
#arnetid2686

#*Mathematical System Models as a Basis of Software Engineering.
#@Manfred Broy
#year1995
#confComputer Science Today
#citation19
#index2685
#arnetid2687

#*Abstracting Unification: A Key Step in the Design of Logic Program Analyses.
#@Maurice Bruynooghe,Michael Codish,Anne Mulkers
#year1995
#confComputer Science Today
#citation4
#index2686
#arnetid2688

#*Multimedia Authoring Tools: State of the Art and Research Challenges.
#@Dick C. A. Bulterman,Lynda Hardman
#year1995
#confComputer Science Today
#citation18
#index2687
#arnetid2689

#*Symmetry and Induction in Model Checking.
#@Edmund M. Clarke,Somesh Jha
#year1995
#confComputer Science Today
#citation15
#index2688
#arnetid2690

#*Trends in Active Vision.
#@Jan-Olof Eklundh
#year1995
#confComputer Science Today
#citation4
#index2689
#arnetid2691

#*Avoiding the Undefined by Underspecification.
#@David Gries,Fred B. Schneider
#year1995
#confComputer Science Today
#citation56
#index2690
#arnetid2692
#!We use the appeal of simplicity and an aversion to complexity in selecting a method for handling partial functions in logic. We conclude that avoiding the undefined by using underspecification is the preferred choice.

#*Towards a Computational Theory of Genome Rearrangements.
#@Sridhar Hannenhalli,Pavel A. Pevzner
#year1995
#confComputer Science Today
#citation20
#index2691
#arnetid2693

#*Towards a theory of Recursive Structures.
#@David Harel
#year1995
#confComputer Science Today
#citation23
#index2692
#arnetid2694
#!In computer science, one is interested mainly in finite objects. Insofar as infinite objects are of interest, they must be computable, i.e., recursive, thus admitting an effective finite representation. This leads to the notion of a recursive graph, or, more generally, a recursive structure or data base. In this paper we summarize our recent work on recursive structures and data bases, including (1) the high undecidability of many problems on recursive graphs, (ii) somewhat surprising ways of deducting results on the classification of NP optimization problems from results on the degree of undecidability of their infinitary analogues, and (iii) completeness results for query languages on recursive data bases. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player

#*Algebraic Topology and Distributed Computing: A Primer.
#@Maurice Herlihy,Sergio Rajsbaum
#year1995
#confComputer Science Today
#citation26
#index2693
#arnetid2695

#*Computational Models for Distributed Multimedia Applications.
#@Thomas Käppner,Ralf Steinmetz
#year1995
#confComputer Science Today
#citation0
#index2694
#arnetid2696

#*Computational Machine Learning in Theory and Praxis.
#@Ming Li,Paul M. B. Vitányi
#year1995
#confComputer Science Today
#citation10
#index2695
#arnetid2697

#*Hypermedia Systems as Internet Tools.
#@Hermann A. Maurer
#year1995
#confComputer Science Today
#citation3
#index2696
#arnetid2698

#*Scalable Computing.
#@William F. McColl
#year1995
#confComputer Science Today
#citation139
#index2697
#arnetid2699

#*Efficient Use of Parallel & Distributed Systems: From Theory to Practice.
#@Burkhard Monien,Ralf Diekmann,Rainer Feldmann,Ralf Klasing,Reinhard Lüling,Knuth Menzel,Thomas Römke,Ulf-Peter Schroeder
#year1995
#confComputer Science Today
#citation13
#index2698
#arnetid2700

#*Edge-Coloring Algorithms.
#@Shin-Ichi Nakano,Xiao Zhou,Takao Nishizeki
#year1995
#confComputer Science Today
#citation11
#index2699
#arnetid2701

#*All the Needles in a Haystack: Can Exhaustive Search Overcome Combinatorial Chaos?
#@Jürg Nievergelt,Ralph Gasser,Fabian Mäser,Christoph Wirth
#year1995
#confComputer Science Today
#citation13
#index2700
#arnetid2702

#*Chu Spaces and Their Interpretation as Concurrent Objects.
#@Vaughan R. Pratt
#year1995
#confComputer Science Today
#citation-1
#index2701
#arnetid2703

#*Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective.
#@Nicholas J. Radcliffe,Patrick D. Surry
#year1995
#confComputer Science Today
#citation98
#index2702
#arnetid2704

#*Petri Net Models of Distributed Algorithms.
#@Wolfgang Reisig
#year1995
#confComputer Science Today
#citation32
#index2703
#arnetid2705

#*Information Retrieval and Information Reasoning.
#@C. J. van Rijsbergen
#year1995
#confComputer Science Today
#citation-1
#index2704
#arnetid2706

#*Reasoning about Actions and Change with Ramification.
#@Erik Sandewall
#year1995
#confComputer Science Today
#citation5
#index2705
#arnetid2707

#*Formulations and Formalisms in Software Architecture.
#@Mary Shaw,David Garlan
#year1995
#confComputer Science Today
#citation104
#index2706
#arnetid2708

#*Recurrent Neural Networks.
#@Hava T. Siegelmann
#year1995
#confComputer Science Today
#citation-1
#index2707
#arnetid2709

#*The Oz Programming Model.
#@Gert Smolka
#year1995
#confComputer Science Today
#citation586
#index2708
#arnetid2710

#*Experimental Validation of Models of Parallel Computation.
#@Lawrence Snyder
#year1995
#confComputer Science Today
#citation15
#index2709
#arnetid2711

#*Artificial Life and Real World Computing.
#@Luc Steels,Mario Tokoro
#year1995
#confComputer Science Today
#citation5
#index2710
#arnetid2712

#*Alternating Automata and Program Verification.
#@Moshe Y. Vardi
#year1995
#confComputer Science Today
#citation78
#index2711
#arnetid2713

#*Database Transaction Models.
#@Gottfried Vossen
#year1995
#confComputer Science Today
#citation1
#index2712
#arnetid2714

#*Quo Vadetis, Parallel Machine Models?
#@Jirí Wiedermann
#year1995
#confComputer Science Today
#citation8
#index2713
#arnetid2715

#*Standard Generalized Markup Language: Mathematical and Philosophical Issues.
#@Derick Wood
#year1995
#confComputer Science Today
#citation37
#index2714
#arnetid2716

#*Fuzzy Sets as a Tool for Modeling.
#@Ronald R. Yager
#year1995
#confComputer Science Today
#citation7
#index2715
#arnetid2717

#*Data Mining for Selection of Manufacturing Processes.
#@Bruno Agard,Andrew Kusiak
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation4
#index2716
#arnetid2718

#*Fractal Mining - Self Similarity-based Clustering and its Applications.
#@Daniel Barbará,Ping Chen
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation0
#index2717
#arnetid2719

#*Text Mining and Information Extraction.
#@Moty Ben-Dov,Ronen Feldman
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation2
#index2718
#arnetid2720

#*Outlier Detection.
#@Irad E. Ben-Gal
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation-1
#index2719
#arnetid2721

#*Statistical Methods for Data Mining.
#@Yoav Benjamini,Moshe Leshno
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation4
#index2720
#arnetid2722

#*Data Mining within a Regression Framework.
#@Richard A. Berk
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation8
#index2721
#arnetid2723

#*Constraint-Based Data Mining.
#@Jean-François Boulicaut,Baptiste Jeudy
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation27
#index2722
#arnetid2724

#*Data Mining Query Languages.
#@Jean-François Boulicaut,Cyrille Masson
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation20
#index2723
#arnetid2725

#*Geometric Methods for Feature Extraction and Dimensional Reduction - A Guided Tour.
#@Christopher J. C. Burges
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation78
#index2724
#arnetid2726

#*Data Mining for Imbalanced Datasets: An Overview.
#@Nitesh V. Chawla
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation16
#index2725
#arnetid2727

#*Dimension Reduction and Feature Selection.
#@Barak Chizi,Oded Maimon
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation1
#index2726
#arnetid2728

#*Reinforcement-Learning: An Overview from a Data Mining Perspective.
#@Shahar Cohen,Oded Maimon
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation0
#index2727
#arnetid2729

#*Parallel and Grid-Based Data Mining - Algorithms, Models and Systems for High-Performance KDD.
#@Antonio Congiusta,Domenico Talia,Paolo Trunfio
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation1
#index2728
#arnetid2730

#*Link Analysis.
#@Steve Donoho
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation-1
#index2729
#arnetid2731

#*Relational Data Mining.
#@Saso Dzeroski
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation440
#index2730
#arnetid2732

#*WEKA - A Machine Learning Workbench for Data Mining.
#@Eibe Frank,Mark A. Hall,Geoffrey Holmes,Richard Kirkby,Bernhard Pfahringer
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation61
#index2731
#arnetid2733

#*Evolutionary Algorithms for Data Mining.
#@Alex Alves Freitas
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation8
#index2732
#arnetid2734

#*Web Mining.
#@Johannes Fürnkranz
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation19
#index2733
#arnetid2735

#*Bias vs. Variance Decomposition for Regression and Classification.
#@Pierre Geurts
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation3
#index2734
#arnetid2736

#*Data Mining Model Comparison.
#@Paolo Giudici
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation0
#index2735
#arnetid2737

#*Frequent Set Mining.
#@Bart Goethals
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation21
#index2736
#arnetid2738

#*Meta-Learning.
#@Ricardo Vilalta,Christophe G. Giraud-Carrier,Pavel Brazdil
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation9
#index2737
#arnetid2739

#*Rule Induction.
#@Jerzy W. Grzymala-Busse
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation6
#index2738
#arnetid2740

#*Mining High-Dimensional Data.
#@Wei Wang,Jiong Yang
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation8
#index2739
#arnetid2741

#*LERS - A Data Mining System.
#@Jerzy W. Grzymala-Busse
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation10
#index2740
#arnetid2742

#*Mining Data Streams.
#@Haixun Wang,Philip S. Yu,Jiawei Han
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation0
#index2741
#arnetid2743

#*Handling Missing Attribute Values.
#@Jerzy W. Grzymala-Busse,Witold J. Grzymala-Busse
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation13
#index2742
#arnetid2744

#*Logics for Data Mining.
#@Petr Hájek
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation1
#index2743
#arnetid2745

#*Quality Assessment Approaches in Data Mining.
#@Maria Halkidi,Michalis Vazirgiannis
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation2
#index2744
#arnetid2746

#*Association Rules.
#@Frank Höppner
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation3
#index2745
#arnetid2747

#*Visualization and Data Mining for High Dimensional Datasets.
#@Alfred Inselberg
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation0
#index2746
#arnetid2748

#*On the Use of Fuzzy Logic in Data Mining.
#@Joseph Komem,Moti Schneider
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation2
#index2747
#arnetid2749

#*DataEngine - Tools for Intelligent Data Analysis and Control.
#@Joseph Komem,Moti Schneider
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation3
#index2748
#arnetid2750

#*Mining with Rare Cases.
#@Gary M. Weiss
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation6
#index2749
#arnetid2751

#*Data Mining for Financial Applications.
#@Boris Kovalerchuk,Evgenii Vityaev
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation2
#index2750
#arnetid2752

#*Data Mining for Software Testing.
#@Mark Last
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation1
#index2751
#arnetid2753

#*Data Mining in Medicine.
#@Nada Lavrac,Blaz Zupan
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation1
#index2752
#arnetid2754

#*Data Mining for Target Marketing.
#@Nissan Levin,Jacob Zahavi
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation7
#index2753
#arnetid2755

#*GainSmarts Data Mining System for Marketing.
#@Nissan Levin,Jacob Zahavi
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation0
#index2754
#arnetid2756

#*Wavelet Methods in Data Mining.
#@Tao Li,Sheng Ma,Mitsunori Ogihara
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation0
#index2755
#arnetid2757

#*Granular Computing and Rough Sets.
#@Tsau Young Lin,Churn-Jung Liau
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation13
#index2756
#arnetid2758

#*Introduction to Knowledge Discovery in Databases.
#@Oded Maimon,Lior Rokach
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation4
#index2757
#arnetid2759

#*Introduction to Supervised Methods.
#@Oded Maimon,Lior Rokach
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation3
#index2758
#arnetid2760

#*Decomposition Methodology for Knowledge Discovery and Data Mining.
#@Oded Maimon,Lior Rokach
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation23
#index2759
#arnetid2761

#*Data Cleansing - A Prelude to Knowledge Discovery.
#@Jonathan I. Maletic,Andrian Marcus
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation3
#index2760
#arnetid2762

#*Wizsoft's WizWhy.
#@Abraham Meidan
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation2
#index2761
#arnetid2763

#*Collaborative Data Mining.
#@Steve Moyle
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation0
#index2762
#arnetid2764

#*Organizational Data Mining.
#@Hamid R. Nemati,Christopher D. Barko
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation1
#index2763
#arnetid2765

#*A Review of Web Document Clustering Approaches.
#@Nora Oikonomakou,Michalis Vazirgiannis
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation2
#index2764
#arnetid2766

#*Mining Time Series Data.
#@Chotirat (Ann) Ratanamahatana,Jessica Lin,Dimitrios Gunopulos,Eamonn J. Keogh,Michail Vlachos,Gautam Das
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation3
#index2765
#arnetid2767

#*Data Mining of Design Products and Processes.
#@Yoram Reich
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation1
#index2766
#arnetid2768

#*Ensemble Methods for Classifiers.
#@Lior Rokach
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation4
#index2767
#arnetid2769

#*Decision Trees.
#@Lior Rokach,Oded Maimon
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation-1
#index2768
#arnetid2770

#*Clustering Methods.
#@Lior Rokach,Oded Maimon
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation-1
#index2769
#arnetid2771

#*Interestingness Measures - On Determining What Is Interesting.
#@Sigal Sahar
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation1
#index2770
#arnetid2772

#*Spatial Data Mining.
#@Shashi Shekhar,Pusheng Zhang,Yan Huang
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation9
#index2771
#arnetid2773

#*Support Vector Machines.
#@Armin Shmilovici
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation-1
#index2772
#arnetid2774

#*Learning Information Patterns in Biological Databases.
#@Gautam B. Singh
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation0
#index2773
#arnetid2775

#*Data Mining for Intrusion Detection.
#@Anoop Singhal,Sushil Jajodia
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation7
#index2774
#arnetid2776

#*Oracle Data Mining - Data Mining in the Database Environment.
#@Pablo Tamayo,Charles Berger,Marcos M. Campos,Joseph Yarmus,Boriana L. Milenova,Ari Mozes,Margaret Taft,Mark F. Hornick,Ramkumar Krishnan,Shiby Thomas,Mark Kelly,Denis Mukhin,Robert Haberstroh,Susie Stephens,Jacek Myczkowsji
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation-1
#index2775
#arnetid2777

#*Building Data Mining Solutions with OLE DB for DM and XML for Analysis.
#@ZhaoHui Tang,Jamie Maclennan,Pyungchul (Peter) Kim
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation15
#index2776
#arnetid2778
#!A data mining component is included in Microsoft SQL Server 2000 and SQL Server 2005, one of the most popular DBMSs. This gives a push for data mining technologies to move from a niche towards the mainstream. Apart from a few algorithms, the main contribution of SQL Server Data Mining is the implementation of OLE DB for Data Mining. OLE DB for Data mining is an industrial standard led by Microsoft and supported by a number of ISVs. It leverages two existing relational technologies: SQL and OLE DB. It defines a SQL language for data mining based on a relational concept. More recently, Microsoft, Hyperion, SAS and a few other BI vendors formed the XML for Analysis Council. XML for Analysis covers both OLAP and Data Mining. The goal is to allow consumer applications to query various BI packages from different platforms. This paper gives an overview of OLE DB for Data Mining and XML for Analysis. It also shows how to build data mining application using these APIs.

#*Data Mining for CRM.
#@Kurt H. Thearling
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation5
#index2777
#arnetid2779

#*Information Fusion - Methods and Aggregation Operators.
#@Vicenç Torra
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation2
#index2778
#arnetid2780

#*Data Mining in Telecommunications.
#@Gary M. Weiss
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation27
#index2779
#arnetid2781

#*Discretization Methods.
#@Ying Yang,Geoffrey I. Webb,Xindong Wu
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation9
#index2780
#arnetid2782

#*Causal Discovery.
#@Hong Yao,Cory J. Butz,Howard J. Hamilton
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation2
#index2781
#arnetid2783

#*Neural Networks.
#@Peter G. Zhang
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation-1
#index2782
#arnetid2784

#*Bayesian Networks.
#@Paola Sebastiani,María M. Abad-Grau,Marco Ramoni
#year2005
#confThe Data Mining and Knowledge Discovery Handbook
#citation8
#index2783
#arnetid2785

#*Object-Oriented Galileo.
#@Antonio Albano,Giorgio Ghelli,M. Eugenia Occhiuto,Renzo Orsini
#year1991
#confOn Object-Oriented Database System
#citation1
#index2784
#arnetid2786

#*Proteus: The DBMS User Interface as an Object.
#@T. Lougenia Anderson,Earl F. Ecklund Jr.,David Maier
#year1991
#confOn Object-Oriented Database System
#citation4
#index2785
#arnetid2787

#*Handling Constraints and their Exceptions: An Attached Constraint Handler for Object-Oriented CAD Databases.
#@Alejandro P. Buchmann,R. S. Carrera,M. A. Vazquez-Galindo
#year1991
#confOn Object-Oriented Database System
#citation14
#index2786
#arnetid2788

#*The Architecture of the EXODUS Extensible DBMS.
#@Michael J. Carey,David J. DeWitt,Daniel Frank,Goetz Graefe,Joel E. Richardson,Eugene J. Shekita,M. Muralikrishna
#year1991
#confOn Object-Oriented Database System
#citation277
#index2787
#arnetid2789
#%599044
#%598398
#%545930
#%642099
#%3164
#%642386
#%598633
#%17459
#%599004
#%2599
#%2795
#%578729
#%599600
#%599827
#%599849
#%492
#%833170
#%643997

#*Summary.
#@Umeshwar Dayal
#year1991
#confOn Object-Oriented Database System
#citation-1
#index2788
#arnetid2790

#*Managing Complex Objects in the Darmstadt Database Kernel System.
#@Uwe Deppisch,H.-Bernhard Paul,Hans-Jörg Schek,Gerhard Weikum
#year1991
#confOn Object-Oriented Database System
#citation4
#index2789
#arnetid2791

#*Object-Oriented Database Systems: The Notion and the Issues.
#@Klaus R. Dittrich
#year1991
#confOn Object-Oriented Database System
#citation150
#index2790
#arnetid2792

#*The Efficient Support of Functionally-Defined Data in Cactis.
#@Scott E. Hudson,Roger King
#year1991
#confOn Object-Oriented Database System
#citation1
#index2791
#arnetid2793

#*Inheritance Issues in Computer-Aided Design Databases.
#@Randy H. Katz,Ellis E. Chang
#year1991
#confOn Object-Oriented Database System
#citation6
#index2792
#arnetid2794

#*Godal: An Object-Centered Database Language.
#@Martin L. Kersten,Frans H. Schippers
#year1991
#confOn Object-Oriented Database System
#citation0
#index2793
#arnetid2795

#*An Object-Oriented Interface to a Relational Database.
#@T. Learmont,R. G. G. Cattell
#year1991
#confOn Object-Oriented Database System
#citation10
#index2794
#arnetid2796

#*A Data Modeling Methodology for the Design and Implementation of Information Systems.
#@Peter Lyngbæk,William Kent
#year1991
#confOn Object-Oriented Database System
#citation58
#index2795
#arnetid2797
#%641994
#%1359672
#%1385682
#%642036
#%598280
#%139
#%643209
#%1118668
#!Formal specifications that precisely and correctly define the semantics of software systems become increasingly important as the complexity of such systems increase. The emerging set of semantic data models which support both structural and operational abstractions are excellent tools for formal specifications. In this paper we introduce a methodology, based on an object-oriented data model, for the design and development of large software systems. The methodology is demonstrated by applying the object-oriented data model to the specification of a database system which implements the given model. The specification serves several purposes: it formally defines the precise semantics of the operations of the data model, it provides a basis from which the corresponding database system software can be systematically derived, and it tests and demonstrates the adequacy of such a model for defining software systems in general. The design methodology introduced combines techniques from data modeling, formal specifications, and software engineering.

#*An Overview of PDM: An Object-Oriented Data Model.
#@Frank Manola,Umeshwar Dayal
#year1991
#confOn Object-Oriented Database System
#citation0
#index2796
#arnetid2798

#*Generating Object-Oriented Database Systems with the Data Model Compiler.
#@Fred J. Maryanski,John Bedell,Sheilah Hoelscher,Shuguang Hong,LouAnne McDonald,Joan Peckham,Darrell Stock
#year1991
#confOn Object-Oriented Database System
#citation1
#index2797
#arnetid2799

#*An Object-Oriented Database for Trellis.
#@Patrick O'Brien,Bruce Bullis,Craig Schaffert
#year1991
#confOn Object-Oriented Database System
#citation0
#index2798
#arnetid2800

#*Design Issues for Object-Oriented Database Systems.
#@Sylvia L. Osborn
#year1991
#confOn Object-Oriented Database System
#citation0
#index2799
#arnetid2801

#*A Shared Object Hierarchy.
#@Lawrence A. Rowe
#year1991
#confOn Object-Oriented Database System
#citation38
#index2800
#arnetid2802
#%2804
#%1118170
#%139
#%599849
#!This paper describes the design and proposed implementation of a shared object hierarchy. The object hierarchy is stored in a relational database and objects referenced by an application program are cached in the program's address space. The paper describes the database representation for the object hierarchy and the use of POSTGRES, a next-generation relational database management system, to implement object referencing efficiently. The shared object hierarchy system will be used to implement Object FADS, an object-oriented programming environment for interactive database applications that will be the main programming interface to POSTGRES.

#*ObServer: An Object Server for an Object-Oriented Database System.
#@Andrea H. Skarra,Stanley B. Zdonik,Steven P. Reiss
#year1991
#confOn Object-Oriented Database System
#citation4
#index2801
#arnetid2803

#*Towards on Object-Oriented Data Model for a Mechanical CAD Database System.
#@David L. Spooner
#year1991
#confOn Object-Oriented Database System
#citation-1
#index2802
#arnetid2804

#*Associate Access Support in GemStone.
#@Jacob Stein,David Maier
#year1991
#confOn Object-Oriented Database System
#citation7
#index2803
#arnetid2805

#*Object Management in Postgres using Procedures.
#@Michael Stonebraker
#year1991
#confOn Object-Oriented Database System
#citation55
#index2804
#arnetid2806
#%599467
#%139
#%599004
#%599166
#%599660
#%1118668
#%599795
#%599849
#%1118705
#!This paper presents the object management facilities being designed into a next-generation data manager, POSTGRES. This system is unique in that it does not invent a new data model for support of objects but chooses instead to extend the relational model with a powerful abstract data typing capability and procedures as full-fledged data base objects. The reasons to remain with the relational model are indicated in this paper along with the POSTGRES relational extensions.

#*Persistent Memory: A Storage System for Object-Oriented Databases.
#@Satish M. Thatte
#year1991
#confOn Object-Oriented Database System
#citation0
#index2805
#arnetid2807

#*Views, Objects, and Databases.
#@Gio Wiederhold
#year1991
#confOn Object-Oriented Database System
#citation138
#index2806
#arnetid2808

#*Using Adaptive Information Extraction for Effective Human-Centred Document Annotation.
#@Fabio Ciravegna,Alexiei Dingli,Yorick Wilks,Daniela Petrelli
#year2003
#confText Mining
#citation8
#index2807
#arnetid2809

#*XML Information Retrieval and Information Extraction.
#@Norbert Fuhr
#year2003
#confText Mining
#citation12
#index2808
#arnetid2810

#*On Knowledgeable Unsupervised Text Mining.
#@Andreas Hotho,Alexander Maedche,Steffen Staab,Valentin Zacharias
#year2003
#confText Mining
#citation12
#index2809
#arnetid2811

#*Towards Collaborative Information Retrieval: Three Approaches.
#@Armin Hust,Stefan Klink,Markus Junker,Andreas Dengel
#year2003
#confText Mining
#citation15
#index2810
#arnetid2812

#*Evaluating Retrieval Performance Using Clickthrough Data.
#@Thorsten Joachims
#year2003
#confText Mining
#citation77
#index2811
#arnetid2813

#*Concept Drift and the Importance of Example.
#@Ralf Klinkenberg,Stefan Rüping
#year2003
#confText Mining
#citation35
#index2812
#arnetid2814

#*Text Mining.
#@Ingrid Renz,Jürgen Franke
#year2003
#confText Mining
#citation7
#index2813
#arnetid2815

#*The XDOC Document Suite - a Workbench for Document Mining.
#@Dietmar Rösner,Manuela Kunze
#year2003
#confText Mining
#citation1
#index2814
#arnetid2816

#*Feature-Rich Memory-Based Classification for Shallow NLP and Information Extraction.
#@Jakub Zavrel,Walter Daelemans
#year2003
#confText Mining
#citation10
#index2815
#arnetid2817

#*Visual Interfaces for Semantic Information Retrieval and Browsing.
#@Katy Börner
#year2002
#confVisualizing the Semantic Web
#citation2
#index2816
#arnetid2818

#*Information Visualization Versus the Semantic Web.
#@Chaomei Chen
#year2002
#confVisualizing the Semantic Web
#citation329
#index2817
#arnetid2819

#*Ontology-based Information Visualization.
#@Christiaan Fluit,Marta Sabou,Frank van Harmelen
#year2002
#confVisualizing the Semantic Web
#citation-1
#index2818
#arnetid2820

#*The XML Revolution and the Semantic Web.
#@Vladimir Geroimenko
#year2002
#confVisualizing the Semantic Web
#citation3
#index2819
#arnetid2821

#*Concluding Remarks: Today's Vision of Envisioning the Semantic Future.
#@Vladimir Geroimenko,Chaomei Chen
#year2002
#confVisualizing the Semantic Web
#citation0
#index2820
#arnetid2822

#*SVG and X3D: New XML Technologies for 2D and 3D Visualization.
#@Vladimir Geroimenko,Larissa Geroimenko
#year2002
#confVisualizing the Semantic Web
#citation0
#index2821
#arnetid2823

#*Interactive Interfaces for Mapping E-commerce Ontologies.
#@Vladimir Geroimenko,Larissa Geroimenko
#year2002
#confVisualizing the Semantic Web
#citation1
#index2822
#arnetid2824

#*Using Scalable Vector Graphics and Georgraphical Information Systems in a Back Pain Study.
#@Gheorghita Ghinca,David Gill
#year2002
#confVisualizing the Semantic Web
#citation-1
#index2823
#arnetid2825

#*Topic Maps Visualization.
#@Bénédicte Le Grand,Michel Soto
#year2002
#confVisualizing the Semantic Web
#citation40
#index2824
#arnetid2826

#*Web Rendering Systems: Techniques, Classification Criteria and Challenges.
#@Stephen Kimani,Tiziana Catarci,Isabel F. Cruz
#year2002
#confVisualizing the Semantic Web
#citation4
#index2825
#arnetid2827

#*Recommender Systems for the Web.
#@Joseph A. Konstan,John Riedl
#year2002
#confVisualizing the Semantic Web
#citation1
#index2826
#arnetid2828

#*Web Services: Description, Interfaces and Ontology.
#@Alexander Nakhimovsky,Tom Myers
#year2002
#confVisualizing the Semantic Web
#citation4
#index2827
#arnetid2829

#*Interactive Visualization of Paragraph-level Metadata to Support Corporate Document Use.
#@Mischa Weiss-Lijn,Janet T. McDonnell,Leslie James
#year2002
#confVisualizing the Semantic Web
#citation-1
#index2828
#arnetid2830

#*Informatikbetrachtungen.
#@Wilfried Brauer
#year2001
#confDas ist Informatik
#citation1
#index2829
#arnetid2831

#*Was ist Informatik?
#@Wolfgang Coy
#year2001
#confDas ist Informatik
#citation5
#index2830
#arnetid2832

#*Informatik und Wirtschaftsinformatik.
#@Ulrich Frank
#year2001
#confDas ist Informatik
#citation0
#index2831
#arnetid2833

#*Informatik - Allgemeinbildung für die Informationsgesellschaft.
#@Peter Hubwieser
#year2001
#confDas ist Informatik
#citation0
#index2832
#arnetid2834

#*Computerunterstütztes problemorientiertes Lernen.
#@Frank Puppe,Bettina Reinhardt,Klaudia Schultheis
#year2001
#confDas ist Informatik
#citation1
#index2833
#arnetid2835

#*Was lehren wir eigentlich, wenn wir Informatik lehren?
#@Andreas Reuter
#year2001
#confDas ist Informatik
#citation0
#index2834
#arnetid2836

#*Software-Entwicklung im industriellen Maßstab.
#@Dirk Taubner
#year2001
#confDas ist Informatik
#citation3
#index2835
#arnetid2837

#*Wissen und Lernen.
#@Helmut Thoma
#year2001
#confDas ist Informatik
#citation0
#index2836
#arnetid2838

#*Sind Informatiker auch gute Software-Ingenieuere?
#@Herbert Weber
#year2001
#confDas ist Informatik
#citation1
#index2837
#arnetid2839

#*Softwaresystemtechnik - eine Informatik-Ingenieurdisziplin.
#@Siegfried Wendt
#year2001
#confDas ist Informatik
#citation1
#index2838
#arnetid2840

#*Progress Toward Automating The Development of Database System Software.
#@Don S. Batory
#year1985
#confQuery Processing in Database Systems
#citation5
#index2839
#arnetid2841

#*Query Processing in a Multidatabase System
#@Umeshwar Dayal
#year1985
#confQuery Processing in Database Systems
#citation78
#index2840
#arnetid2842

#*Updating Relational Views.
#@Antonio L. Furtado,Marco A. Casanova
#year1985
#confQuery Processing in Database Systems
#citation56
#index2841
#arnetid2843

#*Common Subexpression Isolation in Multiple Query Optimization
#@Matthias Jarke
#year1985
#confQuery Processing in Database Systems
#citation87
#index2842
#arnetid2844

#*Introduction to Query Processing
#@Matthias Jarke,Jürgen Koch,Joachim W. Schmidt
#year1985
#confQuery Processing in Database Systems
#citation5
#index2843
#arnetid2845

#*Processing Cyclic Queries.
#@Yahiko Kambayashi
#year1985
#confQuery Processing in Database Systems
#citation15
#index2844
#arnetid2846

#*Query Processing Using the Concecutive Retrieval Property.
#@Yahiko Kambayashi,Sakti P. Ghosh
#year1985
#confQuery Processing in Database Systems
#citation2
#index2845
#arnetid2847

#*Global Optimization of Relational Queries: A First Step
#@Won Kim
#year1985
#confQuery Processing in Database Systems
#citation38
#index2846
#arnetid2848

#*Query Processing in R*
#@Guy M. Lohman,C. Mohan,Laura M. Haas,Dean Daniels,Bruce G. Lindsay,Patricia G. Selinger,Paul F. Wilms
#year1985
#confQuery Processing in Database Systems
#citation113
#index2847
#arnetid2849

#*Supporting Complex Objects in a Relational System for Engineering Databases.
#@Raymond A. Lorie,Won Kim,Dan McNabb,Wil Plouffe,Andreas Meier
#year1985
#confQuery Processing in Database Systems
#citation65
#index2848
#arnetid2850

#*Physical Database Design: Techniques for Improved Database Performance.
#@Salvatore T. March,John V. Carlis
#year1985
#confQuery Processing in Database Systems
#citation6
#index2849
#arnetid2851

#*A Query Language for Statistical Databases
#@Z. Meral Özsoyoglu,Gultekin Özsoyoglu
#year1985
#confQuery Processing in Database Systems
#citation11
#index2850
#arnetid2852

#*Querying Relational Views of Networks
#@Arnon Rosenthal,David S. Reiner
#year1985
#confQuery Processing in Database Systems
#citation20
#index2851
#arnetid2853

#*Relational Query Processing on the Non-Von Supercomputer.
#@David Elliot Shaw
#year1985
#confQuery Processing in Database Systems
#citation-1
#index2852
#arnetid2854

#*The Intelligent Database Machine (IDM).
#@Michael Ubell
#year1985
#confQuery Processing in Database Systems
#citation14
#index2853
#arnetid2855

#*Database Access Requirements of Knowledge-Based Systems.
#@Yannis Vassiliou,James Clifford,Matthias Jarke
#year1985
#confQuery Processing in Database Systems
#citation6
#index2854
#arnetid2856

#*The Property of Separability And Its Application to Physical Database Design.
#@Kyu-Young Whang,Gio Wiederhold,Daniel Sagalowicz
#year1985
#confQuery Processing in Database Systems
#citation3
#index2855
#arnetid2857

#*Distributed Database Query Processing.
#@Clement T. Yu
#year1985
#confQuery Processing in Database Systems
#citation11
#index2856
#arnetid2858

#*Datenbanksprachen und Datenbankbenutzung.
#@Albrecht Blaser,Matthias Jarke,Hein Lehmann,Günter Müller
#year1987
#confDatenbankhandbuch
#citation-1
#index2857
#arnetid2859

#*Realisierung von operationalen Schnittstellen.
#@Theo Härder
#year1987
#confDatenbankhandbuch
#citation16
#index2858
#arnetid2860

#*Architektur von Datenbanksystemen.
#@Peter C. Lockemann,Klaus R. Dittrich
#year1987
#confDatenbankhandbuch
#citation17
#index2859
#arnetid2861

#*Datenbankentwurf.
#@Heinrich C. Mayr,Klaus R. Dittrich,Peter C. Lockemann
#year1987
#confDatenbankhandbuch
#citation11
#index2860
#arnetid2862

#*Maßnahmen zur Wahrung von Sicherheits- und Integritäsbedingungen.
#@Andreas Reuter
#year1987
#confDatenbankhandbuch
#citation-1
#index2861
#arnetid2863

#*Datenmodelle.
#@Joachim W. Schmidt
#year1987
#confDatenbankhandbuch
#citation-1
#index2862
#arnetid2864

#*JADE - A Java Agent Development Framework.
#@Fabio Bellifemine,Federico Bergenti,Giovanni Caire,Agostino Poggi
#year2005
#confMulti-Agent Programming
#citation67
#index2863
#arnetid2865

#*Jason and the Golden Fleece of Agent-Oriented Programming.
#@Rafael H. Bordini,Jomi Fred Hübner,Renata Vieira
#year2005
#confMulti-Agent Programming
#citation100
#index2864
#arnetid2866

#*Programming Multi-Agent Systems in 3APL.
#@Mehdi Dastani,M. Birna van Riemsdijk,John-Jules Ch. Meyer
#year2005
#confMulti-Agent Programming
#citation60
#index2865
#arnetid2867

#*IMPACT: A Multi-Agent Framework with Declarative Semantics.
#@Jürgen Dix,Yingqian Zhang
#year2005
#confMulti-Agent Programming
#citation17
#index2866
#arnetid2868

#*Jadex: A BDI Reasoning Engine.
#@Alexander Pokahr,Lars Braubach,Winfried Lamersdorf
#year2005
#confMulti-Agent Programming
#citation158
#index2867
#arnetid2869

#*ARTIMIS Rational Dialogue Agent Technology: An Overview.
#@David Sadek
#year2005
#confMulti-Agent Programming
#citation4
#index2868
#arnetid2870

#*The DEFACTO System: Coordinating Human-Agent Teams for the Future of Disaster Response.
#@Nathan Schurr,Janusz Marecki,John P. Lewis,Milind Tambe,Paul Scerri
#year2005
#confMulti-Agent Programming
#citation15
#index2869
#arnetid2871

#*CLAIM and SyMPA: A Programming Environment for Intelligent and Mobile Agents.
#@Amal El Fallah-Seghrouchni,Alexandru Suna
#year2005
#confMulti-Agent Programming
#citation-1
#index2870
#arnetid2872

#*JACK™ Intelligent Agents: An Industrial Strength Platform.
#@Michael Winikoff
#year2005
#confMulti-Agent Programming
#citation46
#index2871
#arnetid2873

#*Implementation-Aware Embedded Control Systems.
#@Karl-Erik Årzén,Anton Cervin,Dan Henriksson
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation9
#index2872
#arnetid2874

#*Network Fundamentals.
#@David M. Auslander,Jean-Dominique Decotignie
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation0
#index2873
#arnetid2875

#*Microcontrollers.
#@Steven F. Barrett,Daniel J. Pack
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation6
#index2874
#arnetid2876

#*Bluetooth in Control.
#@Bo Bernhardsson,Johan Eker,Joakim Persson
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation2
#index2875
#arnetid2877

#*Introduction to Hybrid Systems.
#@Michael S. Branicky
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation19
#index2876
#arnetid2878

#*Real-Time Scheduling for Embedded Systems.
#@Marco Caccamo,Theodore P. Baker,Alan Burns,Giorgio C. Buttazzo,Lui Sha
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation6
#index2877
#arnetid2879

#*From Control Loops to Real-Time Programs.
#@Paul Caspi,Oded Maler
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation10
#index2878
#arnetid2880

#*Discrete-Event Systems.
#@Christos G. Cassandras
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation582
#index2879
#arnetid2881

#*Basics of Data Acquisition and Control.
#@M. Chidambaram
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation0
#index2880
#arnetid2882

#*Temporal Logic Model Checking.
#@Edmund M. Clarke,Ansgar Fehnker,Sumit Kumar Jha,Helmut Veith
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation6
#index2881
#arnetid2883

#*The Cornell RoboCup Robot Soccer Team: 1999-2003.
#@Raffaello D'Andrea
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation13
#index2882
#arnetid2884

#*Control of Autonomous Mobile Robots.
#@Magnus Egerstedt
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation0
#index2883
#arnetid2885

#*SOPCs: Systems on Programmable Chips.
#@William M. Hawkins
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation-1
#index2884
#arnetid2886

#*Embedded Sensor Networks.
#@John S. Heidemann,Ramesh Govindan
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation18
#index2885
#arnetid2887

#*Feedback Control with Communication Constraints.
#@Dimitrios Hristu-Varsakelis
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation10
#index2886
#arnetid2888

#*Control of Single-Input Single-Output Systems.
#@Dimitrios Hristu-Varsakelis,William S. Levine
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation0
#index2887
#arnetid2889

#*Vehicle Applications of Controller Area Network.
#@Karl Henrik Johansson,Martin Törngren,Lars Nielsen
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation25
#index2888
#arnetid2890

#*Finite Automata.
#@Mark V. Lawson
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation45
#index2889
#arnetid2891

#*Digital Signal Processors.
#@Rainer Leupers,Gerd Ascheid
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation0
#index2890
#arnetid2892

#*Fundamentals of Dynamical Systems.
#@William S. Levine
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation-1
#index2891
#arnetid2893

#*Fundamentals of RTOS-Based Digital Controller Implementation.
#@Qing Li
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation1
#index2892
#arnetid2894

#*Network Protocols for Networked Control Systems.
#@Feng-Li Lian,James R. Moyne,Dawn M. Tilbury
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation3
#index2893
#arnetid2895

#*Switched Systems.
#@Daniel Liberzon
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation4
#index2894
#arnetid2896

#*LabVIEW Real-Time for Networked/Embedded Control.
#@John Limroth,Jeanne Sullivan Falcon,Dafna Leonard,Jenifer Loy
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation1
#index2895
#arnetid2897

#*An Overview of Hybrid Systems Control.
#@John Lygeros
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation2
#index2896
#arnetid2898

#*Control Issues in Systems with Loop Delays.
#@Leonid Mirkin,Zalman J. Palmor
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation19
#index2897
#arnetid2899

#*Networked Control Systems: A Model-Based Approach.
#@Luis Antonio Montestruque,Panos J. Antsaklis
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation19
#index2898
#arnetid2900

#*Embedded Real-Time Control via MATLAB, Simulink, and xPC Target.
#@Pieter J. Mosterman,Sameer Prabhu,Andrew Dowd,John Glass,Tom Erkkinen,John Kluza,Rohit Shenoy
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation5
#index2899
#arnetid2901

#*Programmable Logic Controllers.
#@Gustaf Olsson
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation0
#index2900
#arnetid2902

#*An Introduction to Hybrid Automata.
#@Jean-François Raskin
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation2
#index2901
#arnetid2903

#*Basics of Sampling and Quantization.
#@Mohammed S. Santina,Allen R. Stubberud
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation5
#index2902
#arnetid2904

#*Basics of Computer Architecture.
#@Charles B. Silio Jr.
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation0
#index2903
#arnetid2905

#*Control Using Feedback over Wireless Ethernet and Bluetooth.
#@Atul Suri,John Baillieul,D. V. Raghunathan
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation2
#index2904
#arnetid2906

#*Wireless Control with Bluetooth.
#@Vladimeros Vladimerou,Geir E. Dullerud
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation0
#index2905
#arnetid2907

#*Control Loops in RTLinux.
#@Victor Yodaiken,Matt Sherer,Edgar Hilton
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation-1
#index2906
#arnetid2908

#*Abduction and Analogy in Chance Discovery.
#@Akinori Abe
#year2003
#confChance Discovery
#citation7
#index2907
#arnetid2909

#*The PreparedMind: the Role of Representational Change in Chance Discovery.
#@Eric Dietrich,Arthur B. Markman,C. Hunt Stilwell,Michael Winkley
#year2003
#confChance Discovery
#citation-1
#index2908
#arnetid2910

#*Application to Understanding Consumers Latent Desires.
#@Hisashi Fukuda
#year2003
#confChance Discovery
#citation2
#index2909
#arnetid2911

#*Discovering Deep Building Blocks for Competent Genetic Algorithms Using Chance Discovery via KeyGraphs.
#@David E. Goldberg,Kumara Sastry,Yukio Ohsawa
#year2003
#confChance Discovery
#citation14
#index2910
#arnetid2912

#*Anatomy of Rare Events in a Complex Adaptive System.
#@Paul Jefferies,David Lamper,Neil F. Johnson
#year2003
#confChance Discovery
#citation0
#index2911
#arnetid2913

#*Self-organizing Complex Systems.
#@Henrik Jeldtoft Jensen
#year2003
#confChance Discovery
#citation5
#index2912
#arnetid2914

#*Topic Diffusion in a Community.
#@Naohiro Matsumura
#year2003
#confChance Discovery
#citation13
#index2913
#arnetid2915

#*Chance Discoveries from the WWW.
#@Naohiro Matsumura,Yukio Ohsawa
#year2003
#confChance Discovery
#citation0
#index2914
#arnetid2916

#*Prediction, Forecasting, and Chance Discovery.
#@Yutaka Matsuo
#year2003
#confChance Discovery
#citation2
#index2915
#arnetid2917

#*Dimensional Representations of Knowledge in an Online Community.
#@Robert McArthur,Peter Bruza
#year2003
#confChance Discovery
#citation13
#index2916
#arnetid2918

#*Agent Communications for Chance Discovery.
#@Peter McBurney,Simon Parsons
#year2003
#confChance Discovery
#citation1
#index2917
#arnetid2919

#*Chance Discovery for Consumers.
#@Makoto Mizuno
#year2003
#confChance Discovery
#citation1
#index2918
#arnetid2920

#*Application to Questionnaire Analysis.
#@Yumiko Nara,Yukio Ohsawa
#year2003
#confChance Discovery
#citation2
#index2919
#arnetid2921

#*Modeling the Process of Chance Discovery.
#@Yukio Ohsawa
#year2003
#confChance Discovery
#citation52
#index2920
#arnetid2922

#*KeyGraph: Visualized Structure Among Event Clusters.
#@Yukio Ohsawa
#year2003
#confChance Discovery
#citation7
#index2921
#arnetid2923

#*Detection of Earthquake Risks with KeyGraph.
#@Yukio Ohsawa
#year2003
#confChance Discovery
#citation4
#index2922
#arnetid2924

#*Logics of Argumentation for Chance Discovery.
#@Simon Parsons,Peter McBurney
#year2003
#confChance Discovery
#citation1
#index2923
#arnetid2925

#*The Storification of Chances.
#@Helmut Prendinger,Mitsuru Ishizuka
#year2003
#confChance Discovery
#citation1
#index2924
#arnetid2926

#*Human-to-Human Communication for Chance Discovery in Business.
#@Hiroko Shoji
#year2003
#confChance Discovery
#citation0
#index2925
#arnetid2927

#*Enhancing Daily Conversations.
#@Yasuyuki Sumi,Kenji Mase
#year2003
#confChance Discovery
#citation0
#index2926
#arnetid2928

#*Active Mining with Visual Human Interface.
#@Wataru Sunayama
#year2003
#confChance Discovery
#citation0
#index2927
#arnetid2929

#*Awareness and Imagination of Hidden Factors and Rare Events.
#@Yasufumi Takama
#year2003
#confChance Discovery
#citation-1
#index2928
#arnetid2930

#*Effects of Scenic Information.
#@Yasufumi Takama,Yukio Ohsawa
#year2003
#confChance Discovery
#citation6
#index2929
#arnetid2931

#*Decisions by Chance and on Chance: Meanings of Chance in Recent News Stories.
#@Fumiko Yoshikawa
#year2003
#confChance Discovery
#citation2
#index2930
#arnetid2932

#*Agent Naming and Coordination: Actor Based Models and Infrastructures.
#@Gul Agha,Nadeem Jamali,Carlos A. Varela
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation21
#index2931
#arnetid2933

#*Middleware Technologies: CORBA and Mobile Agents.
#@Paolo Bellavista,Thomas Magedanz
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation3
#index2932
#arnetid2934

#*A Market-Based Model for Resource Allocation in Agent Systems.
#@Jonathan Bredin,David Kotz,Daniela Rus,Rajiv T. Maheswaran,Çagri Imer,Tamer Basar
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation10
#index2933
#arnetid2935

#*Coordination and Security on the Internet.
#@Ciarán Bryce,Marco Cremonini
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation14
#index2934
#arnetid2936

#*Coordination Models: A Guided Tour.
#@Nadia Busi,Paolo Ciancarini,Roberto Gorrieri,Gianluigi Zavattaro
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation38
#index2935
#arnetid2937

#*Coordinating Agents using Agent Communication Languages Conversations.
#@R. Scott Cost,Yannis Labrou,Timothy W. Finin
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation22
#index2936
#arnetid2938

#*Reusable Patterns for Agent Coordination.
#@Dwight Deugo,Michael Weiss,Elizabeth A. Kendall
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation58
#index2937
#arnetid2939

#*Inter-Organizational Workflows for Enterprise Coordination.
#@Monica Divitini,Chihab Hanachi,Christophe Sibertin-Blanc
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation29
#index2938
#arnetid2940

#*Coordination and Control in Computational Ecosystems: A Vision of the Future.
#@Rune Gustavsson,Martin Fredriksson
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation23
#index2939
#arnetid2941

#*High-Level Enabling Coordination Technologies, Introduction.
#@Matthias Klusch
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation0
#index2940
#arnetid2942

#*Brokering and Matchmaking for Coordination of Agent Societies: A Survey.
#@Matthias Klusch,Katia P. Sycara
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation114
#index2941
#arnetid2943

#*Scalability in Linda-like Coordination Systems.
#@Ronaldo Menezes,Robert Tolksdorf,Alan Wood
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation6
#index2942
#arnetid2944

#*Constraints Solving as the Coordination of Inference Engines.
#@Eric Monfroy,Farhad Arbab
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation13
#index2943
#arnetid2945

#*Coordination Models and Languages: State of the Art, Introduction.
#@Andrea Omicini
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation0
#index2944
#arnetid2946

#*Basic Enabling Technologies, Introduction.
#@Andrea Omicini
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation0
#index2945
#arnetid2947

#*Preface: Coordination of Internet Agents.
#@Andrea Omicini,Franco Zambonelli,Matthias Klusch,Robert Tolksdorf
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation0
#index2946
#arnetid2948

#*Models and Technologies for the Coordination of Internet Agents: A Survey.
#@George A. Papadopoulos
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation44
#index2947
#arnetid2949

#*Coordination and Mobility.
#@Gruia-Catalin Roman,Amy L. Murphy,Gian Pietro Picco
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation23
#index2948
#arnetid2950

#*Tuple-based Technologies for Coordination.
#@Davide Rossi,Giacomo Cabri,Enrico Denti
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation43
#index2949
#arnetid2951

#*Run-Time Systems for Coordination.
#@Antony I. T. Rowstron
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation18
#index2950
#arnetid2952

#*Agent Coordination via Scripting Languages.
#@Jean-Guy Schneider,Markus Lumpe,Oscar Nierstrasz
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation11
#index2951
#arnetid2953

#*Foreword: Coordination and the Internet.
#@Munindar P. Singh
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation0
#index2952
#arnetid2954

#*Applications of Coordination Technology, Introduction.
#@Robert Tolksdorf
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation0
#index2953
#arnetid2955

#*Emerging Issues of Coordination, Introduction.
#@Franco Zambonelli
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation0
#index2954
#arnetid2956

#*Visions, Introduction.
#@Franco Zambonelli
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation0
#index2955
#arnetid2957

#*Agent-Oriented Software Engineering for Internet Applications.
#@Franco Zambonelli,Nicholas R. Jennings,Andrea Omicini,Michael Wooldridge
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation154
#index2956
#arnetid2958

#*Grid Computing-Ansätze für verteiltes virtuelles Prototyping.
#@Thomas Barth,Manfred Grauer
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation-1
#index2957
#arnetid2959

#*Bedeutung von Peer-to-Peer Technologien für die Distribution von Medienprodukten im Internet.
#@Michel Clement,Guido Nerjes,Matthias Runte
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation-1
#index2958
#arnetid2960

#*Peer-to-Peer-Computing - Wettbewerbsvorteil für Intel.
#@Martin G. Curley
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation-1
#index2959
#arnetid2961

#*Sicherheitsaspekte von P2P Anwendungen in Unternehmen.
#@Herbert Damker
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation7
#index2960
#arnetid2962

#*Vertrauen und Reputation in P2P-Netzwerken.
#@Holger Eggs,Stefan Sackmann,Torsten Eymann,Günter Müller
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation5
#index2961
#arnetid2963

#*Die Anatomie des Grid.
#@Ian T. Foster,Carl Kesselman,Steven Tuecke
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation2
#index2962
#arnetid2964

#*Project JXTA.
#@Tom Groth
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation1
#index2963
#arnetid2965

#*Napster in der Videobranche?
#@Thomas Hess,Markus Anding,Matthias Schreiber
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation5
#index2964
#arnetid2966

#*Urheberrecht und Peer-to-Peer-Dienste.
#@Thomas Hoeren
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation2
#index2965
#arnetid2967

#*Instant Messaging - Nutzenpotentiale und Herausforderungen.
#@Thomas Hummel
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation-1
#index2966
#arnetid2968

#*Gnutella.
#@Gene Kan
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation111
#index2967
#arnetid2969

#*Moneybee - Vernetzung künstlicher Intelligenz.
#@Till Mansmann,Stefan Selle
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation-1
#index2968
#arnetid2970

#*Peer-to-Peer Anwendungsbereiche und Herausforderungen.
#@Detlef Schoder,Kai Fischbach
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation33
#index2969
#arnetid2971

#*ZetaGrid.
#@Sebastian Wedeniwski
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation7
#index2970
#arnetid2972

#*Web Services und Peer-to-Peer-Netzwerke.
#@Remigiusz Wojciechowski,Christof Weinhardt
#year2002
#confPeer-to-Peer: Ökonomische, technische und juristische Perspektiven
#citation12
#index2971
#arnetid2973

#*Rule Analysis
#@Elena Baralis
#year1999
#confActive Rules in Database Systems
#citation9
#index2972
#arnetid2974

#*Architecture of Active Database Systems
#@Alejandro P. Buchmann
#year1999
#confActive Rules in Database Systems
#citation15
#index2973
#arnetid2975

#*ECA Functionality in a Distributed Environment.
#@Günter von Bültzingsloewen,Arne Koschel,Peter C. Lockemann,Hans-Dirk Walter
#year1999
#confActive Rules in Database Systems
#citation7
#index2974
#arnetid2976

#*NAOS.
#@Christine Collet
#year1999
#confActive Rules in Database Systems
#citation11
#index2975
#arnetid2977

#*Tool Support.
#@Oscar Díaz
#year1999
#confActive Rules in Database Systems
#citation9
#index2976
#arnetid2978

#*EXACT: An Approach to Coping with Heterogeneous Rule Execution Models.
#@Oscar Díaz
#year1999
#confActive Rules in Database Systems
#citation0
#index2977
#arnetid2979

#*RAP: The ROCK & ROLL Active Programming System.
#@Andrew Dinn,Norman W. Paton,M. Howard Williams
#year1999
#confActive Rules in Database Systems
#citation2
#index2978
#arnetid2980

#*Active Database Systems: Expectations, Commercial Experience, and Beyond.
#@Angelika Kotz Dittrich,Eric Simon
#year1999
#confActive Rules in Database Systems
#citation17
#index2979
#arnetid2981

#*Database Internal Applications.
#@Suzanne M. Embury,Peter M. D. Gray
#year1999
#confActive Rules in Database Systems
#citation7
#index2980
#arnetid2982

#*Comparing Deductive and Active Databases.
#@Alvaro A. A. Fernandes
#year1999
#confActive Rules in Database Systems
#citation0
#index2981
#arnetid2983

#*Chimera: A Language for Designing Rule Applications.
#@Piero Fraternali,Stefano Paraboschi
#year1999
#confActive Rules in Database Systems
#citation4
#index2982
#arnetid2984

#*SAMOS.
#@Stella Gatziu,Klaus R. Dittrich
#year1999
#confActive Rules in Database Systems
#citation12
#index2983
#arnetid2985

#*Performance Assessment.
#@Andreas Geppert,Klaus R. Dittrich
#year1999
#confActive Rules in Database Systems
#citation-1
#index2984
#arnetid2986

#*Ariel.
#@Eric N. Hanson
#year1999
#confActive Rules in Database Systems
#citation-1
#index2985
#arnetid2987

#*Active Real-Time Database Systems.
#@Jörgen Hansson,Mikael Berndtsson
#year1999
#confActive Rules in Database Systems
#citation5
#index2986
#arnetid2988

#*Active Database Features in SQL3.
#@Krishna G. Kulkarni,Nelson Mendonça Mattos,Roberta Cochrane
#year1999
#confActive Rules in Database Systems
#citation39
#index2987
#arnetid2989

#*Summary.
#@Norman W. Paton
#year1999
#confActive Rules in Database Systems
#citation-1
#index2988
#arnetid2990

#*Optimization
#@Norman W. Paton,Andrew Dinn,M. Howard Williams
#year1999
#confActive Rules in Database Systems
#citation-1
#index2989
#arnetid2991

#*Introduction
#@Norman W. Paton,Oscar Díaz
#year1999
#confActive Rules in Database Systems
#citation-1
#index2990
#arnetid2992

#*PFL: An Active Functional DBPL.
#@Swarup Reddi,Alexandra Poulovassilis,Carol Small
#year1999
#confActive Rules in Database Systems
#citation7
#index2991
#arnetid2993

#*Monitoring Complex Rule Conditions
#@Tore Risch,Martin Sköld
#year1999
#confActive Rules in Database Systems
#citation2
#index2992
#arnetid2994

#*REACH.
#@Jürgen Zimmermann,Alejandro P. Buchmann
#year1999
#confActive Rules in Database Systems
#citation-1
#index2993
#arnetid2995

#*Ontologies for Knowledge Management.
#@Andreas Abecker,Ludger van Elst
#year2004
#confHandbook on Ontologies
#citation38
#index2994
#arnetid2996

#*Ontologies in F-logic.
#@Jürgen Angele,Georg Lausen
#year2004
#confHandbook on Ontologies
#citation0
#index2995
#arnetid2997

#*Web Ontology Language: OWL.
#@Grigoris Antoniou,Frank van Harmelen
#year2004
#confHandbook on Ontologies
#citation281
#index2996
#arnetid2998

#*Description Logics.
#@Franz Baader,Ian Horrocks,Ulrike Sattler
#year2004
#confHandbook on Ontologies
#citation150
#index2997
#arnetid2999

#*Ontologies and Metadata for eLearning.
#@Jan Brase,Wolfgang Nejdl
#year2004
#confHandbook on Ontologies
#citation85
#index2998
#arnetid3000

#*Ontologies and Hypertext.
#@Les Carr,Simon Kampa,Wendy Hall,Sean Bechhofer,Carole A. Goble
#year2004
#confHandbook on Ontologies
#citation3
#index2999
#arnetid3001

#*Knowledge Patterns.
#@Peter Clark,John Thompson,Bruce W. Porter
#year2004
#confHandbook on Ontologies
#citation82
#index3000
#arnetid3002

#*Ontologies in Support of Problem Solving.
#@Monica Crubézy,Mark A. Musen
#year2004
#confHandbook on Ontologies
#citation71
#index3001
#arnetid3003

#*The Role of Ontologies in eCommerce.
#@Ying Ding,Dieter Fensel,Michel C. A. Klein,Borys Omelayenko,Ellen Schulten
#year2004
#confHandbook on Ontologies
#citation23
#index3002
#arnetid3004

#*Ontology Matching: A Machine Learning Approach.
#@AnHai Doan,Jayant Madhavan,Pedro Domingos,Alon Y. Halevy
#year2004
#confHandbook on Ontologies
#citation255
#index3003
#arnetid3005

#*Semantic Layering with Magpie.
#@John Domingue,Martin Dzbor,Enrico Motta
#year2004
#confHandbook on Ontologies
#citation34
#index3004
#arnetid3006

#*Retrieving and Exploring Ontology-based Information.
#@Peter W. Eklund,Richard J. Cole II,Nataliya Roberts
#year2004
#confHandbook on Ontologies
#citation2
#index3005
#arnetid3007

#*Supporting User Tasks through Visualisation of Light-weight Ontologies.
#@Christiaan Fluit,Marta Sabou,Frank van Harmelen
#year2004
#confHandbook on Ontologies
#citation66
#index3006
#arnetid3008

#*Ontology Evaluation.
#@Asunción Gómez-Pérez
#year2004
#confHandbook on Ontologies
#citation72
#index3007
#arnetid3009

#*Ontology of the Process Specification Language.
#@Michael Grüninger
#year2004
#confHandbook on Ontologies
#citation13
#index3008
#arnetid3010

#*An Overview of OntoClean.
#@Nicola Guarino,Christopher A. Welty
#year2004
#confHandbook on Ontologies
#citation209
#index3009
#arnetid3011

#*Building a Very Large Ontology from Medical Thesauri.
#@Udo Hahn,Stefan Schulz
#year2004
#confHandbook on Ontologies
#citation11
#index3010
#arnetid3012

#*Ontology Reconciliation.
#@Adil Hameed,Alun D. Preece,Derek H. Sleeman
#year2004
#confHandbook on Ontologies
#citation59
#index3011
#arnetid3013

#*Ontology and the Lexicon.
#@Graeme Hirst
#year2004
#confHandbook on Ontologies
#citation70
#index3012
#arnetid3014

#*Ontology Learning.
#@Alexander Maedche,Steffen Staab
#year2004
#confHandbook on Ontologies
#citation135
#index3013
#arnetid3015

#*The Resource Description Framework (RDF) and its Vocabulary Description Language RDFS.
#@Brian McBride
#year2004
#confHandbook on Ontologies
#citation65
#index3014
#arnetid3016

#*Ontology-based Recommender Systems.
#@Stuart E. Middleton,David De Roure,Nigel R. Shadbolt
#year2004
#confHandbook on Ontologies
#citation18
#index3015
#arnetid3017

#*Ontology-based Content Management in a Virtual Organization.
#@Peter Mika,Victor Iosif,York Sure,Hans Akkermans
#year2004
#confHandbook on Ontologies
#citation7
#index3016
#arnetid3018

#*An Ontology-based Platform for Semantic Interoperability.
#@Michele Missikoff,Francesco Taglino
#year2004
#confHandbook on Ontologies
#citation16
#index3017
#arnetid3019

#*An Ontology-Composition Algebra.
#@Prasenjit Mitra,Gio Wiederhold
#year2004
#confHandbook on Ontologies
#citation29
#index3018
#arnetid3020

#*Ontology Engineering Environments.
#@Riichiro Mizoguchi
#year2004
#confHandbook on Ontologies
#citation36
#index3019
#arnetid3021

#*Tools for Mapping and Merging Ontologies.
#@Natalya Fridman Noy
#year2004
#confHandbook on Ontologies
#citation58
#index3020
#arnetid3022

#*The Knowledge Portal "OntoWeb".
#@Daniel Oberle,Peter Spyns
#year2004
#confHandbook on Ontologies
#citation8
#index3021
#arnetid3023

#*An Extensible Ontology Software Environment.
#@Daniel Oberle,Raphael Volz,Steffen Staab,Boris Motik
#year2004
#confHandbook on Ontologies
#citation-1
#index3022
#arnetid3024

#*Ontologies in Bioinformatics.
#@Robert Stevens,Chris Wroe,Phillip W. Lord,Carole A. Goble
#year2004
#confHandbook on Ontologies
#citation36
#index3023
#arnetid3025

#*On-To-Knowledge Methodology (OTKM).
#@York Sure,Steffen Staab,Rudi Studer
#year2004
#confHandbook on Ontologies
#citation39
#index3024
#arnetid3026

#*Ontologies in Agent Architectures.
#@Katia P. Sycara,Massimo Paolucci
#year2004
#confHandbook on Ontologies
#citation17
#index3025
#arnetid3027

#*Ink as a First-Class Datatype in Multimedia Databases.
#@Walid G. Aref,Daniel Barbará,Daniel P. Lopresti
#year1996
#confMultimedia Database System: Issues and Research Direction
#citation25
#index3026
#arnetid3028

#*A Data Access Structure for Filtering Distance Queries in Image Retrieval.
#@Alberto Belussi,Elisa Bertino,A. Biavasco,S. Rizzo
#year1996
#confMultimedia Database System: Issues and Research Direction
#citation-1
#index3027
#arnetid3029

#*Multimedia Athoring Systems.
#@Ross Cutler,K. Selçuk Candan
#year1996
#confMultimedia Database System: Issues and Research Direction
#citation1
#index3028
#arnetid3030

#*Stream-based Versus Structured Video Objects: Issues, Solutions, and Challenges.
#@Shahram Ghandeharizadeh
#year1996
#confMultimedia Database System: Issues and Research Direction
#citation16
#index3029
#arnetid3031

#*A Unified Approach to Data Modeling and Retrieval for a Class of Image Database Applications.
#@Venkat N. Gudivada,Vijay V. Raghavan,Kanonkluk Vanapipat
#year1996
#confMultimedia Database System: Issues and Research Direction
#citation-1
#index3030
#arnetid3032

#*Indexing for Retrieval by Similarity.
#@H. V. Jagadish
#year1996
#confMultimedia Database System: Issues and Research Direction
#citation12
#index3031
#arnetid3033

#*Metadata for Building the MultiMedia Patch Quilt.
#@Vipul Kashyap,Kshitij Shah,Amit P. Sheth
#year1996
#confMultimedia Database System: Issues and Research Direction
#citation55
#index3032
#arnetid3034

#*Querying Multimedia Databases in SQL.
#@Sherry Marcus
#year1996
#confMultimedia Database System: Issues and Research Direction
#citation8
#index3033
#arnetid3035

#*Towards a Theory of Multimedia Database Systems.
#@Sherry Marcus,V. S. Subrahmanian
#year1996
#confMultimedia Database System: Issues and Research Direction
#citation-1
#index3034
#arnetid3036

#*The Storage and Retrieval of Continuous Media Data.
#@Banu Özden,Rajeev Rastogi,Abraham Silberschatz
#year1996
#confMultimedia Database System: Issues and Research Direction
#citation26
#index3035
#arnetid3037

#*Retrieval of Pictures Using Approximate Matching.
#@A. Prasad Sistla,Clement T. Yu
#year1996
#confMultimedia Database System: Issues and Research Direction
#citation4
#index3036
#arnetid3038

#*Design and Implementation of QBISM, a 3D Medical Image Database System.
#@Manish Arya,William F. Cody,Christos Faloutsos,Joel E. Richardson,Arthur Toya
#year1996
#confMultimedia Database System: Issues and Research Direction
#citation6
#index3037
#arnetid3039

#*Dataflow and Education: Data-driven and Demand-driven Distributed Computation.
#@Edward A. Ashcroft
#year1986
#confCurrent Trends in Concurrency
#citation16
#index3038
#arnetid3040

#*Contrasting Themes in the Semantics of Imperative Concurrency.
#@J. W. de Bakker,Joost N. Kok,John-Jules Ch. Meyer,Ernst-Rüdiger Olderog,Jeffery I. Zucker
#year1986
#confCurrent Trends in Concurrency
#citation45
#index3039
#arnetid3041

#*Functional Programming and the Language TALE.
#@Henk Barendregt,Marc van Leeuwen
#year1986
#confCurrent Trends in Concurrency
#citation22
#index3040
#arnetid3042

#*Design, Specification and Validation of Hierarchies of Protocols in Distributed Systems.
#@Michel Diaz,Jean-Pierre Courtiat,Aloysio Pedroza
#year1986
#confCurrent Trends in Concurrency
#citation0
#index3041
#arnetid3043

#*Infinitary Languages: Basic Theory an Applications to Concurrent Systems.
#@Hendrik Jan Hoogeboom,Grzegorz Rozenberg
#year1986
#confCurrent Trends in Concurrency
#citation-1
#index3042
#arnetid3044

#*The Quest Goes on: A Survey of Proofsystems for Partial Correctness of CSP.
#@Jozef Hooman,Willem P. de Roever
#year1986
#confCurrent Trends in Concurrency
#citation27
#index3043
#arnetid3045

#*Logic Programming: The Foundations, the Approach and the Role of Concurrency.
#@Giorgio Levi
#year1986
#confCurrent Trends in Concurrency
#citation6
#index3044
#arnetid3046

#*Process Theory: Semantics, Specification and Verification.
#@Ernst-Rüdiger Olderog
#year1986
#confCurrent Trends in Concurrency
#citation29
#index3045
#arnetid3047

#*Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends.
#@Amir Pnueli
#year1986
#confCurrent Trends in Concurrency
#citation448
#index3046
#arnetid3048

#*Petri Nets: Basic Notions, Structure, Behaviour.
#@Grzegorz Rozenberg,P. S. Thiagarajan
#year1986
#confCurrent Trends in Concurrency
#citation90
#index3047
#arnetid3049

#*Concepts for Concurrent Programming.
#@Fred B. Schneider,Gregory R. Andrews
#year1986
#confCurrent Trends in Concurrency
#citation16
#index3048
#arnetid3050

#*Survey of Biodata Analysis from a Data Mining Perspective.
#@Peter Bajcsy,Jiawei Han,Lei Liu,Jiong Yang
#year2005
#confData Mining in Bioinformatics
#citation11
#index3049
#arnetid3051

#*Mining Chemical Compounds.
#@Mukund Deshpande,Michihiro Kuramochi,George Karypis
#year2005
#confData Mining in Bioinformatics
#citation1
#index3050
#arnetid3052

#*Data Mining Methods for a Systematics of Protein Subcellular Location.
#@Kai Huang,Robert F. Murphy
#year2005
#confData Mining in Bioinformatics
#citation1
#index3051
#arnetid3053

#*Phyloinformatics: Toward a Phylogenetic Database.
#@Roderic D. M. Page
#year2005
#confData Mining in Bioinformatics
#citation23
#index3052
#arnetid3054

#*Declarative and Efficient Querying on Protein Secondary Structures.
#@Jignesh M. Patel,Donald P. Huddler,Laurie Hammel
#year2005
#confData Mining in Bioinformatics
#citation1
#index3053
#arnetid3055

#*AntiClustAl: Multiple Sequence Alignment by Antipole Clustering.
#@Cinzia Di Pietro,Alfredo Ferro,Giuseppe Pigola,Alfredo Pulvirenti,Michele Purrello,Marco Ragusa,Dennis Shasha
#year2005
#confData Mining in Bioinformatics
#citation1
#index3054
#arnetid3056

#*Piecewise Constant Modeling of Sequential Data Using Reversible Jump Markov Chain Monte Carlo.
#@Marko Salmenkivi,Heikki Mannila
#year2005
#confData Mining in Bioinformatics
#citation0
#index3055
#arnetid3057

#*Gene Mapping by Pattern Discovery.
#@Petteri Sevon,Hannu Toivonen,Paivi Onkamo
#year2005
#confData Mining in Bioinformatics
#citation2
#index3056
#arnetid3058

#*Scalable Index Structures for Biological Data.
#@Ambuj K. Singh
#year2005
#confData Mining in Bioinformatics
#citation0
#index3057
#arnetid3059

#*Introduction to Data Mining in Bioinformatics.
#@Jason Tsong-Li Wang,Mohammed Javeed Zaki,Hannu Toivonen,Dennis Shasha
#year2005
#confData Mining in Bioinformatics
#citation0
#index3058
#arnetid3060

#*Predicting Protein Folding Pathways.
#@Mohammed Javeed Zaki,Vinay Nadimpally,Deb Bardhan,Chris Bystroff
#year2005
#confData Mining in Bioinformatics
#citation19
#index3059
#arnetid3061
#!Summary: A structured folding pathway, which is a time ordered sequence of folding events, plays an important role in the protein folding process and hence, in the conformational search. Pathway prediction, thus gives more insight into the folding process and is a valuable guiding tool to search the conformation space. In this paper, we propose a novel 'unfolding' approach to predict the folding pathway. We apply graph-based methods on a weighted secondary structure graph of a protein to predict the sequence of unfolding events. When viewed in reverse this yields the folding pathway. We demonstrate the success of our approach on several proteins whose pathway is partially known.

#*RNA Structure Comparison and Alignment.
#@Kaizhong Zhang
#year2005
#confData Mining in Bioinformatics
#citation3
#index3060
#arnetid3062

#*Active XML: A Data-Centric Perspective on Web Services.
#@Serge Abiteboul,Omar Benjelloun,Ioana Manolescu,Tova Milo,Roger Weber
#year2004
#confWeb Dynamics
#citation51
#index3061
#arnetid3063

#*Web Dynamics, Structure, and Page Quality.
#@Ricardo A. Baeza-Yates,Carlos Castillo,Felipe Saint-Jean
#year2004
#confWeb Dynamics
#citation21
#index3062
#arnetid3064

#*An Event-Condition-Action Language for XML.
#@James Bailey,George Papamarkos,Alexandra Poulovassilis,Peter T. Wood
#year2004
#confWeb Dynamics
#citation-1
#index3063
#arnetid3065

#*Search Engine Ability to Cope With the Changing Web.
#@Judit Bar-Ilan
#year2004
#confWeb Dynamics
#citation15
#index3064
#arnetid3066

#*Active XQuery.
#@Angela Bonifati,Stefano Paraboschi
#year2004
#confWeb Dynamics
#citation-1
#index3065
#arnetid3067

#*Adaptive Web-Based Educational Hypermedia.
#@Paul De Bra,Lora Aroyo,Alexandra I. Cristea
#year2004
#confWeb Dynamics
#citation44
#index3066
#arnetid3068

#*DREAM: Distributed Reliable Event-Based Application Management.
#@Alejandro P. Buchmann,Christof Bornhövd,Mariano Cilia,Ludger Fiege,Felix C. Gärtner,Christoph Liebig,Matthias Meixner,Gero Mühl
#year2004
#confWeb Dynamics
#citation35
#index3067
#arnetid3069

#*A Survey of Architectures for Adaptive Hypermedia.
#@Mario Cannataro,Andrea Pugliese
#year2004
#confWeb Dynamics
#citation16
#index3068
#arnetid3070

#*Learning Web Request Patterns.
#@Brian D. Davison
#year2004
#confWeb Dynamics
#citation33
#index3069
#arnetid3071

#*How Large Is the WorldWide Web?
#@Adrian Dobra,Stephen E. Fienberg
#year2004
#confWeb Dynamics
#citation-1
#index3070
#arnetid3072

#*Methods for MiningWeb Communities: Bibliometric, Spectral, and Flow.
#@Gary William Flake,Kostas Tsioutsiouliklis,Leonid Zhukov
#year2004
#confWeb Dynamics
#citation-1
#index3071
#arnetid3073

#*WebVigiL: An Approach to Just-In-Time Information Propagation in Large Network-Centric Environments.
#@Jyoti Jacob,Anoop Sanka,Naveen Pandrangi,Sharma Chakravarthy
#year2004
#confWeb Dynamics
#citation23
#index3072
#arnetid3074

#*Web Dynamics - Setting the Scene.
#@Mark Levene,Alexandra Poulovassilis
#year2004
#confWeb Dynamics
#citation0
#index3073
#arnetid3075

#*Navigating the World Wide Web.
#@Mark Levene,Richard Wheeldon
#year2004
#confWeb Dynamics
#citation14
#index3074
#arnetid3076

#*Theory of Random Networks and Their Role in Communications Networks.
#@José Fernando Mendes
#year2004
#confWeb Dynamics
#citation1
#index3075
#arnetid3077

#*Crawling the Web.
#@Gautam Pant,Padmini Srinivasan,Filippo Menczer
#year2004
#confWeb Dynamics
#citation83
#index3076
#arnetid3078

#*Combining Link and Content Information in Web Search.
#@Matthew Richardson,Pedro Domingos
#year2004
#confWeb Dynamics
#citation6
#index3077
#arnetid3079

#*MP - Mobile Portals, Profiles and Personalization.
#@Barry Smyth,Paul Cotter
#year2004
#confWeb Dynamics
#citation7
#index3078
#arnetid3080

#*Evolution of Web Structure and Content - Introduction.
#@
#year2004
#confWeb Dynamics
#citation0
#index3079
#arnetid3081

#*Searching and Navigating the Web - Introduction.
#@
#year2004
#confWeb Dynamics
#citation0
#index3080
#arnetid3082

#*Events and Change on the Web - Introduction.
#@
#year2004
#confWeb Dynamics
#citation0
#index3081
#arnetid3083

#*Personalized Access to the Web - Introduction.
#@
#year2004
#confWeb Dynamics
#citation0
#index3082
#arnetid3084

#*Behavioural Virtual Agents.
#@Ruth Aylett
#year1999
#confArtificial Intelligence Today
#citation3
#index3083
#arnetid3085
#%29618
#%1043050
#%520756
#%738661
#%520762
#%29939
#%520765
#%30060
#!We discuss the application of behavioural architectures, in the robotic sense, to virtual agents. 'Virtual Teletubbies' are used as an example of the issues involved. we conclude that the use of such architectures has implications for the whole style in which a virtual world is modelled.

#*Logic-Based Knowledge Representation.
#@Franz Baader
#year1999
#confArtificial Intelligence Today
#citation56
#index3084
#arnetid3086
#%38355
#%485034
#%484737
#%33598
#%71743
#%951123
#%605212
#%387400
#%387406
#%477439
#%1062480
#%533976
#%387412
#%845587
#%1089373
#%744386
#%598160
#%952087
#%176258
#%1025044
#%744763
#%157732
#%698
#%3230
#%328070
#%12913
#%745017
#%388827
#%477711
#%388970
#%624628
#%1062500
#%219715
#%745282
#%479892
#%13795
#%479914
#%1062568
#%519183
#%1062590
#%389724
#%114533
#%745572
#%3440
#%486406
#%745620
#%478039
#%390485
#%182354
#%480064
#%745826
#%984656
#%950388
#%973052
#!After a short analysis of the requirements that a knowledge representation language must satisfy, we introduce Description Logics, Modal Logics, and Nonmonotonic Logics as formalisms for representing terminological knowledge, time-dependent or subjective knowledge, and incomplete knowledge respectively. At the end of each section, we briefly comment on the connection to Logic Programming.

#*An Overview of Planning Under Certainty.
#@Jim Blythe
#year1999
#confArtificial Intelligence Today
#citation31
#index3085
#arnetid3087

#*A Taxonomy of Theorem-Proving Strategies.
#@Maria Paola Bonacina
#year1999
#confArtificial Intelligence Today
#citation21
#index3086
#arnetid3088
#%72085
#%72069
#%72011
#%71175
#%71900
#%71867
#%71174
#%71964
#%1499758
#%1500274
#%71503
#%71667
#%71146
#%126919
#%71460
#%951845
#%951006
#%951441
#%950295
#%950117
#%951607
#%951002
#%951844
#%157180
#%954570
#%954599
#%993343
#%487022
#%887043
#%954647
#%624688
#%744328
#%1089504
#%984195
#%1089518
#%1025013
#%993565
#%477512
#%697
#%71314
#%792
#%745104
#%993974
#%268287
#%950712
#%388911
#%994093
#%389142
#%745263
#%954843
#%954871
#%954873
#%994320
#%954984
#%954986
#%994478
#%71954
#%955029
#%882513
#%776748
#%994817
#%994821
#!This article presents a taxonomy of strategies for fully-automated general-purpose first-order theorem proving. It covers forward-reasoning ordering-based strategies and backward-reasoning subgoal-reduction strategies, which do not appear together often. Unlike traditional presentations that emphasize logical inferences, this classification strives to give equal weight to the inference and search components of theorem proving, which are equally important in practice. For this purpose, a formal notion of search plan is given and shown to apply to all classes of strategies. For each class, the form of derivation is specified, and it is shown how inference system and search plan cooperate to generate it.

#*Knowledge Representation for Stochastic Decision Process.
#@Craig Boutilier
#year1999
#confArtificial Intelligence Today
#citation-1
#index3087
#arnetid3089
#%744251
#%387719
#%31359
#%387724
#%632325
#%744945
#%745026
#%745195
#%632453
#%13651
#%745297
#%632684
#%479943
#%745692
#%390166
#%746036
#!Reasoning about stochastic dynamical systems and planning under uncertainty has come to play a fundamental role in AI research and applications. The representation of such systems, in particular, of actions with stochastic effects, has accordingly been given increasing attention in recent years. In this article, we survey a number of techniques for representing stochastic processes and actions with stochastic effects using dynamic Bayesian networks and influence diagrams, and briefly describe how these support effective inference for tasks such as monitoring, forecasting, explanation and decision making. We also compare these techniques to several action representations adopted in the classical reasoning about action and planning communities, describing how traditional problems such as the frame and ramification problems are dealt with in stochastic settings, and how these solutions compare to recent approaches to this problem in the classical (deterministic) literature. We argue that while stochastic dynamics introduce certain complications when it comes to such issues, for the most part, intuitions underlying classical models can be extended to the stochastic setting.

#*A Survey of Automated Deduction.
#@Alan Bundy
#year1999
#confArtificial Intelligence Today
#citation34
#index3088
#arnetid3090
#%71641
#%72017
#%71991
#%71647
#%71898
#%951441
#%950117
#%71209
#%71098
#%1056562
#%486993
#%832295
#%744502
#%3146
#%3162
#%388404
#%376204
#%388695
#%745017
#%388827
#%388912
#%954789
#%994094
#%546467
#%643029
#%440205
#%954873
#%39484
#%1123772
#%71762
#%818584
#%71882
#%951605
#%955038
#%391032
#%2472
#%746091
#!We survey research in the automation of deductive inference, from its beginnings in the early history of computing to the present day. We identify and describe the major areas of research interest and their applications. The area is characterised by its wide variety of proof methods, forms of automated deduction and applications.

#*The World Wide Web as a Place for Agents.
#@Paolo Ciancarini,Robert Tolksdorf,Fabio Vitali
#year1999
#confArtificial Intelligence Today
#citation8
#index3089
#arnetid3091
#%805572
#%659537
#%116306
#%772069
#%832400
#%507620
#%1141875
#%1127831
#%659641
#%1124283
#%807183
#%807494
#%3699
#%795304
#%659978
#%660042
#!The Word Wide Web was born as an Internet service supporting a simple distributed hypertext management system. Since its start a number of technologies have been proposed to enhance its capabilities. In this paper we describe our concept of an active Web, namely how we design the software architecture of interactive cooperative applications based on the Word Wide web. An active Web includes agents able to use the services offered by Word Wide web clients and servers. In an active Web both users and agents can interoperate using a set of basic mechanisms for communication and synchronization. The active Web we describe here is based on coordination technology: we explore two alternative implementations, both based on Java enriched with alternative coordination kernels.

#*Lifelike Pedagogical Agents and Affective Computing: An Exploratory Synthesis.
#@Clark Elliott,Jeff Rickel,James C. Lester
#year1999
#confArtificial Intelligence Today
#citation137
#index3090
#arnetid3092
#%29544
#%1136099
#%89197
#%459504
#%29809
#%458645
#%459669

#*OBDD-based Universal Planning: Specifying and Solving Planning Problems for Synchronized Agents in Non-deterministic Domains.
#@Rune M. Jensen,Manuela M. Veloso
#year1999
#confArtificial Intelligence Today
#citation113
#index3091
#arnetid3093
#%633
#%387652
#%1078390
#%12298
#%1123432
#%744638
#%744699
#%479655
#%388404
#%747725
#%744945
#%12938
#%745167
#%816228
#%389249
#%440160
#%745430
#%390496
#%913352
#!Recently model checking representation and search techniques were shown to be efficiently applicable to planning, in particular to non-deterministic planning. Such planning approaches use Ordered Binary Decision Diagrams (OBDDS) to encode a planning domain as a non-deterministic finite automaton (NFA) and then apply fast algorithms from model checking to search for a solution. OBDDS can effectively scale and can provide universal plans for complex planning domains. We are particularly interested in addressing the complexities arising in non-deterministic, multi-agent domains. In this chapter, we present UMOP,1 a new universal OBDD-based planning framework for non-deterministic, multi-agent domains, which is also applicable to deterministic singleagent domains as a special case. We introduce a new planning domain description language, NADL,2 to specify non-deterministic multi-agent domains. The language contributes the explicit definition of controllable agents and uncontrollable environment agents. We describe the syntax and semantics of NADL and show how to build an efficient OBDD-based representation of an NADL description. The UMOP planning system uses NADL and different OBDD-based universal planning algorithms. It includes the previously developed strong and strong cyclic planning algorithms [9,10]. In addition, we introduce our new optimistic planning algorithm, which relaxes optimality guarantees and generates plausible universal plans in some domains where no strong or strong cyclic solution exist. We present empirical results from domains ranging from deterministic and single-agent with no environment actions to nondeterministic and multi-agent with complex environment actions. UMOP is shown to be a rich and efficient planning system.

#*Combibining Artificial Intelligence and Databases for Data Integration.
#@Alon Y. Levy
#year1999
#confArtificial Intelligence Today
#citation5
#index3092
#arnetid3094
#%176405
#%644054
#%949523
#%567106
#%598003
#%303895
#%597965
#%544778
#%1064640
#%982076
#%299384
#%176255
#%654461
#%544838
#%544868
#%12393
#%598401
#%12172
#%299694
#%29623
#%598409
#%29679
#%544986
#%62589
#%642559
#%115799
#%598807
#%642702
#%389230
#%643119
#%832780
#%643121
#%643475
#%390118
#%390119
#%160119
#%176617
#%1113610
#%599872
#%643933
#!Data integration is a problem at the intersection of the fields of Artificial Intelligence and Database Systems. The goal of a data integration system is to provide a uniform interfacc to a multitude of data sources, whether they are within one enterprise or on the World-Wide Web. The key challenges in data integration arise because the data sources being integrated have been designed independently for autonomous applications, and their contents are related in subtle ways. As a result, a data integration system requires rich formalisms for describing contents of data sources and relating between contents of different sources. This paper discusses works aimed at applying techniques from Artificial Intelligence to the problem of data integration. In addition to employing Knowledge Representation techniques for describing contents of information sources, projects have also made use of Machine Learning techniques for extracting data from sources and planning techniques for query optimization. The paper also outlines future opportunities for applying AI techniques in the context of data integration.

#*``Underwater Love'': Building Tristão and Isolda`s Personalities.
#@Carlos Martinho,Ana Paiva
#year1999
#confArtificial Intelligence Today
#citation10
#index3093
#arnetid3095
#%520753
#%29562
#%29735
#%520757
#%1043146
#%520760
#%520763

#*An Oz-Centric Review of Interactive Drama and Believable Agents.
#@Michael Mateas
#year1999
#confArtificial Intelligence Today
#citation248
#index3094
#arnetid3096
#!Believable agents are autonomous agents that exhibit rich personalities. Interactive dramas take place in virtual worlds inhabited by believable agents with whom an audience interacts. In the course of this interaction, the audience experiences a story. This paper presents the research philosophy behind the Oz Project, a research group at CMU that has spent the last ten years studying believable agents and interactive drama. The paper then surveys current work from an Oz perspective.

#*Robots with the Best of Intentions.
#@Simon Parsons,Ola Pettersson,Alessandro Saffiotti,Michael Wooldridge
#year1999
#confArtificial Intelligence Today
#citation11
#index3095
#arnetid3097
#%744537
#%388653
#%874746
#%389266
#%745789
#%565900
#%56953
#!Intelligent mobile robots need the ability to integrate robust navigation facilities with higher level reasoning. This paper is an attempt at combining results and techniques from the areas of robot navigation and of intelligent agency. We propose to integrate an existing navigation system based on fuzzy logic with a deliberator based on the so-called BDI model. We discuss some of the subtleties involved in this integration, and illustrate it on a simulated example. Experiments on a real mobile robot are under way.

#*Agent-Based Project Management.
#@Charles J. Petrie,Sigrid Goldmann,Andreas Raquet
#year1999
#confArtificial Intelligence Today
#citation50
#index3096
#arnetid3098
#%132504
#%121696
#%744638
#%845708
#%659723
#%3327
#%875001
#%1120267
#%875267
#!Integrated project management means that design and construction planning are interleaved with plan execution, allowing both the design and plan to be changed as necessary. This requires that the right effects of change need to be propagated through the plan and design. When this is distributed among designers and planners, no one may have all of the information to perform such propagation and it is important to identify what effects should be propagated to whom, and when. We describe a set of dependencies among plan and design elements that allow such notification by a set of message-passing software agents. The result is to provide a novel level of computer support for complex projects.

#*A System for Defeasible Argumentation, with Defeasible Priorities.
#@Henry Prakken,Giovanni Sartor
#year1999
#confArtificial Intelligence Today
#citation67
#index3097
#arnetid3099
#!Inspired by legal reasoning, this paper presents an argument-based system for defeasible reasoning, with a logic-programming-like language, and based on Dung's argumentation-theoretic approach to the semantics of logic programming. The language of the system has both weak and explicit negation, and conflicts between arguments are decided with the help of priorities on the rules. These priorities are not fixed, but are themselves defeasibly derived as conclusions within the system.

#*Handling Uncertainty in Control of Autonomous Robots.
#@Alessandro Saffiotti
#year1999
#confArtificial Intelligence Today
#citation18
#index3098
#arnetid3100
#%1496571
#%631991
#%388599
#%745329
#%816201
#%748138
#%904026
#%632820
#%745789
#%565900
#%390496
#!Autonomous robots need the ability to move purposefully and without human intervention in real-world environments that have not been specifically engineered for them. These environments are characterized by the pervasive presence of uncertainty: the need to cope with this uncertainty constitutes a major challenge for autonomous robots. In this note, we discuss this challenge, and present some specific solutions based on our experience on the use of fuzzy logic in mobile robots. We focus on three issues: how to realize robust motion control; how to flexibly execute navigation plans; and how to approximately estimate the robot's location.

#*The Event Calculus Explained.
#@Murray Shanahan
#year1999
#confArtificial Intelligence Today
#citation252
#index3099
#arnetid3101
#%744251
#%745025
#%389151
#%984555
#%174397
#%390556
#%746036
#!This article presents the event calculus, a logic-based formalism for representing actions and their effects. A circumscriptive solution to the frame problem is deployed which reduces to monotonic predicate completion. Using a number of benchmark examples from the literature, the formalism is shown to apply to a variety of domains, including those featuring actions with indirect effects, actions with nondeterministic effects, concurrent actions, and continuous change.

#*Towards a Logic Programming Infrastructure for Internet Programming.
#@Paul Tarau,Verónica Dahl
#year1999
#confArtificial Intelligence Today
#citation1
#index3100
#arnetid3102
#%1127335
#%507617
#%1124238
#%1073504
#%559865
#%256465
#%137833
#%1123908
#%543362
#%660042
#%51572
#%90501
#%1123855
#!After reviewing a number of Internet tools and technologies originating in the field of logic programming and discussing promissing directions of ongoing research, we describe a logic programming based networking infrastructure which combines reasoning and knowledge processing with flexible coordination of dynamic state changes and computation mobility, as well as and its use for the design of intelligent mobile agent programs. A lightweight logic programming language, Jinni, implemented in Java is introduced as a flexible scripting tool for gluing together knowledge processing components and Java objects in networked client/server applications and thin client environments as well as through applets over the Web. Mobile threads, implemented by capturing first order continuations in a compact data structure sent over the network, allow Jinni to interoperate with remote high performance BinProlog servers for CPU-intensive knowledge processing. A Controlled Natural Language to Prolog translator with support of third party speech recognition and text-to-speech translation allows interaction with users not familiar with logic programming.

#*Towards Autonomous, Perceptive, and Intelligent Virtual Actors.
#@Daniel Thalmann,Hansrudi Noser
#year1999
#confArtificial Intelligence Today
#citation25
#index3101
#arnetid3103
#%70531
#%1136423
#%593841
#%807880
#%594018
#%593656
#!This paper explains methods to provide autonomous virtual humans with the skills necessary to perform stand-alone role in films, games and interictive television. We present current research developments in the Virtual Life of autonomous synthetic actors. After a brief description of our geometric. physical, and auditory Virtual Environments, we introduce the perception action principles with a few simple examples. We emphasize the concept of virtual sensors for virtual humans. In particular, we describe our experiences in implementing virtual sensors such as vision sensors, tactile sensors, and hearing sensors. We then describe knowledge-based navigation. knowledge-based locomotion and in more details sensor-based tennis.

#*Temporally Invariant Junction Tree for Interference in Dynamic Bayesian Network.
#@Yang Xiang
#year1999
#confArtificial Intelligence Today
#citation1
#index3102
#arnetid3104
#!Dynamic Bayesian networks (DBNs) extend Bayesian networks from static domains to dynamic domains. The only known generic method for exact inference in DBNs is based on dynamic expansion and reduction of active slices. It is effective when the domain evolves relatively slowly, but is reported to be "too expensive" for fast evolving domain where inference is under time pressure. This study explores the stationary feature of problem domains to improve the efficiency of exact inference in DBNs. We propose the construction of a temporally invariant template of a DBN directly supporting exact inference and discuss issues in the construction. This method eliminates the need for the computation associated with dynamic expansion and reduction of the existing method. The method is demonstrated by experimental result.

#*Termersetzungssysteme : Grundlagen der Prototyp-Generierung algebraischer Spezifikationen
#@Klaus Drosten
#year1989
#confInformatik-Fachberichte
#citation9
#index3103
#arnetid3105

#*The Programming Language Ada Reference Manual, Proposed Standard Document, United States Department of Defense
#@
#year1981
#confLecture Notes in Computer Science
#citation0
#index3104
#arnetid3106

#*PREMO: A Framework for Multimedia Middleware - Specification, Rationale, and Java Binding
#@David J. Duke,Ivan Herman,M. Scott Marshall
#year1999
#confLecture Notes in Computer Science
#citation9
#index3105
#arnetid3107
#%1011259
#%502675
#%2608
#%116266
#%373351
#%172998
#%1011139
#%1073371
#%1133765
#%893899
#%2617
#%2621
#%2606
#%786026
#%522443
#%793483
#%2595
#%776993

#*The Programming Language Ada Reference Manual, American National Standards Institute, Inc., ANSI/MIL-STD-1815A-1983
#@
#year1983
#confLecture Notes in Computer Science
#citation0
#index3106
#arnetid3108

#*Software-Architekturen für verteilte Systeme
#@Schahram Dustdar,Harald Gall,Manfred Hauswirth
#year2003
#conf
#citation55
#index3107
#arnetid3109

#*Least Squares Orthogonal Distance Fitting of Curves and Surfaces in Space
#@Sung Joon Ahn
#year2004
#confLecture Notes in Computer Science
#citation52
#index3108
#arnetid3110

#*Architecture of Distributed Computer Systems
#@Gregor von Bochmann
#year1979
#confLecture Notes in Computer Science
#citation16
#index3109
#arnetid3111

#*Unobstructed Shortest Paths in Polyhedral Environments
#@Varol Akman
#year1987
#confLecture Notes in Computer Science
#citation28
#index3110
#arnetid3112

#*Exploitation of Fine-Grain Parallelism.
#@Günter Böckle
#year1995
#confLecture Notes in Computer Science
#citation4
#index3111
#arnetid3113

#*Relational Database Technology
#@Suad Alagic
#year1986
#conf
#citation-1
#index3112
#arnetid3114

#*Mikroarchitekturen und Mikroprogrammierung: Formale Beschreibung und Optimierung
#@Arndt Bode
#year1984
#confInformatik-Fachberichte
#citation2
#index3113
#arnetid3115

#*Object-Oriented Database Programming
#@Suad Alagic
#year1989
#conf
#citation0
#index3114
#arnetid3116

#*A Tight, Practical Integration of Relations and Functions.
#@Harold Boley
#year1999
#confLecture Notes in Computer Science
#citation10
#index3115
#arnetid3117

#*The Design of Well-Structured and Correct Programs
#@Suad Alagic,Michael A. Arbib
#year1978
#conf
#citation103
#index3116
#arnetid3118

#*Cooperative Interfaces to Information Systems
#@Leonard Bolc,Matthias Jarke
#year1986
#confTopics in Information Systems
#citation19
#index3117
#arnetid3119

#*Symbolic Algebraic Methods and Verification Methods
#@Gotz Alefeld,Jiri Rohn,Siegfried M. Rump,Tetsuro Yamamoto
#year2001
#conf
#citation4
#index3118
#arnetid3120

#*The Classical Decision Problem
#@Egon Börger,Erich Grädel,Yuri Gurevich
#year1997
#confPerspectives in Mathematical Logic
#citation537
#index3119
#arnetid3121

#*Reasoning with Logic Programming
#@José Júlio Alferes,Luís Moniz Pereira
#year1996
#confLecture Notes in Computer Science
#citation123
#index3120
#arnetid3122

#*Abstract State Machines. A Method for High-Level System Design and Analysis
#@Egon Börger,Robert F. Stärk
#year2003
#conf
#citation593
#index3121
#arnetid3123

#*Incremental Speech Translation.
#@Jan W. Amtrup
#year1999
#confLecture Notes in Computer Science
#citation20
#index3122
#arnetid3124
#%1495577
#%479395
#%951441
#%484304
#%159
#%745807
#%744505
#%477655
#%533977
#%477771
#%138478
#%808383
#%832504
#%815502
#%609901
#%797654
#%165035
#%165885
#%391177
#%390454
#%390421
#%389869
#%832761
#%797531
#%2020
#%1123229
#%797267
#%797573
#%21123
#%108055
#%19899
#%106785
#%41639
#%106709
#%107155
#%41579
#%41430
#%21559
#%107497
#%108170
#%41745
#%107435
#%107154
#%106749
#%21068
#%107222
#%107113
#%107722
#%107047
#%107886
#%20249
#%20608
#%163316
#%108335
#%107116
#%108204
#%19946
#%20912
#%107114
#%21654
#%107751
#%106818
#%163669
#%107452
#%108392
#%163545
#%21208
#%108117
#%21370
#%19927
#%21286
#%108386
#%20962
#%106873
#%163788
#%107885

#*A Resolution Principle for a Logic with Restricted Quantifiers
#@Hans-Jürgen Bürckert
#year1991
#confLecture Notes in Computer Science
#citation43
#index3123
#arnetid3125

#*Multimedia Databases in Perspective
#@Peter M. G. Apers,Henk M. Blanken,Maurice A. W. Houtsma
#year1997
#conf
#citation54
#index3124
#arnetid3126

#*Co-oP, A Group Decision Support System for Cooperative Multiple Criteria Group Decision Making
#@Tung X. Bui
#year1987
#confLecture Notes in Computer Science
#citation141
#index3125
#arnetid3127

#*Propositional, Probabilistic and Evidential Reasoning: Integrating Numerical and Symbolic Approaches
#@Weiru Liu
#year2001
#confStudies in Fuzziness and Soft Computing
#citation7
#index3126
#arnetid3128

#*Von Datenbanken zu Expertensystemen
#@Hans-Jürgen Appelrath
#year1985
#confInformatik-Fachberichte
#citation-1
#index3127
#arnetid3129

#*Automatic Verification of Sequential Infinite-State Processes
#@Olaf Burkart
#year1997
#confLecture Notes in Computer Science
#citation14
#index3128
#arnetid3130
#%70756
#%559509
#%559560
#%70776
#%211221
#%62072
#%3421
#%888078
#%559536
#%113984
#%79342
#%114285
#%114175
#%520568
#%114561
#%114231
#%114472
#%114173
#%79410
#%79340
#%114171
#%114234
#%268547
#%493277
#%269028
#%267695
#%267515
#%269257
#%1089630
#%1089042
#%720
#%70733
#%931471
#%740594
#%694
#%698
#%529880
#%1123432
#%2595
#%1059099
#%210930

#*R/3 Einführung: Methoden und Werkzeuge
#@Hans-Jürgen Appelrath,Jörg Ritter
#year2000
#conf
#citation-1
#index3129
#arnetid3131

#*A Review of Ada Tasking
#@Alan Burns,Andrew M. Lister,Andy J. Wellings
#year1987
#confLecture Notes in Computer Science
#citation38
#index3130
#arnetid3132

#*SAP R/3 Implementation: Methods and Tools
#@Hans-Jürgen Appelrath,Jörg Ritter
#year2000
#conf
#citation22
#index3131
#arnetid3133

#*Generierung natürlicher Sprache mit Generalisierten Phrasenstruktur-Grammatiken
#@Stephan Busemann
#year1992
#confInformatik-Fachberichte
#citation-1
#index3132
#arnetid3134
#!This dissertation describes NL generation with generalized phrase structure grammars (GPSG). It thoroughly discusses the theory of GPSG and argues that it can, in its 1985 version, not efficiently be implemented. Therefore, some modifications are suggested that overcome this problem. Using the modified formalism, two different approaches to GPSG-based generation are presented. The grammar-driven approach is shown to suffer from indeterminism, whereas the structure-driven approach can be efficiently implemented. The latter method has been explored within the Berlin machine translation system, where the generator starts from sentence-semantic input structures designed for transfer. Since the semantics is not integrated into the grammar, an explicit mapping from partial semantic onto syntactic structures is necessary, which is accomplished by using techniques known from AI production systems. Both generators allow for multilingual generation, which is demonstrated for English and German.

#*Querying Databases Privately: A New Approach to Private Information Retrieval
#@Dmitri Asonov
#year2004
#confLecture Notes in Computer Science
#citation15
#index3133
#arnetid3135

#*PORTAL Language Description - Second, Extended Edition
#@Arnold Businger
#year1985
#confLecture Notes in Computer Science
#citation13
#index3134
#arnetid3136

#*LOGIDATA+: Deductive Databases with Complex Objects
#@Paolo Atzeni
#year1993
#confLecture Notes in Computer Science
#citation15
#index3135
#arnetid3137

#*B2B Integration: Concepts and Architecture
#@Christoph Bussler
#year2003
#conf
#citation189
#index3136
#arnetid3138

#*Ada 95 Quality and Style, Guideline for Professional Programmers
#@Christine Ausnit-Hood,Kent A. Johnson,Robert G. Pettit IV,Steven B. Opdahl
#year1997
#confLecture Notes in Computer Science
#citation-1
#index3137
#arnetid3139

#*Fundamental Algorithms for Permutation Groups
#@Gregory Butler
#year1991
#confLecture Notes in Computer Science
#citation120
#index3138
#arnetid3140

#*Interactive Relational Database design - A Logic Programming Implementation
#@Tapan P. Bagchi,Vinay K. Chaudhri
#year1989
#confLecture Notes in Computer Science
#citation-1
#index3139
#arnetid3141

#*Computer Science Today: Recent Trends and Developments
#@Jan van Leeuwen
#year1995
#confLecture Notes in Computer Science
#citation112
#index3140
#arnetid3142

#*The MOSIX Distributed Operating System - Load Balancing for UNIX
#@Amnon Barak,Shai Guday,Richard G. Wheeler
#year1993
#confLecture Notes in Computer Science
#citation190
#index3141
#arnetid3143

#*Tractable Reasoning in Artificial Intelligence
#@Marco Cadoli
#year1995
#confLecture Notes in Computer Science
#citation33
#index3142
#arnetid3144

#*Mental Representation and Processing of Geographic Knowledge - A Computational Approach
#@Thomas Barkowsky
#year2002
#confLecture Notes in Computer Science
#citation26
#index3143
#arnetid3145

#*The Concurrency Control Problem for Database Systems
#@Marco A. Casanova
#year1981
#confLecture Notes in Computer Science
#citation77
#index3144
#arnetid3146

#*Ada 95 Rationale, The Language, The Standard Libraries
#@John G. P. Barnes
#year1997
#confLecture Notes in Computer Science
#citation-1
#index3145
#arnetid3147

#*Logic Programming and Databases
#@Stefano Ceri,Georg Gottlob,Letizia Tanca
#year1990
#conf
#citation803
#index3146
#arnetid3148

#*A Survey of Verification Techniques for Parallel Programs
#@Howard Barringer
#year1985
#confLecture Notes in Computer Science
#citation28
#index3147
#arnetid3149

#*Time Series Package (TSPACK)
#@François S. Chaghaghi
#year1985
#confLecture Notes in Computer Science
#citation5
#index3148
#arnetid3150

#*Entzifferte Geheimnisse: Methoden und Maximen der Kryptologie, 3. Auflage
#@Friedrich L. Bauer
#year2000
#conf
#citation-1
#index3149
#arnetid3151

#*Parallel Execution of Parlog
#@Andrew Cheese
#year1992
#confLecture Notes in Computer Science
#citation2
#index3150
#arnetid3152

#*Entzifferte Geheimnisse: Methoden und Maximen der Kryptologie, 2. Auflage
#@Friedrich L. Bauer
#year1997
#conf
#citation-1
#index3151
#arnetid3153

#*Mapping Scientific Frontiers: The Quest for Knowledge Visualization
#@Chaomei Chen
#year2003
#conf
#citation31
#index3152
#arnetid3154

#*The Munich Project CIP, Volume I: The Wide Spectrum Language CIP-L
#@Friedrich L. Bauer,Rudolf Berghammer,Manfred Broy,Walter Dosch,Franz Geiselbrechtinger,Rupert Gnatz,E. Hangel,Wolfgang Hesse,Bernd Krieg-Brückner,Alfred Laut,Thomas Matzner,Bernhard Möller,Friederike Nickl,Helmuth Partsch,Peter Pepper,Klaus Samelson,Martin Wirsing,Hans Wössner
#year1985
#confLecture Notes in Computer Science
#citation88
#index3153
#arnetid3155

#*Information Visualisation and Virtual Environments
#@Chaomei Chen
#year1999
#conf
#citation2
#index3154
#arnetid3156

#*The Munich Project CIP, Volume II: The Program Transformation System CIP-S
#@Friedrich L. Bauer,Herbert Ehler,A. Horsch,Bernhard Möller,Helmuth Partsch,O. Paukner,Peter Pepper
#year1987
#confLecture Notes in Computer Science
#citation-1
#index3155
#arnetid3157

#*A Guide to Modula-2
#@Kaare Christian
#year1986
#conf
#citation6
#index3156
#arnetid3158

#*Mobile Agents: Control Algorithms
#@Joachim Baumann
#year2000
#confLecture Notes in Computer Science
#citation23
#index3157
#arnetid3159

#*Modelling in Molecular Biology
#@Gabriel Ciobanu,Grzegorz Rozenberg
#year2004
#confNatural Computing Series
#citation-1
#index3158
#arnetid3160

#*Software-Bewertung: Ein semantischer Ansatz für Infomationsmaße
#@Peter Baumann
#year1992
#confInformatik-Fachberichte
#citation-1
#index3159
#arnetid3161

#*Active Visual Inference of Surface Shape
#@Roberto Cipolla
#year1996
#confLecture Notes in Computer Science
#citation47
#index3160
#arnetid3162

#*Theory Reasoning in Connection Calculi
#@Peter Baumgartner
#year1998
#confLecture Notes in Computer Science
#citation3
#index3161
#arnetid3163

#*Programming in Prolog
#@W. F. Clocksin,Chris Mellish
#year1981
#conf
#citation3321
#index3162
#arnetid3164

#*Zur Logik der Logik-Programmierung: Ein konstruktiver Ansatz
#@Clemens Beckstein
#year1988
#confInformatik-Fachberichte
#citation0
#index3163
#arnetid3165

#*Programming in Prolog, 2nd Edition
#@W. F. Clocksin,Chris Mellish
#year1984
#conf
#citation-1
#index3164
#arnetid3166

#*Concepts in User Interfaces: A Reference Model for the Command and Response Languages (By Members of IFIP WG2.7)
#@David Beech
#year1986
#confLecture Notes in Computer Science
#citation-1
#index3165
#arnetid3167

#*Programming in Prolog, 3rd Edition
#@W. F. Clocksin,Chris Mellish
#year1987
#conf
#citation-1
#index3166
#arnetid3168

#*Concepts, Design, and Performance Analysis of a Parallel Prolog Machine
#@Joachim Beer
#year1989
#confLecture Notes in Computer Science
#citation14
#index3167
#arnetid3169

#*Prolog by Example: How to Learn, Teach and Use It
#@Helder Coelho,Jose Carlos Cotta
#year1988
#conf
#citation24
#index3168
#arnetid3170

#*Concurrent Reactive Plans, Anticipation and Forestalling Execution Failures
#@Michael Beetz
#year2000
#confLecture Notes in Computer Science
#citation8
#index3169
#arnetid3171
#%745578
#%745091
#%745297
#%745750
#%745365
#%747825
#%15458
#%747967
#%174344
#%174345
#%477363
#%12137
#%744259
#%164575
#%1062666
#%745907
#%479655
#%479675
#%14043
#%745263
#%950122
#%744589
#%1025257
#%388653
#%388104
#%388821
#%389412
#%388026
#%388404
#%390496
#%387838
#%387664
#%388417
#%387783
#%738239
#%747629
#%919994
#%621465
#!Autonomous robots that accomplish their jobs in partly unknown and changing environments often learn important information while carrying out their jobs. To be reliable and effcient, they have to act appropriately in novel situations and respond immediately to unpredicted events. They also have to reconsider their intended course of action when it is likely to have flaws. For example, whenever a robot detects another robot, it should predict that robot's effect on its plan and -- if necessary -- revise its plan to make it more robust. To accomplish these patterns of activity we equip robots with structured reactive plans (SRPs), concurrent control programs that can not only be interpreted but also reasoned about and manipulated. These plans specify how the robot is to respond to sensory input in order to accomplish its jobs. In this book we describe a computational model of forestalling common flaws in autonomous robot behavior. To this end, we develop a representation for SRPs in which declarative statements for goals, perceptions, and beliefs make the structure and purpose of SRPs explicit and thereby simplify and speed up reasoning about SRPs and their projections. We have also developed a notation for transforming SRPs, which does not only make the physical effects of plan execution explicit, but also the process of plan interpretation, as well as temporal, causal, and teleological relationships among plan interpretation, the world, and the physical behavior of the robot. Using this notation a planning system can diagnose and forestall common flaws in robot plans that cannot be dealt with in other planning representations. Finally, we have extended the language for writing SRPs with constructs that allow for a flexible integration of planning and execution and thereby turned it into a single high-level language that can handle both planning and execution actions. Experiments in a simulated world show that by simultaneously forestalling flaws and executing SRPs, the robot can perform its jobs more reliably than, and almost as effciently as, it could using fixed control programs.

#*Large Sparse Numerical Optimization
#@Thomas F. Coleman
#year1984
#confLecture Notes in Computer Science
#citation63
#index3170
#arnetid3172

#*Plan-Based Control of Robotic Agents: Improving the Capabilities of Autonomous Robots
#@Michael Beetz
#year2002
#confLecture Notes in Computer Science
#citation9
#index3171
#arnetid3173
#%744514
#%12778
#%746012
#%29892
#%1026268
#%29634
#%516586
#%745578
#%1062621
#%745091
#%745297
#%13596
#%12846
#%15458
#%744787
#%477381
#%477657
#%11996
#%632812
#%174357
#%478120
#%478187
#%174344
#%13030
#%477363
#%516409
#%12137
#%29749
#%95318
#%29994
#%29913
#%13767
#%745167
#%29873
#%29748
#%745550
#%738565
#%874542
#%564971
#%1009556
#%874907
#%744259
#%745907
#%14043
#%388653
#%388570
#%390103
#%391136
#%389380
#%389742
#%390496
#%387838
#%390627
#%387829
#%388417
#%738239

#*An Introduction to the PL/CV2 Programming Logic
#@Robert L. Constable,Scott Johnson,C. D. Eichenlaub
#year1982
#confLecture Notes in Computer Science
#citation28
#index3172
#arnetid3174

#*Hierarchical Neural Networks for Image Interpretation
#@Sven Behnke
#year2003
#confLecture Notes in Computer Science
#citation31
#index3173
#arnetid3175

#*Erfahrung und Berechnung: Kritik der Expertensystemtechnik
#@Wolfgang Coy,Lena Bonsiepen
#year1989
#confInformatik-Fachberichte
#citation22
#index3174
#arnetid3176

#*Korrekte Zugriffe zu verteilten Daten
#@Heinz Bender
#year1983
#confInformatik-Fachberichte
#citation0
#index3175
#arnetid3177

#*The Data Mining and Knowledge Discovery Handbook.
#@Oded Maimon,Lior Rokach
#year2005
#conf
#citation111
#index3176
#arnetid3178

#*Dynamische nicht-normalisierte Relationen und symbolische Bildbeschreibung
#@Wolfgang Benn
#year1986
#confInformatik-Fachberichte
#citation0
#index3177
#arnetid3179

#*Indexstrukturen in Datenbanksystemen
#@Gabriele Blankenagel
#year1992
#confInformatik-Fachberichte
#citation-1
#index3178
#arnetid3180

#*Automatic Generation of Computer Animation: Using AI for Movie Animation
#@Ruqian Lu,Songmao Zhang
#year2002
#confLecture Notes in Computer Science
#citation14
#index3179
#arnetid3181

#*Systems of Reductions
#@Benjamin Benninghofen,Susanne Kemmerich,Michael M. Richter
#year1987
#confLecture Notes in Computer Science
#citation46
#index3180
#arnetid3182

#*Queueing Networks with Discrete Time Scale - Explicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks
#@Hans Daduna
#year2001
#confLecture Notes in Computer Science
#citation12
#index3181
#arnetid3183
#%951530
#%949824
#%950875
#%1047929
#%1048285
#%1048206
#%1047832
#%1048007
#%1036771
#%1036863
#%1048512
#%1037063
#%1036852
#%504365
#%65775
#%1036611
#%770425
#%1036768
#%1128356
#%1048399
#%1037195
#%1047965
#%1047961
#%1047984

#*Ray Shooting, Depth Orders and Hidden Surface Removal
#@Mark de Berg
#year1993
#confLecture Notes in Computer Science
#citation3
#index3182
#arnetid3184

#*The Design of Rijndael: AES - The Advanced Encryption Standard
#@Joan Daemen,Vincent Rijmen
#year2002
#conf
#citation981
#index3183
#arnetid3185

#*Statistical Decision Theory and Bayesian Analysis, 2nd Edition.
#@James O. Berger
#year1985
#conf
#citation-1
#index3184
#arnetid3186

#*Entwurf und Verifikation mikroprogrammierter Rechnerarchitekturen
#@Werner Damm
#year1987
#confInformatik-Fachberichte
#citation3
#index3185
#arnetid3187

#*Experience Management: Foundations, Development Methodology, and Internet-Based Applications
#@Ralph Bergmann
#year2002
#confLecture Notes in Computer Science
#citation155
#index3186
#arnetid3188
#%284302
#%98687
#%951766
#%951738
#%3189
#%746412
#%3584
#%172333
#%2358
#%746401
#%1009626
#%180622
#%375069
#%477834
#%477843
#%373786
#%200114
#%200119
#%284408
#%200066
#%284449
#%199945
#%199887
#%284278
#%284410
#%643698
#%284396
#%199980
#%284133
#%284273
#%284129
#%284159
#%284342
#%199987
#%643691
#%284181
#%284451
#%642599
#%199952
#%199939
#%284196
#%200167
#%200113
#%200080
#%199941
#%299494
#%268566
#%845708
#%874404
#%748618
#%1009791
#%1364939
#%929200
#%807584
#%1071669
#%172113
#%892537
#%1121280
#%769973
#%1009856
#%1009199
#%745174
#%771075
#%697
#%117359
#%362821
#%447324
#%1064426
#%209996
#%816221
#%825584
#%388404
#%390685
#%387838
#%191
#%747716

#*MetaSoft Primer, Towards a Metalanguage for Applied Denotational Semantics
#@Andrzej Blikle
#year1987
#confLecture Notes in Computer Science
#citation3
#index3187
#arnetid3189

#*Efficient Query Processing in Geographic Information Systems
#@Beng Chin Ooi
#year1990
#confLecture Notes in Computer Science
#citation98
#index3188
#arnetid3190

#*Developing Industrial Case-Based Reasoning Applications: The INRECA-Methodology
#@Ralph Bergmann,Klaus-Dieter Althoff,Sean Breen,Mehmet H. Göker,Michel Manago,Ralph Traphöner,Stefan Wess
#year1999
#confLecture Notes in Computer Science
#citation171
#index3189
#arnetid3191

#*The Logic System of Concept Graphs with Negation And Its Relationship to Predicate Logic
#@Frithjof Dau
#year2003
#confLecture Notes in Computer Science
#citation27
#index3190
#arnetid3192

#*How to Multiply Matrices Faster
#@Victor Y. Pan
#year1984
#confLecture Notes in Computer Science
#citation97
#index3191
#arnetid3193

#*Managing Information Highways - The PRISM Book: Principles, Methods, and Case Studies for Designing Telecommunications Management Systems
#@Kim Berquist,Andrew Berquist
#year1996
#confLecture Notes in Computer Science
#citation2
#index3192
#arnetid3194

#*On the Integration of Algebraic Functions
#@James H. Davenport
#year1981
#confLecture Notes in Computer Science
#citation100
#index3193
#arnetid3195

#*Intelligent Data Analysis, An Introduction, 2nd editon
#@Michael R. Berthold,David J. Hand
#year2003
#conf
#citation341
#index3194
#arnetid3196

#*The Adaptation of Virtual Man-Computer Interfaces to User Requirements in Dialogs
#@Waltraud Dehning,Eidrun Essig,Susanne Maaß
#year1981
#confLecture Notes in Computer Science
#citation34
#index3195
#arnetid3197

#*Public-Key Cryptography: State of the Art and Future Directions, E.I.S.S. Workshop, Oberwolfach, Germany, July 3-6, 1991, Final Report
#@Thomas Beth,Markus Frisch,Gustavus J. Simmons
#year1992
#confLecture Notes in Computer Science
#citation0
#index3196
#arnetid3198

#*Introduction to Cryptography: Principles and Applications
#@Hans Delfs,Helmut Knebl
#year2002
#conf
#citation129
#index3197
#arnetid3199
#!Due to the rapid growth of digital communication and electronic data exchange, information security has become a crucial issue in industry, business, and administration. Modern cryptography provides essential techniques for securing information and protecting data. In the first part, this book covers the key concepts of cryptography on an undergraduate level, from encryption and digital signatures to cryptographic protocols. Essential techniques are demonstrated in protocols for key exchange, user identification, electronic elections and digital cash. In the second part, more advanced topics are addressed, such as the bit security of one-way functions and computationally perfect pseudo random bit generators. The security of cryptographic schemes is a central topic. Typical examples of provably secure encryption and signature schemes and their security proofs are given. Though particular attention is given to the mathematical foundations, no special background in mathematics is presumed. The necessary algebra, number theory and probability theory are included in the appendix. Each chapter closes with a collection of exercises. Answers to the exercises are provided on the Web page for this book.

#*Qualität und Testbarkeit hochintegrierter Schaltungen: Qualitätssicherung durch regelbasierte Systeme
#@Mehrdad Bidjan-Irani
#year1989
#confInformatik-Fachberichte
#citation-1
#index3198
#arnetid3200

#*Incomplete Information: Structure, Inference, Complexity
#@Stéphane Demri,Ewa Orlowska
#year2002
#confMonographs in Theoretical Computer Science. An EATCS Series
#citation61
#index3199
#arnetid3201
#!:This monograph presents a systematic, exhaustive and up-to-date overview of formal methods and theories for data analysis and inference inspired by the concept of rough set. The book studies structures with incomplete information from the logical, algebraic and computational perspective. The formalisms developed are non-invasive in that only the actual information is needed in the process of analysis without external sources of information being required. The book is intended for researchers, lecturers and graduate students who wish to get acquainted with the rough set style approach to information systems with incomplete information.

#*Algebraic System Specification and Development - A Survey and Annotated Bibliography
#@Michel Bidoit,Hans-Jorg Kreowski,Pierre Lescanne,Fernando Orejas,Donald Sannella
#year1991
#confLecture Notes in Computer Science
#citation-1
#index3200
#arnetid3202

#*Attribute Grammars: Definitions, Systems, and Bibliography.
#@Pierre Deransart,Martin Jourdan,Bernard Lorho
#year1988
#confLecture Notes in Computer Science
#citation127
#index3201
#arnetid3203

#*Casl User Manual - Introduction to Using the Common Algebraic Specification Language
#@Michel Bidoit,Peter D. Mosses
#year2004
#confLecture Notes in Computer Science
#citation27
#index3202
#arnetid3204

#*Das ist Informatik
#@Jorg Desel
#year2001
#conf
#citation11
#index3203
#arnetid3205

#*Semirings for Soft Constraint Solving and Programming
#@Stefano Bistarelli
#year2004
#confLecture Notes in Computer Science
#citation53
#index3204
#arnetid3206

#*Combinatorics on Traces
#@Volker Diekert
#year1990
#confLecture Notes in Computer Science
#citation143
#index3205
#arnetid3207

#*Automatische Synthese rekursiver Programme als Beweisverfahren
#@Susanne Biundo
#year1992
#confInformatik-Fachberichte
#citation4
#index3206
#arnetid3208

#*Flexible, realzeitfähige Kollisionsvermeidung in Mehrroboter-Systemen
#@Ulrich Borgolte
#year1991
#confInformatik-Fachberichte
#citation-1
#index3207
#arnetid3209

#*Ein universelles Konzept zum flexiblen Informationsschutz in und mit Rechensystemen
#@Klaus R. Dittrich
#year1983
#confInformatik-Fachberichte
#citation2
#index3208
#arnetid3210

#*Integrity Primitives for Secure Information Systems, Final Report of RACE Integrity Primitives Evaluation RIPE-RACE 1040
#@Antoon Bosselaers,Bart Preneel
#year1995
#confLecture Notes in Computer Science
#citation3
#index3209
#arnetid3211

#*Primality Testing in Polynomial Time, From Randomized Algorithms to "PRIMES Is in P"
#@Martin Dietzfelbinger
#year2004
#confLecture Notes in Computer Science
#citation27
#index3210
#arnetid3212

#*Network Calculus: A Theory of Deterministic Queuing Systems for the Internet
#@Jean-Yves Le Boudec,Patrick Thiran
#year2001
#confLecture Notes in Computer Science
#citation468
#index3211
#arnetid3213

#*Mathematik für Informatiker I: Die Methode der Mathematik
#@Bruno Buchberger,Franz Lichtenberger
#year1980
#confInformatik-Fachberichte
#citation-1
#index3212
#arnetid3214

#*Extensions of the UNITY Methodology - Compositionality, Fairness and Probability in Parallelism
#@Josyula R. Rao
#year1995
#confLecture Notes in Computer Science
#citation8
#index3213
#arnetid3215

#*Embedded Systems Design: The ARTIST Roadmap for Research and Development
#@Bruno Bouyssounouse,Joseph Sifakis
#year2005
#confLecture Notes in Computer Science
#citation63
#index3214
#arnetid3216

#*The Stability Theory of Stream Ciphers
#@Cunsheng Ding,Guozhen Xiao,Weijuan Shan
#year1991
#confLecture Notes in Computer Science
#citation243
#index3215
#arnetid3217

#*Microcomputer Problem Solving Using Pascal
#@Kenneth L. Bowles
#year1977
#conf
#citation82
#index3216
#arnetid3218

#*Die strukturierte Analyse Markovscher Modelle
#@Peter Buchholz
#year1991
#confInformatik-Fachberichte
#citation-1
#index3217
#arnetid3219

#*Featurebasierte Integration von CAD/CAM-Systemen
#@Thomas Ruf
#year1991
#confInformatik-Fachberichte
#citation1
#index3218
#arnetid3220

#*An Optimized Translation Process and Its Application to ALGOL 68
#@Paul Branquart,Jean-Pierre Cardinael,Johan Lewi,Jean-Paul Delescaille,Michael Van Begin
#year1976
#confLecture Notes in Computer Science
#citation-1
#index3219
#arnetid3221

#*On Object-Oriented Database Systems
#@Klaus R. Dittrich,Umeshwar Dayal,Alejandro P. Buchmann
#year1991
#confTopics in Information Systems
#citation28
#index3220
#arnetid3222

#*An Analytical Description of CHILL, the CCITT High Level Language
#@Paul Branquart,Georges Louis,Pierre Wodon
#year1982
#confLecture Notes in Computer Science
#citation5
#index3221
#arnetid3223

#*Stochastic Automata: Stability, Nondeterminism, and Prediction
#@Ernst-Erich Doberkat
#year1981
#confLecture Notes in Computer Science
#citation17
#index3222
#arnetid3224

#*Modern Cryptology - A Tutorial
#@Gilles Brassard
#year1988
#confLecture Notes in Computer Science
#citation145
#index3223
#arnetid3225

#*Complementary Definitions of Programming Language Semantics
#@James E. Donahue
#year1976
#confLecture Notes in Computer Science
#citation59
#index3224
#arnetid3226

#*Massiv parallele Programmierung mit dem Parallaxis-Modell
#@Thomas Bräunl
#year1990
#confInformatik-Fachberichte
#citation6
#index3225
#arnetid3227

#*Error Detection and Recovery in Robotics
#@Bruce Randall Donald
#year1989
#confLecture Notes in Computer Science
#citation90
#index3226
#arnetid3228

#*Algebraic Specification Techniques in Object Oriented Programming Environments
#@Ruth Breu
#year1991
#confLecture Notes in Computer Science
#citation77
#index3227
#arnetid3229

#*Efficient Graph Rewriting and Its Implementation
#@Heiko Dörr
#year1995
#confLecture Notes in Computer Science
#citation48
#index3228
#arnetid3230

#*Input/Output Intensive Massively Parallel Computing - Language Support, Automatic Parallelization, Advanced Optimization, and Runtime Systems
#@Peter Brezany
#year1997
#confLecture Notes in Computer Science
#citation8
#index3229
#arnetid3231

#*Resolution Methods for the Decision Problem
#@Christian G. Fermüller,Alexander Leitsch,Tanel Tammet,N. K. Zamov
#year1993
#confLecture Notes in Computer Science
#citation81
#index3230
#arnetid3232

#*Introduction to Cryptography
#@Johannes Buchmann
#year2002
#conf
#citation169
#index3231
#arnetid3233

#*Artificial Animals for Computer Animation, Biomechanics, Locomotion, Perception, and Behavior
#@Xiaoyuan Tu
#year1999
#confLecture Notes in Computer Science
#citation91
#index3232
#arnetid3234
#%593994
#%593326
#%70602
#%594156
#%593453
#%746053
#%593092
#%593393
#%593593
#%593619
#%593656
#%593682
#%593773
#%594018
#%593708
#%594201
#%593878
#%593006
#%744259
#%594128
#%593797
#%593481
#%593841
#%593570
#%594051
#%593394
#%293770
#%390855

#*Fehlermaskierung durch verteilte Systeme
#@Klaus Echtle
#year1986
#confInformatik-Fachberichte
#citation1
#index3233
#arnetid3235

#*Entwurfstransaktionen für modulare Objektsysteme: Synchronisierung in objektorientierten Datenbanksystemen
#@Henning Eckhardt
#year1990
#confInformatik-Fachberichte
#citation-1
#index3234
#arnetid3236

#*Fundamentals of Algebraic Specification 1: Equations und Initial Semantics
#@Hartmut Ehrig,Bernd Mahr
#year1985
#confMonographs in Theoretical Computer Science. An EATCS Series
#citation1786
#index3235
#arnetid3237

#*Modellbildung, Wissensrevision und Wissensrepräsentation im Maschinellen Lernen
#@Werner Emde
#year1991
#confInformatik-Fachberichte
#citation-1
#index3236
#arnetid3238

#*Rechtsprechung und Computer in den neunziger Jahren: Am Beispiel von Begriff und Typologie der Körperschaft des Öffentlichen Rechts
#@Alfred Endrös
#year1988
#confInformatik-Fachberichte
#citation-1
#index3237
#arnetid3239

#*Simple Program Schemes and Formal Languages
#@Joost Engelfriet
#year1974
#confLecture Notes in Computer Science
#citation42
#index3238
#arnetid3240

#*Knowledge Discovery in Databases - Techniken und Anwendungen
#@Martin Ester,Jörg Sander
#year2000
#conf
#citation108
#index3239
#arnetid3241

#*Generierung portabler Compiler: Das portable System POCO
#@Michael Eulenstein
#year1988
#confInformatik-Fachberichte
#citation0
#index3240
#arnetid3242

#*Exercises in Computer Systems Analysis
#@Wolfgang Everling
#year1975
#confLecture Notes in Computer Science
#citation-1
#index3241
#arnetid3243

#*Advanced Symbolic Analysis for Compilers: New Techniques and Algorithms for Symbolic Program Analysis and Optimization
#@Thomas Fahringer,Bernhard Scholz
#year2003
#confLecture Notes in Computer Science
#citation4
#index3242
#arnetid3244
#%483183
#%1053007
#%538354
#%949671
#%988709
#%1053004
#%116
#%360688
#%1034063
#%483030
#%360287
#%546068
#%1123549
#%546049
#%542393
#%408873
#%253879
#%408597
#%411018
#%25350
#%482971
#%482926
#%482924
#%254100
#%342390
#%988708
#%548263
#%1111771
#%360162
#%1123621
#%806620
#%1125211
#%1124702
#%806359
#%773320
#%1124945
#%832796
#%653054
#%9588
#%1123498
#%542736
#%775185
#%542581
#%712
#%360202
#%546834
#%1127768
#%77
#%1073089
#%542312
#%810392
#%810808
#%546696
#%115066
#%1127730

#*Ausnahmebehandlung in objektorientierten Programmiersprachen
#@Christiane Feder
#year1990
#confInformatik-Fachberichte
#citation4
#index3243
#arnetid3245

#*Problem-Solving Methods: Understanding, Description, Development, and Reuse
#@Dieter Fensel
#year2000
#confLecture Notes in Computer Science
#citation12
#index3244
#arnetid3246

#*Foundations of Equational Logic Programming
#@Steffen Hölldobler
#year1989
#confLecture Notes in Computer Science
#citation100
#index3245
#arnetid3247

#*LUCAS Associative Array Processor: Design., Programming and Application Studies
#@Christer Fernström,Ivan Kruzela,Bertil Svensson
#year1986
#confLecture Notes in Computer Science
#citation25
#index3246
#arnetid3248

#*An Attribute Grammar for the Semantic Analysis of Ada
#@Jürgen Uhl,Sophia Drossopoulou,Guido Persch,Gerhard Goos,Manfred Dausmann,Georg Winterstein,Walter Kirchgässner
#year1982
#confLecture Notes in Computer Science
#citation39
#index3247
#arnetid3249

#*A Systematic Catalogue of Reusable Abstract Data Types
#@Jürgen Uhl,Hans Albrecht Schmid
#year1990
#confLecture Notes in Computer Science
#citation18
#index3248
#arnetid3250

#*IT-Security and Privacy - Design and Use of Privacy-Enhancing Security Mechanisms
#@Simone Fischer-Hübner
#year2001
#confLecture Notes in Computer Science
#citation93
#index3249
#arnetid3251
#%384556
#%145280
#%19261
#%1499522
#%1103588
#%558002
#%1118291
#%613748
#%807954
#%845473
#%805044
#%804116
#%95
#%805145
#%384553
#%385479
#%385592
#%119742
#%239481
#%384560
#%145380
#%376160
#%145686
#%376226
#%145302
#%189195
#%19334
#%189388
#%581032
#%775312
#%775425
#%557989
#%1103528
#%580824
#%771916
#%580891
#%772239
#%1112734
#%1113510
#%771203
#%155458
#%770637
#%173505
#%193226
#%1118598
#%770639
#%2579
#%120034
#%773003
#%985917
#%807386
#%804254

#*Specification and Compositional Verification of Real-Time Systems
#@Jozef Hooman
#year1991
#confLecture Notes in Computer Science
#citation121
#index3250
#arnetid3252

#*Datenbanksystem für CAD-Arbeitsplätze
#@W. E. Fischer
#year1983
#confInformatik-Fachberichte
#citation-1
#index3251
#arnetid3253

#*Kollisionsfreie Bahnen für Industrieroboter: Ein Planungsverfahren
#@Klaus A. Hörmann
#year1988
#confInformatik-Fachberichte
#citation-1
#index3252
#arnetid3254

#*A Collection of Test Problems for Constrained Global Optimization Problems
#@Christodoulos A. Floudas,Panos M. Pardalos
#year1990
#confLecture Notes in Computer Science
#citation13
#index3253
#arnetid3255

#*Approximative Public-Key-Kryptosysteme
#@Patrick Horster,Hartmut Isselhorst
#year1989
#confInformatik-Fachberichte
#citation1
#index3254
#arnetid3256

#*Text Mining, Theoretical Aspects and Applications
#@Jurgen Franke,Gholamreza Nakhaeizadeh,Ingrid Renz
#year2003
#conf
#citation14
#index3255
#arnetid3257

#*Parallele Algorithmen
#@Friedel Hossfeld
#year1983
#confInformatik-Fachberichte
#citation4
#index3256
#arnetid3258

#*Automatic Ambiguity Resolution in Natural Language Processing - An Empirical Approach
#@Alexander Franz
#year1996
#confLecture Notes in Computer Science
#citation25
#index3257
#arnetid3259
#!:This book introduces a new approach to the important NLP issue of automatic ambiguity resolution, based on statistical models of text. This approach is compared with previous work and proved to yield higher accuracy for natural language analysis. At the same time, an effective implementation strategy is described, which is directly useful for natural language analysis. The book is noteworthy for demonstrating a new empirical approach to NLP; it is essential reading for researchers in natural language processing or computational linguistics.

#*SIL - a Simulation Language, User's Guide
#@Niels Houbak
#year1990
#confLecture Notes in Computer Science
#citation6
#index3258
#arnetid3260

#*Mechanismen zur Synchronisation paralleler Prozesse
#@Bernd Freisleben
#year1987
#confInformatik-Fachberichte
#citation1
#index3259
#arnetid3261

#*Funktioneller Test der Auflösung von Zugriffskonflikten in Mehrrechnersystemen
#@Jürgen Hülsemann
#year1988
#confInformatik-Fachberichte
#citation-1
#index3260
#arnetid3262

#*Translating Relational Queries into Iterative Programs
#@Johann Christoph Freytag
#year1987
#confLecture Notes in Computer Science
#citation-1
#index3261
#arnetid3263

#*FM8501: A Verified Microprocessor
#@Warren A. Hunt Jr.
#year1994
#confLecture Notes in Computer Science
#citation0
#index3262
#arnetid3264

#*VOCUS: A Visual Attention System for Object Detection and Goal-Directed Search
#@Simone Frintrop
#year2006
#confLecture Notes in Computer Science
#citation0
#index3263
#arnetid3265

#*Agent-Oriented Programming, From Prolog to Guarded Definite Clauses.
#@Matthew M. Huntbach,Graem A. Ringwood
#year1999
#confLecture Notes in Computer Science
#citation8
#index3264
#arnetid3266
#%507614
#%949948
#%951441
#%950117
#%949534
#%1118170
#%951424
#%950463
#%567470
#%951269
#%950184
#%206802
#%950302
#%951000
#%949909
#%329240
#%329324
#%329326
#%28276
#%28448
#%773719
#%745143
#%543321
#%166637
#%744809
#%376204
#%166652
#%745894
#%770728
#%546469
#%546468
#%3421
#%747655
#%2473
#%173961
#%488751
#%173883
#%486373
#%488730
#%507621
#%488724
#%17685
#%529963
#%67748
#%328684
#%144700
#%492384
#%543362
#%310267
#%492354
#%605757
#%360797
#%23051
#%1028916
#%1070522
#%738680
#%418667
#%1071005
#%808255
#%1123539
#%774690
#%769674
#%773441
#%1123727
#%769676
#%773455
#%343516
#%770121
#%771704
#%773575
#%832246
#%1123685
#%771296
#%771299
#%832583
#%770799
#%772816
#%773579
#%832839
#%772814
#%772573
#%832921
#%774915
#%1123503
#%771593
#%774130
#%832504
#%418806
#%484184
#%361518
#%484108
#%1006864
#%600814
#%613058
#%546754
#%598406
#%419555
#%418651
#%1028928
#%984587
#%776369
#%74410
#%745220
#%2133
#%546834
#%538175
#%772069
#%791766
#%745719
#%1129747
#%605501
#%744899
#%1123309
#%546719
#%903728
#%522443
#%745934
#%1123932
#%770729
#%951615
#%522476
#%172886
#%3046
#%2131
#%328010
#%807464
#%3164
#%1123555
#%789973
#%989792
#%984294
#%530082
#%773456
#%1123509
#%1129773
#%172877
#%745025
#%328029
#%940606
#%1129774
#%522546
#%2595
#%953605
#%805940
#%808312
#%955008
#%745306
#%789975
#%139
#%328780
#%932401
#%775426
#%1064426
#%892453
#%387808
#%388454
#%745294
#%391338
#%391337
#%388815
#%388881
#%389697
#%390563
#%388094
#%388827
#%388404
#%387975
#%388878
#%387921
#%744355
#%387783
#%153908
#%492392
#%1025187
#%522845
#%492391
#%1067525
#%210686
#%745266
#%205147
#%1025006
#%769512
#%1024957
#%1067951
#%832199
#%2353
#%2120
#%521828
#%54
#%548491
#%984650
#%833067
#%492385
#%981035
#%595940
#%388312
#%362868
#%805894
#%1129771
#%807029
#%1082041
#%1080450

#*Ein Roboteraktionsplanungssystem
#@Bernhard J. Frommherz
#year1990
#confInformatik-Fachberichte
#citation4
#index3265
#arnetid3267

#*Formal Foundations for Software Engineeing Methods
#@Heinrich Hußmann
#year1997
#confLecture Notes in Computer Science
#citation-1
#index3266
#arnetid3268

#*Analysis of Drum and Disk Storage Units
#@Samuel H. Fuller
#year1975
#confLecture Notes in Computer Science
#citation7
#index3267
#arnetid3269

#*Parallel, Distributed and Multiagent Production Systems
#@Toru Ishida
#year1994
#confLecture Notes in Computer Science
#citation50
#index3268
#arnetid3270

#*Datenverarbeitung im Hochschulbereich der USA: Stand und Entwicklungstendenzen
#@Franz Gaffal
#year1980
#confInformatik-Fachberichte
#citation0
#index3269
#arnetid3271

#*Datenverwaltung in verteilten Systemen: Grundlagen und Lösungskonzepte
#@Stefan Jablonski
#year1990
#confInformatik-Fachberichte
#citation11
#index3270
#arnetid3272

#*Matrix Eigensystem Routines - EISPACK Guide Extension
#@Burton S. Garbow,James M. Boyle,Jack Dongarra,Cleve B. Moler
#year1977
#confLecture Notes in Computer Science
#citation323
#index3271
#arnetid3273

#*Conclog: A Methodological Approach to Concurrent Logic Programming
#@Jean-Marie Jacquet
#year1991
#confLecture Notes in Computer Science
#citation12
#index3272
#arnetid3274

#*On the Shape of Mathematical Arguments
#@A. J. M. van Gasteren
#year1990
#confLecture Notes in Computer Science
#citation45
#index3273
#arnetid3275

#*New Concepts for Parallel Object-Relational Query Processing
#@Michael Jaedicke
#year2001
#confLecture Notes in Computer Science
#citation5
#index3274
#arnetid3276
#!During the last few years parallel object-relational database management systems have emerged as the leading data management technology on the market place. These systems are extensible by user-defined data types and user-defined functionality for the data. This work focuses on the efficient parallel execution of user-defined functionality. The main contributions describe techniques to support data parallelism for user-defined scalar and aggregate functions, to support intra-function parallelism for the execution of a scalar function on a large object, and a new technology to provide extensibility with regard to new set-oriented database operations that can efficiently implement user-defined functionality in parallel object-relational database management systems. Some of these techniques have been implemented in the MIDAS prototype or on top of a commercial object-relational database management system.

#*Mes premières constructions de programmes
#@A. Gerbier
#year1977
#confLecture Notes in Computer Science
#citation-1
#index3275
#arnetid3277

#*Spatio-Temporal Image Processing: Theory and Scientific Applications
#@Bernd Jähne
#year1993
#confLecture Notes in Computer Science
#citation89
#index3276
#arnetid3278

#*Modular Algorithms in Symbolic Summation and Symbolic Integration
#@Jürgen Gerhard
#year2004
#confLecture Notes in Computer Science
#citation11
#index3277
#arnetid3279

#*Pascal User Manual and Report, Second Edition
#@Kathleen Jensen,Niklaus Wirth
#year1975
#conf
#citation-1
#index3278
#arnetid3280

#*Visualizing the Semantic Web
#@Vladimir Geroimenko,Chaomei Chen
#year2002
#conf
#citation75
#index3279
#arnetid3281

#*Pascal User Manual and Report, Second Edition
#@Kathleen Jensen,Niklaus Wirth
#year1975
#confLecture Notes in Computer Science
#citation-1
#index3280
#arnetid3282

#*Abstract Compositional Analysis of Iterated Relations, A Structural Approach to Complex State Transition Systems.
#@Frédéric Geurts
#year1998
#confLecture Notes in Computer Science
#citation2
#index3281
#arnetid3283
#%653735
#%92906
#%950658
#%951618
#%546370
#%257948
#%1093547
#%932058
#%1092798
#%1089632
#%1088786
#%932996
#%878984
#%930563
#%741051
#%1026933
#%1093804
#%1056654
#%1123755
#%3548
#%854397
#%1092797
#%1080998
#%1088877
#%832586
#%854416
#%451473
#%1088749
#%973076
#%994611
#%930656
#%1093042
#%833053
#%1123394
#%257762
#%553046
#%507757
#%17765
#%257632
#%17583
#%494044
#%625606
#%620081
#%619867
#%267136
#%252148
#%1034576
#%1078476
#%1078495
#%166970
#%166774
#%771298
#%853070
#%807828
#%698
#%770832
#%931707
#%17636
#%993714
#%2595
#%750983
#%833963
#%773614
#%850824
#%931656
#%932347
#%975653
#%507821
#%889764

#*Evaluating Natural Language Processing Systems, An Analysis and Review
#@Karen Sparck Jones,Julia Rose Galliers
#year1996
#confLecture Notes in Computer Science
#citation278
#index3282
#arnetid3284
#!:This comprehensive state-of-the-art book is the first devoted to the important and timely issue of evaluating NLP systems. It addresses the whole area of NLP system evaluation, including aims and scope, problems and methodology. The authors provide a wide-ranging and careful analysis of evaluation concepts, reinforced with extensive illustrations; they relate systems to their environments and develop a framework for proper evaluation. The discussion of principles is completed by a detailed review of practice and strategies in the field, covering both systems for specific tasks, like translation, and core language processors. The methodology lessons drawn from the analysis and review are applied in a series of example cases. The book also refers NLP system evaluation to the neighbouring areas of information and speech processing, and addresses issues of tool and data provision for evaluation. A comprehensive bibliography and subject index are included as well as a term glossary. This monograph will be a valuable source of inspiration in research, practice, and teaching.

#*Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem
#@Patrice Godefroid
#year1996
#confLecture Notes in Computer Science
#citation0
#index3283
#arnetid3285

#*TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages
#@Neil D. Jones,Steven S. Muchnick
#year1978
#confLecture Notes in Computer Science
#citation9
#index3284
#arnetid3286

#*An Extended Entity-Relationship Model - Fundamentals and Pragmatics
#@Martin Gogolla
#year1994
#confLecture Notes in Computer Science
#citation47
#index3285
#arnetid3287

#*Index Structures for Data Warehouses
#@Marcus Jürgens
#year2002
#confLecture Notes in Computer Science
#citation13
#index3286
#arnetid3288
#%149721
#%151586
#%599652
#%598304
#%1065226
#%2591
#%599600
#%1064719
#%545482
#%832546
#%95488
#%545007
#%545355
#%617998
#%651143
#%643010
#%300486
#%618097
#%642759
#%301064
#%300044
#%643698
#%642043
#%300367
#%644052
#%642825
#%642922
#%618094
#%301414
#%643754
#%300056
#%618252
#%599063
#%232849
#%832609
#%599064
#%545140
#%598303
#%598867
#%599433
#%598851
#%95887
#%599002
#%1113538
#%772954
#%769973
#%618001
#%618288
#%832612
#%165
#%598136
#!Data warehouses differ significantly from traditional transaction-oriented operational database applications. Indexing techniques and index structures applied in the transaction-oriented context are not feasible for data warehouses. This work develops specific heuristic indexing techniques, which process range queries on aggregated data more efficiently than those traditionally used in transaction-oriented systems. The book presents chapters on: - the state of the art in data warehouse research - data storage and index structures - finding optimal tree-based index structures - aggregated data in tree-based index structures - performance models for tree-based index structures - and techniques for comparing index structures.

#*Axiomatising the Logic of Computer Programming
#@Robert Goldblatt
#year1982
#confLecture Notes in Computer Science
#citation99
#index3287
#arnetid3289

#*Sprecherunabhängigkeit und Sprecheradaption: Lösungsansätze für das Problem des Sprecherwechsels bei der automatischen Spracherkennung
#@Bernhard R. Kämmerer
#year1990
#confInformatik-Fachberichte
#citation-1
#index3288
#arnetid3290

#*DIANA - An Intermediate Language for Ada, Revised Version
#@Gerhard Goos,William A. Wulf,Arthur Evans Jr,Kenneth J. Butler
#year1983
#confLecture Notes in Computer Science
#citation2
#index3289
#arnetid3291

#*GAG: A Practical Compiler Generator
#@Uwe Kastens,Brigitte Hutt,Erich Zimmermann
#year1982
#confLecture Notes in Computer Science
#citation121
#index3290
#arnetid3292

#*Edinburgh LCF
#@Michael J. C. Gordon,Robin Milner,Christopher P. Wadsworth
#year1979
#confLecture Notes in Computer Science
#citation333
#index3291
#arnetid3293

#*Zuverlässigkeit und Leistungsfähigkeit objekt-orientierter Datenbanksysteme
#@Alfons Kemper
#year1992
#confInformatik-Fachberichte
#citation-1
#index3292
#arnetid3294

#*Robust Adaptation to Non-Native Accents in Automatic Speech Recognition
#@Silke Goronzy
#year2002
#confLecture Notes in Computer Science
#citation27
#index3293
#arnetid3295

#*Conditionals in Nonmonotonic Reasoning and Belief Revision - Considering Conditionals as Agents
#@Gabriele Kern-Isberner
#year2001
#confLecture Notes in Computer Science
#citation54
#index3294
#arnetid3296
#%479693
#%745645
#%938840
#%3529
#%12804
#%597946
#%12088
#%744894
#%744394
#%488262
#%514332
#%565902
#%488258
#%175359
#%620476
#%175154
#%175107
#%2065
#%2074
#%2078
#%745209
#%2138
#%597940
#%12972
#%903911
#%745202
#%744805
#%632944
#%913638
#%745688
#%13290
#%387715
#%389167
#%387710
#%387768
#%484747
#%13076
#%389211
#%903909
#%745282
#%519183
#%479937

#*Datenbanksysteme für Software-Produktionsumgebungen
#@Willi Gotthard
#year1988
#confInformatik-Fachberichte
#citation-1
#index3295
#arnetid3297

#*Personalinformationssysteme in deutschen Großunternehmen: Ausbaustand und Rechtsprobleme
#@Wolfgang Kilian,Thomas Heissner,Brigitte Maschmann-Schulz
#year1981
#confInformatik-Fachberichte
#citation-1
#index3296
#arnetid3298

#*Graphgrammatiken in der Softwaretechnik: Theorie und Anwendungen
#@Herbert Göttler
#year1988
#confInformatik-Fachberichte
#citation39
#index3297
#arnetid3299

#*Query Processing in Database Systems
#@Won Kim,David S. Reiner,Don S. Batory
#year1985
#conf
#citation66
#index3298
#arnetid3300

#*Term Indexing
#@Peter Graf
#year1996
#confLecture Notes in Computer Science
#citation69
#index3299
#arnetid3301

#*Disconnected Operation in a Distributed File System
#@James J. Kistler
#year1995
#confLecture Notes in Computer Science
#citation101
#index3300
#arnetid3302
#!:The focus of this work is on the issue of availability in distributed file systems. It presents the important new technique called disconnected operation, in which clients mask failures and voluntary network detachments by emulating the functionality of servers where actual server-oriented solutions are inadequate. This permits client operation even under complete isolation from the server; the clean integration of mobile computers into the system is an important side-effect of the new technique. The design and implementation of disconnected file service in a working system, the Coda file system, is described in detail.

#*The Problem of Incomplete Information in Relational Databases
#@Gösta Grahne
#year1991
#confLecture Notes in Computer Science
#citation99
#index3301
#arnetid3303

#*Metaclasses and Their Applications, Data Model Tailoring and Database Integration
#@Wolfgang Klas,Michael Schrefl
#year1995
#confLecture Notes in Computer Science
#citation-1
#index3302
#arnetid3304

#*Distributed Programming Paradigms with Cryptography Applications
#@J. S. Greenfield
#year1994
#confLecture Notes in Computer Science
#citation2
#index3303
#arnetid3305

#*Concrete and Abstract Voronoi Diagrams
#@Rolf Klein
#year1989
#confLecture Notes in Computer Science
#citation140
#index3304
#arnetid3306

#*Theory of Program Structures: Schemes, Semantics, Verification
#@Sheila A. Greibach
#year1975
#confLecture Notes in Computer Science
#citation114
#index3305
#arnetid3307

#*A Study in String Processing Languages
#@Paul Klint
#year1985
#confLecture Notes in Computer Science
#citation3
#index3306
#arnetid3308

#*The Science of Programming.
#@David Gries
#year1981
#conf
#citation1578
#index3307
#arnetid3309

#*Treewidth, Computations and Approximations
#@Ton Kloks
#year1994
#confLecture Notes in Computer Science
#citation176
#index3308
#arnetid3310

#*A Logical Approach to Discrete Math.
#@David Gries,Fred B. Schneider
#year1993
#conf
#citation343
#index3309
#arnetid3311

#*Semantics of Digital Circuits
#@Carlos Delgado Kloos
#year1987
#confLecture Notes in Computer Science
#citation19
#index3310
#arnetid3312

#*Lectures on the Complexity of Bilinear Problems
#@Hans F. de Groote
#year1987
#confLecture Notes in Computer Science
#citation37
#index3311
#arnetid3313

#*Optimal Interprocedural Program Optimization, A New Framework and Its Application
#@Jens Knoop
#year1998
#confLecture Notes in Computer Science
#citation0
#index3312
#arnetid3314
#%81276
#%196795
#%546150
#%951453
#%950806
#%546054
#%546167
#%116
#%546377
#%546600
#%546836
#%1123788
#%889072
#%521755
#%542332
#%1123661
#%601160
#%542678
#%1123391
#%1123447
#%546032
#%546670
#%546014
#%600779
#%546427
#%546443
#%600822
#%546049
#%1123660
#%546680
#%1057183
#%542594
#%1123652
#%542363
#%1123396
#%542525
#%522638
#%1123565
#%741221
#%546648
#%542677
#%1008183
#%546125
#%546364
#%81342
#%196791
#%79802
#%81224
#%81264
#%114445
#%627458
#%81449
#%114632
#%508497
#%572537
#%172852
#%625262
#%626668
#%543170
#%173173
#%625270
#%483157
#%188830
#%268381
#%625580
#%625658
#%626627
#%1123427
#%542321
#%545949
#%1092623
#%1123962
#%231
#%542398
#%2346
#%774398
#%770703
#%1123786
#%776805
#%9734
#%621107
#%542908
#%494537
#%546834
#%1129723
#%542503
#%626691
#%522617
#%626690
#%17656
#%77
#%206786
#%553039
#%1123477
#%600824
#%548280
#%542706
#%1075047
#%189032
#%418936
#%546011
#%1123911
#%546696
#%548433
#%1123345
#%546152
#%1067347
#%1127648
#%1129383

#*A Perspective of Constraint-Based Reasoning - An Introductory Tutorial
#@Hans W. Guesgen,Joachim Hertzberg
#year1992
#confLecture Notes in Computer Science
#citation28
#index3313
#arnetid3315

#*Axioms and Hulls
#@Donald E. Knuth
#year1992
#confLecture Notes in Computer Science
#citation102
#index3314
#arnetid3316

#*Algebraic Semantics
#@Irène Guessarian
#year1981
#confLecture Notes in Computer Science
#citation167
#index3315
#arnetid3317

#*MMIXware, A RISC Computer for the Third Millennium
#@Donald E. Knuth
#year1999
#confLecture Notes in Computer Science
#citation-1
#index3316
#arnetid3318

#*Efficient Structures for Geometric Data Management
#@Oliver Günther
#year1988
#confLecture Notes in Computer Science
#citation123
#index3317
#arnetid3319

#*Benutzermodellierung in Dialogsystemen
#@Alfred Kobsa
#year1985
#confInformatik-Fachberichte
#citation-1
#index3318
#arnetid3320

#*List Decoding of Error-Correcting Codes (Winning Thesis of the 2002 ACM Doctoral Dissertation Competition)
#@Venkatesan Guruswami
#year2004
#confLecture Notes in Computer Science
#citation6
#index3319
#arnetid3321

#*Relationale Anfragen - Zerlegung und Optimierung
#@Jürgen Koch
#year1985
#confInformatik-Fachberichte
#citation5
#index3320
#arnetid3322

#*Übersetzerbau - Techniken, Werkzeuge, Anwendungen
#@Ralf Hartmut Güting,Martin Erwig
#year1999
#conf
#citation-1
#index3321
#arnetid3323

#*A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
#@Masakazu Kojima,Nimrod Megiddo,Toshihito Noma,Akiko Yoshise
#year1991
#confLecture Notes in Computer Science
#citation0
#index3322
#arnetid3324

#*Prinzipien der Referentialität: Untersuchungen zur propositionalen Repräsentation von Wissen
#@Christopher Habel
#year1986
#confInformatik-Fachberichte
#citation-1
#index3323
#arnetid3325

#*Prosody in Speech Understanding Systems
#@Ralf Kompe
#year1997
#confLecture Notes in Computer Science
#citation142
#index3324
#arnetid3326

#*Hyperedge Replacement: Grammars and Languages
#@Annegret Habel
#year1992
#confLecture Notes in Computer Science
#citation187
#index3325
#arnetid3327

#*Model Generation for Natural Language Interpretation and Analysis
#@Karsten Konrad
#year2004
#confLecture Notes in Computer Science
#citation14
#index3326
#arnetid3328

#*Communication and Cooperation in Agent Systems, A Pragmatic Theory
#@Afsaneh Haddadi
#year1995
#confLecture Notes in Computer Science
#citation105
#index3327
#arnetid3329

#*Triggermechanismen in Datenbanksystemen
#@Angelika M. Kotz
#year1989
#confInformatik-Fachberichte
#citation-1
#index3328
#arnetid3330

#*Representing Plans Under Uncertainty: A Logic of Time, Change, and Action
#@Peter Haddawy
#year1994
#confLecture Notes in Computer Science
#citation39
#index3329
#arnetid3331

#*Verkehrsanalyse in endlichen Zeiträumen: Grundlagen und Erweiterungen der operationalen Analyse
#@Wolfgang Kowalk
#year1982
#confInformatik-Fachberichte
#citation-1
#index3330
#arnetid3332

#*Lexikalisch verteiltes Text-Parsing: Eine objektorientierte Spezifikation eines Wortexpertensystems auf der Grundlage des Aktorenmodells
#@Udo Hahn
#year1990
#confInformatik-Fachberichte
#citation8
#index3331
#arnetid3333

#*Specifying Message Passing and Time-Critical Systems with Temporal Logic
#@Ron Koymans
#year1992
#confLecture Notes in Computer Science
#citation158
#index3332
#arnetid3334

#*Veritying Concurrent Processes Using Temporal Logic
#@Brent Hailpern
#year1982
#confLecture Notes in Computer Science
#citation133
#index3333
#arnetid3335

#*Distributed Reason Maintenance for Multiagent Systems
#@Gerhard K. Kraetzschmar
#year1997
#confLecture Notes in Computer Science
#citation6
#index3334
#arnetid3336

#*Time Structures - Formal Description and Algorithmic Representation
#@Elzbieta Hajnicz
#year1996
#confLecture Notes in Computer Science
#citation26
#index3335
#arnetid3337

#*LOGPLAN '88 - Report on the Programming Language
#@Antoni Kreczmar,Andrzej Salwicki,Marek Warpechowski
#year1990
#confLecture Notes in Computer Science
#citation-1
#index3336
#arnetid3338

#*Management of Telecommunication Systems and Services, Modelling and Implementing TMN-Based Multi-Domain Management
#@Jane Hall
#year1996
#confLecture Notes in Computer Science
#citation10
#index3337
#arnetid3339
#!:This monograph is the final report of the European RACE II Research Project PREPARE, devoted to designing and implementing prototype telecommunication management systems over real testbeds. The excellent results presented are a major contribution to advancing the state of the art in the field and have been widely acknowledged by standards bodies, manufacturers, operators, service providers, and academics. Prospective readers of the book include those concerned with the design, development, delivery, and maintenance of telecommunication services in the global service market as well as those with a general theoretical or practical interest in multi-domain management issues.

#*Numerical Integration on Advanced Computer Systems
#@Arnold R. Krommer,Christoph W. Ueberhuber
#year1994
#confLecture Notes in Computer Science
#citation61
#index3338
#arnetid3340

#*Autonomous Dynamic Reconfiguration in Multi-Agent Systems, Improving the Quality and Efficiency of Collaborative Problem Solving
#@Markus Hannebauer
#year2002
#confLecture Notes in Computer Science
#citation13
#index3339
#arnetid3341
#%166616
#%11647
#%745800
#%576230
#%29792
#%29993
#%297834
#%329281
#%329326
#%329164
#%3327
#%488753
#%745079
#%166633
#%3547
#%14636
#%488664
#%139509
#%117935
#%477606
#%45496
#%55760
#%57020
#%14937
#%166613
#%284269
#%368334
#%59408
#%560977
#%166631
#%284181
#%560377
#%14585
#%568042
#%881555
#%30074
#%3498
#%1057030
#%1089795
#%958191
#%874746
#%875250
#%875482
#%1113844
#%1112944
#%771947
#%29752
#%1123269
#%881840
#%747933
#%1062489
#%1123618
#%2614
#%1078175
#%388653
#%388454
#%389190
#%816195
#%390440
#%387832
#%388008
#%744537
#%770730
#%770769
#%1120163
#%1082041

#*Situationsmodellierung in der Bildfolgeauswertung
#@Wolfgang Krüger
#year1992
#confInformatik-Fachberichte
#citation-1
#index3340
#arnetid3342

#*Datenbanksysteme: Konzepte und Techniken der Implementierung, 2. Auflage
#@Theo Härder,Erhard Rahm
#year2001
#conf
#citation-1
#index3341
#arnetid3343

#*Funktionelle Analyse von Kommunikationsprotokollen
#@Heiko Krumm
#year1990
#confInformatik-Fachberichte
#citation2
#index3342
#arnetid3344

#*Datenbanksysteme: Konzepte und Techniken der Implementierung
#@Theo Härder,Erhard Rahm
#year1999
#conf
#citation176
#index3343
#arnetid3345

#*CAD und Arbeitssituation: Untersuchungen zu den Auswirkungen von CAD sowie zur menschengerechten Gestaltung von CAD-Systemen
#@Michael Kühn
#year1980
#confInformatik-Fachberichte
#citation2
#index3344
#arnetid3346

#*First-Order Dynamic Logic
#@David Harel
#year1979
#confLecture Notes in Computer Science
#citation537
#index3345
#arnetid3347

#*Semirings, Automata, Languages
#@Werner Kuich,Arto Salomaa
#year1986
#confMonographs in Theoretical Computer Science. An EATCS Series
#citation-1
#index3346
#arnetid3348

#*Adaptive Modelling, Estimation and Fusion from Data: A Neurofuzzy Approach
#@Chris J. Harris,Xia Hong,Qiang Gan
#year2002
#conf
#citation101
#index3347
#arnetid3349
#!This book brings together for the first time the complete theory of data-based neurofuzzy modelling and the linguistic attributes of fuzzy logic in a single cohesive mathematical framework. After introducing the basic theory of data based modelling, new concepts including extended additive and multiplicative submodels are developed and their extensions to state estimation and data fusion are derived. All of these algorithms are illustrated with benchmark and real-life examples to demonstrate their efficiency. The book aims at researchers and advanced professionals in time series modelling, empirical data modelling, knowledge discovery, data mining and data fusion.

#*Constraint Databases
#@Gabriel M. Kuper,Leonid Libkin,Jan Paredaens
#year2000
#conf
#citation237
#index3348
#arnetid3350

#*A Concurrent Pascal Compiler for Minicomputers
#@Alfred C. Hartmann
#year1977
#confLecture Notes in Computer Science
#citation42
#index3349
#arnetid3351

#*Fehlererkennung und Fehlerbehandlung in Speicherungsstrukturen von Datenbanksystemen
#@Klaus Küspert
#year1985
#confInformatik-Fachberichte
#citation3
#index3350
#arnetid3352

#*Optimization of SQL Queries for Parallel Machines
#@Waqar Hasan
#year1996
#confLecture Notes in Computer Science
#citation44
#index3351
#arnetid3353
#!Parallel execution offers a method for reducing the response time of queries against large databases. We address the problem of parallel query optimization: Given a declarative SQL query, find a procedural parallel plan that delivers the query result in minimal time. We develop optimization algorithms using models that incorporate both sources and obstacles to speedup. We address independent, pipelined and partitioned parallelism. We incorporate inherent constraints on available parallelism and the extra cost of parallel execution. Our models are motivated by experiments with NonStop SQL, a commercial parallel DBMS. We adopt a two-phase approach to parallel query optimization: JOQR (join ordering and query rewrite), followed by parallelization. JOQR minimizes total work. Then, parallelization spreads work among processors to minimize response time. For JOQR, we model communication costs and abstract physical characteristics of data as colors. We devise tree coloring and reordering algorithms that are efficient and optimal. We model parallelization as scheduling a tree whose nodes represent operators and edges represent parallel/precedence constraints. Computation/communication costs are represented as node/edge weights. We prove worst-case bounds on the performance ratios of our algorithms and measure average cases using simulation. Our results enable the construction of SQL compilers that effectively exploit parallel machines.

#*Non-Standard Inferences in Description Logics
#@Ralf Küsters
#year2001
#confLecture Notes in Computer Science
#citation32
#index3352
#arnetid3354
#%484737
#%484739
#%372725
#%1092940
#%1009328
#%12913
#%13532
#%533976
#%624623
#%478039
#%624659
#%124278
#%477441
#%624624
#%115727
#%477711
#%157672
#%289881
#%479649
#%14054
#%544838
#%1112812
#%875116
#%157699
#%1062500
#%744763
#%720
#%745826
#%1062590
#%480064
#%479488
#%1062480
#%1062568
#%832301
#%623199
#%598102
#%1062592
#%211251
#%387410
#%387406
#%389724
#%389370
#%388827
#%387400
#%389723
#%390485
#%387402
#%387856
#%157732
#%952087
#%3440
#%746929
#%805896

#*Portable Methodenmonitoren: Dialogsysteme zur Steuerung von Methodenbanken, softwaretechnischer Aufbau und Effizienzanalyse
#@Karl-Heinz Hauer
#year1980
#confInformatik-Fachberichte
#citation0
#index3353
#arnetid3355

#*Bibliography on Abstract Data Types, Sponsored by the "Österr. Fonds zur Förderung der Wissenschaftlichen Forschung"
#@B. Kutzler,Franz Lichtenberger
#year1983
#confInformatik-Fachberichte
#citation0
#index3354
#arnetid3356

#*NEWCAT: Parsing Natural Language Using Left-Associative Grammar
#@Roland Hauser
#year1986
#confLecture Notes in Computer Science
#citation28
#index3355
#arnetid3357

#*SEMPER - Secure Electronic Marketplace for Europe
#@Gerard Lacoste,Birgit Pfitzmann,Michael Steiner,Michael Waidner
#year2000
#confLecture Notes in Computer Science
#citation6
#index3356
#arnetid3358

#*Überlast in Rechensystemen: Modellierung und Verhinderung
#@Hans-Ulrich Heiss
#year1988
#confInformatik-Fachberichte
#citation3
#index3357
#arnetid3359

#*Part-Whole Reasoning in an Object-Centered Framework
#@Patrick Lambrix
#year2000
#confLecture Notes in Computer Science
#citation15
#index3358
#arnetid3360
#%246197
#%845883
#%846166
#%595242
#%845531
#%912376
#%748710
#%982289
#%912963
#%1009328
#%1009613
#%598385
#%595406
#%595197
#%595688
#%108880
#%595468
#%595073
#%176258
#%595869
#%477963
#%140810
#%440141
#%440144
#%299359
#%157910
#%440143
#%440142
#%160072
#%299459
#%1064942
#%1120232
#%874907
#%1062513
#%190
#%2617
#%776334
#%790959
#%807391
#%776534
#%789226
#%744783
#%1118164
#%480064
#%1118598
#%165705
#%1062480
#%1062568
#%1120050
#%747950
#%378158
#%388653
#%388562
#%387408
#%390061
#%390051
#%389724
#%387865
#%390761
#%388828
#%157732
#%390691
#%952087
#%599036
#%1120149
#%598160
#%2496
#%69320
#%936561
#%3440

#*On the Computational Geometry of Pocket Machining
#@Martin Held
#year1991
#confLecture Notes in Computer Science
#citation213
#index3359
#arnetid3361

#*Semantische Repräsentation komplexer Objektstrukturen: Modelle für nichtkonventionelle Datenbankanwendungen
#@Winfried Lamersdorf
#year1985
#confInformatik-Fachberichte
#citation-1
#index3360
#arnetid3362

#*Symbolische und konnektionistische Modelle der menschlichen Informationsverarbeitung - Eine kritische Gegenüberstellung
#@Gerhard Helm
#year1991
#confInformatik-Fachberichte
#citation-1
#index3361
#arnetid3363

#*Modelling Spatial Knowledge on a Linguistic Basis: Theory - Prototype - Integration
#@Ewald Lang,Kai-Uwe Carstensen,Geoffrey Simmons
#year1991
#confLecture Notes in Computer Science
#citation60
#index3362
#arnetid3364

#*The Use of Projective Geometry in Computer Graphics
#@Ivan Herman
#year1992
#confLecture Notes in Computer Science
#citation25
#index3363
#arnetid3365

#*Datenbankeinsatz.
#@Stefan M. Lang,Peter C. Lockemann
#year1995
#conf
#citation-1
#index3364
#arnetid3366

#*Interactive Markov Chains: The Quest for Quantified Quality
#@Holger Hermanns
#year2002
#confLecture Notes in Computer Science
#citation163
#index3365
#arnetid3367

#*Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists.
#@Cathy A. Lazere,Dennis Shasha
#year1998
#conf
#citation2
#index3366
#arnetid3368

#*Qualitative Representation of Spatial Knowledge
#@Daniel Hernández
#year1994
#confLecture Notes in Computer Science
#citation296
#index3367
#arnetid3369

#*Directions in Human Factors for Interactive Systems
#@Henry F. Ledgard,Andrew Singer,John A. Whiteside
#year1981
#confLecture Notes in Computer Science
#citation47
#index3368
#arnetid3370

#*Mehrbenutzerkontrolle in Nicht-Standard-Datenbanksystemen
#@Ulrich Herrmann
#year1991
#confInformatik-Fachberichte
#citation1
#index3369
#arnetid3371

#*Grup Theoretical Methods in Image Processing
#@Reiner Lenz
#year1990
#confLecture Notes in Computer Science
#citation95
#index3370
#arnetid3372

#*Uncertain Projective Geometry: Statistical Reasoning for Polyhedral Object Reconstruction
#@Stephan Heuel
#year2004
#confLecture Notes in Computer Science
#citation17
#index3371
#arnetid3373

#*Petri-Netz-Methoden und -Werkzeuge: Hilfsmittel zur Entwurfsspezifikation und -validation von Rechensystemen
#@Marek Leszak,Horst Eggert
#year1989
#confInformatik-Fachberichte
#citation2
#index3372
#arnetid3374

#*A Comparative Study of Very Large Data Bases
#@Edward Hill Jr.
#year1978
#confLecture Notes in Computer Science
#citation12
#index3373
#arnetid3375

#*The Nested Universal Relation Database Model
#@Mark Levene
#year1992
#confLecture Notes in Computer Science
#citation45
#index3374
#arnetid3376

#*Anaphora in Natural Language Understanding: A Survey
#@Graeme Hirst
#year1981
#confLecture Notes in Computer Science
#citation3
#index3375
#arnetid3377
#!A problem that all computer-based natural language understanding (NLU) systems encounter is that of linguistic reference, and in particular anaphora (abbreviated reference). For example, in a text as simple as: \begin{quote} Nadia showed Sue her new car. The seats were Day-Glo orange. \end{quote} knowing that ``her'''' probably means Nadia and not Sue and that ``the seats'''' means the seats of Nadia''s new car is not a simple task. .br This thesis is an extensive review of the reference and anaphor problem, and the approaches to it that NLU systems have taken, from early systems such as STUDENT through to current discourse-oriented ones such as PAL. .br The problem is first examined in detail, and examples are given of many different types of anaphor, some of which have been ignored by previous authors. The approaches taken in traditional systems are then described and abstracted and it is shown why they were inadequate, and why discourse theme and anaphoric focus need to be taken into account. The strengths and weaknesses of current anaphora theories and approaches are evaluated. The thesis closes with a list of some remaining research problems. .br The thesis has been written so as to be as comprehensible as possible to both AI workers who know no linguistics, and linguists who have not studied artificial intelligence.

#*Planen für autonome Montageroboter
#@Paul Levi
#year1988
#confInformatik-Fachberichte
#citation0
#index3376
#arnetid3378

#*Utilizing Problem Structure in Planning, A Local Search Approach
#@Jörg Hoffmann
#year2003
#confLecture Notes in Computer Science
#citation13
#index3377
#arnetid3379

#*Call-By-Push-Value: A Functional/Imperative Synthesis
#@Paul Blain Levy
#year2004
#confSemantics Structures in Computation
#citation42
#index3378
#arnetid3380

#*Group-Theoretic Algorithms and Graph Isomorphism
#@Christoph M. Hoffmann
#year1982
#confLecture Notes in Computer Science
#citation181
#index3379
#arnetid3381

#*Interaktives Entwerfen großer Programmsysteme: Konzepte und Werkzeuge
#@Claus Lewerentz
#year1988
#confInformatik-Fachberichte
#citation-1
#index3380
#arnetid3382

#*A Generative Theory of Shape, Questioning Klein's Erlanger Program
#@Michael Leyton
#year2001
#confLecture Notes in Computer Science
#citation0
#index3381
#arnetid3383

#*Elements of Finite Model Theory
#@Leonid Libkin
#year2004
#conf
#citation293
#index3382
#arnetid3384

#*Die Konfigurierung modular aufgebauter Datenbanksysteme
#@Dieter Lienert
#year1987
#confInformatik-Fachberichte
#citation0
#index3383
#arnetid3385

#*Iterative Software Engineering for Multiagent Systems: The MASSIVE Method
#@Jürgen Lind
#year2001
#confLecture Notes in Computer Science
#citation72
#index3384
#arnetid3386
#%29823
#%951441
#%958033
#%362222
#%29877
#%1007321
#%465524
#%807655
#%362531
#%159
#%56476
#%551663
#%56020
#%563235
#%56110
#%55760
#%112687
#%1123687
#%979731
#%30074
#%149
#%958191
#%738680
#%875001
#%738707
#%808527
#%461713
#%913534
#%748095
#%101057
#%363093
#%913176
#%626635
#%447324
#%2620
#%806166
#%2353
#%62257
#%108390
#%684744
#%1082041
#!:"The book will serve as a valuable source of reference for R&D professionals active in agent-based computing as well as a gentle and systematic introduction to agent-based systems development and analysis for software engineers and advanced students."--BOOK JACKET.

#*Composition of Secure Multi-Party Protocols, A Comprehensive Study
#@Yehuda Lindell
#year2003
#confLecture Notes in Computer Science
#citation29
#index3385
#arnetid3387

#*Dynamische Integrität von Datenbanken: Grundlagen der Spezifikation und Überwachung
#@Udo W. Lipeck
#year1989
#confInformatik-Fachberichte
#citation-1
#index3386
#arnetid3388

#*CLU Reference Manual
#@Barbara Liskov,Russell R. Atkinson,Toby Bloom,J. Eliot B. Moss,Craig Schaffert,Robert Scheifler,Alan Snyder
#year1981
#confLecture Notes in Computer Science
#citation470
#index3387
#arnetid3389

#*Synthesising Synchronous Systems by Static Scheduling in Space-Time
#@Björn Lisper
#year1989
#confLecture Notes in Computer Science
#citation19
#index3388
#arnetid3390

#*Foundations of Logic Programming, 1st Edition
#@John W. Lloyd
#year1984
#conf
#citation2
#index3389
#arnetid3391

#*Foundations of Logic Programming, 2nd Edition
#@John W. Lloyd
#year1987
#conf
#citation2
#index3390
#arnetid3392

#*Datenbankhandbuch.
#@Peter C. Lockemann,Joachim W. Schmidt
#year1987
#conf
#citation89
#index3391
#arnetid3393

#*Web-Datenbanken: Einsatz objekt-relationaler Datenbanken für Web-Informationssysteme
#@Henrik Loeser
#year2001
#conf
#citation-1
#index3392
#arnetid3394

#*The Dynamics of Concepts - A Connectionist Model
#@Philip R. Van Loocke
#year1994
#confLecture Notes in Computer Science
#citation11
#index3393
#arnetid3395

#*Parallele Implementierung funktionaler Programmiersprachen
#@Rita Loogen
#year1990
#confInformatik-Fachberichte
#citation9
#index3394
#arnetid3396

#*Towards a CSCW Framework for Scientific Cooperation in Europe
#@Hannes P. Lubich
#year1995
#confLecture Notes in Computer Science
#citation36
#index3395
#arnetid3397

#*ANNA - A Language for Annotating Ada Programs, Reference Manual
#@David C. Luckham,Friedrich W. von Henke,Bernd Krieg-Brückner,Olaf Owe
#year1987
#confLecture Notes in Computer Science
#citation117
#index3396
#arnetid3398

#*Attributierte Grammatiken und Attributierungsalgorithmen
#@Ulrich Mahn
#year1988
#confInformatik-Fachberichte
#citation0
#index3397
#arnetid3399

#*Exceptionbehandlung und Synchronisation - Entwurf und Methode
#@Georg E. Maier
#year1985
#confInformatik-Fachberichte
#citation3
#index3398
#arnetid3400

#*Ein inhaltsadressierbares Speichersystem zur Unterstützung zeitkritischer Prozesse der Informationswiedergewinnung in Datenbanksystemen
#@M. Malms
#year1983
#confInformatik-Fachberichte
#citation-1
#index3399
#arnetid3401

#*Fehlertolerante dezentrale Prozeßautomatisierung
#@Hubert Mäncher
#year1987
#confInformatik-Fachberichte
#citation-1
#index3400
#arnetid3402

#*Entwurf und Realisierung eines Multiprozessors
#@Reinhard Männer
#year1987
#confInformatik-Fachberichte
#citation-1
#index3401
#arnetid3403

#*Fehlerdiagnose für Schaltnetze aus Modulen mit partiell injektiven Pfadfunktionen
#@Michael Marhöfer
#year1987
#confInformatik-Fachberichte
#citation-1
#index3402
#arnetid3404

#*Coroutines: A Programming Methodology, a Language Design and an Implementation
#@Chris D. Marlin
#year1980
#confLecture Notes in Computer Science
#citation39
#index3403
#arnetid3405

#*Coordinating Plans of Autonomous Agents
#@Frank von Martial
#year1992
#confLecture Notes in Computer Science
#citation210
#index3404
#arnetid3406

#*PISA: A Programming System for Interactive Production of Application Software
#@Rudolf Marty
#year1981
#confInformatik-Fachberichte
#citation1
#index3405
#arnetid3407

#*Verteilte Basisalgorithmen
#@Friedemann Mattern
#year1989
#confInformatik-Fachberichte
#citation49
#index3406
#arnetid3408

#*An Approach to Knowledge Base Management
#@Nelson Mendonça Mattos
#year1991
#confLecture Notes in Computer Science
#citation50
#index3407
#arnetid3409

#*Relevanzanalyse: Eine Kombination von Striktheits- und Datenflußanalyse zur effizienten Auswertung funktionaler Programme
#@Dieter Maurer
#year1988
#confInformatik-Fachberichte
#citation-1
#index3408
#arnetid3410

#*Automated Deduction in Equational Logic and Cubic Curves
#@William McCune,R. Padmanabhan
#year1996
#confLecture Notes in Computer Science
#citation0
#index3409
#arnetid3411

#*Advances in Cryptology 1981-1997, Electronic Proceedings and Index of the CRYPTO and EUROCRYPT Conferences 1981-1997
#@Kevin S. McCurley,Claus Dieter Ziegler
#year1998
#confLecture Notes in Computer Science
#citation0
#index3410
#arnetid3412

#*Data Structures and Algorithms 1: Sorting and Searching
#@Kurt Mehlhorn
#year1984
#confMonographs in Theoretical Computer Science. An EATCS Series
#citation457
#index3411
#arnetid3413

#*Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness
#@Kurt Mehlhorn
#year1984
#confMonographs in Theoretical Computer Science. An EATCS Series
#citation375
#index3412
#arnetid3414

#*Data Structures and Algorithms 3
#@Kurt Mehlhorn
#year1984
#confMonographs in Theoretical Computer Science. An EATCS Series
#citation597
#index3413
#arnetid3415

#*Erweiterung relationaler Datenbanksysteme für technische Anwendungen
#@Andreas Meier
#year1987
#confInformatik-Fachberichte
#citation-1
#index3414
#arnetid3416

#*Modified Branching Programs and Their Computational Power
#@Christoph Meinel
#year1989
#confLecture Notes in Computer Science
#citation49
#index3415
#arnetid3417

#*WWW - Kommunikation, Internetworking, Web-Technologien
#@Christoph Meinel,Harald Sack
#year2003
#conf
#citation39
#index3416
#arnetid3418

#*Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications
#@Christoph Meinel,Thorsten Theobald
#year1998
#conf
#citation202
#index3417
#arnetid3419

#*Algorithmen und Datenstrukturen im VLSI-Design: OBDD - Grundlagen und Anwendungen
#@Christoph Meinel,Thorsten Theobald
#year1998
#conf
#citation17
#index3418
#arnetid3420

#*Randomness and Completeness in Computational Complexity
#@Dieter van Melkebeek
#year2000
#confLecture Notes in Computer Science
#citation5
#index3419
#arnetid3421
#%210990
#%104701
#%267494
#%211713
#%210981
#%623176
#%971630
#%971261
#%1093413
#%950943
#%1059460
#%972665
#%211426
#%861729
#%971403
#%104722
#%1059150
#%104597
#%1093800
#%104447
#%104681
#%783600
#%219399
#%557838
#%219401
#%480918
#%619978
#%620023
#%493127
#%104683
#%861913
#%622975
#%1009217
#%1058737
#%105048
#%622290
#%621767
#%623039
#%104685
#%621344
#%211766
#%104824
#%1060531
#%622827
#%952804
#%621147
#%971401
#%621335
#%930132
#%623202
#%798304
#%930665
#%888185
#%741316
#%622769
#%211826
#%209774
#%209814
#%209997
#%209799
#%1059069
#%1059996
#%741546
#%1059602
#%972735
#%959966
#%622136
#!Computational complexity studies the inherent difficulty of computational problems and the power of the tools we may use to solve them. We focus on randomness and look at several properties of complete problems to investigate its role as well as issues about nondeterminism, alternation, and space versus time. We investigate the use of randomness in the area of proof checking. By derandomizing Arthur-Merlin games, we show that every language with a bounded round interactive proof system has subexponential size proofs unless the polynomial-time hierarchy collapses. This provides the first strong evidence that graph nonisomorphism has subexponential size proofs of membership. Under a stronger hypothesis we can scale the proof size down to polynomial. We also show how our approach applies to several randomized processes other than Arthur-Merlin games. We develop techniques for separating complexity classes by isolating a structural difference between their complete languages. We look at several properties from this perspective: The density of complete languages, the redundancy in complete languages, and the frequency of occurrence of completeness. We show that there is no sparse hard language for polynomial time under logarithmic space reductions with a bounded number of queries unless polynomial time collapses to logarithmic space. The same approach works for various other complexity classes, in the deterministic as well as in the randomized setting. Autoreducibility defines the most general type of efficient reduction of a problem to itself. We show that settling the question whether all complete languages for doubly exponential time are autoreducible would yield major separations: If yes, we have a proof that polynomial time differs from polynomial space, and nondeterministic logarithmic space from nondeterministic polynomial time; if no, we can separate the polynomial-time hierarchy from exponential time. Resource-bounded measure formalizes the notions of scarceness and abundance within complexity classes. From the separation point of view, the theory seems particularly suited for separating randomized polynomial time from exponential time. We develop several strategies using resource-bounded measure aimed at realizing that goal: Showing a difference in measure between the hard languages of these classes, a probabilistic method approach, and the concept of betting games.

#*Generic Model Management: Concepts and Algorithms
#@Sergey Melnik
#year2004
#confLecture Notes in Computer Science
#citation90
#index3420
#arnetid3422

#*A Calculus of Communicating Systems
#@Robin Milner
#year1980
#confLecture Notes in Computer Science
#citation3286
#index3421
#arnetid3423

#*Ein Molekül-Atom-Datenmodell für Non-Standard-Anwendungen: Anwendungsanalyse, Datenmodellentwurf und Implementierungskonzepte
#@Bernhard Mitschang
#year1988
#confInformatik-Fachberichte
#citation-1
#index3422
#arnetid3424

#*Inkonsistenzen in deduktiven Datenbanken: Diagnose und Reparatur
#@Guido Moerkotte
#year1990
#confInformatik-Fachberichte
#citation1
#index3423
#arnetid3425

#*Prinzipien piktorieller Repräsentationssysteme, Untersuchungen zur bildhaften Repräsentation von Wissen in informationsverarbeitenden Systemen
#@Michael Mohnhaupt
#year1992
#confInformatik-Fachberichte
#citation-1
#index3424
#arnetid3426

#*An Introduction to Formal Language Theory
#@Robert N. Moll,Michael A. Arbib,A. J. Kfoury
#year1988
#conf
#citation49
#index3425
#arnetid3427

#*CASL Reference Manual, The Complete Documentation of the Common Algebraic Specification Language
#@Peter D. Mosses
#year2004
#confLecture Notes in Computer Science
#citation18
#index3426
#arnetid3428

#*Live Data Structures in Logic Programs: Derivation by Means of Abstract Interpretation
#@Anne Mulkers
#year1993
#confLecture Notes in Computer Science
#citation12
#index3427
#arnetid3429

#*Modular Specification and Verification of Object-Oriented Programs
#@Peter Müller
#year2002
#confLecture Notes in Computer Science
#citation124
#index3428
#arnetid3430
#%173481
#%173148
#%546202
#%522873
#%932538
#%546478
#%522041
#%361777
#%546769
#%2604
#%1124232
#%1123711
#%628126
#%208561
#%173889
#%559514
#%552634
#%507835
#%173983
#%208767
#%219940
#%65551
#%173100
#%479461
#%626580
#%173246
#%466725
#%173161
#%601342
#%521996
#%522431
#%522324
#%546587
#%1127569
#%683928
#%703
#%713
#%1028772
#%522283
#%481025
#%2606
#%723
#%696
#%889325
#%172886
#%522526
#%1123967
#%2128
#%740511
#%892721
#%387836
#%522424
#%1075463
#%521910
#%134
#%1056514
#!This book presents new techniques for the formal specification and verification of object-oriented software. Since modularity is of critical importance for reuse and component-based programming, special emphasis is given to the completeness of the presented specification techniques to allow module verification based on the specification of the imported modules. A formal framework developed for a Java subset illustrates these new techniques.

#*Realistische Computergraphik: Algorithmen, Datenstrukturen und Maschinen
#@Heinrich Müller
#year1988
#confInformatik-Fachberichte
#citation3
#index3429
#arnetid3431

#*The Design of Intelligent Agents - A Layered Approach
#@Jörg P. Müller
#year1996
#confLecture Notes in Computer Science
#citation418
#index3430
#arnetid3432

#*Modular Compiler Verification - A Refinement-Algebraic Approach Advocating Stepwise Abstraction
#@Markus Müller-Olm
#year1997
#confLecture Notes in Computer Science
#citation-1
#index3431
#arnetid3433

#*The Complexity of Simple Computer Architectures
#@Silvia M. Müller,Wolfgang J. Paul
#year1995
#confLecture Notes in Computer Science
#citation16
#index3432
#arnetid3434

#*Handbook of Networked and Embedded Control Systems
#@Dimitrios Hristu-Varsakelis,William S. Levine
#year2005
#confHandbook of Networked and Embedded Control Systems
#citation109
#index3433
#arnetid3435

#*Transactional Agents: Towards a Robust Multi-Agent System
#@Khaled Nagi
#year2001
#confLecture Notes in Computer Science
#citation19
#index3434
#arnetid3436
#%642302
#%29988
#%29727
#%372926
#%297318
#%166658
#%492
#%1118253
#%951886
#%55760
#%56354
#%299971
#%642666
#%95318
#%29586
#%2083
#%29596
#%1113754
#%774690
#%533878
#%533866
#%1127593
#%2319
#%2204
#%2205
#%844511
#%598262
#%2194
#%56167
#%891889
#%388404
#%598389
#%641844
#%1082041

#*Negation and Control in Prolog
#@Lee Naish
#year1986
#confLecture Notes in Computer Science
#citation205
#index3435
#arnetid3437

#*Constraint-Based Agents
#@Alexander Nareyek
#year2001
#confLecture Notes in Computer Science
#citation25
#index3436
#arnetid3438

#*Quality-Driven Query Answering for Integrated Information Systems
#@Felix Naumann
#year2002
#confLecture Notes in Computer Science
#citation113
#index3437
#arnetid3439
#%1137942
#%62773
#%216797
#%1138067
#%1118247
#%598373
#%1118522
#%1118406
#%777254
#%1141869
#%839602
#%2025
#%598325
#%1118349
#%982289
#%832546
#%176606
#%193
#%183352
#%643631
#%643605
#%642559
#%643121
#%300826
#%642274
#%300902
#%643380
#%643475
#%643522
#%643347
#%771270
#%413448
#%544915
#%2303
#%775387
#%544986
#%793387
#%776827
#%299937
#%621652
#%598673
#%808476
#%1065148
#%832301
#%2612
#%1118360
#%832823
#%618186
#%1065496
#%1065252
#!The Internet and the World Wide Web are becoming increasingly important in our highly interconnected world. This book addresses the topic of querying the data available, with regard to its quality, in a systematic and comprehensive way, from a database point of view. First, information quality and information quality measures are systematically introduced before ranking algorithms are developed for selecting Web sources for access. The second part is devoted to quality-driven query answering, particularly to query planning methods and algorithms.

#*Automated Modeling of Physical Systems
#@P. Pandurang Nayak
#year1995
#confLecture Notes in Computer Science
#citation71
#index3438
#arnetid3440

#*The Newton-Cauchy Framework: A Unified Approach to Unconstrained Nonlinear Minimization
#@J. L. Nazareth
#year1994
#confLecture Notes in Computer Science
#citation11
#index3439
#arnetid3441

#*Reasoning and Revision in Hybrid Representation Systems
#@Bernhard Nebel
#year1990
#confLecture Notes in Computer Science
#citation414
#index3440
#arnetid3442

#*Computation for Metaphors, Analogy, and Agents.
#@Chrystopher L. Nehaniv
#year1999
#confLecture Notes in Computer Science
#citation20
#index3441
#arnetid3443
#!As an introduction to papers in this book we review the notion of metaphor in language, and of metaphor as conceptual, and as primary to understanding. Yet the view of metaphor here is more general. We propose a constructive view of metaphor as mapping or synthesis of meaning between domains, which need not be conceptual ones. These considerations have implications for artificial intelligence (AI), human-computer interaction (HCI), algebraic structure-preservation, constructive biology, and agent design. In this larger setting for metaphor, contributions of the selected papers are overviewed and key aspects of computation for metaphors, analogy and agents highlighted.

#*Probability, Stocastic Processes, and Queuing Theory - The Mathematics of Computer Performance Modeling.
#@Randolph Nelson
#year1995
#conf
#citation308
#index3442
#arnetid3444

#*Probabilistic and Statistical Methods in Cryptology, An Introduction by Selected Topics
#@Daniel Neuenschwander
#year2004
#confLecture Notes in Computer Science
#citation4
#index3443
#arnetid3445

#*Foundations of Inductive Logic Programming
#@Shan-Hwei Nienhuys-Cheng,Ronald de Wolf
#year1997
#confLecture Notes in Computer Science
#citation252
#index3444
#arnetid3446

#*Context-Free Grammars: Covers, Normal Forms, and Parsing
#@Anton Nijholt
#year1980
#confLecture Notes in Computer Science
#citation43
#index3445
#arnetid3447

#*Principles of Artificial Intelligence
#@Nils J. Nilsson
#year1982
#conf
#citation3616
#index3446
#arnetid3448

#*Isabelle/HOL - A Proof Assistant for Higher-Order Logic
#@Tobias Nipkow,Lawrence C. Paulson,Markus Wenzel
#year2002
#confLecture Notes in Computer Science
#citation541
#index3447
#arnetid3449
#%1103524
#%625307
#%774566
#%970586
#%981026

#*Filtering, Segmentation and Depth
#@Mark Nitzberg,David Mumford,Takahiro Shiota
#year1993
#confLecture Notes in Computer Science
#citation215
#index3448
#arnetid3450

#*Temporally Distributed Symptoms in Technical Diagnosis
#@Klaus Nökel
#year1991
#confLecture Notes in Computer Science
#citation51
#index3449
#arnetid3451

#*Textgenerierung aus visuellen Daten: Beschreibungen von Straßenszenen
#@Hans-Joachim Novak
#year1987
#confInformatik-Fachberichte
#citation-1
#index3450
#arnetid3452

#*Computing in Systems Described by Equations
#@Michael J. O'Donnell
#year1977
#confLecture Notes in Computer Science
#citation178
#index3451
#arnetid3453

#*Sprachkonzepte für benutzergerechte Systeme
#@Horst Oberquelle
#year1987
#confInformatik-Fachberichte
#citation-1
#index3452
#arnetid3454

#*Chance Discovery
#@Peter McBurney,Yukio Ohsawa
#year2003
#confChance Discovery
#citation96
#index3453
#arnetid3455

#*Coordination of Internet Agents: Models, Technologies, and Applications
#@Andrea Omicini,Franco Zambonelli,Matthias Klusch,Robert Tolksdorf
#year2001
#confCoordination of Internet Agents: Models, Technologies, and Applications
#citation156
#index3454
#arnetid3456

#*A Formal Model of Visualization in Computer Graphics Systems
#@Tamiya Onodera,Satoru Kawai
#year1990
#confLecture Notes in Computer Science
#citation2
#index3455
#arnetid3457

#*Reliability Evaluation of Some Fault-Tolerant Computer Architectures
#@Shunji Osaki,Toshihiko Nishio
#year1980
#confLecture Notes in Computer Science
#citation29
#index3456
#arnetid3458

#*Co-ordination in Artificial Agent Societies, Social Structure and Its Implications for Autonomous Problem-Solving Agents.
#@Sascha Ossowski
#year1999
#confLecture Notes in Computer Science
#citation2
#index3457
#arnetid3459
#%139527
#%329164
#%166626
#%166619
#%488753
#%166641
#%166652
#%745894
#%1117353
#%166611
#%3404
#%773244
#%772079
#%15583
#%771424
#%12969
#%912091
#%832821
#%747655
#%477960
#%139531
#%117935
#%56397
#%116394
#%55401
#%488722
#%139538
#%55760
#%56358
#%59732
#%30074
#%958191
#%1113460
#%832504
#%2617
#%165266
#%748095
#%772069
#%745682
#%744899
#%1120177
#%748316
#%174762
#%174751
#%388303
#%390437
#%391338
#%816212
#%387773
#%388304
#%388008
#%390803
#%121804
#%744537
#%748314
#%1082041
#!:This monograph provides a comprehensive survey of the different approaches to coordination in societies of artificial and human agents. Setting out from a critical assessment of the state of the art, the author develops a method of structuring multi-agent applications with a mechanism called structural cooperation. Agents are equipped with expertise about their environment in order to detect and overcome specific types of problem, they make use of their social knowledge to mutually adjust their activities, and they are coerced toward coherent collective behavior through normative rules.

#*Direct Methods for Sparse Matrices
#@Ole Østerby,Zahari Zlatev
#year1983
#confLecture Notes in Computer Science
#citation111
#index3458
#arnetid3460

#*The Design of Dynamic Data Structures
#@Mark H. Overmars
#year1983
#confLecture Notes in Computer Science
#citation284
#index3459
#arnetid3461

#*Constrained Global Optimization: Algorithms and Applications
#@Panos M. Pardalos,J. Ben Rosen
#year1987
#confLecture Notes in Computer Science
#citation356
#index3460
#arnetid3462

#*The Structure of the Relational Database Model
#@Jan Paredaens,Paul De Bra,Marc Gyssens,Dirk Van Gucht
#year1989
#conf
#citation176
#index3461
#arnetid3463

#*Software Frameworks and Embedded Control Systems
#@Alessandro Pasetti
#year2002
#confLecture Notes in Computer Science
#citation42
#index3462
#arnetid3464
#%1074409
#%444469
#%753233
#%619360
#%522078
#%661740
#%173189
#%773069
#%775788
#%619453
#%770711
#%1070563
#%616119
#%616138
#%616135
#%616104
#%616100
#%616146
#%616184
#%616127
#%616096
#%616106
#%616098
#%616204
#%616157
#%2617
#%191
#%621465

#*Active Rules in Database Systems
#@Norman W. Paton
#year1999
#conf
#citation288
#index3463
#arnetid3465

#*Learning-Based Robot Vision, Principles and Applications
#@Josef Pauli
#year2001
#confLecture Notes in Computer Science
#citation11
#index3464
#arnetid3466
#%128567
#%127485
#%1023567
#%1022617
#%834780
#%1031273
#%746230
#%835519
#%1009852
#%746052
#%1045595
#%745298
#%920139
#%920467
#%908430
#%908361
#%1009392
#%920011
#%1022841
#%1045655
#%1009332
#%1026872
#%33104
#%477970
#%56358
#%271767
#%29233
#%627974
#%517035
#%1023343
#%1027206
#%835166
#%834843
#%834714
#%1032722
#%1031171
#%835196
#%1022937
#%1031021
#%834972
#%834873
#%1030938
#%1031105
#%169209
#%1031755
#%293073
#%293562
#%1032917
#%908292
#%1277053
#%806368
#%623199
#%3446
#%744305
#%387783
#%816282
#%834372
#%1026494

#*The Deisgn of an Extendible Graph Editor
#@Frances Newbery Paulisch
#year1993
#confLecture Notes in Computer Science
#citation-1
#index3465
#arnetid3467

#*Isabelle - A Generic Theorem Prover (with a contribution by T. Nipkow)
#@Lawrence C. Paulson
#year1994
#confLecture Notes in Computer Science
#citation-1
#index3466
#arnetid3468

#*Synchronisation in zentralisierten Datenbanksystemen: Algorithmen, Realisierungsmöglichkeiten und quantitative Analyse
#@Peter Peinl
#year1987
#confInformatik-Fachberichte
#citation8
#index3467
#arnetid3469

#*Data Mining on Multimedia Data
#@Petra Perner
#year2002
#confLecture Notes in Computer Science
#citation51
#index3468
#arnetid3470
#%136617
#%1498205
#%33632
#%472706
#%472745
#%1032863
#%473049
#%835025
#%839492
#%839553
#%745864
#%1044247
#%1045605
#%938484
#%2358
#%746401
#%744294
#%399134
#%500290
#%399045
#%199887
#%399096
#%200120
#%619006
#%199980
#%200008
#%200166
#%619010
#%199943
#%200140
#%199970
#%908475
#%1031932
#%1046380
#%1112882
#%1009791
#%172566
#%1113225
#%1045523
#%598759
#%2291
#%1009691
#%833870
#%913160

#*Computer Programs for Spelling Correction: An Experiment in Program Design
#@James L. Peterson
#year1980
#confLecture Notes in Computer Science
#citation77
#index3469
#arnetid3471

#*Compiling Natural Semantics.
#@Mikael Pettersson
#year1999
#confLecture Notes in Computer Science
#citation52
#index3470
#arnetid3472

#*Erzeugung interaktiver Bildverarbeitungssysteme im Dialog: Konzepte, Entwurf und Implementierung eines Dialogsystems für die Bildverarbeitung in der Medizin
#@Guido Pfeiffer
#year1982
#confInformatik-Fachberichte
#citation4
#index3471
#arnetid3473

#*Diensteintegrierende Kommunikationsnetze mit teilnehmerüberprüfbarem Datenschutz
#@Andreas Pfitzmann
#year1990
#confInformatik-Fachberichte
#citation-1
#index3472
#arnetid3474

#*Digital Signature Schemes, General Framework and Fail-Stop Signatures
#@Birgit Pfitzmann
#year1996
#confLecture Notes in Computer Science
#citation44
#index3473
#arnetid3475
#!:This book is based on the author's Ph.D. thesis which was selected during the 1995 GI Doctoral Dissertation Competition as the winning thesis in the foundations-of-informatics track. Birgit Pfitzmann did her Ph.D. work at the University of Hildesheim with Professor Joachim Biskup as advisor. Securing integrity for digital communications in the age of global electronic information exchange and electronic commerce is of vital interest for democratic societies and a central technical challenge for cryptologists. As core contribution to advancing the state of the art, the author rigorously develops the new class of digital fail-stop signatures: in contrary to all previously introduced digital signature schemes, these new signatures enable the supposed signer to actually prove forging of the scheme in the case of a successful attack. This monograph is self-contained with respect to the historical background and cryptographic primitives used. For the first time, a general and sophisticated framework is introduced in which previously proposed and the innovative failstop signatures are systematically presented and evaluated, from theoretical foundations up to engineering aspects. Thus the book is compulsory reading for anybody interested in secure digital communication at the professional level.

#*On-line Error Detection and Fast Recover Techniques for Dependable Embedded Processors
#@Matthias Pflanz
#year2002
#confLecture Notes in Computer Science
#citation0
#index3474
#arnetid3476
#%454338
#%1501978
#%134447
#%131813
#%927027
#%142024
#%282256
#%133198
#%455662
#%153589
#%858371
#%858150
#%858103
#%142904
#%455252
#%206910
#%1081790
#%455507
#%456493
#%456516
#%890853
#%1082231
#!This book presents a new approach to on-line observation and concurrent checking of processors by refining and improving known techniques and introducing new ideas.The proposed on-line error detection and fast recover techniques support and complement other established methods. In combination with other on-line observation priniciples and with a combined hardware-software test, these techniques are used to fulfill a complete self-check scheme for an embedded processor.

#*Design of Hashing Algorithms
#@Josef Pieprzyk,Babak Sadeghiyan
#year1993
#confLecture Notes in Computer Science
#citation45
#index3475
#arnetid3477

#*CONLAN Report
#@Robert Piloty,Dominique Borrione,Mario Barbacci,Donald L. Dietmeyer,Fredrick J. Hill,Patrick Skelly
#year1983
#confLecture Notes in Computer Science
#citation44
#index3476
#arnetid3478

#*Termination Proofs for Logic Programs
#@Lutz Plümer
#year1990
#confLecture Notes in Computer Science
#citation118
#index3477
#arnetid3479

#*Spatial Representation and Motion Planning
#@Angel P. Del Pobil,Miguel A. Serna
#year1995
#confLecture Notes in Computer Science
#citation40
#index3478
#arnetid3480

#*Compiler Specification and Verification
#@Wolfgang Pollak
#year1981
#confLecture Notes in Computer Science
#citation80
#index3479
#arnetid3481

#*Computational Geometry - An Introduction.
#@Franco P. Preparata,Michael Ian Shamos
#year1985
#conf
#citation5971
#index3480
#arnetid3482

#*Diagnostisches Problemlösen mit Expertensystemen
#@Frank Puppe
#year1987
#confInformatik-Fachberichte
#citation-1
#index3481
#arnetid3483

#*Model-Checking Based Data Retrieval, An Application to Semistructured and Temporal Data
#@Elisa Quintarelli
#year2004
#confLecture Notes in Computer Science
#citation4
#index3482
#arnetid3484

#*Multisensordatenverarbeitung in der Robotik
#@Jörg Raczkowsky
#year1991
#confInformatik-Fachberichte
#citation-1
#index3483
#arnetid3485

#*Synchronisation in Mehrrechner-Datenbanksystemen - Konzepte, Realisierungsformen und quantitative Bewertung
#@Erhard Rahm
#year1988
#confInformatik-Fachberichte
#citation3
#index3484
#arnetid3486

#*Automatic Differentiation: Techniques and Applications
#@Louis B. Rall
#year1981
#confLecture Notes in Computer Science
#citation401
#index3485
#arnetid3487

#*Bounded Incremental Computation
#@G. Ramalingam
#year1996
#confLecture Notes in Computer Science
#citation-1
#index3486
#arnetid3488

#*Audio System for Technical Readings.
#@T. V. Raman
#year1998
#confLecture Notes in Computer Science
#citation120
#index3487
#arnetid3489
#!The advent of electronic documents makes information available in more than its visual form electronic information can now be display-independent. We describe a computing system, ASTER, that audio formats electronic documents to produce audio documents. ASTER can speak both literary texts and highly technical documents (presently in LaTeX) that contain complex mathematics. Visual communication is characterized by the eye''s ability to actively access parts of a two-dimensional display. The reader is active, while the display is passive. This active-passive role is reversed by the temporal nature of oral communication: information flows actively past a passive listener. This prohibits multiple views it is impossible to first obtain a high-level view and then ``look'''' at details. These shortcomings become severe when presenting complex mathematics orally. Audio formatting, which renders information structure in a manner attuned to an auditory display, overcomes these problems. ASTER is interactive, and the ability to browse information structure and obtain multiple views enables active listening.

#*Aspect-Oriented Database Systems
#@Awais Rashid
#year2003
#conf
#citation28
#index3488
#arnetid3490

#*Design and Control of Workflow Processes: Business Process Management for the Service Industry
#@Hajo A. Reijers
#year2003
#confLecture Notes in Computer Science
#citation110
#index3489
#arnetid3491

#*FRM: Ein Frame-Repräsentationsmodell und seine formale Semantik: Zur Integration von Datenbank- und Wissensrepräsentationsansätzen
#@Ulrich Reimer
#year1989
#confInformatik-Fachberichte
#citation-1
#index3490
#arnetid3492

#*Focusing Solutions for Data Mining: Analytical Studies and Experimental Results in Real-World Domains
#@Thomas P. Reinartz
#year1999
#confLecture Notes in Computer Science
#citation24
#index3491
#arnetid3493
#%773605
#%621
#%770263
#%2337
#%545210
#%1009341
#%2358
#%597946
#%1009332
#%617603
#%371446
#%541916
#%542018
#%643898
#%335939
#%744483
#%2068
#%1113205
#%1009791
#%874681
#%172614
#%769973
#%559700
#%559929
#%559979
#%1009199
#%2291
#%335122
#%336016
#%1033533
#%1009691
#%1009338
#%623199
#%390538
#%816244
#%389255
#%389410
#%515182
#%390685
#%1030972
#%744912

#*Spielbaum-Suchverfahren
#@Alexander Reinefeld
#year1989
#confInformatik-Fachberichte
#citation37
#index3492
#arnetid3494
#!By themselves, speech recognition and natural language processing have limited applications, the reason is that each only accomplishes a part of what humans are capable of when they use language. Spoken language systems represent the merger of these two technologies and provide an integrated functionality that more closely approximates humans capabilities in speech communication.

#*The Traveling Salesman, Computational Solutions for TSP Applications
#@Gerhard Reinelt
#year1994
#confLecture Notes in Computer Science
#citation458
#index3493
#arnetid3495
#%950932
#%951503
#%949662
#%1014031
#%621767
#%1013632
#%1013738
#%1013426
#%1014029
#%773814
#%1059764
#%930850
#%622431
#%930917
#%211767
#%839405
#%933841
#%2020
#%110709
#%111079
#%1080368

#*Petrinetze, Eine Einführung
#@Wolfgang Reisig
#year1982
#conf
#citation5
#index3494
#arnetid3496

#*Systementwurf mit Netzen
#@Wolfgang Reisig
#year1985
#conf
#citation73
#index3495
#arnetid3497

#*Petri Nets: An Introduction
#@Wolfgang Reisig
#year1985
#confMonographs in Theoretical Computer Science. An EATCS Series
#citation2042
#index3496
#arnetid3498

#*Petrinetze, Eine Einführung, 2. Auflage
#@Wolfgang Reisig
#year1986
#conf
#citation-1
#index3497
#arnetid3499

#*Elements of distributed algorithms: modeling and analysis with Petri nets
#@Wolfgang Reisig
#year1998
#conf
#citation3
#index3498
#arnetid3500

#*Recognizing Planar Objects Using Invariant Image Features
#@Thomas H. Reiss
#year1993
#confLecture Notes in Computer Science
#citation204
#index3499
#arnetid3501

#*Qualitative Spatial Reasoning with Topological Information
#@Jochen Renz
#year2002
#confLecture Notes in Computer Science
#citation64
#index3500
#arnetid3502
#%116849
#%71823
#%98701
#%950637
#%811852
#%751758
#%748468
#%745079
#%3367
#%2472
#%950464
#%950942
#%746137
#%477927
#%232802
#%477501
#%617629
#%469025
#%116766
#%744791
#%744672
#%744793
#%621767
#%295660
#%623061
#%976716
#%745305
#%479992
#%11850
#%700
#%976718
#%3480
#%390294
#%388448
#%952238
#%388663
#%816251
#%816216
#%387921
#%387363
#%788850

#*Die Interpretation des Verhaltens mehrerer Akteure in Szenenfolgen
#@Gudula Retz-Schmidt
#year1992
#confInformatik-Fachberichte
#citation14
#index3501
#arnetid3503

#*Introduction to Constraint Databases
#@Peter Z. Revesz
#year2002
#conf
#citation158
#index3502
#arnetid3504
#!Introduction to Constraint Databases comprehensively covers both constraint-database theory and several sample systems. The book reveals how constraint databases bring together techniques from a variety of fields, such as logic and model thoery, algebraic and computational geometry, and symbolic computation, to the design and analysis of data models and query languages. Constraint databases are shown to be powerful and simple tools for data modeling and querying in application areas---such as environmental modeling, bioinformatics, and computer vision---that are not suitable for relational databases. Specific applications are examined in geographic information systems, spatiotemporal data management, linear programming, genome databases, model checking of automata, and other areas.

#*Coevolutionary Fuzzy Modeling
#@Carlos Andrés Peña-Reyes
#year2004
#confLecture Notes in Computer Science
#citation29
#index3503
#arnetid3505

#*The Cray X-MP/Model 24, A Case Study in Pipelined Architecture and Vector Processing
#@Kay A. Robbins,Steven Robbins
#year1989
#confLecture Notes in Computer Science
#citation-1
#index3504
#arnetid3506

#*Intelligent Perceptual Systems: New Directions in Computational Perception
#@Vito Roberto
#year1993
#confLecture Notes in Computer Science
#citation0
#index3505
#arnetid3507

#*Broadband Network Teletraffic - Performance Evaluation and Design of Broadband Multiservice Networks: Final Report of Action COST 242
#@James W. Roberts,Ugo Mocci,Jorma T. Virtamo
#year1996
#confLecture Notes in Computer Science
#citation-1
#index3506
#arnetid3508

#*Neural Nets - A Theory for Brains and Machines
#@Armando Freitas da Rocha
#year1992
#confLecture Notes in Computer Science
#citation49
#index3507
#arnetid3509

#*Parallele Systeme
#@Johannes Röhrich
#year1986
#confInformatik-Fachberichte
#citation-1
#index3508
#arnetid3510

#*Feedback Shift Registers
#@Christian Ronse
#year1984
#confLecture Notes in Computer Science
#citation19
#index3509
#arnetid3511

#*Entscheidungsorientiertes Konfigurationsmagament
#@Thomas Rose
#year1992
#confInformatik-Fachberichte
#citation6
#index3510
#arnetid3512

#*CyberLaw: The Law of the Internet
#@Jonathan Rosenoer
#year1997
#conf
#citation63
#index3511
#arnetid3513

#*Kommunikationskonzepte für verteilte transaktionsorientierte Systeme
#@Kurt Rothermel
#year1987
#confInformatik-Fachberichte
#citation-1
#index3512
#arnetid3514

#*A Connotational Theory of Program Structure
#@James S. Royer
#year1987
#confLecture Notes in Computer Science
#citation43
#index3513
#arnetid3515

#*Efficient Visual Recognition Using the Hausdorff Distance
#@William Rucklidge
#year1996
#confLecture Notes in Computer Science
#citation133
#index3514
#arnetid3516

#*Operational Semantics for Timed Systems: A Non-standard Approach to Uniform Modeling of Timed and Hybrid Systems
#@Heinrich Rust
#year2005
#confLecture Notes in Computer Science
#citation2
#index3515
#arnetid3517

#*Interacting Code Motion Transformations: Their Impact and Their Complexity.
#@Oliver Rüthing
#year1998
#confLecture Notes in Computer Science
#citation12
#index3516
#arnetid3518
#%950806
#%950257
#%545916
#%289578
#%1123728
#%542678
#%1123391
#%1123447
#%546032
#%546670
#%546427
#%546049
#%1123660
#%1057183
#%542655
#%1123652
#%542363
#%1123396
#%542677
#%546157
#%81264
#%572863
#%229796
#%188830
#%625658
#%542300
#%1123962
#%2346
#%774398
#%770703
#%600814
#%621107
#%542433
#%546834
#%542503
#%626691
#%17656
#%17263
#%77
#%3496
#%740956
#%553039
#%1123416
#%546011
#%546696
#%548433
#%1067347
#%1128283

#*Kryptographische Verfahren in der Datenverarbeitung
#@Norbert Ryska,Siegfried Herda
#year1980
#confInformatik-Fachberichte
#citation6
#index3517
#arnetid3519

#*Computational Cardiology: Modeling of Anatomy, Electrophysiology, and Mechanics
#@Frank B. Sachse
#year2004
#confLecture Notes in Computer Science
#citation57
#index3518
#arnetid3520

#*Darstellung und Nutzung von Expertenwissen für ein Bildanalysesystem
#@Gerhard Sagerer
#year1985
#confInformatik-Fachberichte
#citation-1
#index3519
#arnetid3521

#*Data Compression: The Complete Reference, 3rd Edition
#@David Salomon
#year2004
#conf
#citation-1
#index3520
#arnetid3522

#*A Relational Theory of Computing
#@John G. Sanderson
#year1980
#confLecture Notes in Computer Science
#citation22
#index3521
#arnetid3523

#*Using Sophisticated Models in Resolution Theorem Proving
#@David M. Sandford
#year1980
#confLecture Notes in Computer Science
#citation11
#index3522
#arnetid3524

#*Workflow Management Systems for Process Organisations
#@Thomas Schael
#year1996
#confLecture Notes in Computer Science
#citation118
#index3523
#arnetid3525

#*View Synthesis Using Stereo Vision
#@Daniel Scharstein
#year1999
#confLecture Notes in Computer Science
#citation75
#index3524
#arnetid3526
#!This thesis investigates the use of stereo vision for the application of view synthesis. View synthesis --the problem of creating images of a scene as it would appear from novel viewpoints --has traditionally been approached using methods from computer graphics. These methods, however, suffer from low rendering speed, limited achievable realism, and, most severely, their dependence on a global scene model, which typically needs to be constructed manually. In this thesis, we present a new approach to view synthesis that avoids the above problems by synthesizing new views from existing images of a scene. Using an image-based representation of scene geometry computed by stereo vision methods, a global model can be avoided, and realistic new views can be synthesized quickly using image warping. The new application of stereo for view synthesis makes it necessary to re-evaluate the requirements on stereo algorithms. We compare view synthesis to several traditional applications of stereo, and conclude that stereo vision is better suited for view synthesis than for applications requiring explicit 3D reconstruction. We also discuss ways of dealing with partially occluded regions of unknown depth and with completely occluded regions of unknown texture, and present experiments demonstrating that it is possible to efficiently synthesize realistic new views even from inaccurate and incomplete depth information. This thesis also contributes several novel stereo algorithms that are motivated by the specific requirements imposed by view synthesis. We introduce a new evidence measure based on intensity gradients for establishing correspondences between images. This measure combines the notions of similarity and confidence, and allows stable matching and easy assigning of canonical depth interpretations in image regions of insufficient information. We also present new diffusion-based stereo algorithms that are motivated by the need to correctly recover object boundaries. In particular, we develop a novel Bayesian estimation technique that significantly outperforms area-based algorithms using fixed-sized windows. We provide experimental results for all algorithms on both synthetic and real images.

#*The Automation of Reasoning with Incomplete Information, From Semantic Foundations to Efficient Computation.
#@Torsten Schaub
#year1998
#confLecture Notes in Computer Science
#citation13
#index3525
#arnetid3527

#*Universal Routing Strategies for Interconnection Networks
#@Christian Scheideler
#year1998
#confLecture Notes in Computer Science
#citation39
#index3526
#arnetid3528

#*Bildanalyse allgemeiner Dokumente
#@Wolfgang Scherl
#year1987
#confInformatik-Fachberichte
#citation8
#index3527
#arnetid3529

#*Migrationssteuerung und Konfigurationsverwaltung für verteilte objektorientierte Anwendungen
#@Alexander Schill
#year1990
#confInformatik-Fachberichte
#citation-1
#index3528
#arnetid3530

#*Nonmonotonic Logics, Basic Concepts, Results, and Techniques
#@Karl Schlechta
#year1997
#confLecture Notes in Computer Science
#citation40
#index3529
#arnetid3531

#*Inductive Synthesis of Functional Programs, Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning
#@Ute Schmid
#year2003
#confLecture Notes in Computer Science
#citation9
#index3530
#arnetid3532

#*Computational Aspects of an Order-Sorted Logic with Term Declarations
#@Manfred Schmidt-Schauß
#year1989
#confLecture Notes in Computer Science
#citation-1
#index3531
#arnetid3533

#*GPSS-FORTRAN, Version II: Einführung in die Simulation diskreter Systeme mit Hilfe eines FORTRAN-Programmpaketes
#@Bernd Schmidt
#year1977
#confInformatik-Fachberichte
#citation0
#index3532
#arnetid3534

#*Meta-Level Control for Deductive Database Systems
#@Helmut Schmidt
#year1991
#confLecture Notes in Computer Science
#citation10
#index3533
#arnetid3535

#*Relationen und Graphen
#@Gunther Schmidt,Thomas Ströhlein
#year1989
#confMathematik für Informatiker
#citation98
#index3534
#arnetid3536

#*Relations and Graphs - Discrete Mathematics for Computer Scientists
#@Gunther Schmidt,Thomas Ströhlein
#year1993
#confEATCS Monographs on Theoretical Computer Science
#citation124
#index3535
#arnetid3537

#*Theorie der logischen Programmierung
#@Peter H. Schmitt
#year1992
#conf
#citation-1
#index3536
#arnetid3538

#*Spatial Data Types for Database Systems, Finite Resolution Geometry for Geographic Information Systems
#@Markus Schneider
#year1997
#confLecture Notes in Computer Science
#citation37
#index3537
#arnetid3539

#*Peer-to-Peer: Ökonomische, technische und juristische Perspektiven, Das aktuelle P2P-Buch.
#@Detlef Schoder,Kai Fischbach,Rene Teichmann
#year2002
#conf
#citation-1
#index3538
#arnetid3540

#*Complexity and Structure
#@Uwe Schöning
#year1986
#confLecture Notes in Computer Science
#citation126
#index3539
#arnetid3541

#*Generierung von Worthypothesen in kontinuierlicher Sprache
#@Ernst Günter Schukat-Talamazzini
#year1987
#confInformatik-Fachberichte
#citation0
#index3540
#arnetid3542

#*Programming Constraint Services: High-Level Programming of Standard and New Constraint Services
#@Christian Schulte
#year2002
#confLecture Notes in Computer Science
#citation11
#index3541
#arnetid3543
#%328667
#%1123563
#%1025248
#%568429
#%328098
#%367138
#%3695
#%832630
#%605691
#%328434
#%159
#%327777
#%1123546
#%328418
#%117726
#%117696
#%117629
#%1007037
#%1007071
#%225128
#%117188
#%543242
#%547997
#%543342
#%543239
#%189028
#%543065
#%465214
#%605667
#%1123282
#%546270
#%1123855
#%1025069
#%1356155
#%1117216
#%2133
#%745263
#%3435
#%790108
#%388768
#%389763
#%391025
#%546721
#%744702
#%984402

#*Testmustergenerierung und Fehlersimulation in digitalen Schaltungen mit hoher Komplexität
#@Michael H. Schulz
#year1988
#confInformatik-Fachberichte
#citation-1
#index3542
#arnetid3544

#*Objective Coordination in Multi-Agent System Engineering - Design and Implementation
#@Michael Schumacher
#year2001
#confLecture Notes in Computer Science
#citation70
#index3543
#arnetid3545
#%151959
#%116284
#%70426
#%33858
#%567693
#%568205
#%566940
#%30076
#%329311
#%166626
#%488753
#%166655
#%793734
#%166658
#%745894
#%773966
#%1129462
#%771424
#%544070
#%811217
#%832821
#%769777
#%488564
#%173961
#%173580
#%92690
#%116431
#%55637
#%56020
#%116333
#%116326
#%116266
#%116267
#%116305
#%116265
#%116290
#%116287
#%116335
#%116361
#%55760
#%116491
#%173564
#%116488
#%116344
#%529963
#%525908
#%368334
#%69253
#%51473
#%434759
#%773967
#%772628
#%1035347
#%29890
#%568129
#%1033978
#%832277
#%56725
#%1128205
#%738680
#%893621
#%805939
#%1028927
#%1067567
#%2617
#%1056597
#%772069
#%698
#%2599
#%1123509
#%1091489
#%247690
#%751178
#%388431
#%388657
#%745043
#%744348
#%810808
#%832199
#%745040

#*Security Engineering with Patterns - Origins, Theoretical Models, and New Applications
#@Markus Schumacher
#year2003
#confLecture Notes in Computer Science
#citation43
#index3544
#arnetid3546

#*Higher-Level Hardware Synthesis
#@Richard Sharp
#year2004
#confLecture Notes in Computer Science
#citation13
#index3545
#arnetid3547

#*Paragon: A Language Using Type Hierarchies for the Specification, Implementation and Selection of Abstract Data Types
#@Mark Sherman
#year1985
#confLecture Notes in Computer Science
#citation3
#index3546
#arnetid3548

#*Multiagent Systems - A Theoretical Framework for Intentions, Know-How, and Communications
#@Munindar P. Singh
#year1994
#confLecture Notes in Computer Science
#citation185
#index3547
#arnetid3549

#*Evolution of Parallel Cellular Machines, The Cellular Programming Approach
#@Moshe Sipper
#year1997
#confLecture Notes in Computer Science
#citation3
#index3548
#arnetid3550

#*Matrix Eigensystem Routines - EISPACK Guide, Second Edition
#@Brian T. Smith,James M. Boyle,Jack Dongarra,Burton S. Garbow,Yasuhiko Ikebe,Virginia C. Klema,Cleve B. Moler
#year1976
#confLecture Notes in Computer Science
#citation-1
#index3549
#arnetid3551

#*From Logic Design to Logic Programming: Theorem Proving Techniques and P-Functions
#@Dominique Snyers,André Thayse
#year1987
#confLecture Notes in Computer Science
#citation-1
#index3550
#arnetid3552

#*Grading Knowledge, Extracting Degree Information from Texts.
#@Steffen Staab
#year1999
#confLecture Notes in Computer Science
#citation14
#index3551
#arnetid3553
#!"Text Knowledge Extraction" maps natural language texts onto a formal representation of the facts contained in the texts. Common text knowledge extraction methods show a severe lack of methods for understanding natural language "degree expressions", like "expensive hard disk drive" and "good monitor", which describe gradable properties like price and quality, respectively. However, without an adequate understanding of such degree expressions it is often impossible to grasp the central meaning of a text. This book shows concise and comprehensive concepts for extracting degree information from natural language texts. It researches this task with regard to the three levels of (i) analysing natural language degree expressions, (ii) representing them in a terminologic framework, and (iii) inferencing on them byconstrain t propagation. On each of these three levels, the author shows that former approaches to the degree understanding problem were too simplistic, since theyignored byand large the role of the background knowledge involved. Thus, he gives a constructive verification of his central hypothesis, viz. that the proper extraction of grading knowledge relies heavilyon background grading knowledge. This construction proceeds as follows. First, the author gives an overview of the ParseTalk information extraction system. Then, from the review of relevant linguistic literature, the author derives two distinct categories of natural language degree expressions and proposes knowledge-intensive algorithms to handle their analyses in the ParseTalk system. These methods are applied to two text domains, viz. a medical diagnosis domain and a repositoryof texts from information technologymagazines. Moreover, for inferencing the author generalizes from well-known constraint propagation mechanisms. This generalization is especiallyapt for representing and reasoning with natural language degree expressions, but it is also interesting from the point of view where it originated, viz. the field of temporal reasoning. The conclusion of the book gives an integration of all three levels of understanding showing that their coupling leads to an even more advanced -- and more efficient -- performance of the proposed mechanisms.

#*Handbook on Ontologies
#@Steffen Staab,Rudi Studer
#year2004
#confHandbook on Ontologies
#citation552
#index3552
#arnetid3554

#*Ausführbare Spezifikation von Directory-Systemen in einer logischen Sprache
#@Rolf Stadler
#year1991
#confInformatik-Fachberichte
#citation-1
#index3553
#arnetid3555

#*Java and the Java Virtual Machine: Definition, Verification, Validation
#@Robert F. Stärk,Joachim Schmid,Egon Börger
#year2001
#conf
#citation24
#index3554
#arnetid3556

#*Datenschutz bei riskanten Systemen: Eine Konzeption entwickelt am Beispiel eines medizinischen Informationssystems
#@Wilhelm Steinmüller,L. Ermer,W. Schimmel
#year1978
#confInformatik-Fachberichte
#citation0
#index3555
#arnetid3557

#*Stateless Core: A Scalable Approach for Quality of Service in the Internet, Winning Thesis of the 2001 ACM Doctoral Dissertation Competition
#@Ion Stoica
#year2004
#confLecture Notes in Computer Science
#citation1
#index3556
#arnetid3558

#*Test von OSI-Protokollen
#@Willi Stoll
#year1989
#confInformatik-Fachberichte
#citation1
#index3557
#arnetid3559

#*Fehlertoleranz in verteilten Realzeitsystemen: Anwendungsorientierte Techniken
#@Jürgen J. Stoll
#year1990
#confInformatik-Fachberichte
#citation1
#index3558
#arnetid3560

#*Maschinen-unabhängige Code-Erzeugung als semantikerhaltende beweisbare Programmtransformation
#@Herbert Stoyan
#year1984
#confInformatik-Fachberichte
#citation-1
#index3559
#arnetid3561

#*Konzepte für eine verteilte wissensbasierte Softwareproduktionsumgebung
#@Rudi Studer
#year1987
#confInformatik-Fachberichte
#citation-1
#index3560
#arnetid3562

#*A Hierarchical Associative Processing System
#@Heinrich J. Stüttgen
#year1985
#confLecture Notes in Computer Science
#citation7
#index3561
#arnetid3563

#*Multimedia Database System: Issues and Research Direction
#@V. S. Subrahmanian,Sushil Jajodia
#year1996
#conf
#citation-1
#index3562
#arnetid3564

#*Efficient Checking of Polynomials and Proofs anf the Hardness of Approximation Problems
#@Madhu Sudan
#year1995
#confLecture Notes in Computer Science
#citation86
#index3563
#arnetid3565

#*Turing Machines with Sublogarithmic Space
#@Andrzej Szepietowski
#year1994
#confLecture Notes in Computer Science
#citation79
#index3564
#arnetid3566

#*Ada 95 Reference Manual, Language and Standard Libraries, International Standard ISO/IEC 8652: 1995(E)
#@S. Tucker Taft,Robert A. Duff
#year1997
#confLecture Notes in Computer Science
#citation47
#index3565
#arnetid3567

#*Consolidated Ada Reference Manual. Language and Standard Libraries, International Standard ISO/IEC 8652/1995(E) with Technical Corrigendum 1
#@S. Tucker Taft,Robert A. Duff,Randall Brukardt,Erhard Plodereder
#year2001
#confLecture Notes in Computer Science
#citation9
#index3566
#arnetid3568

#*Artificail Perception and Music Recognition
#@Andranick Tanguiane
#year1993
#confLecture Notes in Computer Science
#citation-1
#index3567
#arnetid3569

#*Finite Representations of CCS and TCSP Programs by Automata and Petri Nets
#@Dirk Taubner
#year1989
#confLecture Notes in Computer Science
#citation110
#index3568
#arnetid3570

#*Flagorientierte Assoziativspeicher und -prozessoren
#@Djamshid Tavangarian
#year1990
#confInformatik-Fachberichte
#citation1
#index3569
#arnetid3571

#*Towards Dynamic Randomized Algorithms in Computational Geometry
#@Monique Teillaud
#year1993
#confLecture Notes in Computer Science
#citation18
#index3570
#arnetid3572

#*Boolean Caclulus of Differences
#@André Thayse
#year1981
#confLecture Notes in Computer Science
#citation40
#index3571
#arnetid3573

#*P-Functions and Boolean Matrix Factorization: A Unified Approach for Wired, Programmed and Microprogrammed Implementations of Discrete Algorithms
#@André Thayse
#year1984
#confLecture Notes in Computer Science
#citation0
#index3572
#arnetid3574

#*Algorithms for Parallel Polygon Rendering
#@Theoharis Theoharis
#year1989
#confLecture Notes in Computer Science
#citation20
#index3573
#arnetid3575

#*Challenges for Action Theories
#@Michael Thielscher
#year2000
#confLecture Notes in Computer Science
#citation5
#index3574
#arnetid3576

#*The Computational Complexity of Equivalence and Isomorphism Problems
#@Thomas Thierauf
#year2000
#confLecture Notes in Computer Science
#citation15
#index3575
#arnetid3577
#%104307
#%950742
#%951541
#%950589
#%209846
#%211426
#%1338655
#%854513
#%861729
#%971664
#%1089658
#%783642
#%1078293
#%933863
#%627477
#%204439
#%477312
#%267187
#%493218
#%494273
#%619987
#%619762
#%620784
#%267985
#%267185
#%198117
#%494443
#%932626
#%621693
#%1079362
#%621767
#%623039
#%832295
#%211766
#%623070
#%622629
#%1078391
#%888571
#%1060531
#%700
#%971401
#%971399
#%931207
#%930132
#%3539
#%623202
#%1078390
#%3668
#%3415
#%1059354
#%620749

#*Visualization of Scientific Parallel Programs
#@Gerald Tomas,Christoph W. Ueberhuber
#year1994
#confLecture Notes in Computer Science
#citation-1
#index3576
#arnetid3578

#*Global Optimization
#@Aimo A. Törn,Antanas Zilinskas
#year1989
#confLecture Notes in Computer Science
#citation28
#index3577
#arnetid3579

#*Current Trends in Concurrency, Overviews and Tutorials
#@J. W. de Bakker,Willem P. de Roever,Grzegorz Rozenberg
#year1986
#confCurrent Trends in Concurrency
#citation3
#index3578
#arnetid3580

#*Extraction and Exploitation of Intensional Knowledge from Heterogeneous Information Sources: Semi-Automatic Approaches and Tools
#@Domenico Ursino
#year2002
#confLecture Notes in Computer Science
#citation4
#index3579
#arnetid3581

#*Algorithms on Trees and Graphs
#@Gabriel Valiente
#year2002
#conf
#citation185
#index3580
#arnetid3582

#*Uncertainty Handling and Quality Assessment in Data Mining
#@Michalis Vazirgiannis,Maria Halkidi,Dimitrios Gunopulos
#year2003
#conf
#citation25
#index3581
#arnetid3583
#!:"Uncertainty Handling and Quality Assessment in Data Mining provides an introduction to the application of these concepts in Knowledge Discovery and Data Mining. It reviews the state-of-the-art in uncertainty handling and discusses a framework for unveiling and handling uncertainty. Coverage of quality assessment begins with an introduction to cluster analysis and a comparison of the methods and approaches that may be used. The techniques and algorithms involved in other essential data mining tasks, such as classification and extraction of association rules, are also discussed together with a review of the quality criteria and techniques for evaluating the data mining results." "This book presents a general framework for assessing quality and handling uncertainty, which is based on tested concepts and theories. This framework forms the basis of an implementation tool, 'UMiner' which is introduced to the reader for the first time." Aimed at IT professionals involved with data mining and knowledge discovery, the work is supported with case studies from epidemiology that illustrate how the tool works in 'real-world' data mining projects. The book would also be of interest to final year undergraduates or post-graduate students looking at databases, algorithms, artificial intelligence and information systems particularly with regard to uncertainty and quality assessment.

#*Interactive Multimedia Documents: Modeling, Authoring, and Implementation Experiences
#@Michalis Vazirgiannis
#year1999
#confLecture Notes in Computer Science
#citation10
#index3582
#arnetid3584
#%465301
#%502043
#%599481
#%545482
#%1011298
#%502831
#%502454
#%598201
#%982085
#%545355
#%643698
#%373351
#%642259
#%1011345
#%893971
#%1113172
#%893908
#%769973
#%331405
#%800584
#%599056
#%598717
#%599454
#%165
#%598136

#*Matchmaking in Electronic Markets - An Agent-Based Approach towards Matchmaking in Electronic Negotiations
#@Daniel Veit
#year2003
#confLecture Notes in Computer Science
#citation10
#index3583
#arnetid3585

#*Planning and Learning by Analogical Reasoning
#@Manuela M. Veloso
#year1994
#confLecture Notes in Computer Science
#citation278
#index3584
#arnetid3586

#*Closed Object Boundaries from Scattered Points
#@Remco C. Veltkamp
#year1994
#confLecture Notes in Computer Science
#citation43
#index3585
#arnetid3587

#*Intelligent Information Integration for the Semantic Web
#@Ubbo Visser
#year2004
#confLecture Notes in Computer Science
#citation53
#index3586
#arnetid3588

#*Signaturanalyse: Theoretische Grundlagen und Probleme; Ausblick auf Anwendungen
#@Lutz Voelkel,Jürgen Pliquett
#year1989
#confInformatik-Fachberichte
#citation0
#index3587
#arnetid3589

#*Software-Diversität und ihre Modellierung: Software-Fehlertoleranz und ihre Bewertung durch Fehler- und Kostenmodelle
#@Udo Voges
#year1989
#confInformatik-Fachberichte
#citation-1
#index3588
#arnetid3590

#*Modular Construction and Partial Order Semantics of Petri Nets
#@Walter Vogler
#year1992
#confLecture Notes in Computer Science
#citation91
#index3589
#arnetid3591

#*Relational Matching
#@George Vosselman
#year1992
#confLecture Notes in Computer Science
#citation90
#index3590
#arnetid3592

#*Vivid Logic: Knowledge-Based Reasoning with Two Kinds of Negation
#@Gerd Wagner
#year1994
#confLecture Notes in Computer Science
#citation57
#index3591
#arnetid3593

#*Natürlichsprachliche Argumentation in Dialogsystemen: KI-Verfahren zur Rekonstruktion und Erklärung approximativer Inferenzprozesse
#@Wolfgang Wahlster
#year1981
#confInformatik-Fachberichte
#citation-1
#index3592
#arnetid3594

#*Alternating Sequential/Parallel Processing
#@Yehuda Wallach
#year1982
#confLecture Notes in Computer Science
#citation25
#index3593
#arnetid3595

#*Integer Optimization by Local Search
#@Joachim P. Walser
#year1999
#confLecture Notes in Computer Science
#citation-1
#index3594
#arnetid3596

#*Datenbankgestützte Repräsentation und Extraktion von Episodenbeschreibungen aus Bildfolgen
#@Ingrid M. Walter
#year1989
#confInformatik-Fachberichte
#citation-1
#index3595
#arnetid3597

#*Data Mining in Bioinformatics
#@Jason Tsong-Li Wang,Mohammed Javeed Zaki,Hannu Toivonen,Dennis Shasha
#year2005
#conf
#citation50
#index3596
#arnetid3598

#*The Logic of Information Structures
#@Heinrich Wansing
#year1993
#confLecture Notes in Computer Science
#citation118
#index3597
#arnetid3599

#*The Generic Development Language Deva: Presentation and Case Studies
#@Matthias Weber,Martin Simons,Christine Lafontaine
#year1993
#confLecture Notes in Computer Science
#citation-1
#index3598
#arnetid3600

#*Komplexitätstheorie: Grenzen der Effizienz von Algorithmen
#@Ingo Wegener
#year2003
#conf
#citation-1
#index3599
#arnetid3601

#*A Methodology for Uncertainty in Knowledge-Based Systems
#@Kurt Weichselberger,Sigrid Pöhlmann
#year1990
#confLecture Notes in Computer Science
#citation60
#index3600
#arnetid3602

#*Revisions- und Konsistenzkontrolle in einer integrierten Softwareentwicklungsumgebung
#@Bernhard Westfechtel
#year1991
#confInformatik-Fachberichte
#citation17
#index3601
#arnetid3603

#*Models and Tools for Managing Development Processes
#@Bernhard Westfechtel
#year1999
#confLecture Notes in Computer Science
#citation38
#index3602
#arnetid3604
#%188060
#%300249
#%200851
#%578400
#%625708
#%150361
#%642733
#%1076212
#%832416
#%362166
#%362542
#%1124264
#%1127398
#%361701
#%362167
#%601333
#%795364
#%882377
#%855968
#%1124371
#%1124238
#%2626
#%996155
#%4
#%8
#%24
#%832821
#%197
#%578348
#%578319
#%578327
#%578277
#%183105
#%661008
#%578188
#%183225
#%228859
#%578324
#%635265
#%578192
#%578187
#%578275
#%578189
#%228714
#%578379
#%578265
#%219470
#%578313
#%578178
#%578391
#%660996
#%625727
#%188165
#%200814
#%200795
#%188161
#%188155
#%188188
#%300960
#%188172
#%200977
#%188213
#%200809
#%200767
#%200817
#%642294
#%412845
#%412858
#%412839
#%979731
#%412863
#%832456
#%1124176
#%412860
#%1065615
#%1373753
#%845708
#%412840
#%188198
#%361318
#%1124390
#%412851
#%772016
#%188119
#%412862
#%471530
#%1070522
#%1138127
#%176235
#%1071769
#%1128459
#%1138149
#%1127397
#%1339472
#%578709
#%1252575
#%559941
#%363264
#%581489
#%362941
#%578353
#%2617
#%74010
#%808521
#%771075
#%578389
#%773598
#%598077
#%806144
#%361807
#%362821
#%2599
#%375719
#%1120077
#%1128322
#%1123493
#%363093
#%793483
#%1056831
#%793575
#%3496
#%599004
#%362485
#%447324
#%832706
#%599036
#%191
#%578323
#%1075034
#%578686
#%362237
#%832199
#%660925
#%598261
#%361253
#%362917
#%684744

#*Übersetzerbau - Theorie, Konstruktion, Generierung
#@Reinhard Wilhelm,Dieter Maurer
#year1992
#conf
#citation75
#index3603
#arnetid3605

#*Übersetzerbau - Theorie, Konstruktion, Generierung, 2. Auflage
#@Reinhard Wilhelm,Dieter Maurer
#year1997
#conf
#citation-1
#index3604
#arnetid3606

#*Instantiation Theory - On the Foundations of Automated Deduction
#@James G. Williams
#year1991
#confLecture Notes in Computer Science
#citation4
#index3605
#arnetid3607

#*Systematische Software-Qualitätssicherung anhand von Qualitäts- und Produktmodellen
#@Heidemarie Willmer
#year1985
#confInformatik-Fachberichte
#citation-1
#index3606
#arnetid3608

#*Programming in Modula 2
#@Niklaus Wirth
#year1982
#conf
#citation1101
#index3607
#arnetid3609

#*Programmieren in Modula-2
#@Niklaus Wirth
#year1985
#conf
#citation23
#index3608
#arnetid3610

#*Grammars and L Forms: An Introduction
#@Derick Wood
#year1980
#confLecture Notes in Computer Science
#citation0
#index3609
#arnetid3611

#*Artificial Intelligence Today: Recent Trends and Developments
#@Michael Wooldridge,Manuela M. Veloso
#year1999
#confLecture Notes in Computer Science
#citation6
#index3610
#arnetid3612

#*Probabilistische Verfahren für den Test hochintegrierter Schaltungen
#@Hans-Joachim Wunderlich
#year1987
#confInformatik-Fachberichte
#citation-1
#index3611
#arnetid3613

#*Multicast-Kommunikation in verteilten Systemen
#@Dieter Wybranietz
#year1990
#confInformatik-Fachberichte
#citation7
#index3612
#arnetid3614

#*Attribute Grammar Inversion and Source-to-source Translation
#@Daniel M. Yellin
#year1988
#confLecture Notes in Computer Science
#citation18
#index3613
#arnetid3615

#*High-Dimensional Indexing: Transformational Approaches to High-Dimensional Range and Similarity Searches
#@Cui Yu
#year2002
#confLecture Notes in Computer Science
#citation12
#index3614
#arnetid3616
#%1138228
#%599562
#%599060
#%1992
#%597974
#%845705
#%599145
#%26638
#%599600
#%599650
#%598661
#%598602
#%599517
#%600010
#%502930
#%1983
#%832253
#%598202
#%598658
#%598201
#%982085
#%617619
#%617531
#%642221
#%643009
#%643863
#%642620
#%643636
#%643698
#%300105
#%301414
#%643432
#%643106
#%642259
#%642599
#%642218
#%643687
#%643562
#%299896
#%643994
#%642312
#%642258
#%299494
#%643565
#%642198
#%599619
#%598997
#%1064734
#%598177
#%232770
#%598017
#%598866
#%599002
#%1138180
#%599079
#%1112586
#%1112428
#%832197
#%599038
#%769973
#%938854
#%938576
#%1065257
#%598936
#%3188
#%832515
#%599454
#%598935
#%598136
#%1118511
#%545009
#%1128048

#*Association Rule Mining, Models and Algorithms
#@Chengqi Zhang,Shichao Zhang
#year2002
#confLecture Notes in Computer Science
#citation159
#index3615
#arnetid3617
#%599115
#%473401
#%472616
#%598819
#%754860
#%839551
#%839594
#%951522
#%95338
#%845799
#%599799
#%472775
#%599503
#%1118296
#%597946
#%617575
#%551964
#%141050
#%632876
#%541598
#%361055
#%299713
#%542062
#%301048
#%642728
#%641830
#%526711
#%541908
#%60009
#%643653
#%60011
#%541953
#%643898
#%67960
#%893280
#%598124
#%2074
#%599865
#%598200
#%598199
#%599979
#%544835
#%643801
#%745252
#%599728
#%599418
#%598816
#%1112603
#%1113258
#%1112350
#%1112545
#%1112757
#%875088
#%1112527
#%1112358
#%1112867
#%1113727
#%1113505
#%745355
#%1063670
#%2042
#%632172
#%334590
#%390879
#%931542
#!Due to the popularity of knowledge discovery and data mining, in practice as well as among academic and corporate R&D professionals, association rule mining is receiving increasing attention. The authors present the recent progress achieved in mining quantitative association rules, causal rules, exceptional rules, negative association rules, association rules in multi-databases, and association rules in small databases. This book is written for researchers, professionals, and students working in the fields of data mining, data analysis, machine learning, and knowledge discovery in databases, and for anyone who is interested in association rule mining.

#*Agent-Based Hybrid Intelligent Systems: An Agent-Based Framework for Complex Problem Solving
#@Zili Zhang,Chengqi Zhang
#year2004
#confLecture Notes in Computer Science
#citation46
#index3616
#arnetid3618

#*Kopplung von Rechnernetzen: Techniken zu Planung, Entwurf, Vermessung und Leistungsoptimierung
#@Martin Zieher
#year1989
#confInformatik-Fachberichte
#citation0
#index3617
#arnetid3619

#*Automatische Komplexitätsanalyse funktionaler Programme
#@Wolf Zimmermann
#year1990
#confInformatik-Fachberichte
#citation-1
#index3618
#arnetid3620

#*Y12M - Solution of Large and Sparse Systems of Linear Algebraic Equations
#@Zahari Zlatev,Jerzy Wasniewski,Kjeld Schaumburg
#year1981
#confLecture Notes in Computer Science
#citation47
#index3619
#arnetid3621

#*John Zukowski's Definitive Guide to Swing for Java 2
#@John Zukowski
#year1999
#conf
#citation-1
#index3620
#arnetid3622

#*Compositionality, Concurrency and Partial Correctness - Proof Theories for Networks of Processes, and Their Relationship
#@Job Zwiers
#year1989
#confLecture Notes in Computer Science
#citation100
#index3621
#arnetid3623

#*Multi-Agent Programming: Languages, Platforms and Applications
#@Rafael H. Bordini,Mehdi Dastani,Jurgen Dix,Amal El Fallah-Seghrouchni
#year2005
#confMulti-Agent Programming
#citation143
#index3622
#arnetid3624

#*Web Dynamics - Adapting to Change in Content, Size, Topology and Use
#@Mark Levene,Alexandra Poulovassilis
#year2004
#conf
#citation15
#index3623
#arnetid3625

#*Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition.
#@Malte Helmert
#year2008
#confLecture Notes in Computer Science
#citation4
#index3624
#arnetid3626
#%104508
#%12041
#%165209
#%165934
#%745411
#%1058782
#%751718
#%744520
#%745243
#%744361
#%15600
#%174361
#%174387
#%174377
#%14683
#%12897
#%1128386
#%949556
#%745152
#%745047
#%209906
#%744523
#%745922
#%165374
#%745003
#%12932
#%745265
#%816360
#%952084
#%388925
#%952330
#%387257
#%952354
#%952179
#%952106
#%391136
#%388404
#%952329
#%387921
#%389172
#%952158
#%952082
#%952192
#%952363
#%2020
#%745161

#*Metrics for Process Models: Empirical Foundations of Verification, Error Prediction, and Guidelines for Correctness.
#@Jan Mendling
#year2008
#confLecture Notes in Business Information Processing
#citation30
#index3625
#arnetid3627

#*OMDoc - An Open Markup Format for Mathematical Documents [version 1.2].
#@Michael Kohlhase
#year2006
#confLecture Notes in Computer Science
#citation50
#index3626
#arnetid3628

#*Software Visualization - Visualizing the Structure, Behaviour, and Evolution of Software.
#@Stephan Diehl
#year2007
#conf
#citation66
#index3627
#arnetid3629

#*Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity.
#@Chryssis Georgiou,Alexander A. Shvartsman
#year2008
#conf
#citation7
#index3628
#arnetid3630

#*Resource Allocation in Wireless Networks: Theory and Algorithms.
#@Slawomir Stanczak,Marcin Wiczanowski,Holger Boche
#year2006
#confLecture Notes in Computer Science
#citation35
#index3629
#arnetid3631

#*Case-Based Approximate Reasoning
#@Eyke Hüllermeier
#year2007
#confTheory and Decision Library
#citation19
#index3630
#arnetid3632

#*Concurrent Zero-Knowledge - With Additional Background by Oded Goldreich
#@Alon Rosen
#year2006
#confInformation Security and Cryptography
#citation3
#index3631
#arnetid3633

#*Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
#@Juraj Hromkovic,Ralf Klasing,Andrzej Pelc,Peter Ruzicka,Walter Unger
#year2005
#confTexts in Theoretical Computer Science. An EATCS Series
#citation0
#index3632
#arnetid3634

#*Algorithms and Data Structures: The Basic Toolbox.
#@Kurt Mehlhorn,Peter Sanders
#year2008
#conf
#citation27
#index3633
#arnetid3635

#*Formal Models of Communicating Systems - Languages, Automata, and Monadic Second-Order Logic
#@Benedikt Bollig
#year2006
#conf
#citation5
#index3634
#arnetid3636

#*Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data
#@Bing Liu
#year2007
#confData-Centric Systems and Applications
#citation265
#index3635
#arnetid3637
#!Web mining aims to discover useful information and knowledge from the Web hyperlink structure, page contents, and usage data. Although Web mining uses many conventional data mining techniques, it is not purely an application of traditional data mining due to the semistructured and unstructured nature of the Web data and its heterogeneity. It has also developed many of its own algorithms and techniques. Liu has written a comprehensive text on Web data mining. Key topics of structure mining, content mining, and usage mining are covered both in breadth and in depth. His book brings together all the essential concepts and algorithms from related areas such as data mining, machine learning, and text processing to form an authoritative and coherent text. The book offers a rich blend of theory and practice, addressing seminal research ideas, as well as examining the technology from a practical point of view. It is suitable for students, researchers and practitioners interested in Web mining both as a learning text and a reference book. Lecturers can readily use it for classes on data mining, Web mining, and Web search. Additional teaching materials such as lecture slides, datasets, and implemented algorithms are available online. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player

#*Data Quality: Concepts, Methodologies and Techniques
#@Carlo Batini,Monica Scannapieco
#year2006
#confData-Centric Systems and Applications
#citation185
#index3636
#arnetid3638

#*Web Services - Concepts, Architectures and Applications
#@Gustavo Alonso,Fabio Casati,Harumi A. Kuno,Vijay Machiraju
#year2004
#confData-Centric Systems and Applications
#citation21
#index3637
#arnetid3639

#*Ada 2005 Rationale: The Language, The Standard Libraries
#@John Barnes
#year2008
#confLecture Notes in Computer Science
#citation2
#index3638
#arnetid3640

#*Ada 2005 Reference Manual. Language and Standard Libraries - International Standard ISO/IEC 8652/1995 (E) with Technical Corrigendum 1 and Amendment 1
#@S. Tucker Taft,Robert A. Duff,Randall Brukardt,Erhard Plödereder,Pascal Leroy
#year2006
#confLecture Notes in Computer Science
#citation27
#index3639
#arnetid3641

#*Cooperative Bug Isolation (Winning Thesis of the 2005 ACM Doctoral Dissertation Competition).
#@Ben Liblit
#year2007
#confLecture Notes in Computer Science
#citation7
#index3640
#arnetid3642
#%362851
#%466784
#%599585
#%361751
#%530303
#%362129
#%499066
#%770398
#%613394
#%81410
#%626711
#%239072
#%636864
#%613041
#%450874
#%1129887
#%450923
#%53628
#%592777
#%361884
#%362972
#%542384
#%530348
#%53625
#%613561
#%545928
#%363471
#%362063

#*Secure Transaction Protocol Analysis: Models and Applications
#@Qingfeng Chen,Chengqi Zhang,Shichao Zhang
#year2008
#confLecture Notes in Computer Science
#citation0
#index3641
#arnetid3643
#%123904
#%124084
#%124000
#%123894
#%123906
#%124025
#%124002
#%13259
#%124097
#%124121
#%951441
#%597964
#%592764
#%598819
#%658930
#%416304
#%192790
#%832416
#%1117430
#%745816
#%83852
#%745410
#%597946
#%1066408
#%202886
#%452691
#%189322
#%625307
#%615641
#%189163
#%145643
#%112849
#%189232
#%373002
#%1057176
#%1128386
#%1113130
#%8312
#%1112547
#%1003392
#%774566
#%771240
#%84122
#%770637
#%1066601
#%604986
#%512568
#%489632
#%13078
#%543545
#%1066284
#%1066497
#%795445
#%1103584
#%613728
#%148125
#%151837
#%388962
#%388347
#%389502
#%805487
#%805443

#*Neural Networks - A Systematic Introduction
#@Raúl Rojas
#year1996
#conf
#citation759
#index3642
#arnetid3644

#*Grid Computing, Experiment Management, Tool Integration, and Scientific Workflows
#@Radu Prodan,Thomas Fahringer
#year2007
#confGrid Computing
#citation10
#index3643
#arnetid3645
#%99906
#%877055
#%82594
#%817606
#%1499622
#%575478
#%877440
#%1275059
#%406538
#%989234
#%344113
#%255357
#%575150
#%574627
#%1073229
#%1034685
#%549650
#%228643
#%635122
#%556066
#%254632
#%410960
#%435451
#%471067
#%236883
#%253656
#%408708
#%617948
#%82566
#%82752
#%237015
#%989167
#%406544
#%83871
#%859299
#%1033980
#%1125845
#%989585
#%806854
#%574814
#%684356
#%410451
#%254911
#%255085
#%255049
#%255152
#%255283
#%568228
#%1065808
#%765270
#%1065887
#%1073072
#%892055
#%1169682
#%236950
#%499749
#%236967
#%243235
#%236816

#*Business Process Management: Concepts, Languages, Architectures
#@Mathias Weske
#year2007
#conf
#citation346
#index3644
#arnetid3646

#*Pedagogically Founded Courseware Generation for Web-Based Learning, An HTN-Planning-Based Approach Implemented in PAIGOS
#@Carsten Ullrich
#year2008
#confLecture Notes in Computer Science
#citation14
#index3645
#arnetid3647
#%1495733
#%731401
#%288127
#%33458
#%815347
#%745497
#%793399
#%808623
#%1231461
#%1136100
#%674434
#%772530
#%458703
#%31046
#%30908
#%458385
#%31051
#%269954
#%793569
#%256117
#%14224
#%751810
#%270593
#%1028554
#%808476
#%789233
#%744638
#%913095
#%390831
#%952211
#%388404
#%390362
#%389941
#%952082
#%748314

#*Kleeme-Algebren Formaler Ausdrücke
#@Armin B. Cremers
#year1974
#confAnnales Academiae Scientiarum Fennecae, Series A
#citation2
#index3646
#arnetid3648

#*Skriptum Informatik: eine konventionelle Einführung, 5. Aufl.
#@Hans-Jürgen Appelrath,Jochen Ludewig
#year2000
#conf
#citation-1
#index3647
#arnetid3649

#*Skriptum Informatik: eine konventionelle Einführung
#@Hans-Jürgen Appelrath,Jochen Ludewig
#year1991
#conf
#citation-1
#index3648
#arnetid3650

#*Skriptum Informatik: eine konventionelle Einführung, 2., durchges. Aufl.
#@Hans-Jürgen Appelrath,Jochen Ludewig
#year1992
#conf
#citation-1
#index3649
#arnetid3651

#*Skriptum Informatik: eine konventionelle Einführung, 3., durchges. und erw. Aufl.
#@Hans-Jürgen Appelrath,Jochen Ludewig
#year1995
#conf
#citation-1
#index3650
#arnetid3652

#*Skriptum Informatik: eine konventionelle Einführung, 4., durchges. Aufl.
#@Hans-Jürgen Appelrath,Jochen Ludewig
#year1999
#conf
#citation-1
#index3651
#arnetid3653

#*Starthilfe Informatik, 2., durchges. Aufl.
#@Hans-Jürgen Appelrath,Dietrich Boles,Volker Claus,Ingo Wegener
#year2000
#conf
#citation0
#index3652
#arnetid3654

#*Starthilfe Informatik
#@Hans-Jürgen Appelrath,Dietrich Boles,Volker Claus,Ingo Wegener
#year1998
#conf
#citation14
#index3653
#arnetid3655

#*Algorithmischen Konzepte der Informatik - Berechenbarkeit, Komplexitätstheorie, Algorithmik, Kryptographie
#@Juraj Hromkovic
#year2001
#conf
#citation-1
#index3654
#arnetid3656

#*Grundlagen der Programmiersprachen
#@Jacques Loeckx,Kurt Mehlhorn,Reinhard Wilhelm
#year1986
#conf
#citation33
#index3655
#arnetid3657

#*Effiziente Algorithmen
#@Kurt Mehlhorn
#year1977
#conf
#citation38
#index3656
#arnetid3658

#*Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung
#@Christoph Meinel,Martin Mundhenk
#year2000
#conf
#citation9
#index3657
#arnetid3659

#*Mathematische Grundlagen der Informatik - Mathematisches Denken und Beweisen, Eine Einführung, 2. Auflage
#@Christoph Meinel,Martin Mundhenk
#year2002
#conf
#citation9
#index3658
#arnetid3660

#*Transaktionssysteme
#@Klaus Meyer-Wegener
#year1988
#conf
#citation-1
#index3659
#arnetid3661

#*Einführung in die Komplexitätstheorie
#@Rüdiger Reischuk
#year1990
#conf
#citation-1
#index3660
#arnetid3662

#*Archivierung in Datenbanksystemen - Konzept und Sprache
#@Ralf Schaarschmidt
#year2001
#conf
#citation14
#index3661
#arnetid3663

#*Datenbanksysteme: Konzepte und Modelle
#@Gunter Schlageter,Wolffried Stucky
#year1983
#conf
#citation-1
#index3662
#arnetid3664

#*Arithmetik in Rechananlagen
#@Otto Spaniol
#year1976
#conf
#citation-1
#index3663
#arnetid3665

#*Aufgaben zum Skriptum Informatik
#@André Spiegel,Jochen Ludewig,Hans-Jürgen Appelrath
#year1992
#conf
#citation0
#index3664
#arnetid3666

#*Aufgaben zum Skriptum Informatik, 2., durchges. Aufl.
#@André Spiegel,Jochen Ludewig,Hans-Jürgen Appelrath
#year1994
#conf
#citation-1
#index3665
#arnetid3667

#*Backup und Recovery in Datenbanksystemen
#@Uta Störl
#year2001
#conf
#citation3
#index3666
#arnetid3668

#*Semantik und Programmverifikation
#@Christoph Walther
#year2001
#confTeubner Texte zur Informatik
#citation5
#index3667
#arnetid3669

#*The complexity of Boolean functions
#@Ingo Wegener
#year1987
#conf
#citation914
#index3668
#arnetid3670

#*Kompendium Theoretische Informatik - eine Ideensammlung
#@Ingo Wegener
#year1996
#conf
#citation24
#index3669
#arnetid3671

#*Effiziente Algorithmen für grundlegende Funktionen (2. Auflage)
#@Ingo Wegener
#year1996
#conf
#citation31
#index3670
#arnetid3672

#*Theoretische Informatik - eine algorithmenorientierte Einführung (2. Auflage)
#@Ingo Wegener
#year1999
#conf
#citation-1
#index3671
#arnetid3673

#*Compilerbau - Eine Einführung
#@Niklaus Wirth
#year1977
#conf
#citation-1
#index3672
#arnetid3674

#*Didaktik der Informatik, mit praxiserprobtem Unterrichtsmaterial.
#@Ludger Humbert
#year2005
#conf
#citation9
#index3673
#arnetid3675

#*Didaktik der Informatik, mit praxiserprobtem Unterrichtsmaterial, 2. Auflage.
#@Ludger Humbert
#year2006
#conf
#citation14
#index3674
#arnetid3676

#*Expertensysteme für die Planung der Produktion
#@Armin B. Cremers,Klaus Heinz,Reinhardt Jüneman,Reiner Gosmann,Matthias Kloth,Roger Liebold
#year1991
#conf
#citation-1
#index3675
#arnetid3677

#*Grundlagen von Informationssystemen
#@Joachim Biskup
#year1995
#conf
#citation-1
#index3676
#arnetid3678

#*Deduktive Datenbanken: Eine Einführung aus der Sicht der logischen Programmierung
#@Armin B. Cremers,Ulrike Griefahn,Ralf Hinze
#year1994
#conf
#citation-1
#index3677
#arnetid3679

#*Anfrageverarbeitung in Datenbanksystemen - Entwurfs- und Implementierungskonzepte
#@Bernhard Mitschang
#year1995
#conf
#citation44
#index3678
#arnetid3680

#*Datenbank-Engineering: Analyse, Entwurf und Implementierung objektrelationaler Datenbanken mit UML, DB2-SQL und Java
#@Alfred Moos
#year2004
#conf
#citation0
#index3679
#arnetid3681

#*Hochleistungs-Transaktionssysteme. Konzepte und Entwicklungen moderner Datenbankarchitekturen.
#@Erhard Rahm
#year1993
#confHochleistungs-Transaktionssysteme
#citation8
#index3680
#arnetid3682

#*Bilddatenkompression: Grundlagen, Codierung, MPEG, JPEG
#@Tilo Strutz
#year2000
#conf
#citation-1
#index3681
#arnetid3683

#*Automatisierung von Terminierungsbeweisen.
#@Christoph Walther
#year1991
#conf
#citation16
#index3682
#arnetid3684

#*Classification and Regression Trees.
#@Leo Breiman,J. H. Friedman,R. A. Olshen,C. J. Stone
#year1984
#conf
#citation73
#index3683
#arnetid3685

#*The Probabilistic Method
#@Noga Alon,Joel Spencer
#year1992
#conf
#citation3464
#index3684
#arnetid3686

#*Environmental Systems Research Institute: Understanding GIS - The ARC/INFO Method, 3rd Ed.
#@
#year1995
#conf
#citation0
#index3685
#arnetid3687

#*Modeling the Internet and the Web: Probabilistic Method and Algorithms
#@Pierre Baldi,Paolo Frasconi,Padhraic Smyth
#year2003
#conf
#citation185
#index3686
#arnetid3688

#*Sampling Techniques
#@William G. Cochran
#year1953
#conf
#citation11398
#index3687
#arnetid3689

#*Sampling Techniques
#@William G. Cochran
#year1963
#conf
#citation11398
#index3688
#arnetid3690

#*Sampling Techniques, 3rd Edition.
#@William G. Cochran
#year1977
#conf
#citation11398
#index3689
#arnetid3691

#*Exploratory Data Mining and Data Cleaning
#@Tamraparni Dasu,Theodore Johnson
#year2003
#conf
#citation173
#index3690
#arnetid3692

#*Compiler Construction for Digital Computers
#@David Gries
#year1971
#conf
#citation533
#index3691
#arnetid3693

#*Modern Compiler Design
#@Dick Grune,Henri E. Bal,Ceriel J. H. Jacobs,Koen Langendoen
#year2002
#conf
#citation129
#index3692
#arnetid3694

#*Rdb/VMS: Developing the Data Warehouse
#@W. H. Inmon,Ch. Kelley
#year1993
#conf
#citation-1
#index3693
#arnetid3695

#*Classification Algorithms
#@Mike James
#year1985
#conf
#citation400
#index3694
#arnetid3696

#*Garbage Collection: Algorithms for Automatic Dynamic Memory Management.
#@Richard E. Jones,Rafael Dueire Lins
#year1996
#conf
#citation940
#index3695
#arnetid3697

#*Finding Groups in Data: An Introduction to Cluster Analysis.
#@L. Kaufman,P. J. Rousseeuw
#year1990
#conf
#citation4989
#index3696
#arnetid3698

#*The Data Warehouse Toolkit: Practical Techniques for Building Dimensional Data Warehouses.
#@Ralph Kimball
#year1996
#conf
#citation397
#index3697
#arnetid3699

#*Foundations of Programming Languages
#@Jacques Loeckx,Kurt Mehlhorn,Reinhard Wilhelm
#year1989
#conf
#citation7
#index3698
#arnetid3700

#*The Essential Distributed Objects Survival Guide.
#@Robert Orfali,Dan Harkey,Jeri Edwards
#year1996
#conf
#citation822
#index3699
#arnetid3701

#*CORBA Fundamentals and Programming.
#@Jon Sigel
#year1996
#conf
#citation2
#index3700
#arnetid3702

#*Applied Operating System Concepts, First Edition
#@Abraham Silberschatz,Peter Galvin,Greg Gagne
#year2000
#conf
#citation-1
#index3701
#arnetid3703

#*Operating System Concepts, Sixth Edition
#@Abraham Silberschatz,Peter Galvin,Greg Gagne
#year2002
#conf
#citation-1
#index3702
#arnetid3704

#*Statistical Decision Funtions.
#@A. Wald
#year1950
#conf
#citation-1
#index3703
#arnetid3705

#*Theory of Modeling and Simulation
#@Bernard P. Zeigler
#year1976
#conf
#citation-1
#index3704
#arnetid3706

#*High Performance Parallel Database Processing and Grid Databases
#@David Taniar,Clement H. C. Leung,J. Wenny Rahayu,Sushant Goel
#year2008
#conf
#citation15
#index3705
#arnetid3707
#!This book targets the theoretical/conceptual details needed to form a base of understanding and then delivers information on development, implementations, and analytical modeling of parallel databases. It includes key information on new developments with grid databases. Also uses a theoretical and practical balance to support in-depth study of parallel query processing offered by modern DBMS as well as hands on experience of parallel query algorithms development, implementation, and analysis.

#*Creating Metabolic Network Models using Text Mining and Expert Knowledge.
#@Julie A. Dickerson,Daniel Berleant,Z. Cox,W. Qi,Eve Syrkin Wurtele
#year2003
#confComputational Biology and Genome Informatics
#citation12
#index3706
#arnetid3708

#*Graph Theoretic Sequence Clustering Algorithms and Their Applications to Genome Comparison.
#@Sun Kim
#year2003
#confComputational Biology and Genome Informatics
#citation18
#index3707
#arnetid3709

#*Introduction to Self-Assembling DNA Nanostructures for Computation and Nanofabrication.
#@Thomas H. LaBean
#year2003
#confComputational Biology and Genome Informatics
#citation10
#index3708
#arnetid3710

#*Phyloinformatics and Tree Networks.
#@William H. Piel
#year2003
#confComputational Biology and Genome Informatics
#citation1
#index3709
#arnetid3711

#*High-Grade Ore for Data Mining in 3D Structures.
#@Jane S. Richardson,David C. Richardson
#year2003
#confComputational Biology and Genome Informatics
#citation0
#index3710
#arnetid3712

#*Exploring RNA Intermediate Conformations with the Massively Parallel Genetic Algorithm.
#@Bruce A. Shapiro,David Bengali,Wojciech Kasprzak,Jin Chu Wu
#year2003
#confComputational Biology and Genome Informatics
#citation1
#index3711
#arnetid3713

#*Mapping Sequence to Rice FPC.
#@Carol Soderlund,Fred Engler,James Hatfield,Steven Blundy
#year2003
#confComputational Biology and Genome Informatics
#citation5
#index3712
#arnetid3714

#*Interrelated Clustering: An Approach for Gene Expression Data Analysis.
#@Chun Tang,Li Zhang,Aidong Zhang,Murali Ramanathan
#year2003
#confComputational Biology and Genome Informatics
#citation2
#index3713
#arnetid3715

#*Protein Classification: A Geometric Hashing Approach.
#@Xiong Wang,Jason Tsong-Li Wang
#year2003
#confComputational Biology and Genome Informatics
#citation1
#index3714
#arnetid3716

#*The Protein Information Resource for Functional Genomics and Proteomics.
#@Cathy H. Wu
#year2003
#confComputational Biology and Genome Informatics
#citation0
#index3715
#arnetid3717

#*Conservative Extension in Structural Operational Semantics.
#@Luca Aceto,Wan Fokkink,Chris Verhoef
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation-1
#index3716
#arnetid3718

#*Some Pointed Questions Concerning Asymptotic Lower Bounds, and News from the Isomorphism Front.
#@Eric Allender
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation3
#index3717
#arnetid3719

#*Theoretical and Experimental DNA Computation.
#@Martyn Amos
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation84
#index3718
#arnetid3720

#*Theory of Genetic Algorithms.
#@Thomas Bäck,Jeannette M. de Graaf,Joost N. Kok,Walter A. Kosters
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation19
#index3719
#arnetid3721

#*Propositional Proof Complexity: Past, Present, and Future.
#@Paul Beame,Toniann Pitassi
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation-1
#index3720
#arnetid3722

#*The Underlying Logic of Hoare Logic.
#@Andreas Blass,Yuri Gurevich
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation13
#index3721
#arnetid3723

#*Security Analysis Using Flow Logics.
#@Chiara Bodei,Pierpaolo Degano,Flemming Nielson,Hanne Riis Nielson
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation13
#index3722
#arnetid3724

#*Quantum Computing and Communication Complexity.
#@Harry Buhrman
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation15
#index3723
#arnetid3725

#*More Infinite Results.
#@Olaf Burkart,Javier Esparza
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation67
#index3724
#arnetid3726

#*A Machine Model for the Complexity of NP-Approximation Problems.
#@Richard Chang
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation0
#index3725
#arnetid3727

#*Functions Versus Algorithms.
#@Loïc Colson
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation6
#index3726
#arnetid3728

#*Characterizations of Regular Languages in Low Level Complexity Classes.
#@Kevin J. Compton,Howard Straubing
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation10
#index3727
#arnetid3729

#*GETGRATS and APPLIGRAPH: Theory and Applications of Graph Transformation.
#@Andrea Corradini,Hans-Jörg Kreowski
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation5
#index3728
#arnetid3730

#*Networks of Language Processors.
#@Erzsébet Csuhaj-Varjú
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation14
#index3729
#arnetid3731

#*Networks of Language Processors: Parallel Communicating Systems.
#@Erzsébet Csuhaj-Varjú,Arto Salomaa
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation7
#index3730
#arnetid3732

#*Herbrand's Theorem and Equational Reasoning: Problems and Solutions.
#@Anatoli Degtyarev,Yuri Gurevich,Andrei Voronkov
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation26
#index3731
#arnetid3733

#*On the Role of Formal Specification Techniques: From TAPSOFT 1985 to ETAPS 2000.
#@Hartmut Ehrig
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation1
#index3732
#arnetid3734

#*On Formal Semantics and Integration of Object-Oriented Modeling Languages.
#@Hartmut Ehrig,Robert Geisler,Martin Große-Rhode,Marcus Klar,Stefan Mann
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation3
#index3733
#arnetid3735

#*Theory and Practice of Software Development: A Review of Driving Forces and Expectations of TAPSOFT from 1985 to 1997.
#@Hartmut Ehrig,Bernd Mahr
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation1
#index3734
#arnetid3736

#*Algebraic Techniques in Software Development: A Review of Progress up to the Mid Nineties.
#@Hartmut Ehrig,Bernd Mahr
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation3
#index3735
#arnetid3737

#*Dynamic Abstract Data Types: An Informal Proposal in 1994.
#@Hartmut Ehrig,Fernando Orejas
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation1
#index3736
#arnetid3738

#*Integration Paradigm for Data Type and Process Specification Techniques.
#@Hartmut Ehrig,Fernando Orejas
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation18
#index3737
#arnetid3739

#*From Basic Views and Aspects to Integration of Specification Formalisms.
#@Hartmut Ehrig,Julia Padberg,Fernando Orejas
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation7
#index3738
#arnetid3740

#*Why Evolutionary Algorithms?
#@David B. Fogel,Zbigniew Michalewicz
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation3
#index3739
#arnetid3741

#*Diagonalization.
#@Lance Fortnow
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation-1
#index3740
#arnetid3742

#*What is Branching Time Semantics and Why to Use it?
#@Rob J. van Glabbeek
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation36
#index3741
#arnetid3743

#*Why are Modal Logics so Robustly Decidable?
#@Erich Grädel
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation66
#index3742
#arnetid3744

#*On a Reference Model for the Formalization and Integration of Software Specification Languages.
#@Martin Große-Rhode
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation5
#index3743
#arnetid3745

#*Homotopy and Concurrency.
#@Jeremy Gunawardena
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation54
#index3744
#arnetid3746

#*AMAST'91 Banquet Talk.
#@Yuri Gurevich
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation0
#index3745
#arnetid3747

#*The Value, if Any, of Decidability.
#@Yuri Gurevich
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation6
#index3746
#arnetid3748

#*Platonism, Constructivism, and Computer Proofs vs. Proofs by Hand.
#@Yuri Gurevich
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation12
#index3747
#arnetid3749

#*From Invariants to Canonization.
#@Yuri Gurevich
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation19
#index3748
#arnetid3750

#*The Sequential ASM Thesis.
#@Yuri Gurevich
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation41
#index3749
#arnetid3751

#*An Introduction to Quantum Computing.
#@Mika Hirvensalo
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation8
#index3750
#arnetid3752

#*On Slender Languages.
#@Juha Honkala
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation4
#index3751
#arnetid3753

#*The D0L Problem Revisited.
#@Juha Honkala
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation2
#index3752
#arnetid3754

#*Progress in Descriptive Complexity.
#@Neil Immerman
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation7
#index3753
#arnetid3755

#*DNA Computers: Tomorrow's Reality.
#@Lila Kari
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation17
#index3754
#arnetid3756

#*The Genomics Revolution and its Challenges for Algorithmic Research.
#@Richard M. Karp
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation2
#index3755
#arnetid3757

#*Natural Data Mining Techniques.
#@Joost N. Kok,Walter A. Kosters
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation5
#index3756
#arnetid3758

#*Simple Words in Equality Sets.
#@Marjo Lipponen,Arto Salomaa
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation0
#index3757
#arnetid3759
#!It is well known that equality sets between two morphisms possess a remarkable generative capacity: an arbitrary recursively enumerable set is obtained from an equality set by certain simple operations. Interconnections between simplicity of computations and structural primitivity of words in equality sets have also been observed. The paper discusses recent work in this area, pointing out certain open problems and emphasizing new directions for research.

#*Twelve Problems in Resource-Bounded Measure.
#@Jack H. Lutz,Elvira Mayordomo
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation27
#index3758
#arnetid3760

#*Neural Computation: A Research Topic for Theoretical Computer Science? Some Thoughts and Pointers.
#@Wolfgang Maass
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation2
#index3759
#arnetid3761

#*Words on Trajectories.
#@Alexandru Mateescu
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation2
#index3760
#arnetid3762

#*Many-Valued Truth Functions, Cernys' Conjecture, and Road Coloring.
#@Alexandru Mateescu,Arto Salomaa
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation32
#index3761
#arnetid3763

#*Lindenmayer and DNA: Watson-Crick D0L Systems.
#@Valeria Mihalache,Arto Salomaa
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation20
#index3762
#arnetid3764

#*CoFI: The Common Framework Initiative for Algebraic Specification and Development.
#@Peter D. Mosses
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation87
#index3763
#arnetid3765

#*Classification of Petri Nets Using Adjoint Functors.
#@Julia Padberg
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation13
#index3764
#arnetid3766

#*Does Concurrency Theory Have Anything to Say About Parallel Programming?
#@Prakash Panangaden
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation2
#index3765
#arnetid3767

#*Splicing: A Challenge for Formal Language Theorists.
#@Gheorghe Paun
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation14
#index3766
#arnetid3768

#*Computing with Membranes (P Systems): An Introduction.
#@Gheorghe Paun
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation2
#index3767
#arnetid3769

#*Logic on Words.
#@Jean-Eric Pin
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation26
#index3768
#arnetid3770

#*Towards Global Computations Guided by Concurrency Theory.
#@Bent Thomsen,Lone Leth Thomsen
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation4
#index3769
#arnetid3771

#*The Complexity of Propositional Proofs.
#@Alasdair Urquhart
#year2001
#confCurrent Trends in Theoretical Computer Science
#citation187
#index3770
#arnetid3772

#*Current Trends in Theoretical Computer Science, Entering the 21th Century
#@Gheorghe Paun,Grzegorz Rozenberg,Arto Salomaa
#year2001
#conf
#citation-1
#index3771
#arnetid3773

#*String Searching Algorithms
#@Graham A. Stephen
#year1994
#confLecture Notes Series on Computing
#citation-1
#index3772
#arnetid3774

#*Computational Biology and Genome Informatics
#@Jason Tsong-Li Wang,Cathy H. Wu,Paul P. Wang
#year2003
#conf
#citation9
#index3773
#arnetid3775

#*Analysis of Biological Data: A Soft Computing Approach
#@Sanghamitra Bandyopadhyay,Ujjwal Maulik,Jason Tsong-Li Wang
#year2007
#conf
#citation3
#index3774
#arnetid3776

#*In Silico Design of Ligands Using Properties of Target Active Sites.
#@Sanghamitra Bandyopadhyay,Santanu Santra,Ujjwal Maulik,Heinz Mühlenbein
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation0
#index3775
#arnetid3777

#*Sophisticated Methods for Cancer Classification Using Microarray Data.
#@Sung-Bae Cho,Han-Saem Park
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation0
#index3776
#arnetid3778

#*A Reliable Classification of Gene Clusters for Cancer Samples Using a Hybrid Multi-Objective Evolutionary Procedure.
#@Kalyanmoy Deb,Abbadi Raji Reddy,Shamik Chaudhuri
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation0
#index3777
#arnetid3779

#*Reconstructing Phylogenies with Memetic Algorithms and Branch-and-Bound.
#@José E. Gallardo,Carlos Cotta,Antonio J. Fernández
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation3
#index3778
#arnetid3780

#*An Introduction to Soft Computing.
#@Amit Konar,Swagatam Das
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation0
#index3779
#arnetid3781

#*Beyond String Algorithms: Protein Sequence Analysis Using Wavelet Transforms.
#@Arun Krishnan,Kuo-Bin Li
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation0
#index3780
#arnetid3782

#*Multiobjective Evolutionary Approach to Fuzzy Clustering of Microarray Data.
#@Anirban Mukhopadhyay,Ujjwal Maulik,Sanghamitra Bandyopadhyay
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation3
#index3781
#arnetid3783

#*Inferring Regulations in a Genomic Network from Gene Expression Profiles.
#@Nasimul Noman,Hitoshi Iba
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation0
#index3782
#arnetid3784

#*Distill: A Machine Learning Approach to Ab Initio Protein Structure Prediction.
#@Gianluca Pollastri,Davide Baù,Alessandro Vullo
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation8
#index3783
#arnetid3785

#*Filtering Protein Surface Motifs Using Negative Instances of Active Sites Candidates.
#@Nripendra Lal Shrestha,Takenao Ohkawa
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation0
#index3784
#arnetid3786

#*Bioinformatics: Mining the Massive Data from High Throughput Genomics Experiments.
#@Haixu Tang,Sun Kim
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation0
#index3785
#arnetid3787

#*Classification of RNA Sequences with Support Vector Machines.
#@Jason T. L. Wang,Xiaoming Wu
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation-1
#index3786
#arnetid3788

#*Feature Selection for Cancer Classification Using Ant Colony Optimization and Support Vector Machines.
#@Ankur Gupta,Vaidyanathan K. Jayaraman,Bhaskar D. Kulkarni
#year2007
#confAnalysis of Biological Data: A Soft Computing Approach
#citation0
#index3787
#arnetid3789

#*Six Degrees: The Science of a Connected Age.
#@Duncan J. Watts
#year2003
#conf
#citation1420
#index3788
#arnetid3790

#*Information Retrieval Interaction.
#@Peter Ingwersen
#year1992
#conf
#citation664
#index3789
#arnetid3791

#*Standard Codecs: Image Compression to Advanced Video Coding.
#@Mohammed Ghanbari
#year2003
#conf
#citation182
#index3790
#arnetid3792

#*Neuronale Netze - Eine Einführung in die Grundlagen, Anwendungen und Datenauswertung
#@Günter Daniel Rey,Karl Friedrich Wender
#year2008
#conf
#citation-1
#index3791
#arnetid3793

#*The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines
#@Luiz André Barroso,Urs Hölzle
#year2009
#confSynthesis Lectures on Computer Architecture
#citation79
#index3792
#arnetid3794

#*Real-time Active Range Finder Using Light Intensity Modulation.
#@Takeo Azuma,Kenya Uomori,Atsushi Morimura
#year1999
#confThree-Dimensional Image Capture and Applications
#citation2
#index3793
#arnetid3795

#*Strategies for Registering Range Images from Unknown Camera Positions.
#@Fausto Bernardini,Holly E. Rushmeier
#year2000
#confThree-Dimensional Image Capture and Applications
#citation17
#index3794
#arnetid3796

#*High-resolution Ultrafast 3D Imaging.
#@János Rohály,Douglas P. Hart
#year2000
#confThree-Dimensional Image Capture and Applications
#citation14
#index3795
#arnetid3797

#*Optoelectronic dimensional Integral Inspection of Hollow Cylinder-type Articles for conveyor Line.
#@Oleg I. Bityutsky,Yuri V. Chugui,Boris E. Krivenkov,Vladimir I. Ladigin,Alexander I. Pastushenko,Sergey V. Plotnikov,Victor V. Vertoprakhov,Sergey P. Yunoshev
#year1998
#confThree-Dimensional Image Capture and Applications
#citation0
#index3796
#arnetid3798

#*Development of a 3D Digitizer for Breast Surgery Procedures.
#@Jorge Rodriguez-Larena,Fernando Canal
#year1999
#confThree-Dimensional Image Capture and Applications
#citation3
#index3797
#arnetid3799

#*Automatic Reconstruction of Large 3D Models of Real Environments from Unregistered Data-sets.
#@Faysal Boughorbel,David L. Page,Mongi A. Abidi
#year2000
#confThree-Dimensional Image Capture and Applications
#citation2
#index3798
#arnetid3800

#*Three-line High-power Three-dimensional Sensor.
#@Liviu Bursanescu,Mihaela Bursanescu
#year1998
#confThree-Dimensional Image Capture and Applications
#citation3
#index3799
#arnetid3801

#*Multispectral Pattern Projection Range Finder.
#@Tatsuo Sato
#year1999
#confThree-Dimensional Image Capture and Applications
#citation13
#index3800
#arnetid3802

#*High-speed Three-dimensional Laser Sensor.
#@Liviu Bursanescu,Mihaela Bursanescu,Maher Hamdi,François Blais,David Green
#year2000
#confThree-Dimensional Image Capture and Applications
#citation0
#index3801
#arnetid3803

#*3D Range Optical Sensor: analysis of the Measurement Errors and Development of Procedures for Their Compensation.
#@Matteo Carocci,Sara Lazzari,Roberto Rodella,Giovanna Sansoni
#year1998
#confThree-Dimensional Image Capture and Applications
#citation5
#index3802
#arnetid3804

#*3D Profilometry Using a Dynamically Configurable Confocal Microscope.
#@Sungdo Cha,Paul C. Lin,Lijun Zhu,Elliot L. Botvinick,Pang-Chen Sun,Yeshaiahu Fainman
#year1999
#confThree-Dimensional Image Capture and Applications
#citation14
#index3803
#arnetid3805

#*Examining Laser Triangulation System Performance Using a Software Simulation.
#@Jeffery S. Collier,Joseph H. Nurre
#year1999
#confThree-Dimensional Image Capture and Applications
#citation2
#index3804
#arnetid3806

#*Effect of Sway on Image Fidelity in Whole-body Digitizing.
#@Brian Corner,Anmin Hu
#year1998
#confThree-Dimensional Image Capture and Applications
#citation8
#index3805
#arnetid3807

#*Moly: A Prototype Handheld 3D Digitizer with Diffraction Optics.
#@Tom D. Ditto,Douglas A. Lyon
#year1999
#confThree-Dimensional Image Capture and Applications
#citation-1
#index3806
#arnetid3808

#*Reconstruction of the Surface of the Human Body from 3D Scanner Data Using 13-splines.
#@Ioannis Douros,Laura Dekker,Bernard F. Buxton
#year1999
#confThree-Dimensional Image Capture and Applications
#citation33
#index3807
#arnetid3809

#*Reverse Engineering Using Optical 3D Sensors.
#@Harald Schönfeld,Gerd Häusler,Stefan Karbacher
#year1998
#confThree-Dimensional Image Capture and Applications
#citation12
#index3808
#arnetid3810

#*Wrapping 3D Scanning Data.
#@Herbert Edelsbrunner,Michael A. Facello,Ping Fu,Jiang Qian,Dmitry V. Nekhayev
#year1998
#confThree-Dimensional Image Capture and Applications
#citation4
#index3809
#arnetid3811

#*Spherical Harmonic Surface Representation with Feedback Control.
#@Sarp Ertürk,Tim J. Dennis
#year1999
#confThree-Dimensional Image Capture and Applications
#citation0
#index3810
#arnetid3812

#*Efficient Free-form Surface Representation with Application in Orthodontics.
#@Sameh M. Yamany,Ahmed R. El-Bialy
#year1999
#confThree-Dimensional Image Capture and Applications
#citation2
#index3811
#arnetid3813

#*Real-time 3D Shape Measurement with Digital Stripe Projection by Texas Instruments Micro Mirror Devices DMD.
#@Gottfried Frankowski,Mai Chen,Torsten Huth
#year2000
#confThree-Dimensional Image Capture and Applications
#citation14
#index3812
#arnetid3814

#*Multiscale Analysis of 3D Surface Image: Application to Clam Shell Characterization.
#@A. Garcia,Frédéric Truchetet,Olivier Laligant,Christophe Dumont,Eric Verrecchia,Mongi A. Abidi
#year1998
#confThree-Dimensional Image Capture and Applications
#citation4
#index3813
#arnetid3815

#*Multiple Structured Light System for the 3D Measurement of Feet.
#@Hansjörg Gärtner,Jean-François Lavoie,Eric Vermette,Pascal-Simon Houle
#year1999
#confThree-Dimensional Image Capture and Applications
#citation3
#index3814
#arnetid3816

#*Pose and Motion Estimation Using Dual quaternion-based Extended Kalman Filtering.
#@James S. Goddard Jr.,Mongi A. Abidi
#year1998
#confThree-Dimensional Image Capture and Applications
#citation17
#index3815
#arnetid3817

#*Direct Estimation of 3D Motion Parameters and Relative Depth Using the Minimum Description Length Principle.
#@Souad Hadjres,Amar Mitiche
#year2000
#confThree-Dimensional Image Capture and Applications
#citation0
#index3816
#arnetid3818

#*Depth-based Selective Image Reconstruction Using Spatiotemporal Image Analysis.
#@Tetsuji Haga,Kazuhiko Sumi,Manabu Hashimoto,A. Seki
#year1999
#confThree-Dimensional Image Capture and Applications
#citation0
#index3817
#arnetid3819

#*Toward a Handheld Laser Range Scanner: Integrating Observation-based Motion Compensation.
#@Patrick Hébert,Marc Rioux
#year1998
#confThree-Dimensional Image Capture and Applications
#citation-1
#index3818
#arnetid3820

#*Slicing, Fitting, and Linking (SFL): A Modular Triangulation Approach.
#@Elsayed E. Hemayed,Aly A. Farag
#year1999
#confThree-Dimensional Image Capture and Applications
#citation4
#index3819
#arnetid3821

#*3D Object Reconstruction from a Sequence of Images Using Voxel Coloring.
#@Elsayed E. Hemayed,Mostafa G.-H. Mostafa,Aly A. Farag
#year2000
#confThree-Dimensional Image Capture and Applications
#citation2
#index3820
#arnetid3822

#*3D Profiling by Optical Demodulation with an Image Intensifier.
#@Heinrich Höfler,Volker Jetter,Elmar Wagner
#year1999
#confThree-Dimensional Image Capture and Applications
#citation4
#index3821
#arnetid3823

#*Restoration of Broken Earthenware Using Close Range Photogrammetry and a CAD System.
#@Amir Saeed Homainejad,Mohamad Hassan Asgari
#year2000
#confThree-Dimensional Image Capture and Applications
#citation0
#index3822
#arnetid3824

#*Real-time 3D Reconstruction System using CAM-based Highly Parallel Processing Board.
#@Eiichi Hosoya,Mamoru Nakanishi,Takeshi Ogura
#year1998
#confThree-Dimensional Image Capture and Applications
#citation0
#index3823
#arnetid3825

#*Novel Fully Integrated Computer System for Custom Footwear: from 3D Digitization to Manufacturing.
#@Pascal-Simon Houle,Eric Beaulieu,Zhaoheng Liu
#year1998
#confThree-Dimensional Image Capture and Applications
#citation2
#index3824
#arnetid3826

#*Reconstruction of Complete 3D Object Model from Multiview Range Images.
#@Yi-Ping Hung,Chu-Song Chen,Ing-Bor Hsieh,Chiou-Shann Fuh
#year1999
#confThree-Dimensional Image Capture and Applications
#citation1
#index3825
#arnetid3827

#*Color Digitizing and Modeling of Free-form 3D Objects.
#@Timothée Jost,Christian Schütz,Heinz Hügli
#year1999
#confThree-Dimensional Image Capture and Applications
#citation5
#index3826
#arnetid3828

#*Object Modeling in Multiple-object 3D Scene Using Deformable Simplex Meshes.
#@Ernesto L. Juarez,Christophe Dumont,Mongi A. Abidi
#year2000
#confThree-Dimensional Image Capture and Applications
#citation8
#index3827
#arnetid3829

#*Robust 3D Reconstruction System for Human Jaw Modeling.
#@Sameh M. Yamany,Aly A. Farag,David Tasman,Allan G. Farman
#year1999
#confThree-Dimensional Image Capture and Applications
#citation14
#index3828
#arnetid3830

#*Acquisition of 3D Image Representation in Multimedia Ambiance Communication using 3D Laser Scanner and Digital Camera.
#@Toshifumi Kanamaru,Kunio Yamada,Tadashi Ichikawa,Takeshi Naemura,Kiyoharu Aizawa,Takahiro Saito
#year2000
#confThree-Dimensional Image Capture and Applications
#citation5
#index3829
#arnetid3831

#*New Approach for the Modeling and Smoothing of Scattered 3D Data.
#@Stefan Karbacher,Gerd Häusler
#year1998
#confThree-Dimensional Image Capture and Applications
#citation-1
#index3830
#arnetid3832

#*Fast Shape from Focus Using Dynamic Programming.
#@Joungil Yun,Tae-Sun Choi
#year2000
#confThree-Dimensional Image Capture and Applications
#citation1
#index3831
#arnetid3833

#*Axi-vision Camera: A Three-dimensional Camera.
#@Masahiro Kawakita,Keigo Iizuka,Tahito Aida,Hiroshi Kikuchi,Hideo Fujikake,Jun Yonai,Kuniharo Takizawa
#year2000
#confThree-Dimensional Image Capture and Applications
#citation-1
#index3832
#arnetid3834

#*Real-time Structured Light Depth Extraction.
#@Kurtis Keller,Jeremy Ackerman
#year2000
#confThree-Dimensional Image Capture and Applications
#citation9
#index3833
#arnetid3835

#*Impact of Intensity Edge map on Segmentation of Noisy Range Images.
#@Yan Zhang,Yiyong Sun,Hamed Sari-Sarraf,Mongi A. Abidi
#year2000
#confThree-Dimensional Image Capture and Applications
#citation17
#index3834
#arnetid3836

#*Interpolation of Ray-space Data by Adaptive Filtering.
#@Takeyuki Kobayashi,Toshiaki Fujii,Tadahiko Kimoto,Masayuki Tanimoto
#year2000
#confThree-Dimensional Image Capture and Applications
#citation28
#index3835
#arnetid3837

#*Three Steps to Make Shape from Shading Work Consistently on Real Scenes.
#@Holger Lange
#year1999
#confThree-Dimensional Image Capture and Applications
#citation2
#index3836
#arnetid3838

#*Robust Cooperation Concept for Low-level Vision Modules.
#@Holger Lange,Jean-Christophe Culioli
#year1999
#confThree-Dimensional Image Capture and Applications
#citation1
#index3837
#arnetid3839

#*Error Sensitivity of Rotation Angles in the ICP Algorithm.
#@Byung-Uk Lee,Chul-Min Kim,Rae-Hong Park
#year1999
#confThree-Dimensional Image Capture and Applications
#citation9
#index3838
#arnetid3840

#*3D Surface Real-time Measurement Using Phase-shifted Interference Fringe Technique for Craniofacial Identification.
#@Gennady G. Levin,Gennady N. Vishnyakov,Alexey A. Naumov,Sergei S. Abramov
#year1998
#confThree-Dimensional Image Capture and Applications
#citation3
#index3839
#arnetid3841

#*Automated Fudicial Labeling on Human Body Data.
#@Erick A. Lewark,Joseph H. Nurre
#year1998
#confThree-Dimensional Image Capture and Applications
#citation11
#index3840
#arnetid3842

#*Segmenting 3D Surface Scan Data of the Human Body by 2D Projection.
#@Peng Li,Brian D. Corner,Steven Paquette
#year2000
#confThree-Dimensional Image Capture and Applications
#citation2
#index3841
#arnetid3843

#*Extracting Surface Area Coverage by Superimposing 3D Scan Data.
#@Peng Li,Brian D. Corner,Steven Paquette
#year1999
#confThree-Dimensional Image Capture and Applications
#citation2
#index3842
#arnetid3844

#*Entropy of Profile Sections to Estimate the Next Sensor Position.
#@Christian Liska,Robert Sablatnig
#year2000
#confThree-Dimensional Image Capture and Applications
#citation0
#index3843
#arnetid3845

#*Optimizing Triangular Mesh Generation from Range Images.
#@Tianyu Lu,D. Y. Y. Yun
#year2000
#confThree-Dimensional Image Capture and Applications
#citation7
#index3844
#arnetid3846

#*CyberModeler: A Compact 3D Scanner Based on Monoscopic Camera.
#@Yukinori Matsumoto,Kouta Fujimura,Toru Kitamura
#year1999
#confThree-Dimensional Image Capture and Applications
#citation9
#index3845
#arnetid3847

#*Adaptive Area-based Stereo Matching.
#@Christian Menard,Robert Sablatnig
#year1998
#confThree-Dimensional Image Capture and Applications
#citation0
#index3846
#arnetid3848

#*Gel Tomography for 3D Acquisition of Plant Root Systems.
#@Kevin Montgomery,Gerard Heyenga
#year1998
#confThree-Dimensional Image Capture and Applications
#citation3
#index3847
#arnetid3849

#*Real-time Monitoring of Icebreaker Propeller Blades' Ice Load Using Underwater Laser ranging System.
#@André Morin,Michel Arsenault,Merv H. Edgecombe,Ernst Radloff
#year1999
#confThree-Dimensional Image Capture and Applications
#citation0
#index3848
#arnetid3850

#*Scanning Projection Grating Moire Topography.
#@Jung-Taek Oh,Sangyoon Lee,Seung-Woo Kim
#year2000
#confThree-Dimensional Image Capture and Applications
#citation4
#index3849
#arnetid3851

#*ShapeGrabber FootScanner: A Low Cost High Accuracy 3D System for the Acquisition of Human Feet.
#@François Blais,Joel A. Bisson,Steven Williams,Nancy Roberston,Serge Rozin,Andrew Nelson
#year2000
#confThree-Dimensional Image Capture and Applications
#citation0
#index3850
#arnetid3852

#*3D Reconstruction, Visualization, and Measurement of MRI Images.
#@Abhijit S. Pandya,Pritesh P. Patel,Mehul B. Desai,Paramtap Desai
#year1999
#confThree-Dimensional Image Capture and Applications
#citation2
#index3851
#arnetid3853

#*Generating Animated Sequences from 3D Whole-body Scans.
#@Roy P. Pargas,Murtuza Chatriwala,Daniel Mulfinger,Pushkar Deshmukh,Sathish S. Vadhiyar
#year1999
#confThree-Dimensional Image Capture and Applications
#citation0
#index3852
#arnetid3854

#*Tilted Planes in 3D Image Analysis.
#@Roy P. Pargas,Nancy J. Staples,Brian F. Malloy,Ken Cantrell,Murtuza Chatriwala
#year1998
#confThree-Dimensional Image Capture and Applications
#citation1
#index3853
#arnetid3855

#*Monitoring and Measurement of Movement of Objects by Fringe Projection Method.
#@Michal Pawlowski,Malgorzata Kujawinska,Marek Wegiel
#year2000
#confThree-Dimensional Image Capture and Applications
#citation2
#index3854
#arnetid3856

#*Parameters Matching of Objects in Video Sequences.
#@Yannick Perret,Thierry Excoffier,Saïda Bouakaz
#year2000
#confThree-Dimensional Image Capture and Applications
#citation2
#index3855
#arnetid3857

#*Optimizing Random Patterns for Invariants-based Identification.
#@Maurizio Pilu
#year2000
#confThree-Dimensional Image Capture and Applications
#citation0
#index3856
#arnetid3858

#*Three-dimensional Scene Reconstruction from Images.
#@Marc Pollefeys,Reinhard Koch,Maarten Vergauwen,Bert DeKnuydt,Luc J. Van Gool
#year2000
#confThree-Dimensional Image Capture and Applications
#citation57
#index3857
#arnetid3859

#*3D Shape Initialization of Objects in Multiview Image Sequences.
#@Thomas B. Riegel,Federico Pedersini,Roberto Manzotti
#year1998
#confThree-Dimensional Image Capture and Applications
#citation0
#index3858
#arnetid3860

#*3D Textured Models of Indoor Scenes from Composite Range and Video Images.
#@Vítor Sequeira,Kia Ng,Stuart Butterfield,João G. M. Gonçalves,David Hogg
#year1998
#confThree-Dimensional Image Capture and Applications
#citation0
#index3859
#arnetid3861

#*Three-dimensional Shape Reconstruction from Two-dimensional Images Using Symmetric Camera Location.
#@Masaharu Shimanuki,Hiroyuki Sato,Takao Akatsuka
#year1998
#confThree-Dimensional Image Capture and Applications
#citation1
#index3860
#arnetid3862

#*New Class Library for Animation of Voxel Humans.
#@Goh Shuang Ru,Orapan Kluenkaew,Tang Ming Lee,Zhonge Wu,Edmond C. Prakash
#year2000
#confThree-Dimensional Image Capture and Applications
#citation0
#index3861
#arnetid3863

#*Opto-numerical Methods of Data Acquisition for Computer Graphics and Animation Systems.
#@Robert Sitnik,Malgorzata Kujawinska
#year2000
#confThree-Dimensional Image Capture and Applications
#citation17
#index3862
#arnetid3864

#*VIRO 3D: Tast Three-dimensional Full-body Scanning for Humans and Other Living Objects.
#@Norbert Stein,Bernhard Minge
#year1998
#confThree-Dimensional Image Capture and Applications
#citation-1
#index3863
#arnetid3865

#*High-resolution Triangulation of Arbitrary Shaped Surfaces based on Coordinate Curves.
#@Bijan Timsari
#year2000
#confThree-Dimensional Image Capture and Applications
#citation1
#index3864
#arnetid3866

#*Differential Motions for Recovering 3D Structure and Motions from an Unstructured Environment.
#@José Vicente,Domingo Guinea,Victor M. Preciado
#year2000
#confThree-Dimensional Image Capture and Applications
#citation0
#index3865
#arnetid3867

#*Recreation of Three-dimensional Objects in a Real-time Simulated Environment by Means of a Panoramic Single Lens Stereoscopic Image-Capturing Device.
#@Erwin Wong
#year2000
#confThree-Dimensional Image Capture and Applications
#citation1
#index3866
#arnetid3868

#*Volumetric Apparel for Visible Female.
#@Zhonge Wu,Goh Shuang Ru,Orapan Kluenkaew,Tang Ming Lee,Edmond C. Prakash
#year2000
#confThree-Dimensional Image Capture and Applications
#citation0
#index3867
#arnetid3869

#*Gaussian Scale-Space Dense Disparity Estimation with Anisotropic Disparity-Field Diffusion.
#@Jangheon Kim,Thomas Sikora
#year2005
#conf3DIM
#citation7
#index3868
#arnetid3870
#!We present a new reliable dense disparity estimation algorithm which employs Gaussian scale-space with anisotropic disparity-field diffusion. This algorithm estimates edge-preserving dense disparity vectors using a diffusive method on iteratively Gaussian-filtered images with a scale, i.e. the Gaussian scalespace. While a Gaussian filter kernel generates a coarser resolution from stereo image pairs, only strong and meaningful boundaries are adaptively selected on the resolution of the filtered images. Then, coarse global disparity vectors are initialized using the boundary constraint. The per-pixel disparity vectors are iteratively obtained by the local adjustment of the global disparity vectors using an energy-minimization framework. The proposed algorithm preserves the boundaries while inner regions are smoothed using anisotropic disparity-field diffusion. In this work, the Gaussian scale-space efficiently avoids illegal matching on a large baseline by the restriction of the range. Moreover, it prevents the computation from iterating into local minima of ill-posed diffusion on large gradient areas e.g. shadow and texture region, etc. The experimental results prove the excellent localization performance preserving the disparity discontinuity of each object.

#*Projection-Based Registration Using a Multi-View Camera for Indoor Scene Reconstruction.
#@Sehwan Kim,Woontack Woo
#year2005
#conf3DIM
#citation4
#index3869
#arnetid3871
#!A registration method is proposed for 3D reconstruction of an indoor environment using a multi-view camera. In general, previous methods have a high computational complexity and are not robust for 3D point cloud with low precision. Thus, a projection-based registration is presented. First, depth are refined based on temporal property by excluding 3D points with a large variation, and spatial property by filling holes referring neighboring 3D points. Second, 3D point clouds acquired at two views are projected onto the same image plane, and two-step integer mapping enables the modified KLT to find correspondences. Then, fine registration is carried out by minimizing distance errors. Finally, a final color is evaluated using colors of corresponding points and an indoor environment is reconstructed by applying the above procedure to consecutive scenes. The proposed method reduces computational complexity by searching for correspondences within an image plane. It not only enables an effective registration even for 3D point cloud with low precision, but also need only a few views. The generated model can be adopted for interaction with as well as navigation in a virtual environment.

#*Registration of Multiple Range Scans as a Location Recognition Problem: Hypothesis Generation, Refinement and Verification.
#@Bradford J. King,Tomasz Malisiewicz,Charles V. Stewart,Richard J. Radke
#year2005
#conf3DIM
#citation9
#index3870
#arnetid3872
#!This paper addresses the following version of the multiple range scan registration problem. A scanner with an associated intensity camera is placed at a series of locations throughout a large environment; scans are acquired at each location. The problem is to decide automatically which scans overlap and to estimate the parameters of the transformations aligning these scans. Our technique is based on (1) detecting and matching keypoints ¿ distinctive locations in range and intensity images, (2) generating andrefining a transformation estimate from each keypoint match, and (3) deciding if a given refined estimate is correct. While these steps are familiar, we present novel approaches to each. A new range keypoint technique is presented that uses spin images to describe holes in smooth surfaces. Intensity keypoints are detected using multiscale filters, described using intensity gradient histograms, and backprojected to form 3D keypoints. A hypothesized transformation is generated by matching a single keypoint from one scan to a single keypoint from another, and is refined using a robust form of the ICP algorithm in combination with controlled region growing. Deciding whether a refined transformation is correct is based on three criteria: alignment accuracy, visibility, and a novel randomness measure. Together these three steps produce good results in test scans of the Rensselaer campus.

#*In Process 3D-Sensing for Laser Material Processing.
#@P. Klinger,B. Spellenberg,J. M. Hermann,Gerd Häusler
#year2001
#conf3DIM
#citation-1
#index3871
#arnetid3873

#*From Coarse to Fine Correspondence of 3-D Facial Images and its Application to Facial Caricaturing.
#@Takayuki Kondo,Kazuhito Murakami,Hiroyasu Koshimizu
#year1997
#conf3DIM
#citation-1
#index3872
#arnetid3874

#*Automatic Class Selection and Prototyping for 3-D Object Classification.
#@Raghavendra Donamukkala,Daniel F. Huber,Anuj Kapuria,Martial Hebert
#year2005
#conf3DIM
#citation3
#index3873
#arnetid3875
#!Most research on 3-D object classification and recognition focuses on recognition of objects in 3-D scenes from a small database of known 3-D models. Such an approach does not scale well to large databases of objects and does not generalize well to unknown (but similar) object classification. This paper presents two ideas to address these problems (i) class selection, i.e., grouping similar objects into classes (ii) class prototyping, i.e., exploiting common structure within classes to represent the classes. At run time matching a query against the prototypes is sufficient for classification. This approach will not only reduce the retrieval time but also will help increase the generalizing power of theclassification algorithm. Objects are segmented into classes automatically using an agglomerative clustering algorithm. Prototypes from these classes are extracted using one of three class prototyping algorithms. Experimental results demonstrate the effectiveness of the two steps in speeding up the classification process without sacrificing accuracy.

#*Weighted Cone-Curvature: Applications for 3D Shapes Similarity.
#@Miguel Adán,Antonio Adán,Carlos Cerrada,Pilar Merchán,Santiago Salamanca
#year2003
#conf3DIM
#citation2
#index3874
#arnetid3876

#*Capturing 2½D Depth and Texture of Time-Varying Scenes Using Structured Infrared Light.
#@Christian Früh,Avideh Zakhor
#year2005
#conf3DIM
#citation6
#index3875
#arnetid3877

#*Accurate Principal Directions Estimation in Discrete Surfaces.
#@Gady Agam,Xiaojing Tang
#year2005
#conf3DIM
#citation2
#index3876
#arnetid3878
#!Accurate local surface geometry estimation in discrete surfaces is an important problem with numerous applications. Principal curvatures and principal directions can be used in applications such as shape analysis and recognition, object segmentation, adaptive smoothing, anisotropic fairing of irregular meshes, and anisotropic texture mapping. In this paper, a novel approach for accurate principal direction estimation in discrete surfaces is described. The proposed approach is based on local directional curve sampling of the surface where the sampling frequency can be controlled. This local model has a large number of degrees of freedoms compared with known techniques and so can better represent the local geometry. The proposed approach is quantitatively evaluated and compared with known techniques for principal direction estimation. In order to perform an unbiased evaluation in which smoothing effects are factored out, we use a set of randomly generated Bezier surface patches for which the principal directions can be computed analytically.

#*3D Modeling System of Human Face and Full 3D Facial Caricaturing.
#@Takayuki Fujiwara,Hiroyasu Koshimizu,Kouta Fujimura,Hitoshi Kihara,Yoshiaki Noguchi,Naoya Ishikawa
#year2001
#conf3DIM
#citation20
#index3877
#arnetid3879
#!This paper proposes a method for modeling 3D face from the 2D facial images captured from the surrounding 2D cameras by which the color texture and surface shape information of the face are synchronously measured. And 3D facial caricaturing method is proposed by using the 3D(the polygon data) face model. Automatic method for extracting regions of the facial parts is technically proposed, and the feature points are extracted from those regions. We propose the mesh model composed of 44 feature points and 82 meshes to cover a head. To generate the caricature from this polygon data, the individuality feature is defined in value by the difference of the feature points between the input face and the mean face, which was defined from the average of many input faces.

#*Colour Texture Fusion of Multiple Range Images.
#@Alexander Agathos,Robert B. Fisher
#year2003
#conf3DIM
#citation18
#index3878
#arnetid3880

#*On the Detection of Feature Points of 3D Facial Image and its Application to 3D Facial Caricature.
#@Takayuki Fujiwara,Takeshi Nishihara,Masafumi Tominaga,Hiroyasu Koshimizu,Kunihito Kato,Kazuhito Murakami
#year1999
#conf3DIM
#citation16
#index3879
#arnetid3881

#*3D Animation Of Cerebral Activity Using Both Spatial And Temporal fMRI Information.
#@Cédric Aguerre,Pascal Desbarats,Bixente Dilharreguy,Chrit T. W. Moonen
#year2003
#conf3DIM
#citation0
#index3880
#arnetid3882

#*Interactive Shape Acquisition using Marker Attached Laser Projecto.
#@Ryo Furukawa,Hiroshi Kawasaki
#year2003
#conf3DIM
#citation17
#index3881
#arnetid3883

#*CAD and Vision in Rangefinder-based Dimensional Metrology.
#@Heikki Ailisto
#year1997
#conf3DIM
#citation0
#index3882
#arnetid3884
#!A concept of CAD model-based automated 3D measurement and the evaluation of its feasibility in cases drawn from industrial needs. Automated 3D measurement can be seen as comprising two steps: measurement planning and measurement execution. The concept was evaluated by implementing a graphical measurement planning tool and two automatic optical measurement systems equipped with vision systems for sensory feedback. The operation chain from CAD model-based measurement planning to comparison between the measured and designed geometries was demonstrated. Successful experiments with automatic operation controlled by the measurement plan and vision guidance were carried out and the key performance criteria were met.

#*Uncalibrated Multiple Image Stereo System with Arbitrarily Movable Camera and Projector for Wide Range Scanning.
#@Ryo Furukawa,Hiroshi Kawasaki
#year2005
#conf3DIM
#citation14
#index3883
#arnetid3885
#!In this paper, we propose an uncalibrated, multi-image 3D reconstruction, using coded structured light. Normally, a conventional coded structured light system consists of a camera and a projector and needs precalibration before scanning. Since the camera and the projector have to be fixed after calibration, reconstruction of a wide area of the scene or reducing occlusions by multiple scanning are difficult and sometimes impossible. In the proposed method, multiple scanning while moving the camera or the projector is possible by applying the uncalibrated stereo method, thereby achieving a multi-image 3D reconstruction. As compared to the conventional coded structured light method, our system does not require calibration of extrinsic camera parameters, occlusions are reduced, and a wide area of the scene can be acquired. As compared to image-based multi-image reconstruction, the proposed system can obtain dense shape data with higher precision. As a result of these advantages, users can freely move either the cameras or projectors to scan a wide range of objects, but not if both the camera and the projector are moved at the same time.

#*Three-Dimensional Reconstruction of the Bony Structures involved in the Articular Complex of the Human Shoulder Using Shape-Based Interpolation and Contour-Based Extrapolation.
#@Alexandra Branzan Albu,Denis Laurendeau,Luc J. Hébert,Hélène Moffet,Christian Moisan
#year2003
#conf3DIM
#citation-1
#index3884
#arnetid3886

#*Virtual Environment Modeling by Integrated Optical and Acoustic Sensing.
#@Andrea Fusiello,Riccardo Giannitrapani,V. Isaia,Vittorio Murino
#year1999
#conf3DIM
#citation5
#index3885
#arnetid3887

#*AVENUE: Automated Site Modeling in Urban Environments.
#@Peter K. Allen,Ioannis Stamos,Atanas Gueorguiev,Ethan Gold,Paul Blaer
#year2001
#conf3DIM
#citation76
#index3886
#arnetid3888

#*OSCAR: Object Segmentation Using Correspondence and Relaxation.
#@Ben Galvin,Brendan McCane,Kevin Novins
#year1999
#conf3DIM
#citation2
#index3887
#arnetid3889

#*Efficient Discovery Service for a Digital Library of 3D Models.
#@Hesham Anan,Kurt Maly,Mohammad Zubair
#year2005
#conf3DIM
#citation1
#index3888
#arnetid3890
#!Many geographically distributed experts in different areas such as medical imaging, e-commerce, and digital museums, are in need of 3D models. Although 3D models are becoming widely available due to the recent technological advancement and modeling tools, we lack a digital library system where they can be searched and retrieved efficiently. In this paper we focus on an efficient discovery service consisting of multi-level hierarchical browsing service that enables users to navigate large sets of 3D models. For this purpose, we use shape based clustering to abstract a large set of 3D models to a small set of representative models (key models). Our service applies clustering recursively to limit the number of key models that a user views at a time. Clustering is derived from metrics that are based on a concept of compression and similarity computation using surface signatures. Signatures are the two-dimensional representations of a 3D model and they can be used to define similarity between 3D models. We integrated the proposed browsing capability with 3DLIB,(a digital library for 3-D models that we are building at Old Dominion University), and evaluated the proposed browsing service using the Princeton Shape Benchmark (PSB). Our evaluation shows significant better precision and recall as compared to other approaches.

#*Industrial Painting Inspection using Specular Sharpness.
#@Jaime Gómez García-Bermejo,J. Delgado Urrechu,F. J. Diaz Pernas,Juan López Coronado
#year1997
#conf3DIM
#citation0
#index3889
#arnetid3891
#!Digital 3D plus color imaging is a growing field as it has many industrial applications. One of them is the precise understanding of optical properties of objects, which is possible to obtain from 3D plus brightness or color data. Those properties are usually important inspection criteria; for example, the specular sharpness of a coatted surface is usually related to the coating quality. This paper is related to a procedure for recovering the specular sharpness and other surface-related properties from objects. The current approach works on 3D plus brightness or color data, which are retrieved in two steps using a common structured-light triangulation-based technique and an ordinary non-structured spot light. Some experimental results obtained on industrial parts are also shown.

#*Automatic 3D modeling of palatal plaster casts.
#@Marco Andreetto,Nicola Brusco,Guido Maria Cortelazzo
#year2003
#conf3DIM
#citation10
#index3890
#arnetid3892

#*Geometrically Stable Sampling for the ICP Algorithm.
#@Natasha Gelfand,Szymon Rusinkiewicz,Leslie Ikemoto,Marc Levoy
#year2003
#conf3DIM
#citation101
#index3891
#arnetid3893

#*On-Line Hand-Eye Calibration.
#@Nicolas Andreff,Radu Horaud,Bernard Espiau
#year1999
#conf3DIM
#citation13
#index3892
#arnetid3894

#*Multiresolution Interactive Modeling with Efficient Visualization.
#@Jean-Daniel Deschênes,Patrick Hébert,Philippe Lambert,Jean-Nicolas Ouellet,Dragan Tubic
#year2005
#conf3DIM
#citation4
#index3893
#arnetid3895
#!3D interactive modeling from range data aims at simultaneously producing and visualizing the surface model of an object while data is collected. The current research challenge is producing the final result in real-time. Using a recently proposed framework, a surface model is built in a volumetric structure encoding a vector field in the neighborhood of the object surface. In this paper, it is shown that the framework allows one to locally control the model resolution during acquisition. Using ray tracing, efficient visualization approaches of the multiresolution vector field are described and compared. More precisely, it is shown that volume traversal can be optimized while preventing holes and reducing aliasing in the rendered image.

#*A Robust Image-Based Method for 3D Registration.
#@Ting Li
#year2005
#conf3DIM
#citation0
#index3894
#arnetid3896
#!Today modeling from reality receives more and more attention. In this paper, we present a novel image-based 3D registration method. Compared with a previous one it does not require accurate starting position, albedo and geometric invariants, but has to address the more apparent mismatch problems. First, distinctive corner points, which act as salient features for subsequent image matching, are detected via the minimal eigenvalue of the auto-correlation matrix. Then, a verification scheme discards the potential mismatches by thresholds of the correlation coefficients and point-to-point distances. Experimental results demonstrate the superiority of our proposed verification scheme to the previous one using only correlation coefficients under the relaxed conditions.

#*A 3D Laser Micro-sensor Integrating Control and Data Processing in an FPGA-Based Calculator.
#@Nestor Arana-Arejolaleiba,Maurice Briot,Christian Ganibal,Alexandre Nketsa,Roland Prajoux
#year2001
#conf3DIM
#citation0
#index3895
#arnetid3897

#*Hierarchical Coarse to Fine Depth Estimation for Realistic View Interpolation.
#@Indra Geys,Luc J. Van Gool
#year2005
#conf3DIM
#citation3
#index3896
#arnetid3898
#!This paper presents a novel approach for view synthesis and image interpolation. The algorithm is build up in a hierarchical way, and this on different structural levels instead of using a classic image pyramid. First coarse matching is done on a ýshape basisý only. A background-foreground segmentation yields a fairly accurate contour for every incoming video stream. Inter-relating these contours is a 1D problem and as such very fast. This step is then used to compute small position dependent bounding-boxes in 3D space which enclose the underlying object. The next step is a more expensive window based matching, within the volume of these bounding-boxes. This is limited to a number of regions around ýpromisingý feature points. Global regularisation is obtained by a graph cut. Speed results here from limiting the number of feature points. In a third step the interpolation is ýpre-renderedý and simultaneously evaluated on a per pixel basis. This is done by computing a Birchfield dissimilarity measure on the GPU. Per pixel parallelised operations keep computational cost low. Finally the bad interpolated parts are ýpatchedý. This per pixel correction yields the final interpolated view at the finest level. Here we will also deal explicitly with opacity at the borders of the foreground object.

#*3D Modeling of Outdoor Environments by Integrating Omnidirectional Range and Color Images.
#@Toshihiro Asai,Masayuki Kanbara,Naokazu Yokoya
#year2005
#conf3DIM
#citation14
#index3897
#arnetid3899
#!This paper describes a 3D modeling method for wide area outdoor environments which is based on integrating omnidirectional range and color images. In the proposed method, outdoor scenes can be efficiently digitized by an omnidirectional laser rangefinder which can obtain a 3D shape with high-accuracy and by an omnidirectional multi-camera system (OMS) which can capture a high-resolution color image. Multiple range images are registered by minimizing the distances between corresponding points in the different range images. In order to register multiple range images stably, points on plane portions detected from the range data are used in registration process. The position and orientation acquired by RTK-GPS and gyroscope are used as initial values of simultaneous registration. The 3D model obtained by registration of range data is mapped by textures selected from omnidirectional images in consideration of the resolution of texture and occlusions of the model. In experiments, we have carried out 3D modeling of our campus with the proposed method.

#*Detecting Cylinders in 3D Range Data Using Model Selection Criteria.
#@Niloofar Gheissari,Alireza Bab-Hadiashar
#year2005
#conf3DIM
#citation1
#index3898
#arnetid3900
#!In this paper, we use a model selection criterion to decide whether two cylinders should be merged as a single cylinder or they should be left separated. We compare and evaluate an extensive number of different model selection criteria for this purpose and examine which factors can affect their performance. We conclude that SSC, GIC, MCAIC and CAIC have a better performance (for this particular application) compared to the other criteria.

#*Constructing Models of Articulating Objects: Range Data Partitioning.
#@Anthony Ashbrook,Robert B. Fisher
#year1997
#conf3DIM
#citation9
#index3899
#arnetid3901
#!In this paper we consider one aspect of the problem of automatically building shape models of articulating objects from example range images. Central to the model construction problem is the registration of range data, taken from different vantage points, into a common coordinate frame. This involves determining a transformation for each set of range data which aligns overlapping surface points in the common frame. Current registration algorithms have been developed specifically for rigid objects, but it is not obvious how these can be extended to articulated or more generally deformable objects. Here, we propose that range images of articulated objects are first segmented into their rigid subcomponents. Each subcomponent can then be registered in isolation using the existing algorithms designed specifically for rigid parts and the final model formed by reassembling all of the submodels. This has motivated the development of a rigid part segmentation algorithm which is described and demonstrated here. The algorithm is currently limited to non-umbilic surfaces, but in this more restricted domain is shown to work well.

#*Human Identification from Body Shape.
#@Afzal Godil,Patrick Grother,Sandy Ressler
#year2003
#conf3DIM
#citation4
#index3900
#arnetid3902

#*Extracting Main Modes of Human Body Shape Variation from 3-D Anthropometric Data.
#@Zouhour Ben Azouz,Chang Shu,Richard Lepage,Marc Rioux
#year2005
#conf3DIM
#citation8
#index3901
#arnetid3903
#!Characterizing the variations of the human body shape is fundamentally important to many applications ranging from animation to product design. 3-D scanning technology makes it possible to digitize the complete surfaces of a large number of human bodies, providing much richer information about the body shape than the traditional anthropometric measurements. This technology opens up opportunities to extract new measurements for quantifying the body shape. Using the data from the first large scale 3-D anthropometric survey, the CAESAR project, we demonstrate that the human body shape can be represented by a small number of principal components. Principal Component Analysis extracts orthogonal basis vectors, called eigenpersons, from the space of body shapes. The shape of any individual person can then be expressed by the linear combination of the basis vectors. We demonstrate that some of these components correspond to the commonly used body measurements like height and weight and others indicate new ways of charactering body shape variations. We develop tools to visualize the changes of the body shape along the main components. These tools help understand the meaningful components of the human body shape.

#*A Method for the Registration of Attributed Range Images.
#@Guy Godin,Denis Laurendeau,Robert Bergevin
#year2001
#conf3DIM
#citation53
#index3902
#arnetid3904

#*Data Acquisition and Representation of Mechanical Parts and Interfaces to Manufacturing Devices.
#@Ruzena Bajcsy,Richard Pito
#year1997
#conf3DIM
#citation1
#index3903
#arnetid3905
#!In this paper we address data acquisition, data represen- tation and interfaces to manufacturing devices as they relate to automatic creation of electronic files for representing the complete geometry of an arbitrarily shaped part.

#*Accuracy of 3D Range Scanners by Measurement of the Slanted Edge Modulation Transfer Function.
#@Michael Goesele,Christian Fuchs,Hans-Peter Seidel
#year2003
#conf3DIM
#citation3
#index3904
#arnetid3906

#*Design Considerations for a Range Image Sensor Containing a PSD-array and An On-chip Multiplexer.
#@Michiel de Bakker,Piet W. Verbeek,Gijs K. Steenvoorden
#year1997
#conf3DIM
#citation4
#index3905
#arnetid3907
#!In the present paper we introduce a range image sensor, the PSD-chip, designed for sheet of light range imaging. The image sensor consists of an array of 128 Position Sensitive Detector (PSD)-strips with a 20 mm length and a 28 /spl mu/m pitch. Design considerations for the image sensor are discussed, as well as the on-chip electronics. The on-chip electronics consists of an analog part and a digital part. The analog preamplifiers deal with the low-pass filtering of the sensor-signals in order to reduce the noise bandwidth. The digital part consists of an analog current multiplexer, implemented in ECL technology. Our goal is to achieve a 2 MHz range/frequency at 12 bits resolution.

#*Image-Gradient-Guided Real-Time Stereo on Graphics Hardware.
#@Minglun Gong,Ruigang Yang
#year2005
#conf3DIM
#citation32
#index3906
#arnetid3908
#!We present a real-time correlation-based stereo algorithm with improved accuracy. Encouraged by the success of recent stereo algorithms that aggregate the matching cost based on color segmentation, a novel image-gradient-guided cost aggregation scheme is presented in this paper. The new scheme is designed to fit the architecture of recent graphics processing units (GPUs). As a result, our stereo algorithm can run completely on the graphics board: from rectification, matching cost computation, cost aggregation, to the final disparity selection. Compared with many real-time stereo algorithms that use fixed windows, noticeable accuracy improvement has been obtained without sacrificing realtime performance. In addition, existing global optimization algorithms can also benefit from the new cost aggregation scheme. The effectiveness of our approach is demonstrated with several widely used stereo datasets and live data captured from a stereo camera.

#*Structure and Motion from Two Uncalibrated Views Using Points on Planes.
#@Adrien Bartoli,Peter F. Sturm,Radu Horaud
#year2001
#conf3DIM
#citation17
#index3907
#arnetid3909

#*Automatic CAD Modeling of Industrial Pipes from Range Images.
#@François Goulette
#year1997
#conf3DIM
#citation-1
#index3908
#arnetid3910
#!We present in this paper a method to obtain automatically CAD models of industrial pipes from range images. The models are based on two geometric primitives, cylinders and torii, which are enough to represent most parts of the pipes. The images are obtained with an accurate long-distance laser range sensor developed for reverse engineering in industrial structures. The key issue for automatic CAD modeling is the automatic segmentation of the data into subsets of points corresponding to the desired primitives. To do so, we use differential geometry to segment lines of centers of curvature into straight and curved parts, corresponding to the cylinder and torus parts of the original image. Differential geometry results being noisy and biased, we use an optimal approach for the computation of centers of curvature.

#*Fast Global Registration of 3D Sampled Surfaces using a Multi-Z-Buffer Technique.
#@Raouf Benjemaa,Francis Schmitt
#year1997
#conf3DIM
#citation130
#index3909
#arnetid3911
#!We present a new method for the global registration of several overlapping 3D surfaces sampled on an object. The method is based on the ICP (iterative closest point) algorithm and on a segmentation of the sampled points in an optimized set of z-buffers. This multi-z-buffer technique provides a 3D space partitioning which greatly accelerates the search of the nearest neighbours in the establishment of the point-to-point correspondence between overlapping surfaces. Then a randomized iterative registration is processed on the surface set. We have tested an implementation of this technique on real sampled surfaces. It appears to be rapid accurate and robust, especially in the case of highly curved objects.

#*3-D Vision Technology for Occupant Detection and Classification.
#@Pandu Ranga Rao Devarakota,Bruno Mirbach,Marta Castillo-Franco,Björn E. Ottersten
#year2005
#conf3DIM
#citation3
#index3910
#arnetid3912
#!This paper describes a 3-D vision system based on a new 3-D sensor technology for the detection and classification of occupants in a car. New generation of so-called "smart airbags" require the information about the occupancy type and position of the occupant. This information allows a distinct control of the airbag inflation. In order to reduce the risk of injuries due to airbag deployment, the airbag can be suppressed completely in case of a child seat oriented in reward direction. In this paper we propose a 3-D vision system based on a 3-D optical time-of-flight (TOF) sensor, for the detection and classification of the occupancy on the passenger seat. Geometrical shape features are extracted from the 3-D image sequences. Polynomialclassifier is considered for the classification task. A comparison of classifier performance with principle components (eigenimages) is presented. This paper also discuss the robustness of the features with variation of the data. The full scale tests have been conducted on a wide range of realistic situations (adults/children/child seats etc.) which may occur in a vehicle.

#*Digital 3D Imaging System for Rapid Response on Remote Sites.
#@J.-Angelo Beraldin,François Blais,Luc Cournoyer,Marc Rioux,Sabry F. El-Hakim,R. Rodella,F. Bernier,N. Harrison
#year1999
#conf3DIM
#citation25
#index3911
#arnetid3913

#*Is Appearance-Based Structure from Motion Viable?
#@David DiFranco,Sing Bing Kang
#year1999
#conf3DIM
#citation-1
#index3912
#arnetid3914

#*Using k-d Trees for Robust 3D Point Pattern Matching.
#@Baihua Li,Horst Holstein
#year2003
#conf3DIM
#citation7
#index3913
#arnetid3915

#*Optimized Position Sensors for Flying-Spot Active Triangulation Systems.
#@J.-Angelo Beraldin,François Blais,Marc Rioux,Jacques Domey,Lorenzo Gonzo,Fabrizio De Nisi,F. Comper,David Stoppa,Massimo Gottardi,Andrea Simoni
#year2003
#conf3DIM
#citation9
#index3914
#arnetid3916

#*Registration and Fusion of Intensity and Range Data for 3D Modelling of Real World Scenes.
#@Paulo Dias,Vítor Sequeira,Francisco Vaz,João G. M. Gonçalves
#year2003
#conf3DIM
#citation19
#index3915
#arnetid3917

#*Automatic Editing and Curve-fitting of 3-D Surface Scan Data of the Human Body.
#@Peng Li,Peter R. M. Jones
#year1997
#conf3DIM
#citation10
#index3916
#arnetid3918
#!This paper presents an automatic method to trim arms from the surface scan data of the human body. Curve and surface approximation are employed to refill the data gap after the trimming process. This delivers a more realistic torso model for further applications.

#*Object Model Creation from Multiple Range Images: Acquisition, Calibration, Model Building and Verification.
#@J.-Angelo Beraldin,Luc Cournoyer,Marc Rioux,François Blais,Sabry F. El-Hakim,Guy Godin
#year1997
#conf3DIM
#citation62
#index3917
#arnetid3919
#!This paper demonstrates the accuracy of a prototype Laser Range Camera (LRC) developed at the National Research Council of Canada for the creation of models of real objects. A laser survey performed in collaboration with the Canadian Space Agency and NASA is used as a test case. The object selected for this particular test case is the Orbiter Docking System (ODS) located at the Kennedy Space Center, Florida. During the laser survey, 128 range (and registered intensity) images were acquired all around the ODS. These images were then processed in our laboratory. A full model of the top portion of the ODS was created along with an almost complete model of the ODS. The ODS has a diameter of 1.6 m and a height of 3.9 m. Targets mounted on the top portion of the ODS were used to assess the accuracy of the calibration and of the image registration process. These targets were measured with a network of theodolites a day prior to the laser survey and used as a reference. With the current calibration and range image registration techniques, an accuracy better than 0.25 mm in X and Y, and, 0.80 mm in Z was achieved. These results compare favorably with the single point accuracy obtained after calibration, i.e., about 0.25 mm in X and Y, and, 0.50 mm in Z. These figures and others should testify on the usefulness of a LRC for accurate model building.

#*A Scene Analysis System for the Generation of 3-D Models.
#@Oliver Grau
#year1997
#conf3DIM
#citation33
#index3918
#arnetid3920
#!A scene analysis system for the 3-D modeling of objects is presented. It combines surface reconstruction techniques with object recognition for the generation of 3-D models for computer graphic applications. The system permits the insertion of highlevel constraints, like a specific angle between two house walls, in an explicit knowledge base implemented as a semantic net. The applicability of those constraints is proved by asserting and testing hypotheses in an interpretation phase. In the case of rejection a more general constraint or model is selected. The capabilities of the system were shown for the modeling of buildings using depth from stereo and contour information. The system reconstructs the surface of the scene objects using the constraints selected in the prior interpretation.

#*Real-Time Geometrical Tracking and Pose Estimation Using Laser Triangulation and Photogrammetry.
#@François Blais,J.-Angelo Beraldin,Sabry F. El-Hakim,Luc Cournoyer
#year2001
#conf3DIM
#citation13
#index3919
#arnetid3921

#*Efficient and Reliable Template Set Matching for 3D Object Recognition.
#@Michael A. Greenspan,Pierre Boulanger
#year1999
#conf3DIM
#citation13
#index3920
#arnetid3922

#*Recursive Model Optimization Using ICP and Free Moving 3D Data Acquisition.
#@François Blais,Michel Picard,Guy Godin
#year2003
#conf3DIM
#citation23
#index3921
#arnetid3923

#*A Nearest Neighbor Method for Efficient ICP.
#@Michael A. Greenspan,Guy Godin
#year2001
#conf3DIM
#citation-1
#index3922
#arnetid3924

#*A Geometric Approach to the Segmentation of Range Images.
#@Mary Ellen Bock,Concettina Guerra
#year1999
#conf3DIM
#citation8
#index3923
#arnetid3925

#*Approximate K-D Tree Search for Efficient ICP.
#@Michael A. Greenspan,Mike Yurick
#year2003
#conf3DIM
#citation63
#index3924
#arnetid3926

#*Accuracy of 3D Scanning Technologies in a Face Scanning Scenario.
#@Chris Boehnen,Patrick J. Flynn
#year2005
#conf3DIM
#citation21
#index3925
#arnetid3927
#!In this paper, we will review several different 3D scanning devices. We will present a method for empirical accuracy analysis, and apply it to several scanners providing an overview of their technologies. The scanners include both general purpose and face specific scanning devices. We will focus on face scanning technique, although the technique should be applicable to other domains as well. The proposed method involves several different calibration faces of known shape and comparisons of their scans to investigate both absolute accuracy and repeatability.

#*Hand Posture Estimation from 2D Monocular Image.
#@H. Y. Guan,C. S. Chua,Y. K. Ho
#year1999
#conf3DIM
#citation6
#index3926
#arnetid3928

#*Hierarchical Segmentation of Range Images with Contour Constraints.
#@Pierre Boulanger,Gustavo Osorio,Flavio Prieto
#year2005
#conf3DIM
#citation5
#index3927
#arnetid3929
#!This paper describes a new algorithm to segment in continuous parametric regions range images. The algorithm starts with an initial partition of small first order regions using a robust fitting algorithm constrained by the detection of depth and orientation discontinuities. The algorithm then optimally group these regions into larger and larger regions using parametric functions until an approximation limit is reached. The algorithm uses Bayesian decision theory to determine the local optimal grouping and the complexity of the parametric model used to represent the range signal. After the segmentation process an exact description of the boundary of each region is computed from the mutual intersections of the extracted surfaces. Experimental results show significant improvement of region boundary localization. A systematic comparison of our algorithm to the most well known algorithm in the literature is presented to highlight the contributions of this paper.

#*Reliable 3D Surface Acquisition, Registration and Validation Using Statistical Error Models.
#@Jens Guehring
#year2001
#conf3DIM
#citation24
#index3928
#arnetid3930

#*Non-Parametric 3D Surface Completion.
#@Toby P. Breckon,Robert B. Fisher
#year2005
#conf3DIM
#citation14
#index3929
#arnetid3931
#!We consider the completion of the hidden or missing portions of 3D objects after the visible portions have been acquired with 2½D (or 3D) range capture. Our approach uses a combination of global surface fitting, to derive the underlying geometric surface completion, together with an extension, from 2D to 3D, of non-parametric texture synthesis in order to complete localised surface texture relief and structure. Through this combination and adaptation of existing completion techniques we are able to achieve realistic, plausible completion of 2½D range captures.

#*Robust Surface Matching for Registration.
#@Elizabeth Guest,Steven Kelly,Elizabeth Berry,Márta Fidrich
#year1999
#conf3DIM
#citation4
#index3930
#arnetid3932

#*Micro-Stereoscopic Vision System for the Determination of Air Bubbles and Aqueous Droplets Content within Oil Drops in Simulated Processes of Multiphase Fermentations.
#@J. B. Briere,M. S. Cordova,E. Galindo,Gabriel Corkidi
#year2005
#conf3DIM
#citation1
#index3931
#arnetid3933
#!Industrial fermentation procedures involve the mixing of multiple phases (solid, liquid, gaseous), where the interfacial area between the phases (air bubbles, oil drops and aqueous medium) determines the nutrients transfer and hence the performance of the culture. Interactions between phases occur, giving rise to the formation of complex structures containing air bubbles and small drops from the aqueous phase, trapped in oil drops (water-in-oil-in-water). A two-dimensional observation of this phenomenon may lead to an erroneous determination of the phenomena occurring since bubbles and droplets coming from different focal planes may appear overlapped. In the present work, an original strategy to solve this problem is described. Micro-stereoscopic on-line image acquisition techniques have been used, so as to obtain accurate images from the cultures for further three-dimensional analysis. Using this methodology, the three-dimensional spatial position of the trapped bubbles and droplets moving at high speed can be calculated in order to determine their relative concentration. To evaluate the accuracy of this technique, the results obtained with our system have been compared with those obtained by an expert. An agreement of 95% was achieved. Also, this technique was able to evaluate 14% more bubbles and droplets corresponding to overlaps that the expert was not able to discern in non-stereoscopic images.

#*3D optical scanning diagnostics for Leonardo Da Vinci's "Adorazione dei Magi" conservation.
#@Gabriele Guidi,Carlo Atzeni,Sara Lazzari
#year2003
#conf3DIM
#citation7
#index3932
#arnetid3934

#*Unsupervised 3D Object Recognition and Reconstruction in Unordered Datasets.
#@Matthew Brown,David G. Lowe
#year2005
#conf3DIM
#citation79
#index3933
#arnetid3935
#!This paper presents a system for fully automatic recognition and reconstruction of 3D objects in image databases. We pose the object recognition problem as one of finding consistent matches between all images, subject to the constraint that the images were taken from a perspective camera. We assume that the objects or scenes are rigid. For each image we associate a camera matrix, which is parameterised by rotation, translation and focal length. We use invariant local features to find matches between all images, and the RANSAC algorithm to find those that are consistent with the fundamental matrix. Objects are recognised as subsets of matching images. We then solve for the structure and motion of each object, using a sparse bundle adjustment algorithm. Our results demonstrate that it is possible to recognise and reconstruct 3D objects from an unordered image database with no user input at all.

#*Accuracy Verification and Enhancement in 3D Modeling: Application to Donatello's Maddalena.
#@Gabriele Guidi,Andrea Cioci,Carlo Atzeni,J.-Angelo Beraldin
#year2003
#conf3DIM
#citation1
#index3934
#arnetid3936

#*Optimal Postures and Positioning for Human Body Scanning.
#@Matthew A. Brunsman,Hein A. M. Daanen,Kathleen M. Robinette
#year1997
#conf3DIM
#citation32
#index3935
#arnetid3937
#!Advancements in technology for digitizing the surface of the human body are providing new opportunities for research in engineering anthropometry, the study of human body measurement for design and evaluation purposes. The availability of the technology is just the first step in applying surface scanning to engineering anthropometry; several issues remain to be resolved to make these tools useful for engineering applications. One important issue is the standardization of positioning and the posture of the subject for scanning. In engineering it is not enough to be able to measure one individual one time in one posture, but it is also necessary to measure the individual in different postures and compare the individual with many other people who have been comparably measured. Not surprisingly, people can be more difficult to measure precisely than fixed stationary objects. In the process of developing standardized procedures for surveying the civilian populations of North America and Europe, an experiment was conducted to determine optimal scanning positions. While this experiment used just one type of scanning technology, many of the methods are transferable to other methods as well. This paper discusses the results from that investigation.

#*3D Digitization of a Large Model of Imperial Rome.
#@Gabriele Guidi,Laura Loredana Micoli,Michele Russo,Bernard Frischer,Monica De Simone,Alessandro Spinetti,Luca Carosso
#year2005
#conf3DIM
#citation6
#index3936
#arnetid3938
#!This paper describes 3D acquisition and modeling of the "Plastico di Roma antica", a large plaster-of-Paris model of imperial Rome (16x17 meters) created in the last century. Its overall size demands an acquisition approach typical of large structures, but it is also characterized by extremely tiny details, typical of small objects: houses are a few centimeters high; their doors, windows, etc. are smaller than 1 cm. The approach followed to resolve this "contradiction" is described. The result is a huge but precise 3D model created by using a special metrology Laser Radar. We give an account of the procedures of reorienting the large point clouds obtained after each acquisition step (50-60 million points) into a single reference system by means of measuring fixed redundant reference points. Finally we show how the data set can be properly divided into 2x2 meters sub-areas for allowing data merging and mesh editing..

#*3D Registration by Textured Spin-Images.
#@Nicola Brusco,Marco Andreetto,Andrea Giorgi,Guido Maria Cortelazzo
#year2005
#conf3DIM
#citation25
#index3937
#arnetid3939
#!This work is motivated by the desire of exploiting for 3D registration purposes the photometric information current range cameras typically associate to range data. Automatic pairwise 3D registration procedures are two steps procedures with the first step performing an automatic crude estimate of the rigid motion parameters and the second step refining them by the ICP algorithm or some of its variations. Methods for efficiently implementing the first crude automatic estimate are still an open research area. Spin-images are a 3D matching tecnique very effective in this task. Since spin-images solely exploit geometry information it appears natural to extend their original definition to include texture information. Such an operation can clearly be made in many ways. This work introduces one particular extension of spin-images, called textured spin-images, and demostrates its performance for 3D registration. It will be seen that textured spin-images enjoy remarkable properties since they can give rigid motion estimates more robust, more precise, more resilient to noise than standard spin-images at a lower computational cost.

#*Calibration of a Zooming Camera using the Normalized Image of the Absolute Conic.
#@Jean-Yves Guillemaut,Alberto S. Aguado,John Illingworth
#year2003
#conf3DIM
#citation1
#index3938
#arnetid3940

#*3-D Landmark Detection and Identification in the CAESAR Project.
#@Dennis Burnsides,Mark Boehmer,Kathleen M. Robinette
#year2001
#conf3DIM
#citation20
#index3939
#arnetid3941

#*Euclidean Reconstruction from Translational Motion Using Multiple Cameras.
#@Pär Hammarstedt,Anders Heyden
#year2005
#conf3DIM
#citation1
#index3940
#arnetid3942
#!We investigate the possibility of Euclidean reconstruction from translational motion, using multiple uncalibrated cameras. We show that in the case of multiple cameras viewing a translating scene, no additional constraints are given by the translational motion compared to the more general case with one camera viewing a scene undergoing a general motion. However, the knowledge of translational motion allows an intermediate affine reconstruction from each camera, and aids in the reconstruction process by simplifying several steps, resulting in a more reliable algorithm for 3D reconstruction. We also identify the critical directions of translation, for which no affine reconstruction is possible. Experiments on real and simulated data are performed to illustrate that the method works in practice.

#*Automated Pavement Distress Collection and Analysis: A 3-D Approach.
#@Liviu Bursanescu,François Blais
#year1997
#conf3DIM
#citation-1
#index3941
#arnetid3943

#*Compact and Portable 3D Camera for Space Applications.
#@E. Harvey,M. Arsenault,J.-F. Lavoie,B. Bélanger,M.-A. Boucher
#year2001
#conf3DIM
#citation3
#index3942
#arnetid3944

#*Comparison of HK and SC Curvature Description Methods.
#@H. Cantzler,Robert B. Fisher
#year2001
#conf3DIM
#citation17
#index3943
#arnetid3945

#*Generalized Cylinders Extraction in a Range Image.
#@Denis Dion Jr.,Denis Laurendeau,Robert Bergevin
#year1997
#conf3DIM
#citation-1
#index3944
#arnetid3946
#!We deal with 3D object modeling using generalized cylinders from a single range image. We focus on right generalized cylinders, a class of generalized cylinders for which the cross-section is at right angle with the axis. No homogeneity or straightness constraints are imposed. The crucial part of this work is the extraction of axis points and the representation of the axis curve in 3D space. Interesting results are obtained with a broad variety of range images.

#*Realistic Human Head Modeling with Multi-View Hairstyle Reconstruction.
#@Xiaolan Li,Hongbin Zha
#year2005
#conf3DIM
#citation4
#index3945
#arnetid3947
#!We present a method for constructing photorealistic 3D head models from color images and a geometric head model of a specific person. With a simple experimental setup, we employ a user-assisted technique to register the uncalibrated images with the geometric model. A weighted averaging method is then used to extract a panoramic texture map from the input images. To recover the hairstyle of the specified person, a virtual photo plane is defined, according to a corresponding true photo plane, on which one input image is recorded. It provides hints to compute the 3D positions of the visual contour points of the hair from the images taken at different viewpoints. Finally, more hairs are grown to cover the whole region of the scalp using an interpolation method on the 3D scalp mesh surfaces.

#*Large Data Sets and Confusing Scenes in 3-D Surface Matching and Recognition.
#@Owen T. Carmichael,Daniel F. Huber,Martial Hebert
#year1999
#conf3DIM
#citation19
#index3946
#arnetid3948

#*How Much 3D-Information Can We Acquire? Optical Range Sensors at the Physical Limit, and Where to Apply Them.
#@Gerd Häusler
#year2001
#conf3DIM
#citation0
#index3947
#arnetid3949

#*Automatic Body Measurement for Mass Customization of Garments.
#@Andrew Certain,Werner Stuetzle
#year1999
#conf3DIM
#citation7
#index3948
#arnetid3950

#*Automatic Registration of Range Images Based on Correspondence of Complete Plane Patches.
#@Wenfeng He,Wei Ma,Hongbin Zha
#year2005
#conf3DIM
#citation7
#index3949
#arnetid3951
#!One of the difficulties in registering two range images scanned by 3D laser scanners is how to get a correct correspondence over the two images automatically. In this paper, we propose an automatic registration method based on matching of extracted planes. First, we introduce a new class of features: complete plane patches (CPP) on the basis of analysis of properties of real scenes. Then we generate a compact interpretation tree for these features. Finally, the image registration is accomplished automatically by searching the interpretation tree.

#*Semi-Automatic Range to Range Registration: A Feature-Based Method.
#@Chen Chao,Ioannis Chao
#year2005
#conf3DIM
#citation21
#index3950
#arnetid3952

#*A Self-Referenced Hand-Held Range Sensor.
#@Patrick Hébert
#year2001
#conf3DIM
#citation44
#index3951
#arnetid3953

#*Segmentation of Range Images into Planar Regions.
#@Paul Checchin,Laurent Trassoudaine,J. Alizon
#year1997
#conf3DIM
#citation17
#index3952
#arnetid3954
#!This paper presents a hybrid approach to the segmentation of range images into planar regions. The term hybrid refers to a combination of edge- and region-based considerations. A reliable computational procedure which takes the range image discontinuities into account is presented for computing the pixel's normal. The segmentation algorithm consists of two parts. In the first one, the pixels are aggregated according to local properties derived from the input data and are represented by a region adjacency graph (RAG). At this stage, the image is still over-segmented. In the second part, the segmentation is refined thanks to the construction of an irregular pyramid. The base of the pyramid is the RAG previously extracted. The over-segmented regions are merged using a surface-based description. This algorithm has been evaluated on 80 real images acquired by two different range sensors using the methodology proposed in (Hoover et al., 1996). Experimental results are presented and compared to others obtained by four research groups.

#*Locking onto 3D-Structure by a Combined Vergence and Fusion System.
#@R. D. Henkel
#year1999
#conf3DIM
#citation3
#index3953
#arnetid3955

#*A 3D Scanning System Based on Low-Occlusion Approach.
#@Bor-Tow Chen,Wen-Shiou Lou,Chia-Chen Chen,Hsien-Chang Lin
#year1999
#conf3DIM
#citation3
#index3954
#arnetid3956

#*Multi-Resolution Geometric Fusion.
#@Adrian Hilton,John Illingworth
#year1997
#conf3DIM
#citation10
#index3955
#arnetid3957
#!Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit surface representation enables fast reconstruction for complex object modelling. However, surfaces are represented at a single resolution resulting in impractical storage costs for accurate reconstruction of large objects. This paper addresses accurate reconstruction of surface models independent of object size. An incremental algorithm is presented for implicit surface representation of an arbitrary triangulated mesh in a volumetric envelope around the surface. A hierarchical volumetric structure is introduced for efficient representation by local approximation of the surface within a fixed error bound using the maximum voxel size. Multi-resolution geometric fusion is achieved by incrementally constructing a hierarchical surface representation with bounded error. Results are presented for validation of the multi-resolution representation accuracy and reconstruction of real objects. Multi-resolution geometric fusion achieves a significant reduction in representation cost for the same level of geometric accuracy.

#*A Light Modulation/Demodulation Method for Real-Time 3D Imaging.
#@Qian Chen,Toshikazu Wada
#year2005
#conf3DIM
#citation3
#index3956
#arnetid3958
#!This paper describes a novel method for digitizing the 3D shape of an object in real-time, which can be used for capturing live sequence of the 3D shape of moving or deformable objects such as faces. Two DMD (= Digital Micro Mirror) devices are used as high speed switches for modulating and demodulating light rays. One DMD is used to generate rays of light pulses, which are projected onto the object to be measured. Another DMD is used to demodulate the light reflected from the object illuminated by the light pulses into intensity image that describes the disparity. A prototype range finder implementing the proposed method has been built. The experimental results showed that the proposed method works and video sequences of disparity images can be captured in real time.

#*Toward Optimal Structured Light Patterns.
#@Eli Horn,Nahum Kiryati
#year1997
#conf3DIM
#citation82
#index3957
#arnetid3959
#!A methodology for the optimal design of projection patterns for stereometric structured light systems is presented. The similarity as well as the difference between the design of projection patterns and the design of optimal signals for digital communication are discussed. The design of K projection patterns for a structured light system with L distinct planes of light is shown to be equivalent to the placement of L points in a K dimensional space subject to certain constraints. optimal design in the MSE sense is defined, but shown to lead to an intractable multi-parameter global optimization problem. Intuitively appealing suboptimal solutions derived from the family of K dimensional space-filling Hilbert curves are obtained. Preliminary experimental results are presented.

#*Edge-Based Approach to Mesh Simplification.
#@Kyowoong Choo,Il Dong Yun,Sang Uk Lee
#year1999
#conf3DIM
#citation8
#index3958
#arnetid3960

#*A Complete U-V-Disparity Study for Stereovision Based 3D Driving Environment Analysis.
#@Zhencheng Hu,Francisco Lamosa,Keiichi Uchimura
#year2005
#conf3DIM
#citation14
#index3959
#arnetid3961
#!Reliable understanding of the 3D driving environment is vital for obstacle detection and Adaptive Cruise Control (ACC) applications. Laser or millimeter wave radars have shown good performance in measuring relative speed and distance in a highway driving environment. However the accuracy of these systems decreases in an urban traffic environment as more confusion occurs due to factors such as parked vehicles, guardrails, poles and motorcycles. A stereovision based sensing system provides an effective supplement to radar-based road scene analysis with its much wider field of view and more accurate lateral information. This paper presents an efficient solution using a stereovision based road scene analysis algorithm which employs the "U-V-disparity" concept. This concept is used to classify a 3D road scene into relative surface planes and characterize the features of road pavement surfaces, roadside structures and obstacles. Real-time implementation of the disparity map calculation and the "U-V-disparity" classification is also presented.

#*Calibration-Free Approach to 3D Reconstruction Using Light Stripe Projections on a Cube Frame.
#@Chang Woo Chu,Sungjoo Hwang,Soon Ki Jung
#year2001
#conf3DIM
#citation22
#index3960
#arnetid3962

#*Moving Objects Detection from Time-Varied Background: An Application of Camera 3D Motion Analysis.
#@Zhencheng Hu,Keiichi Uchimura
#year1999
#conf3DIM
#citation7
#index3961
#arnetid3963

#*PALM: Portable Sensor-Augmented Vision System for Large-Scene Modeling.
#@Teck Khim Ng,Takeo Kanade
#year1999
#conf3DIM
#citation3
#index3962
#arnetid3964

#*Automatic Burr Detection on Surfaces of Revolution Based on Adaptive 3D Scanning.
#@Kasper Claes,Thomas P. Koninckx,Herman Bruyninckx
#year2005
#conf3DIM
#citation2
#index3963
#arnetid3965
#!This paper describes how to automatically extract the presence and location of geometrical irregularities on a surface of revolution. To this end a partial 3D scan of the workpiece under consideration is acquired by structured light ranging. The application we focus on is the detection and removal of burrs on industrial workpieces. Cylindrical metallic objects will cause a strong specular reflection in every direction. These highlights are compensated for in the projected patterns, hence ýadaptive 3D scanningý. The triangular mesh produced is then used to identify the axis and generatrix of the corresponding surface of revolution. The search space for finding this axis is four dimensional: a valid choice of parameters is two orientation angles (as in spherical coordinates) and the 2D intersection point with the plane spanned by two out of three axis of the local coordinate system. For finding the axis we test the circularity of the planar intersections of the mesh in different directions, using statistical estimation methods to deal with noise. Finally the ýidealý generatrix derived from the scan data is compared to the real surface topology. The difference will identify the burr. The algorithm is demonstrated on a metal wheel that has burrs on both sides. Visual servoing of a robotic arm based on this detection is work in progress.

#*Automatic 3D Modeling Using Range Images Obtained from Unknown Viewpoints.
#@Daniel F. Huber
#year2001
#conf3DIM
#citation32
#index3964
#arnetid3966

#*Partial Surface Integration Based on Variational Implicit Functions and Surfaces for 3D Model Building.
#@P. Claes,Dirk Vandermeulen,Luc J. Van Gool,Paul Suetens
#year2005
#conf3DIM
#citation3
#index3965
#arnetid3967
#!Most three-dimensional acquisition systems generate several partial reconstructions that have to be registered and integrated for building a complete 3D model. In this paper, we propose a volumetric shape integration method, consisting of weighted signed distance functions represented as variational implicit functions (VIF) or surfaces (VIS). Texture integration is solved similarly by using three weighted color functions also based on VIFs. Using these continuous (not grid-based) representations solves current limitations of volumetric methods: no memory inefficient and resolution limiting grid representation is required. The built-in smoothing properties of the VIS representations also improve the robustness of the final integration against noise in the input data. Experimental results are performed on real-live, noiseless and noisy synthetic data of human faces in order to show the robustness and accuracy of the integration algorithm.

#*Geometric Matching of 3-D Objects: Assessing the Range of Successful Initial Configurations.
#@Heinz Hügli,Christian Schütz
#year1997
#conf3DIM
#citation-1
#index3966
#arnetid3968

#*Robust and Accurate Partial Surface Registration Based on Variational Implicit Surfaces for Automatic 3D Model Building.
#@P. Claes,Dirk Vandermeulen,Luc J. Van Gool,Paul Suetens
#year2005
#conf3DIM
#citation3
#index3967
#arnetid3969
#!Three-dimensional models are often assembled from several partial reconstructions from unknown viewpoints. In order to provide a fully automatic, robust and accurate method for aligning and integrating partial reconstructions without any prior knowledge of the relative viewpoints of the sensor or the geometry of the imaging process, we propose a 4-step registration and integration algorithm based on a common Variational Implicit Surface (VIS) representation of the partial surface reconstructions. First, a global crude registration without a priori knowledge is performed followed by a pose refinement of partial reconstruction pairs. Pair-wise registrations are converted into a multi-view registration, before a final integration of the reconstructions into one entity or model occurs. Furthermore, making use of the smoothing properties of the VIS representations, the algorithm proves to be robust against noise in the reconstruction data. Experimental results on real-live, as well as noiseless and noisy simulated data are presented to show the feasibility, the accuracy and robustness of our registration scheme.

#*Stereo by Multiperspective Imaging under 6 DOF Camera Motion.
#@Naoyuki Ichimura
#year2005
#conf3DIM
#citation0
#index3968
#arnetid3970
#!Multiperspective imaging has been used to recover the structure of a scene. Although several algorithms for structure recovery have been developed as typified by stereo panoramas, there exists no common framework which subsumes various camera motions to capture stereo images. This paper presents a framework for stereo by multiperspective imaging, which is general in that it can handle 6 degree-of-freedom (DOF) camera motion. We derive geometric constraints, equation for structure recovery and that for an epipolar curve by modeling the acquisition of stereo images using push-broom cameras (line sensors). We consider a class of camera motion called a vertical view plane class and demonstrate that several previous results are really special cases of our results. Numerical examples are given to show the correctness of the derived equations.

#*Planar Patch Extraction with Noisy Depth Data.
#@Dana Cobzas,Hong Zhang
#year2001
#conf3DIM
#citation14
#index3969
#arnetid3971

#*A Hierarchical Method for Aligning Warped Meshes.
#@Leslie Ikemoto,Natasha Gelfand,Marc Levoy
#year2003
#conf3DIM
#citation28
#index3970
#arnetid3972

#*Joined Segmentation of Cortical Surface and Brain Volume in MRI Using a Homotopic Deformable Cellular Model.
#@Yann Cointepas,Isabelle Bloch,Line Garnero
#year1999
#conf3DIM
#citation2
#index3971
#arnetid3973

#*Modeling from Reality.
#@Katsushi Ikeuchi
#year2001
#conf3DIM
#citation56
#index3972
#arnetid3974

#*Spatio-Temporal Fusion of Multiple View Video Rate 3D Surfaces.
#@Gordon Collins,Adrian Hilton
#year2005
#conf3DIM
#citation0
#index3973
#arnetid3975
#!We consider the problem of geometric integration and representation of multiple views of non-rigidly deforming 3D surface geometry captured at video rate. Instead of treating each frame as a separate mesh we present a representation which takes into consideration temporal and spatial coherence in the data where possible. We first segment gross base transformations using correspondence based on a closest point metric and represent these motions as piecewise rigid transformations. The remaining residual is encoded as displacement maps at each frame giving a displacement video. At both these stages occlusions and missing data are interpolated to give a representation which is continuous in space and time. We demonstrate the integration of multiple views for four different non-rigidly deforming scenes: hand, face, cloth and a composite scene. The approach achieves the integration of multiple-view data at different times into one representation which can processed and edited.

#*Fast Alignment of 3D Geometrical Models and 2D Color Images Using 2D Distance Maps.
#@Yumi Iwashita,Ryo Kurazume,Tsutomu Hasegawa,Kenji Hara
#year2005
#conf3DIM
#citation8
#index3974
#arnetid3976
#!This paper presents a fast pose estimation algorithm of a 3D free form object in 2D images using 2D distance maps. One of the popular techniques of the pose estimation of 3D object in 2D image is the point-based method such as the ICP algorithm. However, the calculation cost for determining point correspondences is expensive. To overcome this problem, the proposed method utilizes a distance map on the 2D image plane, which is constructed quite rapidly by the Fast Marching Method. For pose estimation of the object, contour lines of the 2D image and the projection of the 3D object are aligned using the distance map iteratively by the robust M-estimator. Some experimental results with simulated models and actual images of the endoscopic operation are successfully carried out.

#*Acquisition of View-Based 3-D Object Models Using Supervised, Unstructured Data.
#@Kevin Coogan,Isaac Green
#year2005
#conf3DIM
#citation0
#index3975
#arnetid3977
#!Existing techniques for view-based 3-D object recognition using computer vision rely on training the system on a particular object before it is introduced into an environment. This training often consists of taking over 100 images at predetermined points around the viewing sphere in an attempt to account for most angles for viewing the object. However, in many circumstances, the environment is well known and we only expect to see a small subset of all possible appearances. In this paper, we will test the idea that under these conditions, it is possible to train an object recognition system on-the-fly using images of an object as it appears in its environment, with supervision from the user. Furthermore, because some views of an object are much more likely than others, the number of training images required can be greatly reduced.

#*Fusing and Guiding Range Measurements with Colour Video Images.
#@Piotr Jasiobedzki
#year1997
#conf3DIM
#citation4
#index3976
#arnetid3978
#!Combining data from different sensors provides richer data for visualisation and helps in automatic detection and recognition of objects. This paper presents two methods relating two dimensional images from colour CCD cameras with three dimensional data from range scanners. The first method is applicable in a static case and provides the geometrically correct solution. The second one offers an approximate solution but can be used in a dynamic environment for guiding selective range measurements and simplifies the calibration process. The error introduced by this approximation has been derived as a function of the distance to the object and geometry of the set-up. Results of combining range information from a laser camera and colour camera are presented.

#*Using PCA to Model Shape for Process Control.
#@R. C. Crida,Andrew J. Stoddart,John Illingworth
#year1997
#conf3DIM
#citation1
#index3977
#arnetid3979
#!Before surface mount components can be placed on a circuit board, it is necessary to print solder paste onto pads. The paste is then melted to make an electrical connection (reflow). A screen printing process is used to print the solder paste onto the board. This is a complicated process with a large number of input parameters. Some of these parameters can be controlled and it is the purpose of this work to investigate control of the process based on measurement of the output shape of the printed paste. The shape is measured using a laser range scanner Principal Component Analysis (PCA) is proposed as a tool for describing solder paste shape with a small number of parameters. This paper discusses the use of PCA for shape analysis in range images as well as explaining how such a description can be incorporated into a process control loop.

#*Fitting of 3D Circles and Ellipses Using a Parameter Decomposition Approach.
#@Xiaoyi Jiang,Da-Chuan Cheng
#year2005
#conf3DIM
#citation7
#index3978
#arnetid3980
#!Many optimization processes encounter a problem inefficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and trust-region method face the problems of dropping into local minima as well. On the other hand, some algorithms such as simulated annealing and genetic algorithm try to find a global minimum but they are mostly time-consuming. Without a good initialization, many optimization methods are unable to guarantee a global minimum result. We address a novel method in 3D circle and ellipse fitting, which alleviates the optimization problem. It can not only increase the probability of getting in global minima but also reduce the computation time. Based on our previous work, we decompose the parameters into two parts: one part of parameters can be solved by an analytic or a direct method and another part has to be solved by an iterative procedure. Via this scheme, the topography of optimization space is simplified and therefore we reduce the number of local minima and the computation time. We experimentally compare our method with the traditional ones and show superior performance.

#*Reducing Movement Artifacts in Whole Body Scanning.
#@Hein A. M. Daanen,Matthew A. Brunsman,Kathleen M. Robinette
#year1997
#conf3DIM
#citation18
#index3979
#arnetid3981
#!Movement artifacts during whole body scanning are a major concern when reproducible results are required. To determine the magnitude of the artifacts, 11 subjects were scanned with and without a positioning device on the head. The sway of the body was determined by a force plate. It was shown that the pointer on the head reduced the magnitude of the forward/backward sway by over 50%. The resulting standard deviation is less than the resolution of the scanner. Movement artifacts within the body, like head rotation, are hard to control. Again, the pointer on the head assists in reducing the artifacts. The ventilation depth during the scan determines the shape of the chest and should be standardized to get reproducible results.

#*Extraction and Tracking of Surfaces in Range Image Sequences.
#@Xiaoyi Jiang,Sacha Hofer,Thomas Stahs,Ingo Ahrns,Horst Bunke
#year1999
#conf3DIM
#citation7
#index3980
#arnetid3982

#*Range Image Registration: A Software Platform and Empirical Evaluation.
#@Gerald Dalley,Patrick J. Flynn
#year2001
#conf3DIM
#citation24
#index3981
#arnetid3983

#*Surface Registration by Matching Oriented Points.
#@Andrew Edie Johnson,Martial Hebert
#year1997
#conf3DIM
#citation145
#index3982
#arnetid3984
#!For registration of 3-D free-form surfaces we have developed a representation which requires no knowledge of the transformation between views. The representation comprises descriptive images associated with oriented points on the surface of an object. Constructed using single point bases, these images are data level shape descriptions that are used for efficient matching of oriented points. Correlation of images is used to establish point correspondences between two views; from these correspondences a rigid transformation that aligns the views is calculated. The transformation is then refined and verified using a modified iterative closest point algorithm. To demonstrate the generality of our approach, we present results from multiple sensing domains.

#*A Laser Range Scanner Designed for Minimum Calibration Complexity.
#@James Davis,Xing Chen
#year2001
#conf3DIM
#citation47
#index3983
#arnetid3985

#*A System for Semi-Automatic Modeling of Complex Environments.
#@Andrew Edie Johnson,Regis Hoffman,Jim Osborn,Martial Hebert
#year1997
#conf3DIM
#citation32
#index3984
#arnetid3986
#!We present a perception system, called Artisan, that semi-automatically builds 3-D models of a robot's workspace. Range images are acquired with a scanning laser rangefinder and then processed, based an a systematic sensor characterization, to remove noise and artifacts. Complex 3-D objects represented as surface meshes are subsequently recognized in the range images and inserted into a virtual workspace. This graphical virtual workspace is then used to by human operators to plan and execute remote robotic operations.

#*Image-Based Techniques for Digitizing Environments and Artifacts.
#@Paul E. Debevec
#year2003
#conf3DIM
#citation8
#index3985
#arnetid3987

#*Registration and Integration of Textured 3-D Data.
#@Andrew Edie Johnson,Sing Bing Kang
#year1997
#conf3DIM
#citation199
#index3986
#arnetid3988
#!In general, multiple views are required to create a complete 3-D model of an object or of a multi-roomed indoor scene. In this work, we address the problem of merging multiple textured 3-D data sets, each of which corresponds to a different view of a scene or object. There are two steps to the merging process: registration and integration. To register, or align, data sets we use a modified version of the Iterative Closest Point algorithm; our version, which we call color ICP, considers not only 3-D information, but color as well. We show that the use of color decreases registration error by an order of magnitude. Once the 3-D data sets have been registered we integrate them to produce a seamless, composite 3-D textured model. Our approach to integration uses a 3-D occupancy grid to represent likelihood of spatial occupancy through voting. In addition to occupancy information, we store surface normal in each voxel of the occupancy grid. Surface normal is used to robustly extract a surface from the occupancy grid; on that surface we blend textures from multiple views.

#*Building Symbolic Information for 3D Human Body Modeling from Range Data.
#@Laura Dekker,Ioannis Douros,Bernard F. Buxton,Philip C. Treleaven
#year1999
#conf3DIM
#citation57
#index3987
#arnetid3989

#*Automatic 3 -- D Digitization using a Laser Rangefinder with a Small Field of View.
#@Dimitri Papadopoulos-Orfanos,Francis Schmitt
#year1997
#conf3DIM
#citation35
#index3988
#arnetid3990
#!We address the problem of the automation of surface digitization using a precision 3-D laser rangefinder. Because of their small field of view, such sensors navigate closely to the digitized object and are subject to collisions. Unlike previous techniques that addressed only the exhaustiveness of digitization, this work focuses on collision avoidance. To safely identify empty space, shadow and occlusion phenomena are carefully analyzed, and so is the effect of sampling. Then, the planning problem is solved using a hierarchical approach. At low level, we digitize a single view and address collision avoidance using path planning techniques. At high level, the problem becomes the choice of the next best view. Some implementation details and experimental results are presented.

#*Three-Dimensional Modelling and Rendering of the Human Skeletal Trunk from 2D Radiographic Images.
#@S. Delorme,Y. Petit,Carl-Eric Aubin,Jean Dansereau,Hubert Labelle,C. Landry,Jacques A. de Guise
#year1999
#conf3DIM
#citation9
#index3989
#arnetid3991

#*Compact 3D Profilometer with Grazing Incidence Diffraction Optics.
#@Tom Ditto
#year2001
#conf3DIM
#citation0
#index3990
#arnetid3992

#*Fast Multiple-Baseline Stereo with Occlusion.
#@Marc-Antoine Drouin,Martin Trudeau,Sébastien Roy
#year2005
#conf3DIM
#citation5
#index3991
#arnetid3993
#!This paper presents a new and fast algorithm for multi-baseline stereo designed to handle the occlusion problem. The algorithm is a hybrid between fast heuristic occlusion overcoming algorithms that precompute an approximate visibility and slower methods that use correct visibility handling. Our approach is based on iterative dynamic programming and computes simultaneously disparity and camera visibility. Interestingly, dynamic programming makes it possible to compute exactly part of the visibility information. The remainder is obtained through heuristics. The validity of our scheme is established using real imagery with ground truth and compares favorably with otherstate-of-the-art multi-baseline stereo algorithms.

#*Building 3-D City Models from Multiple Unregistered Profile Maps.
#@Olli Jokinen
#year1997
#conf3DIM
#citation1
#index3992
#arnetid3994
#!The paper presents an approach for building 3-D city models for virtual environments from multiple 3-D data sets acquired from different viewpoints by light striping. The raw data sets are represented as single valued parametric surfaces called the 3-D profile maps. The profile maps are registered to the same coordinate system by an iterative surface matching algorithm developed previously. The registration proceeds hierarchically from low to high resolution and all the data sets are matched simultaneously but an initial registration is assumed to be known. After having segmented each map by a region growing algorithm, the maps are integrated into a piecewise planar surface model by merging compatible segments in the overlapping areas. The borders of the segments are also traced an the parametric domains of the maps as a step for building a wireframe model. Test results are shown in the case of a scale model of an urban area digitized in laboratory conditions.

#*An Improved Calibration Technique for Coupled Single-Row Telemeter and CCD Camera.
#@Romain Dupont,Renaud Keriven,Philippe Fuchs
#year2005
#conf3DIM
#citation3
#index3993
#arnetid3995
#!Toward a successful 3D and textural reconstruction of urban scenes, the use of both single-row based telemetric and photographic data in a same framework has proved to be a powerful technique. A necessary condition to obtain good results is to accurately calibrate the telemetric and photographic sensors together. We present a study of this calibration process and propose an improved extrinsic calibration technique. It is based on an existing technique which consists in scanning a planar pattern in several poses, giving a set of relative position and orientation constraints. The innovation is the use of a more appropriate laser beam distance between telemetric points and the planar target. Moreover, we use robust methods to manage outliers at several steps of the algorithm. Improved results on both theoretical and experimental data are given.

#*Self-Calibration of a Light Striping System by Matching Multiple 3-D Profile Maps.
#@Olli Jokinen
#year1999
#conf3DIM
#citation28
#index3994
#arnetid3996

#*Transform-Based Methods for Indexing and Retrieval of 3D Objects.
#@Helin Dutagaci,Bülent Sankur,Yücel Yemez
#year2005
#conf3DIM
#citation1
#index3995
#arnetid3997
#!We compare two transform-based indexing methods for retrieval of 3D objects. We apply 3D Discrete Fourier Transform (DFT) and 3D Radial Cosine Transform (RCT) to the voxelized data of 3D objects. Rotation invariant features are derived from the coefficients of these transforms. Furthermore we compare two different voxel representations, namely, binary denoting object and background space, and continuous after distance transformation. In the binary voxel representation the voxel values are simply set to 1 on the surface of the object and 0 elsewhere. In the continuous-valued representation the space is filled with a function of distance transform. The rotation invariance properties of the DFT and RCT schemes are analyzed. We have conducted retrieval experiments on the Princeton Shape Benchmark and investigated the retrieval performance of the methods using several quality measures.

#*A Multi-Resolution ICP with Heuristic Closest Point Search for Fast and Robust 3D Registration of Range Images.
#@Timothée Jost,Heinz Hügli
#year2003
#conf3DIM
#citation48
#index3996
#arnetid3998

#*Effective 3D Modeling Of Heritage Sites.
#@Sabry F. El-Hakim,J.-Angelo Beraldin,Michel Picard,Antonio Vettore
#year2003
#conf3DIM
#citation20
#index3997
#arnetid3999

#*Identifying the Interface between Two Sand Materials.
#@Anders Kaestner,Peter Lehmann,Hannes Fluehler
#year2005
#conf3DIM
#citation2
#index3998
#arnetid4000
#!To study the behavior of water flow at interfaces between different soil materials we made computed tomography scans of sand samples using synchrotron light. The samples were prepared with an interface between two sand materials. The contact points between grains at the interface between the sands were identified using a combination of watershed segmentation and a classifier that used the grain-size and -location. The process from a bilevel image to a classified image is described. In the classified image five classes are represented; two for the grains and three for the contact points to represent intra- and inter-class contact points.

#*Silhouette and Stereo Fusion for 3D Object Modeling.
#@Carlos Hernández Esteban,Francis Schmitt
#year2003
#conf3DIM
#citation140
#index3999
#arnetid4001
#%593616
#%593649
#%593540
#%834118
#%593225
#%908384
#%593671
#%593210
#%1033073
#%1032153
#%168792
#%4049
#%4040
#%1033216
#%834362
#%593626
#%593929
#%293209
#%293683
#!In this paper, we present a new approach to high quality 3D object reconstruction. Starting from a calibrated sequence of color images, the algorithm is able to reconstruct both the 3D geometry and the texture. The core of the method is based on a deformable model, which defines the framework where texture and silhouette information can be fused. This is achieved by defining two external forces based on the images: a texture driven force and a silhouette driven force. The texture force is computed in two steps: a multi-stereo correlation voting approach and a gradient vector flow diffusion. Due to the high resolution of the voting approach, a multi-grid version of the gradient vector flow has been developed. Concerning the silhouette force, a new formulation of the silhouette constraint is derived. It provides a robust way to integrate the silhouettes in the evolution algorithm. As a consequence, we are able to recover the contour generators of the model at the end of the iteration process. Finally, a texture map is computed from the original images for the reconstructed 3D model.

#*Extracting Surface Patches from Complete Range Descriptions.
#@Robert B. Fisher,Andrew W. Fitzgibbon,David W. Eggert
#year1997
#conf3DIM
#citation27
#index4000
#arnetid4002
#!Constructing a full CAD model of a part requires feature descriptions from all sides; in this case we consider surface patches as the geometric primitives. Most previous research in surface patch extraction has concentrated on extracting patches from a single view. This leads to several problems with aligning and combining partial patch fragments in order to produce complete part models. We have avoided these problems by adapting our single view, range data segmentation program to extract patches, and thus models, directly from fully merged range datasets.

#*Foreword.
#@
#year2005
#conf3DIM
#citation0
#index4001
#arnetid4003

#*Scanning and Processing 3D Objects for Web Display.
#@Mohamed Farouk,Ibrahim El-Rifai,Shady El-Tayar,Hisham El-Shishiny,Mohamed Hosny,Mohamed El-Rayes,José Gomes,Frank Giordano,Holly E. Rushmeier,Fausto Bernardini,Karen A. Magerlein
#year2003
#conf3DIM
#citation12
#index4002
#arnetid4004

#*Coordination of Appearance and Motion Data for Virtual View Generation of Traditional Dances.
#@Yuji Kamon,Ryo Yamane,Yasuhiro Mukaigawa,Takeshi Shakunaga
#year2005
#conf3DIM
#citation0
#index4003
#arnetid4005
#!A novel method is proposed for virtual view generation of traditional dances. In the proposed framework, a traditional dance is captured separately for appearance registration and motion registration. By coordinating the appearance and motion data, we can easily control virtual camera motion within a dancer-centered coordinate system. For this purpose, a coordination problem should be solved between the appearance and motion data, since they are captured separately and the dancer moves freely in the room. The present paper shows a practical algorithm to solve it. A set of algorithms are also provided for appearance and motion registration, and virtual view generation from archived data. In the appearance registration, a 3D human shape is recovered in each time from a set of input images after suppressing their backgrounds. By combining the recovered 3D shape and a set of images for each time, we can compose archived dance data. In the motion registration, stereoscopic tracking is accomplished for color markers placed on the dancer. A virtual view generation is formalized as a color blending among multiple views, and a novel and efficient algorithm is proposed for the composition of a natural virtual view from a set of images. In the proposed method, weightings of the linear combination are calculated from both an assumed viewpoint and a surface normal.

#*Exploiting Mirrors for Laser Stripe 3D Scanning.
#@Andrea Fasano,Marco Callieri,Paolo Cignoni,Roberto Scopigno
#year2003
#conf3DIM
#citation3
#index4004
#arnetid4006

#*Virtual Reconstruction of broken and unbroken Pottery.
#@Martin Kampel,Robert Sablatnig
#year2003
#conf3DIM
#citation15
#index4005
#arnetid4007

#*Multisensor Fusion for Volumetric Reconstruction of Large Outdoor Areas.
#@M. Fiocco,G. Boström,João G. M. Gonçalves,Vítor Sequeira
#year2005
#conf3DIM
#citation12
#index4006
#arnetid4008
#!This paper presents techniques for the merging of 3D Data coming from different sensors, such as ground and aerial laser range scans. The 3D Models created are reconstructed to give a photo-realistic scene enabling interactive virtual walkthroughs, measurements and scene change analysis. The reconstructed model is based on a weighted integration of all available data based on sensor-specific parameters such as noise level, accuracy, inclination and reflectivity of the target, spatial distribution of points. The geometry is robustly reconstructed with a volumetric approach. Once registered and weighed, all data is re-sampled in a multi-resolution distance field usingout-of-core techniques. The final mesh is extracted by contouring the iso-surface with a feature preserving dual contouring algorithm. The paper shows results of the above technique applied to Verona (Italy) city centre.

#*Further Improving Geometric Fitting.
#@Ken-ichi Kanatani
#year2005
#conf3DIM
#citation7
#index4007
#arnetid4009
#!We give a formal definition of geometric fitting in a way that suits computer vision applications. We point out that the performance of geometric fitting should be evaluated in the limit of small noise rather than in the limit of a large number of data as recommended in the statistical literature. Taking the KCR lower bound as an optimality requirement and focusing on the linearized constraint case, we compare the accuracy of Kanataniýs renormalization with maximum likelihood (ML) approaches including the FNS of Chojnacki et al. and the HEIV of Leedan and Meer. Our analysis reveals the existence of a method superior to all these.

#*Solving architectural modelling problems using knowledge.
#@Robert B. Fisher
#year2003
#conf3DIM
#citation5
#index4008
#arnetid4010

#*Processing Range Data for Reverse Engineering and Virtual Reality.
#@Stefan Karbacher,X. Laboureux,Nikolaus Schön,Gerd Häusler
#year2001
#conf3DIM
#citation11
#index4009
#arnetid4011

#*A Low-Cost Range Finder Using a Visually Located, Structured Light Source.
#@Robert B. Fisher,Anthony Ashbrook,Craig Robertson,Naoufel Werghi
#year1999
#conf3DIM
#citation24
#index4010
#arnetid4012

#*Refining Triangle Meshes by Non-linear Subdivision.
#@Stefan Karbacher,Stephan Seeger,Gerd Häusler
#year2001
#conf3DIM
#citation8
#index4011
#arnetid4013

#*Real-time Range Scanning of Deformable Surfaces by Adaptively Coded Structured Light.
#@Thomas P. Koninckx,Andreas Griesser,Luc J. Van Gool
#year2003
#conf3DIM
#citation46
#index4012
#arnetid4014

#*Deformable Model with Adaptive Mesh and Automated Topology Changes.
#@Jacques-Olivier Lachaud,Benjamin Taton
#year2003
#conf3DIM
#citation15
#index4013
#arnetid4015

#*Scale Selection for Classification of Point-Sampled 3-D Surfaces.
#@Jean-François Lalonde,Ranjith Unnikrishnan,Nicolas Vandapel,Martial Hebert
#year2005
#conf3DIM
#citation17
#index4014
#arnetid4016
#!Three-dimensional ladar data are commonly used to perform scene understanding for outdoor mobile robots, specifically in natural terrain. One effective method is to classify points using features based on local point cloud distribution into surfaces, linear structures or clutter volumes. But the local features are computed using 3-D points within a support-volume. Local and global point density variations and the presence of multiple manifolds make the problem of selecting the size of this support volume, or scale, challenging. In this paper we adopt an approach inspired by recent developments in computational geometry [5] and investigate the problem of automatic data-driven scale selection to improve point cloud classification. The approach is validated with results using data from different sensors in various environments classified into different terrain types (vegetation, solid surface and linear structure)¹.

#*An Automation System for Industrial 3-D Laser Digitizing.
#@D. G. Lamb,D. L. Baird,Michael A. Greenspan
#year1999
#conf3DIM
#citation23
#index4015
#arnetid4017

#*Estimation of Elastic Constants from 3D Range-Flow.
#@Jochen Lang,Dinesh K. Pai
#year2001
#conf3DIM
#citation7
#index4016
#arnetid4018

#*Bayesian Estimation of Distance and Surface Normal with a Time-of-Flight Laser Rangefinder.
#@Jochen Lang,Dinesh K. Pai
#year1999
#conf3DIM
#citation4
#index4017
#arnetid4019

#*Advances in the Cooperation of Shape from Shading and Stereo Vision.
#@Holger Lange
#year1999
#conf3DIM
#citation13
#index4018
#arnetid4020

#*The Parallel Iterative Closest Point Algorithm.
#@Christian Langis,Michael A. Greenspan,Guy Godin
#year2001
#conf3DIM
#citation32
#index4019
#arnetid4021

#*Building 3D Facial Models and Detecting Face Pose in 3D Space.
#@Shihong Lao,Masato Kawade,Yasushi Sumi,Fumiaki Tomita
#year1999
#conf3DIM
#citation7
#index4020
#arnetid4022

#*The Mapping of Texture on VR Polygonal Models.
#@Denis Laurendeau,Nathalie Bertrand,Régis Houde
#year1999
#conf3DIM
#citation3
#index4021
#arnetid4023

#*Road Surface Inspection using Laser Scanners Adapted for the High Precision Measurements of Large Flat Surfaces.
#@John Laurent,Mario Talbot,Michel Douce
#year1997
#conf3DIM
#citation-1
#index4022
#arnetid4024

#*Toward a Near Optimal Quad/Triangle Subdivision Surface Fitting.
#@Guillaume Lavoué,Florent Dupont,Atilla Baskurt
#year2005
#conf3DIM
#citation-1
#index4023
#arnetid4025
#!In this paper we present a new framework for subdivision surface fitting of arbitrary surfaces (not closed objects) represented by polygonal meshes. Our approach is particularly suited for output surfaces from a mechanical or CAD object segmentation for a piecewise subdivision surface approximation. Our algorithm produces a mixed quadrangle-triangle control mesh, near optimal in terms of face and vertex numbers while remaining independent of the connectivity of the input mesh. The first step approximates the boundaries with subdivision curves and creates an initial subdivision surface by optimally linking the boundary control points with respect to the lines of curvature of the target surface. Then, a second step optimizes the initial control polyhedron by iteratively moving control points and enriching regions according to the error distribution. Experiments conducted on several surfaces and on a whole segmented mechanical object, have proven the coherency and theefficiency of our algorithm, compared with existing methods.

#*An Efficient Scattered Data Approximation Using Multilevel B-Splines Based on Quasi-Interpolants.
#@Byung-Gook Lee,Joon-Jae Lee,Jaechil Yoo
#year2005
#conf3DIM
#citation2
#index4024
#arnetid4026
#!In this paper, we propose an efficient approximation algorithm using multilevel B-splines based on quasi-interpolants. Multilevel technique uses a coarse to fine hierarchy to generate a sequence of bicubic B-spline functions whose sum approaches the desired interpolation function. To compute a set of control points, quasi-interpolants gives a procedure for deriving local spline approximation methods where a B-spline coefficient only depends on data points taken from the neighborhood of the support corresponding the B-spline. Experimental results show that the smooth surface reconstruction with high accuracy can be obtained from a selected set of scattered or dense irregular samples.

#*The Digital Michelangelo Project.
#@Marc Levoy
#year1999
#conf3DIM
#citation1155
#index4025
#arnetid4027

#*Evaluating Collinearity Constraint for Automatic Range Image Registration.
#@Yonghuai Liu,Longzhuang Li,Baogang Wei
#year2005
#conf3DIM
#citation1
#index4026
#arnetid4028
#!While most of the existing range image registration algorithms either have to extract and match structural (geometric or optical) features or have to estimate the motion parameters of interest from outliers corrupted point correspondence data for the elimination of false matches in the process of image registration, the registration error and the collinearity error derived directly from the traditional closest point criterion are also capable of doing the same job. However, the latter has an advantage of easy implementation. The purpose of this paper is to investigate which definition of collinearity is more accurate and stable in eliminating false matches inevitably introduced by the closest point criterion. The experiments based on real images show the advantages and disadvantages of different definitions of collinearity.

#*Multi-Resolution Modeling and Locally Refined Collision Detection for Haptic Interaction.
#@Peiran Liu,Xiaojun Shen,Nicolas D. Georganas,Gerhard Roth
#year2005
#conf3DIM
#citation8
#index4027
#arnetid4029
#!The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel "locally refined" approach is introduced in this paper for fast CD in haptic rendering applications, e.g. haptic surgery and haptic sculpture simulations. Exact interference detections are performed on proposed locally refined meshes, which are in multi-resolution representation. The meshes are generated using mesh simplification and space partition. A new BVH algorithm called "Active Bounding Tree", or AB-Tree, handling collision queries is introduced. At runtime the meshes are dynamically refined to higher resolution in areas that are most likely to collide with other objects. The algorithms are successfully demonstrated in an interactive haptic environment. Compared to existing CD algorithms on single resolution models, noticeable performance improvement has been observed in terms of the precision of collision queries, frame rate, and memory usage.

#*Evaluating Structural Constraints for Accurate Range Image Registration.
#@Yonghuai Liu,Baogang Wei
#year2003
#conf3DIM
#citation4
#index4028
#arnetid4030

#*An Adaptive Dandelion Model for Reconstructing Spherical Terrain-Like Visual Hull Surfaces.
#@Xin Liu,Hongxun Yao,Wen Gao
#year2005
#conf3DIM
#citation3
#index4029
#arnetid4031
#!In this paper we present an adaptive Dandelion Model for reconstructing spherical terrain-like Visual Hull (VH) surfaces. The Dandelion Model represents a solid by a pencil of organized line segments emitted from a common point. The directions and the topology of the line segments are derived from the triangle facets of a geodesic sphere, which are recursively subdivided until the desired precision is achieved. The initial lines are cut by silhouettes in 2D and then lifted back to 3D to determine the ending points of the line segments defining sampling points on the spherical terrain-like VH surface. A mesh model can be easily constructed from the Dandelion Model. Our algorithm has the advantages of controllable precision, adaptive resolution, simplicity and speediness. We validate our algorithm by theories and experiments.

#*A Fast and Accurate 3-D Rangefinder using the Biris Technology: The TRID Sensor.
#@Frédéric Loranger,Denis Laurendeau,Régis Houde
#year1997
#conf3DIM
#citation7
#index4030
#arnetid4032
#!In many industrial applications such as autonomous vehicle guidance and robotic manipulations, reliable 3-D informations must be extracted from the scene in order to provide a robust description of the environment in which the system evolves. This paper presents the TRID sensor, a simple, fast, robust and accurate 3-D sensing device based on the Biris technology. TRID is limited to a lateral resolution of one point. Experimental results show that an accuracy better than 0.15% can be obtained for the depth component (Z) of 3-D points at a distance of 1.3 meter from a wooden black painted beam surface with an acquisition rate of 8.5 points/s.

#*3D Statistical Shape Models for Medical Image Segmentation.
#@Cristian Lorenz,Nils Krahnstoever
#year1999
#conf3DIM
#citation19
#index4031
#arnetid4033

#*Reliable and Rapidly-Converging ICP Algorithm Using Multiresolution Smoothing.
#@Kok-Lim Low,Anselmo Lastra
#year2003
#conf3DIM
#citation7
#index4032
#arnetid4034

#*Frequency Domain Estimation of 3-D Rigid Motion Based on Range and Intensity Data.
#@Luca Lucchese,Gianfranco Doretto,Guido M. Cortelazzo
#year1997
#conf3DIM
#citation15
#index4033
#arnetid4035
#!Video-rate registered range and intensity data are at reach of current sensor technology. This wealth of data can be profitably exploited in order to estimate rigid motion parameters as the approaches to 3-D motion estimation, based on the optical flow of both types of data, indicate. This work introduces an alternative for 3-D motion estimation based on the Fourier transform of the 3-D intensity function implicitly described by the registered time-sequences of range and intensity data. The proposed procedure can lead to an unsupervised method for 3-D rigid motion estimation. This method has several advantages related to the fact that it uses the total available information and not sets of features. With respect to memory occupancy the use of a time-sequence of a 3-D intensity function represents a considerable data reduction with respect to a pair of time-sequences of 2-D functions. The proposed technique, which extends to the 3-D case previous frequency domain estimation algorithms developed for the planar case, retain their robustness.

#*Automatic Modeling of Animatable Virtual Humans - A Survey.
#@Nadia Magnenat-Thalmann,Hyewon Seo,Frederic Cordier
#year2003
#conf3DIM
#citation10
#index4034
#arnetid4036

#*Rangefinder using Time Correlated Single Photon Counting.
#@J. S. Massa,Manickam Umasuthan,Andrew M. Wallace,G. S. Buller,Andrew C. Walker
#year1997
#conf3DIM
#citation-1
#index4035
#arnetid4037
#!This paper describes a method for acquiring range data based on time-correlated single photon counting (TCSPC) and details the data analysis techniques used to compute the range measurements. The prototype sensor being built in our laboratory is capable of measuring up to 100 points per second with an accuracy of about 15 /spl mu/m.

#*Generation of Geometric Model by Registration and Integration of Multiple Range Images.
#@Takeshi Masuda
#year2001
#conf3DIM
#citation20
#index4036
#arnetid4038

#*Surface Curvature Estimation from the Signed Distance Field.
#@Takeshi Masuda
#year2003
#conf3DIM
#citation12
#index4037
#arnetid4039

#*Simultaneous Determination of Registration and Deformation Parameters among 3D Range Images.
#@Tomohito Masuda,Yuichiro Hirota,Katsushi Ikeuchi,Ko Nishino
#year2005
#conf3DIM
#citation18
#index4038
#arnetid4040
#!Conventional registration algorithms are mostly concerned with rigid-body transformation parameters between a pair of 3D range images. Our proposed framework aims to determine, in a unified manner, not only such rigid transformation parameters but also various deformation parameters, assuming that the deformation we handle here is strictly defined by some parameterized formulation derived from the deformation mechanism. While conventional registration algorithms usually calcurate six parameters (three translation and three rotation parameters), our proposed algorithm estimates deformation parameters as well. In this paper, we describe how we formulated such an algorithm, implemented it, and evaluated its performance.

#*A Method of Style Discrimination of Oil Painting Based on 3D Range Data.
#@Naoya Masuda,Kazuhiko Yamamoto,Kunihito Kato,Hideki Tanahashi
#year2001
#conf3DIM
#citation1
#index4039
#arnetid4041

#*A Portable Three-Dimensional Digitizer.
#@Y. Matsumoto,Hajime Terasaki,K. Sugimoto,T. Arakawa
#year1997
#conf3DIM
#citation41
#index4040
#arnetid4042
#!A portable three-dimensional digitizer using a monocular camera is presented in this paper. The digitizer automatically acquires the shape of a target object as well as its texture. The digitizer has the following advantages: 1) compact and inexpensive, 2) skill-free 3D image acquisition, and 3) handles a wide range of objects of various materials. The digitizing algorithm is based on the "Shape-from-Silhouette" framework, where several novel techniques are embedded as follows. In the silhouette extraction, not only pixel-level subtraction between images but also region-level subtraction are embedded so as to achieve precise extraction. The texture acquisition is treated as a labeling problem in an energy minimization framework, which enables us to get realistic textures with a simple operation. Our experiments showed that the digitizing speed of the digitizer was practical.

#*Calibration of a Laser Stripe Profiler.
#@Alan M. McIvor
#year1999
#conf3DIM
#citation32
#index4041
#arnetid4043

#*3-D Motion and Shape from Multiple Image Sequences.
#@Rüdiger Mecke,Bernd Michaelis
#year2003
#conf3DIM
#citation0
#index4042
#arnetid4044

#*Streaming Transmission of Point-Sampled Geometry Based on View-Dependent Level-of-Detail.
#@Fang Meng,Hongbin Zha
#year2003
#conf3DIM
#citation7
#index4043
#arnetid4045

#*Active Balloon Model Based On 3D Skeleton Extraction By Competitive Learning.
#@Ken'ichi Morooka,Hiroyuki Takagi,Hiroshi Nagahashi
#year2003
#conf3DIM
#citation-1
#index4044
#arnetid4046

#*Computations on a Spherical View Space for Efficient Planning of Viewpoints in 3-D Object Modeling.
#@Ken'ichi Morooka,Hongbin Zha,Tsutomu Hasegawa
#year1999
#conf3DIM
#citation11
#index4045
#arnetid4047

#*Reconstruction of Complex Environments by Robust Pre-aligned ICP.
#@Vittorio Murino,Lucca Ronchetti,Umberto Castellani,Andrea Fusiello
#year2001
#conf3DIM
#citation8
#index4046
#arnetid4048

#*Stroboscopic Stereo Rangefinder.
#@Jean-Christophe Nebel,Francisco J. Rodríguez-Miguel,W. Paul Cockshott
#year2001
#conf3DIM
#citation6
#index4047
#arnetid4049

#*Fast and Robust Registration of 3D Surfaces Using Low Curvature Patche.
#@Van-Duc Nguyen,Victor Nzomigni,Charles V. Stewart
#year1999
#conf3DIM
#citation-1
#index4048
#arnetid4050

#*Automatic Reconstruction of 3D Objects using a Mobile Monoscopic Camera.
#@Wolfgang Niem,Jochen Wingbermühle
#year1997
#conf3DIM
#citation116
#index4049
#arnetid4051
#!A method for the automatic reconstruction of 3D objects from multiple camera views for 3D multimedia applications is presented. Conventional 3D reconstruction techniques use equipment that restrict the flexibility of the user. In order to increase this flexibility, the presented method is characterized by a simple measurement environment, that consists of a new calibration pattern placed below the object allowing object and pattern acquisition simultaneously. This ensures, that each view can be calibrated individually. From these obtained calibrated camera views, a textured 3D wireframe model is estimated using a shape-from-silhouette approach and texture mapping of the original camera views. Experiments with this system have confirmed a significant gain of flexibility for the user and a drastic reduction of costs for technical equipment while ensuring comparable model quality as conventional reconstruction techniques at the same time.

#*3D Reconstruction from Two Orthogonal Views Using Simulated Annealing Approach.
#@Jing Ning,Sally I. McClean,Kieran Cranley
#year2001
#conf3DIM
#citation3
#index4050
#arnetid4052

#*Automatic Model Refinement for 3D Reconstruction with Mobile Robots.
#@Andreas Nüchter,Hartmut Surmann,Joachim Hertzberg
#year2003
#conf3DIM
#citation27
#index4051
#arnetid4053

#*Locating Landmarks on Human Body Scan Data.
#@Joseph H. Nurre
#year1997
#conf3DIM
#citation38
#index4052
#arnetid4054
#!Software for locating anthropometric landmarks from a cloud of more than 100000 three dimensional data points, captured from a human subject, is presented. The software is part of an incremental approach that progressively refines the identification of data points. The first phase of identification is to orient and segment the human body data points. Algorithms for these tasks are presented, with a description of their use. One of the algorithms, a discrete point cusp detector is believed to be unique. The software has been tested on twenty different body scan data sets and shown to be robust.

#*Fast Simultaneous Alignment of Multiple Range Images Using Index Images.
#@Takeshi Oishi,Atsushi Nakazawa,Ryo Kurazume,Katsushi Ikeuchi
#year2005
#conf3DIM
#citation29
#index4053
#arnetid4055
#!This paper describes a fast and easy-to-use simultaneous alignment method of multiple range images. The most time consuming part of alignment process is searching corresponding points. Although "Inverse calibration" method quickly searches corresponding points in complexity O(n), where n is the number of vertices, the method requires some look-up tables or precise sensorýs parameters. Then, we propose an easy-to-use method that uses "Index Image": "Index image" can be rapidly created using graphics hardware without precise sensorýs parameters. For fast computation of rigid transformation matrices of a large number of range images, we utilized linearized error function and applied incomplete Cholesky conjugate gradient (ICCG) method for solving linear equations. Some experimental results that aligned a large number of range images measured with laser range sensors show the effectiveness of our method.

#*Parallel Alignment of a Large Number of Range Images.
#@Takeshi Oishi,Ryusuke Sagawa,Atsushi Nakazawa,Ryo Kurazume,Katsushi Ikeuchi
#year2003
#conf3DIM
#citation26
#index4054
#arnetid4056

#*Contour Point Tracking by Enforcement of Rigidity Constraints.
#@Ricardo Oliveira,João Costeira,João Xavier
#year2005
#conf3DIM
#citation1
#index4055
#arnetid4057
#!The aperture problem is one of the omnipresent issues in computer vision. Its local character constrains point matching to high textured areas, so that points ingradient- oriented regions (such as straight lines) can not be reliably matched. We propose a new method to overcome this problem by devising a global matching strategy under the factorization framework. We solve the n-frame correspondence problem under this context by assuming the rigidity of the scene. To this end, a geometric contraint is used that selects the matching solution resulting in a rank-4 observation matrix. The rank of the observation matrix is a function of the matching solutions associated to each image and as such a simulteaneous solution for all frames has to be found. An optimization procedure is used in this text in order to find the solution.

#*Dense Disparity Estimation Using Gabor Filters and Image Derivatives.
#@Mohammed Ouali,Claude Laurgeau,Djemel Ziou
#year1999
#conf3DIM
#citation-1
#index4056
#arnetid4058

#*Incremental Catmull-Clark Subdivision.
#@Hamid-Reza Pakdel,Faramarz F. Samavati
#year2005
#conf3DIM
#citation3
#index4057
#arnetid4059
#!In this paper, a new adaptive method for Catmull-Clark subdivision is introduced. Adaptive subdivision refines specific areas of a model according to user or application needs. Naive adaptive subdivision algorithm change the connectivity of the mesh, causing geometrical inconsistencies that alter the limit surface. Our method expands the specified region of the mesh such that when it is adaptively subdivided, it produces a smooth surface whose selected area is identical to when the entire mesh is refined. This technique also produces a surface with an increasing level of detail from coarse to fine areas of the surface. We compare our adaptive subdivision with other schemes and present some example applications.

#*A Contour-Based Approach to 3D Text Labeling on Triangulated Surfaces.
#@Gregory G. Slabaugh,Viorel Mihalef,Gozde B. Unal
#year2005
#conf3DIM
#citation3
#index4058
#arnetid4060
#!This paper presents a simple and efficient method of forming a 3D text label on a 3D triangulated surface. The label is formed by projecting the 2D contours that define the text silhouette onto the triangulated surface, forming 3D contour paths. Surface polygons upon which the 3D contour paths lie are retriangulated using a novel approach that forms a polyline defining the region outside the contour. This algorithm produces labeled 3D surfaces that conform to the specifications of the STL format, making them suitable for fabrication by a rapid prototyping machine. We demonstrate the effectiveness of the algorithm in forming flat and extruded labels on non-trivial surfaces.

#*Nefertiti: A Query by Content Software for Three-Dimensional Models Databases Management.
#@Eric Paquet,Marc Rioux
#year1997
#conf3DIM
#citation53
#index4059
#arnetid4061
#!This paper presents a new approach for the classification and retrieval of three-dimensional images and models from databases. A set of retrieval algorithms is introduced. These algorithms are content-based, meaning that the input is not made out of keywords but of three-dimensional models. Tensor of inertia, distribution of normals, distribution of cords and multiresolution analysis are used to describe each model. The database can be searched by scale, shape or color or any combination of these parameters. A user friendly interface makes the retrieval operation simple and intuitive and allows to edit reference models according to the specifications of the user. Experimental results using a database of more than 400 range images and 1000 VRML models are presented.

#*Automatic Feature Correspondence for Scene Reconstruction from Multiple Views.
#@Philip W. Smith,Mark D. Elstrom
#year1999
#conf3DIM
#citation1
#index4060
#arnetid4062

#*Dual-Beam Structured-Light Scanning for 3-D Object Modeling.
#@Johnny Park,Guilherme N. DeSouza,Avinash C. Kak
#year2001
#conf3DIM
#citation23
#index4061
#arnetid4063

#*Estimating Pose Through Local Geometry.
#@Gilbert Soucy,Franco Callari,Frank P. Ferrie
#year1999
#conf3DIM
#citation0
#index4062
#arnetid4064

#*Constructing NURBS Surface Model from Scattered and Unorganized Range Data.
#@In Kyu Park,Sang Uk Lee,Il Dong Yun
#year1999
#conf3DIM
#citation25
#index4063
#arnetid4065

#*A Point-and-Shoot Color 3D Camera.
#@Askold V. Strat,Manuel M. Oliveira
#year2003
#conf3DIM
#citation11
#index4064
#arnetid4066

#*A Range Image Refinement Technique for Multi-view 3D Model Reconstruction.
#@Soon-Yong Park,Murali Subbarao
#year2003
#conf3DIM
#citation3
#index4065
#arnetid4067

#*Reconstruction of Surfaces behind Occlusions in Range Images.
#@Freek Stulp,Fabio Dell'Acqua,Robert B. Fisher
#year2001
#conf3DIM
#citation22
#index4066
#arnetid4068

#*A Fast Point-to-Tangent Plane Technique for Multi-view Registration.
#@Soon-Yong Park,Murali Subbarao
#year2003
#conf3DIM
#citation18
#index4067
#arnetid4069

#*Bayesian Modelling of Camera Calibration and Reconstruction.
#@Rashmi Sundareswara,Paul R. Schrater
#year2005
#conf3DIM
#citation3
#index4068
#arnetid4070
#!Camera calibration methods, whether implicit or explicit, are a critical part of most 3D vision systems. These methods involve estimation of a model for the camera that produced the visual input, and subsequently to infer the 3D structure that gave rise to the input. However, in these systems the error in calibration is typically unknown, or if known, the effect of calibration error on subsequent processing (e.g. 3d reconstruction) is not accounted for. In this paper, we propose a Bayesian camera calibration method that explicitly computes calibration error, and we show how knowledge of this error can be used to improve the accuracy of subsequent processing. What distinguishes the work is the explicit computation of a posterior distribution on unknown camera parameters, rather than just a best estimate. Marginalizing (averaging) subsequent estimates by this posterior is shown to reduce reconstruction error over calibration approaches that rely on a single best estimate. The method is made practical using sampling techniques, that require only the evaluation of the calibration error function and the specification of priors. Samples with their corresponding probability weights can be used to produce better estimates of the camera parameters. Moreover, these samples can be directly used to improve estimates that rely on calibration information, like 3D reconstruction. We evaluate our method using simulated data for a structure from motion problem, in which the same point matches are used to calibrate the camera, estimate the motion, and reconstruct the 3D geometry. Our results show improved reconstruction over non-linear Camera calibration methods like the Maximum Likelihood estimate. Additionally, this approach scales much better in the face of increasingly noisy point matches.

#*Affine Transformations of 3D Objects Represented with Neural Networks.
#@Emmanouil Piperakis,Itsuo Kumazawa
#year2001
#conf3DIM
#citation4
#index4069
#arnetid4071

#*Acquisition of Three-Dimensional Information in a Real Environment by Using the Stereo Omni-directional System (SOS).
#@Hideki Tanahashi,Daisuke Shimada,Kazuhiko Yamamoto,Yoshinori Niwa
#year2001
#conf3DIM
#citation14
#index4070
#arnetid4072

#*A Registration Aid.
#@Richard Pito
#year1997
#conf3DIM
#citation13
#index4071
#arnetid4073
#!Although the iterative closest point algorithm is very effective in registering range data, the quality of registration depends on the geometry of the sampled surfaces. This work presents a registration aid which can greatly reduce the possibility of catastrophic registration failure, increase the quality of registration and register range data which does not overlap. By placing the aid into the scene along with the object(s) of interest, range images taken from any vantage point within the range scanner's workspace can be registered onto a model of the aid and thus into a common reference frame. By considering the causes of registration failure, the surface of the aid is designed so that any range image taken of it from any point in the scanner's workspace will properly register with a model of the aid. The reliability of the aid is demonstrated with a Monte Carlo experiment and its utility is demonstrated with examples from an automated surface acquisition system.

#*Free-Form Surface Reconstruction from Multiple Images .
#@Chang Shu,Gerhard Roth
#year2003
#conf3DIM
#citation5
#index4072
#arnetid4074

#*Hand-Held Acquisition of 3D Models with a Video Camera.
#@Marc Pollefeys,Reinhard Koch,Maarten Vergauwen,Luc J. Van Gool
#year1999
#conf3DIM
#citation50
#index4073
#arnetid4075

#*A MRF Formulation for Coded Structured Light.
#@Jean-Philippe Tardif,Sébastien Roy
#year2005
#conf3DIM
#citation11
#index4074
#arnetid4076
#!Multimedia projectors and cameras make possible the use of structured light to solve problems such as 3D reconstruction, disparity map computation and camera or projector calibration. Each projector displays patterns over a scene viewed by a camera, thereby allowing automatic computation of camera-projector pixel correspondences. This paper introduces a new algorithm to establish this correspondence in difficult cases of image acquisition. A probabilistic model formulated as a Markov Random Field uses the stripe images to find the most likely correspondences in the presence of noise. Our model is specially tailored to handle the unfavorable projector-camera pixel ratios that occur in multiple-projector single-camera setups. For the case where more than one camera is used, we propose a robust approach to establish correspondences between the cameras and compute an accurate disparity map. To conduct experiments, a ground truth was first reconstructed from a high quality acquisition. Various degradations were applied to the pattern images which were then solved using our method. The results were compared to the ground truth for error analysis and showed very good performances, even near depth discontinuities.

#*The ModelCamera: a Hand-Held Device for Interactive Modeling.
#@Voicu Popescu,Elisha Sacks,Gleb Bahmutov
#year2003
#conf3DIM
#citation24
#index4075
#arnetid4077

#*Multi-projectors for arbitrary surfaces without explicit calibration nor reconstructio.
#@Jean-Philippe Tardif,Sébastien Roy,Martin Trudeau
#year2003
#conf3DIM
#citation21
#index4076
#arnetid4078

#*Virtual Environments for Critical Intervention Support: Modeling, Design and Implementation Issues.
#@Denis Poussart,François Bernier,Martin Simoneau
#year1999
#conf3DIM
#citation0
#index4077
#arnetid4079

#*Cramer-Rao Bounds for Nonparametric Surface Reconstruction from Range Data.
#@Tolga Tasdizen,Ross T. Whitaker
#year2003
#conf3DIM
#citation6
#index4078
#arnetid4080

#*Tolerance Control with High Resolution 3D Measurement.
#@Flavio Prieto,Tanneguy Redarce,Pierre Boulanger,Richard Lepage
#year2001
#conf3DIM
#citation-1
#index4079
#arnetid4081

#*Anisotropic diffusion of surface normals for feature preserving surface reconstruction.
#@Tolga Tasdizen,Ross T. Whitaker
#year2003
#conf3DIM
#citation7
#index4080
#arnetid4082

#*CAD-Based Range Sensor Placement for Optimum 3D Data Acquisitio.
#@Flavio Prieto,Tanneguy Redarce,Pierre Boulanger,Richard Lepage
#year1999
#conf3DIM
#citation-1
#index4081
#arnetid4083

#*A Flexible 3D Modeling System Based on Combining Shape-from-Silhouette with Light-Sectioning Algorithm.
#@Tomoya Terauchi,Yasuhiro Oue,Kouta Fujimura
#year2005
#conf3DIM
#citation4
#index4082
#arnetid4084
#!In this paper we present a flexible modeling system for obtaining the texture-mapped 3D geometric model. The modeling system uses an algorithm combining shape-from-silhouette with light-sectioning. In the algorithm, at first, a rough shape model is obtained by shape-from-silhouette method almost automatically. Next, concavities and complex parts on the object surface are obtained by light-sectioning method with manual scanning. For applying light-sectioning method to volume data, we propose volumetric light-sectioning algorithm. Then our modeling system can realize easy and accurate generation of 3D geometric model.

#*Multiview Registration for Large Data Sets.
#@Kari Pulli
#year1999
#conf3DIM
#citation339
#index4083
#arnetid4085

#*Physics-Based Models for Image Analysis/Synthesis and Geometric Design.
#@Demetri Terzopoulos
#year1997
#conf3DIM
#citation3
#index4084
#arnetid4086
#!This paper reviews recently developed physics-based surface modeling techniques for geometric design, medical image analysis, and human facial modeling. It briefly motivates the problems of interest in each application area, describes the models that the authors have developed to address them, presents sample results, and provides references to technical papers containing the full details.

#*Robust Meshes from Multiple Range Maps.
#@Kari Pulli,Tom Duchamp,Hugues Hoppe,John Alan McDonald,Linda G. Shapiro,Werner Stuetzle
#year1997
#conf3DIM
#citation73
#index4085
#arnetid4087
#!This paper presents a method for modeling the surface of an object from a sequence of range maps. Our method is based on a volumetric approach that produces a compact surface without boundary. It provides robustness through the use of interval analysis techniques and computational efficiency through hierarchical processing using octrees.

#*Determining Characteristic Views of a 3D Object by Visual Hulls and Hausdorff Distance.
#@Adrien Theetten,Jean-Philippe Vandeborre,Mohamed Daoudi
#year2005
#conf3DIM
#citation1
#index4086
#arnetid4088
#!Nowadays, with the exponential growing of 3D object representations in private databases or on the web, it is all the more required to match these objects from some views. To improve the results of their matching, we work on the characteristic views of an object. The aim of this study is to find how many characteristic views are required and what relative positions are optimal. This is the reason why the visual hulls are used. From some 2D masks, the nearest possible 3D mesh from the original object is computed. OpenGL views are used to build the visual hulls of 3D models from a given collection and then the distance between the visual hulls and the models are measured thanks to the Hausdorff distance. Then the best view parameters are deduced to reduce the distance. These shots show that three orthogonal views give results very close to the ones given by twelve views on a isocahedron. Some other results on the view resolution and the field of view are discussed.

#*Projective Surface Matching of Colored 3D Scans.
#@Kari Pulli,Simo Piiroinen,Tom Duchamp,Werner Stuetzle
#year2005
#conf3DIM
#citation4
#index4087
#arnetid4089
#!We present a new method for registering multiple 3D scans of a colored object. Each scan is regarded as a color and range image of the object recorded by a pinhole camera. Consider a pair of cameras that see overlapping parts of the objects. For correct camera poses, the actual image of the overlap area in one camera matches the rendition of the overlap area as seen by the other camera. We define a mismatch score summarizing discrepancies in color, range, and silhouette between pairs of images, and we present an algorithm to efficiently minimize this mismatch score over camera poses.

#*3D Modeling of Archaeological Vessels Using Shape from Silhouette.
#@Srdan Tosovic,Robert Sablatnig
#year2001
#conf3DIM
#citation21
#index4088
#arnetid4090

#*Adaptive Enhancement of 3D Scenes using Hierarchical Registration of Texture-Mapped 3D models.
#@Srikumar Ramalingam,Suresh K. Lodha
#year2003
#conf3DIM
#citation4
#index4089
#arnetid4091

#*Relighting Acquired Models of Outdoor Scenes.
#@Alejandro Troccoli,Peter K. Allen
#year2005
#conf3DIM
#citation4
#index4090
#arnetid4092
#!In this paper we introduce a relighting algorithm for diffuse outdoor scenes that enables us to create geometrically correct and illumination consistent models from a series of range scans and a set of overlapping photographs that have been taken under different illumination conditions. To perform the relighting we compute a set of mappings from the overlap region of two images. We call these mappings Irradiance Ratio Maps (IRMs). Our algorithm handles cast shadows, being able to relight shadowed regions into non-shadowed regions and vice-versa. We solve these cases by computing four different IRMs, to handle all four combinations of shadowed vs. non-shadowed surfaces. To relight the non-overlapping region of an image, we look into the appropriate IRM which we index on surface normal, and apply its value to the corresponding pixels. The result is an illumination consistent set of images.

#*Approaches to a Color Scannerless Range Imaging System.
#@Lawrence A. Ray,Louis Gabello,Kenneth Repich
#year2001
#conf3DIM
#citation0
#index4091
#arnetid4093

#*Efficient Surface Reconstruction from Range Curves.
#@Dragan Tubic,Patrick Hébert,Denis Laurendeau
#year2003
#conf3DIM
#citation0
#index4092
#arnetid4094

#*3-D Modeling from Range Imagery: An Incremental Method with a Planning Component.
#@Michael K. Reed,Peter K. Allen,Ioannis Stamos
#year1997
#conf3DIM
#citation78
#index4093
#arnetid4095
#!In this paper we present a method for automatically constructing a CAD model of an unknown object from range images. The method is an incremental one that interleaves a sensing operation that acquires and merges information into the model with a planning phase to determine the next sensor position or "view". This is accomplished by integrating a system for 3-D model acquisition with a sensor planner. The model acquisition system provides facilities for range image acquisition, solid model construction and model merging: both mesh surface and solid representations are used to build a model of the range data from each view, which is then merged with the model built from previous sensing operations. The planning system utilizes the resulting incomplete model to plan the next sensing operation by finding a sensor viewpoint that will improve the fidelity of the model. Experimental results are presented for a complex part that includes polygonal faces, curved surfaces, and large self-occlusions.

#*Virtual Clay Modeling System Using Multi-Viewpoint Images.
#@Etsuko Ueda,Yoshio Matsumoto,Tsukasa Ogasawara
#year2005
#conf3DIM
#citation1
#index4094
#arnetid4096
#!This paper proposes a "non-contact virtual clay modeling system." We developed a prototype of three-dimensional modeling system that allows users to shape "virtual clay" with their hand movements. In our proposed method, the usersý hand movements are observed with multiple cameras to estimate their positions. The human hand surface and virtual clay are modeled by using subdivision surface. Using these estimated hand positions, virtual clay is shaped based on a direct free-form deformation technique. To improve processing speed, we implemented the proposed system on a PC cluster. This system proves the feasibility of an intuitive virtual clay modeling system.

#*Human Figure Reconstruction and Modeling from Single Image or Monocular Video Sequence.
#@Fabio Remondino,Andreas Roditakis
#year2003
#conf3DIM
#citation24
#index4095
#arnetid4097

#*Generating Smooth Surfaces with Bicubic Splines over Triangular Meshes: Toward Automatic Model Building from Unorganized 3D Points.
#@Toshio Ueshiba,Gerhard Roth
#year1999
#conf3DIM
#citation4
#index4096
#arnetid4098

#*3D Models from Extended Uncalibrated Video Sequences: Addressing Key-Frame Selection and Projective Drift.
#@Jason Repko,Marc Pollefeys
#year2005
#conf3DIM
#citation20
#index4097
#arnetid4099
#!In this paper; we present an approach that is able to reconstruct 3D models from extended video sequences captured with an uncalibrated hand-held camera. We focus on two specific issues: (1) key-frame selection, and ( 2 ) projective drift. Given a long video sequence it is often not practical to work with all videoframes. In addition, to allow for effective outlier rejection and motion estimation it is necessary to have a sufficient baseline between frames. For this purpose, we propose a key-frame selection procedure based on a robust model selection criterion. Our approach guarantees that the camera motion can be estimated reliably by analyzing the feature correspondences between three consecutive views. Another problem for long uncalibrated video sequences is projective drift. Error accumulation leads to a non-projective distortion of the model. This causes the projective basis at the beginning and the end of the sequence to become inconsistent and leads to the failure of self-calibration. We propose a self-calibration approach that is insensitive to this global projective drift. Afterself-calibration triplets of key-frames are aligned using absolute orientation and hierarchically merged into a complete metric reconstruction. Next, we compute a detailed 3D surface model using stereo matching. The 3D model is textured using some of the frames.

#*Correction of Color Information of a 3D Model Using a Range Intensity Image.
#@Kazunori Umeda,Megumi Shinozaki,Guy Godin,Marc Rioux
#year2005
#conf3DIM
#citation6
#index4098
#arnetid4100
#!A range intensity image, which is also called a reflectance image, refers to the intensity image that is acquired simultaneously with the range image captured using an active range sensor. This paper proposes a method that uses this image to correct the color information of a textured 3D model. The color information is usually obtained by texture mapping of color images acquired by a digital camera. The lighting condition for the color images are usually not controlled, thus the color information is not precise. On the other hand, the lighting condition for the range intensity image is controlled since it is obtained from a controlled and known lighting as required for the purpose of range measurement. The paper describes the method for combining the two sources of information; experiments show the effectiveness of the correction method.

#*Modeling Structured Environments by a Single Moving Camera.
#@Tapio Repo,Juha Röning
#year1999
#conf3DIM
#citation2
#index4099
#arnetid4101

#*Combining Off- and On-Line Calibration of a Digital Camera.
#@Magdalena Urbanek,Radu Horaud,Peter F. Sturm
#year2001
#conf3DIM
#citation4
#index4100
#arnetid4102

#*Shape Recovery and Analysis of Large Screw Threads.
#@Craig Robertson,Robert B. Fisher
#year2001
#conf3DIM
#citation2
#index4101
#arnetid4103

#*Stable Real-Time Interaction Between Virtual Humans And Real Scenes .
#@Luca Vacchetti,Vincent Lepetit,George Papagiannakis,Michal Ponder,Pascal Fua,Daniel Thalmann,Nadia Magnenat-Thalmann
#year2003
#conf3DIM
#citation17
#index4102
#arnetid4104

#*The Caesar Project: A 3-D Surface Anthropometry Survey.
#@Kathleen M. Robinette,Hein A. M. Daanen
#year1999
#conf3DIM
#citation54
#index4103
#arnetid4105

#*Surflet-Pair-Relation Histograms: A Statistical 3D-Shape Representation for Rapid Classification.
#@Eric Wahl,Ulrich Hillenbrand,Gerd Hirzinger
#year2003
#conf3DIM
#citation-1
#index4104
#arnetid4106

#*3D Shape Recovery and Registration based on the Projection of Non Coherent Structured Light.
#@Roberto Rodella,Giovanna Sansoni
#year1999
#conf3DIM
#citation1
#index4105
#arnetid4107

#*Efficient Reconstruction of Indoor Scenes with Color.
#@Rui Wang,David P. Luebke
#year2003
#conf3DIM
#citation4
#index4106
#arnetid4108

#*Computing Camera Positions from a Multi-camera Head.
#@Gerhard Roth
#year2001
#conf3DIM
#citation2
#index4107
#arnetid4109

#*Shape Reconstruction of Human Foot from Multi-Camera Images Based on PCA of Human Shape Database.
#@Jiahui Wang,Hideo Saito,Makoto Kimura,Masaaki Mochimaru,Takeo Kanade
#year2005
#conf3DIM
#citation3
#index4108
#arnetid4110
#!Recently, researches and developments for measuring and modeling of human body are taking much attention. Our aim is to capture accurate shape of human foot, using 2D images acquired by multiple cameras, which can capture dynamic behavior of the object. In this paper, 3D active shape models is used for accurate reconstruction of surface shape of human foot. We apply Principal Component Analysis (PCA) of human shape database, so that we can represent humanýs foot shape by approximately 12 principal component shapes. Because of the reduction of dimensions for representing the object shape, we can efficiently recover the object shape from multi-camera images, even though the object shape is partially occluded in some of input views. To demonstrate the proposed method, two kinds of experiments are presented: high accuracy reconstruction of human foot in a virtual reality environment with CG multi-camera images and in real world with eight CCD cameras. In those experiments, the recovered shape error with our method is around 2mm, while the error is around 4mm with volume intersection method.

#*Registering Two Overlapping Range Images.
#@Gerhard Roth
#year1999
#conf3DIM
#citation69
#index4109
#arnetid4111

#*Registration of 3-D Partial Surface Models using Luminance and Depth Information.
#@Sebastian Weik
#year1997
#conf3DIM
#citation70
#index4110
#arnetid4112
#!Textured surface models of three-dimensional objects are gaining importance in computer graphics applications. These models often have to be merged from several overlapping partial models which have to be registered (i.e. the relative transformation between the partial models has to be determined) prior to the merging process. In this paper a method is presented that makes use of both camera-based depth information (e.g. from stereo) and the luminance image. The luminance information is exploited to determine corresponding point sets on the partial surfaces using an optical flow approach. Quaternions are then employed to determine the transformation between the partial models which minimizes the sum of the 3-D Euclidian distances between the corresponding point sets. In order to find corresponding points on the partial surfaces luminance information is linearized. The procedure is iterated until convergence is reached. In contrast to only using depth information, employing luminance speeds up convergence and reduces remaining degrees of freedom (e.g. when registering sphere-like shapes).

#*Curve and Surface Models to Drive 3D Reconstruction Using Stereo and Shading.
#@David Roussel,Patrick Bourdot,Rachid Gherbi
#year1999
#conf3DIM
#citation1
#index4111
#arnetid4113

#*Faithful Recovering of Quadric Surfaces from 3D Range Data.
#@Naoufel Werghi,Anthony Ashbrook,Robert B. Fisher,Craig Robertson
#year1999
#conf3DIM
#citation19
#index4112
#arnetid4114

#*Segmentation and Modeling of Approximately Rotationally Symmetric Objects in 3D Ultrasound.
#@Johannes Ruisz,Dieter Hönigmann,Helmut Pottmann
#year2003
#conf3DIM
#citation1
#index4113
#arnetid4115

#*Indoor Scene Reconstruction from Sets of Noisy Range Images.
#@Ross T. Whitaker,Jens Gregor,P. F. Chen
#year1999
#conf3DIM
#citation20
#index4114
#arnetid4116

#*3D Capture for Computer Graphics.
#@Holly E. Rushmeier
#year2001
#conf3DIM
#citation4
#index4115
#arnetid4117

#*Real-Time Image Based Rendering from Uncalibrated Images.
#@Geert Willems,Frank Verbiest,Maarten Vergauwen,Luc J. Van Gool
#year2005
#conf3DIM
#citation7
#index4116
#arnetid4118
#!We present a novel real-time image-based rendering system for generating realistic novel views of complex scenes from a set of uncalibrated images. A combination ofstructure-and-motion and stereo techniques is used to obtain calibrated cameras and dense depth maps for all recorded images. These depth maps are converted into restrictive quadtrees, which allow for adaptive, view-dependent tessellations while storing per-vertex quality. When rendering a novel view, a subset of suitable cameras is selected based upon a ranking criterion. In the spirit of the unstructured lumigraph rendering approach a blending field is evaluated, although the implementation is adapted on several points. We alleviate the need for the creation of a geometric proxy for each novel view while the camera blending field is sampled in a more optimal, non-uniform way and combined with the per-vertex quality to reduce texture artifacts. In order to make real-time visualization possible, all critical steps of the visualization pipeline are programmed in a highly optimized way on commodity graphics hardware using the OpenGL Shading Language. The proposed system can handle complex scenes such as large outdoor scenes as well as small objects with a large number of acquired images.

#*Computing Consistent Normals and Colors from Photometric Data.
#@Holly E. Rushmeier,Fausto Bernardini
#year1999
#conf3DIM
#citation42
#index4117
#arnetid4119

#*Model-Based Scanning Path Generation for Inspection.
#@Chang Shu,Fengfeng Xi
#year1999
#conf3DIM
#citation3
#index4118
#arnetid4120

#*Image-Based Object Editing.
#@Holly E. Rushmeier,José Gomes,Laurent Balmelli,Fausto Bernardini,Gabriel Taubin
#year2003
#conf3DIM
#citation8
#index4119
#arnetid4121

#*Enhanced, Robust Genetic Algorithms for Multiview Range Image Registration.
#@Luciano Silva,Olga Regina Pereira Bellon,Kim L. Boyer
#year2003
#conf3DIM
#citation33
#index4120
#arnetid4122

#*Efficient Variants of the ICP Algorithm.
#@Szymon Rusinkiewicz,Marc Levoy
#year2001
#conf3DIM
#citation923
#index4121
#arnetid4123

#*Combining texture and shape for automatic crude patch registration.
#@Joris Vanden Wyngaerd,Luc J. Van Gool
#year2003
#conf3DIM
#citation14
#index4122
#arnetid4124

#*On Estimating the Position of Fragments on Rotational Symmetric Pottery.
#@Robert Sablatnig,Christian Menard
#year1999
#conf3DIM
#citation1
#index4123
#arnetid4125

#*A Discrete Reeb Graph Approach for the Segmentation of Human Body Scans .
#@Yijun Xiao,Paul Siebert,Naoufel Werghi
#year2003
#conf3DIM
#citation24
#index4124
#arnetid4126

#*Next View Planning for a Combination of Passive and Active Acquisition Techniques.
#@Robert Sablatnig,Srdan Tosovic,Martin Kampel
#year2003
#conf3DIM
#citation7
#index4125
#arnetid4127

#*Additional Reviewers.
#@
#year2005
#conf3DIM
#citation0
#index4126
#arnetid4128

#*Curvature Estimation for Segmentation of Triangulated Surfaces.
#@R. Sacchi,Janet F. Poliakoff,Peter D. Thomas,K.-H. Häfele
#year1999
#conf3DIM
#citation28
#index4127
#arnetid4129

#*3-D Modeling of Human Hand with Motion Constraints.
#@Yoshihiro Yasumuro,Qian Chen,Kunihiro Chihara
#year1997
#conf3DIM
#citation-1
#index4128
#arnetid4130

#*Taking Consensus of Signed Distance Field for Complementing Unobservable Surface.
#@Ryusuke Sagawa,Katsushi Ikeuchi
#year2003
#conf3DIM
#citation21
#index4129
#arnetid4131

#*Progressive Multilevel Meshes from Octree Particles.
#@Yücel Yemez,Francis Schmitt
#year1999
#conf3DIM
#citation24
#index4130
#arnetid4132

#*Effective Nearest Neighbor Search for Aligning and Merging Range Images.
#@Ryusuke Sagawa,Tomohito Masuda,Katsushi Ikeuchi
#year2003
#conf3DIM
#citation17
#index4131
#arnetid4133

#*Digitizing Archaeological Excavations from Multiple Views.
#@Xenophon Zabulis,Alexander Patterson,Kostas Daniilidis
#year2005
#conf3DIM
#citation4
#index4132
#arnetid4134
#!We present a novel approach on digitizing large scale unstructured environments like archaeological excavations using off-the-shelf digital still cameras. The cameras are calibrated with respect to few markers captured by a theodolite system. Having all cameras registered in the same coordinate system enables a volumetric approach. Our new algorithm has as input multiple calibrated images and outputs an occupancy voxel space where occupied pixels have a local orientation and a confidence value. Both, orientation and confidence facilitate an efficient rendering and texture mapping of the resulting point cloud. Our algorithm combines the following new features: Images are back-projected to hypothesized local patches in the world and correlated on these patches yielding the best orientation. Adjacent cameras build tuples which yield a product of pairwise correlations, called strength. Multiple camera tuples compete each other for the best strength for each voxel. A voxel is regarded as occupied if strength is maximum along the normal. Unlike other multi-camera algorithms using silhouettes, photoconsistency, or global correspondence, our algorithm makes no assumption on camera locations being outside the convex hull of the scene. We present compelling results of outdoors excavation areas.

#*Appearance-Based Virtual View Generation of Temporally-Varying Events from Multi-Camera Images in the 3D Room.
#@Hideo Saito,Shigeyuki Baba,Makoto Kimura,Sundar Vedula,Takeo Kanade
#year1999
#conf3DIM
#citation62
#index4133
#arnetid4135

#*A Mechanism for Range Image Integration without Image Registration.
#@Lyubomir Zagorchev,Ardeshir Goshtasby
#year2005
#conf3DIM
#citation4
#index4134
#arnetid4136
#!A mechanism is introduced that automatically integrates multi-view range images without registering the images. The mechanism is based on a reference double-frame that acts as the coordinate system of the scene. A single-view range image of a scene is obtained by sweeping a laser line over the scene by hand and analyzing the acquired light stripes. Range images captured from different views of the scene will be in the coordinate system of the double-frame, and thus, will automatically integrate without further processing.

#*Three-Dimensional Shape Modeling with Extended Hyperquadrics.
#@Tsuneo Saito,Munenori Ohuchi
#year2001
#conf3DIM
#citation0
#index4135
#arnetid4137

#*Dynamic Gaze-Controlled Levels of Detail of Polygonal Objects in 3-D Environment Modeling.
#@Hongbin Zha,Yoshinobu Makimoto,Tsutomu Hasegawa
#year1999
#conf3DIM
#citation13
#index4136
#arnetid4138

#*Recovery of Shape and Surface Reflectance of Specular Object from Rotation of Light Source.
#@Hideo Saito,Kazuko Omata,Shinji Ozawa
#year1999
#conf3DIM
#citation-1
#index4137
#arnetid4139

#*Active Modeling of 3-D Objects: Planning on the Next Best Pose (NBP) for Acquiring Range Images.
#@Hongbin Zha,Ken'ichi Morooka,Tsutomu Hasegawa,Tadashi Nagata
#year1997
#conf3DIM
#citation31
#index4138
#arnetid4140
#!We propose a new method of creating a complete model of a curved object from multiple range images acquired by showing it at different poses. The pose of the object is changed by a manipulator in order to view the object from some specified viewpoints. The pose is planned after each new image is merged into a unified representation. A rating function for the planning is defined to take into consideration the factors such as possibility of merging new data, registration accuracy and control point selection.

#*Shape Measurement of Discontinuous Objects using Projected Fringes and Temporal Phase Unwrapping.
#@Henrik O. Saldner,Jonathan M. Huntley
#year1997
#conf3DIM
#citation4
#index4139
#arnetid4141
#!Temporal phase unwrapping is a method of analyzing fringe patterns in which the fringe phase, /spl Phi/, at each pixel is measured and unwrapped as a function of time, t. We propose a method for improving the signal-to-noise ratio of the total phase change by incorporating data from the intermediate phase values. The performance of the method is compared theoretical and experimentally, using data from a fringe projector based on a spatial tight modulator. The best way to use the method is with /spl Phi/ decreasing exponentially with time from its maximum value to zero; this provides significant improvements in reliability, accuracy and computation time compared with the original temporal unwrapping algorithm.

#*Bootstrapped Real-Time Ego Motion Estimation and Scene Modeling.
#@Xiang Zhang,Yakup Genc
#year2005
#conf3DIM
#citation1
#index4140
#arnetid4142
#!Estimating the motion of a moving camera in an unknown environment is essential for a number of applications ranging from as-built reconstruction to augmented reality. It is a challenging problem especially when real-time performance is required. Our approach is to estimate the camera motion while reconstructing the shape and appearance of the most salient visual features in the scene. In our 3D reconstruction process, correspondences are obtained by tracking the visual features from frame to frame with optical flow tracking. Optical-flow-based tracking methods have limitations in tracking the salient features. Often larger translational motions and even moderate rotational motions can result in drifts. We propose to augment flow-based tracking by building a landmark representation around reliably reconstructed features. A planar patch around the reconstructed feature point provides matching information that prevents drifts in flow-based feature tracking and allows establishment of correspondences across the frames with large baselines. Selective and periodic such correspondence mappings drastically improve scene and motion reconstruction while adhering to the real-time requirements. The method is experimentally tested to be both accurate and computational efficient.

#*3-D Imager for Dimensional Gauging of Industrial Workpieces: State-of-the-Art of the Development of a Robust and Versatile System.
#@Giovanna Sansoni,Sara Lazzari,Stefano Peli,Franco Docchio
#year1997
#conf3DIM
#citation-1
#index4141
#arnetid4143

#*Experimental Analysis of Harmonic Shape Images.
#@Dongmei Zhang,Martial Hebert
#year1999
#conf3DIM
#citation10
#index4142
#arnetid4144

#*Fast Range Image Segmentation by an Edge Detection Strategy.
#@Angel Domingo Sappa,Michel Devy
#year2001
#conf3DIM
#citation42
#index4143
#arnetid4145

#*A Physically-Based Model for Real-Time Facial Expression Animation.
#@Yu Zhang,Eric Sung,Edmond C. Prakash
#year2001
#conf3DIM
#citation8
#index4144
#arnetid4146

#*Globally Convergent Range Image Registration by Graph Kernel Algorithm.
#@Radim Sára,Ikuko Shimizu Okatani,Akihiro Sugimoto
#year2005
#conf3DIM
#citation12
#index4145
#arnetid4147
#!Automatic range image registration without any knowledge of the viewpoint requires identification of common regions across different range images and then establishing point correspondences in these regions. We formulate this as a graph-based optimization problem. More specifically, we define a graph in which each vertex represents a putative match of two points, each edge represents binary consistency decision between two matches, and each edge orientation represents match quality from worse to better putative match. Then strict sub-kernel defined in the graph is maximized. The maximum strict sub-kernel algorithm enables us to uniquely determine the largest consistent matching of points. To evaluate the quality of a single match, we employ the histogram of triple products that are generated by all surface normals in a point neighborhood. Our experimental results show the effectiveness of our method for rough range image registration.

#*Robust Recognition and Pose Determination of 3-D Objects Using Range Images in Eigenspace.
#@Danijel Skocaj,Ales Leonardis
#year2001
#conf3DIM
#citation21
#index4146
#arnetid4148

#*The Planar: A Mobile VR Tool with Pragmatic Pose Estimation for Generation and Manipulation of 3D Data in Industrial Environments.
#@Ralph Schönfelder,Joachim Baur,Frank Spenling
#year2005
#conf3DIM
#citation2
#index4147
#arnetid4149
#!We present the prototype of the Planar, a novel input/output device designed for applications in task areas focusing on the generation and manipulation of 3D data, e.g. CAD or styling. Technically, the Planar offers a spatially aware pen-sensitive display, mounted on an adjustable, scooter-like autonomous platform. The movable screen, with 6 degrees of freedom, can act like a window into 3D virtual environments and allows for efficient 2D and 3D interaction at the same time. We report on the pose estimation system of the Planar's display where we focus on two enhanced optical mice combined to track horizontal 2D position/orientation. Results of this pragmatic approach are presented and discussed. In order to demonstrate the potential of the Planar we show a small review/sketching/annotation application. The overall goal of this work is to contribute to the development of real VR applications.

#*From Range Data to Animated Anatomy-Based Faces: A Model Adaptation Method.
#@Yu Zhang,Terence Sim,Chew Lim Tan
#year2005
#conf3DIM
#citation4
#index4148
#arnetid4150
#!This paper presents a new method for reconstructing animated, anatomy-based facial models of individuals from range data with minimal manual intervention. A prototype model with a multi-layer skin-muscle-skull structure serves as the starting point for our method. After the global adaptation, the skin mesh of the prototype model is represented as a dynamic deformable model which is deformed to fit scanned data according to internal force stemming from the elastic properties of the surface and external forces produced from the scanned data points and features. The underlying muscle layer that consists of three types of facial muscles is automatically adapted. According to the adapted skin and muscle structures, a set of automatically generated skull feature points is transformed to drive a volume morphing of the template skull model for skull fitting. The reconstructed model realistically reproduces the shape and features of a specific person and can be animated instantly.

#*View Planning with a Registration Constraint.
#@William R. Scott,Gerhard Roth,Jean-François Rivest
#year2001
#conf3DIM
#citation20
#index4149
#arnetid4151

#*Reconstructing Urban 3D Model Using Vehicle-Borne Laser Range Scanners.
#@Huijing Zhao,Ryosuke Shibasaki
#year2001
#conf3DIM
#citation38
#index4150
#arnetid4152

#*Discrete Pose Space Estimation to Improve ICP-Based Tracking.
#@Limin Shang,Piotr Jasiobedzki,Michael A. Greenspan
#year2005
#conf3DIM
#citation6
#index4151
#arnetid4153
#!Iterative Closest Point (ICP) -based tracking works well when the interframe motion is within the ICP minimum well space. For large interframe motions resulting from a limited sensor acquisition rate relative to the speed of the object motion, it suffers from slow convergence and a tendency to be stalled by local minima. A novel method is proposed to improve the performance of ICP-based tracking. The method is based upon the Bounded Hough Transform (BHT) which estimates the object pose in a coarse discrete pose space. Given an initial pose estimate, and assuming that the interframe motion is bounded in all 6 pose dimensions, the BHT estimates the current frameýs pose. On its own, the BHT is able to track an objectýs pose in sparse range data both efficiently and reliably, albeit with a limited precision. Experiments on both simulated and real data show the BHT to be more efficient than a number of variants of the ICP for a similar degree of reliability. A hybrid method has also been implemented wherein at each frame the BHT is followed by a few ICP iterations. This hybrid method is more efficient than the ICP, and is more reliable than either the BHT or ICP separately.

#*3D Head Pose Estimation with Optical Flow and Depth Constraints.
#@Youding Zhu,Kikuo Fujimura
#year2003
#conf3DIM
#citation9
#index4152
#arnetid4154

#*Efficient Photometric Stereo Technique for Three-Dimensional Surfaces with Unknown BRDF.
#@Li Shen,Takashi Machida,Haruo Takemura
#year2005
#conf3DIM
#citation6
#index4153
#arnetid4155
#!The present paper focuses on efficient inverse rendering using a Photometric Stereo technique for realistic surfaces. The technique primarily assumes the Lambertian reflection model only. For non-Lambertian surfaces, application of the technique to real surfaces in order to estimate 3-D shape and spatially varying reflectance from sparse images remains difficult. In the present paper, we propose a new Photometric Stereo technique by which to efficiently recover a full surface model, starting from a small set of photographs. The proposed technique allows diffuse albedo to vary arbitrarily over surfaces while non-diffuse characteristics remain constant for a material. Specifically, the basic approach is to first recover the specular reflectance parameters of the surfaces by a novel optimization procedure. These parameters are then used to estimate the diffuse reflectance and surface normal for each point. As a result, a lighting-independent model of the geometry and reflectance properties of the surface is established using the proposed method, which can be used to re-render the images under novel lighting via traditional rendering methods.

#*Extract and Display Moving Object in All Direction by Using Stereo Omnidirectional System(SOS).
#@Daisuke Shimada,Hideki Tanahashi,Kunihito Kato,Kazuhiko Yamamoto
#year2001
#conf3DIM
#citation6
#index4154
#arnetid4156

#*Estimation of 3-D Pose and Shape from a Monocular Image Sequence and Realtime Human Tracking.
#@Y. Shirai
#year1997
#conf3DIM
#citation7
#index4155
#arnetid4157

#*Digital Preservation of Ancient Cuneiform Tablets Using 3D-Scanning.
#@Subodh Kumar,Dean Snyder,Donald Duncan,Jonathan D. Cohen,Jerry Cooper
#year2003
#conf3DIM
#citation10
#index4156
#arnetid4158

#*Program Committee.
#@
#year2005
#conf3DIM
#citation0
#index4157
#arnetid4159

#*Optimized Compression of Triangle Mesh Geometry Using Prediction Trees.
#@Boris Kronrod,Craig Gotsman
#year2002
#conf3DPVT
#citation45
#index4158
#arnetid4160

#*Efficient Interactive Rendering of Detailed Models with Hierarchical Levels of Detail.
#@Ali Lakhia
#year2004
#conf3DPVT
#citation13
#index4159
#arnetid4161
#!Recent acquisition systems, such as the one developed at the University of California at Berkeley, are capable of collecting large, detailed, highly textured models that standard levels of detail (LOD) rendering techniques [Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments] cannot handle efficiently. We propose an out-of-core rendering engine which applies the cost and benefit approach of the Adaptive Display algorithm by Funkhouser and Séquin [Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments] to Hierarchical Levels of Detail (HLODs) [HLODs for faster display of large static and dynamic environments]. Unlike the Adaptive Display algorithm, we do not skip objects to maintain interactivity when many objects are visible. Funkhouser and Séquin apply hysteresis by adding a penalty in the benefit heuristics to discourage disturbing visual effects due to fast switching of detail in the model. However, this penalty may not be sufficient if the user is moving around rapidly in the scene. Instead, we have developed a more robust temporal hysteresis by retaining how much detail is rendered over a time period. We have implemented our rendering engine to run on a common personal computer with a standard graphics card. The engine is capable of visualizing, in both walk-through and fly-through mode, a detailed model of 25 city blocks comprised of 7 million triangles and 720 million color pixels. Our engine maintains a constant frame rate and limits excessive flickering simultaneously.

#*Network Protocol for I teraction and Scalable Distributed Visualization.
#@Jan-Michael Frahm,Jan-Friso Evers-Senne,Reinhard Koch
#year2002
#conf3DPVT
#citation-1
#index4160
#arnetid4162

#*Disordered Patterns Projection For 3D Motion Recovering.
#@Antonio Adán,Fernando Molina,Luis Morena
#year2004
#conf3DPVT
#citation9
#index4161
#arnetid4163
#!In this paper we present a new color structured light technique based on a disordered codeword strategy. The aim of this method is to recover 3D information in moving scenes in such a way that the correspondence problem is easily and robustly solved. With this goal in mind a six-connectivity topology has been introduced in our pattern and color features have been inserted on it. Repetition and disorder are allowed in the codeword which implies that the Hamming distance between contiguous codewords increases. As a consequence of that, code loss circumstances can be efficiently handled. Additionally, computational cost in the code recovering phase is highly reduced since codewords are defined as sets. A structured light projection system has been built in our lab and a wide test under real moving conditions has been carried out. This experimentation has been performed on medium resolution and for slow movements specifications giving promising results.

#*Object Classification by Functional Parts.
#@Guy Froimovich,Ehud Rivlin,Ilan Shimshoni
#year2002
#conf3DPVT
#citation19
#index4162
#arnetid4164

#*Reconstruction of Spherical Representation Models From Multiple Partial Models.
#@Antonio Adán,Santiago Salamanca,Carlos Cerrada,Pilar Merchán
#year2002
#conf3DPVT
#citation0
#index4163
#arnetid4165

#*Automated Texture Mapping of 3D City Models With Oblique Aerial Imagery.
#@Christian Früh,Russell Sammon,Avideh Zakhor
#year2004
#conf3DPVT
#citation30
#index4164
#arnetid4166
#!This paper describes an approach to texture mapping a 3D city model obtained from aerialand ground-based laser scans with oblique aerial imagery. First, the images are automatically registered by matching 2D image lines with projections of 3D lines from the city model. Then, for each triangle in the model, the optimal image is selected by taking into account occlusion, image resolution, surface normal orientation, and coherence with neighboring triangles. Finally, the utilized texture patches from all images are combined into one texture atlas for compact representation and efficient rendering. We evaluate our approach on a data set of downtown Berkeley.

#*Human Motion: Modeling and Recognition of Actions and Interactions.
#@Jake K. Aggarwal,Sangho Park
#year2004
#conf3DPVT
#citation71
#index4165
#arnetid4167
#!Processing of image sequences has progressed from simple structure from motion paradigm to the recognition of actions / interactions as events. Understanding human activities in video has many potential applications including automated surveillance, video archival/retrieval, medical diagnosis, sports analysis, and human-computer interaction. Understanding human activities involves various steps of low-level vision processing such as segmentation, tracking, pose recovery, and trajectory estimation as well as high-level processing tasks such as body modeling and representation of action. While low-level processing has been actively studied, high-level processing is just beginning to receive attention. This is partly because high-level processing depends on the results of low-level processing. However, high-level processing also requires some independent and additional approaches and methodologies. In this paper, we focus on the following aspects of high-level processing: (1) human body modeling, (2) level of detail needed to understand human actions, (3) approaches to human action recognition, and (4) high-level recognition schemes with domain knowledge. The review is illustrated by examples of each of the areas discussed, including recent developments in our work on understanding human activities.

#*Data Processing Algorithms for Generating Textured 3D Building Façade Meshes From Laser Scans and Camera Images.
#@Christian Früh,Avideh Zakhor
#year2002
#conf3DPVT
#citation0
#index4166
#arnetid4168

#*Linear Shift-Invariant Operators for Processing Surface Meshes.
#@Marc Alexa
#year2004
#conf3DPVT
#citation0
#index4167
#arnetid4169
#!Shift-invariant operators for surface meshes are defined using geometric realizations of the mesh. Then, shift-invariance essentially means isotropy w.r.t. a distance metric. The particular case of the so-defined LSI operators with small support is analyzed in detail, showing a connection to mean value coordinates. The topological Laplacian operator turns out to be the LSI operator of the topological realization of the mesh. More generally, assuming different geometric realizations or metrics allows interpreting various mesh processing techniques as LSI operators.

#*Combining fringe projection method of 3D object monitoring with virtual reality environment: concept and initial results.
#@Piotr Garbat,Malgorzata Kujawinska
#year2002
#conf3DPVT
#citation1
#index4168
#arnetid4170

#*Seeing into the Past: Creating a 3D Modeling Pipeline for Archaeological Visualization.
#@Peter K. Allen,Steven Feiner,Alejandro Troccoli,Hrvoje Benko,Edward W. Ishak,Benjamin Smith
#year2004
#conf3DPVT
#citation17
#index4169
#arnetid4171
#!Archaeology is a destructive process in which accurate and detailed recording of a site is imperative. As a site is exposed, documentation is required in order to recreate and understand the site in context. We have developed a 3D modeling pipeline that can assist archaeologists in the documentation effort by building rich, geometrically and photometrically accurate 3D models of the site. The modeling effort begins with data acquisition (images, range scans, GIS data, and video) and ends with the use of a sophisticated visualization tool that can be used by researchers to explore and understand the site. The pipeline includes new methods for shadow-based registration of 2D images and temporal change detection. Our multimodal augmented reality system allows users wearing head-tracked, see-through, head-worn displays to visualize the site model and associated archaeological artifacts, and to interact with them using speech and gesture.

#*Real Time Visualization of 3D variable in time Object based on Cloud of Points Data Gathered by Coloured Structure Light Projection System.
#@Piotr Garbat,Marek Wegiel,Malgorzata Kujawinska
#year2004
#conf3DPVT
#citation1
#index4170
#arnetid4172
#!The problem of virtual view creation has received increasing attention in recent years. Major current approaches are based on modified stereo vision systems. Recently the structure light measurement system based on digital light projection supported by special data coding and processing allow to rapid 3D shape acquisition. Application of this technology to record 3D data has increased significantly the accuracy of reconstructed shape and simplified data manipulation process. In the paper the general concept of virtual reality system supported by data gathered by means of structure light projection is presented. The methodology of conversion of cloud of measurement points (x,y,z,R,G,B) into virtual reality environment is described. It is supported by implementation of a virtual camera concept, as the mean for interactive object visualization. The methodology of real time 3D object visualization based on its coding by means of specially formed contours and their B-spline approximation is presented. The applicability of the methodology has been shown on numerically generated data which simulate performance of the measurement system. The total processing path was successfully tested.

#*Frequency Domain Registration of Computer Tomography Data.
#@Marco Andreetto,Guido Maria Cortelazzo,Luca Lucchese
#year2004
#conf3DPVT
#citation1
#index4171
#arnetid4173
#!This paper presents a new method for registering computer tomography (CT) volumetric data of human bone structures relative to observations made at different times. The system we advance was tested with different kinds of CT data sets. In this paper we report on some representative experimental results obtained with the CT data of the hip bones of a patient prior to and after prosthetic surgery aimed at the reconstruction of the hip articulation. The method works with rigid data having arbitrary relative position and orientation and proves to be robust with respect to CT acquisition noise and with respect to the segmentation technique adopted to select the region of interest for registration. The method is capable of registering correctly data sets taken from the same articulation and whose components have undergone small relative displacements. The method is also amenable to registration of heteregeneous kinds of volumetric data, e.g., CT scans and Magnetic Resonance Imagery (MRI) scans, which show different characteristics in correspondence to the same organic structure.

#*Recognition of Object Contours from Stereo Images: An Edge Combination Approach.
#@Margrit Gelautz,Danijela Markovic
#year2004
#conf3DPVT
#citation6
#index4172
#arnetid4174
#!In this paper, we present an algorithm to combine edge information from stereo-derived depth maps with edges from the original intensity/color image to improve the contour detection in images of natural scenes. After computing the disparity map, we generate a so-called "edge combination image", which relies on those edges of the original image that are also present in the stereo map. We describe an algorithm to identify corresponding intensity and depth edges, which are usually slightly displaced due to non-perfect stereo reconstruction. Our experiments demonstrate how the proposed edge combination approach can be used in conjunction with an active contours algorithm to achieve better segmentation results.

#*Enhanced Real-time Stereo Using Bilateral Filtering.
#@Adnan Ansar,Andres Castano,Larry Matthies
#year2004
#conf3DPVT
#citation19
#index4173
#arnetid4175
#!In recent years, there have been significant strides in increasing quality of range from stereo using global techniques such as energy minimization. These methods cannot yet achieve real-time performance. However, the need to improve range quality for real-time applications persists. All real-time stereo implementations rely on a simple correlation step which employs some local similarity metric between the left and right image. Typically, the correlation takes place on an image pair modified in some way to compensate for photometric variations between the left and right cameras. Improvements and modifications to such algorithms tend to fall into one of two broad categories: those which address the correlation step itself (e.g., shiftable windows, adaptive windows) and those which address the pre-processing of input imagery (e.g. band-pass filtering, Rank, Census). Our efforts lie in the latter area. We present in this paper a modification of the standard band-pass filtering technique used by many SSD- and SAD-based correlation algorithms. By using the bilateral filter of Tomasi and Manduchi [Bilateral filtering for gray and color images], we minimize blurring at the filtering stage. We show that in conjunction with SAD correlation, our new method improves stereo quality at range discontinuities while maintaining real-time performance.

#*Fast Interpolated Cameras by Combining a GPU based Plane Sweep with a Max-Flow Regularisation Algorithm.
#@Indra Geys,Thomas P. Koninckx,Luc J. Van Gool
#year2004
#conf3DPVT
#citation32
#index4174
#arnetid4176
#!The paper presents a method for the high speed calculation of crude depth maps. Performance and applicability are illustrated for view interpolation based on two input video streams, but the algorithm is perfectly amenable to multi-camera environments. First a fast plane sweep algorithm generates the crude depth map. Speed results from hardware accelerated transformations and parallel processing available on the GPU. All computations on the graphical board are performed pixel-wise and a single pass of the sweep only processes one input resolution. A second step uses a min-cut/max-flow algorithm to ameliorate the previous result. The depth map, a noisy interpolated image and correlation measures are available on the GPU. They are reused and combined with spatial connectivity information and temporal continuity considerations in a graph formulation. Position dependent sampling densities allow the system to use multiple image resolutions. The min-cut separation of this graph yields the global minimum of the associated energy function. Limiting the search range according to the initialisation provided by the plane sweep further speeds up the process. The required hardware are only two cameras and a regular PC.

#*A Bayesian Framework for 3D Models Retrieval Based on Characteristic Views.
#@Tarik Filali Ansary,Jean-Philippe Vandeborre,Saïd Mahmoudi,Mohamed Daoudi
#year2004
#conf3DPVT
#citation11
#index4175
#arnetid4177
#!The management of big databases of three-dimensional models (used in CAD applications, visualization, games, etc.) is a very important domain. The ability to characterize and easily retrieve models is a key issue for the designers and the final users. In this frame, two main approaches exist: search by example of a three-dimensional model, and search by a 2D view. In this paper, we present a novel framework for the characterization of a 3D model by a set of views (called characteristic views), and an indexing process of these models with a Bayesian probabilistic approach using the characteristic views. The framework is independent from the descriptor used for the indexing. We illustrate our results using different descriptors on a collection of threedimensional models supplied by Renault Group.

#*3D Model Watermarking for Indexing using the Generalized Radon Transform.
#@Petros Daras,Dimitrios Zarpalas,Dimitrios Tzovaras,Michael G. Strintzis
#year2004
#conf3DPVT
#citation4
#index4176
#arnetid4178
#!The present paper proposes a novel method for 3D-model watermarking for indexing. The proposed approach is based on the use of a Generalized Radon Transformation. More specifically, the Cylindrical Integration Transform (CIT) is initially applied to the 3D models in order to produce descriptor vectors. At the same time a watermarking technique, based on CIT is used in order to embed a specific model identifier in the nodes of the 3D model. This identifier links the model to its descriptor vector, which is extracted only once and stored in a database. Every time this model is employed as a query model, watermark detection is used so as to retrieve the corresponding identifier and further the descriptor vector, which can be further used in a matching algorithm. The proposed techniques are evaluated experimentally in terms of both watermarking efficiency and content-based retrieval performance.

#*A Structure-from-Motion Method: Use of Motion in Three-Dimensional Reconstruction of Moving Objects from Multiple-View Image Sequences.
#@Ha Vu Le
#year2004
#conf3DPVT
#citation0
#index4177
#arnetid4179
#!Solving the correspondence problem is the most essential task for multiview reconstruction techniques, yet finding unique correspondences between multiple views is impossible at some points, due to such problems as occlusions and ambiguities. We have developed a closed-form solution through constructive geometry for a special case of the structure-from-motion (SfM) problem with four rigidly moving points. This solution allows the 3-D position of a point on a moving object to be computed without having to find the correspondence between its projections on the image planes of multiple views, given its projected 2-D motion vector on an image plane and 3-D information of three other points. With this method we do not have to depend entirely on stereo/multiview feature correspondences in reconstructing 3-D objects, hence easing those problems caused by occlusions and ambiguities.

#*3D Data Acquisition and Elaboration for Classification and Recognition of Objects and People.
#@Stefano Arrighetti,Stefano Guanziroli,Ennio Ottaviani
#year2002
#conf3DPVT
#citation0
#index4178
#arnetid4180

#*Distributed quantitative evaluation of 3D patient specific arterial models.
#@Andrea Giachetti,Massimiliano Tuveri,Gianluigi Zanetti
#year2002
#conf3DPVT
#citation0
#index4179
#arnetid4181

#*New Imaging Frontiers: 3D and Mixed Reality.
#@Eric Badiqué
#year2002
#conf3DPVT
#citation4
#index4180
#arnetid4182

#*Projection Model, 3D Reconstruction and Rigid Motion Estimation from Non-Central Catadioptric Images.
#@Nuno Gonçalves,Helder Araújo
#year2004
#conf3DPVT
#citation4
#index4181
#arnetid4183
#!This paper addresses the problem of rigid motion estimation and 3D reconstruction in vision systems where it is possible to recover the incident light ray direction from the image points. Such systems include pinhole cameras and catadioptric cameras. Given two images of the same scene acquired from two different positions, the transformation is estimated by means of an iterative process. The estimation process aims at having corresponding incident rays intersecting at the same 3D point. Geometrical relationships are derived to support the estimation method. Furthermore, this paper also addresses the problem of the mapping from 3D points to image points, for non-central catadioptric cameras with mirror surfaces given by quadrics. The projection model presented can be expressed in a non-linear equation of only one variable, being more stable and easier to solve than the classical Snell's law. Experiments with real images are presented, by using simulated annealing as estimation method.

#*Scalable and Efficient Coding of 3D Model Extracted from a Video.
#@Raphaèle Balter,Patrick Gioia,Luce Morin,Franck Galpin
#year2004
#conf3DPVT
#citation3
#index4182
#arnetid4184
#!This paper presents an efficient and scalable coding scheme for transmitting a stream of 3D models extracted from a video.As in classical model-based video coding, the geometry, connectivity, and texture of the 3D models have to be transmitted, as well as the camera position for each frame in the original video. The proposed method is based on exploiting the interrelations existing between each type of information, instead of coding them independently, allowing a better prediction of the next 3D model in the stream. Scalability is achieved through the use of wavelet-based representations for both texture and geometry of the models. A consistent connectivity is built for all 3D models extracted from the video sequence, which allows a more compact representation and straightforward geometric morphing between successive models. Furthermore this leads to a consistent wavelet decomposition for 3D models in the stream. Quantitative and qualitative results for the proposed scheme are compared with the state of the art video coder H264, 3D model-based Galpin coder and independent MPEG4-based coding of the information. Targeted applications include distant visualization of the original video at very low bitrate and interactive navigation in the extracted 3D scene on heterogeneous terminals.

#*Modeling shapes and textures from images: new frontiers.
#@Luc J. Van Gool,D. Vandemeulen,Gregor A. Kalberer,Tinne Tuytelaars,Alexey Zalesny
#year2002
#conf3DPVT
#citation8
#index4183
#arnetid4185

#*Fusing Multiple Color Images for Texturing Models.
#@Nobuyuki Bannai,Alexander Agathos,Robert B. Fisher
#year2004
#conf3DPVT
#citation12
#index4184
#arnetid4186
#!A commonly encountered problem when creating 3D models of large real scenes is unnatural color texture fusion. Due to variations in lighting and camera settings (both manual and automatic), captured color texture maps of the same structure can have very different colors. When fusing multiple views to create larger models, this color variation leads to a poor appearance with odd color tilings on homogeneous surfaces. This paper extends previous research on pairwise global color correction to multiple overlapping images. The central idea is to estimate a set of blending transformations that minimize the overall color discrepancy in the overlapping regions, thus spreading residual color errors, rather than letting them accumulate.

#*Half-Edge Multi-Tessellation: A Compact Representation for Multi-Resolution Tetrahedral Meshes.
#@Emanuele Danovaro,Leila De Floriani
#year2002
#conf3DPVT
#citation7
#index4185
#arnetid4187

#*A Prototype of Video See-through Mixed Reality Interactive System.
#@Wen Qi
#year2004
#conf3DPVT
#citation3
#index4186
#arnetid4188
#!Mixed reality (MR), sometimes called enhanced reality, is a variety of virtual environment (VE) which explores various approaches to combine natural environment with immersive display technology. VE technologies completely immerse a user inside a synthetic environment. In contrast, MR system adds electronic data from a cyberspace on the physical space as a base, allows the users to see the real world with virtual objects superimposed upon. Moreover, MR can assist the users interact with the virtual object in the more realistic environment. The objective of our research is to investigate the potential of MR technique on improving interaction between human and computer through developing a video-see through mixed reality system. Further applications will be built upon this generic platform.

#*Novel Diffractive Optical Elements and Algorithms for Real-Time 3D and Hyperspectral Imaging.
#@George Barbastathis
#year2004
#conf3DPVT
#citation0
#index4187
#arnetid4189

#*Geometry Processing - A Personal Perspective.
#@Craig Gotsman
#year2004
#conf3DPVT
#citation0
#index4188
#arnetid4190

#*Optimized Spectral Estimation Methods for Improved Co orimetry with Laser Scanning Systems.
#@Réjean Baribeau
#year2002
#conf3DPVT
#citation-1
#index4189
#arnetid4191

#*Using the Expectation-Maximization Algorithm for Depth Estimation and Segmentation of Multi-view Images.
#@Nikos Grammalidis,L. Bleris,Michael G. Strintzis
#year2002
#conf3DPVT
#citation2
#index4190
#arnetid4192

#*3D Stereoscopic Image Pairs by Depth-Map Generation.
#@Sebastiano Battiato,Alessandro Capra,Salvatore Curti,M. La Cascia
#year2004
#conf3DPVT
#citation26
#index4191
#arnetid4193
#!This paper presents a new unsupervised technique aimed to generate stereoscopic views estimating depth information from a single input image.Using a single input image, vanishing lines/points are extracted using a few heuristics to generate an approximated depth map.The depth map is then used to generate stereo pairs.The overall method is well suited for real time application and works also on CFA (Colour Filtering Array) data acquired by consumer imaging devices. Experimental results on a large dataset are reported.

#*Visualizing Legacy Stratigraphic Data From Archaeological Handbooks.
#@Damian Green,John Cosmas,Take Itagaki
#year2002
#conf3DPVT
#citation0
#index4192
#arnetid4194

#*Architecture of a 3D - Simulation Environment for Active Vision Systems and Mobile Robots.
#@Andreas Baudry,Michael Bungenstock,Bärbel Mertsching
#year2002
#conf3DPVT
#citation4
#index4193
#arnetid4195

#*Multi-Stereo 3D Object Reconstruction.
#@Carlos Hernández Esteban,Francis Schmitt
#year2002
#conf3DPVT
#citation11
#index4194
#arnetid4196

#*The ORIGAMI Project: advanced tools and techniques for high-end mixing and interaction between real and virtual content.
#@Giovanni Bazzoni,Enrico Bianchi,Oliver Grau,Alec Knox,Reinhard Koch,Fabio Lavagetto,Alex Parkinson,Federico Pedersini,Augusto Sarti,Graham A. Thomas,Stefano Tubaro
#year2002
#conf3DPVT
#citation5
#index4195
#arnetid4197

#*Stereo Image Coder Based on MRF Analysis for Disparity Estimation and Morphological Encoding.
#@J. N. Ellinas,M. S. Sangriotis
#year2004
#conf3DPVT
#citation2
#index4196
#arnetid4198
#!This paper presents a stereoscopic image coder based on the MRF model and MAP estimation of the disparity field. The MRF model minimizes the noise of the disparity compensation because it takes into account the residual energy, smoothness constraints and the occlusion field. The disparity compensation is formulated as a MAP-MRF problem in the spatial domain and the MRF field consists of the disparity vector and occlusion field, which is partitioned into three regions by an initial double-threshold setting. The MAP search is conducted in a block-based sense on one or two of the three regions, providing faster execution. The reference and the residual images are decomposed by a discrete wavelet transform and the transform coefficients are encoded by employing the morphological representation of wavelet coefficients algorithm. As a result of the morphological encoding, the reference and residual images together with the disparity vector field are transmitted in partitions lowering the total entropy. The experimental evaluation on synthetic and real images shows beneficial performance of the proposed algorithm.

#*Remote Machinery Maintenance System with the use of Virtual Reality.
#@Moez Bellamine,Norihiro Abe,Kazuaki Tanaka,Hirokazu Taki
#year2002
#conf3DPVT
#citation8
#index4197
#arnetid4199

#*Point Samples for Efficient 3D Processing and Content Creation.
#@Markus H. Gross
#year2004
#conf3DPVT
#citation0
#index4198
#arnetid4200

#*Improvement of Metric Accuracy of Digital 3D Models through Digital Photogrammetry. A Case Study: Donatello's Maddalena.
#@J.-Angelo Beraldin,Gabriele Guidi,S. Ciofi,Carlo Atzeni
#year2002
#conf3DPVT
#citation4
#index4199
#arnetid4201

#*How can we exploit typical architectural structures to improve model recovery?
#@Petko Faber,Bob Fisher
#year2002
#conf3DPVT
#citation6
#index4200
#arnetid4202

#*An Analysis of Errors in Feature-Preserving Mesh Simplification Based on Edge Contraction.
#@Hongtao Xu,Timothy S. Newman
#year2006
#conf3DPVT
#citation1
#index4201
#arnetid4203
#!The Quadric Error Metric (QEM) [1] criterion has been widely applied in mesh simplification procedures. Related criteria--such as the Quasi-Covariance Error Metric (QCEM) [2], which may produce superior results to the QEM--have also been reported in recent years. In this paper, the underlying reasons that criteria such as QEM and QCEM are so successful in mesh simplification processes are considered through analysis of error in the simplification process. Focus is on the use of the QEM and QCEM criteria in edge contraction-based mesh simplification.

#*IBR-based compression for remote visualization.
#@Riccardo Bernardini,Guido M. Cortelazzo,Giampaolo Tormen
#year2002
#conf3DPVT
#citation4
#index4202
#arnetid4204

#*Analysis of Secondary Structure Elements of Proteins Using Indexing Techniques.
#@Concettina Guerra,Stefano Lonardi,Giuseppe Zanotti
#year2002
#conf3DPVT
#citation7
#index4203
#arnetid4205

#*Real-Time, Accurate Depth of Field using Anisotropic Diffusion and Programmable Graphics Cards.
#@Marcelo Bertalmío,Pere Fort,Daniel Sánchez-Crespo
#year2004
#conf3DPVT
#citation25
#index4204
#arnetid4206
#!Computer graphics cameras lack the finite Depth of Field (DOF) present in real world ones. This results in all objects being rendered sharp regardless of their depth, reducing the realism of the scene. On top of that, real-world DOF provides a depth cue, that helps the human visual system decode the elements of a scene. Several methods have been proposed to render images with finite DOF, but these have always implied an important trade-off between speed and accuracy. In this paper, we introduce a novel anisotropic diffusion Partial Differential Equation (PDE) that is applied to the 2D image of the scene rendered with a pin-hole camera. In this PDE, the amount of blurring on the 2D image depends on the depth information of the 3D scene, present in the Z-buffer. This equation is well posed, has existence and uniqueness results, and it is a good approximation of the optical phenomenon, without the visual artifacts and depth inconsistencies present in other approaches. Because both inputs to our algorithm are present at the graphics card at every moment, we can run the processing entirely in the GPU. This fact, coupled with the particular numerical scheme chosen for our PDE, allows for real-time rendering using a programmable graphics card.

#*Dynamically Optimised 3D (Virtual Reality) Data Transmission for Mobile Devices.
#@Markus Feißt,Andreas Christ
#year2004
#conf3DPVT
#citation2
#index4205
#arnetid4207
#!Nowadays the processing power of mobile phones, Smartphones and PDA's is increasing as well as the transmission bandwidth.Nevertheless there is still the need to reduce the content and the need of processing the data.Discussed will be proposals and solutions for dynamic reduction of the transmitted content.For that, device specific properties will be taken into account, as much as for the aim to reduce the need of processing power at the client side to be able to display the 3D (Virtual Reality) data.Therefore, well known technologies e.g. data compression are combined with new developed ideas to reach the goal of adaptive content transmission.To achieve a device dependent reduction of processing power the data have to be pre processed at the server side or the server even has to take over functionality of weak mobile devices.

#*Learning Illumination Models While Tracking.
#@Yilei Xu,Amit K. Roy Chowdhury
#year2006
#conf3DPVT
#citation0
#index4206
#arnetid4208
#!In this paper we present a method for estimation of 3D motion of a rigid object from a video sequence, while simultaneously learning the parameters of an illumination model that describe the lighting conditions under which the video was captured. This is achieved by alternately estimating motion and illumination parameters in a recently proposed mathematical framework for integrating the effects of motion, illumination and structure. The motion is represented in terms of translation and rotation of the object centroid, and the illumination is represented using a spherical harmonics linear basis. The method does not assume any model for the variation of the illumination conditions-lighting can change slowly or drastically, locally or globally. Also, it can be composed of combinations of point and extended sources. For multiple cameras viewing an object, we derive a new photometric constraint that relates the illumination parameters in two or more independent video sequences. This constraint allows verification of the illumination parameters obtained from multiple views and synthesis of new views under the same lighting conditions. We demonstrate the effectiveness of our algorithm in tracking under severe changes of lighting conditions.

#*VENUS Subsurface Ionosphere Radar Sounder: VENSIS.
#@D. Biccari,D. Calabrese,D. Gurnett,R. Huff,L. Marinangeli,R. Jordan,E. Nielsen,G. G. Ori,G. Picardi,J. Plaut,F. Provvedi,R. Seu,E. Zampolini
#year2004
#conf3DPVT
#citation0
#index4207
#arnetid4209
#!Due to optically opaque atmosphere, radar is the best way to observe the surface of Venus from orbit. Magellan has obtained global SAR imaging, as well as altimetry and emissivity. As a subsurface sounder, VENSIS would obtain fundamentally different kinds of geologic information than Magellan. Mapping of interfaces of geologic units (e.g. tessera, plains, lava flows, impact debris) could be extended into the third dimension. Reflectivity variations recorded at the surface by Magellan are likely to extend into subsurface, providing dielectric contrast at interfaces.

#*Human Action Recognition By Sequence of Movelet Codewords.
#@Xiaolin Feng,Pietro Perona
#year2002
#conf3DPVT
#citation35
#index4208
#arnetid4210

#*Fast and Robust Bore Detection in Range Image Data for Industrial Automation.
#@Georg Biegelbauer,Markus Vincze
#year2004
#conf3DPVT
#citation-1
#index4209
#arnetid4211
#!This paper presents a fast and robust method to precisely segment and locate bore holes of 4 to 50mm diameter. The task is solved by a robot moving a compact triangulation scanning sensor to all sides of the object and scanning the bore holes. Exploiting the knowledge about the expected bore diameter and bore pose makes it possible to develop highly robust algorithms for an industrial application. Sparse data of the bore hole is sufficient to segment the bore independent of bore hole chamfer type using a robust normal vector fit and a classification based on the Gaussian image. A sequential algorithm to fit the bore cylinder makes it possible to calculate the bore pose in less than 1 second. Experiments demonstrate that 120 degrees of the bore hole surface are sufficient for robust localization within 0.3mm and 0.5 degrees even in the presence of ghost points and notches in the bore holes.

#*Helmholtz Stereopsis on Rough and Strongly Textured Surfaces.
#@Jean-Yves Guillemaut,Ondrej Drbohlav,Radim Sára,John Illingworth
#year2004
#conf3DPVT
#citation8
#index4210
#arnetid4212
#!Helmholtz Stereopsis (HS) has recently been explored as a promising technique for capturing shape of objects with unknown reflectance. So far, it has been widely applied to objects of smooth geometry and piecewise uniform Bidirectional Reflectance Distribution Function (BRDF). Moreover, for non-convex surfaces the inter-reflection effects have been completely neglected. We extend the method to surfaces which exhibit strong texture, nontrivial geometry and are possibly non-convex. The problem associated with these surface features is that Helmholtz reciprocity is apparently violated when point-based measurements are used independently to establish the matching constraint as in the standard HS implementation. We argue that the problem is avoided by computing radiance measurements on image regions corresponding exactly to projections of the same surface point neighbourhood with appropriate scale. The experimental results demonstrate the success of the novel method proposed on real objects.

#*Ellipsoid decomposition of 3D-model.
#@Stephan Bischoff,Leif Kobbelt
#year2002
#conf3DPVT
#citation23
#index4211
#arnetid4213

#*Construction of Large-Scale Virtual Environment by Fusing Range Data, Texture Images, and Airborne Altimetry Data.
#@Conny Riani Gunadi,Hiroyuki Shimizu,Kazuya Kodama,Kiyoharu Aizawa
#year2002
#conf3DPVT
#citation9
#index4212
#arnetid4214

#*Accurate 3D Acquisition of Freely Moving Objects.
#@François Blais,Michel Picard,Guy Godin
#year2004
#conf3DPVT
#citation9
#index4213
#arnetid4215
#!This paper presents a new acquisition method for 3D laser scanners that combines imaging, fast geometrical object tracking, and automatic pose estimation to register range profiles of freely moving objects. The method was developed to solve the constraint of rigidity between free-moving objects and a 3D scanner while preserving the accuracy of the range measurements. Rigidity constraint imposes that a 3D scanner or any external positioning devices must be perfectly stable relative to the object during scanning. This is often impossible for moving structures such as when using scaffolding, industrial conveyers, or robotic arms. The method starts by creating a rough, partial, and distorted estimate of the model of the object from an initial subset of sparse range data. Then, it recursively improves and refines the model by adding new range information. In parallel, real-time tracking of the object is performed to center the scan on the object. A high-resolution and accurate 3D model of a free-floating object, and real-time tracking of its position is obtained.

#*Using Omnidirectional Structure from Motion for Registration of Range Images of Minimal Overlap.
#@Dinkar Gupta,Ankita Kumar,Kostas Daniilidis
#year2004
#conf3DPVT
#citation0
#index4214
#arnetid4216
#!In this paper, we propose a novel method of merging a series of range images with a minimal overlap between any two consecutive range images. We rigidly mount a parabolic catadioptric camera to the range scanner. Using two omniviews we are able to accurately estimate the relative displacement between two range views. The resultant motion is used for the registration of all range data to the same coordinate system. An additional perspective camera calibrated with respect to the scanner is used for texture mapping.

#*A Statistical Method for Robust 3D Surface Reconstruction from Sparse Data.
#@Volker Blanz,Albert Mehl,Thomas Vetter,Hans-Peter Seidel
#year2004
#conf3DPVT
#citation44
#index4215
#arnetid4217
#!General information about a class of objects, such as human faces or teeth, can help to solve the otherwise ill-posed problem of reconstructing a complete surface from sparse 3D feature points or 2D projections of points. We present a technique that uses a vector space representation of shape (3D Morphable Model) to infer missing vertex coordinates. Regularization derived from a statistical approach makes the system stable and robust with respect to noise by computing the optimal tradeoff between fitting quality and plausibility. We present a direct, non-iterative algorithm to calculate this optimum efficiently, and a method for simultaneously compensating unknown rigid transformations. The system is applied and evaluated in two different fields: (1) reconstruction of 3D faces at unknown orientations from 2D feature points at interactive rates, and (2) restoration of missing surface regions of teeth for CAD-CAM production of dental inlays and other medical applications.

#*Enhanced Vector Quantization for Data Reduction and Filtering.
#@Stefano Ferrari,Iuri Frosio,Vincenzo Piuri,N. Alberto Borghese
#year2004
#conf3DPVT
#citation0
#index4216
#arnetid4218
#!Modern automatic digitizers can sample huge amounts of 3D data points on the object surface in a short time. Point based graphics is becoming a popular framework to reduce the cardinality of these data sets and to filter measurement noise, without having to store in memory and process mesh connectivity. Main contribution of this paper is the introduction of soft clustering techniques in the field of point clouds processing. In this approach data points are not assigned to a single cluster, but they contribute in the determination of the position of several cluster centres. As a result a better representation of the data is achieved. In Soft clustering techniques, a data set is represented with a reduced number of points called Reference Vectors (RV), which minimize an adequate error measure. As the position of the RVs is determined by "learning", which can be viewed as an iterative optimization procedure, they are inherently slow. We show here how partitioning the data domain into disjointed regions called hyperboxes (HB), the computation can be localized and the computational time reduced to linear in the number of data points (O(N)), saving more than 75% on real applications with respect to classical soft-VQ solutions, making therefore VQ suitable to the task. The procedure is suitable for a parallel HW implementation, which would lead to a complexity sub-linear in N. An automatic procedure for setting the voxel side and the other parameters can be derived from the data-set analysis. Results obtained in the reconstruction of faces of both humans and puppets as well as on models from clouds of points made available on the WEB are reported and discussed in comparison with other available methods.

#*ShapeLab: A Unified Framework for 2D & 3D Shape Retrieval.
#@Jiantao Pu,Karthik Ramani
#year2006
#conf3DPVT
#citation-1
#index4217
#arnetid4219
#!2D or 3D shapes are the most important visual information that we use to recognize an object. We propose a unified framework "ShapeLab" to search similar 2D or 3D shapes from an existing database. Users can search 3D shapes with a 2D input, and vice versa. ShapeLab is composed of four key components: (1) pose determination for 3D models; (2) 2D orthogonal view generation based on multiple levels of detail; (3) similarity measurement between 2D shapes; and (4) freehand sketch-based user interface. Key algorithms supporting the above components are briefly described. Experiments show ShapeLab can provide a better performance such as high accuracy, flexibility and scalability compared to the available methods.

#*Online Surface Reconstruction from Unorganized 3D-Points for the DLR Hand-Guided Scanner System.
#@Tim Bodenmüller,Gerd Hirzinger
#year2004
#conf3DPVT
#citation28
#index4218
#arnetid4220
#!Hand-guided scanners allow for digitization by manually sweeping a laser beam over an object's surface. The result highly depends on the way the user handles the system and his ability to keep track of the parts of the surface that are already scanned. Processing and visualization during data acquisition are helpful in this context. In this paper, we propose an online surface reconstruction algorithm for the visualization of the DLR scanner system data. The algorithm successively generates a triangle mesh by incrementally inserting 3D points. Point neighborhoods are used to limit the point density, to estimate the surface normal at the inserted point, and to locally re-triangulate the mesh. A dynamic data structure for fast neighborhood search without restrictions to the amount of vertices or the object size and with low complexity is introduced. Finally, results with the hand-guided scanner system are presented.

#*Robust Structure from Motion under Weak Perspective.
#@Levente Hajder,Dmitry Chetverikov,István Vajk
#year2004
#conf3DPVT
#citation7
#index4219
#arnetid4221
#!It is widely known that, for the affine camera model, both shape and motion data can be factorized directly from the measurement matrix constructed from 2D image points coordinates. However, classical algorithms for Structure from Motion (SfM) are not robust: measurement outliers, that is, incorrectly detected or matched feature points can destroy the result. A few methods to robustify SfM have already been proposed. Different outlier detection schemes have been used. We examine an efficient algorithm by Trajkovic et al. [Robust recursive structure and motion recovery under affine projection] who use affine camera model and the Least Median of Squares (LMedS) method to separate inliers from outliers. LMedS is only applicable when the ratio of inliers exceeds 50%. We show that the Least Trimmed Squares (LTS) method is more efficient in robust SfM than LMedS. In particular, we demonstrate that LTS can handle inlier ratios below 50%. We also show that using the real (Euclidean) motion data results in a more precise SfM algorithm that using the affine camera model. Based on these observations, we propose a novel robust SfM algorithm and discuss its advantages and limits. The proposed method and the Trajkovicprocedure are quantitatively compared on synthetic data in different simulated situations. The methods are also tested on synthesized and real video sequences.

#*GPU-Assisted Z-Field Simplification.
#@Alexander Bogomjakov,Craig Gotsman
#year2004
#conf3DPVT
#citation3
#index4220
#arnetid4222
#!Height fields and depth maps which we collectively refer to as z-fields, usually carry a lot of redundant information and are often used in real-time applications. This is the reason why efficient methods for their simplification are necessary. On the other hand, the computation power and programmability of commodity graphics hardware has significantly grown. We present an adaptation of an existing real-time z-field simplification method for execution in graphics hardware. The main parts of the algorithm are implemented as fragment programs which run on the GPU. The resulting polygonal models are identical to the ones obtained by the original method. The main benefit is that the computation load is imposed on the GPU, freeing-up the CPU for other tasks. Additionally, the new method exhibits a performance improvement when compared to a pure CPU implementation.

#*Estimating the Principal Curvatures and the Darboux Frame from Real 3D Range Data.
#@Eyal Hameiri,Ilan Shimshoni
#year2002
#conf3DPVT
#citation42
#index4221
#arnetid4223

#*Tracking Densely Moving Markers.
#@N. Alberto Borghese,Paolo Rigiroli
#year2002
#conf3DPVT
#citation6
#index4222
#arnetid4224

#*Using Principal Curvatures and Darboux Frame to Recover 3D Geometric Primitives from Range Images.
#@Eyal Hameiri,Ilan Shimshoni
#year2002
#conf3DPVT
#citation5
#index4223
#arnetid4225

#*3D Shape Estimation Based on Density Driven Model Fitting.
#@Eugene Borovikov,Larry S. Davis
#year2002
#conf3DPVT
#citation6
#index4224
#arnetid4226

#*Multiple View Reconstruction of People.
#@Adrian Hilton,Jonathan Starck
#year2004
#conf3DPVT
#citation8
#index4225
#arnetid4227
#!This paper presents a unified framework for model-based and model-free reconstruction of people from multiple camera views in a studio environment. Shape and appearance of the reconstructed model are optimised simultaneously based on multiple view silhouette, stereo and feature correspondence. A priori knowledge of surface structure is introduced as regularisation constraints. Model-based reconstruction assumes a known generic humanoid model a priori, which is fitted to the multi-view observations to produce a structured representation for animation. Model-free reconstruction makes no priori assumptions on scene geometry allowing the reconstruction of complex dynamic scenes. Results are presented for reconstruction of sequences of people from multiple views. The model-based approach produces a consistent structured representation, which is robust in the presence of visual ambiguities. This overcomes limitations of existing visual-hull and stereo techniques. Model-free reconstruction allows high-quality novel view-synthesis with accurate reproduction of the detailed dynamics for hair and loose clothing. Multiple view optimisation achieves a visual quality comparable to the captured video without visual artefacts due to misalignment of images.

#*Blind Watermarking of 3D Shapes using Localized Constraints.
#@Adrian G. Bors
#year2004
#conf3DPVT
#citation13
#index4226
#arnetid4228
#!This paper develops a digital watermarking methodology for 3-D graphical objects defined by polygonal meshes. In watermarking or fingerprinting the aim is to embed a code in a given media without producing identifiable changes to it. One should be able to retrieve the embedded information even after the shape had suffered various modifications. Two blind watermarking techniques applying perturbations onto the local geometry for selected vertices are described in this paper. The proposed methods produce localized changes of vertex locations that do not alter the mesh topology. A study of the effects caused by vertex location modification is provided for a general class of surfaces. The robustness of the proposed algorithms is tested at noise perturbation and object cropping.

#*Tele-3D - Developing a Handheld Scanner Using Structured Light Projection.
#@João Filipe Ferreira,Jorge Lobo,Jorge Dias
#year2002
#conf3DPVT
#citation4
#index4227
#arnetid4229

#*Acquisition, Modelling and Rendering of Very Large Urban Environments.
#@G. Boström,M. Fiocco,D. Puig,A. Rossini,João G. M. Gonçalves,Vítor Sequeira
#year2004
#conf3DPVT
#citation13
#index4228
#arnetid4230
#!In this paper we describe a vehicle borne data acquisition system for urban environments and associated 3D data management and interactive rendering software. The data acquisition system is capable of acquire 3D data from urban areas with centimetre resolution including automatic capturing of colour. The system includes a management and interactive rendering software which is designed to cope with the huge quantities of data generated by the acquisition system. It uses out-of-core pre-processing to transform data into octrees. Real-time interactive rendering is achieved by using novel techniques such as front-to-back octree traversal, occlusion query and speculative pre-fetching. The paper presents the results of the described techniques applied to large public areas including the City Centre of Verona, Italy.

#*From 3D Shape Capture to Animated Models.
#@Adrian Hilton,Jonathan Starck,Gordon Collins
#year2002
#conf3DPVT
#citation29
#index4229
#arnetid4231

#*Neuroanatomical Imaging: Constrained 3D Reconstruction Using Variational Implicit Techniques.
#@Jean-Marie Bouteiller,Michel Baudry
#year2002
#conf3DPVT
#citation1
#index4230
#arnetid4232

#*Real-Time Speech-Driven 3D Face Animation.
#@Pengyu Hong,Zhen Wen,Thomas S. Huang,Heung-Yeung Shum
#year2002
#conf3DPVT
#citation8
#index4231
#arnetid4233

#*Some Unusual Ways of Visually Sensing 3D Shapes.
#@Vladimir Brajovic
#year2004
#conf3DPVT
#citation0
#index4232
#arnetid4234

#*User-Controlled Simplification of Polygonal Models.
#@Muhammad Hussain,Yoshihiro Okada,Koichi Niijima
#year2004
#conf3DPVT
#citation2
#index4233
#arnetid4235
#!Polygonal Models are ubiquitous in Computer Graphics but their real time manipulation and rendering especially in interactive application environments have become a threat because of their huge sizes and complexity. A whole family of automatic algorithms emerged during the last decade to help out this problem, but they reduce the complexity of the models uniformly without caring about semantic importance of localized parts of a mesh. Only a few algorithms deal with adaptive simplification of polygonal models. We propose a new model for user-driven simplification exploiting the simplification hierarchy and hypertriangulation model [A resolution modeling system] that lends a user the most of the functionalities of existing adaptive simplification algorithms in one place and is quite simple to implement. The proposed new underlying data structures are compact and support real time navigation across continuous LODs of a model; any desirable LOD can be extracted efficiently and can further be fine-tuned. The proposed model for adaptive simplification supports two key operations for selective refinement and selective simplification; their effect has been shown on various polygonal models. Comparison with related work shows that the proposed model provides combined environment at reduced overhead of memory space usage and faster running times.

#*Non-Rigid Range-Scan Alignment Using Thin-Plate Splines.
#@Benedict J. Brown,Szymon Rusinkiewicz
#year2004
#conf3DPVT
#citation25
#index4234
#arnetid4236
#!We present a non-rigid alignment algorithm for aligning high-resolution range data in the presence of low-frequency deformations, such as those caused by scanner calibration error. Traditional iterative closest points (ICP) algorithms, which rely on rigid-body alignment, fail in these cases because the error appears as a non-rigid warp in the data. Our algorithm combines the robustness and efficiency of ICP with the expressiveness of thin-plate splines to align high-resolution scanned data accurately, such as scans from the Digital Michelangelo Project [The Digital Michelangelo Project: 3-D scanning of large statues]. This application is distinguished from previous uses of the thin-plate spline by the fact that the resolution and size of warping are several orders of magnitude smaller than the extent of the mesh, thus requiring especially precise feature correspondence.

#*Shape Distortion Analysis of the Shape-from-Shading Algorithm Using Jacobi Iterative Method.
#@Osamu Ikeda
#year2002
#conf3DPVT
#citation1
#index4235
#arnetid4237

#*Metrological Analysis of a Procedure for the Automatic 3D Modeling of Dental Plaster Casts.
#@Nicola Brusco,Simone Carmignato,Marco Andreetto,Guido Maria Cortelazzo
#year2004
#conf3DPVT
#citation5
#index4236
#arnetid4238
#!As well known, in the reconstruction of the 3D models through optical systems, the errors are due to the single-view acquisition error and to the 3D modeling procedure. The latter can be ascribed to the various phases of the 3D modeling pipeline: pairwise registration, global registration, surface integration. This work examines the acquisition error as well as the errors due to an automatic procedure recently proposed for the 3D modeling of dental plaster casts. This contribution derives a simple error propagation model, rather useful for practical simulation purposes. From a general viewpoint, this contribution proposes a useful simulation of error propagation in 3D modeling, it shows the quality of an automatic 3D modeling procedure recently proposed and it shows the accuracy of 3D modeling dental plaster casts by current commercial range cameras and the considered automatic method.

#*Mathematical Aspects of Shape Reconstruction from an Image Sequence.
#@Atsushi Imiya,Kazuhiko Kawamoto
#year2002
#conf3DPVT
#citation3
#index4237
#arnetid4239

#*Spherical Diffusion for 3D Surface Smoothing.
#@Thomas Bülow
#year2002
#conf3DPVT
#citation51
#index4238
#arnetid4240
#%135208
#%593241
#%835233
#%834732
#%594027
#%1032445
#%1031954
#%640394
#!A diffusion-based approach to surface smoothing is presented. Surfaces are represented as scalar functions defined on the sphere. The approach is equivalent to Gaussian smoothing on the sphere and is computationally efficient since it does not require iterative smoothing. Furthermore, it does not suffer from the well-known shrinkage problem. Evolution of important shape features (parabolic curves) under diffusion is demonstrated. A nonlinear modification of the diffusion process is introduced in order to improve smoothing behavior of elongated and poorly centered objects.

#*Coding with ASCII: compact, yet text-based 3D content.
#@Martin Isenburg,Jack Snoeyink
#year2002
#conf3DPVT
#citation8
#index4239
#arnetid4241

#*Realistic Models of Children Heads from 3D-MRI Segmentation and Tetrahedral Mesh Construction.
#@Jasmine Burguet,Najib Gadi,Isabelle Bloch
#year2004
#conf3DPVT
#citation8
#index4240
#arnetid4242
#!In order to analyze the sensitivity of children to RF fields and mobile phones in particular, the SAR (Specific Absorption Ratio) defined as the power absorbed by a unit of mass of tissues (W/kg) should be computed based on a numerical model of the head.We propose to build realistic models from 3D-MRI of children heads.The method is composed of two steps. The first one consists in segmenting the main tissues in these images (skin, fat, muscles, cortical and marrow bones, cerebrospinal fluid, grey and white matter, blood, etc).The segmentation is based on mathematical morphology methods which are well adapted to this aim and provide a robust and automatic method requiring minimum user intervention.Using simplified segmented images, the second step concerns the tetrahedral mesh generation.Our method uses almost regular meshes and topological tools to preserve the topological arrangement of the head tissues.A method to guarantee a good geometrical quality is also provided.

#*Theoretical Accuracy Analysis of N-Ocular Vision Systems for Scene Reconstruction, Motion Estimation, and Positioning.
#@Pezhman Firoozfam,Shahriar Negahdaripour
#year2004
#conf3DPVT
#citation7
#index4241
#arnetid4243
#!Theoretical models are derived to analyze the accuracy of N-Ocular vision systems for scene reconstruction, motion estimation and self positioning. Covariance matrices are given to estimate the uncertainty bounds for the reconstructed points in 3-D space, motion parameters, and 3-D position of the vision system. Simulation results of various experiments, based on synthetic and real data acquired with a 12-camera stereo panoramic imaging system, are given to demonstrate the application of these models, as well as to evaluate the performance of the panoramic system for high-precision 3-D mapping and positioning.

#*Local Approximate 3D Matching of Proteins in Viral Cryo-EM Density Maps.
#@Stefan Burkhardt,Kimmo Fredriksson,Tuomas Ojamies,Janne Ravantti,Esko Ukkonen
#year2004
#conf3DPVT
#citation0
#index4242
#arnetid4244
#!Experimental structure analysis of biological molecules (e.g, proteins) or macromolecular complexes (e.g, viruses) can be used to generate three-dimensional density maps of these entities. Such a density map can be viewed as a three-dimensional gray-scale image where space is subdivided in voxels of a given size. The focus of this paper is the analysis of virus density maps. The hull of a virus consists of many copies of one or several different proteins. An important tool for the study of viruses is cryo-electron microscopy (cryo-EM), a technique with insufficient resolution to directly determine the arrangement of the proteins in the virus. We therefore created a tool that locates proteins in the three-dimensional density map of a virus. The goal is to fully determine the locations and orientations of the protein(s) in the virus given the virus' three-dimensional density map and a database of density maps of one or more protein candidates.

#*Stochastic Mesh-Based Multiview Reconstruction.
#@John Isidoro,Stan Sclaroff
#year2002
#conf3DPVT
#citation14
#index4243
#arnetid4245

#*An Experimental Comparison of Feature-Based 3D Retrieval Methods.
#@Benjamin Bustos,Daniel A. Keim,Dietmar Saupe,Tobias Schreck,Dejan V. Vranic
#year2004
#conf3DPVT
#citation23
#index4244
#arnetid4246
#!3D objects are an important type of multimedia data with many promising application possibilities. Defining the aspects that constitute the similarity among 3D objects, and designing algorithms that implement such similarity definitions is a difficult problem. Over the last few years, a strong interest in methods for feature-based 3D similarity search has arisen, and a growing number of competing algorithms for content-based retrieval of 3D objects have been proposed. We present an extensive experimental evaluation of the retrieval effectiveness and efficiency of a large part of the current state-of-the-art feature-based methods for 3D similarity search, giving a contrasting assessment of the different approaches.

#*Neural Mesh Ensembles.
#@Ioannis P. Ivrissimtzis,Yunjin Lee,Seungyong Lee,Won-Ki Jeong,Hans-Peter Seidel
#year2004
#conf3DPVT
#citation8
#index4245
#arnetid4247
#!This paper proposes the use of neural network ensembles to boost the performance of a neural network based surface reconstruction algorithm. Ensemble is a very popular and powerful statistical technique based on the idea of averaging several outputs of a probabilistic algorithm. In the context of surface reconstruction, two main problems arise. The first is finding an efficient way to average meshes with different connectivity, and the second is tuning the parameters for surface reconstruction to maximize the performance of the ensemble. We solve the first problem by voxelizing all the meshes on the same regular grid and taking majority vote on each voxel. We tune the parameters experimentally, borrowing ideas from weak learning methods.

#*Weaver, an automatic texture builder.
#@Marco Callieri,Paolo Cignoni,Claudio Rocchini,Roberto Scopigno
#year2002
#conf3DPVT
#citation5
#index4246
#arnetid4248

#*From the Lab to the Silver Screen: Computer Vision and the Art of Special Effects.
#@Andrew W. Fitzgibbon
#year2004
#conf3DPVT
#citation0
#index4247
#arnetid4249

#*RoboScan: An Automatic System for Accurate and Unattended 3D Scanning.
#@Marco Callieri,Andrea Fasano,Gaetano Impoco,Paolo Cignoni,Roberto Scopigno,G. Parrini,Giuseppe Biagini
#year2004
#conf3DPVT
#citation26
#index4248
#arnetid4250
#!We describe an automatic system for fast unattended acquisition of accurate and complete 3D models, called RoboScan. The design goal is to reduce the three main bottlenecks in human-assisted 3D scanning: the selection of the range maps to be taken (view planning), the positioning of the scanner in the environment, and the range maps' alignment. The system is designed around a commercial laser-based 3D scanner moved by a robotic arm. The acquisition session is organised in two stages. First, an initial sampling of the surface is performed by the automatic selection of a set of views. Then, some added views are automatically selected, acquired and merged to the initial set in order to fill the surface regions left unsampled. Both the initial set of range maps and the subsequently added ones are post-processed automatically, by using the known scanner positions to initialise the alignment phase. Results of the assessment of the system on real acquisitions are presented and discussed.

#*Computational Experiments with Area-Based Stereo for Image-Based Rendering.
#@Ebroul Izquierdo
#year2002
#conf3DPVT
#citation1
#index4249
#arnetid4251

#*Optimal and Near - Optimal Solutions for 3D Structure Comparisons.
#@Alberto Caprara,Giuseppe Lancia
#year2002
#conf3DPVT
#citation2
#index4250
#arnetid4252

#*Photo-Consistency Based Registration of an Uncalibrated Image Pair to a 3D Surface Model Using Genetic Algorithm.
#@Zsolt Jankó,Dmitry Chetverikov
#year2004
#conf3DPVT
#citation13
#index4251
#arnetid4253
#!We consider the following data fusion problem. A 3D object with textured Lambertian surface is measured and independently photographed. A triangulated model of the object and two uncalibrated images are obtained. The goal is to precisely register the images to the model. Solving this problem is necessary for building a geometrically accurate, photorealistic model from laser-scanned 3D data and high quality images. Recently, we have proposed a novel method that generalises the photo-consistency approach by Clarkson et al. [Using photo-consistency to register 2D optical images of the human face to a 3D surface model] to the case of uncalibrated cameras, when both intrinsic and extrinsic parameters are unknown. This gives a user the freedom of taking the pictures by a conventional digital camera, from arbitrary positions and with varying zoom. The method is based on manual pre-registration followed by a genetic optimisation algorithm. A brief description of the pilot version of the method [Precise registration of an uncalibrated image pair to a 3D surface model] has been given together with the results of a few initial tests. In this paper, we report on some new significant developments in this project. The critical issue of robustness against illumination changes is addressed and various colour representations and cost functions are tested and compared. Natural constraints are introduced and experimentally validated to simplify the camera model and accelerate the algorithm. Finally, we present synthetic and real data with ground truth, apply the improved method to the data and measure the quality of the results.

#*Multiresolution Approach to Three-Dimensional Stereo Vision.
#@Guy Caspary,Yehoshua Y. Zeevi
#year2002
#conf3DPVT
#citation3
#index4252
#arnetid4254

#*An Approach to Using Image-Based Techniques across Unreliable Peer-to-Peer Networks.
#@Emmanuel Jay,Paul F. Lister,Martin White
#year2002
#conf3DPVT
#citation0
#index4253
#arnetid4255

#*Acquiring Height Maps of Faces from a Single Image.
#@Mario Castelán,Edwin R. Hancock
#year2004
#conf3DPVT
#citation10
#index4254
#arnetid4256
#!In this paper we explore how to improve the quality of the height map recovered from faces using shape-from-shading. One of the problems with reliable face surface reconstruction using shape-from-shading is that local errors in the needle map can cause implosion of facial features, and in particular the nose. To overcome this problem in this paper we develop a method for ensuring surface convexity. This is done by modifying the gradient orientations in accordance with critical points on the surface. We utilize a local shape indicator as a criteria to decide which surface normals are to be modified. Experiments show that altering the directions of a surface normal field of a face leads to a considerable improvement in its integrated height map.

#*Towards Urban 3D Reconstruction from Video.
#@Amir Akbarzadeh,Jan-Michael Frahm,Philippos Mordohai,Brian Clipp,Chris Engels,David Gallup,Paul Merrell,M. Phelps,Sudipta N. Sinha,B. Talton,Liang Wang,Qingxiong Yang,Henrik Stewénius,Ruigang Yang,Greg Welch,Herman Towles,David Nistér,Marc Pollefeys
#year2006
#conf3DPVT
#citation86
#index4255
#arnetid4257
#!The paper introduces a data collection system and a processing pipeline for automatic geo-registered 3D reconstruction of urban scenes from video. The system collects multiple video streams, as well as GPS and INS measurements in order to place the reconstructed models in geo-registered coordinates. Besides high quality in terms of both geometry and appearance, we aim at real-time performance. Even though our processing pipeline is currently far from being real-time, we select techniques and we design processing modules that can achieve fast performance on multiple CPUs and GPUs aiming at real-time performance in the near future. We present the main considerations in designing the system and the steps of the processing pipeline. We show results on real video sequences captured by our system.

#*Improving Environment Modelling by Edge Occlusion Surface Completion.
#@Umberto Castellani,Salvatore Livatino,Robert B. Fisher
#year2002
#conf3DPVT
#citation19
#index4256
#arnetid4258

#*Visual Data Navigators "Collaboratories".
#@Mikael Jern,S. Palmberg,M. Ranlöf
#year2002
#conf3DPVT
#citation2
#index4257
#arnetid4259

#*View Dependence of 3D Recovery from Folded Pictures and Warped 3D Faces.
#@J. Patrick Cavanagh,Michael von Grünau,Lee Zimmerman
#year2004
#conf3DPVT
#citation-1
#index4258
#arnetid4260
#!In a popular visual illusion, the portrait on paper currency is folded into an M shape along vertical lines through the nose and the eyes. When this folded picture is tilted back and forth horizontally the face undergoes striking changes in expression. This distortion reveals two insights concerning 3D representation in the human visual system and we have explored these with experiments on simple schematic faces and observations on distortions of laser range images of faces. The observations show first that when recovering depicted depth, pictorial cues are interpreted independently of binocular depth information and second, that the recovery of facial expression is based on a scaled prototypical face structure.

#*Variational Multiframe Stereo in the Presence of Specular Reflections.
#@Hailin Jin,Anthony J. Yezzi,Stefano Soatto
#year2002
#conf3DPVT
#citation31
#index4259
#arnetid4261

#*A Depth Map Representation for Real-Time Transmission and View-Based Rendering of a Dynamic 3D Scene.
#@Bing-Bing Chai,Sriram Sethuraman,Harpreet S. Sawhney
#year2002
#conf3DPVT
#citation12
#index4260
#arnetid4262

#*Probabilistic 3D Data Fusion for Adaptive Resolution Surface Generation.
#@Andrew E. Johnson,Roberto Manduchi
#year2002
#conf3DPVT
#citation2
#index4261
#arnetid4263

#*3D Shape Registration using Regularized Medial Scaffolds.
#@Ming-Ching Chang,Frederic F. Leymarie,Benjamin B. Kimia
#year2004
#conf3DPVT
#citation15
#index4262
#arnetid4264
#!This paper proposes a novel method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods are based on the Iterative Closest Point (ICP) algorithm, which requires an initial alignment close to the globally optimal solution to ensure convergence to a valid solution. Furthermore, it can also fail when there are points in one dataset with no corresponding matches in the other dataset. The proposed method automatically finds an initial alignment close to the global optimal by using the medial structure of the datasets. For this purpose, we first compute the medial scaffold of a 3D dataset: a 3D graph made of special shock curves linking special shock nodes. This medial scaffold is then regularized exploiting the known transitions of the 3D medial axis under deformation or perturbation of the input data. The resulting simplified medial scaffolds are then registered using a modified graduated assignment graph matching algorithm. The proposed method shows robustness to noise, shape deformations, and varying surface sampling densities.

#*A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration.
#@Timothée Jost,Heinz Hügli
#year2002
#conf3DPVT
#citation33
#index4263
#arnetid4265

#*Super High Resolution 3D Imaging and Efficient Visualization.
#@L. Irene Cheng,Anup Basu
#year2002
#conf3DPVT
#citation-1
#index4264
#arnetid4266

#*Applying Mesh Conformation on Shape Analysis with Missing Data.
#@Xiangyang Ju,Zhili Mao,J. Paul Siebert,Nigel J. B. McFarlane,Jiahua Wu,Robin D. Tillett
#year2004
#conf3DPVT
#citation5
#index4265
#arnetid4267
#!A mesh conformation approach that makes use of deformable generic meshes has been applied to establishing correspondences between 3D shapes with missing data.Given a group of shapes with correspondences, we can build up a statistical shape model by applying principal component analysis (PCA). The conformation at first globally maps the generic mesh to the 3D shape based on manually located corresponding landmarks, and then locally deforms the generic mesh to clone the 3D shape.The local deformation is constrained by minimizing the energy of an elastic model.An algorithm was also embedded in the conformation process to fill missing surface data of the shapes.Using synthetic data, we demonstrate that the conformation preserves the configuration of the generic mesh and hence it helps to establish good correspondences for shape analysis.Case studies of the principal component analysis of shapes were presented to illustrate the successes and advantages of our approach.

#*Adaptive Online Transmission of 3D TexMesh Using Scale-Space Analysis.
#@L. Irene Cheng,Pierre Boulanger
#year2004
#conf3DPVT
#citation2
#index4266
#arnetid4268

#*Wavelet Coding of Structured Geometry Data Considering Rate-Distortion Properties.
#@Tetsu Kajita,Hiroyuki Kaneko,Koichi Fukuda,Akira Kawanaka
#year2002
#conf3DPVT
#citation0
#index4267
#arnetid4269

#*Reliability and Judging Fatigue Reduction in 3D Perceptual Quality Estimation.
#@L. Irene Cheng,Anup Basu
#year2004
#conf3DPVT
#citation-1
#index4268
#arnetid4270

#*Content-Based Image Retrieval from Large Medical Databases.
#@Avi Kak,Christina Pavlopoulou
#year2002
#conf3DPVT
#citation16
#index4269
#arnetid4271

#*Markerless Human Motion Transfer.
#@German K. M. Cheung,Simon Baker,Jessica K. Hodgins,Takeo Kanade
#year2004
#conf3DPVT
#citation-1
#index4270
#arnetid4272
#!In this paper we develop a computer vision-based system to transfer human motion from one subject to another. Our system uses a network of eight calibrated and synchronized cameras. We first build detailed kinematic models of the subjects based on our algorithms for extracting shape from silhouette across time [A 3D reconstruction algorithm combining shape-frame-shilhouette]. These models are then used to capture the motion (joint angles) of the subjects in new video sequences. Finally we describe an image-based rendering algorithm to render the captured motion applied to the articulated model of another person. Our rendering algorithm uses an ensemble of spatially and temporally distributed images to generate photo-realistic video of the transferred motion. We demonstrate the performance of the system by rendering throwing and kungfu motions on subjects who did not perform them.

#*Topology and Geometry of Unorganized Point Clouds.
#@George Kamberov,Gerda Kamberova
#year2004
#conf3DPVT
#citation8
#index4271
#arnetid4273
#!We present a new method for defining neighborhoods, and assigning principal curvature frames, and mean and Gauss curvatures to the points of an unorganized oriented point-cloud. The neighborhoods are estimated by measuring implicitly the surface distance between points. The 3D shape recovery is based on conformal geometry, works directly on the cloud, does not rely on the generation of polygonal, or smooth models. Test results on publicly available synthetic data, as ground truth, demonstrate that the method compares favorably to the established approaches for quantitative 3D shape recovery. The proposed method is developed to serve applications involving point based rendering and reliable extraction of differential properties from noisy unorganized point-clouds.

#*A Content-Based Retrieval System with a Customizeable 3D Output Visualizer.
#@Gianluigi Ciocca,Raimondo Schettini
#year2002
#conf3DPVT
#citation-1
#index4272
#arnetid4274

#*Octree-based Fusion of Shape from Silhouette and Shape from Structured Light.
#@Martin Kampel,Srdan Tosovic,Robert Sablatnig
#year2002
#conf3DPVT
#citation7
#index4273
#arnetid4275

#*Uncalibrated 3 metric reconstruction and flattened texture acquisition from a single view of a surface of revolution.
#@Carlo Colombo,Alberto Del Bimbo,Federico Pernici
#year2002
#conf3DPVT
#citation12
#index4274
#arnetid4276

#*Inpainting from Multiple Views.
#@Sung Ha Kang,Tony F. Chan,Stefano Soatto
#year2002
#conf3DPVT
#citation30
#index4275
#arnetid4277

#*Face Recognition from 3D Data using Iterative Closest Point Algorithm and Gaussian Mixture Models.
#@Jamie Cook,Vinod Chandran,Sridha Sridharan,Clinton Fookes
#year2004
#conf3DPVT
#citation32
#index4276
#arnetid4278
#!A new approach to face verification from 3D data is presented. The method uses 3D registration techniques designed to work with resolution levels typical of the irregular point cloud representations provided by Structured Light scanning. Preprocessing using a-priori information of the human face and the Iterative Closest Point algorithm are employed to establish correspondence between test and target and to compensate for the non-rigid nature of the surfaces. Statistical modelling in the form of Gaussian Mixture Models is used to parameterise the distribution of errors in facial surfaces after registration and is employed to differentiate between intra- and extra-personal comparison of range images. An Equal Error Rate of 2.67% was achieved on the 30 subject manual subset of the the 3d_rma database.

#*Entire Model Acquisition System using Handheld 3D Digitizer.
#@Hiroshi Kawasaki,Ryo Furukawa
#year2004
#conf3DPVT
#citation2
#index4277
#arnetid4279
#!In this paper, a real-time, handheld 3D model acquisition system consisting of a laser projector, a video camera and a turntable is described. The user projects a stripe of light at the 3D object by hand while rotating the object on a turntable. The projected light and LED markers attached to the laser projector and turntable are captured by the video camera. By estimating the 3D orientation of the laser projector and the turntable angle from the 2D locations of the markers, the 3D location of the surface lit by the laser can be calculated. In addition, post-processing algorithms for refining the estimated 3D data have been proposed. The algorithm not only improves the accuracy of the 3D measurement, but also achieves to decrease the number of LEDs for 3D data estimation; therefore, it significantly improves the userýs convenience in scanning the object. With this system, users can measure an entire 3D object in real-time.

#*3D Effect Generation from Monocular View.
#@Salvatore Curti,Daniele Sirtori,Filippo Vella
#year2002
#conf3DPVT
#citation6
#index4278
#arnetid4280

#*Synthetic Image of Multiresolution Sketch Leads to New Features.
#@Georgii Khachaturov,Rafael Moncayo-Muños
#year2004
#conf3DPVT
#citation-1
#index4279
#arnetid4281
#!A new approach to construction of robust features is proposed and applied to an instance of the correspondence problem. The main idea is to construct a synthetic image by a multiresolution sketch (MS) of an image and involve it into extraction of the invariants. The MS is constructed by processing the image with a scalable detector of the semi-local 1D-elements. Then, a synthetic image is constructed with all elements of the MS. Local maxima of the first and second derivatives of the synthetic image along discrete curves of the MS lead to some singular elements represented by the points of a 4D manifold. It turns out that a representative subset of the singular elements is stable. To prove that, the pair-wise correspondence between subsets of singular elements of two shots of a film was established experimentally by a consistency technique, which, unlike past approaches, does not involve epipolar constraints.

#*Hierarchical 3D Surface Reconstruction based on Radial Basis Functions.
#@Paola Dalmasso,Roberto Nerino
#year2004
#conf3DPVT
#citation2
#index4280
#arnetid4282
#!Volumetric methods based on implicit surfaces are commonly used in surface reconstruction from uniformly distributed sparse 3D data. The case of non-uniform distributed data has recently deserved more attention, because it occurs frequently in practice. This paper describes a volumetric approach to surface reconstruction from non-uniform data which is suitable for the reconstruction of surfaces from images, in particular from multiple views. Differently from volumetric methods which use both 3D surface points and surface normals, the approach does not use the surface normals because they are often unreliable when estimated from image data. The method is based on a hierarchical partitioning of the volume data set. The working volume is split and classified at different scales of spatial resolution into surface, internal and external voxels and this hierarchy is described by an octree structure in a multiscale framework. The octree structure is used to build a multiresolution description of the surface by means of compact support radial basis functions (RBF). A hierarchy of surface approximations at different levels of details is built by representing the voxels at the same octree level as RBF of similar spatial support. At each scale, information related to the reconstruction error drives the reconstruction process at the following finer scale. Preliminary results on synthetic data and future perspectives are presented.

#*Shape Matching using the 3D Radon Transform.
#@Petros Daras,Dimitrios Zarpalas,Dimitrios Tzovaras,Michael G. Strintzis
#year2004
#conf3DPVT
#citation9
#index4281
#arnetid4283
#!In this paper a novel method for 3D model content-based search and retrieval based on the 3D Radon Transform and a querying-by-3D-model approach, is presented. Descriptors are extracted using the 3D Radon Transform and applying a set of functionals on the transform coefficients. Similarity measures are then created for the extracted descriptors and introduced into a 3D model-matching algorithm. This results to a very fast and accurate matching method. Experiments were performed using two different databases and comparing the proposed method with others. Experimental results show that the proposed method can be used for 3D model search and retrieval in a highly efficient manner.

#*Archiving Technology for Plant Inspection Images Captured by Mobile Active Cameras - 4D Visible Memory.
#@Nobuyuki Kita,Yasuyo Kita,Hai-quan Yang
#year2002
#conf3DPVT
#citation0
#index4282
#arnetid4284

#*Filling Holes in Complex Surfaces using Volumetric Diffusion.
#@James Davis,Stephen R. Marschner,Matt Garr,Marc Levoy
#year2002
#conf3DPVT
#citation261
#index4283
#arnetid4285

#*Robust Concealment for Erroneous Block Bursts in Stereoscopic Images.
#@Sebastian Knorr,Carsten Clemens,Matthias Kunter,Thomas Sikora
#year2004
#conf3DPVT
#citation11
#index4284
#arnetid4286
#!With the increasing number of image communication applications especially in the low complexity domain, error concealment has become a very important field of research. Since many compression standards for images and videos are block-based a lot of methods were applied to conceal block losses in monocular images. The fast progress of capture, representation and display technologies for 3D image data advances the efforts on 3D concealment strategies. Because of their psycho-visual characteristics, stereoscopic images have to fulfill a very high quality demand. We propose an algorithm that makes use of the redundancies between two views of a stereo image pair. In many cases erroneous block bursts occur and can be highly disturbing, thus we will mainly concentrate on these errors. In addition, we focused on the quality assessment of several error concealment strategies. Beside the objective evaluation measures, we carried out a subjective quality test following the DSCQS methodology as proposed by MPEG. The results of this test demonstrate the efficiency of our approach.

#*Fast Landmark-Based Registration via Deterministic and Efficient Processing, Some Preliminary Results.
#@Fred W. DePiero
#year2002
#conf3DPVT
#citation5
#index4285
#arnetid4287

#*Texture at the Terminator.
#@Jan J. Koenderink,Sylvia C. Pont
#year2002
#conf3DPVT
#citation2
#index4286
#arnetid4288

#*Using 3D-Bresenham for Resampling Structured Grids.
#@Leonid I. Dimitrov,Milos Srámek
#year2004
#conf3DPVT
#citation2
#index4287
#arnetid4289
#!Structured grids and some of their applications in natural sciences are discussed. The problem of their visualization and quantitative evaluation is considered and possible ways for itssolution sketched. Resampling a structured grid onto a regular one is such a possible solution offering the additional benefit of enabling quantitative evaluations, too. This resampling is achieved by a preliminary tetrahedronization of the structured grid(s)and a subsequent digitalization of the constituent tetrahedrons using an adaptation of the 3D-Bresenham algorithm. Advantages and disadvantages of this approach as compared to other possible schemes are discussed. An implementation based on our open source f3d-file format for storage and transmission of volumetric data is presented, and results from applying it to real-world data shown.

#*Interactive Walkthroughs using "Morphable 3D-Mosaics".
#@Nikos Komodakis,George Pagonis,George Tziritas
#year2004
#conf3DPVT
#citation4
#index4288
#arnetid4290
#!This paper presents a hybrid (geometry- & image-based) technique suitable for providing interactive walkthroughs of large, complex outdoor scenes. Motion is restricted along a smooth predefined path and the input to the system is a sparse set of stereoscopic views at certain points (key-positions) along that path (one view per position). An approximate local 3D model is constructed from each view, capable of capturing photometric and geometric properties of the scene only locally. Then during the rendering process, a continuous morphing (both photometric & geometric) takes place between successive local 3D models, using what we call a "morphable 3D-model". The morphing proceeds in a physically-valid way. For this reason, a wide-baseline image matching technique is proposed, handling cases where the wide baseline between the two images is mainly due to a looming of the camera. Our system can be extended in the event of multiple stereoscopic views (and therefore multiple local models) per key-position of the path (related by a camera rotation). In that case one local 3D-mosaic (per key-position) is constructed comprising all local 3D models therein and a "morphable 3D-mosaic" is used during the rendering process. A partial-differential equation is adopted to handle the problem of geometric consistency of each 3D-mosaic.

#*Color, Fusion, and Stereopsis.
#@A. Dobbins
#year2004
#conf3DPVT
#citation0
#index4289
#arnetid4291

#*A Graph Cut based Adaptive Structured Light Approach for Real-Time Range Acquisition.
#@Thomas P. Koninckx,Indra Geys,Tobias Jaeggli,Luc J. Van Gool
#year2004
#conf3DPVT
#citation21
#index4290
#arnetid4292
#!This paper describes a new algorithm that yields dense range maps in real-time.Reconstruction are based on a single frame structured light illumination.On-the-fly adaptation of the projection pattern renders the system more robust against scene variability. A continuous trade off between speed and quality is made. The correspondence problem is solved by using geometric pattern coding in combination with sparse color coding. Only local spatial and temporal continuity are assumed. This allows to construct a neighbor relationship within every frame and to track correspondences over time.All cues are integrated in one consistent labeling.This is achieved by reformulating the problem as a graph cut.Every cue is weighted based on its average consistency with the result within a small time window.Integration and weighting of additional cues is straightforward. The correctness of the range maps is not guaranteed, but an estimation of the uncertainty is provided for each part of the reconstruction.Our prototype is implemented using unmodified consumer hardware only.Frame rates vary between 10 and 25fps dependent on scene complexity.

#*3D Volume Extraction and Mesh Generation Using Energy Minimization Techniques.
#@A. Doi,S. Fujiwara,K. Matsuda,M. Kameda
#year2002
#conf3DPVT
#citation-1
#index4291
#arnetid4293

#*Multi-Spectral Stereo Image Matching using Mutual Information.
#@Clinton Fookes,Anthony J. Maeder,Sridha Sridharan,Jamie Cook
#year2004
#conf3DPVT
#citation6
#index4292
#arnetid4294
#!Mutual information (MI) has shown promise as an effective stereo matching measure for images affected by radiometric distortion. This is due to the robustness of MI against changes in illumination. However, MI-based approaches are particularly prone to the generation of false matches due to the small statistical power of the matching windows. Consequently, most previous MI approaches utilise large matching windows which smooth the estimated disparity field. This paper proposes extensions to MI-based stereo matching in order to increase the robustness of the algorithm. Firstly, prior probabilities are incorporated into the MI measure in order to considerably increase the statistical power of the matching windows. These prior probabilities, which are calculated from the global joint histogram between the stereo pair, are tuned to a two level hierarchical approach. A 2D match surface, in which the match score is computed for every possible combination of template and matching window, is also utilised. This enforces left-right consistency and uniqueness constraints. These additions to MI-based stereo matching significantly enhance the algorithm's ability to detect correct matches while decreasing computation time and improving the accuracy. Results show that the MI measure does not perform quite as well for standard stereo pairs when compared to traditional area-based metrics. However, the MI approach is far superior when matching across multi-spectra stereo pairs.

#*3D Object Modelling in Mobile Robot Environment Using B-Spline Surfaces.
#@Pawel Drapikowski,Tomasz Nowakowski
#year2002
#conf3DPVT
#citation1
#index4293
#arnetid4295

#*Automated Multi-view 3D Image Acquisition in Human Genome Research.
#@Michal Kozubek,Petr Matula,Heinz Eipel,Michael Hausmann
#year2002
#conf3DPVT
#citation12
#index4294
#arnetid4296

#*Pictorial Techniques and Intrinsic Images.
#@Frédo Durand
#year2004
#conf3DPVT
#citation0
#index4295
#arnetid4297

#*High-Resolution Cytometry Network Project: Towards Remote a d Distributed Acquisition, Processing and Visualisation of 3D Image Data in Human Genome Research.
#@Michal Kozubek,Petr Matula,Pavel Matula,Petr Mejzlík
#year2002
#conf3DPVT
#citation2
#index4296
#arnetid4298

#*Towards Automatic Modeling of Monuments and Towers.
#@Sabry F. El-Hakim,J.-Angelo Beraldin,Jean-François Lapointe
#year2002
#conf3DPVT
#citation7
#index4297
#arnetid4299

#*Feature Based Registration of Range Images for Mapping of Natural Outdoor Feature Based Registration of Range Images for Mapping of Natural Outdoor.
#@Pekka Forsman,Aarne Halme
#year2004
#conf3DPVT
#citation1
#index4298
#arnetid4300
#!Challenges related to viewpoint registration in rough forest terrain can be quite different compared to those faced in structured environments. Manoeuvring the sensor between measurement positions introduces large error into the a priori estimates of the registration coordinates. As a consequence, locally optimal registration methods may not work properly. Moreover, due to the clutter, the scene contents can change substantially even due to a relative small displacement of the sensor. Often, the sensor has to be moved to the other side of the target object, such as a group of trees, to get a good coverage of its geometry. In both cases, overlap between the two 3D data sets will be minimal ruling out conventional registration methods. In this paper, a feature-based method for registering 3D range scans for mapping natural outdoor environments is proposed. The method utilizes cylindrical, rotation symmetric features extracted from the 3D measurement data for viewpoint registration. The method is tested on real range images.

#*Multiresolution Distance Volumes for Progressive Surface Compression.
#@Daniel E. Laney,Martin Bertram,Mark A. Duchaineau,Nelson L. Max
#year2002
#conf3DPVT
#citation-1
#index4299
#arnetid4301

#*Progressive Compression of Volumetric Subdivision Meshes.
#@Daniel E. Laney,Valerio Pascucci
#year2004
#conf3DPVT
#citation0
#index4300
#arnetid4302
#!We present a progressive compression technique for volumetric subdivision meshes based on the slow growing refinement algorithm. The system is comprised of a wavelet transform followed by a progressive encoding of the resulting wavelet coefficients. We compare the efficiency of two wavelet transforms. The first transform is based on the smoothing rules used in the slow growing subdivision technique. The second transform is a generalization of lifted linear B-spline wavelets to the same multi-tier refinement structure. Direct coupling with a hierarchical coder produces progressive bit streams. Rate distortion metrics are evaluated for both wavelet transforms. We tested the practical performance of the scheme on synthetic data as well as data from laser indirect-drive fusion simulations with multiple fields per vertex. Both wavelet transforms result in high quality trade off curves and produce qualitatively good coarse representations.

#*Robust identification and matching of fiducial points for the reconstruction of 3D human faces from raw video sequences.
#@Raffaella Lanzarotti,N. Alberto Borghese,Paola Campadelli
#year2002
#conf3DPVT
#citation5
#index4301
#arnetid4303

#*Effects of Joystick Mapping and Field-of-View on Human Performance in Virtual Walkthroughs.
#@Jean-François Lapointe
#year2002
#conf3DPVT
#citation21
#index4302
#arnetid4304

#*Applications of 3D Medical Imaging in Orthopaedic Surgery: Introducing the Hip-Op System.
#@Riccardo Lattanzi,Marco Viceconti,Marco Petrone,Paolo Quadrani,Cinzia Zannoni
#year2002
#conf3DPVT
#citation3
#index4303
#arnetid4305

#*A Real-time Realization of Geometrical Valid View Synthesis for Tele-conferencing with Viewpoint Adaptation.
#@Bang Jun Lei,Emile A. Hendriks
#year2002
#conf3DPVT
#citation2
#index4304
#arnetid4306

#*Reconstruction of Euclidean Planes from Voxels.
#@Truong Kieu Linh,Atsushi Imiya
#year2004
#conf3DPVT
#citation0
#index4305
#arnetid4307
#!In this paper, we aim to formulate the recognition of a planes from a discrete point set as a nonlinear optimization problem, and we prove a uniqueness theorem for the solution of this problem. We deal with the supercover model in a space for the expression of discrete planes. The algorithm achieves invertible data compression of digital objects, since the algorithm transforms a collection voxels to a collection of plane parameters, which classify the voxels.

#*Thickness Histogram and Statistical Harmonic Representation for 3D Model Retrieval.
#@Yi Liu,Jiantao Pu,Hongbin Zha,Weibin Liu,Yusuke Uehara
#year2004
#conf3DPVT
#citation11
#index4306
#arnetid4308
#!Similarity measuring is a key problem for 3D model retrieval. In this paper, we propose a novel shape descriptor "Thickness Histogram" (TH) by uniformly estimating thickness of a model using statistical methods. It is translation and rotation-invariant, discriminative to different shapes, and very efficient to compute with the Shape Distribution (SD) proposed by Osada etc. For high performance of the retrieval, we propose a robust method for translating the directional form of the statistical distribution to the harmonic representation. By summing up energies at different frequencies, a matrix shape signature is formed to provide an exhaustive characterization of 3D geometry. Experiments show that the performance of the statistical harmonic representation is among the top ones of existing shape descriptors.

#*Motion-induced error correction in ultrasound imaging.
#@David Lloret,Joan Serrat,Antonio M. López,Juan José Villanueva
#year2002
#conf3DPVT
#citation1
#index4307
#arnetid4309

#*3D Image Sensing for Bit Plane Method of Progressive Transmission.
#@D. Loganathan,K. M. Mehata
#year2004
#conf3DPVT
#citation0
#index4308
#arnetid4310
#!Image Compression has received a lot of interest over the years. Almost all the compression algorithms and standards, discussed in literature, gather statistics and compress on the complete image and compresses to suit various requirements such as lossy / lossless, baseline/progressive, spatial, region on interest. Natural images such as gray scale images and color images are best compressed in the existing literature based on the local and global properties such as attributes of constituent pixels of the given image. In this paper, it is proposed to quantize the amplitudes of pixel values to form a number of bit planes and these bit planes are transmitted in either lossy, lossless, progressive manner. Bit plane formation is attempted from the image acquiring stage to compress and then to transmission stage. Results obtained are promising and give rise to new method or ideology in image sensing, acquiring, storage and transmission.

#*Small CPU Times and Fast Interactivity in Sonar Seabottom Surveys.
#@Robert E. Loke,J. M. Hans du Buf
#year2004
#conf3DPVT
#citation0
#index4309
#arnetid4311
#!Sonar profiling of the seabottom provide 3D data sets that can cover huge survey areas with many gaps. This paper describes a multiresolution framework or visualization pipeline that is being optimized for dealing with such data, taking into account both the CPU time and the user interactivity. This paper describes the techniques employed: (a) the construction of a quadtree that allows to eliminate gaps by interpolating available 3D data, (b) a first but coarse visualization at a high tree level in order to rapidly change or adjust the region of interest, and (c) a very efficient triangulation (mesh reduction) that allows for a fast interactivity even at the highest detail level. By using one single octree, all processing can be combined because (1) gaps can be filled by interpolation since they are smaller at higher tree levels, and (2) connected components can be projected down the tree and refined using the data available there. As a result, huge data sets can be visualized in near realtime on normally-sized discrete grids using shading instead of wire-frames, and this enables a fast searching for objects in the seabottom. Real CPU times are presented for a real sonar data set which is visualized at a low resolution, showing the overall shape of the seabottom, and at a high resolution, showing a (semi-)buried pipeline. In order to detect an object at such a high resolution additional techniques are applied to the data: (a) an interslice interpolation in order to cope with the increased data sparseness and (b) a maximum-homogeneity filtering in order to cope with the decreased signal-to-noise-ratio. After the extraction of the pipeline a thinning technique is applied in order to be able to quantify its length.

#*Visualizing I/O Predictability.
#@Alison Luo,Ahmed Amer,Scott Speidel,Darrell D. E. Long,Alex Pang
#year2002
#conf3DPVT
#citation1
#index4310
#arnetid4312

#*3D Performance Capture for Facial Animation.
#@Donald MacVicar,Stuart Ford,Ewan Borland,Robert Rixon,John W. Patterson,W. Paul Cockshott
#year2004
#conf3DPVT
#citation5
#index4311
#arnetid4313
#!This paper describes how a photogrammetry based 3D capture system can be used as an input device for animation. The 3D Dynamic Capture System is used to capture the motion of a human face which is extracted from a sequence of 3D models captured at TV frame rate. Initially the positions of a set of landmarks on the face are extracted. These landmarks are then used to provide motion data in two different ways. First, a high level description of the movements are extracted, and these can be used as input to a procedural animation package (i.e. CreaToon). Second the landmarks can be used as registration points for a conformation process where the model to be animated is modified to match the captured model. This approach gives a new sequence of models which have the structure of the drawn model but the movement of the captured sequence.

#*On Robustness and Localization Accuracy of Optical Flow Computation from Color Imagery.
#@Hossein Madjidi,Shahriar Negahdaripour
#year2004
#conf3DPVT
#citation3
#index4312
#arnetid4314
#!Accurate and efficient optical flow estimation is a major step in many computational vision problems, including tracking and 2-D/3-D mapping applications. Processing of grayscale images has been the dominant approach, with only a few studies investigating selected aspects in the use of color imagery. In a physics-based analysis to study the impact of the spectral-dependent medium attenuation on the color channels, we have shown merit in the use of color cues in the computation of optical flow for underwater imagery-the primary motivation of the investigation [Robust optical flow estimation using underwater color images]. Comparisons among various color representations and traditional intensity component on the optical flow computation are given, suggesting that the HSV representation could be the most suitable. For both underwater and terrestrial imagery, even where data in the 3 color channels are highly correlated, one expects multiple constraints from color channels to give increased robustness due to the independent channel noises. Results of experiments are given to demonstrate improved localization and accuracy.

#*Data-Driven Approaches to Digital Human Modeling.
#@Nadia Magnenat-Thalmann,Hyewon Seo
#year2004
#conf3DPVT
#citation2
#index4313
#arnetid4315
#!Data-driven approach is an appealing way to depict people in a virtual world. The captured shape and movement data from real people are structured and combined to reproduce or create new samples in an intuitive and controllable way. We focus on the body shape modeling and elucidate the issues related to data-driven methods. The difficulty of adopting data-driven approach for human body shape modeling is due in part to the intrinsic articulated structure of the body. Since such internal structure is not measured with most of existing capture devices available today, it has to be calculated through estimation. We develop a framework for collecting and managing range scan data that automatically estimates this structure from user-tagged landmarks. By framing the captured and structurally annotated data so that statistic implicit is exploited for synthesizing new body shapes, our technique support time-saving generation of animatable body models with high realism.

#*Spacetime-Coherent Geometry Reconstruction from Multiple Video Streams.
#@Marcus A. Magnor,Bastian Goldlücke
#year2004
#conf3DPVT
#citation9
#index4314
#arnetid4316
#!By reconstructing time-varying geometry one frame at a time, one ignores the continuity of natural motion, wasting useful information about the underlying video-image formation process and taking into account temporally discontinuous reconstruction results. In 4D spacetime, the surface of a dynamic object describes a continuous 3D hyper-surface. This hyper-surface can be implicitly defined as the minimum of an energy functional designed to optimize photo-consistency. Based on an Euler-Lagrange reformulation of the problem, we find this hyper-surface from a handful of synchronized video recordings. The resulting object geometry varies smoothly over time, and intermittently invisible object regions are correctly interpolated from previously and/or future frames.

#*3WPS : A 3D Web-based Process Visualization Framework.
#@Delfina Malandrino,Gennaro Meo,Giuseppina Palmieri,Vittorio Scarano
#year2002
#conf3DPVT
#citation3
#index4315
#arnetid4317

#*A Gesture Recognition System Using 3D Data.
#@Sotiris Malassiotis,Niki Aifanti,Michael G. Strintzis
#year2002
#conf3DPVT
#citation25
#index4316
#arnetid4318

#*Concentric Strips: Algorithms and Architecture for the Compression/Decompression of Triangle Meshes.
#@Paula N. Mallón,Montserrat Bóo,Margarita Amor,Javier D. Bruguera
#year2002
#conf3DPVT
#citation7
#index4317
#arnetid4319

#*Description of Simple Method in 3D Reconstruction in Medical Imaging.
#@Cédric Marchessoux,Noël Richard,Christine Fernandez-Maloigne
#year2002
#conf3DPVT
#citation1
#index4318
#arnetid4320

#*Encoding Volumetric Grids For Streaming Isosurface Extraction.
#@Ajith Mascarenhas,Martin Isenburg,Valerio Pascucci,Jack Snoeyink
#year2004
#conf3DPVT
#citation20
#index4319
#arnetid4321
#!Gridded volumetric data sets representing simulation or tomography output are commonly visualized by displaying a triangulated isosurface for a particular isovalue. When the grid is stored in a standard format, the entire volume must be loaded from disk, even though only a fraction of the grid cells may intersect the isosurface. We propose a compressed on-disk representation for regular volume grids that allows streaming, I/O-efficient, out-of-core isosurface extraction. Unlike previous methods, we provide a guaranteed bound on the ratio between the number of cells loaded and number of cells intersecting the isosurface that applies for any isovalue. As grid cells are decompressed, we immediately extract vertices and triangles of the isosurface. Our output is a coherent streaming mesh, which facilitates subsequent processing, including on-the-fly simplification and compression.

#*Object Shape Modelling from Multiple Range Images by Matching Signed Distance Fields.
#@Takeshi Masuda
#year2002
#conf3DPVT
#citation9
#index4320
#arnetid4322

#*Filling the Signed Distance Field by Fitting Local Quadrics.
#@Takeshi Masuda
#year2004
#conf3DPVT
#citation22
#index4321
#arnetid4323
#!We propose a method of filling unmeasured regions of shape models integrated from multiple measurements of surface shapes. We use the signed distance field (SDF) as shape representation that contains information of the surface normal along with the signed distance at the closest point on the surface from the sampling point. We solve this problem by iteratively fitting quadratic function to generate smoothly connected SDF. We analyzed the relationship between the quadratic coefficients and the surface curvature, and by using the coefficients, we evenly propagated the SDF so that it satisfies the constraints of the field. The proposed method was tested on synthetic data and real data that was generated by integrating multiple range images.

#*Generation, Visualization, and Editing of 3D Video.
#@Takashi Matsuyama,Takeshi Takai
#year2002
#conf3DPVT
#citation50
#index4322
#arnetid4324

#*Effectivity of Spherical Object Reconstruction Using Star -Shaped Simplex Meshes.
#@Pavel Matula
#year2002
#conf3DPVT
#citation3
#index4323
#arnetid4325

#*High-Resolution Cytometry Network Project: Client/Server System for 3D Optical Microscope Data Storage and Analysis.
#@Pavel Matula,Petr Matula,Michal Kozubek,Petr Mejzlík
#year2004
#conf3DPVT
#citation0
#index4324
#arnetid4326
#!If several laboratories work in the same field and need to cooperate, it is necessary to exchange and mutually compare their computer results. The quick way to solve this problem is to unite their file formats (if it is practicable) or to install new software systems, which are data or file format compatible. A much better solution is to use only one common system. This article describes the architecture of a new client-server system, which offers possibilities of effective cooperation for laboratories doing the research in the field of the spatial organization of human genome. However, the system design is determined mainly by optical microscopy principles and therefore the system can easily be modified for use in other applications or environments. The most pressing problem during the system design was how to share and process large 3D image data in client-server architecture.

#*A Model (In)Validation Approach to Gait Recognition.
#@Cecilia Mazzaro,Mario Sznaier,Octavia I. Camps,Stefano Soatto,Alessandro Bissacco
#year2002
#conf3DPVT
#citation8
#index4325
#arnetid4327

#*Edge-Constrained Marching Triangles.
#@Neil H. McCormick,Robert B. Fisher
#year2002
#conf3DPVT
#citation7
#index4326
#arnetid4328

#*Enhanced Surface Reconstruction from Wide Baseline Images.
#@Zoltán Megyesi,Dmitry Chetverikov
#year2004
#conf3DPVT
#citation6
#index4327
#arnetid4329
#!This paper deals with the problem of dense matching from stereo images under wide baseline conditions. By considering the characteristic properties of widely separated views, we propose an extension to a recently published algorithm for detailed reconstruction of continuous surfaces. The algorithm compensates for the occurrent affine distortion between the views to allow low level intensity based comparison necessary for dense matching. The matching itself is performed by an enhanced region rowing based affine propagation method that takes surface distortion into account to handle complex piecewise-smooth surfaces. It is experimentally shown that this new method can achieve smooth and accurate reconstruction from wide baseline images of both indoor and outdoor scenes. To quantify the reconstruction results we have created realistic synthetic datasets with ground truth. These datasets form the core of a future testbed for comparison of different wide baseline surface reconstruction techniques. In the current study, results on the synthetic images are compared to the ground truth to measure the accuracy of our method.

#*An Easy Viewer for Out-of-Core Visualization of Huge Point-Sampled Models.
#@Fang Meng,Hongbin Zha
#year2004
#conf3DPVT
#citation2
#index4328
#arnetid4330
#!In this paper, we propose a viewer for huge point-sampled models by combining out-of-core technologies with view-dependent level-of-detail (LOD) control. This viewer is designed on the basis of a multiresolution data structure we have developed for gaze-guided visualization and transmission of 3D point sets. In order to reduce memory loads for huge point sets on general PC platforms, we introduce a partition-based out-of-core strategy to balance usage of main and external memories. At first, the data surface is partitioned into small blocks and points in each block are reorganized into error-controlled LODs by hierarchical clustering and LOD organization. In the interactive rendering process, a data block scheduling algorithm is used to realize the view-dependent paging. Experimental results show that the viewer can perform interactive visualization of huge point models on commodity graphics platforms with ease.

#*Direct and Robust Voxelization and Polygonization of Free-Form CSG Solids.
#@Juan Ruiz de Miras,Francisco R. Feito
#year2002
#conf3DPVT
#citation-1
#index4329
#arnetid4331

#*Network-based raditional Japanese Crafting Presentation System Using Agent and Virtual Reality Technologies.
#@Akihiro Miyakawa,Masamitsu Sugimoto,Mikako Hosokawa,Yoshitaka Shibata
#year2002
#conf3DPVT
#citation0
#index4330
#arnetid4332

#*Network-based raditional Japanese Crafting Presentation System Using Agent and Virtual Reality echnologies.
#@Akihiro Miyakawa,Masamitsu Sugimoto,Mikako Hosokawa,Yoshitaka Shibata
#year2002
#conf3DPVT
#citation-1
#index4331
#arnetid4333

#*3D objects visualization for remote interactive medical applications.
#@Johan Montagnat,Eduardo Davila,Isabelle E. Magnin
#year2002
#conf3DPVT
#citation6
#index4332
#arnetid4334

#*Adaptive Space Carving.
#@Anselmo Antunes Montenegro,Paulo Cezar Pinto Carvalho,Marcelo Gattass,Luiz Velho
#year2004
#conf3DPVT
#citation6
#index4333
#arnetid4335
#!In this work, we present an adaptive space carving method for scene reconstruction from a set of images obtained from low cost calibrated webcams. Our method uses a combination of silhouette and photometric information to efficiently carve the shape of the observed scene out of a volumetric space represented by an octree data structure. In this method different resolutions are considered both in object space and in image space. This led us to adopt a strategy in which the information used by the photo-consistency test is registered in scene space by projective texture mapping. Another important question addressed in this work is the high level of noise present in low cost webcams. To deal with this problem we devised a statistical photo-consistency test that uses statistical estimators for the noise introduced by the sensors of the cameras.

#*Dense Multiple View Stereo with General Camera Placement using Tensor Voting.
#@Philippos Mordohai,Gérard G. Medioni
#year2004
#conf3DPVT
#citation16
#index4334
#arnetid4336
#!We present a computational framework for the inference of dense descriptions from multiple view stereo with general camera placement. Thus far research on dense multiple view stereo has evolved along three axes: computation of scene approximations in the form of visual hulls; merging of depth maps derived from simple configurations, such as binocular or trinocular; and multiple view stereo with restricted camera placement. These approaches are either sub-optimal, since they do not maximize the use of available information, or cannot be applied to general camera configurations. Our approach does not involve binocular processing other than the detection of tentative pixel correspondences. We require calibration information for all cameras and that there exist camera pairs which enable automatic pixel matching. The inference of scene surfaces is based on the premise that correct pixel correspondences, reconstructed in 3-D, form salient, coherent surfaces, while wrong correspondences form less coherent structures. The tensor voting framework is suitable for this task since it can process the very large datasets we generate with reasonable computational complexity. We show results on real images that present numerous challenges.

#*Fast 3D Model Acquisition from Stereo Images.
#@Louis-Philippe Morency,Ali Rahimi,Trevor Darrell
#year2002
#conf3DPVT
#citation9
#index4335
#arnetid4337

#*Bayesian Surface Reconstruction.
#@Nicola Moretto,Ruggero Frezza
#year2004
#conf3DPVT
#citation3
#index4336
#arnetid4338
#!In this paper we illustrate an innovative method which estimates the surfaces -modelled as polygonal meshes-bounding objects present in a scene, viewed by arbitrarily placed cameras. We present a Montecarlo based iterative approach which, at every step, increases its knowledge about the scene sampling the unknown volume around the current estimation. Then, the samples which mostly appear to be consistent with the measurements are used to extend the mesh representing the surface. The reconstruction is regularized applying a filter -based on a dynamic system- to the mesh. This operation will preserve the high curvature areas of the surface, while smoothing away the noise in the estimation.

#*A Non Causal Bayesian Framework for Object Tracking and Occlusion Handling for the Synthesis of Stereoscopic Video.
#@Konstantinos Moustakas,Dimitrios Tzovaras,Michael G. Strintzis
#year2004
#conf3DPVT
#citation3
#index4337
#arnetid4339
#!This paper presents a framework for the synthesis of stereoscopic video using as input only a monoscopic image sequence. Initially, bi-directional 2D motion estimation is performed, which is followed by an efficient method for the reliable tracking of object contours. Rigid 3D motion and structure is recovered utilizing extended Kalman filtering. Finally, occlusions are dealt with a novel Bayesian framework, which exploits future information to correctly reconstruct occluded areas. Experimental evaluation shows that the layered object scene representation, combined with the proposed methods for object tracking throughout the sequence and occlusion handling, yields very accurate results.

#*Exploring Boundary Concavities in Active Contours and Surfaces.
#@Julien Mille,Romuald Boné,Pascal Makris,Hubert Cardot
#year2006
#conf3DPVT
#citation0
#index4338
#arnetid4340
#!Active contours and surfaces are deformable models used for 2D and 3D image segmentation. These models generally lack of convergence into boundary concavities, when segmenting highly concave objects. In this paper, we propose a method for exploring concavities, applicable on discrete active contours and surfaces deformed thanks to the greedy algorithm, which minimizes the energy functional. As a basis of this method, we introduce the gradient line energy (GLE), which goal is to make discrete parts of the surface coincide with boundaries, and the exploration force, computed from this energy, driving the surface into the object concavities. Our method lies on a general framework, enabling application on discrete 2D contours and 3D meshes with easy adaptation between both models.

#*Segmenting Correlation Stereo Range Images using Surface Elements.
#@Don Murray,James J. Little
#year2004
#conf3DPVT
#citation6
#index4339
#arnetid4341
#!This paper describes methods for segmenting planar surfaces from noisy 3D data obtained from correlation stereo vision. We make use of local planar surface elements called patchlets. Patchlets have 3D position, orientation and size parameters. As well, they have positional confidence measures based on the stereo sensor model. Patchlet orientations (i.e., surface normals) provide important additional dimensionality that reduces the ambiguity of segmentation-by-clustering. Patchlet size allows the use of continuity or coverage constraints when segmenting bounded surfaces from depth images. We use a region-growing approach to identify the number of surfaces that exist in a stereo image and obtain an initial estimate of the surface parameters. We refine segmentation using a maximum likelihood clustering approach that is optimised with Expectation-Maximisation. Confidence measures on the patchlet parameters allow proper weighting of patchlet contributions to the solution. We provide experimental results of the segmentation on complex outdoor scenes.

#*Viewpoint Consistent Texture Synthesis.
#@Alexander Neubeck,Alexey Zalesny,Luc J. Van Gool
#year2004
#conf3DPVT
#citation2
#index4340
#arnetid4342
#!The purpose of this work is to synthesize textures of rough, real world surfaces under freely chosen viewing and illumination directions. Moreover, such textures are produced for continuously changing directions in such a way that the different textures are mutually consistent, i.e. emulate the same piece of surface. This is necessary for 3D animation. It is assumed that the mesostructure (small-scale) geometry of a surface is not known, and that the only input consists of a set of images, taken under different viewing and illumination directions. These are automatically aligned to build an appropriate Bidirectional Texture Function (BTF). Directly extending 2D synthesis methods for pixels to complete BTF columns has drawbacks which are exposed, and a superior sequential but highly parallelizable algorithm is proposed. Examples demonstrate the quality of the results.

#*A Hierarchy of Cameras for 3D Photography.
#@Jan Neumann,Cornelia Fermüller,Yiannis Aloimonos
#year2002
#conf3DPVT
#citation14
#index4341
#arnetid4343
#%128726
#%129228
#%593163
#%907760
#%907803
#%293351
#%907730
#%168128
#%907572
#%907602
#%907635
#%946741
#%907728
#%293513
#%293486
#!The view-independent visualization of 3D scenes is most often based on rendering accurate 3D models or utilizes image-based rendering techniques. To compute the 3D structure of a scene from a moving vision sensor or to use image-based rendering approaches, we need to be able to estimate the motion of the sensor from the recorded image information with high accuracy, a problem that has been well-studied. In this work, we investigate the relationship between camera design and our ability to perform accurate 3D photography, by examining the influence of camera design on the estimation of the motion and structure of a scene from video data. By relating the differential structure of the time varying plenoptic function to different known and new camera designs, we can establish a hierarchy of cameras based upon the stability and complexity of the computations necessary to estimate structure and motion. At the low end of this hierarchy is the standard planar pinhole camera for which the structure from motion problem is non-linear and ill-posed. At the high end is a camera, which we call the full field of view polydioptric camera, for which the motion estimation problem can be solved independently of the depth of the scene which leads to fast and robust algorithms for 3D Photography. In between are multiple view cameras with a large field of view which we have built, as well as omni-directional sensors.

#*Automatic Passive Recovery of 3D from Images and Video.
#@David Nistér
#year2004
#conf3DPVT
#citation29
#index4342
#arnetid4344
#!This paper gives a summary of automatic passive reconstruction of 3D scenes from images and video. Features are tracked between the images. Relative camera poses are then estimated based on the feature tracks. Both the feature tracking and the robust method used to estimate the camera poses has recently been shown to provide robust real-time performance. Given the camera poses, a more elaborate method is used to derive dense textured surfaces. The dense reconstruction method was originally part of the authors thesis [Automatic Dense Reconstruction from Uncalibrated Video Sequences]. It first computesdepth maps using graph cuts, optimizing a Bayesian formulation. The graph cut operation is used to let depth map hypotheses from various sources compete in order to optimize the cost function. The hypothesis generators used are feature based surface triangulation, plane fitting and multi-hypothesis multi-scale patch-based stereo. The requirements for a cost function to fit into the graph cut framework were already given in [Automatic Dense Reconstruction from Uncalibrated Video Sequences], along with a procedure for constructing the graph weights corresponding to any cost function that satisfies the requirements. Depth maps from many different viewpoints are then robustly fused to give a consistent global result using a process called median fusion. The robustness of the median fusion is important. It departs from the too common practice of fusing results by either using the union of free-space constraints as the resulting free-space, or the union of all predicted surfaces as the resulting surfaces, which is tremendously error-prone, since it essentially corresponds to taking either the minimum or maximum of the individual results.

#*Heterogeneous Deformation Model for 3D Shape and Motion Recovery from Multi-Viewpoint Images.
#@Shohei Nobuhara,Takashi Matsuyama
#year2004
#conf3DPVT
#citation8
#index4343
#arnetid4345
#!This paper presents a framework for dynamic 3D shape and motion reconstruction from multi-viewpoint images using a deformable mesh model. By deforming a mesh at a frame to that at the next frame, we can obtain both 3D shape and motion of the object simultaneously. The deformation process of our mesh model is heterogeneous. Each vertex changes its deformation process according to its 1) photometric property (i.e., if it has prominent texture or not), and 2) physical property (i.e., if it is an element of rigid part of the object or not). This heterogeneous deformation model enables us to reconstruct the object which consists of different kinds of materials or parts with different motion models, e.g., rigidly acting body parts and deforming soft clothes or its skins, by a single and unified computational framework.

#*The Influence of Shape on Image Correspondence.
#@Abhijit S. Ogale,Yiannis Aloimonos
#year2004
#conf3DPVT
#citation1
#index4344
#arnetid4346
#!We examine the implications of shape on the process of finding dense correspondence and half-occlusions for a stereo pair of images. The desired property of the depth map is that it should be a piecewise continuous function which is consistent with the images and which has the minimum number of discontinuities. To zeroeth order, piecewise continuity becomes piecewise constancy. Using this approximation, we first discuss an approach for dealing with such a fronto-parallel shapeless world, and the problems involved therein. We then introduce horizontal and vertical slant to create a first order approximation to piecewise continuity. We highlight the fact that a horizontally slanted surface (ie. having depth variation in the direction of the separation of the two cameras) will appear horizontally stretched in one image as compared to the other image. Thus, while corresponding two images, N pixels on a scanline in one image may correspond to a different number of pixels M in the other image, which has consequences with regard to sampling and occlusion detection. We also discuss the asymmetry between vertical and horizontal slant, and the central role of non-horizontal edges in the context of vertical slant. Using experiments, we discuss cases where existing algorithms fail, and how the incorporation of new constraints provides correct results.

#*Registration of Range Images that Preserves Local Surface Structures and Color.
#@Ikuko Shimizu Okatani,Akihiro Sugimoto
#year2004
#conf3DPVT
#citation6
#index4345
#arnetid4347
#!We propose an ICP-based registration method for range images that preserves fundamental features, i.e., local structures and color, of object surfaces. The method employs local surfaces as an attribute for establishing correspondences between range images where local surfaces are evaluated geometrically and photometrically. In estimating correspondences between range images, our method evaluates consistency of shape patterns and chromaticity of local surfaces together. In estimating transformation parameters relating the coordinates between different range images, on the other hand, our method evaluates skewness and chromaticity of correspondences. These two kinds of evaluation enhances accuracy of the estimation and results in preserving local structures and color of object surfaces.

#*Construction of Animal Models and Motion Synthesis in 3D Virtual Environments using Image Sequences.
#@Costas Panagiotakis,Georgios Tziritas
#year2004
#conf3DPVT
#citation6
#index4346
#arnetid4348
#!In this paper, we describe a system that can build 3D animal models and synthesize animations in 3D virtual environments. The model is constructed by 2D images captured by specific views. The animation is synthesised by using physical motion models of the animal and tracking data from image sequences. Finally, the user selects some points of the 3D world and a smooth and safe motion path, which passes by these points, is created. The main assumption of the 3D modelling is that the animal could be divided into parts whose normal sections are ellipses. Joints and angles between skeleton points are used in order to decrease models complexity. Using the above methodology, a snake, a lizard and a goat are reconstructed.

#*The Virtual Boutique: a Synergic Approach to Virtualization, Content-based Management of 3D Information, 3D Data Mining an Virtual Reality for E-commerce.
#@Eric Paquet,Herna L. Viktor,Shawn Peter
#year2002
#conf3DPVT
#citation3
#index4347
#arnetid4349

#*Specularity Elimination in Range Sensing for Accurate 3D Modeling of Specular Objects.
#@Johnny Park,Avinash C. Kak
#year2004
#conf3DPVT
#citation6
#index4348
#arnetid4350
#!We present a novel range sensing method that is capable of constructing accurate 3Dmodels of specular objects. Our method utilizes a new range imaging concept called multi-peak range imaging, which accounts for the effects of mutual reflections. False measurements generated by mutual reflections are then eliminated by applying a series of constraint tests based on local smoothness, global coordinate consistency and visibility consistency. We show the usefulness of our method by applying the method to three real objects with specular surfaces. The ground truth data for those three objects were also acquired in order to evaluate the elimination of false measurements and to justify the selection of the parameters in the constraint tests. Experimental results indicate that our method significantly improves upon the traditional methods for constructing reliable 3D models of specular objects with complex shapes.

#*3D Mesh Wavelet Coding Using Efficient Model-based Bit Allocation.
#@Frédéric Payan,Marc Antonini
#year2002
#conf3DPVT
#citation11
#index4349
#arnetid4351

#*3D Non-Linear Invisible Boundary Detection Filters.
#@Maria Petrou,Farahnaz Mohanna,Vassili A. Kovalev
#year2004
#conf3DPVT
#citation0
#index4350
#arnetid4352
#!The human vision system can discriminate regions which differ up to the second order statistics only. A lot of malignant tumours have boundaries which are not visible to the human eye. We present an algorithm designed to reveal "hidden" boundaries in grey level images, by computing gradients in higher order statistics of the data. We demonstrate it by applying it to the identification of possible "hidden" boundaries of gliomas as manifest themselves in MRI 3D scans.

#*Surface Segmentation Using Geodesic Centroidal Tesselation.
#@Gabriel Peyré,Laurent D. Cohen
#year2004
#conf3DPVT
#citation25
#index4351
#arnetid4353
#!In this paper, we solve the problem of mesh partition using intrinsic computations on the 3D surface. The key concept is the notion of centroidal tesselation that is widely used in an eucidan settings. Using the Fast Marching algorithm, we are able to recast this powerful tool in the language of mesh processing. This method naturally fits into a framework for 3D geometry modelling and processing that uses only fast geodesic computations. With the use of classical geodesic-based building blocks, we are able to take into account any available information or requirement such as a 2D texture or the curvature of the surface.

#*Detection and Compensation of Image Sequence Jitter Due to an Unstable CCD Camera for Video Tracking of a Moving Target.
#@M. A. Zerafat Pisheh,A. Sheikhi
#year2004
#conf3DPVT
#citation-1
#index4352
#arnetid4354
#!Nowadays image motion analysis is considered as a significant subject in image processing and according to its characteristics is divided into different categories. This paper focuses on camera jitter as fast translations in image sequence due to an unstable platform. Our studies have led to do correlation matching [Motion Displacement Estimation Using an Affine Modelfor Image Matching] between well featured templates[Edge Detection using KL Transform, Extracting Good Features for Motion Estimation] of successive frames to prevent aperture problems and thus have good estimation of the translations. But camera vibration may also suffer from rotation and scaling as nonlinear motions [Detection of Non-Uniform Motion in Image Sequences using a Reduced Order Likelihood Ratio Test] that may defect thematching process. Therefore mapping of 3D image points into camera image plane has been investigated to trace the effects of these nonlinear parameters in 2D motion equations [Image Based Measurement Systems]. Now by approximating these equations for minute rotation and bounded scaling between frame i and i+1, the set of motion equations with four unknowns (rotation, scaling, horizontal /vertical translations) could be solved just by LSE [Kalman Filtering, Theory and Practice using MATLAB] method for a unique and optimized response. After all when you apply the estimated displacements on each frame for compensation, an stabilized sequence will conclude.

#*Surface Illuminance Flow.
#@Sylvia C. Pont,Jan J. Koenderink
#year2004
#conf3DPVT
#citation7
#index4353
#arnetid4355
#!We introduce the concept of "surface illuminance flow" in two steps.First we reiterate the notion of the "light vector", then we proceed to decompose the light vector into a scalar "normal illuminance" and a vector "surface illuminance flow".The scalar normal illuminance generates the familiar illuminance pattern that is often known as the "shading".The vector surface illuminance flow is irrelevant for smooth surfaces (which probably explains why it is conventionally ignored) but it generates the texture due to surface mesorelief.We show how observation of the illuminance induced texture leads to robust inferences of the surface illuminance flow direction modulo 180°. This makes surface illuminance flow a property that is observable in natural scenes.Muchl ike optical flow, the surface illuminance flow is largely due to a global property that exists independent of local structure, namely the direction of the general illuminating beam (sunlight or light from the overcast sky in a typical outdoors scene).However, due to the fact that there exists "true screening" in radiometry (thus removing any hope for a "field theory" of radiometry) the local scene structure has an influence on the local light field.Such "vignetting" is a main cause of the complexity of radiometry, the other cause being the ever present multiple scatterings.This complicates matters but also introduces additional sources of information.We illustrate instances of the observation of illuminance flow in scenes.We also present a data base of roughly spherical objects, illuminated in a number of standard ways that we have used to study illuminance flow over actual rough objects.

#*Interactive Modeling from Dense Color and Sparse Depth.
#@Voicu Popescu,Elisha Sacks,Gleb Bahmutov
#year2004
#conf3DPVT
#citation5
#index4354
#arnetid4356
#!We present research in scene modeling. The task is to build digital models of natural scenes that support interactive, photorealistic rendering. Scene modeling is the bottleneck in many computer graphics applications, notably virtual training, geometric modeling for physical simulation, cultural heritage preservation, internet marketing, and gaming. Capturing complex scenes with current modeling technology is slow, difficult, and expensive. We describe an interactive modeling system that has the potential to solve these problems.

#*Comparison of 3D Measurement Techniques in Cultural Heritage Application: User Point of View.
#@Francesca Pozzi
#year2002
#conf3DPVT
#citation2
#index4355
#arnetid4357

#*3D Model Retrieval Based on 2D Slice Similarity Measurements.
#@Jiantao Pu,Yi Liu,Guyu Xin,Hongbin Zha,Weibin Liu,Yusuke Uehara
#year2004
#conf3DPVT
#citation-1
#index4356
#arnetid4358

#*Volume Rendering on the Internet.
#@Wen Qi,Zhijian Song,Guoqiang Wu
#year2002
#conf3DPVT
#citation0
#index4357
#arnetid4359

#*Surface Normals and Height from Non-Lambertian Image Data.
#@Hossein Ragheb,Edwin R. Hancock
#year2004
#conf3DPVT
#citation8
#index4358
#arnetid4360
#!It is well known that many surfaces exhibit reflectance that is not well modelled by Lambert's law. This is the case not only for surfaces that are rough or shiny, but also those that are matte and composed of materials that are particle suspensions. As a result, standard Lambertian shape-from-shadingmethods can not be applied directly to the analysis of rough and shiny surfaces. In order to overcome this difficulty, in this paper, weconsider how to reconstruct the Lambertian component for rough and shiny surfaceswhen the object is illuminated in the viewing direction. To do this we make use of the diffuse reflectance models described by Oren and Nayar, and by Wolff. Our experiments with synthetic and real-world data reveal the effectiveness of the correction method, leading to improved surface normal and height recovery.

#*Testing Reflectance Models Against Radiance Data.
#@Hossein Ragheb,Antonio Robles-Kelly,Edwin R. Hancock
#year2004
#conf3DPVT
#citation0
#index4359
#arnetid4361
#!This paper describes an empirical investigation of departures from Lambert's law for rough and shiny surfaces. We commence by using a recently reported method to recover estimates ofthe surface radiance function for objects illuminated in the viewer direction. This method is non-parametric, and offers the advantage that it is simple to use since it does not require detailed camera calibration. We compare the radiance data with a number of phenomenological and physics-basedreflectance models. The models studied include those of Oren-Nayar, Wolff and different variants of the Beckmann model. The main conclusion of the study is that among these models the best fit to the empirical data is found to be the Wolff model for smooth objects and the modified Beckmann model for rough objects.

#*A Unified Approach for Motion Analysis and View Synthesis.
#@Alex Rav-Acha,Shmuel Peleg
#year2004
#conf3DPVT
#citation11
#index4360
#arnetid4362
#!Image based rendering (IBR) consists of several steps: (i) Calibration (or ego-motion computation) of all input images. (ii) Determination of regions in the input images used to synthesize the new view. (iii) Interpolating the new view from the selected areas of the input images. We propose a unified representation for all these aspects of IBR using the Space-Time (x-y-t) volume. The presented approach is very robust, and allows to use IBR in general conditions even with a hand-held camera. To take care of (i), the Space-Time volume is constructed by placing frames at locations along the time axis so that image features create straight lines in the EPI (epipolar plane images). Different slices of the Space-Time volume are used to produce new views, taking care of (ii). Step (iii) is done by interpolating between image samples using the feature lines in the EPI images. IBR Examples are shown for various cases: sequences taken from a driving car, from a hand held camera, or when using a tripod.

#*A Surface Partitioning Spectrum (SPS) for Retrieval and Indexing of 3D CAD Models.
#@Heather J. Rea,Doug E. R. Clark,Jonathan R. Corney,Nick K. Taylor
#year2004
#conf3DPVT
#citation7
#index4361
#arnetid4363
#!Manual indexing of large databases of geometric information is costly and often impracticable. Because of this research into retrieval and indexing schemes has focused on the development of various 3D to 2D mappings that characterise a shape as a histogram with a small number of parameters. Many methods of generating such 2D signatures (i.e. histograms) have been proposed, generally based on geometric measures of say curvature or distance. However these geometric signatures lack information about topology and tend to become indistinct as the complexity of the shape increases. This paper describes a new method for characterising both the geometry and topology of shapes in a single 2D graph, the Surface Partitioning Spectrum (SPS). We evaluate the effectiveness of using the SPS with a Neural Network to assess the similarity of shapes within a test set.

#*Visualization of Arbitrary-Shaped 3D Scenes on Depth-Limited 3D Displays.
#@André Reder
#year2004
#conf3DPVT
#citation-1
#index4362
#arnetid4364
#!We propose a depth scaling method that enables visualization of arbitrary-shaped 3D scenes on 3D displays.Most current 3D displays have a depth limitation, while the scene to be displayed has not.The trivial solutions as clipping or linear scaling of the scene's 3D bounding box suffer from non-optimal utilization of the display's capabilities. Our approach uses spatially adaptive depth scaling that maximizes the perceptual 3D effect.From the original scene geometry, the topology and local depth ordering among objects are preserved, while depth linearity is disregarded. The scaling method applies to nearly all 3D displays, such as glasses-based, head-tracked, multi-view, holographic and volumetric 3D displays.Subjective tests with the Dynamic Dimension display system show that our method significantly increases the perceptual 3D effect.

#*ATTEST: Advanced Three-dimensional Television System Technologies.
#@André Redert,Marc Op de Beeck,Christoph Fehn,Wijnand IJsselsteijn,Marc Pollefeys,Luc J. Van Gool,Eyal Ofek,Ian Sexton,Philip Surman
#year2002
#conf3DPVT
#citation89
#index4363
#arnetid4365

#*Accurate and robust marker localization algorithm for camera calibration.
#@André Redert,Emile A. Hendriks,Jan Biemond
#year2002
#conf3DPVT
#citation5
#index4364
#arnetid4366

#*Empirical Calibration Method for Adding Colour to Range Images.
#@Craig Robertson,Robert B. Fisher
#year2002
#conf3DPVT
#citation4
#index4365
#arnetid4367

#*Estimating the Surface Radiance Function from Single Images.
#@Antonio Robles-Kelly,Edwin R. Hancock
#year2004
#conf3DPVT
#citation17
#index4366
#arnetid4368
#%169128
#%1033380
#%593223
#%908547
#%292987
#%293393
#%908360
#%593937
#%908390
#%593562
#%775038
#%593431
#%594135
#%594113
#%947403
#!This paper describes a simple method for estimating the surface radiance function from single images of smooth surfaces made of materials whose reflectance function is isotropic and monotonic. The method makes implicit use of the Gauss map between the surface and a unit sphere. We assume that the material brightness is monotonic with respect to the angle between the illuminant direction and the surface normal. Under conditions in which the light source and the viewer directions are identical, we show how a tabular representation of the surface radiance function can be estimated using the cumulative distribution of image gradients. Using this tabular representation of the radiance function, surfaces may be rendered under varying light source direction by rotating the corresponding reflectance map on the Gauss sphere about the specular spike direction. We present a sensitivity study on synthetic and real-world imagery. We also present two applications which make use of the estimated radiance function. The first of these illustrates how the radiance function estimates can be used to render objects when the light and viewer directions are no longer coincident. The second application involves applying corrected Lambertian radiance to rough and shiny surfaces.

#*Surface Height Recovery Using Heat Flow and Manifold Embedding.
#@Antonio Robles-Kelly,Edwin R. Hancock
#year2004
#conf3DPVT
#citation2
#index4367
#arnetid4369
#!This paper makes two contributions to the problem of shape-from-shading. First, we develop a new method for surface normal recovery. We pose the problem as that of solving the steady state heat equation subject to the hard constraint that Lambert's law is satisfied. According to this picture, the surface normals are found by taking the gradient of a scalar field. The heat equation for the scalar field can be solved using simple finite difference methods and leads to an iterative procedure for surface normal estimation. The second contribution is to show how surface height recovery from the field of surface normals can be posed as one of low dimensional embedding. We experiment with the resulting method on a variety of real-world image data, where it produces qualitatively good reconstructed surfaces.

#*Audio effects to enhance spatial informition displays.
#@Davide Rocchesso
#year2002
#conf3DPVT
#citation1
#index4368
#arnetid4370

#*Estimating Curvatures and Their Derivatives on Triangle Meshes.
#@Szymon Rusinkiewicz
#year2004
#conf3DPVT
#citation139
#index4369
#arnetid4371
#!The computation of curvature and other differential properties of surfaces is essential formany techniques in analysis and rendering. We present a finite-differences approach for estimating curvatures on irregular triangle meshes that may be thought of as an extension of a common method for estimating per-vertex normals. The technique is efficient in space and time, and results in significantly fewer outlier estimates while more broadly offering accuracy comparable to existing methods. It generalizes naturally to computing derivatives of curvature and higher-order surface differentials.

#*Colon Centreline Calculation for CT Colonography using Optimised 3D Topological Thinning.
#@Robert J. T. Sadleir,Paul F. Whelan
#year2002
#conf3DPVT
#citation21
#index4370
#arnetid4372

#*Octree approximation and compression methods.
#@Hanan Samet,Andrzej Kochut
#year2002
#conf3DPVT
#citation16
#index4371
#arnetid4373

#*Modeling of Free-Form Surfaces and Shape From Shading.
#@Subhajit Sanyal,Mayank Bansal,Subhashis Banerjee,Prem Kumar Kalra
#year2004
#conf3DPVT
#citation1
#index4372
#arnetid4374
#!Modeling a free-form 3D-surface from a single view has been a widely pursued problem. The existing schemes are either fully-automatic shape-from-X techniques or involve adept interaction from the user but little or no geometric (photometric) basis. We propose a novel scheme of interactive modeling of free-form lambertian surfaces where the solution obtained is consistent with the Shape from Shading model. To this end, a reinforcement learning based scheme has been adopted which allows user intervention at any stage of the algorithm to guide the SFS solution to a global minimum.

#*Automatic Extraction of Planar Projections from Panoramic Range Images.
#@Angel Domingo Sappa
#year2004
#conf3DPVT
#citation3
#index4373
#arnetid4375
#!This paper presents a segmentation technique to decompose automatically a panoramic range image into a set of planar projections. It consists of three stages. Firstly, two orthogonal surface orientation histograms are generated. Secondly, from these histograms the major surfaces' orientations are extracted. Finally, a histogram of distances is computed for each one of these orientations; it will be used to define the position of the projection planes as well as the corresponding clipping planes. The original panoramic range image is divided into as many planar projections as main directions in the orientation histograms are extracted. This technique can be used with both indoor and outdoor scenes. Experimental result with a panoramic range image is presented.

#*Surface Model Generation from Range Images of Industrial Environments.
#@Angel Domingo Sappa
#year2004
#conf3DPVT
#citation3
#index4374
#arnetid4376
#!This paper presents an hybrid segmentation technique that combines both the speed of an edge based approach with the robustness of a surface based approach. It consists of three stages. In the first stage a scan line approximation process extracts the edges contained into the given range image. These edges are later on used to define the positions of seed points. Through the second stage a two steps region growing technique is applied. First a 2D growing process enlarges the original seed points generating bigger regions. Next, each region is fitted to a plane and a cylinder. The one that best fit the given points is selected to represent that region and used during the 3D growing stage. The 3D growing stage is carried out taking into account the approximation error from candidate points to be added to the fitted surface. In this way, each surface is grown until no points can be added according to a user defined threshold. Finally, in the third stage, a post-processing algorithm merges neighbour regions that belong to the same surface. Experimental results by using industrial environments are presented.

#*Unsupervised Motion Classification by Means of Efficient Feature Selection and Tracking.
#@Angel Domingo Sappa,Niki Aifanti,Sotiris Malassiotis,Michael G. Strintzis
#year2004
#conf3DPVT
#citation2
#index4375
#arnetid4377
#!This paper presents an efficient technique for human motion recognition; in particular, it is focused on labeling a movement as a walking or running displacement, which are the most frequent type of locomotion. The proposed technique consists of two stages and is based on the study of feature points' trajectories. The first stage detects peaks and valleys of points' trajectories, which are used on the second stage to discern whether the movement corresponds to a walking or a running displacement. Prior knowledge of human body kinematics structure together with the corresponding motion model are the basis for the motion recognition. Experimental results with different video sequences are presented.

#*Modeling closed surfaces in a multi-resolution fashion.
#@Augusto Sarti,Stefano Tubaro
#year2002
#conf3DPVT
#citation0
#index4376
#arnetid4378

#*Compression of Isosurfaces for Structured Volumes with Context Modelling.
#@Dietmar Saupe,Jens-Peer Kuska
#year2002
#conf3DPVT
#citation4
#index4377
#arnetid4379

#*Second Order Local Analysis for 3D Reconstruction of Specular Surfaces.
#@Silvio Savarese,Min Chen,Pietro Perona
#year2002
#conf3DPVT
#citation6
#index4378
#arnetid4380

#*Implementation of a Shadow Carving System for Shape Capture.
#@Silvio Savarese,Holly E. Rushmeier,Fausto Bernardini,Pietro Perona
#year2002
#conf3DPVT
#citation8
#index4379
#arnetid4381

#*3D Reality Modelling: Photo-Realistic 3D Models of Real World Scenes.
#@Vítor Sequeira,João G. M. Gonçalves
#year2002
#conf3DPVT
#citation31
#index4380
#arnetid4382

#*A Formulation of Boundary Mesh Segmentation.
#@Ariel Shamir
#year2004
#conf3DPVT
#citation76
#index4381
#arnetid4383
#!We present a formulation of boundary mesh segmentation as an optimization problem. Previous segmentation solutions are classified according to the different segmentation goals, the optimization criteria and the various algorithmic techniques used. We identify two primarily distinct types of mesh segmentation, namely partssegmentation and patch segmentation. We also define generic algorithms for the major techniques used for segmentation.

#*Extraction and Description of 3D (Articulated) Moving Objects.
#@Karl J. Sharman,Mark S. Nixon,John N. Carter
#year2002
#conf3DPVT
#citation8
#index4382
#arnetid4384

#*Pyramid Coordinates for Morphing and Deformation.
#@Alla Sheffer,Vladislav Kraevoy
#year2004
#conf3DPVT
#citation89
#index4383
#arnetid4385
#!Many model editing operations, such as morphing, blending, and shape deformation, require the ability to interactively transform the surface of a model in response to some control mechanism. For most computer graphics applications, it is important to preserve the local shape properties of input models during editing operations. Our work introduces the first, to our knowledge, mesh editing technique that explicitly preserves local shape properties. The method is based on a local shape representation, which we refer to as pyramid coordinates. The pyramid coordinates capture the local shape of the mesh around each vertex and help maintain this shape under various editing operations. They are based on a set of angles and lengths relating a vertex to its immediate neighbors. This representation is invariant under rigid transformations. Using pyramid coordinates, we introduce a new technique for mesh deformation and morphing based on a small number of user-specified control vertices. Our algorithm generate natural looking deformations and morphing sequences in seconds with minimal user interaction.

#*Unifying Measured Point Sequences of Deforming Objects.
#@Mikio Shinya
#year2004
#conf3DPVT
#citation8
#index4384
#arnetid4386
#!Recent progress in digitizing technologies is making it possible to capture the 3D shapes of moving objects. To efficiently utilize time series records of spatial data, the information must be unified to yield coherent deforming models. This paper presents a general method that unifies unregistered 3D point sequences to generate deforming mesh models. The method does not assume any specific kinematic structure, and is applicable to any digitizer. The method first polygonizes the initial points and then deforms meshes to best fit the subsequent data points while minimizing the deformation energy. Experiments are conducted on real measured data and CG data, and successful results are obtained. As an application of the method, we examine data compression and achieve a 380 fold reduction rate for a measured data sequence.

#*Surface Reconstruction from Multiple Views using Rational B-Splines and Knot Insertion.
#@Matheen Siddiqui,Stan Sclaroff
#year2002
#conf3DPVT
#citation6
#index4385
#arnetid4387

#*Efficient algorithm for the computation of 3D Fourier descriptors.
#@Jan Sijbers,Dirk Van Dyck
#year2002
#conf3DPVT
#citation4
#index4386
#arnetid4388

#*Visual-Hull Reconstruction from Uncalibrated and Unsynchronized Video Streams.
#@Sudipta N. Sinha,Marc Pollefeys
#year2004
#conf3DPVT
#citation16
#index4387
#arnetid4389
#!We present an approach for automatic reconstruction of a dynamic event using multiple video cameras recording from different viewpoints. Those cameras do not need to be calibrated or even synchronized. Our approach recovers all the necessary information by analyzing the motion of the silhouettes in the multiple video streams. The first step consists of computing the calibration and synchronization for pairs of cameras. We compute the temporal offset and epipolar geometry using an efficient RANSAC-based algorithm to search for the epipoles as well as for robustness. In the next stage the calibration and synchronization for the complete camera network is recovered and then refined through maximum likelihood estimation. Finally, a visual-hull algorithm is used to the recover the dynamic shape of the observed object. For unsynchronized video streams silhouettes are interpolated to deal with subframe temporal offsets. We demonstrate the validity of our approach by obtaining the calibration, synchronization and 3D reconstruction of a moving person from a set of 4 minute videos recorded from 4 widely separated video cameras.

#*Image-Based Photo Hulls.
#@Gregory G. Slabaugh,Ronald W. Schafer,Mat C. Hans
#year2002
#conf3DPVT
#citation39
#index4388
#arnetid4390

#*Facial View Synthesis from a Single Image using Shape from Shading.
#@William A. P. Smith,Antonio Robles-Kelly,Edwin R. Hancock
#year2004
#conf3DPVT
#citation1
#index4389
#arnetid4391
#!We present a facial view synthesis technique based on explicit shape and reflectance information extracted from a single image. The technique combines an image based reflectance estimation process with a novel method of interpolating between needle-maps recovered using shape from shading. This allows images of a face to be synthesised under novel lighting, pose and skin reflectance given only one example image. We exploit facial symmetry by reflecting the needle-map of a rotated face to yield the needle-map of the face rotated in the opposite direction. This provides two needle-maps between which interpolation can be performed.

#*A Variational Analysis of Shape from Specularities using Sparse Data.
#@Jan Erik Solem,Henrik Aanæs,Anders Heyden
#year2004
#conf3DPVT
#citation24
#index4390
#arnetid4392
#!Looking around in our every day environment, many of the encountered objects are specular to some degree. Actively using this fact when reconstructing objects from image sequences is the scope of the shape from specularities problem. One reason why this problem is important is that standard structure from motion techniques fail when the object surfaces are specular. Here this problem is addressed by estimating surface shape using information from the specular reflections. A specular reflection gives constraints on the surface normal. The approach taken in this paper differs significantly from many earlier shape from specularities methods since the normal data used is sparse. The main contribution of this paper is to give a solid foundation for shape from specularities problems. Estimation of surface shape using reflections is formulated as a variational problem and the surface is represented implicitly using a level set formulation. A functional incorporating all surface constraints is proposed and the corresponding level set motion PDE is explicitly derived. This motion is then proven to minimize the functional. As a part of this functional a variational approach to normal alignment is proposed and analyzed. Also novel methods for implicit surface interpolation to sparse point sets are presented together with a variational analysis. Experiments on both real and synthetic data support the proposed method.

#*Surface Reconstruction from the Projection of Points, Curves and Contours.
#@Jan Erik Solem,Fredrik Kahl
#year2004
#conf3DPVT
#citation5
#index4391
#arnetid4393
#!In this paper the problem of building and reconstructing geometrical surface models from multiple calibrated images is considered. We build an appropriate statistical 3D model from the images alone and show how this a priori model can be used to automatically reconstruct new instances of the object category from one or several images. The surface reconstruction method is based on a level set representation and one of the main novel contributions lie within the level set framework. Standard methods use either image-correlation or point correspondences to achieve this goal. We show how this framework can be extended to incorporate image curves and apparent contours (i.e. the projections of silhouettes). In order to automatically obtain feature correspondences, we use a statistical shape modelfor the object category of interest. The model is based on the Active Shape Model using Probabilistic PCA. The scheme is applied to build and automatically reconstruct 3D surface models of faces. The resulting system is demonstrated on a database of real face images.

#*Browsing 3-D spaces with 3-D vision: body-driven navigation through the Internet city.
#@Flavia Sparacino,Christopher Richard Wren,Ali Azarbayejani,Alex Pentland
#year2002
#conf3DPVT
#citation16
#index4392
#arnetid4394

#*f3d - A File Format and Tools for Storage and Manipulation of Volumetric Data Sets.
#@Milos Srámek,Leonid I. Dimitrov
#year2002
#conf3DPVT
#citation8
#index4393
#arnetid4395

#*Efficient Model Creation of Large Structures based on Range Segmentation.
#@Ioannis Stamos,Marius Leordeanu
#year2004
#conf3DPVT
#citation0
#index4394
#arnetid4396
#!This paper describes an efficient 3D modeling method from 3D range data-sets that is utilizing range data segmentation. Our algorithm starts with a set of unregistered 3D range scans of a large scale scene. The scans are being pre-processed for noise removal and hole filling. The next step is range segmentation and the extraction of planar and linear features. These features are utilized for the automatic registration of the range scans into a common frame of reference [Automated feature-based range registration of urban scenes of large scale]. A volumetric-based algorithm is used for the construction of a coherent 3D mesh that encloses all range scans. Finally, the original segmented scans are used in order to simplify the constructed mesh. The mesh can now be represented as a set of planar regions at areas of low complexity and as a set of dense mesh triangular elements at areas of high complexity. This is achieved by computing the overlaps of the original segmented planar areas on the generated 3D mesh. The example of the construction of the 3D model of a building in the NYC area is presented.

#*PDE-based Multi-view Depth Estimation.
#@Christoph Strecha,Luc J. Van Gool
#year2002
#conf3DPVT
#citation17
#index4395
#arnetid4397

#*Triangle Mesh-Based Surface Modeling Using Adaptive Smoothing and Implicit Surface Texture Integration.
#@Yiyong Sun,David L. Page,Joon Ki Paik,Andreas Koschan,Mongi A. Abidi
#year2002
#conf3DPVT
#citation6
#index4396
#arnetid4398

#*Image Matching based on Co-Motion Statistics.
#@Zoltán Szlávik,Laszlo Havasi,Tamás Szirányi
#year2004
#conf3DPVT
#citation4
#index4397
#arnetid4399
#!This paper presents a method for matching partially overlapping image-pairs where the object of interest is in motion, even if the motion is discontinuous and in an unstructured environment. In a typical outdoor multi-camera surveillance system, an observed object as seen by separate cameras may appear very different, due to the variable influence of factors such as lighting conditions and camera angles. Thus static features such as object color, shape, and contours cannot be used for image matching. In this paper a different method is proposed for matching partially overlapping images captured by such cameras. The matching is achieved by calculation of co-motion statistics, followed by detection and rejection of points outside the overlap area and a nonlinear optimization process. The robust algorithm we describe finds point correspondences in two images without searching for any structures and without the need for tracking continuous motion. Trials using statistical motion-based image cross-registration, a robust rejection algorithm, and automatic 3D image-transformation and camera calibration on real-life outdoor images have demonstrated the feasibility of this approach.

#*Robust 3D Segmentation for Underwater Acoustic Images.
#@Linmi Tao,Umberto Castellani,Vittorio Murino
#year2004
#conf3DPVT
#citation5
#index4398
#arnetid4400
#!In this paper, a new technique for 3D acoustic image segmentation and modelling is proposed. Especially, in the underwater environment, in which optical sensors suffer from visibility problems, the acoustical devices may provide efficient solutions, but, on the other hand, acoustic image interpretation is surely more difficult for a human operator. The proposed application involves the use of an acoustic camera which directly acquires images structured as a set of 3D points. Due to the noisy nature of this type of data, the segmentation problem becomes more challenging and the standard algorithms for range image segmentation are likely to fail. The proposed method is based on a simplified version of the so called recover and select paradigm in which the seed areas, from which the segmentation starts, are generated by adopting a robust approach based on the RANSAC (RANdom Sample And Consensus) algorithm. Superquadric primitives are directly recovered from raw data without any pre-segmentation processing. Experimental trials using both synthetic and real acoustical images confirm the goodness of the method, and a large robustness of the resulting segmented images, associated to a relatively low computational load.

#*A Tensor Voting Approach for the Hierarchical Segmentation of 3-D Acoustic Images.
#@Linmi Tao,Vittorio Murino,Gérard G. Medioni
#year2002
#conf3DPVT
#citation1
#index4399
#arnetid4401

#*Advances in Mesh Signal Processing and Geometry Compression.
#@Gabriel Taubin
#year2002
#conf3DPVT
#citation0
#index4400
#arnetid4402

#*3D image sequence acquisition for TV & film production.
#@Graham A. Thomas,Oliver Grau
#year2002
#conf3DPVT
#citation10
#index4401
#arnetid4403

#*Panoramic Image Transform of Omnidirectional Images Using Discrete Geometry Techniques.
#@Akihiko Torii,Atsushi Imiya
#year2004
#conf3DPVT
#citation3
#index4402
#arnetid4404
#!This paper proposes an omnidirectional-to-panoramic image transform with high accuracy using PDE-based resampling models. For the application of computer-vision techniques to omnidirectional images, the transformation of omnidirectional images to uniform-resolution quadric-surface images is needed in the two reasons. First, an omni-directional image does not have a uniform resolution. Second, the development of the computer-vision-based techniques on the quadric surface is mathematically accurate compared with the development of the techniques on the omnidirectional image directly. Therefore, our aim is to generate uniform-resolution panoramic images on cylindrical surface from nonuniform-resolution omnidirectional images. The uniform-resolution panoramic images allow us to reconstruct 3D objects and scenes from omnidirectional images robustly. Our panoramic transformation selects the uniform resolution pixels on omnidirectional images employing the geometrical configuration of cameras in the estimation and resampling process. Therefore, our method is mathematically accurate comparing to the traditional panoramic transformation using point-to-point correspondences with the geometries of cameras and the cubic convolution.

#*Generalized RANSAC Framework for Relaxed Correspondence Problems.
#@Wei Zhang,Jana Kosecka
#year2006
#conf3DPVT
#citation14
#index4403
#arnetid4405
#!Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the wide-baseline matching using scale and/or affine invariant features the search for correspondences typically proceeds in two stages. In the first stage a putative set of correspondences is obtained based on distances between feature descriptors. In the second stage the matches are refined by imposing global geometric constraints by means of robust estimation of the epipolar geometry and the incorrect matches are rejected as outliers. For a feature in one view, usually only one "best" feature (the nearest neighbor) in the other view is chosen as corresponding feature, despite the fact that several match candidates exist. In this paper, we will consider multiple candidate matches for each feature, and integrate this choice with the robust estimation stage, thus avoiding the early commitment to the "best" one. This yields a generalized RANSAC framework for identifying the true correspondences among sets of matches. We examine the effectiveness of different sampling strategies for sets of correspondences and test the approach extensively using real examples of hard correspondence problems caused by a large motion between views and/or ambiguities due to repetitive scene structures.

#*Exploitation of 3D Images for Face Authentication Under Pose and Illumination Variations.
#@Filareti Tsalakanidou,Sotiris Malassiotis,Michael G. Strintzis
#year2004
#conf3DPVT
#citation2
#index4404
#arnetid4406
#!An appearance-based face authentication system integrating 2D color or intensity images and 3D data is presented in this paper. The proposed system is based on a low-cost 3D and color sensor, capable of synchronous real-time acquisition of 3D images and associated color images. Novel algorithms are proposed that exploit depth information and prior knowledge of face geometry and symmetry to achieve robust face detection, localization and authentication under conditions of background clutter, occlusion, face pose alteration and harsh illumination. A method for the enrichment of face databases with synthetically generated views depicting variations in pose and illumination is proposed to cope with head rotations and illumination variations, avoiding a cumbersome enrolment process. The performance of the proposed authentication scheme is tested thoroughly on a face database of 1500 images, recorded with the 3D acquisition system. Experimental results demonstrate significant gains resulting from the combined use of depth and color or intensity information, in comparison to the use of 2D images alone.

#*Archiving 3D Cultural Objects with Surface Point-Wise Database Information.
#@N. Tsirliganis,George Pavlidis,A. Koutsoudis,D. Papadopoulou,A. Tsompanopoulos,Kostas Stavroglou,Z. Loukou,Christodoulos Chamzas
#year2002
#conf3DPVT
#citation7
#index4405
#arnetid4407

#*A Unified Representation for Interactive 3D Modeling.
#@Dragan Tubic,Patrick Hébert,Jean-Daniel Deschênes,Denis Laurendeau
#year2004
#conf3DPVT
#citation-1
#index4406
#arnetid4408
#!Interactive 3D modeling is the process of building a 3D model of an object or a scene in real-time while the 3D (range) data is acquired. This is possible only if the computational complexity of all involved algorithms is linear with respect to the amount of data. We propose a new framework for 3D modeling where a complete modeling chain meets with this requirement. The framework is based on the use of vector fields as an implicit surface representation. Each modeling step, registration, surface reconstruction, geometric fusion, compression and visualization is solved and explained using the vector fields without anyintermediate representations. The proposed framework allows model reconstruction from any type of 3D data, surface patches, curves, unorganized sets of points or a combination of these.

#*A Volumetric Approach for Interactive 3D Modeling.
#@Dragan Tubic,Patrick Hébert,Denis Laurendeau
#year2002
#conf3DPVT
#citation21
#index4407
#arnetid4409
#%835046
#%593196
#%1031095
#%593210
#%594078
#%834918
#%236043
#%835178
#%1031124
#%1121280
#%1017300
#%835492
#%4085
#%946143
#%1031102
#%593626
#%293870
#!Range image registration and surface reconstruction have been traditionally considered as two independent processes where the latter relies on the results of the former. This paper presents a new approach to surface recovery from range images where the two processes are unified and performed in a common volumetric representation. While the reconstructed surface is described in its implicit form as a signed distance field within a volume, registration information for matching partial surfaces is encoded in the same volume as the gradient of the distance field. This allows coupling of both reconstruction and registration and leads to an algorithm whose complexity is linear with respect to the number of images and the number of measured 3D points. The close integration and performance gain improve interactivity in the process of modeling from range image acquisition to surface reconstruction. The distances computed in the direction of filtered normals improve robustness while preserving the sharp details of the initial range images. It is shown that the integrated algorithm is tolerant to initial registration errors as well as to measurement errors. The paper describes the representation and formalizes the approach. Experimental results demonstrate performance advantages and tolerance to aforementioned types of errors.

#*A Closed-Form Solution for a Two-View Self-Calibration Problem under Fixation.
#@Toshio Ueshiba,Fumiaki Tomita
#year2004
#conf3DPVT
#citation2
#index4408
#arnetid4410
#!It is well known that the epipolar geometry between two uncalibrated perspective views is completely encapsulated in the fundamental matrix. Since the fundamental matrix has seven degrees of freedom (DOF), self-calibration is possible if at most seven of the intrinsic or extrinsic camera parameters are unknown by extracting them from the fundamental matrix. This paper presents a linear algorithm for self-calibrating a perspective camera which undergoes fixation, that is, a special motion in which the camera's optical axis is confined in a plane. Since this fixation has four degrees of freedom, which is one smaller than that of general motion, we can extract at most three intrinsic parameters from the fundamental matrix. We here assume that the focal length (1 DOF) and the principal point (2 DOF) are unknown but fixed for two views. It will be shown that these three parameters are obtained from the fundamental matrix in an analytical fashion and a closed-form solution is derived. We also characterize all the degenerate motions under which there exists an infinite set of solutions.

#*Long-range high-performance time-of-flight-based 3D imaging sensors.
#@Andreas Ullrich,Nikolaus Studnicka,Johannes Riegl,Simone Orlandini
#year2002
#conf3DPVT
#citation-1
#index4409
#arnetid4411

#*3-Dimensional Object Modeling with Mesh Simplification Based Resolution Adjustment.
#@Özgür Ulucay,Sarp Ertürk
#year2004
#conf3DPVT
#citation-1
#index4410
#arnetid4412
#!A 3-Dimensional (3-D) object modeling technique with mesh simplification and refinement based resolution adjustment is proposed in this paper. Polygonal models which are widely utilized in the modeling of 3-D objects are taken as basis, making use of the polygonal structure and vertex coordinates for the display of 3-D models. The amount of polygons and vertices of a model is proportional to the resolution as well as data quantity. In other words the resolution and data increases with the number of polygons. In this paper, it is proposed to utilize resolution, and hence data amount, adjustable 3-D modeling so that model resolution and transmitted data amount can be regulated according to access constraints.

#*Active Polygon for Object Tracking.
#@Gozde B. Unal,Hamid Krim,Anthony J. Yezzi
#year2002
#conf3DPVT
#citation4
#index4411
#arnetid4413

#*A Practical Approach for 3D Model Indexing by combining Local and Global Invariants.
#@Jean-Philippe Vandeborre,Vincent Couillet,Mohamed Daoudi
#year2002
#conf3DPVT
#citation37
#index4412
#arnetid4414

#*Protein folding using inter-residue contacts.
#@Michele Vendruscolo
#year2002
#conf3DPVT
#citation1
#index4413
#arnetid4415

#*Analysis of Three-Dimensional Motion of an Object Using a Fixed Monocular Camera .
#@Huynh Quang Huy Viet,Makoto Sato,Hiromi T. Tanaka
#year2004
#conf3DPVT
#citation2
#index4414
#arnetid4416
#!The research on analysis of three-dimensional motion by using a monocular camera instead of a stereo camera has important applications for making the microscopes used in microbiology or constructing the autonomous robots used in various fields of industry. In this paper, we propose a fixed monocular camera whose focus changed cyclically to recognize three-dimensional absolute motion of a rigid object.

#*3D Interactive, On-site Visualization of Ancient Olympia.
#@Vassilios Vlahakis,John Karigiannis,Nikolaos Ioannidis,Manolis Tsotros,Michael Gounaris,Didier Stricker,Patrick Dähne,Luís Almeida
#year2002
#conf3DPVT
#citation6
#index4415
#arnetid4417

#*Design of a Service-Based Framework for Generic 3D Information Visualization.
#@Xiangchuan Wang,Gerald Jaeschke,Matthias Hemmje
#year2002
#conf3DPVT
#citation0
#index4416
#arnetid4418

#*Posture Recognition nd Segmentation from 3D Human Body Scans.
#@Naoufel Werghi,Yijun Xiao
#year2002
#conf3DPVT
#citation11
#index4417
#arnetid4419

#*Fan-Meshes: A Geometric Primitive for Point-Based Description of 3D Models and Scenes.
#@Xiaotian Yan,Fang Meng,Hongbin Zha
#year2004
#conf3DPVT
#citation1
#index4418
#arnetid4420
#!We propose a new data structure, called Fan-Meshes (FM), for reconstructing 3D models and scenes represented by dense scanning point clouds. It is a local piecewise linear approximation to the data geometry, and can serve as primitives in reconstruction with a good balance between computational loads and reconstruction quality. In our algorithm, local remeshing is performed in preprocessing to obtain regular FMs, and a three-level-point data structure called Triangle Selection Record (TSR) is then used to reduce redundancies in the raw data and overlapping in the original FMs. Furthermore, to apply the method to raw 3D scanning data, we use a smoothing operator to the point cloud in order to eliminate some sensor noises. Experimental results demonstrate that our scheme is effective even for large-scale scenes with real data.

#*Uncalibrated Narrow Baseline Augmented Reality.
#@Annie Yao,Andrew Calway
#year2002
#conf3DPVT
#citation1
#index4419
#arnetid4421

#*A Surface Evolution Approach o Probabilistic Space Carving.
#@Anthony J. Yezzi,Gregory G. Slabaugh,Adrian Broadhurst,Roberto Cipolla,Ronald W. Schafer
#year2002
#conf3DPVT
#citation12
#index4420
#arnetid4422

#*Reconstruction of Three Dimensional Models from Real Images.
#@Ulas Yilmaz,Adem Yasar Mülayim,Volkan Atalay
#year2002
#conf3DPVT
#citation6
#index4421
#arnetid4423

#*Speech-Driven Face Synthesis from 3D Video.
#@Ioannis A. Ypsilos,Adrian Hilton,Aseel Turkmani,Philip J. B. Jackson
#year2004
#conf3DPVT
#citation4
#index4422
#arnetid4424
#!This paper presents a framework for speech-driven synthesis of real faces from a corpus of 3D video of a person speaking.Video-rate capture of dynamic 3D face shape and colour appearance provides the basis for a visual speech synthesis model.A displacement map representation combines face shape and colour into a 3D video.This representation is used to efficiently register and integrate shape and colour information captured from multiple views.To allow visual speech synthesis viseme primitives are identified from the corpus using automatic speech recognition. A novel non-rigid alignment algorithm is introduced to estimate dense correspondence between 3D face shape and appearance for different visemes.The registered displacement map representation together with a novel optical flow optimisation using both shape and colour, enables accurate and efficient non-rigid alignment.Face synthesis from speech is performed by concatenation of the corresponding viseme sequence using the non-rigid correspondence to reproduce both 3D face shape and colour appearance. Concatenative synthesis reproduces both viseme timing and co-articulation.Face capture and synthesis has been performed for a database of 51 people.Results demonstrate synthesis of 3D visual speech animation with a quality comparable to the captured video of a person.

#*Multi-Camera Reconstruction based on Surface Normal Estimation and Best Viewpoint Selection.
#@Xenophon Zabulis,Kostas Daniilidis
#year2004
#conf3DPVT
#citation16
#index4423
#arnetid4425
#!In this paper, we present a new algorithm for reconstructing an environment from images recorded by multiple calibrated cameras. Multiple camera systems challenge traditional stereo algorithms in many issues including view registration, selection of commonly visible image parts for matching, and the fact that surfaces are imaged differently from different viewpoints and poses. On the other hand, multiple cameras have the advantage of revealing surfaces at occluding contours and covering wide areas. The presented algorithm makes no assumption on camera loci and outputs an occupancy voxel grid, with occupied voxels being accompanied by a surface normal. It is correlation-based, however, outperforms the conventional correlation-based approach in reconstruction quality. It is highly parallelizable, and most importantly, is robust against artifacts due to camera registration errors that are typically encountered when using multiple cameras.

#*Rapid Shape Acquisition Using Color Structured Light and Multi-pass Dynamic Programming.
#@Li Zhang,Brian Curless,Steven M. Seitz
#year2002
#conf3DPVT
#citation214
#index4424
#arnetid4426

#*The Meaning and Limitations of Protein Structure Alignments.
#@Baohong Zhang,Adam Godzik
#year2002
#conf3DPVT
#citation2
#index4425
#arnetid4427

#*Mosaic Construction from a Sparse Set of Views.
#@Wei Zhang,Jana Kosecká,Fayin Li
#year2002
#conf3DPVT
#citation4
#index4426
#arnetid4428

#*Focal Region-Guided Feature-Based Volume Rendering.
#@Jianlong Zhou,Manfred Hinz,Klaus D. Tönnies
#year2002
#conf3DPVT
#citation20
#index4427
#arnetid4429

#*3D Modelling and Visualization of the Human Lung.
#@Tatjana Zrimec,Sata Busayarat
#year2004
#conf3DPVT
#citation5
#index4428
#arnetid4430
#!A method for modelling and visualizing human lungs using knowledge of lung anatomy and High Resolution CT (HRCT) images is presented. The model consists of a symbolic description of lung anatomy and a 3D atlas. The 3D atlas is constructed using HRCT volume data. A few anatomical landmarks are determined and are used to divide the lungs into anatomically and diagnostically important regions. The landmarks and the lung regions enable accurate mapping of the model to patient data and enable the system to deal with image and human variability. The model can be displayed as a set of labelled axial slices and as a 3D model of the lungs. The 3D visualization enables rotation and viewing of lung structures, lungfeatures and lung regions from different angles.

#*Hue Flows and Scene Structure.
#@Steven W. Zucker
#year2004
#conf3DPVT
#citation0
#index4429
#arnetid4431

#*Geometry of Contour-based Correspondence for Stereo.
#@Steven W. Zucker,Gang Li
#year2002
#conf3DPVT
#citation0
#index4430
#arnetid4432

#*Hierarchical Representation of Virtual Cities for Progressive Transmission over Networks.
#@Jérôme Royan,R. Balter,Christian Bouville
#year2006
#conf3DPVT
#citation-1
#index4431
#arnetid4433
#!Interactive network-based navigation over large urban environments raises difficult problems due to the size and complexity of these scenes. In this paper, we present a clientserver system allowing navigation over 3D cities in real time. Due to a novel progressive and hierarchical representation of 3D models of densely built urban areas, only perceptible details for all the regions visible from a given viewpoint are progressively streamed to visualisation clients. Furthermore, efficient coding methods are used to compress the representation data allowing quick start-up of the interactive visualisation with a highly-detailed model. This is achieved through a set of dedicated algorithms allowing a very large city model to be structured into a multi-resolution representation. The method efficiently exploits the fact that most automated modelling techniques of urban scenes provides 2D\frac{1} {2} models (building footprint, height, altitude, ...). So as to efficiently and faithfully model complex buildings, a procedural representation for roofs and facades is proposed. Finally, we present an MPEG4 compatible implementation based on the introduction of new node types with the associated bitstream.

#*Image Guided Geometry Inference.
#@Songhua Xu,Athinodoros S. Georghiades,Holly E. Rushmeier,Julie Dorsey,Leonard McMillan
#year2006
#conf3DPVT
#citation6
#index4432
#arnetid4434
#!We introduce a new method for filling holes in geometry obtained from 3D range scanners. Our method makes use of 2D images of the areas where geometric data is missing. The 2D images guide the filling using the relationship between the images and geometry learned from the existing 3D scanned data. Our method builds on existing techniques for using scanned geometry and for estimating shape from shaded images. Rather than creating plausibly filled holes, we attempt to approximate the missing geometry. We present results for scanned data from both triangulation and time-of-flight scanners for various types of materials. To quantitatively validate our proposed method, we also compare the filled areas with ground-truth data.

#*Scanline Optimization for Stereo on Graphics Hardware.
#@Christopher Zach,Mario Sormann,Konrad F. Karner
#year2006
#conf3DPVT
#citation6
#index4433
#arnetid4435
#!In this work we propose a scanline optimization procedure for computational stereo using a linear smoothness cost model performed by programmable graphics hardware. The main idea for an efficient implementation of this dynamic programming approach is a recursive scheme to calculate the min-convolution in a manner suitable for the parallel stream computation model of graphics processing units. Since many image similarity functions can be efficiently calculated by modern graphics hardware, it is reasonable to address the final disparity extraction by graphics processors as well. Our timing results indicate that the proposed approach is beneficial for larger image resolutions and disparity ranges in particular.

#*A Robust Correlation Measure for Correspondence Estimation.
#@Maria F. Trujillo,Ebroul Izquierdo
#year2004
#conf3DPVT
#citation4
#index4434
#arnetid4436
#!A median correlation for the estimation of corresponding points in stereovision is proposed. It is based on the normalised correlation coefficient using the median instead of the mean. Its performance appears to be superior than conventional correlation specially in depth discontinuities image areas. This conclusion is derived from an empirical evaluation in which the proposed correlation is compared with the normalised correlation coefficient and the sum of absolute difference. The results show that the median correlation produces higher scores and lower estimation errors.

#*Scale Selection for the Analysis of Point-Sampled Curves.
#@Ranjith Unnikrishnan,Jean-François Lalonde,Nicolas Vandapel,Martial Hebert
#year2006
#conf3DPVT
#citation7
#index4435
#arnetid4437
#!An important task in the analysis and reconstruction of curvilinear structures from unorganized 3-D point samples is the estimation of tangent information at each data point. Its main challenges are in (1) the selection of an appropriate scale of analysis to accommodate noise, density variation and sparsity in the data, and in (2) the formulation of a model and associated objective function that correctly expresses their effects. We pose this problem as one of estimating the neighborhood size for which the principal eigenvector of the data scatter matrix is best aligned with the true tangent of the curve, in a probabilistic sense. We analyze the perturbation on the direction of the eigenvector due to finite samples and noise using the expected statistics of the scatter matrix estimators, and employ a simple iterative procedure to choose the optimal neighborhood size. Experiments on synthetic and real data validate the behavior predicted by the model, and show competitive performance and improved stability over leading polynomial-fitting alternatives that require a preset scale.

#*3D Reconstruction of Natural Scenes with View-Adaptive Multi-Texturing.
#@Karsten Müller,Aljoscha Smolic,Philipp Merkle,Bernhard Kaspar,Peter Eisert,Thomas Wiegand
#year2004
#conf3DPVT
#citation4
#index4436
#arnetid4438
#!We present a 3D reconstruction and modeling system that operates on a number of input photographs that show a natural scene. Approaches from computer graphics and image processing are combined and performance is shown via experiments. Furthermore, reconstruction quality is analyzed w.r.t. the number and distribution of textures, used for reconstruction. The reconstruction pipeline starts with image acquisition, which consists of a number of photographs of the scene that are sequentially taken at different positions. Since the photographs are not acquired concurrently, they are influenced by different illumination conditions that we mandate to be preserved in the final 3D representation. In the second step, object segmentation is applied and camera calibration provided. This allows the application of shape-from-silhouette approaches, namely a hierarchical voxel approach, where different resolution layers are organized within an octree structure. For applying texture mapping, the voxel model is transformed into a wireframe, which provides smoothing of the object's surface and also reduces the number of surface primitives. Finally, a subset of original images is mapped onto the 3D geometry to provide texture information. Here, view-adaptive multi-texturing is used to preserve natural illumination. Intermediate views are interpolated automatically using adaptive real-time weight calculations for original textures.

#*Efficient Constraint Evaluation Algorithms for Hierarchical Next-Best-View Planning.
#@Kok-Lim Low,Anselmo Lastra
#year2006
#conf3DPVT
#citation9
#index4437
#arnetid4439
#!We recently proposed a new and efficient next-best-view algorithm for 3D reconstruction of indoor scenes using active range sensing. We overcome the computation difficulty of evaluating the view metric function by using an adaptive hierarchical approach to exploit the various spatial coherences inherent in the acquisition constraints and quality requirements. The impressive speedups have allowed our NBV algorithm to become the first to be able to exhaustively evaluate a large set of 3D views with respect to a large set of surfaces, and to include many practical acquisition constraints and quality requirements. The success of the algorithm is greatly dependent on the implementation efficiency of the constraint and quality evaluations. In this paper, we describe the algorithmic details of the hierarchical view evaluation, and present efficient algorithms that evaluate sensing constraints and surface sampling densities between a view volume and a surface patch instead of simply between a single view point and a surface point. The presentation here provides examples for the design of efficient algorithms for new sensing constraints.

#*3D Face Recognition with Region Committee Voting.
#@Timothy C. Faltemier,Kevin W. Bowyer,Patrick J. Flynn
#year2006
#conf3DPVT
#citation27
#index4438
#arnetid4440
#!In this paper, we introduce a new system for face recognition by matching 3D face shape. This algorithm selects multiple regions of the face for matching in an attempt to reduce the effects caused by variations in expression between gallery and probe images. Experimental results are reported using the Face Recognition Grand Challenge v2.0 data set. Our results demonstrate improved performance relative to those of four previous papers using this same data set.

#*Towards On-Line Digital Doubles.
#@Andreas Griesser,Nico Cornelis,Luc J. Van Gool
#year2006
#conf3DPVT
#citation0
#index4439
#arnetid4441
#!We present a modular system for real-time 3D-scanning of human bodies under motion. The high-resolution shape and colour appearance is captured by several scanning units positioned around the object of interest. Each of these units performs a foreground-background segmentation and computes a valid depth-range for the spatially neighbouring units. Multiple depth-ranges are combined in a visual hull representation, which limits the search-range for the 3D-reconstruction. Depth-estimation is based on a hierarchical mult-view-stereo plane sweep approach. Robustness and accuracy is increased by incorporating imperceptible infrared illumination as well as adding local pixel gradient information. All parts of the processing pipeline, involving camera color conversions, segmentation, depth-range computation, visual-hull generation, lossless image compression, network transfer of the infrared and colour images, and the plane sweep algorithm, are implemented on the GPU and highly optimized for speed, allowing scanning times of less than 40ms per frame. Experimental results demonstrate the applicability of our system to the creation of high-density on-line digital doubles.

#*High-Quality Real-Time Stereo Using Adaptive Cost Aggregation and Dynamic Programming.
#@Liang Wang,Miao Liao,Minglun Gong,Ruigang Yang,David Nistér
#year2006
#conf3DPVT
#citation76
#index4440
#arnetid4442
#!We present a stereo algorithm that achieves high quality results while maintaining real-time performance. The key idea is simple: we introduce an adaptive aggregation step in a dynamic-programming (DP) stereo framework. The per-pixel matching cost is aggregated in the vertical direction only. Compared to traditional DP, our approach reduces the typical "streaking" artifacts without the penalty of blurry object boundaries. Evaluation using the benchmark Middlebury stereo database shows that our approach is among the best (ranked first in the new evaluation system) for DP-based approaches. The performance gain mainly comes from a computationally expensive weighting scheme based on color and distance proximity. We utilize the vector processing capability and parallelism in commodity graphics hardware to speed up this process over two orders of magnitude. Over 50 million disparity evaluations per second (MDE/s)1 are achieved in our current implementation.

#*A Spatio-Temporal Modeling Method for Shape Representation.
#@Heng Huang,Li Shen,Rong Zhang,Fillia Makedon,Justin D. Pearlman
#year2006
#conf3DPVT
#citation3
#index4441
#arnetid4443
#!The spherical harmonic (SPHARM) description is a powerful surface modeling technique that can model arbitrarily shaped but simply connected three dimensional (3D) objects. Because SPHARM based 3D models can derive functional information analysis and classify different pathological symptoms, it has been used in many applications in biomedical image computing. There is an urgent requirement for efficient spatio-temporal shape modeling to represent the dynamic anatomical structures in many applications (e.g., medical image analysis, geospatial information systems). In this paper we propose a novel real spherical harmonics based spatio-temporal shape modeling method to efficiently and flexibly represent the shapes sequence of anatomical structures in medical images. Our method works well on the simply connected 3D objects and the effectiveness of our approach is demonstrated through theoretic and experimental exploration of a set of medical image applications. Furthermore, an evaluation criterion for spatio-temporal shape modeling efficiency is proposed and the comparison results showed the good performance of our method.

#*Efficient, Precise, and Accurate Utilization of the Uniqueness Constraint in Multi-View Stereo.
#@Xenophon Zabulis,Georgios Kordelas
#year2006
#conf3DPVT
#citation5
#index4442
#arnetid4444
#!In this paper, the depth cue due to the assumption of texture uniqueness is reviewed. The spatial direction over which a similarity measure is optimized, in order to establish a stereo correspondence, is considered and methods to increase the precision and accuracy of stereo reconstructions are presented. An efficient implementation of the above methods is offered, based on optimizations that evaluate potential correspondences hierarchically, in the spatial and angular dimensions. Furthermore, the expansion of the above techniques in a multi-view framework where calibration errors cause the misregistration of individually obtained reconstructions are considered, and a treatment of the data is proposed for the elimination of duplicate reconstructions of a single surface point. Finally, a processing step is proposed for the increase of reconstruction precision and post-processing of the final result. The above contributions are integrated in a generic and parallelizable implementation of the uniqueness constraint to observe speedup and increase in the fidelity of surface reconstruction.

#*Orientation of Fragments of Rotationally Symmetrical 3D-Shapes for Archaeological Documentation.
#@Hubert Mara,Robert Sablatnig
#year2006
#conf3DPVT
#citation2
#index4443
#arnetid4445
#!Motivated by the requirements of modern archaeologists, we are developing a documentation system based on structured light for acquisition of ceramics. Fragments of ceramics are daily finds at excavations and important for archaeological research, because their shape leads to information about ancient cultures. The shapes used for documentation are called profile lines and estimated by a vertical cross-section of orientated fragments. As ceramics have been produced using rotational plates for several thousands of years, the rotational axis can be used for orientation. Therefore we conducted experiments using existing methods for estimation of the rotational axis. The drawbacks of these methods are the requirement of either complete objects or industrialized quality of symmetry. Therefore we show a new method using circle templates, which has been inspired by the manual method of archaeologists. In this work we present results using previous and related work in comparison with the estimation of the rotational axis using circle templates. The results of the presented methods are shown for synthetic data, well-known fragments and real data acquired at an archaeological excavation. Finally a conclusion and an outlook is given.

#*Point Containment in Discrete Arbitrary Dimension.
#@Luciano Silva
#year2006
#conf3DPVT
#citation0
#index4444
#arnetid4446
#!The point containment predicate which specifies if a point is part of a mathematically defined shape is one of the most elementary operations in computer graphics and is a natural way to perform the many raster calculations. It plays an essential role in several important processes such as filling, stroking, anti-aliasing, geometric modeling and volume rendering. This paper presents a generalized point containment algorithm for arbitrary dimension discrete objects whose main characteristics are low complexity, simple data structures and suitability for hardware implementation.

#*VisTRE: A Visualization Tool to Evaluate Errors in Terrain Representation.
#@Christopher G. Healey,Jack Snoeyink
#year2006
#conf3DPVT
#citation1
#index4445
#arnetid4447
#!New data sources and sensors bring new possibilities for terrain representations, and new types of characteristic errors. We develop a system to visualize and compare terrain representations and the errors they produce.

#*Exploiting 3D Spatial Continuity for Robust Automatic Horizon Matching across Faults.
#@Fitsum Admasu,Klaus D. Tönnies
#year2006
#conf3DPVT
#citation1
#index4446
#arnetid4448
#!Oil and gas exploration decisions are made based on inferences obtained from seismic data interpretation. The interpretation task is getting very time-consuming as seismic data sets become larger. Image processing tools such as auto-trackers assist manual interpretation of horizons-visible boundaries between certain sediment layers in seismic data. Auto-trackers assume data continuities; therefore, their assistance is very limited in areas of discontinuities such as faults. In this paper, we present a method for automatic horizon matching across faults based on a Bayesian approach. A stochastic matching model which integrates 3d spatial information of seismic data and prior geological knowledge is introduced. The optimal matching solution is found by MAP estimate of this model. A simulated annealing with reversible jump Markov Chain Monte Carlo algorithm is employed to sample from a-posteriori distribution. The model was applied to real 3d seismic data, and has shown to produce geologically acceptable horizons matchings.

#*A Range Camera Collecting Multi-Spectral Texture for Architecture Applications.
#@Nicola Brusco,S. Capeleto,M. Fedel,A. Paviotti,E. Zanella,L. Poletto,Guido M. Cortelazzo,G. Tondello
#year2006
#conf3DPVT
#citation2
#index4447
#arnetid4449
#!This work proposes a system for the automatic construction of multi-spectral 3D models of architecture. Besides the specific application which concerns the interactive visualization and the restoration of historical buildings, the interest of the proposed techniques lays in the multi-spectral nature of the textures which allow rendering with faithful colors and in the automatism of 3D model construction. The proposed system is an effective tool for producing 3D content amenable to a great number of applications.

#*Qualitative Characterization of Deforming Surfaces.
#@T. C. Lukins,R. B. Fisher
#year2006
#conf3DPVT
#citation3
#index4448
#arnetid4450
#!This paper extends the idea of classification schemes for static surface curvature into the temporal domain. We seek to identify regions in sequences of depth data that exhibit variations in shape change, and to characterise the nature of the deformation. From observing the change in principle curvatures we show how it is possible to decouple the type of change into one of fifteen classes, and also reveal the extent of alteration. Results are presented for synthetic and real data sequences, with additional alignment performed to accommodate global motion. This technique shows promise in analysing data from video-rate range sensors, with potential applications in biometric and psychological analysis of the face and other deformable objects.

#*Constraint Integration for Multiview Pose Estimation of Humans with Self-Occlusions.
#@Abhinav Gupta,Anurag Mittal,Larry S. Davis
#year2006
#conf3DPVT
#citation6
#index4449
#arnetid4451
#!Detection of articulated objects such as humans is an important task in computer vision. We present a system that incorporates a variety of constraints in a unified multi-view framework to automatically detect humans in possibly crowded scenes. These constraints include the kinematic constraints, the occlusion of one part by another and the high correlation between the appearance of parts such as the two arms. The graphical structure (non-tree) obtained is optimized in a nonparametric belief propagation framework using prior based search.

#*Structured Light Based Reconstruction under Local Spatial Coherence Assumption.
#@Hao Li,Raphael Straub,Hartmut Prautzsch
#year2006
#conf3DPVT
#citation7
#index4450
#arnetid4452
#!3D scanning techniques based on structured light usually achieve robustness against outliers by performing multiple projections to simplify correspondence. However, for cases such as dynamic scenes, the number of frames captured from a certain view must be kept as low as possible, which makes it difficult to reconstruct complex scenes with high frequency shapes and inappropriate reflection properties. To tackle this problem, we present a novel set of color stripe patterns and a robust correspondence algorithm that assume local spatial coherence in the captured data. This assumption allows us to design our stripe sequences with globally unique neighborhood properties to effectively avoid wrong correspondences. The concept of local spatial coherence is further exploited to make the ensuing surface reconstruction practically insensitive to noise, outliers, and anisotropic sampling density. Thus, the recovery of a topologically consistent manifold surface can be drastically simplified. We have successfully generated high quality meshes of various colored objects using a minimalistic projector-camera system. In particular, the full sampling capabilities of our devices can be exhausted by taking only three shots.

#*Recognition of Free-Form Objects in Complex Scenes Using DGI-BS Models.
#@Pilar Merchán,Antonio Adán,Santiago Salamanca
#year2006
#conf3DPVT
#citation4
#index4451
#arnetid4453
#!Object recognition in 3D scenes with occlusion means identifying an incomplete and unknown object, which is arbitrarily posed, in an object database. This hard computer vision problem is solved in this paper through a new 3D shape representation called Depth Gradient Image Based on Silhouette (DGI-BS). DGI-BS can be used to obtain a complete model as well as a partial model of an object. This property allows us to use it in complex scenes where incomplete surfaces of objects are available. The complete DGI-BS version synthesizes surface information (through depth image) and shape information (through contour) of the whole object in a single image smaller than 1 mega pixel. Object recognition is carried out by means of a simple matching algorithm in the DGI-BS space which yields a correspondence point-to-point between scene and model. This method has been successfully tested in real scenes with no special restrictions using range sensors.

#*Visual Hull Construction in the Presence of Partial Occlusion.
#@Li Guan,Sudipta N. Sinha,Jean-Sébastien Franco,Marc Pollefeys
#year2006
#conf3DPVT
#citation25
#index4452
#arnetid4454
#!In this paper, we propose a visual hull algorithm, which guarantees a correct construction even in the presence of partial occlusion, while "correct" here means that the real shape is located inside the visual hull. The algorithm is based on a new idea of the "extended silhouette", which requires the silhouette from background subtraction and the "occlusion mask" of the same view. In order to prepare the occlusion mask, we also propose a novel concept of "effective boundary" of moving foreground objects in a video obtained from a static camera. The accumulation of the effective boundary through time automatically gives robust occluder boundaries. We theoretically prove that our algorithm deterministically computes the tightest, correct visual hull in the presence of occlusion. Both synthetic and real examples are given as a demonstration of the correctness of the algorithm. Finally we analyze that this new algorithm is still within the time complexity of the traditional method.

#*Aerial LiDAR Data Classification Using Support Vector Machines (SVM).
#@Suresh K. Lodha,Edward J. Kreps,David P. Helmbold,Darren N. Fitzpatrick
#year2006
#conf3DPVT
#citation4
#index4453
#arnetid4455
#!We classify 3D aerial LiDAR scattered height data into buildings, trees, roads, and grass using the Support Vector Machine (SVM) algorithm. To do so we use five features: height, height variation, normal variation, LiDAR return intensity, and image intensity. We also use only LiDAR-derived features to organize the data into three classes (the road and grass classes are merged). We have implemented and experimented with several variations of the SVM algorithm with soft-margin classification to allow for the noise in the data. We have applied our results to classify aerial LiDAR data collected over approximately 8 square miles. We visualize the classification results along with the associated confidence using a variation of the SVM algorithm producing probabilistic classifications. We observe that the results are stable and robust. We compare the results against the ground truth and obtain higher than 90% accuracy and convincing visual results.

#*Resolution Scalable Coding and Region of Interest Access with Three-Dimensional SBHP Algorithm.
#@Ying Liu,William A. Pearlman
#year2006
#conf3DPVT
#citation0
#index4454
#arnetid4456
#!A low-complexity three-dimensional image compression algorithm based on wavelet transforms and set-partitioning strategy is presented. The Subband Block Hierarchial Partitioning (SBHP) algorithm is modified and extended to three dimensions, and applied to every code block independently. The resultant algorithm, 3D-SBHP, efficiently encodes 3D image data by the exploitation of the dependencies in all dimensions, while enabling progressive SNR and resolution decompression and Region-of-Interest (ROI) access from the same bit stream. The code-block selection method by which random access decoding can be achieved is outlined.The resolution scalable and random access performances are empirically investigated. The results show 3D-SBHP is a good candidate to compress 3D image data sets for multimedia applications.

#*Estimating a-priori Unknown 3D Axially Symmetric Surfaces from Noisy Measurements of Their Fragments.
#@Andrew R. Willis,David B. Cooper
#year2006
#conf3DPVT
#citation3
#index4455
#arnetid4457
#!In this paper, we present a computationally efficient technique for solving the difficult problem of estimating the global shape of a ceramic pot from measurements of its fragments. Each unknown pot is modeled as a surface of revolution, i.e., a 3D line-- the central axis of the pot -- and a 2D profile curve with respect to that axis. For each fragment, a probabilistic distribution is estimated which models both the geometric shape of the fragment and the variability of the estimated fragment shape. Estimation of the global pot shape is then a Maximum Likelihood Estimation (MLE) problem where we seek the values of the Euclidean transformation parameters that maximize the joint probability of the matched fragments' axis/profile-curvemodels (which includes the additional constraint that the matched fragments must share a common central axis). This is a new type of curve-analysis problem and our solution is a new and effective approach applicable for generic constrained 2D curve alignment and for modeling of 3D axially-symmetric surfaces and for comparing geometric models which may correspond over a subset of the complete model.

#*On 3D Retrieval from Photos.
#@Tarik Filali Ansary,Jean-Philippe Vandeborre,Mohamed Daoudi
#year2006
#conf3DPVT
#citation0
#index4456
#arnetid4458
#!In this paper, we propose a method for 3D-model retrieval from one or more photos. This method provides an "optimal" selection of 2D views to represent a 3D-model, and a probabilistic Bayesian method for 3D-model retrieval from realistic photos and sketches using these views. The characteristic view selection algorithm is based on an adaptive clustering algorithm and uses statistical model distribution scores to select the optimal number of views. We also introduce a Bayesian approach to score the probability of correspondence between the queries and the 3D-models. We present our results on the Princeton 3D Shape Benchmark database (1814 3D-models) and 50 photos (real photographs, sketches, synthesised images). A practical on-line 3D-model retrieval system based on our approach is available on the web to asset our results [1].

#*The Reverse Projection Correlation Principle for Depth from Defocus.
#@Scott McCloskey,Michael S. Langer,Kaleem Siddiqi
#year2006
#conf3DPVT
#citation6
#index4457
#arnetid4459
#!In this paper, we address the problem of finding depth from defocus in a fundamentally new way. Most previous methods have used an approximate model in which blurring is shift invariant and pixel area is negligible. Our model avoids these assumptions. We consider the area in the scene whose radiance is recorded by a pixel on the sensor, and relate the size and shape of that area to the scene's position with respect to the plane of focus. This is the notion of reverse projection, which allows us to illustrate that, when out of focus, neighboring pixels will record light from overlapping regions in the scene. This overlap results in a measurable change in the correlation between the pixels' intensity values. We demonstrate that this relationship can be characterized in such a way as to recover depth from defocused images. Experimental results show the ability of this relationship to accurately predict depth from correlation measurements.

#*Direct and Indirect 3-D Reconstruction from Opti-Acoustic Stereo Imaging.
#@Hicham Sekkati,Shahriar Negahdaripour
#year2006
#conf3DPVT
#citation6
#index4458
#arnetid4460
#!Utilization of an acoustic camera for range measurements is a significant advantage for 3-D shape recovery of underwater targets by opti-acoustic stereo imaging, where the associated epipolar geometry of visual and acoustic image correspondences is described in terms of conic sections and trigonometric functions. In this paper, we propose and analyze a number of methods based on direct and indirect approaches that provide insight on the merits of the new imaging and 3-D object reconstruction paradigm. We have devised certain indirect methods, built on a regularization formulation, to first compute from noisy correspondences maximum likelihood estimates that satisfy the epipolar geometry. The 3-D target points can then be determined from a number of closed-form solutions applied to these ML estimates. An alternative direct approach is also presented for 3-D reocnstruction directly from noisy correspondences. Computer simulations verify consistency between the analytical and experimental reconstruction SNRs -- the criterion applied in performance assessment of these various solutions.

#*Automatic Registration of Multiple Range Images by the Local Log-Polar Range Images.
#@Takeshi Masuda
#year2006
#conf3DPVT
#citation1
#index4459
#arnetid4461
#!We propose a method for automatic registration of multiple range images by matching invariant feature vectors generated from the local log-polar range images. Point pairs are corresponded by finding the nearest neighbor of invariant feature vectors. The correspondence is validated, and the pairwise transformations between the input range images are determined by using the RANSAC algorithm. The registration of all input range images are determined by constructing the view tree of the input range images. The registration result of the proposed method is used as the initial value of a fine registration methods for object shape modeling.

#*A Modular Scheme for 2D/3D Conversion of TV Broadcast.
#@Sebastian Knorr,Evren Imre,Burak Ozkalayci,A. Aydin Alatan,Thomas Sikora
#year2006
#conf3DPVT
#citation6
#index4460
#arnetid4462
#!The 3D reconstruction from 2D broadcast video is a challenging problem with many potential applications, such as 3DTV, free-viewpoint video or augmented reality. In this paper, a modular system capable of efficiently reconstructing 3D scenes from broadcast video is proposed. The system consists of four constitutive modules: tracking and segmentation, self-calibration, sparse reconstruction and, finally, dense reconstruction. This paper also introduces some novel approaches for moving object segmentation and sparse and dense reconstruction problems. According to the simulations for both synthetic and real data, the system achieves a promising performance for typical TV content, indicating that it is a significant step towards the 3D reconstruction of scenes from broadcast video.

#*Fast and Efficient Dense Variational Stereo on GPU.
#@Julien Mairal,Renaud Keriven,Alexandre Chariot
#year2006
#conf3DPVT
#citation10
#index4461
#arnetid4463
#!Thanks to their high performance and programmability, the latest graphics cards can now be used for scientific purpose. They are indeed very efficient parallel Single Instruction Multiple Data (SIMD) machines. This new trend is called General Purpose computation on Graphics Processing Unit (GPGPU [4]). Regarding the stereo problem, variational methods based on deformable models provide dense, smooth and accurate results. Nevertheless, they prove to be slower than usual disparity-based approaches. In this paper, we present a dense stereo algorithm, handling occlusions, using three cameras as inputs and entirely implemented on a Graphics Processing Unit (GPU). Experimental speedups prove that our approach is efficient and perfectly adapted to the GPU, leading to nearly video frame rate reconstruction.

#*Automatic 3D Face Detection, Normalization and Recognition.
#@Ajmal S. Mian,Mohammed Bennamoun,Robyn A. Owens
#year2006
#conf3DPVT
#citation25
#index4462
#arnetid4464
#!A fully automatic 3D face recognition algorithm is presented. Several novelties are introduced to make the recognition robust to facial expressions and efficient. These novelties include: (1) Automatic 3D face detection by detecting the nose; (2) Automatic pose correction and normalization of the 3D face as well as its corresponding 2D face using the Hotelling Transform; (3) A Spherical Face Representation and its use as a rejection classifier to quickly reject a large number of candidate faces for efficient recognition; and (4) Robustness to facial expressions by automatically segmenting the face into expression sensitive and insensitive regions. Experiments performed on the FRGC Ver 2.0 dataset (9,500 2D/3D faces) show that our algorithm outperforms existing 3D recognition algorithms. We achieved verification rates of 99.47% and 94.09% at 0.001 FAR and identification rates of 98.03% and 89.25% for probes with neutral and non-neutral expression respectively.

#*Extracting 3D Shape Features in Discrete Scale-Space.
#@John Novatnack,Ko Nishino,Ali Shokoufandeh
#year2006
#conf3DPVT
#citation7
#index4463
#arnetid4465
#!3D shape features are inherently scale-dependent. For instance, on a 3D model of a human body, the top of the head and a fingertip can both be detected as corner points, however, at entirely different scales. In this paper, we present a method for extracting and integrating 3D shape features in the discrete scale-space of a triangular mesh model. We first parameterize the surface of the mesh model on a 2D plane and then construct a dense surface normal map. In general, the parametrization is not isometric. To account for this, we compute the relative stretch of the original edge lengths. Next, we compute a dense distortion map which is used to approximate the geodesic distances on the normal map. Then, we construct a discrete scale-space of the original 3D shape by successively convolving the normal map with distortion-adapted Gaussian kernels of increasing standard deviation. We derive corner and edge detectors to extract 3D features at each scale in the discrete scale-space. Furthermore, we show how to combine the detector responses from different scales to form a unified representation of the 3D features.

#*Philips 3D Solutions: From Content Creation to Visualization.
#@André Redert,Robert-Paul Berretty,Chris Varekamp,Oscar Willemsen,Jos Swillens,Hans Driessen
#year2006
#conf3DPVT
#citation8
#index4464
#arnetid4466
#!Philips is realizing an end-to-end 3D display solution from 3D content creation to visualization. This development fits in our long-standing tradition of combining expertise in video processing with our strength in display development to create the most exciting and best viewing experience. Philips developed several high-quality 3D displays, ranging in resolution, viewing angle, depth experience, and sizes from 4" to 40" and up. Backwards compatibility with 2D content is enabled via signal-processing or opto-electronic 3D & 2D dual mode displays. Content creation and conversion methods are provided, which are a key factor for the success of 3D displays. Fully automatic conversion from monoscopic 2D content into 3D enables the re-use of all existing 2D video material. Further methods enable 3D animation/design, 2D to 3D conversion in post-production and live capture of new 3D content. Our efforts in MPEG standardization towards the "2D-plus-depth" format for 3D video enables a flexible interface between the variety in 3D content creation methods and the range in 3D displays. Furthermore, the 3D format is compatible with existing 2D content, standards and infrastructure. Currently, Philips offers several commercial 3D products for professional use such as digital signage, and progress is being made towards consumer products such as 3DTV.

#*Gaze Tracking by Using Factorized Likelihoods Particle Filtering and Stereo Vision.
#@Erik Pogalin,André Redert,Ioannis Patras,Emile A. Hendriks
#year2006
#conf3DPVT
#citation5
#index4465
#arnetid4467
#!This paper describes a non-intrusive method to estimate the gaze direction of a person by using stereo cameras. First, facial features are tracked with an adapted particle filtering algorithm using factorized likelihoods to estimate the 3D head pose. Next the 3D gaze vector is calculated by estimating the eyeball center and the cornea center of both eyes. For the intended application of visual perception research, we also propose a new screen registration scheme to accurately locate a planar screen in world coordinates within 2 mm error. We combine the 3D screen location with the 3D gaze vectors from both eyes to establish a point of focus on the screen. The experimental results indicate that an average error of the gaze direction of about 4.6± can be achieved and an average error of about 4 mm for the focus point location at a viewing distance of 50 cm.

#*Invariant High Level Reeb Graphs of 3D Polygonal Meshes.
#@Julien Tierny,Jean-Philippe Vandeborre,Mohamed Daoudi
#year2006
#conf3DPVT
#citation10
#index4466
#arnetid4468
#!Many applications in computer graphics need high level shape descriptions, in order to benefit from a global understanding of shapes. Topological approaches enable pertinent surface decompositions, providing structural descriptions of 3D polygonal meshes; but in practice, their use raises several difficulties. In this paper, we present a novel method for the construction of invariant high level Reeb graphs, topological entities that give a good overview of the shape structure. With this aim, we propose an accurate and straightforward feature point extraction algorithm for the computation of an invariant and meaningful quotient function. Moreover, we propose a new graph construction algorithm, based on an analysis of the connectivity evolutions of discrete level lines. This algorithm brings a practical solution for the suppression of non-significant critical points over piecewise continuous functions, providing meaningful Reeb graphs. Presented method gives accurate results, with satisfactory execution times and without input parameter. The geometrical invariance of resulting graphs and their robustness to variation in model pose and mesh sampling make them good candidates for several applications, like shape deformation (experimented in this paper), recognition, compression, indexing, etc.

#*Recovering Illumination and Texture Using Ratio Images.
#@Alejandro Troccoli,Peter K. Allen
#year2006
#conf3DPVT
#citation3
#index4467
#arnetid4469
#!In this paper we consider the problem of factoring illumination and texture from a pair of images of a diffuse object of known geometry. This problem arises frequently in 3D photography applications that use images to acquire photometric properties of a scanned object. Our approach uses the ratio of the images and the geometry information to compute the relative incident irradiance of one image with respect to the other. After the irradiance maps are recovered, we build a spatially varying albedo map, which can then be used to render the object under different illumination conditions. We present two algorithms, one for point-light source illumination, and another one based on spherical harmonics for more general illumination conditions.

#*A 3D Outdoor Scene Scanner Based on a Night-Vision Range-Gated Active Imaging System.
#@David Monnin,Armin L. Schneider,Frank Christnacher,Yves Lutz
#year2006
#conf3DPVT
#citation2
#index4468
#arnetid4470
#!We present a 3D outdoor scene scanner for the acquisition of kilometers-deep scenes in night conditions. Its imaging system is based on a compact and low-cost pulsed laser illuminator and a light-intensifier equipped CCD camera. By precisely synchronizing both the illuminator and the camera shutter, it is possible to acquire "slices" of the scene at specific known distances. We show that even with large laser pulses and without megahertz-capable electronics, the third dimension can be recovered for the whole range of the scene by processing only two images acquired in specific conditions. As the pixel intensities of the images produced by active imaging systems vary with the square of the range, and due to the limited dynamics of image sensors, scanning long-range scenes with shorter "slices" allows the camera gain to be adjusted with respect to the range and the accuracy to be enhanced. The imaging system as well as the different image processing steps are detailed in this paper and an example of typical results is given.

#*Deformable Mesh Model for Complex Multi-Object 3D Motion Estimation from Multi-Viewpoint Video.
#@Shohei Nobuhara,Takashi Matsuyama
#year2006
#conf3DPVT
#citation8
#index4469
#arnetid4471
#!We propose a new algorithm using deformable mesh model for complex 3D motion estimation of multiple objects from multi-viewpoint video. In this paper, we define "complex motion" as motion which includes global change of the object shape topology. In complex motion, a part of the object may touch the other parts. To manage this effect, we introduce (1) "repulsive force" into deformable mesh model for simple motion estimation which integrates texture and silhouette information into unified computation scheme, and (2) efficient collision detection algorithm for deformable mesh model. Our deformable mesh model with repulsive force keeps hidden, collided surfaces to be touched each other, and gives dense, non-rigid complex 3D motion of the object. Some experimental results show that our deformation model can estimate motions of multiple objects and the object's motion with time-varying global topology, and gives topologically-consistent mesh models which can be compressed efficiently by conventional inter-frame 3D data compression algorithms and be used for 3D motion analysis.

#*Computing the Camera Motion Direction from Many Images.
#@John Oliensis
#year2006
#conf3DPVT
#citation0
#index4470
#arnetid4472
#!We analyze the problem of estimating a camera's motion direction from a calibrated multi-image sequence. We assume that the camera moves roughly along a line and that its velocity and orientation are unknown and can vary over time. For infinitesimal camera motion (multiple flows rather than multiple images), we give a closed-form expression for the result of minimizing the true least-squares error over all variables but the camera's motion direction. Our result includes the rigidity constraint that the scene stays fixed over time. For finite motion, we present a noniterative algorithm that approximates the exact multi-image coplanarity error to better than a percent. Also, we define a new error contribution that incorporates the rigidity constraint and is analogous to the rigidity component of the error for infinitesimal motion. By adding this to the coplanarity error, we obtain a noniterative algorithm that approximates the complete finite motion least-squares error--including rigidity--as a function just of the translation direction.

#*Minimum Spanning Tree Pose Estimation.
#@Kevin L. Steele,Parris K. Egbert
#year2006
#conf3DPVT
#citation2
#index4471
#arnetid4473
#!The extrinsic camera parameters from video stream images can be accurately estimated by tracking features through the image sequence and using these features to compute parameter estimates. The poses for long video sequences have been estimated in this manner. However, the poses of large sets of still images cannot be estimated using the same strategy because wide-baseline correspondences are not as robust as narrow-baseline feature tracks. Moreover, video pose estimation requires a linear or hierarchically-linear ordering on the images to be calibrated, reducing the image matches to the neighboring video frames. We propose a novel generalization to the linear ordering requirement of video pose estimation by computing the Minimum Spanning Tree of the camera adjacency graph and using the tree hierarchy to determine the calibration order for a set of input images. We validate the pose accuracy using an error metric that is functionally independent of the estimation process. Because we do not rely on feature tracking for generating feature correspondences, our method can use internally calibrated wide- or narrow-baseline images as input, and can estimate the camera poses from multiple video streams without special pre-processing to concatenate the streams.

#*Multiview 3D Tracking with an Incrementally Constructed 3D Model.
#@Karel Zimmermann,Tomás Svoboda,Jiri Matas
#year2006
#conf3DPVT
#citation8
#index4472
#arnetid4474
#!We propose a multiview tracking method for rigid objects. Assuming that a part of the object is visible in at least two cameras, a partial 3D model is reconstructed in terms of a collection of small 3D planar patches of arbitrary topology. The 3D representation, recovered fully automatically, allows to formulate tracking as gradient minimization in pose (translation, rotation) space. As the object moves, the 3D model is incrementally updated. A virtuous circle emerges: tracking enables composition of the partial 3D model; the 3D model facilitates and robustifies the multi-view tracking. We demonstrate experimentally that the interleaved track-and-reconstruct approach successfully tracks a 360 degrees turn-around and a wide range of motions. Monocular tracking is also possible after the model is constructed. Using more cameras, however, significantly increases stability in critical poses and moves. We demonstrate how to exploit the 3D model to increases stability in the presence of uneven and/or changing illumination.

#*Hemispherical Harmonic Surface Description and Applications to Medical Image Analysis.
#@Heng Huang,Lei Zhang,Dimitris Samaras,Li Shen,Rong Zhang,Fillia Makedon,Justin D. Pearlman
#year2006
#conf3DPVT
#citation0
#index4473
#arnetid4475
#!The use of surface harmonics for rigid and nonrigid shape description is well known. In this paper we define a set of complete hemispherical harmonic basis functions on a hemisphere domain and propose a novel parametric shape description method to efficiently and flexibly represent the surfaces of anatomical structures in medical images. As the first application of hemispherical harmonic theory in shape description, our technique differs from the previous surface harmonics shape descriptors, all of which don't work efficiently on the hemisphere-like objects that often exist in medical anatomical structures (e.g., ventricles, atriums, etc.). We demonstrate the effectiveness of our approach through theoretic and experimental exploration of a set of medical image applications. Furthermore, an evaluation criterion for surface modeling efficiency is described and the comparison results demonstrated that our method outperformed the previous approaches using spherical harmonic models.

#*Belief Propagation for Panorama Generation.
#@Alan Brunton,Chang Shu
#year2006
#conf3DPVT
#citation3
#index4474
#arnetid4476
#!We present an algorithm for generating panoramic images of complex scenes from a multi-sensor camera. We further present a programmable graphics hardware implementation to process the large data sets more quickly. Because the sensors do not share the same center of projection, nearby objects may not be properly aligned, creating a ghosting or echoing effect in the generated panorama, unless correct depth information is taken into account. Taking a cue from the similar problem of dense stereo, we approximate our scene with a Markov random field and use belief propagation to estimate the maximum a posteriori panoramic image for that scene.

#*Reflectance Modeling for Layered Dielectrics with Rough Surface Boundaries.
#@Hossein Ragheb,Edwin R. Hancock
#year2006
#conf3DPVT
#citation2
#index4475
#arnetid4477
#!A new model for the scattering of light from layered dielectrics with rough surface boundaries is introduced. The model contains a surface scattering component together with a subsurface scattering component. The former component corresponds to the roughness on the upper surface boundary and is modeled using the modified Beckmann model. The latter component accounts for both refraction due to Fresnel transmission through the layer and rough scattering at the lower layer boundary. By allowing independent roughness parameters for each surface boundary we can achieve excellent fits of the model to the measured BRDF data. Using a well known method of testing reflectance models, we experiment with BRDF data from skin surface samples (human volunteers) and show that the new model outperforms alternative variants of the Beckmann model and the Lafortune et al. reflectance model. As an application in computer graphics, we also show that realistic images of 3D surfaces can be generated using the new model, by setting the values of its physical parameters.

#*Multi-View Multi-Exposure Stereo.
#@Alejandro Troccoli,Sing Bing Kang,Steven M. Seitz
#year2006
#conf3DPVT
#citation4
#index4476
#arnetid4478
#!Multi-view stereo algorithms typically rely on same-exposure images as inputs due to the brightness constancy assumption. While state-of-the-art depth results are excellent, they do not produce high-dynamic range textures required for high-quality view reconstruction. In this paper, we propose a technique that adapts multi-view stereo for different exposure inputs to simultaneously recover reliable dense depth and high dynamic range textures. In our technique, we use an exposure-invariant similarity statistic to establish correspondences, through which we robustly extract the camera radiometric response function and the image exposures. This enables us to then convert all images to radiance space and selectively use the radiance data for dense depth and high dynamic range texture recovery. We show results for synthetic and real scenes.

#*Synthesis of 3D Model of a Magnetic Field-Influenced Body from a Single Image.
#@Cuilan Wang,Timothy S. Newman,Dennis L. Gallagher
#year2006
#conf3DPVT
#citation0
#index4477
#arnetid4479
#!A method for recovery of a 3D model of a planet-sized cloud-like structure that is in motion and deforming but approximately governed by magnetic field properties is described. The method allows recovery of the model from a single intensity image in which the structure's silhouette can be observed. The method exploits envelope theory and a magnetic field model. Given one intensity image and the segmented silhouette in the image, the method proceeds without human intervention to produce the 3D model. In addition to allowing 3D model synthesis, the method's capability to yield a very compact description offers further utility. Application of the method to real-world data is also demonstrated.

#*A Factorization Based Self-Calibration for Radially Symmetric Cameras.
#@Srikumar Ramalingam,Peter F. Sturm,Edmond Boyer
#year2006
#conf3DPVT
#citation5
#index4478
#arnetid4480
#!The paper proposes a novel approach for planar self-calibration of radially symmetric cameras. We model these camera images using notions of distortion center and concentric distortion circles around it. The rays corresponding to pixels lying on a single distortion circle form a right circular cone. Each of these cones is associated with two unknowns; optical center and focal length (opening angle). In the central case, we consider all distortion circles to have the same optical center, whereas in the non-central case they have different optical centers lying on the same optical axis. Based on this model we provide a factorization based self-calibration algorithm for planar scenes from dense image matches. Our formulation provides a rich set of constraints to validate the correctness of the distortion center. We also propose possible extensions of this algorithm in terms of non-planar scenes, non-unit aspect ratio and multi-view constraints. Experimental results are shown.

#*3D Content-Based Search Based on 3D Krawtchouk Moments.
#@Athanasios Mademlis,Apostolos Axenopoulos,Petros Daras,Dimitrios Tzovaras,Michael G. Strintzis
#year2006
#conf3DPVT
#citation19
#index4479
#arnetid4481
#!In this paper a novel method for 3D content-based search and retrieval is proposed. Guided by the imperative need for a reliable 3D content based search tool and the very interesting results of research work done in the past on the performance of Krawtchouk moments and Krawtchouk moment invariants in image processing, Weighted 3D Krawtchouk moments are introduced for efficient 3D analysis which are suitable for content-based search and retrieval applications. The proposed method was tested on Princeton Shape Benchmark. Experiments have shown that the proposed method is superior in terms of precision-recall comparing with other well-known methods reported in the literature.

#*A CSC Based Classification Method for CT Bone Images.
#@Patrick Sturm,Lutz Priese,Haojun Wang
#year2006
#conf3DPVT
#citation3
#index4480
#arnetid4482
#!The CSC (color structure code) is a robust and fast two dimensional segmentation method which has been already generalized to three dimensional images. As the CSC does not need any prior knowledge it can be used for different applications. In this paper we focus on the segmentation of bones from Computer Tomography data (CT) with the CSC. In the postprocessing step CSC segments will be classified according to their average hounsfield value. The classification is steered by some application specific topological rules.

#*Illumination Insensitive Model-Based 3D Object Tracking and Texture Refinement.
#@Hua Yang,Greg Welch,Marc Pollefeys
#year2006
#conf3DPVT
#citation4
#index4481
#arnetid4483
#!A common approach to model-based tracking is to use a model of the object to predict what will be observed, and then to compare that with real observations. For methods that make use of the object's photometric properties (appearance) in their measurements, illumination inconsistencies between the modeled and actual scene can cause tracking problems. In this paper we address one case: model-based tracking of Lambertian objects under directional light sources. We present an iterative optimization method that uses a Kalman filter to simultaneously refine estimates of the object motion, the illumination, and the model texture. We model the illumination variance between the real and predicted observation using the intensity ratios of corresponding surface points, which we then use to make model-based image predictions consistent with the real lighting. To demonstrate the effectiveness of our method we present experimental results using both synthetic (controlled) and real image sequences.

#*Object Centered Stereo: Displacement Map Estimation Using Texture and Shading.
#@Neil Birkbeck,Dana Cobzas,Martin Jägersand
#year2006
#conf3DPVT
#citation2
#index4482
#arnetid4484
#!We consider the problem of recovering 3D surface displacements using both shading and multi-view stereo cues. In contrast to traditional disparity or depth map representations, the object centered displacement map representation enables the recovery of complete 3D objects while also ensuring the reconstruction is not biased towards a particular image. Although displacement mapping requires a base surface, this base mesh is easily obtained using traditional computer vision techniques (e.g., shape-from-silhouette or structure-from-motion). Our method exploits shading variation due to object rotation relative to the light source, allowing the recovery of displacements in both textured and textureless regions in a common framework. In particular, shading cues are integrated into a multi-view stereo photo-consistency function through the surface normals that are implied by the displacement map. The analytic gradient of this photo-consistency function is used to drive a multiresolution conjugate gradient optimization. We demonstrate the geometric quality of the reconstructed displacements on several example objects including a human face.

#*Flatness and Orientation Signature for Modeling and Matching 3D Objects.
#@H. B. Darbandi,M. R. Ito,J. Little
#year2006
#conf3DPVT
#citation1
#index4483
#arnetid4485
#!This paper proposes a new technique for modeling and matching three-dimensional rigid objects by encoding the fluctuation of the surface and the variation of its normal around an oriented point on the surface as the surface expands. The surface of the object is encoded into two two-dimensional curves as the surface signature on each point, and then the collection of the signatures are used to model and match the object. The signatures implicitly encode the curvature and symmetry of the surface around an oriented point. This modeling technique is robust to scale, orientation, noise, patch resolution, occlusion, and cluttering.

#*Large-Scale Modeling of Parametric Surfaces Using Spherical Harmonics.
#@Li Shen,Moo K. Chung
#year2006
#conf3DPVT
#citation14
#index4484
#arnetid4486
#!We present an approach for large-scale modeling of parametric surfaces using spherical harmonics (SHs). A standard least square fitting (LSF) method for SH expansion is not scalable and cannot accurately model large 3D surfaces. We propose an iterative residual fitting (IRF) algorithm, and demonstrate its effectiveness and scalability in creating accurate SH models for large 3D surfaces. These large-scale and accurate parametric models can be used in many applications in computer vision, graphics, and biomedical imaging. As a simple extension of LSF, IRF is very easy to implement and requires few machine resources.

#*Graph Cut Based Multiple View Segmentation for 3D Reconstruction.
#@Mario Sormann,Christopher Zach,Konrad F. Karner
#year2006
#conf3DPVT
#citation9
#index4485
#arnetid4487
#!In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve subsequent 3D reconstruction results. Essentially, our framework combines a graph cut based optimization algorithm with an intuitive user interface. At first a meanshift segmentation algorithm partitions each image of the sequence into a certain number of regions. Additionally we provide an intelligent graphical user interface for easy specification of foreground as well as background regions across all images of the sequence. Within the graph cut optimization algorithm we define new energy terms to increase the robustness and to keep the segmentation of the foreground object coherent across all images of the sequence. Finally, a refined graph cut segmentation and several adjustment operations allow an accurate and effective foreground extraction. The obtained results are demonstrated on several real world data sets.

#*Depth Images: Representations and Real-Time Rendering.
#@Pooja Verlani,Aditi Goswami,P. J. Narayanan,Shekhar Dwivedi,Sashi Kumar Penta
#year2006
#conf3DPVT
#citation-1
#index4486
#arnetid4488
#!Depth Images are viable representations that can be computed from the real world using cameras and/or other scanning devices. The depth map provides 2\frac{1}{2}D structure of the scene. A set of Depth Images can provide hole-free rendering of the scene. Multiple views need to blended to provide smooth hole-free rendering, however. Such a representation of the scene is bulky and needs good algorithms for real-time rendering and efficient representation. In this paper, we present a discussion on the Depth Image representation and provide a GPU-based algorithm that can render large models represented using DIs in real time. We then present a proxy-based compression scheme for Depth Images and provide results for the same. Results are shown on synthetic scenes under different conditions and on some scenes generated from images. Lastly, we initiate discussion on varying quality levels in IBR and show a way to create representations using DIs with different trade-offs between model size and rendering quality. This enables the use of this representation for a variety of rendering situations.

#*How Far Can We Go with Local Optimization in Real-Time Stereo Matching.
#@Liang Wang,Mingwei Gong,Minglun Gong,Ruigang Yang
#year2006
#conf3DPVT
#citation16
#index4487
#arnetid4489
#!Applications such as robot navigation and augmented reality require high-accuracy dense disparity maps in real-time and online. Due to time constraint, most real-time stereo applications rely on local winner-take-all optimization in the disparity computation process. These local approaches are generally outperformed by offline global optimization based algorithms. However, recent research shows that, through carefully selecting and aggregating the matching costs of neighboring pixels, the disparity maps produced by a local approach can be more accurate than those generated by many global optimization techniques. We are therefore motivated to investigate whether these cost aggregation approaches can be adopted in real-time stereo applications and, if so, how well they perform under the real-time constraint. The evaluation is conducted on a real-time stereo platform, which utilizes the processing power of programmable graphics hardware. Several recent cost aggregation approaches are also implemented and optimized for graphics hardware so that real-time speed can be achieved. The performances of these aggregation approaches in terms of both processing speed and result quality are reported.

#*A Bayesian Approach to Building Footprint Extraction from Aerial LIDAR Data.
#@Oliver Wang,Suresh K. Lodha,David P. Helmbold
#year2006
#conf3DPVT
#citation6
#index4488
#arnetid4490
#!Building footprints have been shown to be extremely useful in urban planning, infrastructure development, and roof modeling. Current methods for creating these footprints are often highly manual and rely largely on architectural blueprints or skilled modelers. In this work we will use aerial LIDAR data to generate building footprints automatically. Existing automatic methods have been mostly unsuccessful due to large amounts of noise around building edges. We present a novel Bayesian technique for automatically constructing building footprints from a pre-classified LIDAR point cloud. Our algorithm first computes a boundederror approximate building footprint using an application of the shortest path algorithm. We then determine the most probable building footprint by maximizing the posterior probability using linear optimization and simulated annealing techniques. We have applied our algorithm to more than 300 buildings in our data set and observe that we obtain accurate building footprints compared to the ground truth. Our algorithm is automatic and can be applied to other man-made shapes such as roads and telecommunication lines with minor modifications.

#*A System for Reconstructing Integrated Texture Maps for Large Structures.
#@Chen Xu,Athinodoros S. Georghiades,Holly E. Rushmeier,Julie Dorsey
#year2006
#conf3DPVT
#citation5
#index4489
#arnetid4491
#!We consider the problem of creating integrated texture maps of large structures scanned with a time-of-flight laser scanner and imaged with a digital camera. The key issue in creating integrated textures is correcting for the spatially varying illumination across the structure. In most cases, the illumination cannot be controlled, and dense spatial estimates of illumination are not possible. We present a system for processing multiple color images into an integrated texture that makes use of the laser scanner return intensity and the captured geometry, together with color balancing and mapping of illumination-corrected images onto the target geometry after filtering into two spatial frequency bands.

#*Motion Editing in 3D Video Database.
#@Jianfeng Xu,Toshihiko Yamasaki,Kiyoharu Aizawa
#year2006
#conf3DPVT
#citation11
#index4490
#arnetid4492
#!As the next generation of media, 3D video is attracting increased attention. 3D video is a sequence of three dimensional mesh models, captured and generated for a real dynamic object. In this paper, we present a simple framework of motion editing in 3D video database to re-use 3D video data. Our system is composed of two modules. In the first module, a motion database is automatically set up from original 3D video sequences off-line by analyzing the feature vectors of each frame. It is observed that our original 3D video sequences have a two-level temporal structure. A fine-to-coarse method is proposed to extract such a structure. 3D video is segmented into the fine-level structure by a three reference frame strategy and then is clustered into the coarse-level structure. In the second module, users can synthesize the motions to edit a new 3D video sequence online. A cost function is optimized to transit between two motions with the users' requirements. All the algorithms in the system are based on the analysis in feature vector space and the edited 3D video sequence is played using OpenGL.

#*The ASDMCon Project: The Challenge of Detecting Defects on Construction Sites.
#@Kui Yue,Daniel Huber,Burcu Akinci,Ramesh Krishnamurti
#year2006
#conf3DPVT
#citation3
#index4491
#arnetid4493
#!Techniques for three dimensional (3D) imaging and analysis of as-built conditions of buildings are gaining acceptance in the Architecture, Engineering, and Construction (AEC) community. Early detection of defects on construction sites is one domain where these techniques have the potential to revolutionize an industry, since construction defects can consume a significant portion of a project's budget. The ASDMCon project is developing methods to aid site managers in detecting and managing construction defects using 3D imaging and other advanced sensor technologies. This paper presents an overview of the project, its 4D visualization environment, and the 3D segmentation and recognition strategies that are being employed to automate defect detection.

#*High-Performance Multi-View Reconstruction.
#@Christopher Zach,Mario Sormann,Konrad F. Karner
#year2006
#conf3DPVT
#citation12
#index4492
#arnetid4494
#!We present a high performance reconstruction approach, which generates true 3D models from multiple views with known camera parameters. The complete pipeline from depth map generation over depth image integration to the final 3D model visualization is performed on programmable graphics processing units (GPUs). The proposed pipeline is suitable for long image sequences and uses a plane-sweep depth estimation procedure optionally employing robust image similarity functions to generate a set of depth images. The subsequent volumetric fusion step combines these depth maps into an impicit surface representation of the final model, which can be directly displayed using GPU-based raycasting methods. Depending on the number of input views and the desired resolution of the final model the computing times range from several seconds to a few minutes. The quality of the obtained models is illustrated with real-world datasets.

#*Multiple Camera Calibration Using Robust Perspective Factorization.
#@Andrei Zaharescu,Radu Horaud,Rémi Ronfard,Loïc Lefort
#year2006
#conf3DPVT
#citation8
#index4493
#arnetid4495
#!In this paper we address the problem of recovering structure and motion from a large number of intrinsically calibrated perspective cameras. We describe a method that combines (1) weak-perspective reconstruction in the presence of noisy and missing data and (2) an algorithm that updates weak-perspective reconstruction to perspective reconstruction by incrementally estimating the projective depths. The method also solves for the reversal ambiguity associated with affine factorization techniques. The method has been successfully applied to the problem of calibrating the external parameters (position and orientation) of several multiple-camera setups. Results obtained with synthetic and experimental data compare favourably with results obtained with nonlinear minimization such as bundle adjustment.

#*Angle Independent Bundle Adjustment Refinement.
#@Jeffrey Zhang,Daniel G. Aliaga,Mireille Boutin,Robert Insley
#year2006
#conf3DPVT
#citation4
#index4494
#arnetid4496
#!Obtaining a digital model of a real-world 3D scene is a challenging task pursued by computer vision and computer graphics. Given an initial approximate 3D model, a popular refinement process is to perform a bundle adjustment of the estimated camera position, camera orientation, and scene points. Unfortunately, simultaneously solving for both camera position and camera orientation is an ill-conditioned problem. To address this issue, we propose an improved, camera-orientation independent cost function that can be used instead of the standard bundle adjustment cost function. This yields a new bundle adjustment formulation which exhibits noticeably better numerical behavior, but at the expense of an increased computational cost. We alleviate the additional cost by automatically partitioning the dataset into smaller subsets. Minimizing our cost function for these subsets still achieves significant error reduction over standard bundle adjustment. We empirically demonstrate our formulation using several different size models and image sequences.

#*Image Based Localization in Urban Environments.
#@Wei Zhang,Jana Kosecka
#year2006
#conf3DPVT
#citation76
#index4495
#arnetid4497
#!In this paper we present a prototype system for image based localization in urban environments. Given a database of views of city street scenes tagged by GPS locations, the system computes the GPS location of a novel query view. We first use a wide-baseline matching technique based on SIFT features to select the closest views in the database. Often due to a large change of viewpoint and presence of repetitive structures, a large percentage of matches (> 50%) are not correct correspondences. The subsequent motion estimation between the query view and the reference view, is then handled by a novel and efficient robust estimation technique capable of dealing with large percentage of outliers. This stage is also accompanied by a model selection step among the fundamental matrix and the homography. Once the motion between the closest reference views is estimated, the location of the query view is then obtained by triangulation of translation directions. Approximate solutions for cases when triangulation cannot be obtained reliably are also described. The presented system is tested on the dataset used in ICCV 2005 Computer Vision Contest and is shown to have higher accuracy than previous reported results.

#*EKF-Based Recursive Dual Estimation of Structure & Motion from Stereo Data.
#@Hongsheng Zhang,Shahriar Negahdaripour
#year2006
#conf3DPVT
#citation2
#index4496
#arnetid4498
#!Extended Kalman filters (EKF) have been proposed to estimate ego-motion and to recursively update scene structure in the form of 3-D positions of selected prominent features from motion and stereo sequences. Previous methods typically accommodate no more than a few dozen features for real-time processing. To maintain motion estimation accuracy, this calls for high contrast images to compute image feature locations with precision. Within manmade environments, various prominent corner points exist that can be extracted and tracked with required accuracy. However, prominent features are more difficult to localize precisely in natural scenes. Statistically, more feature points become necessary to maintain the same level of motion estimation accuracy and robustness. However, this imposes a computational burden beyond the capability of EKF-based techniques for real-time processing. A sequential dual EKF estimator utilizing stereo data is proposed for improved computation efficiency. Two important issues, unbiased estimation and stochastic stability are addressed. Furthermore, the dynamic feature set is handled in a more effective, efficient and robust way. Experimental results to demonstrate the merits of the new theoretical and algorithmic developments are presented.

#*Carving from Ray-Tracing Constraints: IRT-Carving.
#@Marco Andreetto,Silvio Savarese,Pietro Perona
#year2006
#conf3DPVT
#citation-1
#index4497
#arnetid4499
#!We present a new algorithm for improving an available (conservative) estimate of the shape of an object using constraints from ray-tracing. In particular, we exploit incoherences between the lit portions of the object - detected on a set of acquired images - and the shadows that the current estimate casts on itself. Whenever a contradiction is found the current estimate is modified in order to remove the inconsistency. Sufficient conditions for the correctness of the algorithm and a discussion of their validity are provided. Finally, we describe a simple implementation of the method and present some preliminary experimental results from computer simulations.

#*Spherical Catadioptric Arrays: Construction, Multi-View Geometry, and Calibration.
#@Douglas Lanman,Daniel E. Crispell,Megan Wachs,Gabriel Taubin
#year2006
#conf3DPVT
#citation10
#index4498
#arnetid4500
#!This paper introduces a novel imaging system composed of an array of spherical mirrors and a single high-resolution digital camera. We describe the mechanical design and construction of a prototype, analyze the geometry of image formation, present a tailored calibration algorithm, and discuss the effect that design decisions had on the calibration routine. This system is presented as a unique platform for the development of efficient multi-view imaging algorithms which exploit the combined properties of camera arrays and non-central projection catadioptric systems. Initial target applications include data acquisition for image-based rendering and 3D scene reconstruction. The main advantages of the proposed system include: a relatively simple calibration procedure, a wide field of view, and a single imaging sensor which eliminates the need for color calibration and guarantees time synchronization.

#*Fast Safe Spline Surrogates for Large Point Clouds.
#@Ashish Myles,Jörg Peters
#year2006
#conf3DPVT
#citation1
#index4499
#arnetid4501
#!To support real-time computation with large, possibly evolving point clouds and range data, we fit a trimmed uniform tensor-product spline function from one direction. The graph of this spline serves as a surrogate for the cloud, closely following the data safely in that, according to user choice, the data are always "below' or "above' when viewed in the fitting direction. That is, the point cloud is guaranteed to be completely covered from that direction and can be sandwiched between two matching spline surfaces if required. This yields both a data reduction since only the spline control points need to be further processed and defines a continuous surface in lieu of the isolated measurement points. For example, using a 20× 20 spline, clouds of 300K points are safely approximated in less than 1/2 second.

#*Global Depth from Epipolar Volumes--A General Framework for Reconstructing Non-Lambertian Surfaces.
#@Timo Stich,Art Tevs,Marcus A. Magnor
#year2006
#conf3DPVT
#citation4
#index4500
#arnetid4502
#!Using Epipolar Image Analysis in the context of the correspondence finding problem in depth reconstruction has several advantages. One is the elegant incorporation of prior knowledge about the scene or the surface reflection properties into the reconstruction process. The proposed framework in conjunction with graph cut optimization is able to reconstruct also highly specular surfaces. The use of prior knowledge and multiple images opens new ways to reconstruct surfaces and scenes impossible or error prone with previous methods. Another advantage is improved occlusion handling. Pixels that are partly occluded contribute to the reconstruction results. The proposed shifting of some of the computation to graphics hardware (GPU) results in a significant speed improvement compared to pure CPU-based implementations.

#*3D Skeleton-Based Body Pose Recovery.
#@Clément Ménier,Edmond Boyer,Bruno Raffin
#year2006
#conf3DPVT
#citation34
#index4501
#arnetid4503
#!This paper presents an approach to recover body motions from multiple views using a 3D skeletal model. It takes, as input, foreground silhouette sequences from multiple viewpoints, and computes, for each frame, the skeleton pose which best fit the body pose. Skeletal models encode mostly motion information and allows therefore to separate motion estimation from shape estimation for which solutions exist; And focusing on motion parameters significantly reduces the dependancy on specific body shapes, yielding thus more flexible solutions for body motion capture. However, a problem generally faced with skeletal models is to find adequate measurements with which to fit the model. In this paper, we propose to use the medial axis of the body shape to this purpose. Such medial axis can be estimated from the visual hull, a shape approximation which is easily obtained from the silhouette information. Experiments show that this approach is robust to several perturbations in the model or in the input data, and also allows fast body motions or, equivalently, important motions between consecutive frames.

#*Light Source Calibration for IBR and BTF Acquisition Setups.
#@Alexander Neubeck,Alexey Zalesny,Luc J. Van Gool
#year2006
#conf3DPVT
#citation1
#index4502
#arnetid4504
#!Working with IBR/BTF data requires a complete calibration. Modern setups speed up recordings by using multiple lamps and cameras. Therefore, the calibration task gets more time consuming and challenging, especially for an accurate calibration of multiple light sources. Most works are dedicated to the calibration of cameras, whereas the light field calibration problem remains as a rule overlooked. Our experiments have shown that the spatial variance of light strength can be vigorous, inducing serious damage to the IBR/BTF data. We propose a novel method based on Helmholtz reciprocity, which derives light field information directly from the target IBR/BTF data rather than from specially dedicated calibration objects. Instead of repeating the recording of a huge number of images, only one additional image is needed.

#*Contour-Based Object Detection in Range Images.
#@Stefan Stiene,Kai Lingemann,Andreas Nüchter,Joachim Hertzberg
#year2006
#conf3DPVT
#citation13
#index4503
#arnetid4505
#!This paper presents a novel object recognition approach based on range images. Due to its insensitivity to illumination, range data is well suited for reliable silhouette extraction. Silhouette or contour descriptions are good sources of information for object recognition. We propose a complete object recognition system, based on a 3D laser scanner, reliable contour extraction with floor interpretation, feature extraction using a new, fast Eigen-CSS method, and a supervised learning algorithm. The recognition system was successfully tested on range images acquired with a mobile robot, and the results are compared to standard techniques, i.e., Geometric features, Hu and Zernike moments, the Border Signature method and the Angular Radial Transformation. An evaluation using the receiver operating characteristic analysis completes this paper. The Eigen-CSS method has proved to be comparable in detection performance to the top competitors, yet faster than the best one by an order of magnitude in feature extraction time.

#*Revealing Significant Medial Structure in Polyhedral Meshes.
#@Svetlana Stolpner,Kaleem Siddiqi
#year2006
#conf3DPVT
#citation7
#index4504
#arnetid4506
#!Medial surfaces are popular representations of 3D objects in vision, graphics and geometric modeling. They capture relevant symmetries and part hierarchies and also allow for detailed differential geometric information to be recovered. However, exact algorithms for their computation from meshes must solve high-order polynomial equations, while approximation algorithms rarely guarantee soundness and completeness. In this article we develop a technique for computing the medial surface of an object with a polyhedral boundary, which is based on an analysis of the average outward flux of the gradient of its Euclidean distance function. This analysis leads to a coarse-to-fine algorithm implemented on a cubic lattice that reveals at each iteration the salient manifolds of the medial surface. We provide comparative results against a state-of-the-art method in the literature.

#*Dynamic 3D Urban Scene Modeling Using Multiple Pushbroom Mosaics.
#@Hao Tang,Zhigang Zhu,George Wolberg
#year2006
#conf3DPVT
#citation10
#index4505
#arnetid4507
#!In this paper, a unified, segmentation-based approach is proposed to deal with both stereo reconstruction and moving objects detection problems using multiple stereo mosaics. Each set of parallel-perspective (pushbroom) stereo mosaics is generated from a video sequence captured by a single video camera. First a color-segmentation approach is used to extract the so-called natural matching primitives from a reference view of a pair of stereo mosaics to facilitate both 3D reconstruction of textureless urban scenes and man-made moving targets (e.g. vehicles). Multiple pairs of stereo mosaics are used to improve the accuracy and robustness in 3D recovery and occlusion handling. Moving targets are detected by inspecting their 3D anomalies, either violating the epipolar geometry of the pushbroom stereo or exhibiting abnormal 3D structure. Experimental results on both simulated and real video sequences are provided to show the effectiveness of our approach.

#*Beyond Silhouettes: Surface Reconstruction Using Multi-Flash Photography.
#@Daniel E. Crispell,Douglas Lanman,Peter G. Sibley,Yong Zhao,Gabriel Taubin
#year2006
#conf3DPVT
#citation12
#index4506
#arnetid4508
#!This paper introduces a novel method for surface reconstruction using the depth discontinuity information captured by a multi-flash camera while the object moves along a known trajectory. Experimental results based on turntable sequences are presented. By observing the visual motion of depth discontinuities, surface points are accurately reconstructed - including many located deep inside concavities. The method extends well-established differential and global shape-from-silhouette surface reconstruction techniques by incorporating the significant additional information encoded in the depth discontinuities. The reconstruction method uses an implicit form of the epipolar parameterization and directly estimates point locations and corresponding surface normals on the surface of the object using a local temporal neighborhood of the depth discontinuities. Outliers, which correspond to the ill-conditioned cases of the reconstruction equations, are easily detected and removed by back-projection. Gaps resulting from curvaturedependent sampling and shallow concavities are filled by fitting an implicit surface to the oriented point cloud's point locations and normal vectors.

#*Statistical Inference of Biological Structure and Point Spread Functions in 3D Microscopy.
#@Joseph Schlecht,Kobus Barnard,Barry Pryor
#year2006
#conf3DPVT
#citation2
#index4507
#arnetid4509
#!We present a novel method for detecting and quantifying 3D structure in stacks of microscopic images captured at incremental focal lengths. We express the image data as stochastically generated by an underlying model for biological specimen and the effects of the imaging system. The method simultaneously fits a model for proposed structure and the imaging system's parameters, which include a model of the point spread function. We demonstrate our approach by detecting spores in image stacks of Alternaria, a microscopic genus of fungus. The spores are modeled as opaque ellipsoids and fit to the data using statistical inference. Since the number of spores in the data is not known, model selection is incorporated into the fitting process. Thus, we develop a reversible jump Markov chainMonte Carlo sampler to explore the parameter space. Our results show that simultaneous statistical inference of specimen and imaging models is useful for quantifying biological structures in 3D microscopic images. In addition, we show that inferring a model of the imaging system improves the overall fit of the specimen model to the data.

#*Multi-Chart Geometry Video: A Compact Representation for 3D Animations.
#@Khaled Mamou,Titus B. Zaharia,Françoise J. Prêteux
#year2006
#conf3DPVT
#citation9
#index4508
#arnetid4510
#!This paper introduces a new compression scheme, so-called Multi-Chart Geometry Video (MCGV), for 3D dynamic meshes with constant connectivity and time-varying geometry. The core of the proposed method is a piecewise affine predictor coupled with a Multi-Chart Geometry IMage (MCGIM) representation of the residual errors. The mesh is first partitioned into vertex clusters whose motion can be accurately described by a unique 3D affine transform. The prediction errors are represented as MCGIMs which are compressed by using standardized image encoders such as JPEG and MPEG-4. The performances of our encoder are objectively evaluated on a data set of six animation sequences with various sizes, geometries and topologies, and exhibiting both rigid and elastic motions. The experimental evaluation shows that the proposed MCGV achieves up to 60% lower compression distortions than the geometry video approach, while outperforming (with 30% to 94% lower distortions) the RT, MPEG-4/AFX-IC, D3DMC, PCA and Dynapack techniques.

#*Shape Analysis and Spatio-Temporal Tracking of Mesoscale Eddies in Miami Isopycnic Coordinate Ocean Model.
#@Veena Moolani,Ramprasad Balasubramanian,Li Shen,Amit Tandon
#year2006
#conf3DPVT
#citation3
#index4509
#arnetid4511
#!Detection and analysis of ocean surface phenomena have so far relied on manual analysis of long sequences of satellite images or images produced from the mathematical models. In this paper a technique for the three-dimensional shape analysis and spato-temporall tracking of mesoscale eddies from MICOM dataset is presented. Mesoscale eddies play a strong role in carrying heat poleward. The shape analysis of eddies provides a volumetric estimation which can be further used to determine the heat trapped in eddies. Eddies are detected and the region of swirling currents around the detected center is segmented. Segmented eddies are stacked to generate 3D visualization. A 3D skeleton is obtained with the centroids of all the layers in the segmented eddy and represented parametrically. Coefficients of the parametric representation are used for motion tracking of eddies.

#*Linking Feature Lines on 3D Triangle Meshes with Artificial Potential Fields.
#@David L. Page,Andreas Koschan,Mongi A. Abidi
#year2006
#conf3DPVT
#citation1
#index4510
#arnetid4512
#!We propose artificial potential fields as a support theory for a feature linking algorithm. This algorithm operates on 3D triangle meshes derived from multiple range scans of an object, and the features of interest are curvature extrema on the object's surface. A problem that arises with detecting these features is that results from standard algorithms are often incomplete in that feature lines are broken and discontinuous. Our novel linking algorithm closes these broken feature lines to form a more complete feature description. The main contribution of this algorithm is the use of arti- ficial potential fields to govern the linking process. In this paper, we discuss the feature detection process itself and then define the linking procedure in the context of potential fields. We present results for both synthetic and scanned models.

#*3D Modeling Using Planar Segments and Mesh Elements.
#@Ioannis Stamos,Gene Yu,George Wolberg,Siavash Zokai
#year2006
#conf3DPVT
#citation9
#index4511
#arnetid4513
#!Range sensing technology allows the photorealistic modeling of large-scale scenes, such as urban structures. The generated 3D representations, after automated registration, are useful for urban planning, historical preservation, or virtual reality applications. One major issue in 3D modeling of complex large-scale scenes is that the final result is a dense complicated mesh. Significant, in some cases manual, post-processing (mesh simplification, hole filling) is required to make this representation usable by graphics or CAD applications. This paper presents a 3D modeling approach that models large planar scene areas of the scene with planar primitives (extracted via a segmentation pre-process), and non-planar areas with mesh primitives. In that respect, the final model is significantly compressed. Also, lines of intersection between neighboring planes are modeled as such. These steps bring the model closer to graphics/CAD applications. We present results from experiments with complex range scans from urban structures and from the interior of a large-scale landmark urban building (Grand Central Terminal, NYC).

#*Isoradius Contours: New Representations and Techniques for 3D Face Registration and Matching.
#@Nick Pears,Thomas Heseltine
#year2006
#conf3DPVT
#citation0
#index4512
#arnetid4514
#!We propose a technique for 3D face registration and matching using a novel representation called "isoradius contours". An isoradius contour is the contour on the 3D facial surface that is a known fixed distance relative to some predefined reference point (the tip of the nose). A 3D face representation contains many isoradius contours with different radii and the first major benefit of the technique is that the shape of the contours is independent of the facial pose, due to the infinite rotational symmetry of a sphere. The second major benefit of the technique is that registration, alignment and matching can be implemented using a simple process of 1D correlation. Our results have shown that registration and alignment is of comparable accuracy to ICP (iterative closest points), but is fast, non iterative, and is robust to the presence of outliers.

#*Histogram Matching for Camera Pose Neighbor Selection.
#@Kevin L. Steele,Parris K. Egbert,Bryan S. Morse
#year2006
#conf3DPVT
#citation0
#index4513
#arnetid4515
#!A prerequisite to calibrated camera pose estimation is the construction of a camera neighborhood adjacency graph, a connected graph defining the pose neighbors of the camera set. Pose neighbors to a camera C are images containing sufficient overlap in image content with the image from C that they can be used to correctly estimate the pose of C using structure-from-motion techniques. In a video stream, the camera neighborhood adjacency graph is often a simple connected path; frame poses are only estimated relative to their immediate neighbors. We propose a novel method to build more complex camera adjacency graphs that are suitable for estimating the pose of large numbers of wide- and narrow-baseline images. We employ Content-Based Image Retrieval techniques to identify similar images likely to be graph neighbors. We also develop an optimization to improve graph accuracy that is based on an observation of common camera motions taken when photographing with the intent of structure-from-motion. Our results substantiate the use of our method for determining neighbors for pose estimation.

#*A Structured Light Range Imaging System Using a Moving Correlation Code.
#@Frank J. Pipitone,Ralph Hartley
#year2006
#conf3DPVT
#citation1
#index4514
#arnetid4516
#!We describe a system which produces a dense accu- rate range image using 8 consecutive frames of camera data in conjunction with a special projector. A proto- type has been built and tested, and yields a typical range error of about 0.2mm at 2 meters range with a baseline just over one meter. The camera is directed at a scene, along with a stripe projector consisting of a thin light source (xenon tube and slit) on the axis of a turntable, and a binary mask conforming to a cylinder coaxial with this. The mask has alternate opaque and transparent stripes parallel to the axis. It forms a sequence in which each sub- sequence of given length n (8 here) is different. No lens is used in the projector, deliberately smooth- ing the resulting illumination in a shadowing process. In operation, the turntable rotates, and images are taken at uniform angular intervals for several consecu- tive frames. In the consecutive frames, a given pixel records samples of the brightness of a fixed surface point. The vector consisting of those samples, when normalized, is unique to the place in the sequence from which it came, thus enabling the computation, via a fast indexing process, of the 3D position of the surface point. The code is similar to a DeBruijn sequence, but modified to reduce range error. Several types of calibra- tion and error compensation were used to produce an accurate range image.

#*Anatomically-Aware, Automatic, and Fast Registration of 3D Ear Impression Models.
#@Alexander Zouhar,Tong Fang,Gozde B. Unal,Gregory G. Slabaugh,Hui Xie,Fred McBagonluri
#year2006
#conf3DPVT
#citation4
#index4515
#arnetid4517
#!We present a registration framework based on feature points of anatomical 3D shapes represented in the point cloud domain. Anatomical information is utilized throughout the complete registration process. The surfaces, which in this paper are ear impression models, are considered to be similar in the way that they possess the same anatomical regions but with varying geometry. First, in a shape analysis step, features of important anatomical regions (such as canal, aperture, and concha) are extracted automatically. Next these features are used in ordinary differential equations that update rigid registration parameters between two sets of feature points. For refinement of the results, the GCP algorithm is applied. Through our experiments, we demonstrate our technique's success in surface registration through registration of key anatomical regions of human ear impressions. Furthermore, we show that the proposed method achieves higher accuracy and faster performance than the standard GCP registration algorithm.

#*Shape Measure for Identifying Perceptually Informative Parts of 3D Objects.
#@Sreenivas R. Sukumar,David Page,Andrei V. Gribok,Andreas Koschan,Mongi A. Abidi
#year2006
#conf3DPVT
#citation5
#index4516
#arnetid4518
#!We propose a mathematical approach for quantifying shape complexity of 3D surfaces based on perceptual principles of visual saliency. Our curvature variation measure (CVM), as a 3D feature, combines surface curvature and information theory by leveraging bandwidth-optimized kernel density estimators. Using a part decomposition algorithm for digitized 3D objects, represented as triangle meshes, we apply our shape measure to transform the low level mesh representation into a perceptually informative form. Further, we analyze the effects of noise, sensitivity to digitization, occlusions, and descriptiveness to demonstrate our shape measure on laser-scanned real world 3D objects.

#*A Probabilistic Method for Aligning and Merging Range Images with Anisotropic Error Distribution.
#@Ryusuke Sagawa,Nanaho Osawa,Yasushi Yagi
#year2006
#conf3DPVT
#citation1
#index4517
#arnetid4519
#!This paper describes a probabilistic method of aligning and merging range images. We formulate these issues as problems of estimating the maximum likelihood. By examining the error distribution of a range finder, we model it as a normal distribution along the line of sight. To align range images, our method estimates the parameters based on the ExpectationMaximization (EM) approach. By assuming the error model, the algorithm is implemented as an extension of the Iterative Closest Point (ICP) method. For merging range images, our method computes the signed distances by finding the distances of maximum likelihood. Since our proposed method uses multiple correspondences for each vertex of the range images, errors after aligning and merging range images are less than those of earlier methods that use one-to-one correspondences. Finally, we tested and validated the efficiency of our method by simulation and on real range images .

#*Line-Based Structure from Motion for Urban Environments.
#@Grant Schindler,Panchapagesan Krishnamurthy,Frank Dellaert
#year2006
#conf3DPVT
#citation27
#index4518
#arnetid4520
#!We present a novel method for recovering the 3D-line structure of a scene from multiple widely separated views. Traditional optimization-based approaches to line-based structure from motion minimize the error between measured line segments and the projections of corresponding 3D lines. In such a case, 3D lines can be optimized using a minimum of 4 parameters. We show that this number of parameters can be further reduced by introducing additional constraints on the orientations of lines in a 3D scene. In our approach, 2D-lines are automatically detected in images with the assistance of an EM-based vanishing point estimation method which assumes the existence of edges along mutally orthogonal vanishing directions. Each detected line is automatically labeled with the orientation (e.g. vertical, horizontal) of the 3D line which generated the measurement, and it is this additional knowledge that we use to reduce the number of degrees of freedom of 3D lines during optimization. We present 3D reconstruction results for urban scenes based on manually established feature correspondences across images.

#*Large-Scale Urban Modeling by Combining Ground Level Panoramic and Aerial Imagery.
#@Lu Wang,Suya You,Ulrich Neumann
#year2006
#conf3DPVT
#citation2
#index4519
#arnetid4521
#!We describe an interactive system that models regions of an urban environment, such as a group of tall buildings. Traditional image-based modeling methods often cannot model such large areas due to error accumulation and limited camera field of view. Our approach widens the camera field of view by constructing a 360 degree panorama from ground-level images and uses a high resolution ortho-rectified aerial image to provide the building footprints. Users draw the building outlines in the aerial image and select a point as the approximate ground camera location. The method automatically extracts roof corners in the ground images and registers the panorama to the aerial image according to geometric constraints. The height of each building is calculated from an estimated camera pose. The resulting textured model of the buildings is constructed of planar surfaces.

#*An Automatic 3D Ear Recognition System.
#@Ping Yan,Kevin W. Bowyer
#year2006
#conf3DPVT
#citation16
#index4520
#arnetid4522
#!Previous works have shown that the ear is a good candidate for a human biometric. However, in prior work, the pre-processing of ear images has been a manual process. Also, prior algorithms were sensitive to noise in the data, especially that caused by hair and earrings. We present a novel solution to the automated cropping of the ear and implement it in an end-to-end solution for biometric recognition. We demonstrate our automatic recognition process with the largest study to date in ear biometrics, 415 subjects, achieving a rank one recognition rate of 97.6%. This work represents a breakthrough in ear biometrics and paves the way for commercial quality, fully automatic systems.

#*Visual Shapes of Silhouette Sets.
#@Jean-Sébastien Franco,Marc Lapierre,Edmond Boyer
#year2006
#conf3DPVT
#citation20
#index4521
#arnetid4523
#!Shape from silhouette methods are extensively used to model dynamic and non-rigid objects using binary foreground-background images. Since the problem of reconstructing shapes from silhouettes is ambiguous, a number of solutions exist and several approaches only consider the one with a maximal volume, called the visual hull. However, the visual hull is not always a good approximation of shapes, in particular when observing smooth surfaces with few cameras. In this paper, we consider instead a class of solutions to the silhouette reconstruction problem that we call visual shapes. Such a class includes the visual hull, but also better approximations of the observed shapes which can take into account local assumptions such as smoothness, among others. Our contributions with respect to existing works is first to identify silhouette consistent shapes different from the visual hull, and second to give a practical way to estimate such shapes in real time. Experiments on various sets of data including human body silhouettes are shown to illustrate the principle and the interests of visual shapes.

#*Low Altitude Wind Simulation over Mount Saint Helens Using NASA SRTM Digital Terrain Model.
#@Manuel Garcia,Pierre Boulanger
#year2006
#conf3DPVT
#citation2
#index4522
#arnetid4524
#!On February 11, 2000, the Shuttle Radar Topography Mission (SRTM) was launched into space as part of one of the payload of the Shuttle Endeavor. Using a new radar sweeping technique most of the Earth's surfaces was digitized in 3D in approximately 10 days. SRTM acquired enough data during its mission to obtain a near-global high-resolution database of the Earth's topography. This paper describe how this revolutionary data set can be used to simulate anywhere around the Earth low altitude wind conditions for various atmospheric conditions. More specifically, we will describe the various processing steps necessary to convert this high-resolution terrain model provided by the SRTM database into a Computational Fluid Dynamic (CFD) volumetric mesh that is compatible with an open source CFD solver called OpenFOAM running in parallel on largeWest- Grid supercomputers. This work is the result of a new virtual wind-tunnel under development at the University of Alberta. In the paper, we present wind flow over the Mount- Saint Helens in the United States for a simple wind flow boundary condition.

#*An Efficient Error-Bounded General Camera Model.
#@Voicu Popescu,Jordan Dauble,Chunhui Mei,Elisha Sacks
#year2006
#conf3DPVT
#citation6
#index4523
#arnetid4525
#!Camera models are essential infrastructure in computer vision, computer graphics, and visualization. The most frequently used camera models are based on the single-viewpoint constraint. Removing this constraint brings the advantage of improved flexibility in camera design. However, prior camera models that eliminate the single-viewpoint constraint are inefficient. We describe an approximate model for coherent general cameras, which projects efficiently with user chosen accuracy. The rays of the general camera are partitioned into simple cameras that approximate the camera locally. The simple cameras are modeled with k-ray cameras, a novel class of non-pinhole cameras. The rays of a k-ray camera interpolate between k construction rays. We analyze several variants of k-ray cameras. The resulting compound camera model is efficient because the number of simple cameras is orders of magnitude lower than the original number of rays camera, and because each simple camera offers closed-form projection.

#*Motion Parallax without Motion Compensation in 3D Cluttered Scenes.
#@Michael S. Langer,Vincent Chapdelaine-Couture,Richard Mann,Sébastien Roy
#year2006
#conf3DPVT
#citation0
#index4524
#arnetid4526
#!When an observer moves through a rigid 3D scene, points that are near to the observer move with a different image velocity than points that are far away. The difference between image velocity vectors is the direction of motion parallax. This direction vector points towards the observer's translation direction. Hence estimates of the direction of motion parallax are useful for estimating the observer's translation direction. Standard ways to compute the direction of motion parallax either rely on precomputed optical flow, or rely on motion compensation to remove the local image shift caused by observer rotation. Here we present a simple Fourier-based method for estimating the direction of motion parallax directly, that does not require optical flow and motion compensation. The method is real-time and performs accurately for image regions in which multiple motions are present.

#*Retrieval of Colored 3D Models.
#@Guido M. Cortelazzo,Nicola Orio
#year2006
#conf3DPVT
#citation5
#index4525
#arnetid4527
#!The number of 3D models that are available from the Web is increasingly growing, motivating the research on content-based retrieval from shape information. In this paper we propose to extend the approach to colored 3D models, which start to become more and more popular. To this end we propose a content descriptor that combines together shape and color information and it is based on an extension of spin-images, where also texture information is taken into account. The proposed approach has been evaluated on a collection of 600 automatically colored 3D models, considering as relevant to a query only the models with the same shape and the same added texture. Results show that the approach gave good results in terms of retrieval effectiveness, also if compared to a pure shape-based approach. Issues related to computational cost have been addressed proposing two alternative improvements that have been evaluated and compared with the basic approach.

#*An Improved 3D Human Face Reconstruction Approach Based on Cubic Splines Models.
#@Boulbaba Ben Amor,Mohsen Ardabilian,Liming Chen
#year2006
#conf3DPVT
#citation-1
#index4526
#arnetid4528
#!In this paper, we develop a new hybrid active vision/ geometric modeling approach dedicated to 3D human face recovery. Initially, a 3D coarse reconstruction is obtained via a structured-light assisted stereo sensor. Here, the stereo matching problem is resolved through two main stages: (a) sub-pixel stripe edge localization of projected patterns of light, and (b) correspondences establishing based on adaptive dynamic programming optimization technique. Next, the introduction of smooth interpolation models achieves the fine reconstruction. Here, cubic Spline curves are employed in order to improve the quality of the reconstructed models. Indeed, they allow us to produce dense and details preserving reconstructions by following the control points from the coarse reconstruction stage. Furthermore, we present some reconstruction results and discuss both qualitative and quantitative evaluations of the proposed reconstruction scheme.

#*Automatic Locating of Anthropometric Landmarks on 3D Human Models.
#@Zouhour Ben Azouz,Chang Shu,Anja Mantel
#year2006
#conf3DPVT
#citation15
#index4527
#arnetid4529
#!We present an algorithm for automatic locating of anthropometric landmarks on 3D human scans. Our method is based on learning landmark characteristics and the spatial relationships between them from a set of human scans where the landmarks are identified. The learned information is formulated by a pairwise Markov network. Each node of the network is a random variable corresponding to the position of a landmark. The edges of the network represent correlations between the positions of landmark pairs. Probabilistic inference is then performed over the Markov network to locate the landmarks. We evaluated the algorithm on 30 human models with different shapes. The results showed good accuracy for most of the landmarks.

#*Multimodal 3D Shape Recovery from Texture, Silhouette and Shadow Information.
#@Luca Ballan,Guido Maria Cortelazzo
#year2006
#conf3DPVT
#citation7
#index4528
#arnetid4530
#!Recent efforts attempt to combine together information of different passive methods. Critical issues in this research are the choice of data and how to combine such data in order to increase the overall information. The combination of stereo matching and silhouette information has recently received considerable attention both for obtaining high quality 3D models and for modelling 3D dynamic scenes. In this paper we present a 3D shape recovery system which fuse together silhouette, texture and shadow information. More precisely, we formulate the fusion problem of these three types of information. Experimental verification shows that the new method is capable to reconstruct a wider range of objects.

#*Progressive Compression of Normal Vectors.
#@Aaron Bass,Ken Been
#year2006
#conf3DPVT
#citation0
#index4529
#arnetid4531
#!We present a method for compression of normal vectors that (1) is general, in the sense that it can be incorporated into many different progressive geometry compression schemes; (2) is progressive, and accommodates arbitrary view dependent refinement; and (3) gives compression ratios and rate-distortion performance superior to previous methods. Our method works by progressively refining a normal cone to one of eight possible sub-cones (including no refinement), and entropy encoding the choice. We experimentally demonstrate the effectiveness of this approach on both meshes and point clouds, in combination with two very different geometry progression methods.

#*RDTC Optimized Streaming for Remote Browsing in Image-Based Scene Representations.
#@Ingo Bauermann,Yang Peng,Eckehard G. Steinbach
#year2006
#conf3DPVT
#citation5
#index4530
#arnetid4532
#!Remote navigation in compressed image-based scene representations requires random access to arbitrary parts of the reference image data to recompose virtual views. The degree of inter-frame dependencies exploited during compression has an impact on the effort needed to access reference images and delimits the rate distortion (RD) trade-off that can be achieved. If, additionally, a given receiver hardware and a maximum available channel bitrate is taken into account, the traditional rate-distortion optimization is extended to an RDTC trade-off between rate (R), distortion (D), transmission data rate (T), and decoding complexity (C). In this work we introduce our RDTC optimized compression framework. In addition, an experimental testbed for streaming of these RDTC optimally compressed image-based scene representations is described and the impact of client side caching is investigated. Our results show a significant reduction in user perceived delay for RDTC optimized streams in such a remote browsing environment compared to RD optimized or independently encoded scene representations.

#*Efficient Sparse 3D Reconstruction by Space Sweeping.
#@Joachim Bauer,Christopher Zach,Horst Bischof
#year2006
#conf3DPVT
#citation-1
#index4531
#arnetid4533
#!This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D position plus associated orientation) and use a space sweeping scheme to compute the accurate 3D location of these edge features. Our approach relies mainly on the geometric properties of the extracted primitives and incorporates a robust uncertainty estimation to detect outliers. Epipolar constraints between views are used to narrow down the search space of potential candidates in the images. In order to improve the efficiency of spatial queries, for detecting edgels lying close to an epipolar line, we utilise a pairwise stereo rectification scheme. The detection and verification of tentative hypotheses is carried out in 3D-space, thus allowing to perform an event driven search mode. An uncertainty measure that models the location inaccuracies in the feature extraction process and errors introduced in the camera pose estimation stage allows to assign a likelihood value to each hypothesis. Optionally an image-based similarity measure can be used to verify the 3D hypotheses and to identify false positives. We perform experiments on a synthetic data set and on several real datasets. The results indicate that the proposed method yields accurate measurements on depth discontinuities and thus represents a complementary technique to standard dense matching approaches.

#*3D from Line Segments in Two Poorly-Textured, Uncalibrated Images.
#@Herbert Bay,Andreas Ess,Alexander Neubeck,Luc J. Van Gool
#year2006
#conf3DPVT
#citation5
#index4532
#arnetid4534
#!This paper addresses the problem of camera self-calibration, bundle adjustment and 3D reconstruction from line segments in two images of poorly-textured indoor scenes. First, we generate line segment correspondences, using an extended version of our previously proposed matching scheme. The first main contribution is a new method to identify polyhedral junctions resulting from the intersections of the line segments. At the same time, the images are segmented into planar polygons. This is done using an algorithm based on a Binary Space Partitioning (BSP) tree. The junctions are matched end points of the detected line segments and hence can be used to obtain the epipolar geometry. The essential matrix is considered for metric camera calibration. For better stability, the second main contribution consists in a bundle adjustment on the line segments and the camera parameters that reduces the number of unknowns by a maximum flow algorithm. Finally, a piecewise-planar 3D reconstruction is computed based on the segmentation of the BSP tree. The system's performance is tested on some challenging examples.

#*Two Stage View Planning for Large-Scale Site Modeling.
#@Paul Blaer,Peter K. Allen
#year2006
#conf3DPVT
#citation5
#index4533
#arnetid4535
#!We present a systematic view planning method to assist construction of 3-D models of large outdoor sites using a mobile robot platform with mounted scanner. In the first stage, we begin with a 2-D site footprint and the planner generates a minimal set of sufficient covering views. These views which incorporate constraints on the scanner, including field of view, minimum and maximum scanning distance, and grazing angle, serve as the initial set of scans which yields an approximate 3-D model of the site. In the second stage, we update this model by using a voxel-based occupancy procedure to plan and acquire the next best view. The algorithm continues to update the model sequentially until an accurate and complete 3-D model is obtained. Results are shown for a segment of the Columbia University campus. The system can also be used as a planning tool for manual construction of 3-D site models.

#*Automatic Hole-Filling of Triangular Meshes Using Local Radial Basis Function.
#@John Branch,Flavio Prieto,Pierre Boulanger
#year2006
#conf3DPVT
#citation15
#index4534
#arnetid4536
#!Creating models of real objects is a complex task for which the use of traditional modeling techniques has proven to be difficult. To solve some of these problems, laser rangefinders are frequently used to sample an object´s surface from several viewpoints resulting in a set of range images that are registered and integrated into a final triangulated model. In practice, due to surface reflectance properties, occlusions and accessibility limitations, certain areas of the object´s surface are usually not sampled, leaving holes which create undesirable artifacts in the integrated model. In this paper, we present a novel algorithm for the automatic hole-filling of triangulated models. The algorithm starts by locating hole boundary regions. A hole consists of a closed path of edges of boundary triangles that have at least an edge, which is not shared with any other triangle. The edge of the hole is then fitted with a b-spline where the average variation of the torsion of the b-spline approximation is calculated. Using a simple threshold of the average variation of the torsion along the edge, one can automatically classify real holes from man-made holes. Following this classification process, we then use an automated version of a radial basis function interpolator to fill the inside of the hole using neighboring edges. Excellent experimental results are presented.

#*Distortion-Sensitive Synthesis of Texture and Geometry in Interactive 3D Visualization.
#@Nicola Brusco,Pietro Zanuttigh,David Taubman,Guido Maria Cortelazzo
#year2006
#conf3DPVT
#citation3
#index4535
#arnetid4537
#!This paper addresses the problem of remote browsing of 3D scenes. Texture and geometry information are both available at server side in the form of scalably compressed images and depth maps. We propose a framework for the dynamic allocation of the available transmission resources between geometry and texture. Both the transmission of new images and the improvement of the already transmitted ones are taken into account. We also introduce a novel strategy for distortion-sensitive synthesis of both geometry and rendered imagery at client side.

#*Object Modeling with Guaranteed Fulfillment of Geometric Constraints.
#@Da-Chuan Cheng,Xiaoyi Jiang
#year2006
#conf3DPVT
#citation0
#index4536
#arnetid4538
#!Object modeling under consideration of geometric constraints is an important task. In this paper we describe a novel approach to achieving this goal. It has the nice property that all geometric constraints can be absolutely satis- fied. To our knowledge it seems to be the first one with guaranteed constraint fulfillment. It is realized by integrating these constraints as hard conditions into the fitting process, in contrast to their use as soft optimization criteria in earlier work. We describe the principle behind our approach and give examples to show how it can be applied to practice. Experimental results will be reported on objects with numerous complex constraints. The technique proposed in this paper is expected to have a great impact in reverse engineering applications and manufactured object modeling where the majority of parts are designed with intended feature relationships.

#*A Perceptually Driven Model for Transmission of Arbitrary 3D Models over Unreliable Networks.
#@Irene Cheng,Lihang Ying,Anup Basu
#year2006
#conf3DPVT
#citation4
#index4537
#arnetid4539
#!3D transmission over unreliable networks needs to take into account the possibility of packet loss. In this work we describe a perceptually motivated strategy for joint transmission of texture and mesh over unreliable networks. The approach is described initially considering regular mesh structure, to show the utility of optimizing the texture-mesh tradeoff. In order to generalize our approach to arbitrary meshes we consider stripification of the mesh, combined with a strategy that does not need texture or vertex packets to be re-transmitted. Only the valence (connectivity) packets need to be re-transmitted; however, storage of valence information requires only 10% space compared to vertices and even less compared to photo-realistic texture. Thus, only less than 5% of the packets may need to be re-transmitted in the worst case to allow our algorithm to successfully reconstruct an acceptable object under severe packet loss. Results showing the implementation of the proposed approach are described.

#*Range Image Registration Based on Circular Features.
#@Cecilia Chao Chen,Ioannis Stamos
#year2006
#conf3DPVT
#citation3
#index4538
#arnetid4540
#!Range sensing technology allows the photo-realistic modeling of large-scale scenes, such as urban structures. A major bottleneck in the process of 3D scene acquisition is the automated registration of a large number of geometrically complex 3D range scans in a common frame of reference. The generated 3D representations, after automated registration, are useful for urban planning, historical preservation, or virtual reality applications. Man-made urban scenes provide an abundance of linear features that can be used for the solution of the problem. Many scenes though require the utilization of non-linear primitives. This paper provides a solution of the registration problem based on the robust detection and matching of circular features from the range data sets. We present results from experiments with complex range scans from the interior of a large-scale landmark urban structure (Grand Central Terminal, NYC), where traditional methods would fail. This work is part of a larger range registration system that is based on extracted features of multiple geometric types.

#*Conics-Based Homography Estimation from Invariant Points and Pole-Polar Relationships.
#@Christos Conomis
#year2006
#conf3DPVT
#citation-1
#index4539
#arnetid4541
#!In this paper we derive a novel set of projective invariants and we address the problem of homography estimation between two uncalibrated views from two unmodeled coplanar conics. Exploring in each view the eigenvectors of a matrix composed from the conics matrices and pole-polar relationships, we show that homography can be recovered purely geometrical from invariant points and simple intersections avoiding high-order polynomials and non linear equations. Our method has advantages compared with other approaches, is simple and computational efficient. The estimation process is basically linear and there are no ambiguities on the solution. Furthermore it requires neither that the physical models of the conics are known nor that the cameras are calibrated. Experimental results in both simulate data and real images show that our approach is very robust and can be efficiently used for a large number of applications

#*3D City Modeling Using Cognitive Loops.
#@Nico Cornelis,Bastian Leibe,Kurt Cornelis,Luc J. Van Gool
#year2006
#conf3DPVT
#citation21
#index4540
#arnetid4542
#!3D city modeling using computer vision is very challenging. A typical city contains objects which are a nightmare for some vision algorithms, while other algorithms have been designed to identify exactly these parts but, in their turn, suffer from other weaknesses which limit their application. For instance, moving cars with metallic surfaces can degrade the results of a 3D city reconstruction algorithm which is primarily based on the assumption of a static scene with diffuse reflection properties. On the other hand, a specialized object recognition algorithm could be able to detect cars, but also yields too many false positives without the availability of additional scene knowledge. In this paper, the design of a cognitive loop which intertwines both aforementioned algorithms is demonstrated for 3D city modeling, proving that the whole can be much more than the simple sum of its parts. A cognitive loop is the mutual transfer of higher knowledge between algorithms, which enables the combination of algorithms to overcome the weaknesses of any single algorithm. We demonstrate the promise of this approach on a real-world city modeling task using video data recorded by a survey vehicle. Our results show that the cognitive combination of algorithms delivers convincing city models which improve upon the degree of realism that is possible from a purely reconstruction-based approach.

#*A Mobile Augmented Reality System with Distributed Tracking.
#@Jan-Friso Evers-Senne,Ingo Schiller,A. Petersen,Reinhard Koch
#year2006
#conf3DPVT
#citation1
#index4541
#arnetid4543
#!For AR applications the 3D position and direction of the users view have to be determined in real time. At the same time, the augmentation, one or more 3D objects, have to be rendered. This article describes a distributed mobile ARSystem designed for industrial service applications. By distributing the different tasks involved in AR, the computational load of the portable system can be minimized such that a small and lightweight computer can be used. The portable computer is connected to a backend server via WLAN. Minimisation of the bandwidth usage of the system ensures that 20 or more systems can operate on one standard WLAN access point. The main focus of this article is to minimise the computational load of the mobile system and the network load simultaneously.

#*Interactive Modeling with Automatic Online Compression.
#@Jean-Daniel Deschênes,Philippe Lambert,Patrick Hébert
#year2006
#conf3DPVT
#citation1
#index4542
#arnetid4544
#!A few 3D interactive modeling systems have been developed recently. Such systems must cope with a high flow of input measurements during the entire acquisition period. Therefore, the reconstruction and rendering algorithms used must all run online. However, compression algorithms are still run offline as postprocessing. In order to develop a fully interactive modeling framework, this paper presents an online compression algorithm where the system automatically adjusts the level of detail according to the user behavior. The proposed method can reduce peak memory consumption by more than 50% during the acquisition of a typical model and the final result is comparable to offline compression. Furthermore, the results obtained show that a local acquisition approach must be prioritized.

#*A Probabilistic Notion of Correspondence and the Epipolar Constraint.
#@Justin Domke,Yiannis Aloimonos
#year2006
#conf3DPVT
#citation12
#index4543
#arnetid4545
#!We present a probabilistic framework for correspondence and egomotion. First, we suggest computing probability distributions of correspondence. This has the advantage of being robust to points subject to the aperture effect and repetitive structure, while giving up no information at feature points. Additionally, correspondence probability distributions can be computed for every point in the scene. Next, we generate a probability distribution over the motions, from these correspondence probability distributions, through a probabilistic notion of the epipolar constraint. Finding the maximum in this distribution is shown to be a generalization of least-squared epipolar minimization. We will show that because our technique allows so much correspondence information to be extracted, more accurate egomotion estimation is possible.

#*A High-Resolution and High Accuracy Real-Time 3D Sensor Based on Structured Light.
#@Frank Forster
#year2006
#conf3DPVT
#citation10
#index4544
#arnetid4546
#!A new real-time 3D sensor is presented that is capable of delivering 25 high-resolution depth maps per second with a representative measurement error of 0.2 mm. The sensor is well suited for real-world application as it imposes no major scene constraints, i.e. it copes well with colored objects, moving scenes and background illumination. The acquisition technique, which is a form of structured light with a single projection pattern, is introduced, where the focus is on two aspects: Firstly, a new type of projection pattern that employs local color edge patterns for encoding so that it is possible to decode them even under noisy real-world conditions. Secondly, an algorithm that exploits the pattern properties to recognize the projected color edge patterns reliably. It then describes a 3D sensor based on this technique and presents experimental results obtained with it. It furthermore discusses an exemplary commercial application of the 3D sensor to the task of wheel alignment.

#*A Blind Source Separation Approach to Structure from Motion.
#@Jeff Fortuna,Aleix M. Martínez
#year2006
#conf3DPVT
#citation1
#index4545
#arnetid4547
#!We present an alternate approach to the problem of structure from motion (SfM) with noisy point measurements. With no information available about the joint density of three-dimensional points, the assumption of independence is the only reasonable one. With this assumption alone, the process of the factorization of the observed projections of inaccurately measured 3 dimensional points into motion and shape matrices is a blind source separation (demixing) problem in the presence of noise. This approach is very general, allowing the extension of all previous work on source separation to be applied to SfM in an information theory context. A significant reduction in the error of the estimation of the motion and shape matrices over other methods is possible.

#*Hierarchical PCA Decomposition of Point Clouds.
#@Jan Fransens,Frank Van Reeth
#year2006
#conf3DPVT
#citation2
#index4546
#arnetid4548
#!We present a hierarchical analysis technique for point clouds, based on Principal Component Analysis (PCA), a well known multivariate statistical method. The crux of the algorithm is a top-down planarity assessment of the underlying point data, after which individual planar patches are merged using a tree clustering technique. We will demonstrate how the results of this analysis are used as a preprocessing step for computer aided inspection of sheet metal folding, surface reconstruction and a hybrid point-polygon rendering algorithm.

#*Self-Calibration of Multiple Laser Planes for 3D Scene Reconstruction.
#@Ryo Furukawa,Hiroshi Kawasaki
#year2006
#conf3DPVT
#citation8
#index4547
#arnetid4549
#!Self-calibration is one of the most active issues concerning vision-based 3D measurements. However, in the case of the light sectioning method, there has been little research conducted on self-calibration techniques. In this paper, we study the problem of self-calibration for an active vision system which uses line lasers and a single camera. The problem can be defined as the estimation of multiple laser planes from the curves of laser reflections observed from a sequence of images captured by a single camera. The constraints of the problem can be obtained from observed intersection points between the curves. In this condition, the problem is formulated as simultaneous polynomial equations, in which the number of equations is larger than the number of variables. Approximated solutions of the equations can be computed by using Gr¨obner bases. By refining them using nonlinear optimization, the final result can be obtained. We developed an actual 3D measurement system using the proposed method, which consists of only a laser projector with two line lasers and a single camera. Users are just required to move the projector freely so that the projected lines sweep across the surface of the scene to get the 3D shape.

#*Computational Anatomy to Assess Longitudinal Trajectory of Brain Growth.
#@Guido Gerig,Brad Davis,Peter Lorenzen,Shun Xu,Matthieu Jomier,Joseph Piven,Sarang C. Joshi
#year2006
#conf3DPVT
#citation5
#index4548
#arnetid4550
#!This paper addresses the challenging problem of statistics on images by describing average and variability. We describe computational anatomy tools for building 3-D and spatio-temporal 4-D atlases of volumetric image data. The method is based on the previously published concept of unbiased atlas building, calculating the nonlinear average image of a population of images by simultaneous nonlinear deformable registration. Unlike linear averaging, the resulting center average image is sharp and encodes the average structure and geometry of the whole population. Variability is encoded in the set of deformation maps. As a new extension, longitudinal change is assessed by quantifying local deformation between atlases taken at consecutive time points. Morphological differences between groups are analyzed by the same concept but comparing group-specific atlases. Preliminary tests demonstrate that the atlas building shows excellent robustness and a very good convergence, i.e. atlases start to stabilize after 5 images only and do not show significant changes when including more than 10 volumetric images taken from the same population.

#*The Recursive Multi-Frame Planar Parallax Algorithm.
#@Christopher Geyer,Todd Templeton,Marci Meingast,Shankar Sastry
#year2006
#conf3DPVT
#citation5
#index4549
#arnetid4551
#!This paper presents a method for obtaining accurate dense elevation and appearance models of terrain using a single camera on-board an aerial platform. Applications of this method include geographical information systems, robot path planning, immersion and visualization, and surveying for scientific purposes such as watershed analysis. When given geo-registered images, the method can compute terrain maps on-line in real time. This algorithm, called the Recursive Multi-frame Planar Parallax algorithm, is a recursive extension of Irani et al.'s multi-frame planar parallax framework and in theory, with perfectly registered imagery, it will produce range data with error expected to increase between linearly and with the square root of the range, depending on image properties and whether other constants such as framerate and vehicle velocity are held constant. This is an improvement over stereo systems whose expected errors are proportional to the square of the range. We show experimental evidence on synthetic imagery and on a real video sequence taken in an experiment for autonomous helicopter landing.

#*Geometry Refinement of 3D Surfaces Using Kriging.
#@Brad Grinstead,Andreas Koschan,Mongi A. Abidi
#year2006
#conf3DPVT
#citation1
#index4550
#arnetid4552
#!3D imaging is a popular method for acquiring accurate models for a variety of applications. However, the size of the geometric features that can be modeled in this manner is dependant on the scanning system's resolution. This paper presents a method that attempts to accurately reconstruct regions whose features are at or below the system's scanning resolution, combining automatic region selection with a form of kriging. A curvature-based segmentation is followed by an automated geometry refinement procedure in which the model of spatial correlation between the irregularly sampled 3D data is automatically determined. Geometry refinement is done by a regularized kriging approach that is designed to preserve the sharp features typical to many 3D laser range applications. This method is validated on synthetic data, showing that the accuracy of our method is higher than that of its standard competitors. Then, the performance on real data is demonstrated through several examples.

#*Metrics and Optimization Techniques for Registration of Color to Laser Range Scans.
#@Chad Hantak,Anselmo Lastra
#year2006
#conf3DPVT
#citation4
#index4551
#arnetid4553
#!We found previous intensity-based techniques for automatically registering color images to three-dimensional laser scanned scenes to be inadequate. The similarity metric used to score the registration creates a number of local minima that inhibits searching via Powell's Multidimensional Minimization Algorithm, a gradient-descent technique. To find the best metric for general environment scanning, we examine the results of different information-theoretic metrics. Our examination leads us to the conclusion that gradient-descent based techniques are not a good choice for unsupervised automatic registration for images from environment scans. However an unsupervised process is possible through global-optimization techniques at the cost of longer processing times.

#*Region-Based Motion Analysis and 3D Reconstruction for a Translational Video Sequence.
#@Xiaodong Huang,Eric Dubois
#year2006
#conf3DPVT
#citation0
#index4552
#arnetid4554
#!This paper presents a hybrid 1D motion estimation algorithm which combines pixel-based and region-based approaches that can give depth images from translational video sequences with very high quality. Firstly, we combine the motion information estimated by a variational regularization approach and by the Gabor transform through histogram analysis to identify those regions with zero motion (like for the sky). Then another round of region matching is carried out to refine the motion values for the other regions. Our algorithm can detect most of the sky regions segmented by foreground objects with complex geometry while keeping the boundaries of moving objects sharp and clear, which is an very important feature to obtain accurate 3D models. The high quality motion maps/depth images obtained by our algorithm are shown along with 3D reconstructions from novel viewpoints.

#*Integrating LiDAR, Aerial Image and Ground Images for Complete Urban Building Modeling.
#@Jinhui Hu,Suya You,Ulrich Neumann
#year2006
#conf3DPVT
#citation11
#index4553
#arnetid4555
#!This paper presents a hybrid modeling system that fuses LiDAR data, an aerial image and ground view images for rapid creation of accurate building models. Outlines for complex building shapes are interactively extracted from a high-resolution aerial image, surface information is automatically fit with a primitive based method from LiDAR data, and high-resolution ground view images are integrated into the model to generate fully textured CAD models. Our method benefits from the merit of each dataset, and evaluation results are presented on a university campus-size model.

#*Vanishing Hull.
#@Jinhui Hu,Suya You,Ulrich Neumann
#year2006
#conf3DPVT
#citation3
#index4554
#arnetid4556
#!Vanishing points are valuable in many vision tasks such as orientation estimation, pose recovery and 3D reconstruc-tion from a single image. Many methods have been pro-posed to address the problem, however, a consistent framework to quantitatively analyze the stability and ac-curacy of vanishing point estimation is still absent. This paper proposes a new concept, vanishing hull, which solves the problem. Given an edge error model, the range of a true edge can be modeled using a fan region. The intersection of all these fan regions is a convex hull, which is called vanishing hull. A vanishing hull gives the region of a true vanishing point, and its distribution determines the probability of the vanishing point. The expectation of the vanishing hull is the optimal solution of the vanishing point, its variance defines the accuracy of the estimation, and its shape determines the stability of the vanishing point. Hence, we can quantita-tively analyze the stability and accuracy of the vanishing point estimation using vanishing hull. Simulation results show that our method is significantly better than one state-of-the-art technique, and real data results are also promising.

#*Building a 3D Virtual Museum of Native American Baskets.
#@Volkan Isler,Bradford Wilson,Ruzena Bajcsy
#year2006
#conf3DPVT
#citation2
#index4555
#arnetid4557
#!In this paper we report our progress in building a system for the acquisition, analysis, and visualization of a collection of Native Californian baskets from the Phoebe A. Hearst Museum of Anthropology. Our project differs from existing cultural heritage applications in terms of its focus: to build tools and techniques for visualizing and studying a large number of related objects -- in this case, baskets. We present our progress in the following system components: (i) laser-scanning of baskets, (ii) construction and processing of 3D models, and (iii) building virtual exhibits. We conclude the paper with our experiences and a summary of challenges we anticipate in building a completely automated system for processing and analyzing a large set of models -- such as might be encountered when digitizing a large museum collection. Efficient retrieval and visualization of artifact collections are important to a number of communities, including anthropology researchers, Native American tribes, and the general public.

#*Perturbation Estimation of the Subspaces for Structure from Motion with Noisy and Missing Data.
#@Hongjun Jia,Jeff Fortuna,Aleix M. Martínez
#year2006
#conf3DPVT
#citation5
#index4556
#arnetid4558
#!It is common when analyzing experimental data to encounter matrices that have been contaminated by noise and have missing elements. Missing data can be recovered with imputation methods if the measurement data matrix is of low rank and the data is noise-free. However, iterative imputation can produce poor results for cases of large noise or a large proportion of missing data. Non-imputing methods rely on the use of existent data and require a selection of complete submatrices. Jacobs introduced a nonimputing method which can produce good results, but the randomness in selecting the submatrices cannot guarantee a consistently accurate recovery of missing data. Chen and Suter's method chooses the most reliable submatrix based on the number of missing data elements only, which fails to consider the effect of noise on the selected data. Herein, a new criterion based on an estimate of the sensitivity of submatrices to perturbation is introduced which takes into consideration that in some cases a column with more missing data could provide more useful information than one with less missing data. Experimental results for the problem of Structure from Motion with noisy point correspondences and missing data show that our criterion can sort submatrices properly in terms of their possible perturbation and recover the 3D structure of the scene more accurately than other non-imputing methods.

#*An Immersive Free-Viewpoint Video System Using Multiple Outer/Inner Cameras.
#@Hansung Kim,Itaru Kitahara,Ryuuki Sakamoto,Kiyoshi Kogure
#year2006
#conf3DPVT
#citation8
#index4557
#arnetid4559
#!We propose a new free-view video system that generates immersive 3D video from arbitrary point of view, using outer cameras and an inner omni-directional camera. The system reconstructs 3D modes from the captured video streams and generates realistic free-view video of those objects from a virtual camera. In this paper, we propose a real-time omni-directional camera calibration method, and describe a shape-from-silhouette technique for 3D modeling and a micro-facet billboarding technique for rendering. Owing to the movability and high resolution of the inner omni-directional camera, the proposed system reconstructs more elaborate 3D models and generates natural and vivid video with an immersive sensation.

#*Reference Stream Selection for Multiple Depth Stream Encoding.
#@Sang-Uok Kum,Ketan Mayer-Patel
#year2006
#conf3DPVT
#citation2
#index4558
#arnetid4560
#!With advances in technology, a dynamic real world scene can be captured, represented, and streamed for realistic interaction in 3D using multiple digital cameras and computers. However, the captured data would be too massive to be streamed uncompressed. Fortunately, these data exhibit spatial and temporal coherence that can be utilized for compression, and research in compression of multiple streams has increased. To facilitate the use of spatial coherence between streams for multiple stream compression, reference streams must be selected. Reference streams are streams that serve as a basis for spatial prediction. Though the selection of reference streams affects encoding efficiency, there has been little research on it. In this paper, we identify the two main approaches for selecting reference streams, and demonstrate that when selecting reference streams, maximizing the volume overlap of reference streams and non-reference streams is more effective than maximizing volume coverage of the reference streams.

#*Fast Level Set Multi-View Stereo on Graphics Hardware.
#@Patrick Labatut,Renaud Keriven,Jean-Philippe Pons
#year2006
#conf3DPVT
#citation7
#index4559
#arnetid4561
#!In this paper, we show the importance and feasibility of much faster multi-view stereo reconstruction algorithms relying almost exclusively on graphics hardware. Reconstruction algorithms have been steadily improving in the last few years and several state-of-the-art methods are nowadays reaching a very impressive level of quality. However all these modern techniques share a very lengthy computational time that completely forbids their more widespread use in practical setups: the typical running time of such algorithms range from one to several hours. One possible solution to this problem seems to lie in the use of graphics hardware: more and more computer vision techniques are taking advantage of the availability of cheap computational horsepower and divert graphics hardware from its original purpose to accelerate the early stages of some algorithms. We present here an almost full implementation on graphics hardware of a multi-view stereo algorithm based on surface deformation by a PDE: this algorithm tries to minimize the error between input images and predicted ones by reprojection via the surface. As it mainly works on whole images, it is well suited for graphics hardware. We show how we succeeded to bring the whole reconstruction time within minutes. Results for synthetic and real data sets are presented with computational times and compared with those of other state-of-the-art algorithms.

#*Reconstructing a 3D Line from a Single Catadioptric Image.
#@Douglas Lanman,Megan Wachs,Gabriel Taubin,Fernando Cukierman
#year2006
#conf3DPVT
#citation12
#index4560
#arnetid4562
#!This paper demonstrates that, for axial non-central optical systems, the equation of a 3D line can be estimated using only four points extracted from a single image of the line. This result, which is a direct consequence of the lack of vantage point, follows from a classic result in enumerative geometry: there are exactly two lines in 3-space which intersect four given lines in general position. We present a simple algorithm to reconstruct the equation of a 3D line from four image points. This algorithm is based on computing the Singular Value Decomposition (SVD) of the matrix of Plücker coordinates of the four corresponding rays. We evaluate the conditions for which the reconstruction fails, such as when the four rays are nearly coplanar. Preliminary experimental results using a spherical catadioptric camera are presented. We conclude by discussing the limitations imposed by poor calibration and numerical errors on the proposed reconstruction algorithm.

#*Simplified Belief Propagation for Multiple View Reconstruction.
#@E. Scott Larsen,Philippos Mordohai,Marc Pollefeys,Henry Fuchs
#year2006
#conf3DPVT
#citation4
#index4561
#arnetid4563
#!We address multiple-view reconstruction under an optimization approach based on belief propagation. A novel formulation of belief propagation that operates in 3-D is proposed to facilitate a true multi-image processing scheme that takes visibility into account and thus is applicable to scenes that contain significant occlusions. Visibility is not approximated but is estimated and used in a modified plane sweep stereo scheme. Optimization is performed in a simplified belief propagation framework in which messages are passed in 3-D, instead of 2-D, neighborhoods utilizing information from all available images. The information propagated from a point to one of its neighbors factors in the distance between the two points in 3-D, their difference in color. In contrast to traditional belief propagation, the observation is updated at each iteration to incorporate changes in visibility. The proposed approach is capable of enforcing smoothness on the evolving 3-D surfaces without being limited to a coarse resolution due to a volumetric representation. Moreover, our approach is applicable to both open and closed surfaces with no need for a priori knowledge of the type. We present dense reconstructions of publicly available image sets.

#*Compression of Human Motion Data Sequences.
#@Guodong Liu,Leonard McMillan
#year2006
#conf3DPVT
#citation1
#index4562
#arnetid4564
#!As more and more human motion data are widely used to animate computer graphics figures in many applications, there is an imperative need to compress motion data for compact storage and fast transmission. We propose a data-driven method for efficient compression of human motion sequences by exploiting both spatial and temporal coherences of the data. We first segment a motion sequence into subsequences such that the poses within a subsequence lie near a low dimensional linear space. We then compress each segment using the principal component analysis. Further compression is achieved by storing only the key frames' projections to the principal component space and interpolating the other frames in-between the key frames via spline functions. The experimental results show that our method can achieve significant compression rate with low reconstruction errors.

#*Transforming Least Squares to Weighted Least Squares for Accurate Range Image Registration.
#@Yonghuai Liu,Hong Zhou,Xuan Su,Mingxin Ni,Robert J. Lloyd
#year2006
#conf3DPVT
#citation3
#index4563
#arnetid4565
#!The traditional ICP algorithm is a de facto standard approach for range image registration. While it assumes that one data set is a subset of another, this assumption is often violated in practice. As a result, a number of algorithms have been developed to first eliminate false matches due to occlusion, appearance and disappearance of points and then estimate the camera motion parameters in the least squares sense. Instead of eliminating outliers in the process of image registration, we in this paper use the generalised entropy to estimate the probability of correspondences established using the traditional closest point criterion, leading camera motion parameters to be estimated in the weighted least squares sense. For more accurate registration results, we also learn from the probability of correspondences estimated in the past. Since one point in one data set can only correspond to a single point in another, the two way constraint is also imposed. Finally the camera motion parameters are optimized using the powerful mean field annealing scheme. A comparative study based on real images has shown that the proposed algorithm produces promising automatic range image registration results.

#*Virtual View Specification and Synthesis in Free Viewpoint Television Application.
#@Wenfeng Li,Jin Zhou,Baoxin Li,M. Ibrahim Sezan
#year2006
#conf3DPVT
#citation1
#index4564
#arnetid4566
#!In conventional TV, users can get only a single view of a real 3D world. The view is determined not by a user but by the camera position during acquisition. Free viewpoint television (FTV) is a new concept which aims at giving viewers the flexibility to select a novel viewpoint by employing multiple video streams as the input. Current proposed solutions for FTV include those based on ray-space sampling and interpolation. Most existing work makes the assumption that the cameras are calibrated. Moreover, virtual view specification is done in ways that would not be practical for actual use (e.g., some methods specify the virtual view by a rotation matrix and a translation vector). This paper proposes a framework for FTV based on image-based rendering, complete with key algorithms for color-based segmentation and correspondence, and multiple-image-based virtual view synthesis from uncalibrated cameras. Moreover, we propose an intuitive approach to specifying the virtual viewpoint, based on any two views chosen by the user. This makes the specification of the virtual view very intuitive and thus practical for the FTV application. Experiments with real video streams were performed to validate the proposed approaches.

#*3D Reconstruction by Gluing Pair-Wise Euclidean Reconstructions, or "How to Achieve a Good Reconstruction from Bad Images".
#@Daniel Martinec,Tomás Pajdla
#year2006
#conf3DPVT
#citation12
#index4565
#arnetid4567
#!This paper presents a new technique for estimating a multi-view reconstruction given pair-wise Euclidean reconstructions up to rotations, translations and scales. The partial reconstructions are glued by the following three step procedure: (i) Camera rotations consistent with all reconstructions are estimated linearly. (ii) All the pair-wise reconstructions are modified according to the new rotations and refined by bundle adjustment while keeping the corresponding rotations same. (iii) The refined rotations are used to estimate both camera translations and 3D points using Second Order Cone Programming by minimizing the L1- norm. We introduce a new criterion for evaluating importance of an epipolar geometry in influence on the overall 3D geometry. The estimated importance is used to re-weight data in the above algorithm to better handle unequiponderantly captured images. The performance of the proposed method is demonstrated on difficult wide base-line image sets.

#*Expression Compensation for Face Recognition Using a Polar Geodesic Representation.
#@Iordanis Mpiperis,Sotiris Malassiotis,Michael G. Strintzis
#year2006
#conf3DPVT
#citation6
#index4566
#arnetid4568
#!This paper addresses the problem of face recognition in the presence of facial deformations caused by expressions. An isometric mapping between surfaces is assumed, which allows preservation of geodesic distance between facial points. Subject to this assumption, we propose a novel technique which integrates 2D and 3D information to establish a new deformation invariant representation of the face. The 3D surface is used to define a polar geodesic coordinate space which is independent of the intrinsic geometry of the face. The corresponding color image is embedded in this space and serves as the recognition data. A preceding stage of hierarchical diffeomorphic grid-based image warping before the recognition process combined with a lip segmentation technique are also employed to increase the overall performance of the algorithm.

#*Rao-Blackwellized Importance Sampling of Camera Parameters from Simple User Input with Visibility Preprocessing in Line Space.
#@Kevin Quennesson,Frank Dellaert
#year2006
#conf3DPVT
#citation1
#index4567
#arnetid4569
#!Users know what they see before where they are: it is more natural to talk about high level visibility information ("I see such object") than about one's location or orientation. In this paper we introduce a method to find in 3D worlds a density of viewpoints of camera locations from high level visibility constraints on objects in this world. Our method is based on Rao-Blackwellized importance sampling. For efficiency purposes, the proposal distribution used for sampling is extracted from a visibility preprocessing technique adapted from computer graphics. We apply the method for finding in a 3D city model of Atlanta the virtual locations of real-world cameras and viewpoints.

#*Understanding Consumer Search Activity and Online Purchase Intensions for Improving the Product Recommendation Search.
#@Wen-Shan Lin,Ming-Fong Chen,Yan-Yan Chen
#year2007
#confACIS-ICIS
#citation0
#index4568
#arnetid4570

#*The Design of a Virtual Prototyping Based on ARMulator.
#@Young-Ran Lee,Sang-Young Cho,Jeong-Bae Lee
#year2005
#confACIS-ICIS
#citation1
#index4569
#arnetid4571
#!Nowadays, the development of computer technology has several improvements, not only in popularity but also in complexity. Some engineers apply Virtual Prototyping to get the greatest advantage of prototype at the development life cycle. Basically, the Virtual Prototyping offers the external shape of product including their components, GUI and data into computer. The Virtual Prototyping can simulate various devices and their functions same as the Real Prototyping, but the Virtual Prototyping do not need real board like the Real Prototyping. As a result, the Virtual Prototyping will bring more advantage instead of the Real Prototyping specially to develop the complex products which they have complex hardware devices. In this thesis, we want to show how to develop the new product with short Time to Market and Time to Prototype by using Virtual Prototyping base on ARM core.

#*Enhancing Transparency and Adaptability of Dynamically Changing Execution Environments for Mobile Agents.
#@JinHo Ahn,ChaYoung Kim
#year2005
#confACIS-ICIS
#citation0
#index4570
#arnetid4572
#!Mobile agent-based distributed systems become obtaining significant popularity as a potential vehicle to allow software components to be executed on heterogeneous environments despite mobility of users and computations. However, as these systems generally force mobile agents to use only common functionalities provided in every execution environment, the agents may not access environment-specific resources. In this paper, we propose a new framework using Aspect Oriented Programming technique to accommodate a variety of static resources as well as dynamic ones whose amount is continually changed at runtime even in the same execution environment. Unlike previous works, this framework divides roles of software developers into three groups to relieve application programmers from the complex and error-prone parts of implementing dynamic adaptation and allowing each developer to only concentrate on his own part. Also, the framework enables policy decision makers to apply various adaptation policies to dynamically changing environments for adjusting mobile agents to the change of their resources.

#*Genetic Algorithm Implementation in Python.
#@Wonjae Lee,Hak-Young Kim
#year2005
#confACIS-ICIS
#citation5
#index4571
#arnetid4573
#!This paper deals with genetic algorithm implementation in Python. Genetic algorithm is a probabilistic search algorithm based on the mechanics of natural selection and natural genetics. In genetic algorithms, a solution is represented by a list or a string. List or string processing in Python is more productive than in C/C++/Java. Genetic algorithms implementation in Python is quick and easy. In this paper, we introduce genetic algorithm implementation methods in Python. And we discuss various tools for speeding up Python programs.

#*Taguchi-Based Metrics for Software Quality.
#@Kiumi Akingbehin
#year2005
#confACIS-ICIS
#citation4
#index4572
#arnetid4574
#!A set of metrics (numerical software measurements) based on the Taguchi philosophy are proposed for measuring software quality. The Taguchi approach, originally developed for manufacturing processes, define quality in terms of "loss imparted to society" by a product after delivery of the product to the end user. The nominal-the-best and smaller-the-best loss functions developed by Taguchi are adapted for software products and case studies are presented to support the adaptation. The proposed Taguchi-based metrics are in line with six-sigma statistical quality control techniques that have been used with software products in recent years. Experiences with the proposed metrics have shown good correlation with existing popularly known software quality metrics.

#*Mining for Context Recognition in Document Filtering and Classification.
#@Rey-Long Liu
#year2005
#confACIS-ICIS
#citation0
#index4573
#arnetid4575
#!Much information has been hierarchically organized to facilitate information browsing, retrieval, and dissemination. In practice, much information may be entered at any time, but only a small subset of the information may be classified into some categories in a hierarchy. Therefore, achieving document filtering (DF) in the course of document classification (DC) is an essential basis to develop an information center, which classifies suitable documents into suitable categories, reducing information overload while facilitating information sharing. In this paper, we present a technique ICenter, which conducts DF and DC by recognizing the context of discussion (COD) of each document and category. Experiments on real-world data show that, through COD recognition, the performance of ICenter is significantly better. The results are of theoretical and practical significance. ICenter may serve as an essential basis to develop an information center for a user community, which shares and organizes a hierarchy of textual information.

#*Approximate Element Computational Time for Domain Decomposition in Parallel Finite Element Code.
#@Thuy T. Le
#year2007
#confACIS-ICIS
#citation0
#index4574
#arnetid4576

#*Use of Honeynets in Computer Security Education.
#@Shiva Azadegan,Vanessa McKenna
#year2005
#confACIS-ICIS
#citation0
#index4575
#arnetid4577
#!Honeynets have been proven to be valuable research and teaching tool in the area of computer security and information assurance. At Towson University, since Fall 2002, an undergraduate track in computer security has been made available to the Computer Science majors. The main objective of the track is to build upon the core courses in the computer science program and to provide students with hands-on experience with security tools commonly used in industry. This paper explores educational use of honeynets in several courses required by this track.

#*Towards a Table Driven XML QoS Aware Transmission Framework.
#@Alex Ng
#year2007
#confACIS-ICIS
#citation0
#index4576
#arnetid4578

#*Equivalence of Transforming Non-Linear DACG to Linear Concept Tree.
#@Wenyi Bi,Junping Sun
#year2005
#confACIS-ICIS
#citation1
#index4577
#arnetid4579
#!This paper introduces a strategy and its theory proof to transform non-linear concept graph: Directed Acyclic Concept Graph (DACG) into a linear concept tree. The transformation is divided into three steps: normalizing DACG into a linear concept tree, establishing a function on host attribute, and reorganizing the sequence of concept generalization. This study develops alternative approach to discovery knowledge under non-linear concept graph. It overcomes the problems with information loss in rule-based attribute oriented induction and low efficiency in path-id method. Because DACG is a more general concept schema, it is able to extract rich knowledge implied in different directions of non-linear concept scheme.

#*A Shortest-Path Network Problem Using an Annealed Ant System Algorithm.
#@Shao-Han Liu,Jzau-Sheng Lin,Zi-Sheng Lin
#year2005
#confACIS-ICIS
#citation3
#index4578
#arnetid4580
#!This paper investigates a shortest-path network problem using an annealed ant system algorithm, in which an annealing strategy is embedded to calculate the probabilities to decide which path the ants will select next. The shortest-path problem is to determine the shortest route between a source and a destination in a transportation-network topology. In this approach, according the concrete problems of shortest routing, we construct two globally optimizing annealed ant algorithms that are Concentrated Model and Distributed Model. The Concentrated Model (CM) means all ants are initially concentrated in the source node while all ants randomly select a node except the destination as their starting point initially and at least one must appear in the source node for the Distributed Model (DM). The experimental results show that the proposed annealed ant algorithm with the Roulette wheel selection can obtain better performance than that generated by the traditional ant strategy with/without the Roulette wheel selection.

#*Concurrency Control of Spatial Join on Spatial Database.
#@Jeang-Kuo Chen
#year2005
#confACIS-ICIS
#citation0
#index4579
#arnetid4581
#!For the process of spatial data, in addition to the basic operations of insertion, deletion, update, and search, there are some special operations such as nearest neighbor search, spatial join, etc. Hung et al. proposed an algorithm based on an R-tree to perform the operation of spatial join for spatial objects. However, this algorithm is only suitable for the database of single-user environment. In this paper, we propose a version of multi-user environment. By the mechanism of concurrency control, our algorithm can make the spatial data be shared to many users.

#*A Generic Software Framework for the Software System Achitecture Design and Implementation of Handset Devices.
#@Po-Chang Liu,Ming-Jyh Tsai,Deng-Jyi Chen
#year2005
#confACIS-ICIS
#citation-1
#index4580
#arnetid4582
#!The traditional approach to develop user interface for handset devices has limited flexibility on the UI requirement changes. Once the UI requirement changed, programmers have to change their handcrafted application once again. This change may occur repeatedly until the UI requirement under consideration is satisfied. Visual-Based Software Construction Methodology has been developed. This methodology helps programmers to develop the user interface for handset devices, and allows programmers to migrate their program to new platform quickly. Based on this methodology, we quest for a generic software framework to incorporate the proposed methodology for developing user interface to alleviate the problems mentioned above. From our study, there are some similarities exist among user interface and software framework in different handset devices. In this paper, we propose a generic software framework for the system architecture design of handset devices. Specifically, the software framework generated based on the generic software framework will be much easier for maintenance and management compared with the traditional approach. In addition, the software framework hat is instantiated from the generic software framework can be incorporated into the visual requirement authoring system for user interface development. Finally, we design and construct a simulator to demonstrate the applicability and usefulness of the software framework generated by the proposed generic software framework.

#*A Review Approach to Detecting Structural Consistency Violations in Programs.
#@Yuting Chen,Shaoying Liu,Fumiko Nagoya
#year2005
#confACIS-ICIS
#citation-1
#index4581
#arnetid4583
#!The application of specification-based programverification techniques (e.g., testing, review, and proof) usually faces strong challenges in practice when the gap between the structure of a specification and that of its program is large. In this paper we describe an approach to detecting the violations of the structural consistency in programs based on their specifications by review. The approach is aimed at supporting software development in which programs are constructed based on their formal specifications. We establish a set of criteria and a review process that can guide reviewers to uncover structural consistency violations in programs, and apply the approach in a case study to assess its effectiveness.

#*Combining Local and Global History Hashing in Perceptron Branch Prediction.
#@C. Y. Ho,Anthony Shi-Sheung Fong
#year2007
#confACIS-ICIS
#citation1
#index4582
#arnetid4584

#*3D Graphics Performance Scaling and Workload Decomposition and Analysis.
#@Fadi N. Sibai
#year2007
#confACIS-ICIS
#citation1
#index4583
#arnetid4585

#*A Distributed Platform for Archiving and Retrieving RSS Feeds.
#@David Chmielewski,Gongzhu Hu
#year2005
#confACIS-ICIS
#citation10
#index4584
#arnetid4586
#!A typical user has a collection of web sites she often visits to get information, but keeping track of "whatýs new" on these web sites is a non-trivial task. As the contents of the websites change frequently, the user would conceivably refresh or reload the web pages to recollect the information to see if anything is new. To make this keep-up-to-date task easier, many web sites provide what are called RSS feeds, which are descriptions of the new data in XML format. Some RSS readers have been developed in the past several years, but they are not able to retrieve information that was updated during the time period when the reader is offline. In this paper, we present a distributed platform that can archive, retrieve, and synchronize RSS feeds for the updated information through a network of servers.

#*Intelligent Airbag Deployment Algorithm Design and Implemented by DSP Chip.
#@Yi-Jen Mon
#year2005
#confACIS-ICIS
#citation0
#index4585
#arnetid4587
#!An improved algorithm design methodology of vehicle airbag deployment decision is proposed in this paper. Firstly, the vehicle impact severity is analyzed to get four characteristic factors utilized as fuzzy inputs. From these four characteristics factors, the 'two stages fuzzy algorithm' is developed and used as the airbag deployment algorithm to identify the vehicle impact severity. Secondly, the algorithm is translated as machine codes download to DSP 6X chip by MATLAB¿ software. Finally, the LabView¿ software is used to generate crash data to test the developed algorithm. Simulation results for different vehicle crash data demonstrate the validity and effectiveness of the proposed design methodology.

#*Chip Design of LPC-cepstrum for Speech Recognition.
#@Gin-Der Wu,Zhen-Wei Zhu
#year2007
#confACIS-ICIS
#citation2
#index4586
#arnetid4588

#*Design and Implementation of UML Based Mobile Integrated Management System.
#@Seong-Man Choi,Chang-Mog Lee,Cheol-Jung Yoo,Ok-Bae Chang
#year2005
#confACIS-ICIS
#citation0
#index4587
#arnetid4589
#!Existing research expenses management task consists of budget planning, budget draw-up, and exact settlement of budget. Therefore integrated management is needed keenly for certain security, efficient operation and clear execution of research expenses. To reflect these needs, Research Expenses Integrated Management(REIM) has been offered for the application used on mobile by reusing an business application module has been developed in REIM development process. Mobile collaboration component which supports a specialized collaboration process to be adapted for the peculiarities of a mobile machine also has been developed. As a result, it can offer various supportive information for decision making for the establishment of research management policy by reflecting userýs requirement in real-time. It can also provide accuracy and prevention of errors to each operation since it can grasp the process of each operation without time and space hindrance through mobile collaboration

#*A Conceptual Architecture for the Uniform Identification of Objects.
#@Syed Shariyar Murtaza,Choong Seon Hong
#year2005
#confACIS-ICIS
#citation1
#index4588
#arnetid4590
#!Service discovery in ubiquitous environment, as well as adding semantics to the data is quite established now. But, still there is no uniform framework for the identification of devices. A uniform identity mechanism which would help existing architectures interoperate, allow agents to roam autonomously and leverage the World Wide Web to its full potential. Here we have tried to achieve this by proposing a URI based architecture for the identification of ubiquitous objects and human. We have materialized our perspective by presenting a conceptual architecture .We argue that by using URIs for physical objects we could leverage the existing architectures of semantic web and ubiquitous system to their highest potential. Our case studies at the end, second our argument, "A Semantically Ubiquitous Web".

#*An Approach to Extension of UML 2.0 for Representing Variabilities.
#@You-Hee Choi,Gyu-Sang Shin,Youngjong Yang,Changsoon Park
#year2005
#confACIS-ICIS
#citation3
#index4589
#arnetid4591
#!The product line is the remarkable technology that enables developing products quickly by instantiating product architecture from product line architecture according to product requirements. The product line architecture representing a common architecture of whole products in the product line is being regarded as an important asset in the product line. In order to easily create a product architecture from the product line architecture, common parts among products and variable parts of each product must be explicitly represented on the product line architecture. However, existing software architecture modeling languages, such as UML and ADLs, doný t support product line architectures in a helpful way. Therefore, we propose an approach to extension of UML 2.0 to represent variabilities on the product line architecture.

#*A General Scalable Parallelizing of Strassen's Algorithm for Matrix Multiplication on Distributed Memory Computers.
#@Duc Kien Nguyen,Ivan Lavallée,Marc Bui,Quoc Trung Ha
#year2005
#confACIS-ICIS
#citation-1
#index4590
#arnetid4592
#!Strassenýs algorithm to multiply two n × n matrices reduces the asymptotic operation count from O(n3) of the traditional algorithm to O(n2.38), thus on distributed memory computers, the association of Strassenýs algorithm and the parallel matrix multiplication algorithms always gives remarkable results. Within this association, the application of Strassenýs algorithm at inter-processor level requires us to solve more difficult problems in designing but it forms the most effective algorithms. In this paper, a general model of these algorithms will be presented and we also introduce a scalable method to implement this model on distributed memory computers.

#*Mining Frequent Pattern Using Item-Transformation Method.
#@Tsai-Pin Chu,Fan Wu,Shih-Wen Chiang
#year2005
#confACIS-ICIS
#citation1
#index4591
#arnetid4593
#!Mining frequent patterns is a fundamental and crucial task in data-mining problems. This paper proposes a novel and simple approach, which does not belong to the candidate generation-and-test approach (for example, the Apriori algorithm) and the pattern-growth approach (such as the FP-growth algorithm)two approaches. This approach treats the database as a stream of data and finds the frequent patterns by scanning the database only once. Two versions of the approach (i.e., mapping-table and transformation-function) are provided. Analyses and simulations of the approach are also performed. Analyses show that the transformation-function version is much better than the Apriori and FP-growth ones in storage complexity. Simulation results show that the mapping-table version is comparable to the FP-growth algorithm in execution time.

#*Palmprint Identification Algorithm Using Hu Invariant Moments and Otsu Binarization.
#@Jin Soo Noh,Kang Hyeon Rhee
#year2005
#confACIS-ICIS
#citation23
#index4592
#arnetid4594
#!Recently, Biometrics-based personal identification is regarded as an effective method of person's identity with recognition automation and high performance. In this paper, the palmprint recognition method based on Hu invariant moment is proposed. And the low-resolution (75dpi) palmprint image (135×135 Pixel) is used for the small scale database of the effectual palmprint recognition system. The proposed system is consists of two parts: firstly, the palmprint fixed equipment for the acquisition of the correctly palmprint image and secondly, the algorithm of the efficient processing for the palmprint recognition. And the palmprint identification step is limited 3 times. As a results, when the coefficient is 0.001 then FAR and GAR are 0.038% and 98.1% each other. The authors confirmed that FAR is improved 0.002% and GAR is 0.1% each other compared with online palmprint Identification algorithm.

#*Two Approaches for the Improvement in Testability of Communication Protocols.
#@Anthony Chung,Tao Huang
#year2005
#confACIS-ICIS
#citation5
#index4593
#arnetid4595
#!Protocols have grown larger and more complex with the advent of computer and communication technologies. As a result, the task of conformance testing of protocol implementation has also become more complex. The study of design for testability (DFT) is a research area in which researchers investigate design principles that will help to overcome the ever increasing complexity of testing distributed systems. Testability metrics are essential for evaluating and comparing designs. In a previous paper, we introduce a new metric for testability of communication protocols, based on the detection probability of a default. We demonstrate the usefulness of the metric for identifying faults there are more difficult to detect. In this paper, we present two approaches for improved testing of a protocol implementation once those faults that are difficult to detect are identified.

#*Matchmaking Algorithms to Improve Dynamic Service Matching in Ubiquitous Environments.
#@Kyu Min Lee,Kee-Hyun Choi,Seung-Phil Her,Dong Ryeol Shin
#year2005
#confACIS-ICIS
#citation3
#index4594
#arnetid4596
#!Service discovery middlewares allow users to find and use services through service discovery protocols without previous knowledge of the locations or characteristics of the services with minimum manual efforts in heterogeneous and ubiquitous environments. For this reason, in recently, many researchers have done the studies related on the service discovery middlewares and many papers dealing with this field have been published. However, when a number of service consumers request services to middle agents (e.g. matchmaker, broker, yellow page, blackboard, etc) within the service discovery middlwares, the middle agents does not guarantee efficient and rapid matching results because they only use a simple matching algorithm. In this paper, we address the issues of existing matching algorithms, and then propose a new matchmaking algorithm based on marriage matching algorithm of ATM network [1] to improve middle agentsý performance, complementing shortcomings of existing matching algorithms. We also add a priority based matching to the new algorithms. Through this priority, important service request messages are processed faster than request messages that have low priorities. We expect the proposed matchmaking mechanism to increase usersý satisfaction in dynamic environments.

#*PRBAC: An Extended Role Based Access Control for Privacy Preserving Data Mining.
#@Anour F. A. Dafa-Alla,Eun Hee Kim,Keun Ho Ryu,Yong Jun Heo
#year2005
#confACIS-ICIS
#citation4
#index4595
#arnetid4597
#!Issues about privacy-preserving data mining have emerged globally, but still the main problem is that non- sensitive information or unclassified data, one is able to infer sensitive information that is not supposed to be disclosed. This paper proposes an approach to PPDM based on an extended Role based access control called Privacy preserving Data mining using an extended role based access control (PRBAC); Sensitive objects (SOBS) component is added to the model in order to privacy protecting during data mining. Users are allowed to access and thereby mine different sets of data according to their roles. Our proposed model can be used over the existing technologies. The paper goal is topreserve individualýs privacy.

#*A Reflective Practice of Automated and Manual Code Reviews for a Studio Project.
#@Jun-Suk Oh,Ho-Jin Choi
#year2005
#confACIS-ICIS
#citation2
#index4596
#arnetid4598
#!In this paper, the target of code review is Project Management System (PMS), developed by a studio project in a software engineering masterýs program, and the focus is on finding defects not only in view of development standards, i.e., design rule and naming rule, but also in view of quality attributes of PMS, i.e., performance and security. From the review results, a few lessons are learned. First, defects which had not been found in the test stage of PMS development could be detected in this code review. These are hidden defects that affect system quality and that are difficult to find in the test. If the defects found in this code review had been fixed before the test stage of PMS development, productivity and quality enhancement of the project would have been improved. Second, manual review takes much longer than an automated one. In this code review, general check items were checked by automation tool, while project-specific ones were checked by manual method. If project-specific check items could also be checked by automation tool, code review and verification work after fixing the defects would be conducted very efficiently. Reflecting on this idea, an evolution model of code review is studied, which eventually seeks fully automated review as an optimized code review.

#*Providing Reliable Web Services through Active Replication.
#@Xinfeng Ye
#year2007
#confACIS-ICIS
#citation2
#index4597
#arnetid4599

#*Software Engineering - Components, Interfaces, Behaviors.
#@Walter Dosch
#year2005
#confACIS-ICIS
#citation-1
#index4598
#arnetid4600

#*Protein Knowledge Extension Based on Web Database.
#@J. Park,D. Hwang
#year2005
#confACIS-ICIS
#citation0
#index4599
#arnetid4601
#!The amount of information related to molecular biology including gene is increasing as the research in various area produces voluminous results. With this massive amount of data and distributed information environment, bioinformatics are required to collect the necessary information and organize the collected data for their own purpose. This challenges the feasible solution that collects data in a short time and integrates the collected data into the well-organized representation. In this paper, we discuss the information integration system and the effect of middleware database for protein information with the demanded data. We also demonstrate the experimental results that show the effectiveness of the middleware database utilization.

#*Reengineering Legacy Source Code to Model Driven Architecture.
#@K. Gowthaman,Khurram Mustafa,Raees A. Khan
#year2005
#confACIS-ICIS
#citation0
#index4600
#arnetid4602
#!The reengineering processes generally focus on the increased productivity and quality of the systems. Reengineering of legacy source code into ýnew improved architectureý based system is a challenge because recovery of abstractions and applying decomposition techniques from traditional programming languages continue to be quite complex. In this paper we propose a model for Aspect-Oriented Reengineering Requirements and explore the aspect-based technical approach using UML support extension mechanism to reach the ýnew improved source code architecture systemý. We also believe this method offers a way to extend aspect coverage through incremental support and maintenance. The proposed technique aims at enhancing software reuse by increasing code modularity and reducing code tangling.

#*An Efficient Workcase Classification Method and Tool in Workflow Mining.
#@Min-Jae Park,Kwang-Hoon Kim,Chang-Min Kim
#year2005
#confACIS-ICIS
#citation7
#index4601
#arnetid4603
#!This paper conceives a workcase classification method and implements it as a tool so as to be used in workflow mining systems. The method is for resolving the workcase classification problem issued for mining an activity firing or execution sequence of a workcase from monitoring and audit logs. That is, it finally generates a workcase classification decision tree consisting of a minimal set of critical activities to be used for deciding the corresponding researchable-path of the workcases. Why is the methodefficient? Because it uses a minimal decision tree in classifying workcasesý reachable-paths. And the tool is a graphical visualizer of the method, and consists of three subsystems used to automatically generate information control net, activity dependency net and minimal activity net through their corresponding algorithms. Especially the method and tool might be an impeccable solution for the specific domain of massively parallel large-scale workflow procedures. In a consequence, workflow mining methodologies and systems are rapidly growing and coping with a wide diversity of domains in terms of their applications and working environments. So, the literature needs various, advanced, and specialized workflow mining techniques and architectures that are used for finally feed-backing their analysis results to the redesign and reengineering phase of the existing workflow and business process models. We strongly believe that this work might be one of those impeccable attempts and pioneering contributions for pioneering and advancing the workflow mining technology.

#*Research on Fast Block Participation Mode Selection Algorithm in H.264.
#@Jianjun Guo,Kui Dai,Yun Cheng,Zhiying Wang
#year2005
#confACIS-ICIS
#citation1
#index4602
#arnetid4604
#!The variable block size motion compensation using multiple reference frames is one of the key technologies to provide notable performance gain in H.264. However it is also the main bottleneck that increases the overall computational complexity. For this reason, based on some test results, this paper proposes a new biased fast mode decision method for H.264 video coding standard. Experimental results indicate that this method can speed up the H.264 encoder efficiently without noticeable loss in quality.

#*Data Broadcasting Software Architecture supporting Real-Time Caching and Monitoring in Interactive TV.
#@Dong-Hwan Park,Tai-Yeon Ku,Kyeong-Deok Moon
#year2005
#confACIS-ICIS
#citation2
#index4603
#arnetid4605
#!This paper proposes software architecture of a broadcasting file system that can support the priority-based queuing of section filters and the caching mechanism of carousel objects. The data broadcasting software should guarantee the real-time characteristics such as the threadýs processing time in periodic monitoring threads to detect the change of information. Therefore this proposed architecture can improve the predictability of periodic monitoring section filter threads by using the management of thread pool and the scheduling of periodic threads. To guarantee the fast launch of data broadcasting application, this paper also proposes the cache control mechanism of DSM-CC data/object carousel. This proposed architecture is able to accommodate the data broadcasting middleware that using DSM-CC object carousel mechanism such as ACAP, OCAP, and MHP.

#*Rank-Based Image Transformation for Entropy Coding Efficiently.
#@Deuk-Su Han,Myung-Jae Lee,Kang-Soo You,Euee S. Jang,Hoon-Sung Kwak
#year2005
#confACIS-ICIS
#citation1
#index4604
#arnetid4606
#!In this paper, we introduce a rank-based image transformation which is pre-processing method for gray-level images to be compressed more efficiently by entropy encoder. Before entropy encoding a stream of gray-level values in an image, the proposed method counts co-occurrence frequencies for neighboring pixel values. Then, it replaces each pairs of adjacent gray values with particular ordered number based on the investigated co-occurrence frequencies. Finally, the method transmits the adjusted data which has ordered number to entropy encoder. Because statistical characteristic is more enhanced by this preprocessing step, it is possible to improve performance of entropy coding. From the simulation result using 8 bits gray-scale images, it is verified that the proposed method can reduce bit rate by up to 37.85% than plain entropy coders.

#*The Design and Implementation of Asset Management System on the NGIS.
#@Choon Seo Park,Jung Keun Kim,Su-Jung Mun,Yu-Hyeon Bak,Hag-Young Kim
#year2005
#confACIS-ICIS
#citation0
#index4605
#arnetid4607
#!We have developed the Next Generation Internet Server (NGIS) which has Network-Storage (NS) Cards for streaming service. The NGIS system provides assets of various types to support streaming service and has NS Cards with a powerful network function. The NGIS system offers streaming service for assets of various types, such as MPEG1 files,MPEG2 files andMPEG4 files. In this paper, we propose the method of installing assets, such as MPEG 1 files, MPEG 2 files and MPEG 4 files, to support to streaming service in the NGIS system. If the type of multimedia data is MPEG 1 or 2, we propose the method of installing assets, which makes Fast Forward(FF) files and Fast Rewind(FR) files in real-time in order to support a FF service and a FR service, and suggest another method, which makes a FF file and a FR file off-line and installs the FF file and the FR file when system of installing assets begins. In this paper, also, we propose Contents Management System (CMS) calling asset installer automatically to install assets when the assets are at a certain place.

#*Efficient Mobility Management for Multimedia Service in Wireless IP Networks.
#@Sang-Bum Han,Heyi-Sook Suh,Keun-Ho Lee,Chong-Sun Hwang
#year2005
#confACIS-ICIS
#citation3
#index4606
#arnetid4608
#!Multimedia service in wireless IP networks, most delays and disruptions happening on the handoff of nodes are related to AAA. There were many studies on attempting to reduce the delay happening on the handoffs, and among them, there is the shadow registration as a suitable method for seamless mobility. Shadow registration is a method preparing against the following handoff by registering to all neighboring cells in prior, and is efficient in reducing the handoff delay. However, this method causes heavy traffic as well as the waste of resources. In order to prohibit the increase of traffic among the nodes while having the reducing effect on delay time, we proposes a technique and algorithm for composing Region-based Shadow Registration (RSR) that provides seamless mobility, which does not cause traffic and the waste of resources. We have introduced a cell division scheme for minimal Shadow Registration and its algorithm. The results of the experiments performed by simulations displayed the identical effect of reducing the delay as shadow registration while significantly reducing the traffic among the nodes.

#*A Framework of Context-Awareness for Ubiquitous Computing Middlewares.
#@Hyunjung Park,Jeehyong Lee
#year2005
#confACIS-ICIS
#citation5
#index4607
#arnetid4609
#!In upcoming future, ubiquitous computing environments allow users to provide appropriate services or information which intelligently interact with omnipresent computing resources as user's needs in anywhere and any-time fashion. So ubiquitous computing environments need context-aware systems to gather and analyze context information from situations or surroundings. Also the systems should have abilities to handle and generate context information by combining, inferencing and learning of sensed contexts. But the previous context-aware systems are lack of systematic handling of contexts in various types, and only a few have learning mechanisms to acquire individual usersý preference or usersý interests. In this paper, we propose a general framework for ubiquitous computing middlewares which easily handles and generates various types of contexts from diverse sensors. The framework is designed to sense, combine, infer, and learn context information in order to provide users with various services in changing environments. We partially implemented the proposed framework for a music recommendation system as a prototype.

#*Impact of Image Organizations on Multimedia Document Retrieval.
#@Nazmul Haque,Morshed U. Chowdhury,Syed Mahbubur Rahman
#year2005
#confACIS-ICIS
#citation0
#index4608
#arnetid4610
#!In this paper we compare ranking effectiveness of heterogeneous multimedia document retrieval when different image organizations are used for formulating queries. The quality of image queries depends on the organization of images used to make queries which in turn significantly impacts retrieval precision. CBIR (Content Based Information Retrieval) needs an effective and efficient organization of images including user interface which must be part of the configuration parameters of image retrieval research.

#*Development of Incident Detection Model Using Neuro-Fuzzy Algorithm.
#@Seung-Heon Lee,Jin-Woo Choi,Nam-Kwan Hong,Murlikrishna Viswanathan,Young-Kyu Yang
#year2005
#confACIS-ICIS
#citation4
#index4609
#arnetid4611
#!This research aims at model development for incident detection and travel time estimation using a neuro-fuzzy algorithm. Traffic incidents such as accidents, weather and construction, are a major cause of congestion. Thus incident detection and optimal travel time estimation is required for improving general traffic conditions. Until recently, two approaches related to the above were the aim of many studies. One idea is to estimate travel time using data fusion from many sources while another is to estimate optical path through travel time data. As a first step, in this paper we develop an initial model for incident detection using a neuro-fuzzy algorithm. In our experiments we find that our proposed model has a incident detection rate (DR) of over 83% and a false alarm rate (FAR) under 24%. The test results also suggest that the proposed model enhances accuracy of incident detection in an arterial road and we expect the proposed model to contribute to formal traffic policy.

#*Massive Data Delivery in Unstructured Peer-to-Peer Networks with Network Coding.
#@Shui Yu,Zhongwen Li
#year2007
#confACIS-ICIS
#citation3
#index4610
#arnetid4612

#*A Model for Application Integration Using Web Services.
#@Ashok K. Harikumar,Roger Y. Lee,Hae Sool Yang,Haeng-Kon Kim,Byeongdo Kang
#year2005
#confACIS-ICIS
#citation8
#index4611
#arnetid4613
#!The history of computing has seen several interesting trends. From a programmer building custom packaged applications to the development of Enterprise Resource Planning (ERP) systems, and other business specific packages. The need for integrating different systems in the organization led to point to point interface and spaghetti architecture. Fallout of these spaghetti architectures is the development of the Enterprise Application Integration (EAI) concept. In this paper we are going to discuss the evolution of EAI concepts and a new architecture for event driven data transformation for application integration using Web Services. The new architecture overcomes the drawback of request-reply semantics of web services by providing an event driven architecture, which supports asynchronous communication between applications using web services. We have also implemented a secure framework for accessing third party web services using message level encryption and digital certificates.

#*Integrated Sensing and Diagnosis -- The next step in Real Time Patient Health Care.
#@Iqbal Gondal,Mudasser Iqbal,Megan Woods,Muhammad Shoaib B. Sehgal
#year2007
#confACIS-ICIS
#citation3
#index4612
#arnetid4614

#*An Effective Cache Overlapping Storage Structure for SMT Processors.
#@Liqiang He,Zhiyong Liu
#year2005
#confACIS-ICIS
#citation0
#index4613
#arnetid4615
#!Simultaneous Multithreaded (SMT) processors improve the instruction throughput by allowing fetching and running instructions from several threads simultaneously at a single cycle. With the number of running threads increasing, the performance of single thread degrades continually. One main reason of that is the competition of the limited cache resources among the threads and then causing the number of cache misses of the single thread increasing dramatically. In this paper, we propose an effective cache overlapping storage structure for SMT processors. The key idea is using several bits to encode the value of a data. If the value is a frequent value, it can be read or written through the encoding scheme and a table of frequent value. All the frequent values are encoded in a determined way. Then all the bytes that store frequent values in a cache line can be used to store other values at the same positions of a different line that maps to the same physical hardware. We find that this overlapping structure is useful for SMT processors to alleviate the cache competing problem of the threads and increasing the cache hit rates of them. Comparing with the other schemes, our scheme needs less hardware or organizes the cache in a different way, and can read and write without adding much latency. The implementation of our structure is simple. Execution-driven simulation results show that with a little hardware adding to the original cache our structure obtains a performance near to that obtained from a double sized one in an SMT processor.

#*Cell Phone System for Tour & Information Guide.
#@Nariaki Kato,Naohiro Ishii
#year2007
#confACIS-ICIS
#citation0
#index4614
#arnetid4616

#*On the Benefits of Industrial Network: A New Approach with Market Survey and Fuzzy Statistical Analysis.
#@Shu-Meei Ho,Berlin Wu
#year2005
#confACIS-ICIS
#citation1
#index4615
#arnetid4617
#!Making the most of the industrial network to reduce management costs and increase competitiveness has gained a lot of attention among enterprises lately. In traditional market research methods, the approach always puts its emphasis on the data of a single value without considering the complexity of human thoughts. Thus, it is the purpose of this paper to first define fuzzy mode, fuzzy expect value and fuzzy ¿² test. Then, a new market survey is proposed to develop a more efficient survey analysis to examine the characteristics of fuzzy questionnaire and sample material. A comparison between fuzzy ¿² test and traditional ¿² test will be carried on at the end.

#*Interactions and Cooperation between Machines as a Society of Agents.
#@S. Poonphon,Yong-Soo Kim,Chulsoo Lee,R. Sadananda
#year2005
#confACIS-ICIS
#citation0
#index4616
#arnetid4618
#!The concept of interaction is central to multi-agent systems. An interaction occurs when two or more agents come into dynamic relationship through reciprocal actions. A scenario is envisaged in which agents have tasks to perform and are in a position to exchange tasks to improve their performance. This affects the overall performance of the system, but possibly, but not necessarily improves the overall performance of the system. The computing machines, especially the personal computers are intended to be operating as stand alone machines and therefore are endowed with a variety of resources. The demands on these resources are uneven on a machine as well as across the machines. Such diversity offers scope interactions resulting cooperation to meet individual goals as well as for overall system performance. Our model, attempts to illustrate the concept by using two computing machines with their usual resources, and with random initial jobs to be processed. Their performance is dependent not only on absolute total load but also on how much of each machineýs resources are in demand, thus giving scope for the beneficial exchange of jobs. This paper describes the development of a negotiation mechanism for job exchange between machines and measurement of system performance. The concept may be extended to multiple machines that act as agents exchanging resources and tasks.

#*An Adaptive Full Parallel Interference Canceller with Imperfect Channel Estimation for CDMA Systems.
#@Yung-Fa Huang,Jyh-Horng Wen
#year2005
#confACIS-ICIS
#citation1
#index4617
#arnetid4619
#!In this paper, we investigate the performance of an adaptive full parallel interference cancellation (FPIC) multiuser detection scheme based on the least mean square (LMS) algorithm for direct-sequence code-division multiple-access (DS-CDMA) communication systems. Simulation results show that the proposed FPIC multiuser detector outperforms the NLMS-based partial PIC (NLMS-PPIC) scheme over flat fading channels under imperfect channel estimation. Moreover, over a two-path frequency selective fading channel, the proposed adaptive FPIC detector is superior to the NLMS-PPIC and shows the effective cancellation of the multiple access interference (MAI) even with moderate channel estimation errors.

#*Incorporating Semantics-Based Search and Policy-Based Access Control Mechanism in Context Service Delivery.
#@Maria Riaz,Saad Liaquat Kiani,Sungyoung Lee,Young-Koo Lee
#year2005
#confACIS-ICIS
#citation1
#index4618
#arnetid4620
#!Context aware computing utilizes the information embedded in physical and computational environments to provide services adaptive to usersý preferences. As these services become more pervasive, the need for a service delivery mechanism arises. Due to the diversity, magnitude and nature of the contextual information, a context-based service delivery mechanism is required which can not only identify the most appropriately matching services for the interested clients but can also ensure that the contextual information is not compromised by providing services to illicit consumers. This paper focuses on the issues of service delivery in pervasive computing environments where services and clients are vast, varied and completely decoupled from each other. Semantics-based attributes are used for service registration and lookup. Privacy is maintained by incorporating policy based access control mechanisms in the service delivery modules.

#*A Call Admission Control Scheme for Heterogeneous Service Considering Fairness in Wireless Networks.
#@YoungHa Hwang,SungKee Noh
#year2005
#confACIS-ICIS
#citation6
#index4619
#arnetid4621
#!Guaranteeing a handoff dropping probability below a predetermined threshold is essential for wireless mobile networks. Previous researches [1-8] have proposed admission control policies for integrated voice/data traffic in wireless mobile networks. However, since QoS has been considered only in terms of CDP (Call Dropping Probability), the result has been a serious CBP (Call Blocking Probability) unfairness problem between voice and data traffic. In this paper, we suggest a new admission control policy that treats integrated voice and data traffic fairly while maintaining the CDP constraint. For underprivileged data traffic, which requires more bandwidth units than voice traffic, the packet is placed in a queue when there are no available resources in the base station, instead of being immediately rejected. Furthermore, we have adapted the biased coin method concept [9- 12] to adjust unfairness in terms of CBP. We analyzed the system model of a cell using both a two-dimensional continuous-time Markov chain and the Gauss-Seidel method [13]. Numerical results demonstrate that our CAC (Call Admission Control) scheme successfully achieves CBP fairness for voice and data traffic.

#*Mock Objects Framework for TDD in the Network Environment.
#@Ho-Yeon Ryu,Byeong-Kil Sohn,Jae-Heung Park
#year2005
#confACIS-ICIS
#citation1
#index4620
#arnetid4622
#!TDD is a software development approach which is based on test. TDD let us get improved code and refined design through lasting test with refactoring process. However, if network or database environment and other object were not developed, TDD could have a problem to make progress. If you will use the Mock Objects in this situation, TDD will be processed more effectively. To make Mock Objects needs a lot of cost and effort for network and database. Therefore this paper presents a Mock Objects frameworks for TDD which can save time and make safe Mock Objects.

#*A Novel Vertical Handoff Strategy for Integrated IEEE802.11 WLAN/CDMA Networks.
#@Kyung-Soo Jang,Jang-Sub Kim,Ho-Jin Shin,Dong Ryeol Shin
#year2005
#confACIS-ICIS
#citation17
#index4621
#arnetid4623
#!The integration of WLANs and CDMA networks has recently evolved into hot issue. We propose a vertical handoff algorithm between WLAN and CDMA network. In this algorithm, a vertical handoff is classified into handoff decision making and MIP (Mobile IP) registration process. Then, a handoff initiation is decided by the received signal strength (RSS). To reduce the unnecessary handoff probability, we consider a handoff initiation model based on the criteria of RSS. As a mechanism of network selection, we also propose a context based network selection and the corresponding algorithms between WLAN to CDMA network, based on wireless channel assignment. We focus on a handoff initiation criteria which uses both the RSS and the network selection method which uses context information such as dropping probability, blocking probability, GOS (Grade of Service), velocity. As a decision making criterion, velocity threshold is determined to optimize the system performance. The optimal velocity threshold is adjusted to assign available channels to the mobile stations. The proposed scheme is validated by computer simulation.

#*A Performance Analysis Model of PC-Based Software Router Supporting IPv6-IPv4 Translation for Residential Gateway.
#@Ssang-Hee Seo,In-Yeup Kong
#year2005
#confACIS-ICIS
#citation3
#index4622
#arnetid4624
#!This paper presents a queuing analysis model of a PC-based software router supporting IPv6-IPv4 translation for residential gateway. The propose models are M/G/1/K or MMPP-2/G/1/K by arrival process of PC-based software router. In M/G/1/K, the arrival process is assumed to be Poisson Process which is independent, identically distributed. In MMPP-2/G/1/K, The arrival process is assumed to be two-state Markov Modulated Poisson Process (MMPP). MMPP-2/G/1/K model is used to represent self-similar traffic. The service time distribution is arbitrary. The service discipline of server is processor sharing. The total number of packets that can be processed at one time is limited to K. We obtain PC-based software router performance metrics such as system sojourn time, blocking probability and throughput. The parameters are estimated by maximizing the log-like hood function of the measured average response time. The model has been validated through measurements. The performance metrics predicted by the model fit well to the experimental outcome.

#*Using Code Division Technique to Improve the Performance of Ad Hoc Wireless Network.
#@Wei-Lun Jeng,Tung-Shih Su,Wen-Shyong Hsieh
#year2005
#confACIS-ICIS
#citation0
#index4623
#arnetid4625
#!An ad hoc wireless network is limited by the characteristics of multi-hop, so its network efficiency cannot be improved by multi-channel technology. This investigation exploits the Code Division multiple access (CDMA) technology. Employing this technology, even to a single frame, enables the frame header and the frame payload to be modulated separately using a common spreading code and a special spreading code. Some data fields in the frame header are used to announce the spreading code used in the frame payload. A spreading code database is also maintained in every node to support negotiation by special spreading code to prevent the code collision. The RTS/CTS is modified into ERTS/ECTS, and a negotiation process is proposed to get the special spreading code without collision. The algorithm CSMA/CA is modified into CDCSMA/CA to enhance the performance of the ad hoc network. The proposed procedure can be followed to enable numerous node pairs to transmit at the same time as each other. Therefore, the performance of the ad hoc network is significantly.

#*Data Protection of Multimedia Contents Using Scalable Digital Watermarking.
#@JungHee Seo,HungBog Park
#year2005
#confACIS-ICIS
#citation2
#index4624
#arnetid4626
#!Presently, the development of multimedia contents has been activated due to the utilization of network-based distance education or seminar. Because of this, copyright problems for developed multimedia contents have been raised, and devices and userýs demands become various. Therefore, it is suggested that multimedia contents should be appropriately fit to each device and userýs demands and illegal manipulation of non-owners should be prevented for developed multimedia contents and the ownership should be authenticated for transformed information. In this paper, scalable digital watermarking of multimedia contents is suggested in the wavelet based compression domain with the emphasis on the robust watermark algorithm. Also, we implement multimedia data presentation system for distance education and seminars on the network and apply scalable digital watermarking techniques.

#*Study on Address Allocation in Ad-Hoc Networks.
#@Insu Jeong,Hyunjun Choi,Joongsoo Ma
#year2005
#confACIS-ICIS
#citation8
#index4625
#arnetid4627
#!The major research efforts in the area ofMANET (Mobile Ad hoc Network) focus on developing efficient routing protocols which assume mobile nodes are configured a priori with unique addresses before they enter a network. Pre-configuration is not always possible and has some drawbacks. Furthermore, a permanent central infrastructure component or network administrator does not exist in a MANET. A protocol for dynamic allocation and management mechanism for hosts with unique addresses is needed in a MANET. This article gives a solution what we do and how we do for dynamic auto-configuration and management of nodes with unique addresses in a MANET through introduction of address allocations, novel classification of each approach in terms of issues and each solution.

#*A Comprehensive Middleware Architecture for Context-Aware Ubiquitous Computing Systems.
#@Anjum Shehzad,Hung Quoc Ngo,Sungyoung Lee,Young-Koo Lee
#year2005
#confACIS-ICIS
#citation13
#index4626
#arnetid4628
#!Ubiquitous computing is viewed as a computing paradigm where minimal user intervention is necessitated emphasizing detection of environmental conditions and user behaviors in order to maximize user experience. Context-awareness plays vital role in achieving such user-centered ubiquity. In this paper1, we describe the desired characteristics of a middleware for context-aware ubiquitous computing. Four key issues are addressed: unified sensing framework, formal modeling and representation of the real world, pluggable reasoning engines for high-level contexts, and response to the real world. Our implementation experience indicates that a comprehensive approach throughout the system layers results in a flexible and reusable middleware framework.

#*Implementation on Event Notification Service over Multimedia Framework.
#@Kyunghee Ji,Nammee Moon,Jaegon Kim
#year2005
#confACIS-ICIS
#citation0
#index4627
#arnetid4629
#!The appetite for consuming content and the accessibility of information continues to increase at a rapid pace. Access devices, with a large set of differing terminal and network capabilities, possess the functionality to be used in different locations and environments: anywhere and anytime. Their users, however, are currently not given tools to deal efficiently with all the intricacies of this new multimedia usage context. Thus, new solutions are required for the access, delivery, management and protection processes of these different content types in an integrated and harmonized way, and they should be implemented in a manner that is entirely transparent to the many different users of multimedia services. In this paper, we design and develop the system for Event Notification Service to support the transparent and augmented use of multimedia resources across a wide range of networks and devices.

#*A Vector-Quantizer Based Method of Speaker Normalization.
#@Ok Keun Shin
#year2005
#confACIS-ICIS
#citation2
#index4628
#arnetid4630
#!As an effort to reduce the performance decline of speaker independent speech recognizers due to inter-speaker variations of vocal tract length among population, a method of speaker normalization based on vector quantization is proposed. In this paper, presented is an iterative method of constructing the ýnormalizedý codebook that can be used as a text independent warp factor estimator for LVCSR system. Given the normalized codebook, the warp factor is estimated by searching the best fitting warped version of feature vectors of a given utterance. Throughout the whole process of normalized codebook construction and warp factor estimation, neither acoustic, nor phonetic knowledge is made use of. The effectiveness of the proposed method is investigated by performing recognition experiments. The results showed more than 4% improvements in word level accuracy.

#*Security Service Framework for Home Network.
#@Zhefan Jiang,Sangok Kim,Kanghee Lee,Hyunchul Bae,Sangwook Kim
#year2005
#confACIS-ICIS
#citation5
#index4629
#arnetid4631
#!Home networking is the collection of elements that process, manage, transport, and store information, enabling the connection and integration of multiple computing, control, monitoring, and communication devices in the home. Home computers and communication devices connected to the Internet are exposed to attacks and need to be secured. In order to protect home network from attacks, we proposed a security service framework in home gateway. Security service framework for Home Network implemented security services to protect home network. This framework implements secure channel between home network and Internet and traffic state-based firewall to protect home gateway from Denial of Service attacks. Also it has ability for intrusion detection and control access various wireless devices in home network. This paper presents an integrated security service framework to protect home network from the inside and outside attacks.

#*A Development of the Mobile Computing System for Repair and Patrol of Electric Power Facilities.
#@Jin-Ho Shin,Bong-Jae Yi,Jae-Ju Song,Ju-Young Kang,Jung-Il Lee,Seon-Ku Cho
#year2005
#confACIS-ICIS
#citation3
#index4630
#arnetid4632
#!As the wireless communicationon networks are distributed in the wide areas and the use of portable terminals is getting popular, the mobile computing technologies are being developed rapidly. Moreover, in most electricity power corporations, the GIS (Geographic Information System) database system had been established so as to connect repair works with topological information. Unfortunately, it is not connected with distribution mobile repair works based on mobile computing. In this study, we have developed the system which can track the location of repair vehicles moving at all times so as to dispatch the vehicles to the failed place quickly . And this system had realized modernization of mobile repair works. The information about power failure receipt and the system constitution, information about relevant facility could be utilized outdoor.

#*Integration Service for Biological Information Resources Using Agent Service to Web Service Gateway.
#@Hoon Jin,In-Cheol Kim
#year2005
#confACIS-ICIS
#citation0
#index4631
#arnetid4633
#!In the views about the aspect of existence of biological information resources, they have a client-server architecture based on simple HTTP protocol developed until now to support convenience of the use for researchers. But when taking consideration of the specificities of the research, it needs to be accessed further various types of information and to be automated. And the way of the legacy web based connection is also needed. Because of above listed, we have implemented a multi-agent system for supporting distribution, autonomy, coordination, reusability to PDB database which maintains protein structure information. Also applying web service technique to it, which is a recently come and already used in industry, we have made the processing of SOAP typed request and response message possible from web clients through the agent service-to-web service gateway. By combining two distinct featured techniques, it is possible to development of application systems about the higher leveled web resources and specially, to increase of the usefulness and the help to integrate biological information resources efficiently.

#*Intelligent Access Control Mechanism for Ubiquitous Applications.
#@Tae-Hum Lim,Sang-Uk Shin
#year2007
#confACIS-ICIS
#citation4
#index4632
#arnetid4634

#*A Reflective Case Study of Software Process Improvement for a Small-Scale Project.
#@Jung-Hee Jo,Ho-Jin Choi
#year2005
#confACIS-ICIS
#citation3
#index4633
#arnetid4635
#!Software processes need to undergo reflection and improvement continuously in order to increase their ability to deal with the requirements and expectations of the stakeholders. An efficient process needs to be tailored and adapted for specific organization, project environment and context. This paper aims to demonstrate an approach for reflection and improvement of software process designed for a small-scale project. This paper reviews four software processes ¿ namely, requirements management, risk management, decision making, and review processes ¿ used in the project against software process standards, and suggests improvements by taking the surrounding environments into account. This paper examines each of the four software processes according to a rating guideline suggested in this paper, compares the activities of software process with desired activity, then suggests improvements to increase effectiveness of the software processes for a small-scale project.

#*Video Event Understanding through Building Knowledge Domain.
#@Dan Song,Haitao Liu,Miyoung Cho,PanKoo Kim
#year2005
#confACIS-ICIS
#citation0
#index4634
#arnetid4636
#!A novel method for video event analysis and description based on the knowledge domain has been put forward in this paper. Semantic concepts in the context of the video event are described in one specific domain enriched with qualitative attributes of the semantic objects, multimedia processing approaches and domain independent factors: low level features (pixel color, motion vectors and spatio-temporal relationship). In this work, we consider one shot (episode) in the Billiard Game of video as the specific domain to explain the process of video event detection In addition, our another main contribution is exploiting the video object ontology to map the MPEG-7ýs high-level descriptors to low level features descriptors which have been defined in the MPEGýs logical structure.

#*Access Control Model for Secure XML Documents.
#@Sun-Moon Jo,Young-Kook Kim,Hoon-Joon Kouh,Weon-Hee Yoo
#year2005
#confACIS-ICIS
#citation2
#index4635
#arnetid4637
#!XML (eXtensible Markup Language) is becoming the most relevant standardization effort in the area of document representation through markup languages. The existing access control has problems that an access control technique becomes complicated for each operation as a new operation is added. In this paper, we present an action type of access control model. We also propose use a tree labeling algorithm for transformation processor of XML documents. What is therefore expected is higher efficiency than that of the existing assess control by managing users.

#*Business Process Improvement Using ebXML.
#@Yeong-Tae Song,Sribara Narasimhadevara,Yanggon Kim
#year2005
#confACIS-ICIS
#citation2
#index4636
#arnetid4638
#!EbXML is an end-to-end B2B XML framework that provides concrete specifications for dynamic B2B collaborations. EbXML has established itself as a global standard for electronic business enabling anyone, especially small and medium-size enterprises, anywhere to do business with anyone else over the Internet. It is complementary to other existing B2B initiatives; those from both business sphere (RosettaNet, TradeXchange, etc.) and from software developer community (e.g. UDDI, SOAP). Strength of ebXML lies in the fact that it arose from the direct involvement of various user groups working to solve a specific problem rather than from technology companies trying to solve a general problem and making a best guess at some standards on behalf of users.

#*Design and Implementation of QoS Measurement and Network Diagnosing Framework for IP Multicast in Advanced Collaborative Environment.
#@Jinyong Jo,Woojin Seok,JaiSeung Kwak,Okhwan Byeon
#year2005
#confACIS-ICIS
#citation2
#index4637
#arnetid4639
#!The Access Grid for collaborative environment exploits IP multicast. Although the IP multicast is quite a promising technology, it faces lots of challenges such as unreliable data transport and instable network infrastructure. As a first step to achieve reliability and stability in IP multicast, it is essential to monitor and debug multicast networks. In this paper we introduce MMag, a user-oriented multicast monitoring tool for the Access Grid. The MMag provides both application and network level monitoring facilities to assess delivery statistics and to diagnose multicast problems. The implementation has been tested and will support Access Grid operators with a simple yet extensive view of multicast performance.

#*Natural Image Compression Based on Modified SPIHT.
#@Jae-Ju Song,Bong-Jae Yi,Jin-Ho Shin,Ju-Young Kang,Jung-Il Lee,Seon-Ku Cho
#year2005
#confACIS-ICIS
#citation-1
#index4638
#arnetid4640
#!Due to the bandwidth and storage limitations, image must be compressed before transmission. The set partitioning in hierarchical trees (SPIHT) algorithm is an efficient method for lossy and lossless coding of image. This paper presents some modifications on the set partitioning in hierarchical trees (SPIHT) algorithm. It is based on the idea of insignificant correlation of wavelet coefficient among the medium and high frequency subbands respectively.In this scheme, insignificantwavelet coefficients that correspond to the same spatial location in the medium subbands can be used to reduce the redundancy by a combined function that modifed SPIHT proposes. In the high frequency subbands, the modified SPIHT proposes dictator to reduce the interband redundancy. Experimental results show that the proposed technique improves the quality of the reconstructed image in both PSNR and perceptual results when compare to JPEG2000 at the same bit rate.

#*An Efficient Connectivity Compression for Triangular Meshes.
#@Bin Shyan Jong,Wen Hao Yang,Juin-Ling Tseng,Tsong Wuu Lin
#year2005
#confACIS-ICIS
#citation10
#index4639
#arnetid4641
#!Edgebreaker and valence-driven approaches use split operations to separate the 3D model into two components. These algorithms raise some bottlenecks for spending increased overheads to record the displacement, or an extra operator is needed for identifying the branch. This study applies an edge-based compression strategy, and proposes using the J operator to skip to the next edge of the active boundary. By using Q operator, two triangles are encoded to improve compression ratio. Additionally, the method requires neither splitting model topology nor multiple passes to achieve a good compression rate. To increase the compression ratio, the adaptive arithmetic coder was applied to compress the CQRLJ string. The experimental results demonstrate that an excellent compression ratio can be obtained, the average compression ratio with the proposed model is better than that with the valence-driven and Edgebreaker methods. The entropy/compression ratio relation curve of the variance-driven method has strong vibration, and the proposed algorithm exhibits coherent tendency. The proposed algorithm has a fixed number and value distribution of operators, and thus only considers the context between operators in achieving the best compression ratio.

#*A Development of the Automatic Digitizing System for Power Distribution Facility Images.
#@Jae-Ju Song,Bong-Jae Yi,Jin-Ho Shin,Ju-Young Kang,Jung-Il Lee,Seon-Ku Cho
#year2005
#confACIS-ICIS
#citation0
#index4640
#arnetid4642
#!In this paper, we propose a recognition technique of electric poles and wires which are drawn on a power distribution facility map. The map represents power supply facilities from substation to consumer. Proposed technique is based on circularity and connectivity, and consists of four phases. At first, we extract a power distribution facility area from input image using threshold value obtained by histogram analysis. Secondly, a thinned image is obtained by applying a thinning operator. At the third step, we extract candidate poles based on circularity which is measured in the search area around the branch points of thinned image. Finally, after electric wires between two branch points is recognized based on connectivity, candidate poles with at least a wire are confirmed to electric poles. The experimental study is performed on randomly sampled 30 power distribution facility map.

#*Acquiring Dominant Compound Terms to Build Korean Domain Knowledge Bases.
#@Hanmin Jung,HeeKwan Koo,Byeong-Hee Lee,Won-Kyung Sung
#year2005
#confACIS-ICIS
#citation1
#index4641
#arnetid4643
#!Compound terms should be well ranked to reduce laborious work for building domain knowledge bases such as term dictionary and thesaurus. Especially, dominant terms in recent years are valuable in the aspects of coverage and reference. We adopt linguistic filtering using a part-of-speech filter and four combination rules to extract Korean compound terms. Domain seed terms are used to obtain their related terms from the above extracted term list. Term ranking, which considers the dominance trend of terms from several year data, assigns term dominance values to the related terms. Experimental results show that our ranking scheme adequately distributes extracted terms than term frequency ordering to reduce the effort of building domain knowledge bases in the manner of term clustering in three groups; growing, declining, and steady.

#*HW/SW Codesigned Implementation of IEEE 802.16 TDMA MAC for the Subscriber Station.
#@Nak Woon Sung
#year2005
#confACIS-ICIS
#citation4
#index4642
#arnetid4644
#!The design for the TDMA MAC of the SS based on IEEE 802.16 have to meet the timing constraints for the uplink transmission, whereas for the non time-critical downlink, constraints such as implementation complexity and memory consumption have to be considered. One way to satisfy these requests is to using hardware/software codesign scheme. In this paper, we analyze the timing constraint in the SS side and determine what part should be implemented in HW. Also we present the HW/SW codesigned TDMA MAC of the SS based on the embedded system and show how we validate and implement it.

#*Context Awareness in Large Scale Ubiquitous Environments with a Service Oriented Distributed Middleware Approach.
#@Saad Liaquat Kiani,Maria Riaz,Sungyoung Lee,Young-Koo Lee
#year2005
#confACIS-ICIS
#citation7
#index4643
#arnetid4645
#!Various components of context aware middleware infrastructure work collectively to enable physical spaces to be transformed into computationally active and intelligent environments by providing context synthesis and provision services. In this paper, we discuss the requirement of physically separating the components of a context aware middleware in a distributed environment and present the design and implementation of Context Aware Middleware for Ubiquitous Systems (CAMUS)¹. Issues related to distributed coordination within the middleware in terms of component discovery and management and multiple context domains are also discussed in order to elaborate service oriented approach for providing context awareness in large scale ubiquitous environments.

#*An Effective Multicast Communication Based on Locality in Mobile IPv6 Networks.
#@Sulyun Sung,Soonho Chu,Yongtae Shin
#year2005
#confACIS-ICIS
#citation0
#index4644
#arnetid4646
#!This paper presents an efficient multicast method based on a locality in mobile IPv6 networks. We exploit the repetitive movemnent pattern of mobile node to reduce number of experience of graft and join procedure. We defined the locality scope by a movement pattern. While the network is included in the locality scope, the network should maintain a multicast tree even when the mobile node moves to the other network. In this way, the mobile host can receive a multicast service without a delay when it moves to the network in the locaility scope later. We compare our scheme with existing schemes under the total signaling cost and the service delay time by using a discrete analytical model for cost analysis. Analytical results demonstrated that the total signaling cost and service delay time was significantly reduced through our proposed scheme.

#*Performance Estimations of Clustered Workflow Architectures.
#@Kwang-Hoon Kim,Hyung-Jin Ahn,Chang-Min Kim
#year2005
#confACIS-ICIS
#citation1
#index4645
#arnetid4647
#!In this paper¹, we are particularly concerned about issues of performance to see how well workflow enactment architecture is dealing with the large amount of workcases. Almost all of the traditional workflow management systems are based upon the client-server workflow enactment architecture that reveals a certain degree of limitation on the issues, such as performance and scalability. This paper presents a performance analysis model and its mathematical estimations for analyzing the performance aspect of the clustered workflow enactment architecture. We are expecting that the estimations should be helpful in the understanding of the spectrum of possibilities for large-scale workflow architectures and systems. In especially order to comparatively study the clustered workflow enactment architecture, we also analyze the performance of the client-server workflow architectures by using the same approach. Finally, we give a comparison result of performance estimations, and strongly believe that the result is going to be very useful understanding about designing and implementing workflow management systems aiming at the very large-scale workflow applications.

#*MAMIP - Interoperation Mechanism of Ad Hoc Network and IP Network.
#@Sulyun Sung,Yuhwa Seo,Soonho Chu,Yongtae Shin
#year2005
#confACIS-ICIS
#citation0
#index4646
#arnetid4648
#!This paper has developed a new MAMIP to provide an efficient interoperation mechanism of mobile ad hoc network and mobile IP network. We propose a new clustering mechanism based on the FA. Since the new clustering mechanism uses a periodic agent advertisement message, it can handle a dynamic network topology efficiently. The FA manages mobile nodes in a unit of cluster and provides an access to the internet and the mobility services of Mobile IP to them. For this, we modified existing messages of mobile IP such as an agent advertisement message, registration request message. We can reduce a message overhead in ad hoc network since we use messages of mobile IP to find a path to the destination. Also, because the FA manages a cluster of limited scope, we can reduce a service delay and overhead of FA regardless of the number of visiting nodes significantly. By the simulation, we compared the proposed scheme with an existing scheme under the average service delay and FA overhead. Simulation results demonstrated that our scheme, MAMIP shows the better performance than the existing scheme, MIPMANET.

#*An Evaluation of Process Performance for a Small-Team Project - A Case Study.
#@So-Young Kim,Ho-Jin Choi
#year2005
#confACIS-ICIS
#citation3
#index4647
#arnetid4649
#!Rational Unified Process (RUP) provides a component-based development process which is use-case driven, architecture-centric, and iterative and incremental. This paper describes our experience of RUP application to the development of a web-based project management system, which had been peformed by a five-member team for one year. The paper introduces how we applied RUP in the development of the system and the difficulties we experienced over the course of the project. We tailored RUP by characterizing it in terms of six best practices and assigning a different priority to each of these. That is, the practice with the highest priority was primarily applied to the project. The paper then evaluates the performance levels of the performed project with respect to the tailored RUP in quantitative ways. The paper gives detailed analysis of the evaluation data to provide guidance for many small-team projects which adopt RUP.

#*LQ-Routing Protocol for Mobile Ad-Hoc Networks.
#@Tang Tao,Shigeaki Tagashira,Satoshi Fujita
#year2005
#confACIS-ICIS
#citation6
#index4648
#arnetid4650
#!In this paper, we propose a new routing protocol for mobile ad-hoc networks (MANET), which have attracted considerable attentions in recent years as a tool to realize flexible and robust communication environments in many critical application fields. The proposed protocol, called LQ-routing, is a proactive routing protocol based on the Q-routing protocol which was originally proposed for conventional wired networks. In order to reflect the mobility of hosts to the routing decision, which would cause frequent connection and disconnection of communication links between nearby hosts, we introduce the notion of lifetime to represent the stability of routes connecting to the destination. The performance of the proposed routing scheme is experimentally evaluated by using NS-2. The result of simulation indicates that by introducing the notion of lifetime to a simple combination of previous proactive routing scheme DSDV and the Q-routing, we could improve the performance of DSDV in terms of the packet loss rate and the average packet delay.

#*Performance Analysis on Mobility of Ad-Hoc Network for Inter-Vehicle Communication.
#@Jaehyun Kim,Woojin Han,Woohyuk Choi,Yunil Hwang,Taehwan Kim,Joowook Jang,Jaeyong Um,JunChae Lim
#year2005
#confACIS-ICIS
#citation7
#index4649
#arnetid4651
#!This paper presents the feasibility of using an ad-hoc network as an infrastructure for a small group of inter-vehicle communication network. Mobile ad-hoc networking with wireless LAN infrastructure can be employed to build inter-vehicle communication based network. The irregular driving environment pose a challenge to the performance of a wireless LAN. We have measured transmission characteristics for sending and receiving high data volumes using TCP and UDP in vehicles moving on IEEE 802.11b. Our framework aims to evaluate the effect of our proposed mobility models on the performance of Dynamic Source Routing (DSR) based on measured data. Proposed mobility models are varied by conducting the experiments under different driving environment, driving conditions, and vehicular patterns. Our result shows that the routing protocol mechanism, such as route discovery and route maintenance, does not interrupt the data transmission seriously.

#*Modeling Uncertainty in Context-Aware Computing.
#@Binh An Truong,Young-Koo Lee,Sungyoung Lee
#year2005
#confACIS-ICIS
#citation15
#index4650
#arnetid4652
#!Uncertainty always exists as an unavoidable factor in any pervasive context-aware applications. This is mostly caused by the imperfectness and incompleteness of data. In this paper, we propose a novel approach to model the uncertain context. Our context model is a combination of two modeling methods: probabilistic models for capturing the uncertain information and ontology for facilitating knowledge reuse and sharing. Such combination of probabilistic models and ontology facilitates the sharing and reuse over similar domains of not only the logical knowledge but also the uncertain knowledge. Besides, we also support the uncertain reasoning in context-aware applications in a flexible and adaptive manner.

#*Use of SCTP for IP Handover Support.
#@Dong Phil Kim,Jong-Shik Ha,Sang-Tae Kim,Seok Joo Koh
#year2005
#confACIS-ICIS
#citation5
#index4651
#arnetid4653
#!This paper describes the experimental analysis of SCTP handover for the dual-homing and single-homing mobile terminals based on Linux platform. From the experiments, it is shown that the SCTP handover latency of the dual-homing mobile terminal only depends on the Round Trip Time between two SCTP endpoints, possibly with a negligible latency time. On the other hand delay of the underlying link and network layer.

#*Wavelet Transform Based Digital Watermarking for Image Authentication.
#@Min-Jen Tsai,Hsiao-Ying Hung
#year2005
#confACIS-ICIS
#citation6
#index4652
#arnetid4654
#!The rapid expansion of the Internet and the recent advance of digital technologies have sharply increased the availability of digital media. This paper is to investigate a wavelet based semi-fragile watermarking technique for image authentication. Image protection is achieved by the insertion of a secret wavelet tree based binary image signature (WTS) after wavelet decomposition followed by the quantization procedure. In addition, adaptive tuning steps are performed for the selected watermarked coefficients in order to increase the elasticity of watermark. During the verification, the original unmarked image is not needed for comparison. The detection of unauthorized tampering within the image is claimed by comparison with the possibly modified imageýs WTS and the authentic one.

#*Design of Translator for Stack-Based Codes from 3-Address Codes in CTOC.
#@Young-Kook Kim,Sun-Moon Jo,Weon-Hee Yoo
#year2005
#confACIS-ICIS
#citation1
#index4653
#arnetid4655
#!We Present CTOC, a framework for optimizing Java bytecode. The framework supports two intermediate representations for representing Java bytecode: CTOC-B, a streamlined representation of bytecode which is simple to manipulate; CTOC-T, a typed 3- adress intermediate representation suitable for optimization. We translate CTOC-T back to CTOC-B that translate a needless code. A needless code is redundant store/load statement and partial redundancy. We Study the technique necessary to effectively translate CTOC-T back to CTOC-B without losing performance. This paper eliminate needless code.

#*AuToCrawler: An Integrated System for Automatic Topical Crawler.
#@Jyh-Jong Tsay,Chen-Yang Shih,Bo-Liang Wu
#year2005
#confACIS-ICIS
#citation9
#index4654
#arnetid4656
#!A topical (or focused) crawler is a web crawler aiming to search and retrieve web pages from the World Wide Web, which are related to a specific topic. Rather than downloading all accessible Web pages, a topical crawler analyzes the frontier of the crawled region to visit only the portion of the web that contains relevant web pages, and at the same time, try to skip irrelevant regions. This leads to significant savings in both computation and communication resources. In this paper,we present an integrated topical crawler:AuToCrawler. The main features of AuToCrawler consist of a user interest specification module that mediates between users and search engines to identify target examples and keywords that together specify the topic of their interest, and a URL ordering strategy that combines features of several previous approaches and achieves significant improvement. It also provides a graphic user interface such that users can evaluate and visualize the crawling results that can be used as feedback to reconfigure the crawler.

#*Kernel Based Intrusion Detection System.
#@Byung-Joo Kim,Il Kon Kim
#year2005
#confACIS-ICIS
#citation13
#index4655
#arnetid4657
#!Recently applying artificial intelligence, machine learning and data mining techniques to intrusion detection system are increasing. But most of researches are focused on improving the performance of classifier. Selecting important features from input data lead to a simplification of the problem, faster and more accurate detection rates. Thus selecting important features is an important issue in intrusion detection. Another issue in intrusion detection is that most of the intrusion detection systems are performed by off-line and it is not proper method for realtime intrusion detection system. In this paper, we develop the realtime intrusion detection system which combining on-line feature extraction method with Least Squares Support Vector Machine classifier. Applying proposed system to KDD CUP 99 data, experimental results show that it have remarkable performance compared to off-line intrusion detection system.

#*Performance Analysis of Audio Streaming in Secure Wireless Access Network.
#@Binod Vaidya,Jongwoo Kim,Jae-Young Pyun,Jong-An Park,Seung Jo Han
#year2005
#confACIS-ICIS
#citation1
#index4656
#arnetid4658
#!Advances in the Internet and multimedia technologies have spurred many research efforts in Internet-based multimedia access system.. In this paper, we presented such a model and framework for delivering real-time traffics to a wireless access network over public Internet Protocol (IP) backbone network. We have presented a performance analysis of audio streaming when IP tunneling network using Generic Route Encapsulation (GRE) along with Internet Protocol Security (IPSec) is implemented. The impacts on performance, with particular attention to Quality of Service (QoS) characteristics have been evaluated through a series of experiments. In this paper, the effects of a compression scheme based on compressed real-time transport protocol (CRTP) and Resource Reservation protocol (RSVP) are analyzed when delivering real-time traffics to the wireless access network through secured IP Network.

#*RGSN Model for Database Integration.
#@Jeong-Mi Kim,JuHum Kwon,Doo-Kwon Baik
#year2005
#confACIS-ICIS
#citation2
#index4657
#arnetid4659
#!Considering information integration, we have a careful look at many types of collisions based on heterogeneities. We propose a Relational Global Semantic Network (RGSN) to solve this problem. This is based on the WordNet which defines the relationships among words. The main structure of RGSN is to derive connections among entities in each schema and finally provide a foundation to solve the heterogeneity. We suggest an implementation of SELECT query that can be used in the environment of the integrated heterogeneous databases. It helps users derive data correctly without considering the various schema structures of many local databases. That is prerequisite for the utilization of integrated databases and would be the main contribution of this paper.

#*Knowledge-Based Compliance Management Systems - Methodology and Implementation.
#@Murlikrishna Viswanathan,Young-Gyu Yang,Taeg Keun Whangbo,Nak-Bin Kim,B. Garner
#year2005
#confACIS-ICIS
#citation-1
#index4658
#arnetid4660
#!In recent times a challenging problem for organisations worldwide has been the management of the growing number of rules, procedures, policies, and reporting requirements governing their businesses, operations, and industry. This paper considers the task of building automated knowledge-based compliance management systems. In this paper we aim to highlight the common weaknesses found in compliance methodologies in practice. The requirements of a good research methodology for compliance are discussed. Finally the paper presents the development of a research methodology for compliance and its validation through a progressive case study in International Transfer Pricing.

#*Design and Implementation of Policy Decision Point in Policy-Based Network.
#@Geonlyang Kim,Jinoh Kim,Jungchan Na
#year2005
#confACIS-ICIS
#citation7
#index4659
#arnetid4661
#!As users of network have become increasing, the supply of network-based services has activated and the necessity of a solution considering scale and speed of network for providing network-based services efficiently for users has been generated. A great deal of attention has been given recently to the concepts of the PBNM(Policy-Based Network Management) to accomplish these needs. This paper describes design and implementation of PDP(Policy Decision Point) in a policy-based network management system. The PDP provides role-based policy decision and distribution mechanisms. The role-based policy decision and distribution mechanisms allow an administrator manage and transmit policies by roles of devices without configuring each one of network devices manually. So, it provides the administrator with the convenience.

#*Proactive Health Care Underpinned by Embedded and Mobile Technologies.
#@Hwang-Cheng Wang,Jia-Chi Lin,Shiang-Ren Yang,Ping Chang,Jun-Yan Chen,Yu-Ren Guo
#year2005
#confACIS-ICIS
#citation1
#index4660
#arnetid4662
#!This paper describes the use of embedded information and mobile communication technologies to tackle one impending global concern, namely, the aging and health care problem. As the population ages, chronic diseases also become rampant, leading to mounting medical socio-economical burdens. Moreover, old people and patients are often confined to a relatively small space, so that their whereabouts can be tracked. The situation can be rectified with the ingenious combination of embedded information devices and mobile communication capability. We have implemented a system that embodies these technologies. It can take vital physiological data of a user and communicate the data together with location information to a backend server for processing and may trigger necessary actions. The process can take place anywhere, any time, and give great freedom to system users. We describe the system architecture, address practical implementation issues, and present some performance results.

#*On Employing Ontology to e-Learning.
#@Tai-Jong Kim,Min-Cheol Kim,Gyung-Leen Park
#year2005
#confACIS-ICIS
#citation5
#index4661
#arnetid4663
#!In order to provide personalized services with intelligence, the exact understanding of usersý contexts is necessary. While different kinds of agents communicate with each other through the network and share the information, an expressive language is required for this communication between agents. The semantic web and the ontology may be used to enable the effective communication between different agents. This paper proposes the architecture to provide the intelligent student support system. The paper also shows how ontological technology can be integrated, in an interoperable manner, with the e-learning, which is recently emerging as a new paradigm in the field of information technology.

#*Multibiometrics Based on Palmprint and Handgeometry.
#@Xiao-Yong Wei,Dan Xu,Chong-Wah Ngo
#year2005
#confACIS-ICIS
#citation5
#index4662
#arnetid4664
#!This paper described our approach of multibiometrics in a single image. Firstly, a new method for capturing the key points of hand geometry is proposed. Then, we described our new method of palmprint feature extracting. By using projection transform and wavelet transform, this method considered both the global feature and local detail of a palmprint texture and proposed a new kind of palmprint feature. We also proposed a twice segmentation method for handgeometry feature extraction. In the processing of feature matching, we analyzed the weakness of the traditional Euclidian Square Norm method, and introduced an improved method. The experimental results demonstrated the effectiveness and accuracy of these proposed method.

#*A Study on Secure Group Transmission in Group Environment.
#@Baehyun Kim,Hoon Ko,Intae Ryoo
#year2005
#confACIS-ICIS
#citation0
#index4663
#arnetid4665
#!While much important information is sent and received on Internet, the information is exposed in many threats. As the Multicast service is various and generalized, the service range is widened. When a new member joins in or leaves from a Multicast group, the group key that the existing member use, should newly update. The existing method has a problem that the performance is depreciated due to the key exchange. This paper propose the effective group management mechanism for secure transmission of Multicast data on Multicast group that frequently joins in and leaves from a group.

#*Message from the Conference Chairs.
#@
#year2005
#confACIS-ICIS
#citation0
#index4664
#arnetid4666

#*Cross-layer Resource Control to Improve TCP Performance over Wireless Network.
#@Ming Li
#year2007
#confACIS-ICIS
#citation2
#index4665
#arnetid4667

#*An Effective Real Time Update Rule for Improving Performances both the Classification and Regression Problems in Kernel Methods.
#@Eun-Mi Kim,Bae-Ho Lee
#year2005
#confACIS-ICIS
#citation0
#index4666
#arnetid4668
#!It is general solution to get an answer from both classification and regression problem that information in real world matches matrices. This paper treats primary space as a real world, and dual space that primary spaces transfers to newmatrices using kernel. In practical study, there are two kinds of problems, complete system which can get an answer using inverse matrix and ill-posed system or singular system which cannot get an answer directly from inverse of the given matrix. Furthermore, the problems are often given by the latter condition; therefore, it is necessary to find regularization parameter to change ill-posed or singular problems into complete system. This paper compares each performance under both classification and regression problems among GCV, L-Curve, and kernel methods. This paper also suggests dynamic momentum which is learning under the limited proportional condition between learning epoch and the performance of given problems to increase performance and precision for regularization. Finally, this paper shows the results that suggested solution can get better or equivalent results compared with GCV, and L-Curve through the experiments using Iris data which are used to consider s tandard data in classification, Gaussian data which are typical data for singular system, and Shaw data which is an one-dimension image restoration problem.

#*Message from the Program Chairs.
#@
#year2005
#confACIS-ICIS
#citation0
#index4667
#arnetid4669

#*Collaborative File Editor Using Repository in a Box.
#@Gongzhu Hu,Ivan Milenkovic
#year2007
#confACIS-ICIS
#citation0
#index4668
#arnetid4670

#*Design and Implementation of Forced Unmount.
#@Dong-Wook Kim,Eun-Ji Lim,Gyu-Il Cha,Sung-In Jung
#year2005
#confACIS-ICIS
#citation0
#index4669
#arnetid4671
#!This paper describes a kernel function named FU(forced unmount) related to file system on linux system. FU is a function to forcibly unmount file systems in despite of busy state of file systems. The current implementation was developed on linux-2.6.8 and tested by tools, POSTMAR and LTP. this contains considerations of FU and a algorithm to solve problems during developing FU.

#*Realizing the Open-Closed Principle.
#@Chong-wei Xu,Jose Hughes
#year2005
#confACIS-ICIS
#citation0
#index4670
#arnetid4672
#!The first principle in developing large software systems is the Open-Closed Principle (OCP). This principle seems asking for two conflict goals. How to realize the principle in the real software practice? What are the enabling technologies that can be used to implement the principle? This paper uses a case study to demonstrate the importance of the principle, the design methodology for realizing the principle, and its enabling technologies.

#*An Integrated Technique for Video Watermarking.
#@Chien-Chuan Ko,Bo-Zhi Yang
#year2007
#confACIS-ICIS
#citation2
#index4671
#arnetid4673

#*Service Discovery Using FIPA-Compliant AP to Support Scalability in Ubiquitous Environments.
#@Hyung-Jun Kim,Kyu Min Lee,Kee-Hyun Choi,Dong Ryeol Shin
#year2005
#confACIS-ICIS
#citation3
#index4672
#arnetid4674
#!Traditional service discovery mechanisms propose efficient and fast searching schemes for service discovery. And their schemes do not consider interoperability among discovery protocols. In this paper, we design an agent platform (AP) modifying FIPA-OS (Foundation for Intelligent Physical Agents Open Source) based on FIPA specifications. FIPA (Foundation for Intelligent Physical Agents) is a non-profit organization aimed at producing standards for the interoperation of heterogeneous software agents. Until now FIPA specifications have not been considering mobile ad hoc networks. In such environments, agents canýt find services offered by other service discovery engines in heterogeneous networks. We can guarantee scalability, by adding DM (Discovery Middleware) modules in the AP. The DM helps agents find and use services exploiting existing service discoveries under ad hoc networks. We chose UPnP (Universal Plug and Play) and LSD (Lightweight Service Discovery Protocol) as DMs among various service discovery technologies. UPnP is a set of protocols for service discovery under development by the UPnP Forum and LSD is a new discovery protocol for mobile ad hoc networks emphasizing on cache management that we designed. On our AP, we can use the services which devices of UPnP and LSD provide.

#*Extending OBDD Graphs for Composite Event Matching in Content-Based Pub/Sub Systems.
#@Gang Xu,Wei Xu,Tao Huang
#year2005
#confACIS-ICIS
#citation-1
#index4673
#arnetid4675
#!Content-based publish/subscribe offers a convenient abstraction for the information producers and consumers, supporting a large-scale system design and evolution by integrating several distributed independent application systems. Its core problem is how to match events by predicates on the content of events. In this paper, we propose three matching models, extend the simple matching to the multi-semantic matching and introduce the temporal constraint variable. The multi-semantic matching allows using different operations in accordance with different semantics; the temporal constraint variable supports processing the discrete events in the temporal sequence. Then, we extend OBDD graphs into hierarchy coloured OBDD graphs and prove the equivalence of the transformation. At last, based on OBDD graphs the composite matching algorithm is presented and analysed. By experiments, we show the proposed algorithm is efficient.

#*Streaming Player Support Protocol Adaptation and Independent Operating System.
#@Sangok Kim,Kanghee Lee,Zhefan Jiang,Hyunchul Bae,Sangwook Kim
#year2005
#confACIS-ICIS
#citation0
#index4674
#arnetid4676
#!This paper examines technique of media access that flexible media service, provided user interaction, and guaranteeing QoS. Currently, there are various streaming services, but the service environment is limited from specific operating system, each protocol. The media player on the real-time protocol have some problems that media access techniques depend on each network protocol, and the enable commands to control media are different from protocol environments. We propose media player that is able to streaming service using by adaptation on the various protocol and independent operating system. Therefore, we analysis streaming protocol for real-time media service and implement control mechanism of player for protocol.

#*Comparison of Shape-Based and Stroke-Based Methods for Segmenting Handwritten Chinese Characters.
#@Jian Yang,Han Zhang,Mark Dencler,Chao Lu
#year2005
#confACIS-ICIS
#citation0
#index4675
#arnetid4677
#!The segmentation of handwritten Chinese text into Chinese characters is an important preprocessing step to the offline Chinese character recognition. It is also a very difficult task due to so many Chinese characters and their handwritten structures can be very complex. Many researchers have developed various algorithms during the past decade [1-6]. In this paper, we compare two of the existing algorithms. The first one is spatial shape-based algorithm proposed in [5], which segments the character strings into radicals, not dealing with stroke identification. The second algorithm is stroke-based[2-4], which traces each stroke and draws the stroke-bounding box, then merges the boxes by a set of rules. Based on the algorithms presented in [2-5], we wrote C++ programs for time complexity, accuracy performance comparisons using different handwritten Chinese character texts. Our experimental result shows that the spatial shape-based algorithm [5] is faster and more accurate.

#*Development of Embedded Software with Component Integration Based on ABCD Architectures.
#@Haeng-Kon Kim,Roger Y. Lee,Hae Sool Yang
#year2005
#confACIS-ICIS
#citation0
#index4676
#arnetid4678
#!The state-of-art approaches to embedded real-time software development are very costly. The high development cost can be reduced significantly by using model-based integration of reusable components. To the ABCD (Architecture, Basic, Common and Domain) architecture, we propose an architecture that supports integration of software components and their behaviors, and reconfiguration of component behavior at executable-code-level. In the architecture, components are designed and used as building blocks for integration, each of which is modeled with event-based external interfaces, a control logic driver, and service protocols. The behavior of each component is specified as a Finite State Machine (FSM), and the integrated behavior is modeled as a Nested Finite State Machine (NFSM). These behavior specifications can be packed into a Control Plan program, and loaded to a runtime system for execution or to a verification tool for analysis. With this architecture, embedded software can be constructed by selecting and then connecting (as needed) components in an asset library, specifying their behaviors and mapping them to an execution platform. Integration of heterogeneous implementations and vendor neutrality are also supported. Our evaluation based on machine tool control software development using this architecture has shown that it can reduce development and maintenance costs significantly, and provide high degrees of reusability.

#*DCT-Based Image Compression Using Wavelet-Based Algorithm with Efficient Deblocking Filter.
#@Wen-Chien Yen,Shen-Chuan Tai
#year2005
#confACIS-ICIS
#citation3
#index4677
#arnetid4679
#!Discrete cosine transform (DCT) is widely used in many practical image/video compression systems because of its compression performance and computational efficiency. This work adopts DCT, and modified the SPIHT algorithm that designed initially for encoding the discrete wavelet transform (DWT) coefficients in order to suit to encode DCT coefficients. The algorithm represents the DCT coefficients to concentrate signal energy and proposes combination and dictator to eliminate the correlation in the same level subband for encoding the DCT-based images. The coding complexity of the proposed algorithm for DCT coefficients is just close to JPEG but the performance is higher than JPEG2000. Furthermore, the proposed algorithm append to deblocking function in low bit rate in order to improve the perceptual quality. Experimental results indicate that the proposed technique improves the quality of the reconstructed image in terms of both PSNR and the perceptual results over JPEG2000 at the same bit rate.

#*Multiuser CDMA Parameters Estimation Using Sigma Point Particle Filter.
#@Jang-Sub Kim,Ho-Jin Shin,Dong Ryeol Shin
#year2005
#confACIS-ICIS
#citation1
#index4678
#arnetid4680
#!In wireless communications, a joint channel coefficient and time-delay tracking technique are a critical issue. Due to the highly nonlinear nature of time delay estimation, Particle filter (PF) and Sigma Point Particle filter (SPPF) can be employed. The SPPF algorithm consists of a particle filter that uses an Sigma Point Kalman filter (SPKF) to generate the importance proposal distribution. The SPKF allows the particle filter to incorporate the latest observations into a prior updating routine. In addition, the SPKF generates proposal distributions that match the true posterior more closely. We propose an SPPF based on algorithm for the estimation of closely-spaced path delays and related channel coefficients in CDMA environments. We show that the parameter estimation using this filter structure is very effective even in the non-orthogonality of spreading codes and under imperfect power control in the CDMA environments. The simulation results show that this filter outperforms the PF including conventional Kalman filters.

#*Visualizing Hierarchical Information Using a New Focus+Context Method.
#@Hee Yong Yoo,Hee Jin Yoo
#year2005
#confACIS-ICIS
#citation-1
#index4679
#arnetid4681
#!This paper reports a new Focus+Context Method for information, which is constructed upon hierarchical structure. The visualization method presented in this paper represents intended to minimize disorientation that a user may have when he or she navigates through node information. This method suggests a structure with which a user can analyze focused node data through adjacent node data when he or she makes a node selection. It is also intended to minimize overlapping and calculation process when a user changes focused node thus causes node data to be restructured. This paper proposes HONG (Hierarchies Of Network and Graph) view system in graphics interface environment, which can search and display hierarchical information through suggested new Focus+Context method.

#*A Process-Driven e-Learning Content Organization Model.
#@Kwang-Hoon Kim,Hyuk-Jae Yoo,Hak-Sung Kim
#year2005
#confACIS-ICIS
#citation9
#index4680
#arnetid4682
#!We have been trying to incorporate a concept ofworkflow (or business process) into a SCORM-based e-Learning management system. As one of the results, we, in this paper¹, propose a new e-Learning content organization scheme that is extendibly adopted into the SCORM² content aggregation model for specifying a learning process in a SCORM-based learning management system. In terms of the representation of the e-Learning activities sequencing and navigation, the current SCORM content aggregation model uses a rule-driven approach that defines the intended sequencing and ordering of learning activities inside of a tree-structured content organization, which means that not only it might be a very restricted and inflexible approach in specifying the learning activitiesý sequencing and ordering, but also there is no way for educators to be involved in, to maintain or even to monitor the learning activities during that a learner is learning or studying by itself through the system. In order to get rid of these restrictions, we would apply a process-driven approach to the SCORM content aggregation model. The approach intents to replace the SCORMýs tree-structured content organization scheme by the concept of a process-driven content organization scheme in realizing the learning activitiesý sequencing and ordering functionality, and we call it a process-driven e-Learning content organization model. In this paper we formally and graphically describe the model and show an example to explain how it works in composing a process-drivene-Learning sharable content objects sequencing and navigation model. Also, we propose a possible system architecture of a process-driven e-Learning management system. We strongly believe that the process-driven e-Learning content organization model inflicts heavily positive effects on the ways of composing a SCORMýs content aggregation model and implementing a SCORM-based e-Learning management system as well.

#*Measuring Personal Information Competency for Organizational Computing.
#@Chui Young Yoon
#year2005
#confACIS-ICIS
#citation1
#index4681
#arnetid4683
#!A Measurement Model for Personal Information Competency was developed to measure individual information competency in an enterprise of the information environment. The model measures the requirements of information technology knowledge, the capability of information application, the potential for individual information capability, and information mindset with four measurement domains extracted from the components of competency. The questionnaire survey for measurement items of the developed model was obtained from people with considerable experience in a variety of industries and management levels. The validity and reliability of the developed model construct was verified by factor analysis and reliability analysis through the application of SPSS software. The developed model can be applied to measure personal information competency efficiently, and it will contribute to developing total measurement alternatives for personal information competency in a company of information environment.

#*Use of Image Processing to Collect the Time Data of NC Machining.
#@Keyhoon Ko,Bo Hyun Kim,Byoung Kyu Choi
#year2005
#confACIS-ICIS
#citation0
#index4682
#arnetid4684
#!To control the production schedule for mold making, it is important to collect the actual results of machining operations, yet machine operators seldom record the results. Some die and mold shops have constructed a system which interfaces with NC controllers and which identifies the status of the machining operation from signals. This method depends totally on the NC controller and requires higher installation cost. We propose a method that is independent of the NC controller. This method uses a low-cost PC camera and image processing technology; and it has one algorithm for tracking moving objects and another for detecting scene changes. To demonstrate the validity of the proposed method, we applied it to both attended and unattended NC machining.

#*Performance Improvement of Cluster System by Server Status Information.
#@Chunkyun Youn
#year2005
#confACIS-ICIS
#citation0
#index4683
#arnetid4685
#!There is physical and logical method for performance improvement of cluster system. Efficient load balancing of cluster system is the best method for the logical method. Recently, WLC (Weighted Least Connection) algorithm is used for load balancing of cluster system. But, the algorithm also has load imbalance between servers because it uses inaccurate load status of servers. In this paper, I suggest a more efficient load balancing algorithm base on various load state of servers by real time. I implement a prototype and test its performance. The test result shows that load imbalance phenomenon is improved greatly and response time is also improved compare with WLC algorithm.

#*Robust Audio Watermarking in Wavelet Domain Using Pseudorandom Sequences.
#@Chin-Su Ko,Ki-Young Kim,Rim-Wo Hwang,YoungSeop Kim,Sang-Bum Rhee
#year2005
#confACIS-ICIS
#citation2
#index4684
#arnetid4686
#!In this paper we proposed digital watermarking algorithms for high quality audio to improve robustness of embedded watermark by adding Spread spectrum. The watermark is embedded in each audio frame by adding a perceptually-shaped pseudo-random sequence. The proposed method realized digital audio watermarking technique that audience cannot perceive as a noise by inserting the watermark with using the Psychoacoustic Model.

#*A Method for Classification of Electricity Demands Using Load Profile Data.
#@In Hyeob Yu,Jin Ki Lee,Jong Min Ko,Sun Ic Kim
#year2005
#confACIS-ICIS
#citation5
#index4685
#arnetid4687
#!The multiple participants of the electricity market need new business strategies for providing value added services to customer. Therefore they need the accurate customer information about the electricity demand. Demand characteristic is the most important one for analyzing customer information. In this study load profile data, which can be collected through the Automatic Meter Reading System, are analyzed for getting demand patterns of customer. The load profile data include electricity demand in 15 minutes interval. An algorithm for clustering similar patterns is developed using the load profile data. As results of classification, representative curves for the same groups are generated. The demand characteristics of the groups are discussed. Also, the compositions of demand contract and industrial classification in each group are presented.

#*Design of HDTS System for Locating Logical Errors in Java Programs.
#@Hoon-Joon Kouh,Sun-Moon Jo,Weon-Hee Yoo
#year2005
#confACIS-ICIS
#citation2
#index4686
#arnetid4688
#!In the previous work, we presented HDTS for debugging logical errors in Java programs. The HDTS is a technique that combines an algorithmic program debugging, a step-wise debugging, and a program slicing. It reduced the number of programmer debugging efficiently in Java programs. This paper designs HDTS system for implementing HDTS technique.

#*Improving Interactive Experience of Thin Client Computing by Reducing Data Spikes.
#@Yang Sun,Teng-Tiow Tay
#year2007
#confACIS-ICIS
#citation-1
#index4687
#arnetid4689

#*Device-Independent Markup Language.
#@Tai-Yeon Ku,Dong-Hwan Park,Kyeong-Deok Moon
#year2005
#confACIS-ICIS
#citation1
#index4688
#arnetid4690
#!Todayýs complex appliances are plagued by difficult-touse and inconsistent user interfaces. This paper propose Device-Independent Markup Language that addresses these problems by transforming UI automatically in real using time. Users will control their appliances using personal devices they already have, such as personal digital assistants (PDAs) or mobile phones. User interfaces are automatically generated so that each appliance interface can be customized for the user and the device on which the interface is displayed. Interfaces generated by the proposed Transformation Engine will take into account interfaces previously generated for the user and create single combined interfaces for multiple connected appliances, like a home theater, that usually have separate interfaces for each appliance. I intend to evaluate the completed system by conducting user studies to show that my automatically generated interfaces are more usable than functionally identical manufacturersý interfaces.

#*Bezier Curve-Based Character Descriptor Considering Shape Information.
#@Ferdous Ahmed Sohel,Gour C. Karmakar,Laurence S. Dooley
#year2007
#confACIS-ICIS
#citation0
#index4689
#arnetid4691

#*Digital Image Filter Design Using Evolvable Hardware.
#@P. Nirmal Kumar,S. Suresh,J. Raja Paul Perinbam
#year2005
#confACIS-ICIS
#citation6
#index4690
#arnetid4692
#!In this paper, a new image processing architecture through complete evolvable hardware has been described that will be able to adapt according to the particular images encountered. This will serve as an alternative to conventional approaches where the structure is irreversibly fixed in the design process. The simulation of such a system through the use of evolutionary algorithm is demonstrated for the conventional image processing operation of image filtering. Bitmap Images of size 128x128, contaminated by Gaussian noise with mean 0 and different level of variance were taken and filtering operation is performed. This evolvable digital image filter was compared with conventional image filters in terms of Mean Difference Per Pixel. The result shows that the evolvable hardware digital image filter outperforms traditional approaches.

#*Real-time Linear Projection Speed Sign Detection System in Low Light Conditions.
#@Tam Phuong Cao,Darrell M. Elton,John Devlin
#year2007
#confACIS-ICIS
#citation0
#index4691
#arnetid4693

#*A Metalevel Component-Based Framework for Distributed Computing Applications.
#@Andy S. Y. Lai,A. J. Beaumont
#year2005
#confACIS-ICIS
#citation2
#index4692
#arnetid4694
#!The advancement of wireless networks and distributed computing necessitates more advanced applications to be built with adaptability to their changing system services. Today, building adaptive services is a complex task due to the lack of an adequate framework support in the distributed computing environments .In this paper, we propose a Metalevel Component-Based Framework (MELC) which uses distributed computing design patterns as components to develop an adaptive pattern-oriented framework for distributed computing applications. We describe our novel approach of combining a meta-architecture with a pattern-oriented framework, resulting in an adaptable framework which provides a mechanism to facilitate system evolution. We show how MELC can be used effectively to enable component integration and to separate system functionality from application functionality and demonstrate how MELC provides an adaptable and dynamic run time environment.

#*A New Cooperative Communication MAC Strategy for Wireless Ad Hoc Networks.
#@Li Yi,Ji Hong
#year2007
#confACIS-ICIS
#citation11
#index4693
#arnetid4695

#*ebXML Test Framework on Dually Coupled Asynchronous MSH.
#@Youngkon Lee
#year2005
#confACIS-ICIS
#citation1
#index4694
#arnetid4696
#!The ebXML Test Framework presented by IIC (Implementation, Interoperability and Conformance Technical Committee) is intended to support conformance and interoperability testing for ebXML specifications. It describes a test framework and its software components, how these can be combined to create a test harness for each type of ebXML testing. While implementing the test framework², we found that it requires its client part (adapters for test target) to be adaptive and operative to any kind of message handler system. For the purpose, we cannot find better way than Web Service approach, based on SOAP and WSDL, for the test framework. By the approach, we coupled tightly a target system to be tested and test framework asynchronously. For detecting deceits in testing processes more easily, we propose a dually coupled messaging framework between a test service and a test driver. In this paper, we introduce the implementation architecture for the test framework and a test procedure on the adopted test actions.

#*Portfolio Management of Option-Based Investment in Technology Research and Development.
#@Jirawute Choungsirakulwit,Daricha Sutivong
#year2007
#confACIS-ICIS
#citation0
#index4695
#arnetid4697

#*Multi-Granularity Locks for XML Repetitive.
#@Eunujung Lee
#year2005
#confACIS-ICIS
#citation0
#index4696
#arnetid4698
#!We proposed a list data sharing model, which utilizes semantics expressed in DTD for concurrency control of shared XML trees. In this model, tree updating actions such as inserting/deleting subtrees are allowed only for the repetitive parts. The proposed model guarantees that the resulting XML tree is valid even when applying tree update actions concurrently. Also, a new multi-granularity locking mechanism called list locking protocol is proposed. This protocol locks on the (index) list of repetitive children nodes, so it allows updates on the descendents when the node's child subtree is being deleted or inserted. This protocol is expected to show better accessibility with less number of locking objects compared to the other locking methods on XML data.

#*Information Technology Project Management Curriculum Practice.
#@Grace W. Rumantir
#year2007
#confACIS-ICIS
#citation0
#index4697
#arnetid4699

#*Development of Quality Evaluation Metrics for BPM (Business Process Management) System.
#@YeongSeok Lee,JungHyun Bae,Seokkoo Shin
#year2005
#confACIS-ICIS
#citation-1
#index4698
#arnetid4700
#!We are to present the specialized quality evaluation metrics by completely understanding the difference between the BPM, software focused on the process management by meeting the requirements for new enterprise environments, and other software products and reflecting the characteristics of process based-software based on the standard software quality evaluation metrics.

#*Robust-Optimal Control of a Nonlinear Two Degree-of-Freedom Helicopter.
#@Gwo-Ruey Yu
#year2007
#confACIS-ICIS
#citation0
#index4699
#arnetid4701

#*Image Watermarking Using Structure Based Wavelet Tree Quantization.
#@Gin-Der Wu,Pang-Hsuan Huang
#year2007
#confACIS-ICIS
#citation6
#index4700
#arnetid4702

#*Experience of Combining Qualitative and Quantitative Analysis Methods for Evaluating Software Architecture.
#@Younbok Lee,Ho-Jin Choi
#year2005
#confACIS-ICIS
#citation7
#index4701
#arnetid4703
#!ATAM helps stakeholders determine where the risks and tradeoffs exist in elicited architectural strategies. But it provides no guidance for understanding economic benefits, thus needs to be complemented by some quantitative approach. CBAM helps software architects consider the return-on-investment of any architectural decision and provides guidance on the economic tradeoffs involved. This paper presents our experience of applying ATAM to a small-scale studio project and analyzes how properly it was adjusted to the project situation, what was done well and what could have done better. This paper also presents a CBAM evaluation for the same studio project that was conducted on the output of the ATAM process. The objective of this evaluation is to justify our decision for .Net over J2EE for the architectural framework for the target software system. Though the evaluation have been performed with several restrictions and assumptions, the experience shows that application of economics technique can effectively complement the ad-hoc qualitative approach such as ATAM by providing disciplined process to frame and structure the qualitative output produced by ATAM.

#*Implementation of Prefix Delegation Mechanism Using DHCPv6 Protocol.
#@JooChul Lee,Hyoung-Jun Kim
#year2005
#confACIS-ICIS
#citation1
#index4702
#arnetid4704
#!IPv6 enables simple, automatic host configuration [1]. Conversely, it does not provide any specification to automatically delegate a prefix to a router; to solve this problem several requirements were described [2] and a solution using DHCPv6 protocol for those requirements was standardized [3]. DHCPv6 protocol let DHCPv6 servers pass network configuration parameters to IPv6 nodes. DHCPv6 servers can pass IPv6 prefuc delegation parameter to a requesting router by using IPv6 prefix option and re-questing router which got the prefix from server can advertise prefix(es) derived from that prefix. To do this, we need DHCPv6 client/server supporting prefix delegation option and router advertisement daemon. In this paper, we implemented DHCPv6 client supporting IPv6 prefix option and for DHCPv6 server and router advertisement module we use open source project to test our s/w module [4].

#*Challenges and Solutions in Process Automation in Tertiary Education Institutes: An Australian Case Study.
#@Jeewani Anupama Ginige,Athula Ginige
#year2007
#confACIS-ICIS
#citation1
#index4703
#arnetid4705

#*Automatic Generation of XForms Code Using DTD.
#@Eunujung Lee,Tae-Hoon Kim
#year2005
#confACIS-ICIS
#citation0
#index4704
#arnetid4706
#!As HTML forms show inconsistency with XML based internet standards, XForms is proposed as a new standard of an internet form language. As XForms separate the data and logic of a form from its presentation, we can use XML for data transport and any XML host language for data display, such as XSL. However, it is expensive to create XForms and/or XSL codes since it depends on the type of XML data. In this paper, we present an automatic generation method of XForms codes from the document type information. In order to find a user model, we adopt repetitive data update model, where user can add/delete only the repetitive parts of XML data. Using this model, we generate an XForms code in terms of repeating structure of XML data based on DTD. We present the user model and generation algorithm with the discussion on its applications.

#*A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem.
#@Mauritsius Tuga,Regina Berretta,Alexandre Mendes
#year2007
#confACIS-ICIS
#citation5
#index4705
#arnetid4707

#*Generation of 3D Facial Expressions Using 2D Facial Image.
#@Hyun Cheol Lee,Eun Seok Kim,Gi Taek Hur,Hee Young Choi
#year2005
#confACIS-ICIS
#citation1
#index4706
#arnetid4708
#!The creation and animation of 3D facial models mostly depends on animators' manual work by the frame. Thus, it needs many efforts and time as well as various hardwares and softwares. This paper is aimed at introducing a facial expression modeling and caricature system which is based on muscle vector and produces diverse and realistic facial expressions. Based on the eight standard facial models for Korean faces, we suggest a way to model 3D human faces easily and quickly with the front and profile images. In addition, an elegant adjustment method which produce more precise 3D facial models using the linear spline is proposed. The proposed method can be easily applied for producing caricatures by adjusting the control points of spline and the vectors of the facial muscles.

#*Defining Functional Requirements for a Lightweight GNSS Support Protocol (LGSP).
#@Mike Tyson,Carlo Kopp
#year2007
#confACIS-ICIS
#citation1
#index4707
#arnetid4709

#*Enhanced Distributed Streaming System Based on RTP/RTSP in Resurgent Ability.
#@Jooyoen Lee,Junghak Kim,Shinho Kim,Changku Lim,Jaeil Jung
#year2005
#confACIS-ICIS
#citation1
#index4708
#arnetid4710
#!In this paper, we propose the redirect streaming service model to enhance resurgent ability. The system consists of a redirect server, local streaming servers and clients. Redirect server searches the best streaming serve and streaming servers starts a requested service or resumes it when in a trouble. RTSP/RTP is one of the effective solutions to improve QOS in VOD, however a service can be broken off by an overloaded server or network especially in live. We designed and implemented not only a distributed streaming system that solves the broken-off service to enhance a resurgent system, but also DSSP, distributed streaming service protocol.

#*A Neuro-Fuzzy Model for Motion Cognition.
#@Mohamed Shaarawy,Mohamed Belal,Ehab ElGindy
#year2007
#confACIS-ICIS
#citation0
#index4709
#arnetid4711

#*Performance Evaluation Technique of the RTSP Based Streaming Server.
#@Yong-Ju Lee,Ok-Gee Min,Hag-Young Kim
#year2005
#confACIS-ICIS
#citation7
#index4710
#arnetid4712
#!In recent years, there have been many streaming servers that provide a large number of contents for a userýs preference. General purpose streaming server makes use of a RTSP protocol for streaming controls such as message passing with client players. To date, there has been minimal research regarding streaming serverýs performance test tools. For measuring streaming serverýs performance, performance evaluation technique is needed and also achieved by the RTSP controls, a serverýs performance result and its miscellaneous test tools such as the PseudoPlayer for pumping data to a specified port and the PseudoMonitor for gathering information. In this paper, we implement a test toolkit for evaluating a streaming serverýs performance and show the case of its application.

#*Hybrid Multi-Feature Indexing for Music Data Retrieval.
#@Yu-lung Lo,Chun-Hsiung Wang
#year2007
#confACIS-ICIS
#citation2
#index4711
#arnetid4713

#*Validation process and component analysis in semantic mediation.
#@Raymond Wu
#year2007
#confACIS-ICIS
#citation0
#index4712
#arnetid4714

#*Oriental Color Ink Rendering for Landscape.
#@Ki-Jung Lee,Taeg Keun Whangbo,Young-Kyu Yang
#year2005
#confACIS-ICIS
#citation0
#index4713
#arnetid4715
#!Researchers of oriental color ink painting have concentrated on physical models such as brushes; papers, and ink diffusion. These models can be efjective when painter depict a painting by tablet pen. Abstraction is main notion of oriental color ink painting. More than thousand years, oriental color ink painter uses this notion, for representing their feelings. lf a painter has poor skill to use tablet pen or drawing ability; result should be not satisfied. In this paper, we propose an interactive painting method for oriental color ink painting. We use a computational approach to abstract landscape image and reproduce a painting by oriental color ink painting method. The reason why we use landscape image, landscape painting is a major theme of oriental ink painting.

#*Using Metrics for Estimating Maintainability of Web Applications: An Empirical Study.
#@Heung Seok Chae,Tae Yeon Kim,Woo-Sung Jung,Joon-Sang Lee
#year2007
#confACIS-ICIS
#citation0
#index4714
#arnetid4716

#*Bundle Authentication and Authorization Using XML Security in the OSGi Service Platform.
#@Hee-Young Lim,Young-Gab Kim,Chang-Joo Moon,Doo-Kwon Baik
#year2005
#confACIS-ICIS
#citation14
#index4715
#arnetid4717
#!OSGi service platform is the core platform of a gateway in the home network. One of the most important issues is security in the home network because the usage scope of the home network is related to a personal living space. However, the solutions related to the security are in their infancy, and if we apply the existing security techniques as they are, security management is not efficient because the properties of OSGi environments are dynamic and open. Nowadays XML is most flexible and undependable language in presenting the data and is being used in diverse fields. Following this trend, several services present their own data using XML in the OSGi service platform environment. To take advantage of this, it is possible to manage the security effectively and extensibly. Hence, in this paper, we suggest an efficient mechanism to solve security issues such as service bundle authentication and authorization using XML security, XML signature and XACML.

#*Accent Classification Using Support Vector Machines.
#@Carol Pedersen,Joachim Diederich
#year2007
#confACIS-ICIS
#citation6
#index4716
#arnetid4718

#*Design of Healthcare System for Disabled Person Using Eye Blinking.
#@Hyotaek Lim,Vinay Kumar Singh
#year2005
#confACIS-ICIS
#citation-1
#index4717
#arnetid4719
#!There are some types of diseases in which one can not be able to move their bodies, can not speak, and can not share their feeling to rest of the world. There are some types of disease like as Amyotrophic lateral sclerosis (ALS), often referred to as "Lou Gehrig's disease. A-myo-trophic comes from the Greek language. "A" means no or negative. "Myo" refers to muscle, and "Trophic" means nourishment- --"No muscle nourishment." So there is no muscle movement in this type of diseases. So our aim for this paper is to solve the problem of persons who are suffering from such type of diseases. We use the eye blinking as a parameter to communicate with rest of the world. By our project one can communicate with rest of the world by eye blinking. The purposed aim for this paper is to communicate this type of person with rest of the world suffering from these types of diseases.

#*Applying Concurrent Versioning to Serverless Mobile Device Synchronisation.
#@Henry Larkin
#year2007
#confACIS-ICIS
#citation0
#index4718
#arnetid4720

#*Semantic Web Enabled VHE for 3rd Generation Telecommunications.
#@Songtao Lin,Junliang Chen
#year2005
#confACIS-ICIS
#citation4
#index4719
#arnetid4721
#!Former approaches to VHE resulted in considerable traffic loads and security threats by moving service logics across networks. In order to minimize extra traffic resulted by VHE, here we employ semantic web technology to setup a semantic background, upon which VHE could comprehend the expectations of users and the abilities of services, thus could automatically and precisely select an appropriate local service for a service request of a roaming user. As a first step to reach the semantic web enabled VHE, we model related knowledge into ontologies and present a suggested architectural framework.

#*A New Approach for Image Thresholding under Uneven Lighting Conditions.
#@Yao-Hong Tsai
#year2007
#confACIS-ICIS
#citation1
#index4720
#arnetid4722

#*Dependable Public Wireless LANs without Hardware Support.
#@Jenn-Wei Lin,Ming-Feng Yang
#year2005
#confACIS-ICIS
#citation0
#index4721
#arnetid4723
#!This paper presents a new approach for designing a fault-tolerant public wireless local access networks (public WLANs). When a failure occurs in an access point of the public WLAN, some users (the users under the coverage ranges of the faulty AP) cannot perform data services again due to losing wireless connectivity. To resume the wireless connectivity of such affected users, previous approaches are based on the hardware or network planning support. Unlike previous approach, the proposed approach gives each affected user a direction to guide it how to move itself to the coverage area of a survival access point. For quickly completing the wireless reconnection, the moving distance is an important concerned metric in the proposed approach. In addition, the overloading problem is also considered in the proposed approach for avoiding that many affected users move to the same survivable access point. Finally, extensive simulations are performed to evaluate the performance overhead of the proposed approach.

#*Bounds on the Multi-Client Incremental Computing.
#@Cho-Chin Lin,Hao-Yun Yin
#year2005
#confACIS-ICIS
#citation0
#index4722
#arnetid4724
#!It has been shown that, in a network computing platform, the arrival order of input data has serious impact on the performance of a computing server. In a multi-client environment, each client competes with the others for the network bandwidth. In this paper, we study the bounds on the time needed to compute the services requested from multiple clients. First, an abstract model of network computing for multiple clients is proposed. Then, based on the model, bounds on the time are developed for a computing server to compute services specified by a class of special sequences. Finally, simulations are conducted to illustrate the effect of message patterns on the performance of a computing server.

#*Model of a Semantic Web Search Engine for Multimedia Content Retrieval.
#@Mohan Ponnada,Nalin Sharda
#year2007
#confACIS-ICIS
#citation3
#index4723
#arnetid4725

#*New Methods for Transparent and Accurate Echo Hiding By Using the Original Audio Cepstral Content.
#@Yousof Erfani,Mohammad Shahram Moin,Mehdi Parviz
#year2007
#confACIS-ICIS
#citation2
#index4724
#arnetid4726

#*A Critique of Mobility Models for Wireless Network Simulation.
#@Babak Pazand,Chris McDonald
#year2007
#confACIS-ICIS
#citation13
#index4725
#arnetid4727

#*Intrusion Detection via Fuzzy-Genetic Algorithm Combination with Evolutionary Algorithms.
#@Abolfazl Toroghi Haghighat,Mostafa Esmaeili,Amin Saremi,V. R. Mousavi
#year2007
#confACIS-ICIS
#citation4
#index4726
#arnetid4728

#*A Novel Image Text Extraction Method Based on K-Means Clustering.
#@Yan Song,Anan Liu,Lin Pang,Shouxun Lin,Yongdong Zhang,Sheng Tang
#year2008
#confACIS-ICIS
#citation6
#index4727
#arnetid4729
#!Texts in web pages, images and videos contain important clues for information indexing and retrieval. Most existing text extraction methods depend on the language type and text appearance. In this paper, a novel and universal method of image text extraction is proposed. A coarse-to-fine text location method is implemented. Firstly, a multi-scale approach is adopted to locate texts with different font sizes. Secondly, projection profiles are used in location refinement step. Color-based k-means clustering is adopted in text segmentation. Compared to grayscale image which is used in most existing methods, color image is more suitable for segmentation based on clustering. It treats corner-points, edge-points and other points equally so that it solves the problem of handling multilingual text. It is demonstrated in experimental results that best performance is obtained when k is 3. Comparative experimental results on a large number of images show that our method is accurate and robust in various conditions.

#*Technology Management, Data management, Improved outcomes, Efficiency and Software limitation influencing the use of wireless technology for healthcare in Pakistan.
#@Abdul Hafeez-Baig,Shelly Grist,Raj Gururajan
#year2007
#confACIS-ICIS
#citation-1
#index4728
#arnetid4730

#*Hybrid Genetic Algorithm for Solving Job-Shop Scheduling Problem.
#@S. M. Kamrul Hasan,Ruhul A. Sarker,David Cornforth
#year2007
#confACIS-ICIS
#citation-1
#index4729
#arnetid4731

#*Statistical Analysis of Impulse Noise Model for Color Image Restoration.
#@Mieng Quoc Phu,Peter E. Tischer,Hon Ren Wu
#year2007
#confACIS-ICIS
#citation0
#index4730
#arnetid4732

#*A Genetic Robot Path Planner with Fuzzy Logic Adaptation.
#@Mahmoud Tarokh
#year2007
#confACIS-ICIS
#citation0
#index4731
#arnetid4733

#*Learning in Market-based Resource Allocation.
#@Eduardo Rodrigues Gomes,Ryszard Kowalczyk
#year2007
#confACIS-ICIS
#citation3
#index4732
#arnetid4734

#*Frameworks of Integration Repository for Software Process Improvement using SOA.
#@Eun-Ju Park,Haeng-Kon Kim,Roger Y. Lee
#year2007
#confACIS-ICIS
#citation1
#index4733
#arnetid4735

#*SEFAP: An Email System for Anti-Phishing.
#@Qiong Ren,Yi Mu,Willy Susilo
#year2007
#confACIS-ICIS
#citation1
#index4734
#arnetid4736

#*Minimum Message Length Clustering of Spatially-Correlated Data with Varying Inter-Class Penalties.
#@Gerhard Visser,David L. Dowe
#year2007
#confACIS-ICIS
#citation9
#index4735
#arnetid4737

#*Fast Scene Change Detection Based Histogram.
#@Morshed U. Chowdhury,Rezwanur Rahman,Joydip Saha,S. M. Raiyan Kabir
#year2007
#confACIS-ICIS
#citation0
#index4736
#arnetid4738

#*A new approach to detecting memory access errors in C programs.
#@Dae Wan Cho,Hyeon Soo Kim,Seunguk Oh
#year2007
#confACIS-ICIS
#citation0
#index4737
#arnetid4739

#*A Smart Proxy for a Next Generation Web Services Transaction.
#@Sunam Pradhan,Arkady B. Zaslavsky
#year2007
#confACIS-ICIS
#citation5
#index4738
#arnetid4740

#*2D Barcodes as Watermarks in Image Authentication.
#@Prashan Premaratne,Farzad Safaei
#year2007
#confACIS-ICIS
#citation7
#index4739
#arnetid4741

#*Self Adjusted Security Architecture for Mobile Ad Hoc Networks (MANETs).
#@Atef Z. Ghalwash,Aliaa A. A. Youssif,Sherif M. Hashad,Robin Doss
#year2007
#confACIS-ICIS
#citation2
#index4740
#arnetid4742

#*A Fuzzy-Based Approach for Partner Selection in Multi-Agent Systems.
#@Fenghui Ren,Minjie Zhang,Quan Bai
#year2007
#confACIS-ICIS
#citation4
#index4741
#arnetid4743

#*Dynamic Feature Selection for Spam Filtering Using Support Vector Machine.
#@Md. Rafiqul Islam,Wanlei Zhou,Morshed U. Chowdhury
#year2007
#confACIS-ICIS
#citation4
#index4742
#arnetid4744

#*A Low Cost Interactive Distance Learning Solution.
#@Faisal Sana,Shakeel Ahmed Khoja
#year2007
#confACIS-ICIS
#citation1
#index4743
#arnetid4745

#*Bad-Smell Metrics for Aspect-Oriented Software.
#@Komsan Srivisut,Pornsiri Muenchaisri
#year2007
#confACIS-ICIS
#citation1
#index4744
#arnetid4746

#*Internet Communities and Open innovation: an Information System Design Methodology.
#@Roula Michaelides,Dennis F. Kehoe
#year2007
#confACIS-ICIS
#citation-1
#index4745
#arnetid4747

#*Voice Activity Detection Based on GM(1, 1) Model.
#@Cheng-Hsiung Hsieh,Ting-Yu Feng,Ren-Hsien Huang
#year2007
#confACIS-ICIS
#citation0
#index4746
#arnetid4748

#*Routing with Load Balancing in Ad Hoc Network: A Mobile Agent Approach.
#@Neeraj Nehra,R. B. Patel,V. K. Bhat
#year2007
#confACIS-ICIS
#citation5
#index4747
#arnetid4749

#*Reliability Analysis of Component Software Based on Stochastic Petri Nets.
#@Lianzhang Zhu,Yanchen Li
#year2007
#confACIS-ICIS
#citation1
#index4748
#arnetid4750

#*2D Barcode and Augmented Reality Supported English Learning System.
#@Tsung-Yu Liu,Tan-Hsu Tan,Yu-Ling Chu
#year2007
#confACIS-ICIS
#citation15
#index4749
#arnetid4751

#*Cache Predicting Algorithm Based on Context-Aware in Pervasive Computing.
#@Jizhong Zhao,Min Xi,Yong Qi
#year2007
#confACIS-ICIS
#citation0
#index4750
#arnetid4752

#*RFID-based Hospital Real-time Patient Management System.
#@Belal Chowdhury,Rajiv Khosla
#year2007
#confACIS-ICIS
#citation9
#index4751
#arnetid4753

#*Split Private and Shared L2 Cache Architecture for Snooping-based CMP.
#@Xuemei Zhao,Karl Sammut,Fangpo He,Shaowen Qin
#year2007
#confACIS-ICIS
#citation2
#index4752
#arnetid4754

#*Towards A Two-Layered Framework for Managing Web Services Interaction.
#@Zakaria Maamar,Djamal Benslimane,Quan Z. Sheng
#year2007
#confACIS-ICIS
#citation5
#index4753
#arnetid4755

#*A Novel Classifier Selection Approach for Adaptive Boosting Algorithms.
#@A. B. M. Shawkat Ali,Tony Dobele
#year2007
#confACIS-ICIS
#citation1
#index4754
#arnetid4756

#*Encoding and Decoding Techniques for Medical Video Signal Transmission and Viewing.
#@Manoranjan Paul,Golam Sorwar
#year2007
#confACIS-ICIS
#citation1
#index4755
#arnetid4757

#*Nanorobots for Laparoscopic Cancer Surgery.
#@Adriano Cavalcanti,Bijan Shirinzadeh,Declan Murphy,Julian Smith
#year2007
#confACIS-ICIS
#citation4
#index4756
#arnetid4758

#*Finding Motifs in miRNA Sequences.
#@Chinnu Subramaniam,Jiyuan An,Jayavardhana Gubbi,Yi-Ping Phoebe Chen
#year2007
#confACIS-ICIS
#citation0
#index4757
#arnetid4759

#*Information Analysis for Enabling Optimal Utilization of Service Delivery Channels in Indian Banks.
#@Hemalatha Diwakar,Alka Vaidya
#year2008
#confACIS-ICIS
#citation2
#index4758
#arnetid4760
#!Banks in India have in recent times made extensive capital investments in Centralized Banking transaction Solutions and Service Delivery Technologies (SDTs) such as Automated Teller Machines (ATMs). Such SDTs have been sparingly used mostly for cash withdrawals while the bulk of other transactions still continue to be branch centric. In order to selectively shift transactions to these SDTs, banks need to review existing branch transactions from a volume cost-benefit and timeliness perspective at a branch level (there is a wide variability in the nature of clientele and type of transactions at different branches). This calls for a through analysis of branch level customer transactions. We have carried out the above said analysis using ORACLE and ORACLE BI on a sample branch data of an Indian Bank and the results strongly indicate that a sizable set of transactions can definitely be shifted to SDTs.

#*Higher Order Voronoi Diagrams for Concept Boundaries and Tessellations.
#@Ickjai Lee,Kyungmi Lee
#year2007
#confACIS-ICIS
#citation1
#index4759
#arnetid4761

#*Recognition of Power Quality Events by Using Multiwavelet-Based Neural Network.
#@Suriya Kaewarsa,Kitti Attakitmongcol,Thanatchai Kulworawanichpong
#year2007
#confACIS-ICIS
#citation16
#index4760
#arnetid4762

#*A performance analysis of page and object retrieval using HTTP-MPLEX in symmetric network environments.
#@Robert L. R. Mattson,Somnath Ghosh
#year2007
#confACIS-ICIS
#citation1
#index4761
#arnetid4763

#*Hybrid Group Key Management Scheme for Secure Wireless Multicast.
#@Yiling Wang,Phu Dung Le,Balasubramaniam Srinivasan
#year2007
#confACIS-ICIS
#citation6
#index4762
#arnetid4764

#*A New Cooperative Communication System in Distance Education.
#@Tokuro Matsuo,Takayuki Fujimoto
#year2007
#confACIS-ICIS
#citation5
#index4763
#arnetid4765

#*A New DRM System Based on Graded Contents Sharing and Time-Block Distribution for Home Networks.
#@Eun Seok Jeong,Chul Sur,Kyung Hyune Rhee
#year2007
#confACIS-ICIS
#citation4
#index4764
#arnetid4766

#*An Edge Extraction Method for Color Image Using Multiple-Valued LoG Filter and Color Space.
#@Cong-Kha Pham,Koutaro Yamano
#year2007
#confACIS-ICIS
#citation0
#index4765
#arnetid4767

#*A Novel Differentiated Service Hybrid Signaling Protocol for Optical Burst Switching Networks.
#@Yantao Guo,Aijun Wen,Zengji Liu,Zhiqing Zhang
#year2007
#confACIS-ICIS
#citation0
#index4766
#arnetid4768

#*Model-Based Software Component Testing: A UML-Based Approach.
#@Weiqun Zheng,Gary A. Bundell
#year2007
#confACIS-ICIS
#citation-1
#index4767
#arnetid4769

#*Bridge Information Assurance Education Gap between the Majority and Minority Universities through Collaboration.
#@H. Yu,X. Yuan,J. Xu,S. Providence,B. Chu,D. Gu
#year2007
#confACIS-ICIS
#citation0
#index4768
#arnetid4770

#*Adjacency Cache: Fast Web Cache Indexing and Lookup.
#@John Casey,Ashley Chonka,Wanlei Zhou
#year2007
#confACIS-ICIS
#citation1
#index4769
#arnetid4771

#*Trust Realisation in Multi-domain Collaborative Environments.
#@Oluwafemi Ajayi,Richard O. Sinnott,Anthony Stell
#year2007
#confACIS-ICIS
#citation8
#index4770
#arnetid4772

#*A Matrix Algorithm forWeb Cache Pre-fetching.
#@Wenying Feng,Hua Chen
#year2007
#confACIS-ICIS
#citation0
#index4771
#arnetid4773

#*Taxonomy and Survey of Location Management Systems.
#@Ahadur Rahaman,Jemal H. Abawajy,Michael Hobbs
#year2007
#confACIS-ICIS
#citation4
#index4772
#arnetid4774

#*Collaborative Education Model and Its Application in E-learning.
#@Gang Chen,Ruimin Shen,Jiajun Wang,Zeyu Chen
#year2007
#confACIS-ICIS
#citation2
#index4773
#arnetid4775

#*Speech Animation Based on Chinese Mandarin Triphone Model.
#@Zhou Wei,Wang Zengfu
#year2007
#confACIS-ICIS
#citation1
#index4774
#arnetid4776

#*User Perceptions and Acceptance of Benevolent Worms -- A Matter of Fear?
#@Luke Bellamy,Damien Hutchinson,Jason Wells
#year2007
#confACIS-ICIS
#citation0
#index4775
#arnetid4777

#*A Composite Descriptor for Shape Retrieval.
#@Atul Sajjanhar,Guojun Lu,Dengsheng Zhang,Wanlei Zhou
#year2007
#confACIS-ICIS
#citation3
#index4776
#arnetid4778

#*Long Distance Redundancy Reduction in Thin Client Computing.
#@Yang Sun,Teng-Tiow Tay
#year2007
#confACIS-ICIS
#citation-1
#index4777
#arnetid4779

#*One-Dimensional Grey Polynomial Interpolators for Image Enlargement.
#@Cheng-Hsiung Hsieh,Ren-Hsien Huang,Ting-Yu Feng
#year2007
#confACIS-ICIS
#citation6
#index4778
#arnetid4780

#*CMOS Schmitt Trigger Circuit with Controllable Hysteresis Using Logical Threshold Voltage Control Circuit.
#@Cong-Kha Pham
#year2007
#confACIS-ICIS
#citation2
#index4779
#arnetid4781

#*Constructing a Process Model for Decision Analysis and Resolution on COTS Selection Issue of Capability Maturity Model Integration.
#@Phamorn Vantakavikran,Nakornthip Prompoon
#year2007
#confACIS-ICIS
#citation1
#index4780
#arnetid4782

#*Investigating the Shared Visual Context in Distributed Collaborative Work.
#@Dawei Jia,Kathy Blashki,Penelope Goward,R. T. Jim Eales
#year2007
#confACIS-ICIS
#citation-1
#index4781
#arnetid4783

#*Network Lifetime of Application-Specific Randomly Deployed Wireless Sensor Networks in Arbitrary Sensor Density.
#@Jing He,Yanchun Zhang,Guangyan Huang,Yong Shi
#year2007
#confACIS-ICIS
#citation4
#index4782
#arnetid4784

#*Determining the Loss of Investment Probability for Risk based Decision Support System.
#@Omar Khadeer Hussain,Elizabeth Chang,Farookh Khadeer Hussain,Tharam S. Dillon
#year2007
#confACIS-ICIS
#citation0
#index4783
#arnetid4785

#*A Hybrid Method for Solving Traveling Salesman Problem.
#@Bager Zarei,Mohammad Reza Meybodi,Mortaza Abbaszadeh Meinagh
#year2007
#confACIS-ICIS
#citation9
#index4784
#arnetid4786

#*Control Network Programming.
#@Kostadin Kratchanov,Tzanko Golemanov,Emilia Golemanova
#year2007
#confACIS-ICIS
#citation7
#index4785
#arnetid4787

#*On the Limitations of Compilers to Exploit Thread-Level Parallelism in Embedded Applications.
#@Md. Mafijul Islam
#year2007
#confACIS-ICIS
#citation0
#index4786
#arnetid4788

#*Evaluation of Authentication Mechanisms for Mobile Agents on top of Java.
#@Leila Ismail
#year2007
#confACIS-ICIS
#citation3
#index4787
#arnetid4789

#*Restricted Access to Exam Grades on the Web by HIP.
#@Sajad Shirali-Shahreza,Mohammad Shirali-Shahreza,Ali Movaghar
#year2007
#confACIS-ICIS
#citation2
#index4788
#arnetid4790

#*A Fuzzy Adaptive Soft Handover Scheme Supporting Four Active Sets.
#@Kemeng Yang,Iqbal Gondal,Bin Qiu,Laurence S. Dooley
#year2007
#confACIS-ICIS
#citation1
#index4789
#arnetid4791

#*Decontamination of Arbitrary Networks using a Team of Mobile Agents with Limited Visibility.
#@Paola Flocchini,Amiya Nayak,Arno Schulz
#year2007
#confACIS-ICIS
#citation1
#index4790
#arnetid4792

#*Service Oriented Architecture for Legal Web Portal.
#@Kenneth Patrick Payne,Joarder Kamruzzman
#year2007
#confACIS-ICIS
#citation1
#index4791
#arnetid4793

#*A solution to block Cross Site Scripting Vulnerabilities based on Service Oriented Architecture.
#@Jayamsakthi Shanmugam,M. Ponnavaikko
#year2007
#confACIS-ICIS
#citation9
#index4792
#arnetid4794

#*A Conflict Resolution Method in Context-Aware Computing.
#@Yong Qi,Min Xi,Saiyu Qi,Jizhong Zhao
#year2007
#confACIS-ICIS
#citation1
#index4793
#arnetid4795

#*Design of Multi-signature Scheme in Wireless Networks.
#@Ping Han,Yanqin Zhu,Yuemei Hu
#year2007
#confACIS-ICIS
#citation0
#index4794
#arnetid4796

#*A Framework for Deterministic Intention Specifications of an Agent toward an Incomplete Declared Intention.
#@Dussadee Praserttitipong,Peraphon Sophatsathit
#year2007
#confACIS-ICIS
#citation0
#index4795
#arnetid4797

#*Motion Control of a Dancing Character with Music.
#@Gunwoo Kim,Yan Wang,Hyewon Seo
#year2007
#confACIS-ICIS
#citation6
#index4796
#arnetid4798

#*Voice over Internet Protocol on Mobile Devices.
#@Guo Fang Mao,Alex Talevski,Elizabeth Chang
#year2007
#confACIS-ICIS
#citation8
#index4797
#arnetid4799

#*Integration of Configuration Management and Hypermedia for Managing Changes in Database Applications.
#@Tien N. Nguyen
#year2007
#confACIS-ICIS
#citation0
#index4798
#arnetid4800

#*Impact of Clustering Techniques on Content-Based Pattern Generation Algorithm for Low Bit Rate Video Coding.
#@Manoranjan Paul,M. Manzur Murshed
#year2007
#confACIS-ICIS
#citation0
#index4799
#arnetid4801

#*Structural Equation Modelling of Large-scale Information System Application Development Productivity: the Hong Kong Experience.
#@Les R. Foulds,Mohammed Quaddus,M. West
#year2007
#confACIS-ICIS
#citation1
#index4800
#arnetid4802

#*A Study on Data Placement of Extensible Parallel Storage System.
#@Hu Zhang,Weiguo Wu,Xiaoshe Dong,Depei Qian,Luogeng Dai
#year2007
#confACIS-ICIS
#citation2
#index4801
#arnetid4803

#*An Attribute Reduction Method Based on Rough Set and SVM and with Application in Oil-Gas Prediction.
#@Ru Nie,Jianhua Yue
#year2007
#confACIS-ICIS
#citation-1
#index4802
#arnetid4804

#*An Integrated Haptic Data Transmission in Haptic Collaborative Virtual Environments.
#@Yonghee You,Mee Young Sung,Kyungkoo Jun
#year2007
#confACIS-ICIS
#citation5
#index4803
#arnetid4805

#*An Efficient Node Partitioning Algorithm for the Capacitated Minimum Spanning Tree Problem.
#@Jun Han,Zhaohao Sun,Jinpeng Huai,Xian Li
#year2007
#confACIS-ICIS
#citation2
#index4804
#arnetid4806

#*Performance Analysis of OFDM Systems with Phase Noise.
#@M. Mahbubur Rahman,M. Delowar Hossain,A. B. M. Shawkat Ali
#year2007
#confACIS-ICIS
#citation-1
#index4805
#arnetid4807

#*Improved Background Removal through Polarisation in Vision-Based Tabletop Interface.
#@Ross Eldridge,Heiko Rudolph,Jonathan Duckworth,Peter H. Wilson
#year2007
#confACIS-ICIS
#citation0
#index4806
#arnetid4808

#*A Novel Genetic Algorithm Based on Image Databases for Mining Association Rules.
#@Shangping Dai,Li Gao,Qiang Zhu,Changwu Zhu
#year2007
#confACIS-ICIS
#citation1
#index4807
#arnetid4809

#*A Kernel-Based Method for Semi-Supervised Learning.
#@Andrew Skabar,Narendra Juneja
#year2007
#confACIS-ICIS
#citation2
#index4808
#arnetid4810

#*Average Routing Distance Analysis and Comparison of Master-Slave Super-Super-Hypercube 4-Cube Topology with different Message Passing Architectures.
#@Maryam Amiripour,Hamid Abachi
#year2007
#confACIS-ICIS
#citation0
#index4809
#arnetid4811

#*A Comparison of Relevance Feedback Strategies in CBIR.
#@Gita Das,Sid Ray
#year2007
#confACIS-ICIS
#citation2
#index4810
#arnetid4812

#*Towards Multicast Delay Analysis for Ad hoc Wireless Networks.
#@K. Sithitavorn,C. Wilson,B. Qiu
#year2007
#confACIS-ICIS
#citation0
#index4811
#arnetid4813

#*Development of Multimodal Ubiquitous System: A pilot study.
#@David Kang,Wei Dai
#year2007
#confACIS-ICIS
#citation0
#index4812
#arnetid4814

#*Tokenisation of Class Files for an Embedded Java Processor.
#@Shawn Haggett,Greg Knowles,Graham Bignell
#year2007
#confACIS-ICIS
#citation0
#index4813
#arnetid4815

#*Obtain Weather Data with Data Warehousing.
#@M. H. Peyravi,P. Khosraviyan Dehkordi,Z. Davari Nejad
#year2007
#confACIS-ICIS
#citation1
#index4814
#arnetid4816

#*Learning Structure of a Gene Regulatory Network.
#@Ramesh Ram,Madhu Chetty
#year2007
#confACIS-ICIS
#citation5
#index4815
#arnetid4817

#*The Virtual Topology Reconfiguration Controller for WDM Networks.
#@Seungyeon You,Sungchun Kim
#year2007
#confACIS-ICIS
#citation1
#index4816
#arnetid4818

#*Spam Classification Using Adaptive Boosting Algorithm.
#@A. B. M. Shawkat Ali,Yang Xiang
#year2007
#confACIS-ICIS
#citation3
#index4817
#arnetid4819

#*Evaluating the Usefulness of Pair Programming in a Classroom Setting.
#@Theodore Van Toll III,Roger Lee,Tom Ahlswede
#year2007
#confACIS-ICIS
#citation3
#index4818
#arnetid4820

#*Pheromone Communication Simulation for Mobile Robots Using Java 3D.
#@Anies Hannawati Purnamadjaja,Johan Iskandar,R. Andrew Russell
#year2007
#confACIS-ICIS
#citation1
#index4819
#arnetid4821

#*An Empirical Study of Knowledge Representation and Learning within Conceptual Spaces for Intelligent Agents.
#@Ickjai Lee,Bayani Portier
#year2007
#confACIS-ICIS
#citation1
#index4820
#arnetid4822

#*The Research of Social Navigation based on Fuzzy Concept Lattice.
#@ChunZhi Xie,Liangzhong Yi,Yajun Du,Zheng Pei
#year2007
#confACIS-ICIS
#citation1
#index4821
#arnetid4823

#*A fully Automated CAD system using Multi-category Feature Selection with Restricted Recombination.
#@Ranadhir Ghosh,Moumita Ghosh,John Yearwood,Subhasis Mukherjee
#year2007
#confACIS-ICIS
#citation1
#index4822
#arnetid4824

#*XPL, a Presentation Language based on User Interface Design Pattern.
#@Giuseppe Vella,Nunzio Ingraffia,Marilia Liotta,Antonella Santangelo,Antonio Gentile
#year2007
#confACIS-ICIS
#citation3
#index4823
#arnetid4825

#*Analysis of relations between spoken utterances and text messages in chat-augmented meetings.
#@Tomoya Kobayashi,Kazushi Nishimoto
#year2007
#confACIS-ICIS
#citation0
#index4824
#arnetid4826

#*A Novel Adaptive-Boost-Based Strategy for Combining Classifiers Using Diversity Concept.
#@Abbas Golestani,Kushan Ahmadian,Ali Amiri,Mohammad-Reza Jahed Motlagh
#year2007
#confACIS-ICIS
#citation2
#index4825
#arnetid4827

#*A Combined MA-GA Approach for Solving Constrained Optimization Problems.
#@Abu Saleh Shah Muhammad Barkat Ullah,Ruhul A. Sarker,David Cornforth
#year2007
#confACIS-ICIS
#citation-1
#index4826
#arnetid4828

#*Towards Aspect Oriented Web Service Composition with UML.
#@Yang Xu,Shengqun Tang,Youwei Xu,Zukai Tang
#year2007
#confACIS-ICIS
#citation5
#index4827
#arnetid4829

#*InfoXP: An E-government Information eXchange Platform Based on Overlay Network.
#@Jun Han,Xudong Liu,Jinpeng Huai,Xuelian Lin,Xiaoxuan Ma,Xian Li
#year2007
#confACIS-ICIS
#citation0
#index4828
#arnetid4830

#*Gene-finding as an Attribute Selection Task.
#@Helyane Bronoski Borges,Júlio C. Nievola
#year2007
#confACIS-ICIS
#citation2
#index4829
#arnetid4831

#*Effects of Varying Superframe Duration on Jitter in Interactive Multimedia Traffic Transmission over WLANs.
#@Suhaimi Bin Abd Latif,M. A. Rashid,F. Alam
#year2007
#confACIS-ICIS
#citation-1
#index4830
#arnetid4832

#*Towards Agent Based Web Service.
#@Manish Chhabra,Hongen Lu
#year2007
#confACIS-ICIS
#citation4
#index4831
#arnetid4833

#*A Modified K-means Algorithm for Noise Reduction in Optical Motion Capture Data.
#@Jan Carlo Barca,Grace W. Rumantir
#year2007
#confACIS-ICIS
#citation3
#index4832
#arnetid4834

#*A Multilevel Trust Management Framework.
#@Soon-Keow Chong,Jemal H. Abawajy,Robert A. Dew
#year2007
#confACIS-ICIS
#citation2
#index4833
#arnetid4835

#*Growing the Pipeline: Restructuring an Introductory Computer Programming Course.
#@Cynthia Y. Lester
#year2007
#confACIS-ICIS
#citation0
#index4834
#arnetid4836

#*Collegiate Cyber Game Design Criteria and Participation.
#@Bei-tseng Chu,Gail-Joon Ahn,Steven Blanchard,James Deese,Richard Kelly,Huiming Yu,Ashika Young
#year2007
#confACIS-ICIS
#citation2
#index4835
#arnetid4837

#*Conceptual Modeling of Product Information in e-Commerce.
#@Hyunja Lee,Junho Shim
#year2007
#confACIS-ICIS
#citation4
#index4836
#arnetid4838

#*Meta-Learning: From Classification to Forecasting, to Optimization, and Beyond.
#@Kate Smith-Miles
#year2007
#confACIS-ICIS
#citation0
#index4837
#arnetid4839

#*Slicing Aided Design of Obfuscating Transforms.
#@Stephen Drape,Anirban Majumdar,Clark D. Thomborson
#year2007
#confACIS-ICIS
#citation5
#index4838
#arnetid4840

#*Improvement of the Recall and the Precision for Semantic Web Services Search.
#@Daewook Lee,Joonho Kwon,SeungHoon Yang,Sukho Lee
#year2007
#confACIS-ICIS
#citation3
#index4839
#arnetid4841

#*A Campus Information Processing based on Educational Resources Reuse and Integration.
#@Takayuki Fujimoto,Tokuro Matsuo
#year2007
#confACIS-ICIS
#citation0
#index4840
#arnetid4842

#*An Efficient and Robust Technique for Region Based Shape Representation and Retrieval.
#@Dengsheng Zhang,Melissa Chen Yi Lim
#year2007
#confACIS-ICIS
#citation2
#index4841
#arnetid4843

#*ORN Additive: Shrinking the Gap between Database Modeling and Implementation.
#@Bryon K. Ehlmann
#year2007
#confACIS-ICIS
#citation2
#index4842
#arnetid4844

#*SubSS: A Protein-Protein Interaction Detection Tool.
#@Nazar M. Zaki,Safaai Deris,Saleh Alwahaishi
#year2007
#confACIS-ICIS
#citation0
#index4843
#arnetid4845

#*Intelligent Adaptive Services for On-demand Systems Integration.
#@Wei Dai,Jonathan Liu
#year2007
#confACIS-ICIS
#citation3
#index4844
#arnetid4846

#*Research on Intelligent Visual Surveillance for Public Security.
#@Wenxiong Kang,Feiqi Deng
#year2007
#confACIS-ICIS
#citation5
#index4845
#arnetid4847

#*A Hybrid Algorithm for Estimation of the Parameters of Hidden Markov Model based Acoustic Modeling of Speech Signals using Constraint-Based Genetic Algorithm and Expectation Maximization.
#@Md. Shamsul Huda,John Yearwood,Ranadhir Ghosh
#year2007
#confACIS-ICIS
#citation-1
#index4846
#arnetid4848

#*Fingerprint Recognition System Using Hybrid Matching Techniques.
#@Aliaa A. A. Youssif,Morshed U. Chowdhury,Sid Ray,Howida Youssry Nafaa
#year2007
#confACIS-ICIS
#citation2
#index4847
#arnetid4849

#*Image Retrieval Based on Fuzzy Mapping of Image Database and Fuzzy Similarity Distance.
#@Siddhivinayak Kulkarni
#year2007
#confACIS-ICIS
#citation2
#index4848
#arnetid4850

#*Architectural View in Software Development Life-Cycle Practices.
#@Jinalben Patel,Roger Y. Lee,Haeng-Kon Kim
#year2007
#confACIS-ICIS
#citation2
#index4849
#arnetid4851

#*Adaptive Watermarking Algorithm Using SVR in Wavelet Domain.
#@Jun Li,Hong Peng,Zheng Pei
#year2007
#confACIS-ICIS
#citation2
#index4850
#arnetid4852

#*CAD model of Process Elements: Towards Effective Management of Process Evolution in Web-based Workflows.
#@Jeewani Anupama Ginige,Athula Ginige,Uma Sirinivasan
#year2007
#confACIS-ICIS
#citation1
#index4851
#arnetid4853

#*Fuzzy Model Based Recognition of Handwritten Hindi Numerals using Bacterial Foraging.
#@Madasu Hanmandlu,A. V. Nath,A. C. Mishra,Vamsi Krishna Madasu
#year2007
#confACIS-ICIS
#citation5
#index4852
#arnetid4854

#*Visual Tools for Analysing Evolution, Emergence, and Error in Data Streams.
#@Sol Hart,John Yearwood,Adil M. Bagirov
#year2007
#confACIS-ICIS
#citation0
#index4853
#arnetid4855

#*Adapting the FT-CORBA Replication Management Service for Large-scale Distributed Systems.
#@Lau Cheuk Lung,Joni da Silva Fraga
#year2007
#confACIS-ICIS
#citation0
#index4854
#arnetid4856

#*Using Links to Aid Web Classification.
#@Wei Xie,Musa A. Mammadov,John Yearwood
#year2007
#confACIS-ICIS
#citation1
#index4855
#arnetid4857

#*A Domain Identification Algorithm for Personalised Query Expansion with Contextual Information.
#@Indra Seher,Athula Ginige,Seyed A. Shahrestani
#year2007
#confACIS-ICIS
#citation1
#index4856
#arnetid4858

#*Reduct-Based Result Set Fusion for Relevance Feedback in CBIR.
#@Samar Zutshi,Campbell Wilson,Bala Srinivasan
#year2007
#confACIS-ICIS
#citation1
#index4857
#arnetid4859

#*Service-mining Based on the Knowledge and Customer Databases.
#@Hu Wang,Chunqiang Gong,Yan Li
#year2007
#confACIS-ICIS
#citation4
#index4858
#arnetid4860

#*Answering English Queries in Automatically Transcribed Arabic Speech.
#@Abdusalam F. A. Nwesri,Seyed M. M. Tahaghoghi,Falk Scholer
#year2007
#confACIS-ICIS
#citation0
#index4859
#arnetid4861

#*A Framework to Detect Deviations During Process Enactment.
#@Sean Thompson,Torab Torabi,Purva Joshi
#year2007
#confACIS-ICIS
#citation7
#index4860
#arnetid4862

#*Policy based Ontology Framework for Mobile Agents.
#@Sarmad Sadik,Arshad Ali,Hafiz Farooq Ahmad,Hiroki Suguri
#year2007
#confACIS-ICIS
#citation-1
#index4861
#arnetid4863

#*Dynamic Reconfiguration Planning with Influence Control.
#@Zhikun Zhao,Wei Li
#year2007
#confACIS-ICIS
#citation0
#index4862
#arnetid4864

#*Software Installation on a Huge Heterogeneous Network using Mobile Agents.
#@B. Srikanth,D. Kirubakaran,N. Siddharth,Sudip Sanyal
#year2007
#confACIS-ICIS
#citation1
#index4863
#arnetid4865

#*A Procedural Approach to Forecasting Nocturnal Air Temperature for Frost Prediction.
#@Megan Woods,Iqbal Gondal
#year2007
#confACIS-ICIS
#citation0
#index4864
#arnetid4866

#*Cognitive Process during Incremental Software Development.
#@Shaochun Xu,Zendi Cui,Yufeng Gui
#year2007
#confACIS-ICIS
#citation1
#index4865
#arnetid4867

#*Ambient Cardiac Expert: A Cardiac Patient Monitoring System using Genetic and Clinical Knowledge Fusion.
#@Iqbal Gondal,Muhammad Shoaib B. Sehgal,Mudasser Iqbal,Joarder Kamruzzaman
#year2007
#confACIS-ICIS
#citation-1
#index4866
#arnetid4868

#*A Comparative Study on the Performance of Wireless Sensor Networks.
#@Lin Zou,Zhongwei Zhang
#year2007
#confACIS-ICIS
#citation0
#index4867
#arnetid4869

#*A Secure Routing Protocol for Mobile Ad hoc Networks.
#@Zhitang Li,Shudong Shi
#year2007
#confACIS-ICIS
#citation-1
#index4868
#arnetid4870

#*A Solution Framework on Fundamentals in Model Transformation.
#@Yucong Duan,Kyo-Chul Kang,Yuqing Gu
#year2008
#confACIS-ICIS
#citation7
#index4869
#arnetid4871
#!With the great achievements and successes in model transformations (MT), we propose to study MTs from an open and general cognitive background which differs from most current practice. Issues under study cover the broad scope of openness, incompleteness, uncertainty, quality management, human vs. machine aspects, etc, in the evolving process composed of MTs. A solution framework corresponding to some of these issues is proposed to help promote its use and deployment.

#*A Real-Time Interactive Visualization System for DNS Amplification Attack Challenges.
#@Huiming Yu,Xiangfeng Dai,Thomas Baxley,Jinsheng Xu
#year2008
#confACIS-ICIS
#citation0
#index4870
#arnetid4872
#!Domain Name Service (DNS) Amplification Attack has become a serious issue for network security because small queries can generate massive amounts of UDP packets in response to flood the target server. This paper presents our work to develop a Real-Time Interactive Visualization System (RTIVS) for DNS Amplification Attack to help administrators visualize and analyze traffic, and detect the DNS Amplification Attack. The design of the RTIVS is based on the characteristics of the DNS Amplification Attack. It provides two modes that are a manual mode and an automatic mode to support reasoning and identify DNS Amplification Attacks. A graphic user interface is implemented to allow administrators to easily monitor network activity and analyze the large amount of UDP packets in real time. The interactive GUI also supports combination of the administrator’s knowledge, experience and judgment into the system.

#*Software Development for B92 Quantum Key Distribution Communication Protocol.
#@Shirantha Wijesekera,Sajal Palit,Bala Balachandran
#year2007
#confACIS-ICIS
#citation1
#index4871
#arnetid4873

#*Slice and Blockwise Well-Composed Sets.
#@Luke Domanski
#year2007
#confACIS-ICIS
#citation0
#index4872
#arnetid4874

#*Automated Speech Discrimination using Frequency Derivative Threshold Detection.
#@Christopher J. Page,Syed Mahfuzul Aziz
#year2007
#confACIS-ICIS
#citation-1
#index4873
#arnetid4875

#*Temperature Control for the Thermal Cycling of Polymerase Chain Reaction.
#@Jinhe Wang,Nan Zhang
#year2008
#confACIS-ICIS
#citation0
#index4874
#arnetid4876
#!DNA is a double-stranded chain of nucleotides, in order to make a huge number of copies of DNA segments, polymerase chain reaction (PCR) is the easy method for generating copies of DNA by rapid heating and cooling controlled automatically. Based on the properties of the thermal cycling of PCR, a rational approach for the temperature control of the PCR device is proposed, it consists of Feed-forward, Bang-bang and adaptive PID controller. The experimental results demonstrate that the proposed control method is more stable and efficient.

#*Performance Modeling of Business Processes Enabled by RFID and Web Services.
#@Chen-Yang Cheng,Vittal Prabhu
#year2007
#confACIS-ICIS
#citation3
#index4875
#arnetid4877

#*The GVF Snake with a Minimal Path Approach.
#@Chensheng Sun,Kin-Man Lam
#year2007
#confACIS-ICIS
#citation0
#index4876
#arnetid4878

#*Evaluation on Quantum Computation and Classic Parallel Approaches for Finding Estimation of the Length of Shortest Path in a Weighted Graph.
#@Mir Shahriar Emami,Mohammad Reza Fattahi,Hossein Keshmiri
#year2008
#confACIS-ICIS
#citation0
#index4877
#arnetid4879
#!In this paper we evaluate our presented Quantum Approach for finding the Estimation of the Length of the Shortest Path in a Connected Weighted Graph which is achieved with a polynomial time complexity about and as a result of evaluation we show that the Probability of Success of our presented Quantum Approach is increased if the Standard Deviation of the Length of all possible paths between Source and Target vertices is increased also we show that if the Standard Deviation is low nevertheless our Quantum Computation Approach is satisfactory and even the standard deviation is exactly zero the probability of Success of our Quantum Approach is not only zero but also is %100. Also we present a Classic Parallel Approach for finding the Estimation of the Length of the shortest path and then as a comparison between our Quantum Computation and Classic Parallel Approaches we show that even by applying the Classic Parallel Approach the problem can be solved with time complexity about.

#*Acoustic Features Extraction for Emotion Recognition.
#@Jia Rong,Yi-Ping Phoebe Chen,Morshed Chowdhury,Gang Li
#year2007
#confACIS-ICIS
#citation12
#index4878
#arnetid4880

#*P2P Distributed Intrusion Detections by Using Mobile Agents.
#@Dayong Ye,Quan Bai,Minjie Zhang,Zhen Ye
#year2008
#confACIS-ICIS
#citation4
#index4879
#arnetid4881
#!Traditional hierarchical intrusion detection systems have a central manager which attracts hackers to attack and might overload when there are too many client requests. To overcome these drawbacks, some researchers suggested to apply Peer-to-Peer approaches in intrusion detection. Most current Peer-to-Peer intrusion detection systems only allow hosts to collect related information from "neighbours" (one hop hosts). The limitation of information sources may lead a system to make inaccurate decisions. In this paper, we propose a Mobile Agent Based Peer-to-Peer Distributed Intrusion Detection Framework. Agents are included in this framework to achieve intrusion detections. In addition, a mobile agent migration strategy is applied in the framework to allow agents not only to collect information from direct-linked "neighbours" but also other hosts in the network. Benefitted from agent and Peer-to-Peer techniques, our framework can decrease the overhead of each host in the network, reduce the security risk, and achieve more accurate detections.

#*Optimization of QoS Routing.
#@Himanshu Agrawal,Melanie Grah,Mark Gregory
#year2007
#confACIS-ICIS
#citation1
#index4880
#arnetid4882

#*Rerouting Technique for Faster Restoration of Preempted Calls.
#@Iftekhar Ahmad,Joarder Kamruzzaman,Daryoush Habibi
#year2007
#confACIS-ICIS
#citation2
#index4881
#arnetid4883

#*Evolving Ensemble of Classifiers In Low-Dimensional Spaces Using Multi-Objective Evolutionary Approach.
#@Kushan Ahmadian,Abbas Golestani,Morteza Analoui,Mohammad R. Jahed
#year2007
#confACIS-ICIS
#citation7
#index4882
#arnetid4884

#*Efficient Probabilistic Spatio-Temporal Video Object Segmentation.
#@Rakib Ahmed,Gour C. Karmakar,Laurence S. Dooley
#year2007
#confACIS-ICIS
#citation0
#index4883
#arnetid4885

#*A Comparison of Bipartite N-Qubit States to Classify Entangled States under Symmetric Consideration.
#@Alauddin Ahmed,Atiqur Rahman,Mohammed Anwer,Nazmul Haque,Morshed U. Chowdhury
#year2007
#confACIS-ICIS
#citation0
#index4884
#arnetid4886

#*Two Logical Verification of Quantum NOT Gate.
#@Alauddin Ahmed,Atiqur Rahman,Mohammed Anwer,Nazmul Haque,Morshed U. Chowdhury
#year2007
#confACIS-ICIS
#citation0
#index4885
#arnetid4887

#*Managing Unstructured and Semi-Structured Information in Organisations.
#@Ashley M. Aitken
#year2007
#confACIS-ICIS
#citation2
#index4886
#arnetid4888

#*Efficient Complex Event Processing over RFID Data Stream.
#@Xingyi Jin,Xiaodong Lee,Ning Kong,Baoping Yan
#year2008
#confACIS-ICIS
#citation2
#index4887
#arnetid4889
#!RFID technology holds the promise of real-time identifying, locating and monitoring physical objects. To achieve these goals, RFID events need to be collected efficiently and composed expressively. Furthermore, these events have unique characteristics, such as locomotive, temporal and history oriented which should be considered and integrated into an event engine model. The diversity of RFID applications poses further challenges to a generalized framework for RFID events processing. In this paper, the Expressive Stream Language is utilized to collect vast number of primitive events efficiently. Moreover, we introduce a novel semantics to meet requirement of expressive event composition. At last, we use Timed Petri Net to model our newly RFID complex event engine. By introducing typical applications scenarios, we evaluate the validity and effectiveness of our RFID event processing system.

#*(t, lambda)-Uniqueness: Anonymity Management for Data Publication.
#@Qiong Wei,Yansheng Lu,Qiang Lou
#year2008
#confACIS-ICIS
#citation-1
#index4888
#arnetid4890

#*On the Dynamic Ant Colony Algorithm Optimization Based on Multi-pheromones.
#@Ya-mei Xia,Jun-liang Chen,Xiang-wu Meng
#year2008
#confACIS-ICIS
#citation5
#index4889
#arnetid4891
#!In this paper, an algorithm DACO (Dynamic Ant Colony Algorithm Optimization Based onMulti-pheromone) is put forward to apply to the dynamics of web services state and QoS in service composition optimization. Setting multiple pheromones to denote different QoS, this algorithm can apply to such conditions as service invalidation, service add, service QoS change, etc. The DACO is also improved based on experiment in order to make it better and faster converge to optimization value. Emulation experiment made in this paper shows that the DACO is more effective than Ant Colony Algorithm.

#*Dimensionality Reduction in Hyperbolic Data Spaces: Bounding Reconstructed-Information Loss.
#@Duc A. Tran,Khanh Vu
#year2008
#confACIS-ICIS
#citation0
#index4890
#arnetid4892
#!We have started to see non-Euclidean geometries used in many applications, including visualization, network measurement, and geometric routing. Therefore, we need new mechanisms for managing and exploring non-Euclidean data. In this paper, we specifically address the dimensionality reduction problem for Hyperbolic data that are represented by the Poincare Disk model. A desirable property of our solution is its reconstructed boundedness. In other words, we can reconstruct the data from its dimension-reduced version to obtain an approximation whose deviation from the original data is bounded and independent of the boundary measure of the original data space. We also propose a similarity search technique as an application of our reduction approach. We provide both theoretical and simulation analyses to substantiate the findings of our work.

#*Comparison between New Quantum Approaches for Finding the Minimum or the Maximum of an Unsorted Set of Integers.
#@Mir Shahriar Emami,Mohammad Reza Fattahi,Hossein Keshmiri
#year2008
#confACIS-ICIS
#citation0
#index4891
#arnetid4893
#!The change has already begun. It is not a simple change but a revolution in the sense of speed and its impact. In this paper we are going to discuss on Quantum Computer as a Physical System and discuss on its main weakness and then based on our new approach we have solved a problem for finding the minimum or the maximum of a set of integers which has not been solved based on previous Quantum Computing Approach with Time Complexity about and then we Evaluate and Comprise it with another Quantum Algorithm with Time Complexity about which also is given by us and as a result we show that if the size of Quantum Resister is low then our first Quantum Approach which has lower Time Complexity is satisfactory and if the size of Quantum Register is high then as the Probability of Success of our first Approach decreases so our Second Approach is more convenient.

#*Research and Application of Information Granulation Based on Extension Method.
#@Minghui Wang,Yongquan Yu,Bi Zeng
#year2008
#confACIS-ICIS
#citation-1
#index4892
#arnetid4894
#!Granular computing is an emerging conceptual and computing paradigm of information processing. Just as a great umbrella, it may be regarded as a label of theories, methodologies, techniques, and tools that make use of information granules. Extension set theory is a new computational method of knowledge resolution and the significance of attribute. Extension method can be used to describe the thinking process associated with both quantitative change and qualitative change. In this paper, we integrate granular computing with extension method. We utilize the extension method to solve some problems for communicating between information granular worlds. The communication procedures between information granular worlds based on extension method can be established, which is valuable and easy to implement in computer.

#*Mobile GUI Testing Tool based on Image Flow.
#@Oh-Hyun Kwon,Sun-Myung Hwang
#year2008
#confACIS-ICIS
#citation1
#index4893
#arnetid4895
#!GUI of mobile application software has been highlighted as elements in deciding whether or not success or failure of software itself. Since it becomes established as an important factor of software success, GUI test is required for the software success. But its test takes much efforts and time. Therefore, we propose a method and automatic tool for mobile GUI test.

#*The Utilization of User Sessions in Testing.
#@Izzat Alsmadi
#year2008
#confACIS-ICIS
#citation1
#index4894
#arnetid4896
#!Software testing cost is rising with the complexity of modern applications’ user interfaces, frameworks, and technologies. However, testing stays an import software engineering stage that insures the quality of the developed software and eventually reduces the overall cost. This paper proposed utilizing user sessions for test case generation and execution. User sessions can be gathered from the application in production environments and represent user stories or scenarios. Rather than rerunning user sessions for test automation, as in record/replay tools, this research takes the track of abstracting requirements from those sessions to make them independent of the scripting language or the tool that created them. The suggested approach abstracts user sessions to make them more independent and reusable. This approach is expected to improve the utilization of user sessions from being copied and reused in the same original format, which makes it complex to edit and inflexible, to a format that can be used and utilized in different applications and platforms.

#*Efficient Projection for Compressed Sensing.
#@Vo Dinh Minh Nhat,Duc Vo,Subhash Challa,Sungyoung Lee
#year2008
#confACIS-ICIS
#citation-1
#index4895
#arnetid4897
#!Compressed sensing (CS), a joint compression and sensing process, is a emerging field of activity in which the signal is sampled and simultaneously compressed at a greatly reduced rate. In CS, the projection matrix is chosen at random which would lead to inefficient performance of CS. Recently, an optimized projection (OP) was chosen such that it leads to better coherence of the effective dictionary, leading substantially better CS reconstruction performance. This is the only recent work related to the optimization of projection matrix, but the major drawback of this approach is that its algorithm is an iterative and high complexity one. It is considered that an efficient and lightweight algorithm for designing projection matrix would usefully supplement and enhance the performance of CS. In this paper, we propose an algorithm to obtain such an projection matrix called efficient projection (EP) which is designed in such a way that the new projected dictionary will have the structure as much similar as the original dictionary. For this purpose, we use Multidimensional Scaling (MDS) technique which helps to find a low-dimensional new projected dictionary such that the pairwise distances between new atoms in this new projected dictionary match as well as possible the original atoms in original dictionary. This leads to a solution for EP which is very simple and can be obtained by doing singular value decomposition of original dictionary. The experiments show the novelty of our approach when it can gain a comparative performance with a very low complexity compared to that of OP.

#*Optimizing Text Summarization Based on Fuzzy Logic.
#@Farshad Kyoomarsi,Hamid Khosravi,Esfandiar Eslami,Pooya Khosravyan Dehkordy,Asghar Tajoddin
#year2008
#confACIS-ICIS
#citation-1
#index4896
#arnetid4898
#!In this paper we first analyze some state of the art methods for text summarization. We discuss what the main disadvantages of these methods are and then propose a new method using fuzzy logic. Comparisons of results show that our method beats most methods which use machine learning as their core

#*A Genetic Algorithm for Finding Minimal Multi-homogeneous Bézout Number.
#@Dongshu Yan,Jintao Zhang,Bo Yu,Changtong Luo,Shaoliang Zhang
#year2008
#confACIS-ICIS
#citation-1
#index4897
#arnetid4899

#*A Mechanical Approach for Deriving Algorithmic Programs.
#@Haihe Shi,Jinyun Xue,Dawei Du
#year2008
#confACIS-ICIS
#citation0
#index4898
#arnetid4900
#!Formal algorithm derivation is valuable in ensuring resultant algorithm correctness, revealing ideas behind algorithm, and studying automatic algorithm design. An approach called mechanical partition-and-recur (MPAR for short) for deriving algorithmic program is presented. It is built on top of formal method PAR, and provides a series of strategies for mechanical algorithm derivation. Using MPAR, a given problem is partitioned into sub-problems mechanically, according to which the problem specification is transformed to seek the relation between the solutions of original problem and its sub-problems, and then the executable language program is produced automatically. MPAR makes as much work as possible be shifted from the algorithm designers, and thus enables the improvement of productivity and reliability of software.

#*Machine Learning Approach for Ontology Mapping Using Multiple Concept Similarity Measures.
#@Ryutaro Ichise
#year2008
#confACIS-ICIS
#citation8
#index4899
#arnetid4901
#!This paper presents a new framework for the ontology mapping problem. We organized the ontology mapping problem into a standard machine learning framework, which uses multiple concept similarity measures. We presented several concept similarity measures for the machine learning framework and conducted experiments for testing the framework using real-world data. Our experimental results show that our approach has increased performance with respect to precision, recall and F-measure in comparison with other methods.

#*Execution Time Analysis of a Parallel Steiner Tree Algorithm on Server-Client Model of Computation.
#@Rashid Bin Muhammad
#year2008
#confACIS-ICIS
#citation-1
#index4900
#arnetid4902
#!This paper presents the computational analysis and simulation of the parallel Steiner tree problem on the client-sever model of computation. In particular, this work analyzes the time delays among server and clients, presents an algorithm for an event-driven simulation of Steiner tree problem on server-client model, and examines some consequences of time delays on the execution time. In addition, the paper calculates the expression for the optimal number of client processors required by the parallel algorithm for optimal efficiency. The compact mathematical expressions can be use confidently to simulate or implement parallel Steiner tree on the server-client model of computation.

#*Web Page Dependent Vision Based Segementation for Web Sites.
#@Pyungkwan Ko,Sanggil Kang,Harshit Kumar
#year2008
#confACIS-ICIS
#citation1
#index4901
#arnetid4903
#!We introduce a web page segmentation system through mobile device. By providing segmented web pages service, the problem of the limitation of resource of mobile devices can be solved. In this paper, we propose a method that conflates DOM Based and vision based segmentation technique which improved an existing vison based web page segmentation.

#*A New Negotiation Mechanism for Agent-Based Lecture Allocation Systems.
#@Yoshihito Saito,Takayuki Fujimoto,Tokuro Matsuo
#year2008
#confACIS-ICIS
#citation0
#index4902
#arnetid4904
#!Elective Subject is one of important issues as education program in University. Students can declare their preferences directly by selecting it. In most of university, to allocate elective subjects to the students, university staffs poll students the lectures they want to take. However, due to the limitation of time and number of staffs, the hearing investigation includes the reason and the intention in which students select the lectures. Some students sometimes take a lecture for their career, for academical interest, and for assimilation of knowledge. However, some students might take the lecture following the crowd and take the lecture as Mickey Mouse. The latter case is undesirable for the higher education. To solve the problem, in this paper, we propose a new multi-step lecture allocation method based on students preferences and university intentions. Our protocol has three steps. (1) University warns students who must take a certain lecture to graduate and get a license. (2) Using students preferences, lectures are allocated. (3) Students exchange lectures to increase their intentions and utilities. Our protocol realizes the high performance of allocation compared with brute force algorithm and reducing computational costs compared with optimizations.

#*Gauging the OpenSourceMark Benchmark in Measuring CPU Performance.
#@Fadi N. Sibai
#year2008
#confACIS-ICIS
#citation0
#index4903
#arnetid4905
#!We analyze COSBI’s Open Source Mark (OSMark) benchmark [1] in measuring CPU performance in desktop personal computers. We select and focus on selected tests of the benchmark targeting the CPU which we also profile. We run the benchmark on two personal computers with single and dual cores. We then collect performance event counts for the selected tests to characterize the benchmark’s workload and we correlate the performance event counts with the CPI. The results reveal that although this benchmark provides a nice and convenient alternative to existing commercial benchmarks [2-7], it falls behind in total instruction coverage and application coverage, and does not stress enough multi-core processors as well as competing benchmarks.

#*Quantitative Process Improvement in XP Using Six Sigma Tools.
#@Sajid Ibrahim Hashmi,Jongmoon Baik
#year2008
#confACIS-ICIS
#citation0
#index4904
#arnetid4906
#!XP (eXtreme Programming) has been used for reducing defects and dealing with changing customer requirements effectively. It has been well known for its defect reduction capability. But, software can be made more reliable by means of process improvement. In general, models like CMM/CMMI have been used for software development process improvement. However, these models have some problems to be used with XP because of less number of process artifacts produced by agile processes. Six Sigma on the other hand, provides the quantitative analysis capabilities required to measure and control process performance. Using XP with Six Sigma can provide means of analyzing XP data and systematically improve process performance. In order to prove our point, we map Six Sigma tools to activities involved at each phase of XP and show that Six Sigma technique can be used with XP to measure and improve the performance of XP process. We also suggest a Six Sigma process improvement guideline with examples.

#*An Empirical Analysis of Intel Thread Checker for Detecting Races in OpenMP Programs.
#@Young-Joo Kim,Daeyoung Kim,Yong-Kee Jun
#year2008
#confACIS-ICIS
#citation2
#index4905
#arnetid4907
#!Races in OpenMP programs must be detected because they may cause unintended nondeterministic results of programs. The Intel Thread Checker can detect the races occurred in an execution of OpenMP program, but it has not been analyzed on the limitation of its power for race detection in OpenMP programs.This paper empirically analyzes the functionality and performance of Thread Checker using a set of multithreaded synthetic programs. We have found that Thread Checker can not verify the existence of races in an execution of OpenMP program, and show that the ratio of the required time for race detection is dependent on the number of total accesses to shared variables in parallel section programs, but not in parallel loop programs.

#*Designing Fault Tolerant Web Services Using BPEL.
#@Jim Lau,Lau Cheuk Lung,Joni da Silva Fraga,Giuliana Santos Veronese
#year2008
#confACIS-ICIS
#citation2
#index4906
#arnetid4908
#!The web services technology provides an approach for developing distributed applications by using simple and well defined interfaces. Due to the flexibility of this architecture, it is possible to compose business processes integrating services from different domains. This paper presents an approach, which uses the specification of services orchestration, in order to create a fault tolerant model combining active and passive replication technique. This model support fault of crash. The characteristics and the results obtained by implementing this model are described along this paper.

#*Recovering Variable-Argument Functions from Binary Executables.
#@Wen Fu,Rongcai Zhao,Jianmin Pang,Jingbo Zhang
#year2008
#confACIS-ICIS
#citation0
#index4907
#arnetid4909
#!Variable-argument functions, such as printf(), are broadly used in C programs because of its flexible usage of pointers. However, the recovery of such a function from a binary executable is not an easy task in the field of reverse compilation. The first problem is how to distinguish a variable-argument function from other functions in binary code. The second is how to implement avariable-argument function in a target program. The aim of this paper is to deal with these problems for IA-64 binary executables. We analyzed a large number of is assembled C programs to see how to implement variable-argument functions in machine code. According to calling conventions on IA-64/Linux platform, we abstracted some instruction patterns to recognize variable-argument functions from binary executables. Besides that, we put forward a normalization method to recover variable-argumentlists. We use an example compiled by GCC with -O0 option for demonstration, but our methods are not limited to any particular compiler and compiling option.

#*Verification of Unstructured Workflows via Propositional Logic.
#@Qianhui Althea Liang,J. Leon Zhao
#year2008
#confACIS-ICIS
#citation4
#index4908
#arnetid4910
#!The concept of unstructured workflows is useful for both research and practical purposes. While sometimes it is preferable to transform unstructured workflows into structured ones, unstructured workflows may be more meaningful to business people. Furthermore, transformation from unstructured to structured workflows may be troublesome at times. As such, it is important to be able to verify unstructured workflows directly. In this paper, we take a different perspective by focusing on the verification of unstructured workflows using a propositional-logic-based approach. We demonstrate that logic-based verification can derive similar results between an unstructured workflow and its corresponding structured workflow. We further develop a conceptual framework that characterizes the propositional logic approach to verification of unstructured workflows.

#*A Parallel Algorithm for Closed Cube Computation.
#@Jinguo You,Jianqing Xi,Pingjian Zhang,Hu Chen
#year2008
#confACIS-ICIS
#citation2
#index4909
#arnetid4911
#!Closed cubing is a very efficient algorithm for data cube compression proposed recently in the literature. It losslessly condenses a group of cells into one cell if these cells have the same aggregate value and preserve roll-up/drill-down semantics. Despite its importance, parallel closed cubing solutions for huge data sets are not well studied so far to the best of the authors’ knowledge. This paper presents a parallel closed cube construction and query algorithm over low cost PC clusters using the MapReduce framework. In addition, we proved that with the number of data blocks increases, the closed cubes’ storage size decreases gradually. Thus users can specify the number of data blocks to balance the performance between cubes storage and query time. Experimental study demonstrates that our algorithm is efficient and scalable.

#*Manual Specific Testing and Quality Evaluation for Embedded Software.
#@Seon-Jae Jang,Hae-Geun Kim,Youn-ky Chung
#year2008
#confACIS-ICIS
#citation0
#index4910
#arnetid4912
#!Higher performance for embedded software with the intent of decreasing cost of hardware made widespread and development of hardware. Higher performance makes embedded software more complex, but to satisfy user demands and that of time-to-market, it has to be developed fast and achieve quality. Testing is the most important factor in embedded software development. Increasing complexity of the embedded system makes difficult to test manually and properly evaluate quality. This made automated testing becoming popular and in turn decline of manual testing. Because of the characteristics of embedded software, automated testing has difficulty performing all relevant tests and evaluation of the areas of concern. Manual testing of embedded software is affective in these areas and can directly affect quality of software. To properly test software manually it is necessary to have the proper testing procedures and personnel along with a well defined description of the system. In this paper we propose a manual testing mechanism that is more structured, effective and will improve quality of embedded software. We describe the model which is based on the existing problem of manual testing and analysis requirements. The model and technique we propose will make testing on software and related hardware areas more effective, and the way to share the testing experience and using quality evaluation.

#*Coordination Behavioral Structure: A Web Services Coordination Model in Dynamic Environment.
#@Yongwang Zhao,Dianfu Ma,Min Liu,Chunyang Hu
#year2008
#confACIS-ICIS
#citation1
#index4911
#arnetid4913
#!The ability to describe the coordinative behavior of interacting web services is key aspect in the development of next generation internet software systems. In this paper, a layered architecture for coordination system is introduced. Based on coordination structure that presents the basic architecture of coordination system, we propose a web services coordination model, Coordination Behavioral Structure (CBS), which formalize the services interactions and their relationships. CBS expresses the coordinative behaviors of a coordination structure. CBS graph constructed by relationships of interactions using basic and extended compositors is proposed for visual description of coordination behaviors. For illustrating CBS, an example and CBS of basic coordination structures are presented.

#*Research of English-Chinese Alignment at Word Granularity on Parallel Corpora.
#@Yang Xu,Houfeng Wang,Xue-qiang Lü
#year2008
#confACIS-ICIS
#citation0
#index4912
#arnetid4914
#!Bilingual alignment is a crucial problem in the research of natural language processing, and word alignment is a nodus among all granularities of alignment. This paper describes an English-Chinese word alignment model based on a bilingual lexicon and some language knowledge, which works on bilingual corpora. The model is built on the theory of formal optimal partition of the bilingual sentence pairs, and is ubiquitous to sentences pairs of any natural language. Particularly, we obtain some alignment strategies which are independent to alignment direction by denoting some definitions and proving a theorem. The model deals with part-matching cases, solves multi-appear-word problems and remedies the deficiency of bilingual lexicon. The experimental results show that the model can align bilingual corpora at word level effectively with a high accuracy, and maintain the grammar structure of the original sentences at the same time.

#*Queuing Network Performance Model for Evaluation of CMP-Based VoIP SPS.
#@Jiuzhen Jin,Jianmin Pang,Zheng Shan,Rongcai Zhao
#year2008
#confACIS-ICIS
#citation1
#index4913
#arnetid4915
#!In this paper we describe our experience in performance evaluation of CMP-based VoIP SPS (signaling parse system). We also present a performance model of the system using GI/G/m-FCFS multi-class open QNs(queuing networks). And deal with approximate performance analysis of open non-product-form QNs, based on the method of decomposition. Our approach predicts the major performance evaluation parameters of the system under the workloads and also identifies bottlenecks in the system. Performance results are inserted back into the QN model as initial values associated to the relevant model elements. The theoretical estimates are shown to be in excellent consistence with testing results. It shows the effectiveness of the proposed model. This work explores performance issues of CMP-based applications by means of performance modeling. In this way we may get an immediate feedback on the system performances. The use of QN model allows us to achieve better multi-core application performance.

#*Generating Algorithms plus Loop Invariants by Formal Derivation.
#@Haihe Shi,Dawei Du,Jinyun Xue
#year2008
#confACIS-ICIS
#citation0
#index4914
#arnetid4916
#!We advocate a mechanical derivation approach for developing provably correct algorithmic programs. The paper presents our new formal methods and techniques for generating algorithms plus loop invariants. Through our methods and techniques, the ideas behind MergeSort algorithm is revealed naturally from a formal specification, and then its loop invariant and nonrecursive algorithmic solution are generated mechanically. Furthermore, instead of fresh formal derivation, the Insertion Sort is easily achieved based on the derivation of MergeSort. By means of our tools their executable language programs can be generated automatically. Therefore mathematical knowledge required by formal development process is reduced substantially and the confidence in the resultant code is increased.

#*An Adaptive Index of XML for Frequent Branching Path Queries.
#@Yingjie Fan,Chenghong Zhang,Shuyun Wang,Xiulan Hao,Yunfa Hu
#year2008
#confACIS-ICIS
#citation0
#index4915
#arnetid4917
#!Structural index, which acts as a structural summary, plays an important role in query optimization over XML and semi-structured data. To speed up branching path queries, we introduce the notion of k-l-bisimilarity into M(k)-index and propose an adaptive structural index, MBF(k, l)-index, which supports branching paths with any complexity efficiently and inherits the advantage of avoiding over-refinement from M(k)-index. Our experiments have shown that the index performs more efficiently in terms of space consumption and query performance for branching or simple paths in comparison with the same kind of indexes.

#*An Integer Linear Programming Approach for Dedicated Machine Constraint.
#@Huy Nguyen Anh Pham,Arthur M. D. Shr,Peter P. Chen
#year2008
#confACIS-ICIS
#citation2
#index4916
#arnetid4918
#!Dedicated machine constraint is one of the new challenges introduced in photolithography machinery of the semiconductor manufacturing system due to natural bias. Previous researches either did not take the constraint into account or the proposed heuristic approach might not fit the fast-changing market of semiconductor manufacturing. In this paper, we propose a new framework for the issue of the dedicated machine constraint in semiconductor manufacturing based on an Integer Linear Program (ILP) framework. The ILP framework provides an efficient approach to minimize the producing cost and obtain a global optimal solution in an efficient time. We also present the experiments to validate the proposed approach.

#*A Rate Control Protocol for High Speed Streaming Video.
#@Xiaogang Yang,Baosong Shan,Yaping Yang
#year2008
#confACIS-ICIS
#citation-1
#index4917
#arnetid4919
#!In this paper, we propose a rate control for high speed streaming video, which is based on scalable TCP and TEAR. Scalable TCP offers an effective and robust mechanism for bulk data transmitting in high bandwidth-delay network. However it has a big rate oscillation when transmitting video data. TEAR is a rate control protocol that emulates TCP at receivers, which is suitable for streaming video, and however it is TCP friendly and keeps the same low utilization as TCP in high-speed network environment. RDSTCP adopts TEAR idea, emulates scalable TCP at receiver. RDSTCP shifts most functions of scalable TCP to the receiver, and reduces the rate oscillation as well as keeping high link utilization. In the end, we emulate and evaluate RDSTCP performance by using NS2.

#*Schema Versioning in Multi-temporal XML Databases.
#@Zouhaier Brahmia,Rafik Bouaziz
#year2008
#confACIS-ICIS
#citation3
#index4918
#arnetid4920
#!Schema evolution keeps only the current data and the schema version after applying schema changes. On the contrary, schema versioning creates new schema versions and preserves old schema versions and their corresponding data. Much research work has recently focused on the problem of schema evolution in XML databases, but less attention has been devoted to schema versioning in such databases. In this paper, we present an approach for schema versioning in multi-temporal XML databases. This approach is based on the XML Schema language for describing XML schema, and is database consistency-preserving.

#*A New Approach on Interactive SOA Security Model Based on Automata.
#@Hamidreza Amouzegar,Shahriar Mohammadi,Mohammad Jafar Tarokh,Anahita Naghilouye Hidaji
#year2008
#confACIS-ICIS
#citation0
#index4919
#arnetid4921
#!Service oriented architecture is a new important approach for all electronic devices and applications such as e-payment systems. Statelessness of basic service architecture model is based on four principles: loose coupling, abstraction, autonomy, and security. Statelessness eliminates a lot of benefits in service providing. This paper presents Automata-Based model for interactive services and focuses on security for interactive SOA in state-full environments. The purpose of this paper is to propose a new extended solution for e-applications to communicate simpler while session management is been done by server helps the client to have better development and interaction.

#*Static Analysis of the Disassembly against Malicious Code Obfuscated with Conditional Jumps.
#@Chao Dai,Jianmin Pang,Rongcai Zhao,Xiaojun Ma
#year2008
#confACIS-ICIS
#citation0
#index4920
#arnetid4922
#!With the application of information technology and network, malicious codes have become a main threat to the computer security. In order to avoid being analyzed statically, malicious codes resort to various obfuscation techniques to hide themselves. Conditional jumps obfuscation is just such a kind of technique. In this paper, we introduce four forms of conditional jumps obfuscation which could confuse both of the two commonly used disassembly algorithms. Their basic idea is that two elaborate constructed conditional jump instructions are semantically equivalent to one unconditional jump. We propose a modified algorithm to crack the obfuscation. And we implement our idea in our reverse analysis tool Radux (Reverse Analysis for Detecting Unsafe eXecutables). Last we compare the disassembly output of Radux with objdump and IDApro. Relevant tests show that our implementation is effective.

#*Reconstructing Control Flow in Modulo Scheduled Loops.
#@Miao Wang,Rongcai Zhao,Jianmin Pang,Guoming Cai
#year2008
#confACIS-ICIS
#citation0
#index4921
#arnetid4923
#!Software pipelining is a loop optimization technique used to exploit instruction level parallelism in the loop. EPICarchitectures, such as Intel IA-64 (Itanium) provide extensive hardware support for software pipelining to generate compact and highly parallel code. However it transforms explicit conditional branches into implicit control flow based on the information of the guard registers. It is difficult to reconstruct precisecontrol flow from the optimized code. This paper describes an approach to reconstruct implicit control flow in modulo scheduled loops and thereby improve the quality of reverse engineering optimized executables. We also demonstrate the effectiveness of this approach through experiment results.

#*Sensor Data Collection of the Single Location Surveillance Point System.
#@Tomi Räty,Johannes Oikarinen,Mikko Nieminen,Mikko Lindholm
#year2008
#confACIS-ICIS
#citation-1
#index4922
#arnetid4924
#!The Single Location Surveillance Point (SLSP) is a distributed multi-sensor surveillance software system. It contains an arbitrary amount of sensors that collect readings from a single location, which is the surveillance point. The SLSP system contains the following realized sensors: a fingerprint sensor, a video camera, an audio sensor, and a network analyzing monitor. The sensors are located in an indoor region. Each sensor automatically collects information from its environment. Each sensor automatically routes its crude sensor data to a session server, which handles the connections among the components. The session server conveys the crude sensor data to the logical decision making service. The logical decision making server (LDMS) automatically derives the situation at the surveillance point based on the received sensor data. The intention is to deduct the situation which is transpiring in the surveyed area based on the received crude data from the sensors. By deriving the situation of a surveyed area, the surveillance personnel may utilize refined information cogent to occurring events of the surveyed area. This branch of the SLSP intends to facilitate the collection of data from a surveillance point and decrement the amount of superfluous information and rendered to the surveillance personnel, by acquiring automatically sensor data and providing automatically derived information to the surveillance personnel’s end-device. The operability of the constructed prototype indicates that this endeavor is attained. The research is based on the constructive method of the related publications and technologies and the results are derived by the implemented branch of the SLSP system.

#*Finite-State Modeling and Testing of Image Based Authentication System.
#@Nitin,Durg Singh Chauhan,Vivek Kumar Sehgal,Ankit Mahanot,Pallavi Singh,Sohit Ahuja,Utkarsh Shrivastava,Manisha Rana,Vineet Punjabi,Shivam Vinay,Nakul Sharma
#year2008
#confACIS-ICIS
#citation-1
#index4923
#arnetid4925
#!Secure environments protect their resources against unauthorized access by enforcing access control mechanisms. So when increasing security is an issue text based passwords are not enough to counter such problems. This is where Image Based Authentication (IBA) comes into play. IBA enhances the security level in an exceptionally user friendly way. This paper is a comprehensive study and comparison of proposed Jaypee University of Information Technology–IBA System with the University of Florida–IBA System on the subject of using images as the password set. Furthermore the paper introduces a holistic view of Completed Finite State Automation (CFSA) modeling that can be carried out as a complementary step to system modeling, enabling a precise scalability of the test process, revealing much rationalization potential. Finite-state based notions enable to introduce efficient algorithms to generate Legal Interaction Pairs (IPs), Faulty Interaction Pairs, and Regular Expression (RegEx).

#*On-Line Network Reachability Analysis Using Forward Information Base Emulation.
#@Young Dae Kim,Chan Kyou Hwang,Jae-Hyoung Yoo
#year2008
#confACIS-ICIS
#citation0
#index4924
#arnetid4926
#!This paper presents a new approach of routing protocol management as a first step towards the conception of on-line network reachability analysis. Each individual router has an FIB (Forwarding Information Base), which is a table containing the information required to forward IP packets, which is used for packet delivery. At a minimum, FIB contains the interface identifier and the next hop information for each reachable destination. If it is possible to emulate the FIBs of on-line routers in service, network reachability could be simulated in real time. ‘A destination is reachable’ indicates that the FIB lookup from its source to the destination is successful. This simulation will make it unnecessary to model FIBs and a lookup mechanism, or to analyze the routing information filtering. In this paper, a mean of FIB emulation and network reachability simulation through the analysis of routing information are shown. This method is valuable, both for network users and operators.

#*Exponential Integral Methods for Burgers Equation.
#@Jing-jun Zhao,Shu-xin Bao,Yu Li
#year2008
#confACIS-ICIS
#citation0
#index4925
#arnetid4927
#!This paper is concerned with the quasi-linear Burgers equation by using the exponential integral methods. Spatial discretization of this kind of partial differential equations leads to a system of ordinary differential equations, which can be solved by the numerical methods. Furthermore, numerical results show that the exponential integral method has explicit stability, and has the same accuracy as the corresponding Runge-Kutta method.

#*Design and Implementation of Wireless Sensor Network for Ubiquitous Glass Houses.
#@Meong-hun Lee,Ki-bok Eom,Hyun-joong Kang,Chang-Sun Shin,Hyun Yoe
#year2008
#confACIS-ICIS
#citation6
#index4926
#arnetid4928
#!Recently, there are many researches to enable future ubiquitous environments based on Wireless Sensor Network (WSN). Various sensing devices deployed in wireless sensor network collect meaningful data from physical environments and the data are delivered to neighbor node through radio interfaces for further processing. The representative application in WSN is a data collecting system, which monitors physical phenomena and gathers data around our life. In this system, sensor nodes can be considered as a kind of database and hosts connected to the Internet, in most cases, initiate some queries destined to WSN and collect query responses from WSN. In this study, the efficient use of limited energy efficiently for the WSN based large scale glass houses was researched. We designed an integration method which was based on WSN Gateway which integrated two different networks efficiently. To realize the proposed design, we implemented an efficient routing method and WSN Gateway in the wired and wireless integrated networks in ubiquitous glass houses.

#*Convergence Analysis of Jacobi Iterative Method Using Logarithmic Number System.
#@Peng Huang,Daniel H.-Y. Teng,Khan Wahid,Seok-Bum Ko
#year2008
#confACIS-ICIS
#citation2
#index4927
#arnetid4929
#!This paper presents convergence analysis of Jacobi iterative method using logarithmic number system (LNS) for solving linear systems, where multiplications and divisions are replaced with additions and subtractions, respectively. Two major factors are identified and considered in our convergence analysis. First, in any hardware architecture for Jacobi iterative method, only a set of unknowns can be processed in parallel due to the constraint of hardware resources. Secondly, the conversions of ogarithm-to-floating point and floating-to-logarithm introduce additional error. The convergence analysis demonstrates to what extent the hardware resource constraints and additional conversion error affect the convergence of Jacobi iterative method.

#*Issues and Models of Security Oriented Systems.
#@C. V. Ramamoorthy
#year2008
#confACIS-ICIS
#citation0
#index4928
#arnetid4930
#!Virus infestation is rampant in today’s internet based IT activities. The viruses (including worms, and Trojan Horses) are constantly and rapidly created to damage e=commerce and web based application. Importantly, they corrupt communications, valuable databases and disrupt service oriented functions. In the future, they can severely hurt the new applications spanning from health care to home appliance control. We shall present a broad discussion on a few mostlysoftware engineering topics, pointing out their relevance and relationship to IT security issues.

#*Cross-Channel Customer Mapping.
#@Jayanta Basak,Sunil Goyal
#year2008
#confACIS-ICIS
#citation1
#index4929
#arnetid4931
#!In multi-channel setting (for example, web channel and storefront), one often is required to generate an integrated view of customers across channels for making better CRM, marketing and merchandizing decisions. It is essential to identify a customer uniquely across channels to generate an integrated customer view. It is often not feasible to impose a unique identifier on a customer across channels. Moreover, a customer may not provide true demographic information, making it even more difficult to track. In the absence of a unique identifier and correct demographic information, the behavioral signature of a customer can perhaps be used to track customer across channels (cross-channel customer mapping) where behavioral signature comprises of the channel-independent behavioral characteristics. We define certain channel-independent behavioral characteristics that are easily computable and adaptable with incremental information gain. We then provide algorithms to match behavioral signatures across channels. We demonstrate our methodology using 'Safeway' data, where we achieved significant accuracy, for example, over 90% for the high value customers.

#*A Fast and Accurate Iris Recognition Method Using the Complex Inversion Map and 2DPCA.
#@Sepehr Attarchi,Karim Faez,Amin Asghari
#year2008
#confACIS-ICIS
#citation5
#index4930
#arnetid4932
#!Iris recognition is one of the most reliable biometric technologies. In this paper, we presented a novel method for iris recognition, using a complex mapping procedure and best-fitting line for the iris segmentation and 1D Gabor filter with 2DPCA for the recognition approach. We used an intensity threshold method with Canny edge detector to extract the rough region of the pupil. For the outer boundary a median filter with prewitt compass edge detector were used to localize the rough region of the outer boundary. By selecting the bottom point of the pupil (which is not usually occluded by the eyelids and eyelashes) as a reference point, two sets of intersecting points between the horizontal lines and pupil’s inner and outer boundaries were created. Each point set was map into a new complex domain using the complex inversion map function and the best-fitting line was found on the range. Exact inner and outer boundaries of the iris were found by remapping the best-fitting lines to original domain. In the recognition procedure, we used the real term of 1D Gabor filter. In order to reduce the dimensionality of the extracted features, the new introduced 2DPCA method was used. We tested our proposed algorithm by implementing a ground truth method. Experimental results show that the proposed method has an encouraging performance in both segmentation and recognition approaches.

#*Research Process Support with Organizational Flow in e-Science.
#@Dukyun Nam,June Hawk Lee,Soonwook Hwang,Young-Kyoon Suh,Byungsang Kim
#year2008
#confACIS-ICIS
#citation0
#index4931
#arnetid4933
#!To utilize an e-Science application service which is built on a grid computing environment efficiently, it is vital to develop technologies for integrating each e-Science application service into a workflow and to execute the workflow in a cooperative environment. In this paper, the required workflow in e-Science is analyzed using a conceptual scenario and categorized into three types of workflows: simulations, experiments, and collaborative work. Additionally, the workflow of the aerospace research community, an e-Science environment is shown. The necessary applications and functionalities for the required workflow are then proposed.

#*Monitoring Software Projects with Earned Value Analysis and Use Case Point.
#@Jinhua Li,Zhibing Ma,Huanzhen Dong
#year2008
#confACIS-ICIS
#citation0
#index4932
#arnetid4934
#!The earned value analysis (EVA) is a project management method for controlling project progress. Two problems cause the difficulty in applying the method on software projects. The first problem is how to consistently express project baselines and to measure technical progress of software projects. The second is due to the conventional Work Breakdown Structure that is prematurely structured around the product cannot reflect the software changes in the development. After discussing the issues and solutions for using EVA on software projects, the paper presents an evolutionary WBS focusing on the elements of software processes, and describes the adoption of use case points as software project baselines and performance measurement. An approach to monitoring software project progress with EVA and use case points is presented. A controlled experiment is described which shows the usefulness and effectiveness of the EVA method for tracking and controlling schedule and costs in software projects.

#*Parallel Sorting on the Biswapped Network.
#@Wenhong Wei,Wenjun Xiao,Zhen Zhang
#year2008
#confACIS-ICIS
#citation2
#index4933
#arnetid4935
#!Biswapped network (BSN) is a recently proposed network model of parallel computing, which is built of 2n copies of an n-node basic network, and its basic network may be hypercube, mesh and other networks, hence we can construct BSN-Hypercube and BSN-Mesh by using hypercube and mesh as basic network. BSN uses a simple rule for connectivity to ensure its regularity and some topological properties of BSN have been investigated. In this paper, we present sorting algorithm on the n processors BSN whose basic network has Hamiltonian path, and if the basic network of BSN is mesh, sorting n unordered elements will complete in time (2n)^1(1/2)+O(n^(3/4)).

#*Mobile Mapping Service Using Scalable Vector Graphics on the Human Geographic.
#@Jin-Suk Kang,Yonghee You,Mee Young Sung,Taikyeong T. Jeong,Jong-An Park
#year2008
#confACIS-ICIS
#citation0
#index4934
#arnetid4936
#!Mobile and wireless technologies have evolved rapidly in recent years, especially the development of hardware devices, such as PDA and Smartphone. Telecommunication service providers, manufacturers and other developers have launch-ed different kinds of services and applications in these mobile devices. Mobile Geographic Information and Location Based Service appear recently to help people to establish spatial relationship with the surroundings. Map, which is a useful tool to assist a person to define a position in a particular area, is usually included in these systems. However, there is no standard format of graphic presentation for map in mobile devices. In this paper, the effective method was suggested for the transmission of the geographic information acquired by camera attached to a PDA such as position data, attitude data, and image data in the wireless internet environment in real-time.

#*Autonomic Computing in SQL Server.
#@Abdul Mateen,Basit Raza,Tauqeer Hussain,Mian M. Awais
#year2008
#confACIS-ICIS
#citation8
#index4935
#arnetid4937
#!With the growing size of enterprise data, the task of managing a database is becoming more and more complex as well as time-consuming. A database administrator spends most of his time in activities that can be made automatic. Also, scarcity of skilled database administrators have motivated the database industry to develop Autonomic Database Management Systems (ADBMS) which can alleviate many of the database administrators’ problems. These ADBMS may have one or more autonomic properties. In this paper, autonomic characteristics of Microsoft SQL Server are presented and analyzed to illustrate how self-managing behaviour of an ADBMS can reduce the workload of a DBA significantly. It has also been discussed which components of SQL Server are not fully autonomic and require Human Intervention. This provides the motivation for devising algorithms to further reduce the degree of human intervention still required in ADBMS.

#*An Effective Data Classification Algorithm Based on the Decision Table Grid.
#@Hongjie Liu,Boqin Feng,Jianjie Wei
#year2008
#confACIS-ICIS
#citation1
#index4936
#arnetid4938
#!In order to overcome the disadvantages that the traditional k-Nearest Neighbor classification technique makes inadquate use of distribution characteristics of homegeneous data, and that it is of slow speed and low efficiency, an effective data classification algorithm based on the decision table grid is presented. The main process is to construct the corresponding decision table after discretizing training samples, to map the training samples to the corresponding grid based on the decision condition, and to map the samples to be classified to the corresponding grid, then to judge the classification of the samples by the given principle. The algorithm can quickly classify the samples to be classified and can improve the precision as well. Experiments show that it has good effect, being more suitable for high dimension data classification and capable of dealing with the training samples with many classes.

#*Synchronizer - A Web-Based Application to Enhance Capabilities of NEESCentral Web Portal.
#@Thuy T. Le,Syeda Naema Hashmi,Kurt McMullin
#year2008
#confACIS-ICIS
#citation1
#index4937
#arnetid4939
#!This paper discusses the development of a web-based application named Synchronizer to enhance the capability of the NEESCentral Web Portal. The NEESCentral Web Portal is a cyberinfrastructure tool available to all NEES participants and is designed to provide a simple way for researchers to share and archive their project data with NEES Repository. Synchronizer has been developed to assist multi-member projects in organizing and sharing local data with NEES Data Repository frequently. Synchronizer allows project members to connect to NEES Data Repository to download and upload data in bulk where the application automatically checks for updated files with options to replace, rename, or to keep them all. The application also allows the project administrator to put different restrictions on each project member in accessing the files and sub-directories. Synchronizer uses Mozilla Fire Fox for obtaining “GAsession ID” cookie and Internet Explorer for executing the application. The code has been developed with HTML embedded scripting language PHP, MySql open-source database, Microsoft Window Software Development Kit (Microsoft Platform SDK), GNU Wget, and Adobe Macromedia Dreamweaver web design and development tool. Users from the Pathways project have given Synchronizer very good comments.

#*An Efficient Approach for QoS-Aware Service Selection Based on a Tree-Based Algorithm.
#@Minhyuk Oh,Jongmoon Baik,Sungwon Kang,Ho-Jin Choi
#year2008
#confACIS-ICIS
#citation1
#index4938
#arnetid4940
#!Service Oriented Architecture (SOA) has become a new software development paradigm because it provides a flexible framework that can help reduce development cost and time. SOA also promises loosely coupled, interoperable, and composable services. In order to maximize these benefits, many researchers have focused on service composition techniques, especially in terms of providing quality of services (QoS) to consumers in a dynamic environment. In current literature, many approaches, such as the Genetic Algorithm, Integer Programming, and the Pinsinger Algorithm approaches, have been proposed for service compositions to provide quality of services to consumers. However, these approaches are inefficient when any problem occurs during service executions since the problem causes the current execution stop, and service rebinding is required for the unexecuted path. In addition, even if a better service is discovered, it cannot be easily replaced in these approaches because replacing a single service causes a problem on global QoS constraints. In this paper, we focus on these problems by proposing a tree-based algorithm in order to provide optimal services to consumers consistently and efficiently even when the status of selected services have changed. As a result, consumers can always use the optimal services of high qualities.

#*Ensemble Methods for Ontology Learning - An Empirical Experiment to Evaluate Combinations of Concept Acquisition Techniques.
#@Ricardo Gacitua,Peter Sawyer
#year2008
#confACIS-ICIS
#citation4
#index4939
#arnetid4941
#!Most approaches to ontology learning combine techniques from different areas (hybrid approaches) to increase the efficiency of the ontology learning process. However, the results from the ontology learning process do not fully satisfy the users at present. An important problem is that there is a lack of quantitative and comparative data about the efficiency of techniques and technique combinations applied to ontology learning. Combination methods are an effective way of improving system performance, but there is not enough information about how to use, configure and combine techniques from a diverse spectrum of fields, and what the contribution of a specific technique or technique combination. In this paper we present a quantitative comparison of technique combinations for concept extraction and a software system (OntoLancs) to support the evaluation of techniques. By applying OntoLancs, users are able to assist the process of building ontologies by semi-automatically acquiring concepts from large-scale domain document collections and experiment with different combinations of knowledge acquisition techniques to refine and organize domain concepts into a taxonomy. Quantitative and comparative studies about the performance of several techniques and user experiences indicate the applicability and usefulness of our approach.

#*Two-Dimensional Framework for Analyzing Variabilities in Software Product Lines.
#@Mikyeong Moon,Heung Seok Chae,Junseok Park,Keunhyuk Yeom
#year2008
#confACIS-ICIS
#citation0
#index4940
#arnetid4942
#!Commonality and variability play central roles in all product line development processes. Indeed, at each phase of core assets development, variabilities can exist at different levels of abstraction and in addition can be concretized by different artifacts. In this paper, we suggest a 2-dimensional framework for analyzing variabilities of core assets in software product lines. In the vertical analysis, variations are analyzed at different abstract levels, in which the region of commonality is first identified, and variation points are accordingly defined. In the horizontal analysis, variation types are elaborated according to the characteristics of requirements and architecture. With this framework, the variability of assets can be consistently and explicitly described, allowing variations to be traced in core assets and seamless reuse of core assets across the entire life cycle.

#*A Value-Added Predictive Defect Type Distribution Model Based on Project Characteristics.
#@Youngki Hong,Jongmoon Baik,In-Young Ko,Ho-Jin Choi
#year2008
#confACIS-ICIS
#citation3
#index4941
#arnetid4943
#!In software project management, there are three major factors to predict and control; size, effort, and quality. Much software engineering work has focused on these. When it comes to software quality, there are various possible quality characteristics of software, but in practice, quality management frequently revolves around defects, and delivered defect density has become the current de facto industry standard. Thus, research related to software quality has been focused on modeling residual defects in software in order to estimate software reliability. Currently, software engineering literature still does not have a complete defect prediction for a software product although much work has been performed to predict software quality.On the other side, the number of defects alone cannot be sufficient information to provide the basis for planning quality assurance activities and assessing them during execution. That is, for project management to be improved, we need to predict other possible information about software quality such as in-process defects, their types, and so on. In this paper, we propose a new approach for predicting the distribution of defects and their types based on project characteristics in the early phase. For this approach, the model for prediction was established using the curve-fitting method and regression analysis. The maximum likelihood estimation (MLE) was used in fitting the Weibull probability density function to the actual defect data, and regression analysis was used in identifying the relationship between the project characteristics and the Weibull parameters. The research model was validated by cross-validation.

#*Trust Mechanism in Distributed Access Control Model of P2P Networks.
#@Lei Wang,Yanqin Zhu,Lanfang Jin,Xizhao Luo
#year2008
#confACIS-ICIS
#citation-1
#index4942
#arnetid4944
#!Peer-to-peer network technologies have gained popularity without the need for centralized servers. With the consistent development of the network, the existing techniques about access control could not resolve the security issues in P2P networks perfectly. How to realize the trust mechanism in access control system is an important subject of P2P security research. In this paper, we analyze the lack of trust mechanism in the existing access control models, and present a recommendation trust model based on reputation. We introduce the related concepts in the trust model and explain the mechanism of trust. Then, a protocol of trust query is designed and calculations about trust are given. At last, we validate the availability of the trust model, and applied it in the existing access control model. The combining of trust mechanism and access control technologies makes the P2P networks securer.

#*Engineering Education - A Great Challenge to Software Engineering.
#@Jaroslav Král,Michal Zemlicka
#year2008
#confACIS-ICIS
#citation1
#index4943
#arnetid4945

#*Radix Plus Length Based Insert Sort.
#@Yongcheng Zhang
#year2008
#confACIS-ICIS
#citation0
#index4944
#arnetid4946
#!Many applications depend on efficient sort algorithm to sort large sets of distinct string keys in memory. For example, sorting records for databases in which type of prime key is string. We propose a new improved radix sort algorithm, radix plus length based insert sort algorithm(R-LI), to sort large sets of string keys. The algorithm are used to sort set with length-changeable string key. R-LI algorithm is improvement of R-S algorithm given by M.DONALD Maclaren at 1966. Any radix sort method can be used as the first step of R-LI algorithm. The algorithm are based on characters which we give in this article as theorems. Detailed performance analysis is also given. R-LI algorithm is very faster than any simple radix sort which be used as first step of R-LI algorithm.

#*Distributed Detection in Wireless Sensor Networks.
#@Sheng-Tzong Cheng,Szu-Yun Li,Chia-Mei Chen
#year2008
#confACIS-ICIS
#citation1
#index4945
#arnetid4947
#!Wireless sensor networks (WSNs) usually are applied in military systems, surveillance systems, etc. Since WSNs always are deployed in open environments, the security mechanisms in WSNs are very important. Although there are many security mechanisms in WSNs, such as intrusion detection and fault tolerant system, few of them are proposed to detect compromised sensors. In this paper, we propose an application-independent detection model, distributed cross-layer detection model (DCD), making use of a distributed mechanism and the information of each layer in the communication protocol to detect which sensors were already compromised. Due to the characteristics of low power, low computation ability, low storage space, simplicity and high-efficiency is our design goal. Only when compromised sensors can be detected, the WSNs could be safer in practice.

#*Control Network Programming Illustrated: Solving Problems with Inherent Graph-Like Representation.
#@Kostadin Kratchanov,Emilia Golemanova,Tzanko Golemanov
#year2008
#confACIS-ICIS
#citation2
#index4946
#arnetid4948
#!Control Network Programming (CNP) is a style of high-level programming created to be especially convenient for solving problems with natural graph-like representation. Showing that this goal has been achieved is the purpose of the current report. CNP solutions to four problems representative of four important problem classes are presented. Most of the problem descriptions are nondeterministic and declarative, without specifying an algorithmic solution. These natural problem descriptions are easily converted into working Control Network programs.

#*Privacy-Preserving Data Publishing Based on De-clustering.
#@Qiong Wei,Yansheng Lu,Qiang Lou
#year2008
#confACIS-ICIS
#citation1
#index4947
#arnetid4949
#!In recent years, privacy preservation has become a serious concern in publication of personal data because of the wide availability of personal data. In the literature, we know that the degree of privacy protection is really determined by the number of distinct sensitive values in each group which is classified according to quasi-identifiers. In this paper, we present a novel method to protect data privacy by partitioning the microdata into some groups based on de-clustering. In this method, we make the records contained in each group possess distinct sensitive values and ensure that the size of the minimal groups not to be less than a threshold σ. According to a novel privacy measure proposed in this paper, our method can provide strong privacy protection. Extensive experiments confirm that our method can provide stronger privacy protection than the methods based on l-diversity.

#*Robust Routing.
#@Himanshu Agrawal,Andrew Jennings,Mark Gregory,Daud Channa
#year2008
#confACIS-ICIS
#citation1
#index4948
#arnetid4950
#!In a network, traffic demands are known with a degree of uncertainty, traffic engineering should take into account the traffic variability. In this research work we focus on the robust routing under changing network conditions. Daily internet traffic pattern shows that network is vulnerable to malicious attacks, denial of service attacks, worms and viruses. Oblivious routing has a substantially better performance than Open Shortest Path First [OSPF] routing for different level of uncertainty. We propose a theoretical framework for Robust Routing aiming to improve online and offline traffic engineering approaches.

#*On the Precision and Accuracy of Impact Analysis Techniques.
#@Lile Hattori,Dalton Serey Guerrero,Jorge C. A. de Figueiredo,João Brunet,Jemerson Damásio
#year2008
#confACIS-ICIS
#citation3
#index4949
#arnetid4951
#!Several techniques and algorithms for impact analysis of software systems have been recently published in literature. Most of them, however, are not practical enough to be applied in the software industry because, among other reasons, they produce too many false results (either positive or negative). In this paper, we propose and evaluate the use of two measures from information retrieval, namely precision and recall, to help express and compare precision and accuracy of impact analysis techniques and algorithms.

#*Predicate Detection Modality and Semantics in Three Partially Synchronous Models.
#@Chunbo Chu,Monica Brockmeyer
#year2008
#confACIS-ICIS
#citation2
#index4950
#arnetid4952
#!Predicate detection addresses the challenge of monitoring the state of a distributed system. This research is the first step to explore predicate detection with partial synchrony assumptions. We study the observability of computation and focus on predicate detection semantics in three partially synchronous models. A framework of the behavior of predicate detection is established in terms of partial synchrony, modalities permitted and the best detection semantics. This work forms a conceptualization of the problem space and leads to disciplined approaches to predicate detection in realistic systems by identifying the strongest possible semantics for each modality and partial synchrony assumption.

#*Enhancing Data Flow Testing of Classes through Design by Contract.
#@Yogesh Singh,Anju Saha
#year2008
#confACIS-ICIS
#citation1
#index4951
#arnetid4953
#!Design by Contract (DbC) is a methodology to construct quality software. DbC associates the contract pecification (pre and postconditions of methods of class and class invariant) with the design of a class. In this paper, we combine data flow testing and Design by Contract to develop a testing technique called “Data flow testing using Contract”. In this technique a class flow graph is generated from the contract specification of the class and then conventional data flow testing is applied to find the test cases. The advantage of using contract specification is that: it is executable and hence a method in a test case is only executed if its precondition and class invariant are satisfied. If they are not satisfied then it leads to an infeasible sequence. Also, if after executing a method its postcondition is not satisfied then it leads to implementation error in the method. We also compare the testing of a DbC class with a conventional class and find that the number of du pairs is reduced in a DbC class because some of the conditions in conventional class become the part of the precondition in a DbC class.

#*Identity-Based Conference Key Distribution Scheme Using Sealed Lock.
#@Yongquan Cai,Xiuying Li
#year2008
#confACIS-ICIS
#citation0
#index4952
#arnetid4954
#!In order to hold secure electronic conference in communication networks via insecure channels, a conference key distribution system should be constructed. The conference key distribution system is used for distributing a conference key shared among the participants of the conference and hence secure communications are achieved. In this paper, by using the sealed lock proposed in [1], we propose an identity-based conference key distribution scheme with user anonymity. We also show that, our scheme not only withstands passive attack, impersonation attack, and conspiracy attack, but also provides forward security of the chairman. These properties make it quite effective and practical.

#*An Improved Condensing Algorithm.
#@Xiulan Hao,Chenghong Zhang,Hexiang Xu,Xiaopeng Tao,Shuyun Wang,Yunfa Hu
#year2008
#confACIS-ICIS
#citation5
#index4953
#arnetid4955
#!kNN classifier is widely used in text categorization, however, kNN has the large computational and store requirements, and its performance also suffers from uneven distribution of training data. Usually, condensing technique is resorted to reducing the noises of training data and decreasing the cost of time and space. Traditional condensing technique picks up samples in a random manner when initialization. Though random sampling is one means to reduce outliers, the extremely stochastic may lead to bad performance sometimes, that is, advantages of sampling may be suppressed. To avoid such a misfortune, we propose a variation of traditional condensing technique. Experiment results illustrate this strategy can solve above problems effectively.

#*RDF-Based Approach to Data Transform Composition.
#@Jungmin Shin,Joachim Hammer,Herman Lam
#year2008
#confACIS-ICIS
#citation1
#index4954
#arnetid4956
#!In order to share data, creating a data transform is a mandatory step since disparate data sources have heterogeneities in data representation. Manual transform creation is extremely tedious and error-prone even though we have a repository of usable transforms. Recent work has focused on finding a data transform as part of data mapping or schema matching. However, the work is mostly about a structural data mapping or applying a single data transform between schemas. We consider a \textit{transform composition} which reuses existing transforms for constructing users' desired transforms. Users' desired transforms and existing transforms are described in our transform model represented in RDF triples. Our transform model includes not only semantics of input/output fields but also behavior of a transform. We model a transform composition problem as a graph search problem. Also, we describe overall architecture of our system which automatically discovers users' desired transforms.

#*A Strategic Test Process Improvement Approach Using an Ontological Description for MND-TMM.
#@Hoyeon Ryu,Dong-Kuk Ryu,Jongmoon Baik
#year2008
#confACIS-ICIS
#citation1
#index4955
#arnetid4957
#!It is well known that most of mission critical systems like defense systems demand higher quality than general software systems. In order to assure the high quality of the systems, those software systems must be thoroughly tested with well defined testing processes. As software systems evolve, software testing should also be improved with continual-base. Even if there are some previous researches on test process model, those models have some limitations and problems to be applied for software testing process improvement in a specific domain like military weapon systems. In this paper, we propose a new testing maturity model, called MND-TMM(Ministry of National Defense-Testing Maturity Model), which can be adopted effectively for the weapon software system development. We also present OWL ontology for the MND-TMM, called MTO(MND-TMM Ontology) to help software organizations set up their effective testing strategies and improve their testing processes, which can lead to high quality product developments.

#*An Efficient Structural Index for Graph-Structured Data.
#@Yingjie Fan,Chenghong Zhang,Shuyun Wang,Xiulan Hao,Yunfa Hu
#year2008
#confACIS-ICIS
#citation0
#index4956
#arnetid4958
#!To speed up queries over XML and semi-structured data, a number of structural indexes have been proposed. The structural index is usually a labeled directed graph defined by partitioning nodes in the XML datagraph in to equivalence classes and storing equivalence classes as index nodes. On the basis of the Inter-Relevant Successive Trees (IRST), we propose an efficient adaptive structural index, IRST (k)-index. Compared with the previous indexes, such as the A (k)-index, D (k)-index, and M (k)-index, our experiment results show that the IRST(k)-index performs more efficiently in terms of space consumption and query performance, while using significantly less construction time.

#*Effective RTL Method to Develop On-Line Self-Test Routine for the Processors Using the Wavelet Transform.
#@Amin Asghari,Seied Ahmad Motamedi,Sepehr Attarchi
#year2008
#confACIS-ICIS
#citation0
#index4957
#arnetid4959
#!In this paper, we introduce a new efficient register transfer level (RTL) method to develop on-line self-test routines. We consider some prioritizations to select the components and instructions of the processor. In addition, we choose test patterns based on spectral RTL test pattern generation (TPG) strategy. For the purpose of spectral analysis, we use the wavelet transform. Also, we use a few extra instructions for the purpose of the signature monitoring to detect control flow errors. We demonstrate that the combination of these three strategies is effective for developing small test programs with high fault coverage in a small test development time. In this case, we only need the instruction set architecture (ISA) and RTL information. Our method not only provides a simple and fast algorithm for on-line self-test applications, also gains the advantages of utilizing lower memory and reducing the test generation time complexities in comparison with proposed methods so far. We focus on the application of this approach for Parwan processor. We develop a self-test routine using our proposed method for Parwan processor and demonstrate the effectiveness of our proposed methodology for on-line testing by presenting experimental results for Parwan processor.

#*Relevance-Feedback Image Retrieval Based on Multiple-Instance Learning.
#@Duc A. Tran,S. R. Pamidimukkala,Phuong Nguyen
#year2008
#confACIS-ICIS
#citation-1
#index4958
#arnetid4960
#!This paper describes the development of a novel content-based image retrieval system using Multiple-Instance Learning (MIL). MIL is designed for learning on bags, each composed of a number of instances (i.e., feature vectors). For a given bag, one or more instances may be responsible for the observed classification of the bag, but their identities are unknown. What we can observe is only the label of the bag and our aim is to predict the label of any given new bag. The image retrieval problem can be mapped to an MIL problem. Our contribution is a new way to improve the effectiveness of MIL in image retrieval. We have implemented a Web-based relevance-feedback image search system to illustrate the proposed idea, which shows that the search accuracy is encouraging.

#*Security Analysis and Implementation of JUIT—Image Based Authentication System Using Kerberos Protocol.
#@Nitin,Durg Singh Chauhan,Vivek Kumar Sehgal,Ankit Mahanot,Pallavi Singh,Sohit Ahuja,Utkarsh Shrivastava,Manisha Rana,Vineet Punjabi,Shivam Vinay,Nakul Sharma
#year2008
#confACIS-ICIS
#citation0
#index4959
#arnetid4961

#*A Novel Enterprise Mobile E-mail System Using the SyncML Protocol.
#@Jing Xie,Dan Yu,Shilong Ma
#year2008
#confACIS-ICIS
#citation1
#index4960
#arnetid4962
#!We have learned that the existing mobile e-mail solutions have some deficiencies, such as unsatisfied real-time features, poor mobility and so on. To avoid these problems, we propose a new way to design and implement an Enterprise Mobile E-mail System (EMES) with SyncML protocol. Our method explicitly takes into account the applications and the new needs of EMES. The result shows that we can resolve real-time, security, mobility, economy and synchronous problems in EMES.

#*An Effort-Based Approach to Measure Completeness of an Entity-Relationship Model.
#@Tauqeer Hussain,Mian M. Awais
#year2008
#confACIS-ICIS
#citation1
#index4961
#arnetid4963
#!For developing good quality information systems, the need of developing good quality conceptual models cannot be over emphasized. Completeness is an important characteristic that determines the quality of a conceptual model. To measure completeness, metrics called Completeness Index (CI) and Fuzzy Completeness Index (FCI) have been proposed in research. These metrics correspond to the extent functional dependencies are represented in a conceptual model. In this paper, we propose an approach that takes into account the effort required to make a conceptual model complete. The higher the effort, the less is the degree of completeness. A metric Effort-based Completeness Index ECI is proposed accordingly. Although metrics previously proposed have an implicit relationship with the required effort, ECI provides the basis to explicitly relate completeness with the effort. Also, the method of computing ECI is simpler. In the proposed approach, first the effort based upon number of changes required to introduce a functional dependency in a given model is computed. Then the total effort for all functional dependencies in the problem domain determines ECI. In this paper, ECI is calculated for different conceptual models and compared with corresponding CI and FCI values. It is illustrated that the proposed approach can easily be applied to practical problems in which alternative designs of the same problem are to be compared objectively in order to identify the one having better quality.

#*Objective Types for the Valuation of Secure Business Processes.
#@Thomas Neubauer,Johannes Heurix
#year2008
#confACIS-ICIS
#citation3
#index4962
#arnetid4964
#!In today's business environments, the unimpeded execution of corporate business processes is crucial for a company's success. As business processes are permanently exposed to a variety of threats, companies are increasingly forced to pay attention to security issues. Existing approaches for the evaluation of security measures often neglect the consideration of business needs and multiple objectives. This paper gives an overview of the Atana approach that supports decision makers with the elicitation of security safeguards based on corporate business processes and according to multiple objectives. It introduces different objectives types that are needed for measuring the value of security investments.

#*Analysis of E-bank Innovation in China Using a Hypercube Model.
#@HaiBo Zhu,Ying Zou
#year2008
#confACIS-ICIS
#citation0
#index4963
#arnetid4965
#!Information and communication technologies innovating applications have posed technical, organizational and commercial challenges in financial industry. This study uses a hypercube model to investigate E-bank innovative changes in China and discuss their impacts on stakeholders: customers, banks, complementary providers and regulators. The results indicate that Internet bank (I-bank) differs substantially from telephone bank (Tele-bank) in technological components and business model. From Tele-bank to I-bank, innovation is radical to customers, banks and complementary providers, architectural regulators. However, From I-bank to Mobile bank (M-bank), innovation is architectural to customers and banks, modular to regulators, radical to complementary providers. We think that the innovation from Tele-bank to I-bank is not a simple supplement process. The changes will widely influence on the whole banking industry. The innovations from I-bank to M-bank, it is thought to be primarily a process of supplement rather than a process of substitute.

#*Lessons Learned from Implementing WS-Coordination and WS-AtomicTransaction.
#@Ivan Silva Neto,Francisco Reverbel
#year2008
#confACIS-ICIS
#citation2
#index4964
#arnetid4966
#!This paper presents the design and implementation of a transaction service that complies with the WS-Coordination and WS-AtomicTransaction standards. Such service builds upon XActor, a distributed transaction manager that supports an open-ended set of transports, and enhances it with full support for atomic transactions over Web services. The paper summarizes the main lessons we learned from implementing those standards. It also identifies weaknesses in the WS-AtomicTransaction specification and presents advice for implementors of any systems based upon WS-Coordination.

#*Agent Based Architecture for Secure Access from Multiple Hospitals.
#@Sun K. Yoo,Jun Choe,Do Yoon Kim
#year2008
#confACIS-ICIS
#citation1
#index4965
#arnetid4967
#!Internet-based health data exchange, which is particularly useful for the management of cooperative health care and life time heath care records, requires the use of a common format to allow access to heterogeneous reservoirs scattered at different hospitals, as well as protection from intrusion and piracy. However, the unified management of multiple reservoirs is difficult to achieve, due to the different policies operated by different hospitals and the heterogeneous format of their information reservoirs. In this paper, we propose a multi-agent based secure architecture which can be used to retrieve healthcare information in a common format through the internet from multiple heterogeneous reservoirs. The proposed system is organized in the form of a 4-tier architecture, consisting of the client application, access control central agent, local access control agent and hospital information system, involving distributed processing with multiple matching agents connected to heterogeneous reservoirs and one flexible master controller to unify the different formats and different hospital policies, thus providing a secure common format and simplifying the problem of reservoir maintenance, including the addition, removal and modification of reservoirs. The combination of XML and RABC provides an efficient means of reservoir management, allowing for access control, a common format for information exchange, device independent display for diverse display resolutions of terminal devices, user identification for authentication, digital signature for data integrity, and selective encryption for protecting confidential health information.

#*Software Architectures for Task-Oriented Computing.
#@David Garlan
#year2008
#confACIS-ICIS
#citation0
#index4966
#arnetid4968
#!Recent advances in ubiquitous computing, autonomic computing, and artificial intelligence have led to a desire to better support user-oriented tasks by placing more intelligence in the computing infrastructure. This infrastructure helps mediate between computing resources and legacy applications on the one hand, and a user's high-level goals on the other hand. In this talk I survey recent research in developing software architectures to support these new capabilities. Key features of these architectures are the ability to interface with legacy applications, but still add considerable support for user tasks; the ability to incorporate machine learning so that the system adapts to the user over time; and the ability to cope with resource variability and user mobility. I outline some of the consequent software engineering challenges that arise in this setting.

#*An Extensive Empirical Study of Feature Selection for Text Categorization.
#@Li-Qing Qiu,Ru-Yi Zhao,Gang Zhou,Sheng-Wei Yi
#year2008
#confACIS-ICIS
#citation2
#index4967
#arnetid4969
#!We present a novel feature selection (FS) approach for text categorization. It first constructs a local feature set for each category by selecting a set of features based on three different schemes: DF, TF and TFIDF, and then constructs a global feature set utilizing well-known CHI method based on the local feature set. The experimental comparison is carried out between our method and CHI method. Results from the experiments are summarized. The results show that our proposed method based on DF scheme can perform comparatively well with CHI methods.

#*Verification for Time Consistency of Web Service Flow.
#@Rujuan Liu,Changjun Hu,Chongchong Zhao,Zhong Gao
#year2008
#confACIS-ICIS
#citation1
#index4968
#arnetid4970
#!Non-functional property verification (such as time consistency) for Web Services (WS) flow has become indispensable since many WS for e-business exist in real world with temporal context and depend on many external restrictions like executing time and consuming cost etc. Unfortunately, current researches mainly focus on the modeling, analyzing and verifying of WS process, while ignoring the non-functional factors. Aiming at verifying time constraints in service flow, the paper presents a method for verifying time constraints consistency in WS flow. By building time ontology based on DAML_Time, the OWL_S(Ontology Web Language for Web Services) is extended with time constraints, which expresses time information of WS flow clearly and roundly. Then the annotated OWL_S is transformed to formal model TCPN (Time constraints Petri Net). By verifying property of TCPN, the time consistency of WS flow can be verified according to the result of verification algorithm. A composite WS is taken as an example to illustrate the process of verification.

#*A New Operational Framework for Benchmarking the SAN Products.
#@Prabu Dorairaj,Devi Prasad Bhukya,Lakshminarayana Prasad Kantam,Kishor Arumilli
#year2008
#confACIS-ICIS
#citation-1
#index4969
#arnetid4971
#!The novel framework presented in this paper provides a comprehensive methodology and statistical approach for benchmarking two Storage Area Network (SAN) products. This framework has the ability to assess the complexity of the SAN products benchmarking characteristics. This approach enables us to explore the complex interactions and relationships between the SAN products in the same environment. There are many evaluation techniques available for testing, but their results and evaluations may lack maturity and are not statistically sound. This novel unified framework provides a cost effective way that quantifies the benchmarking and interaction level of two SAN products by using single Design of Experiments (DOE) analysis. This novel approach provides good SAN product comparative analysis to customer's with high degree of accuracy with good predictabilities in product improvement, product marketing and product selection.

#*Three Dimensional Face Recognition Using SVM Classifier.
#@Mir Hashem Mousavi,Karim Faez,Amin Asghari
#year2008
#confACIS-ICIS
#citation4
#index4970
#arnetid4972
#!In this paper, we presented a novel approach for automated 3D face recognition using range data. An object recognition system generally consists of two main parts: data registration and data comparison. In first step, the nose tip was used as the reference point and 3D face shape was normalized to standard image size. The 2DPCA was applied to the resultant range data and the corresponding principal images were used as the feature vectors. Classification was carried out by calculating the similarity score between the feature vectors. The SVM classifier was used in choosing the closest match. Recognition rate of 97% rank-four was achieved

#*Observations on Liner Prediction Based Blind Source Extraction Algorithms.
#@Min Gan,Hongfa Wang,Guoying Yue,Nan Xie,Haibo Zhang
#year2008
#confACIS-ICIS
#citation1
#index4971
#arnetid4973
#!As we see, blind source extraction (BSE) is advantageous over blind source separation (BSS) when obtaining some underlying source signals from high dimensional signals. Among a variety of BSE algorithms, a large number of algorithms are based on linear prediction (LP-BSE). In this paper we reveal that they are, in nature, minor component analysis (MCA) algorithms, and thus they have some problems that are inherent in MCA algorithms. We also find a switch phenomenon of online LP-BSE algorithms, showing that different parts of a singly extracted signal are the counterparts of different source signals. The two issues should be noticed when one applies these algorithms to practical applications. Computer simulations are given to confirm these observations.

#*Email Categorization Using (2+1)-Tier Classification Algorithms.
#@Md. Rafiqul Islam,Wanlei Zhou,Morshed U. Chowdhury
#year2008
#confACIS-ICIS
#citation0
#index4972
#arnetid4974
#!In this paper we have proposed a spam filtering technique using (2+1)-tier classification approach. The main focus of this paper is to reduce the false positive (FP) rate which is considered as an important research issue in spam filtering. In our approach, firstly the email message will classify using first two tier classifiers and the outputs will appear to the analyzer. The analyzer will check the labeling of the output emails and send to the corresponding mailboxes based on labeling, for the case of identical prediction. If there are any misclassifications occurred by first two tier classifiers then tier-3 classifier will invoked by the analyzer and the tier-3 will take final decision. This technique reduced the analyzing complexity of our previous work [11,12]. It has also been shown that the proposed technique gives better performance in terms of reducing false positive as well as better accuracy.

#*Region-Based Image Fusion Approach Using Iterative Algorithm.
#@Yingjie Zhang,Liling Ge
#year2008
#confACIS-ICIS
#citation0
#index4973
#arnetid4975
#!A feature-level image fusion scheme based on segmentation and iterative fashion is introduced in this paper. In this scheme, a total variation based energy model is proposed to estimate the contribution of each feature on the source images, the features are obtained based on segmentation of the source image. A larger energy indicates the feature with a strong pattern on its associated region. Furthermore fusion strategies may be performed by measuring the contributions of the associated features on the images. Different from previous methods, measurement of the contributions of the features in proposed are performed when the features has been fused. Therefore a global optimization could be achieved. In order to keep a low computational cost, the orders of regions have not been considered in current research. Even so, better results have been obtained on several test images, and the performance assessment of the final fusion results also are evaluated by using several classical evaluation methods like Root Mean Square Error and Peak Signal to Noise Ratio.

#*Secure E-cheques for Joint Accounts with Collective Signing Using Forward-Secure Multi-signature Scheme.
#@N. R. Sunitha,B. B. Amberker,Prashant Koulgi
#year2008
#confACIS-ICIS
#citation0
#index4974
#arnetid4976
#!With the modern world going on-line for all businesses, we need to transact with various business organisations all over the world using different modes of payment obtained through various Financial Institutions. We propose a scheme for Joint Account Holders with collective signing agreement to issue e-cheques. Our scheme is based on multi-signatures. When an e-cheque belonging to a Joint Account is submitted by a bank for clearance, the bank clearing the e-cheque can verify that it is signed by all the Joint Account Holders using a single verification equation. Also, the bank can maintain just a single public key for one joint account though multiple signers are involved. We have augmented the multi-signature scheme to provide forward-security. This guarantees the security of cheques signed in the past even if the signer's secret key is exposed today.

#*Low Dimensional Reproduction Strategy for Real-Coded Evolutionary Algorithms.
#@Changtong Luo,Shaoliang Zhang,Bo Yu
#year2008
#confACIS-ICIS
#citation0
#index4975
#arnetid4977
#!The strategy of low dimensional reproduction (LDR) is proposed for real-coded evolutionary algorithms (REAs) in this paper. It preserves some (randomly chosen) components of the local best vector (elite individual) in the reproduction process and let the traditional reproduction operators act on the rest components. Thus it could help the search points escape from the hyperplane where the parents individuals lies, as well as keep them from getting too much decentralized and search mainly along a series of orthogonal directions (coordinate). The LDR strategy provides a universal idea to improve the performance of REAs. Four REAs are taken as examples to show the effect of the strategy. Numerical results show that the proposed strategy can accelerate the convergence speed of the applied algorithms considerably. In addition, the strategy is computational saving, easy to implement, and easy to control.

#*DBPowder-mdl: Mapping Description Language between Applications and Databases.
#@Tadashi Murakami
#year2008
#confACIS-ICIS
#citation-1
#index4976
#arnetid4978
#!A few decade years have passed since the Object/Relational mapping problem was recognized. However, it still remains to be a hard problem. Simple declaration cannot overcome the impedance mismatch, however, detailed declaration tends to get into a number of duplicated definitions of elements. Duplicated definitions are not preferable in order for productivity and maintainability.In this paper, we propose DBPowder-mdl to address the problem above. DBPowder-mdl describes mappings between object models and relational models. Both object models and relational models are derived from the mapping declaration. DBPowder-mdl keeps simple declaration with having a descriptive power of detailed declaration such as inheritance in object models.We developed a prototype system of DBPowder-mdl and evaluated it.

#*Tabu Search Solution for Fuzzy Linear Programming.
#@M. Hadi Mashinchi,M. Reza Mashinchi,M. Mashinchi
#year2008
#confACIS-ICIS
#citation-1
#index4977
#arnetid4979
#!In this paper, a tabu search (TS) method is proposed to find a global solution for fuzzy linear programming (FLP). Two additional factors, distribution factor (DF) and similarity factor (SF), are also introduced for TS to enhance the searching performance. The application of DF and SF makes the TS to surf in a larger search space and reduces the possibility of re-searching the visited areas. A simulation is done to show the efficiency of the proposed study.

#*Developing Accessible Applications with User-Centered Architecture.
#@Sabina Jeschke,Helmut Vieritz,Olivier Pfeiffer
#year2008
#confACIS-ICIS
#citation2
#index4978
#arnetid4980
#!Design of accessible applications is often a challenge for software architects and developers. Development usually starts with structure and functionality of the planned application whereas it is also necessary to respect the complex needs of accessibility from the beginning. User-centered architecture starts modeling with the design and functionality of the user interface. The interface models include the necessary semantic information to provide Assistive Technology with additional annotation about functionality and behavior of interface elements. In this paper, a concept of a model-driven design process is presented which uses the advantages of user-centered architecture to facilitate the design of accessible applications.

#*Attention Model Based SIFT Keypoints Filtration for Image Retrieval.
#@Ke Gao,Shouxun Lin,Yongdong Zhang,Sheng Tang,Huamin Ren
#year2008
#confACIS-ICIS
#citation6
#index4979
#arnetid4981
#!Effective feature extraction is a fundamental component of content-based image retrieval. Scale Invariant Feature Transform (SIFT) has been proven to be the most robust local invariant feature descriptor. However, SIFT algorithm generates hundreds of thousands of keypoints per image, and most of them comes from background. This has seriously affected the application of SIFT in real-time image retrieval. This paper addresses this problem and proposes a novel method to filter the SIFT keypoints using attention model. Based on visual attention analysis, all of the keypoints in an image are ranked with their attention saliency, and only the most distinctive keypoints will be reserved. Then we use Bag of words to efficiently index these features. Experiments demonstrate that the attention model based SIFT keypoints filtration algorithm provides significant benefits both in retrieval accuracy and matching speed.

#*Content-Based Classifying Traditional Chinese Calligraphic Images.
#@Zhong Gao,Guanming Lu,Daquan Gu,Chun He
#year2008
#confACIS-ICIS
#citation-1
#index4980
#arnetid4982
#!As traditional Chinese calligraphic (TCC) occupies an important place in the life of modern Chinese, there are a lot of TCC images digitalized and exhibited on the Internet. However, effective classification in them is an imperative problem need to be addressed. The paper proposes a content-based classification scheme that represents the visual content of TCC images by a textural feature set. Four kinds of classifier implemented in the scheme learn the characteristics of fundamental TCC style, art movements and calligraphic artists. The experimental results show that the scheme is capable of classifying the TCC image based on calligraphic artists as well as art movements with an accuracy of greater than 85%.

#*Building a Service-Oriented Ontology for Wireless Sensor Networks.
#@Jeong-Hee Kim,Hoon Kwon,Do-Hyeon Kim,Ho-Young Kwak,Sang Joon Lee
#year2008
#confACIS-ICIS
#citation13
#index4981
#arnetid4983
#!Wireless sensor networks (WSNs) provide various environment data in the real-world, and also WSNs's middleware is able to offer field data in real-time by user queries. For materialization of the future ubiquitous computing which enables networking with things at anytime, anywhere and any-devices, WSNs occupy the important position with RFID technologies, and it has evolved and advanced currently. This paper proposes a service-oriented sensor ontology which enables service-oriented services in future ubiquitous computing. Taking reuse of ontology into consideration, ServiceProperty, LocationProperty and PhysicalProperty classes were derived from Geography Markup Language (GML), Sensor Web Enablement (SWE), SensorML and Suggested Upper Merged Ontology (SUMO) and OntoSensor ontology, and its properties and constraints were also defined newly as service-oriented service. We presented the validation and consistency check of the proposed ontology using Protégé 3.3.1 and RACER 1.9.0, respectively, and indicated the results of service query which used the SPARQL query language.

#*A Document Clustering Method Based on One-Dimensional SOM.
#@Yan Yu,Pilian He,Yushan Bai,Zhenlei Yang
#year2008
#confACIS-ICIS
#citation1
#index4982
#arnetid4984
#!In this paper a new method is presented and used in clustering document collections. This method is based on the one-dimensional arrays of Self-Organizing Map network (1-D SOM array). The main idea of this method is to obtain the clustering results by calculating the distances between every two adjacent MSPs (the most similar prototype to the input vector) of well trained 1-D SOM. The process is simple, easy to understand and unnecessary to give the number of clusters beforehand. The experimental results show that this method works well in clustering document collection.

#*Subspace Clustering of High Dimensional Data Streams.
#@Shuyun Wang,Yingjie Fan,Chenghong Zhang,Hexiang Xu,Xiulan Hao,Yunfa Hu
#year2008
#confACIS-ICIS
#citation5
#index4983
#arnetid4985
#!In this paper, SOStream, which is a novel algorithm of clustering over high dimensional online data stream is presented, it is based on subspace. SOStream partitions the data space into grids, and maintains a superset of all dense units in an online way. A deterministic lower and upper bound of the selectivity of each maintained units are also given. With the maintained potential dense units, SOStream is capable of discovering the clusters in different subspaces over high dimensional data stream with arbitrary shape. The experimental results on real and synthetic datasets demonstrate the effectivity of the approach.

#*Entropy Based Clustering of Data Streams with Mixed Numeric and Categorical Values.
#@Shuyun Wang,Yingjie Fan,Chenghong Zhang,Hexiang Xu,Xiulan Hao,Yunfa Hu
#year2008
#confACIS-ICIS
#citation1
#index4984
#arnetid4986
#!In is paper, a novel algorithm for clustering data streams with mixed numeric and categorical attributes (CNC-Stream)is proposed. A new similarity measure based on entropy determining the similarity between the objects (data points in the stream or the micro-clusters in memory) is also presented here, which makes CNC-Stream work. The experiments conducted on the real data sets and synthetic data sets show that the proposed method is of high quality.

#*SIMPA: A SIP-Based Mobile Payment Architecture.
#@Ge Zhang,Feng Cheng,Christoph Meinel
#year2008
#confACIS-ICIS
#citation6
#index4985
#arnetid4987
#!In recent years, many Mobile Payment (MP) schemes have been proposed and used in practise. However, a prerequisite for extended acceptance and adoption of MP technologies is to deploy an effective MP system. So far, there is no such a standardised and scalable MP platform. Most current MP schemes are circumscribed by its mobile network infrastructures. Fortunately, the fast advancement of 3G technology equips next generation mobile phone network more benefits. Following this direction, we propose SIMPA --- A SIP-based Mobile Payment Architecture for next generation mobile network, which not only supports P2P payment communications between customers and merchants using Session Initiation Protocol (SIP), but also supports several traditional internet security protocols, to enhance privacy, confidentiality and integrity during the transaction. This paper depicts detailed protocol and system architecture of SIMPA. Some application examples from customers’ view are shown to demonstrate its function and feature.

#*EESM for IEEE 802.16e: WiMaX.
#@Shahid Mumtaz,Atílio Gameiro,Jonathan Rodriguez
#year2008
#confACIS-ICIS
#citation6
#index4986
#arnetid4988
#!For Link Level interfacing packet switched simulation adopt the AVI (actual value interface) approach for mapping the computed SNR to the Block Error Rate (BLER) Statistics. However in OFDM based system the BLER is invariant within Radio transport channel due to fading channel and adjutant bit carriers mapping, rendering the AVI to be inaccurate. Due to large variability of the channel in frequency domain, two links with same average SNR can experience drastically different performance, thus making it difficult to accurately predict the instantaneous link performance such as Frame Error Rate (FER). To overcome this problem with AVI the EESM has been used as a low complexity approach. In this paper the feasibility of EESM as an abstraction method is investigated, and then calibrated and evaluated for Link Level Interface in WiMax System IEEE802.16e.This methods is then extended to handle more advanced link enhancement such as Alamouti encoding. The Exp-ESM method has better accuracy than the existing link error methods, and preferred link error predictor for system simulator.

#*A Novel Detection Method of Filled Pause in Mandarin Spontaneous Speech.
#@Yanxiong Li,Qianhua He,Tao Li
#year2008
#confACIS-ICIS
#citation-1
#index4987
#arnetid4989
#!Filled pause is one of the hesitation phenomena that current speech recognizers can not effectively handle. Detecting filled pauses is important in spontaneous speech dialogue systems because they play valuable roles, such as helping a speaker keep a conversational turn, in oral communication. In this paper, a novel detection method for filled pause is proposed based on a strategy of two-level decisions. Firstly, hypothetical filled pauses are extracted from non-silence signal segments. Then HMMs are trained and employed to recognize filled pauses from hypothetical filled pauses. Experiment results show that the average precision and recall rate of filled pauses are 80.66% and 92.59% respectively. Moreover, this filled pause detector can distinguish filled pauses from elongated words, which are not achieved in the previous works.

#*Collaboration between Security Devices toward improving Network Defense.
#@Sourour Meharouech,Adel Bouhoula,Tarek Abbes
#year2008
#confACIS-ICIS
#citation-1
#index4988
#arnetid4990

#*A Design on Collaborative-Cooperative Document Edit System Based on Cognitive Analyses.
#@Takayuki Fujimoto,Muhammad Dzulqarnain bin Muhammad Nasir,Tokuro Matsuo
#year2008
#confACIS-ICIS
#citation0
#index4989
#arnetid4991
#!In this paper, we propose an interactive web-based multi-user document editing system in which users can cooperatively create and edit documents. Although the document description/edit system using a computer exists variously, those many are not reflecting human's cognitive mechanism. The design concept of our system is to reflect the cognitive mechanism of "We write sentences with the computer". Moreover, in this system, users can not only create and store valuable information, but are also able to collaborate in real-time with other users using our system. Additionally, information stored by past users can be reused in new documents if found relevant. This is known as indirect knowledge communication and collaboration.

#*Tangible interfaces for real-time 3D virtual environments.
#@Ali Mazalek,Michael Nitsche
#year2007
#confAdvances in Computer Entertainment Technology
#citation13
#index4990
#arnetid4992
#%88876
#%892567
#%586932
#%88799
#%88825
#%90410
#!Emergent game formats, such as machinima, that use game worlds as expressive 3D performance spaces have new expressive powers with an increase of the quality of their underlying graphic and animation systems. Nevertheless, they still lack intuitive control mechanisms. Set direction and acting are limited by tools that were designed to create and play video games rather than produce expressive performance pieces. These tools do a poor job of capturing the performative expression that characterizes more mature media such as film. Tangible interfaces can help open up the game systems for more intuitive character control needed for a greater level of expression in the digital real-time world. The TUI3D project (Tangible User Interfaces for Real-Time 3D) addresses production and performative challenges involved in creating machinima through the development of tangible interfaces for controlling 3D virtual actors and environments in real-time. In this paper, we present the design and implementation of a tangible puppet prototype for virtual character control in the Unreal game engine and discuss initial user feedback.

#*Hyperdraw: a new computer aided drawing system based on prediction of drawing action.
#@Hirokatsu So,Ichiroh Kanaya,Kosuke Sato
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index4991
#arnetid4993
#%88490
#%88491
#!Traditional pens and papers are often the most preferable drawing materials for industrial designers, though computer aided design (CAD) systems are widely used in industrial design field. Such CAD systems are too strict for designers to draw their sketches freely and lack some real feeling of drawing. Somehow, especially in industrial design field, designers need to be assisted when they are drawing sketches since it is difficult even for professional designers to draw beautiful lines and curves every time they move their pens. The authors introduce a new computer aided drawing system, which is called Hyperdraw, in this paper. The Hyperdraw system "reads" its user's mind: it predicts and curves/lines that the user is intending to draw on a canvas and shows guide on the canvas by using mixed reality (MR) technology.

#*Variations on a fuzzy logic gesture recognition algorithm.
#@Lesley Anderson,Jon Purdy,Warren Viant
#year2004
#confAdvances in Computer Entertainment Technology
#citation-1
#index4992
#arnetid4994
#%634083
#!Web-cam based gesture recognition systems for home use are becoming more viable. A modification to an algorithm developed by Bimber yields low failure rates for wand motions tested against three sets of gestures. Additionally, the speed at which a gesture is performed does not affect its recognition rate, though the gesture's orientation does.

#*Sharing visual information in virtual environments using projective texture mapping.
#@Yannick Francken,Johan Huysmans,Philippe Bekaert
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index4993
#arnetid4995
#%634340
#%1119460
#%593957
#!We present a method for sharing visual information in 3D virtual environments, using a projective texture mapping based method. Avatars can share information with other avatars by projecting relevant information into the environment. In addition to standard projective texture mapping, an important depth cue is added: projected light is attenuated in function of the light-travel distance. This is efficiently accomplished on a per vertex basis by adaptively super-sampling under-sampled polygons. This way, the projection quality is maximized while keeping a fixed frame rate. Our technique is implemented into the Quake III engine, extending its shading language with GLSL fragment and vertex shaders.

#*Limitations of using real-world, public servers to estimate jitter tolerance of first person shooter games.
#@Grenville J. Armitage,Lawrence Stewart
#year2004
#confAdvances in Computer Entertainment Technology
#citation22
#index4994
#arnetid4996
#%512761
#%502311
#%514128
#%396828
#%512795
#!This paper quantitively evaluates the relevance of network jitter on player satisfaction and performance in multiplayer online games, particularly in comparison to overall network latency (or 'ping') times. We extend previously published work that showed Quake III players preferred servers less than 150-180ms away. Our modified, public Quake III server logged 20+ latency samples per second per client, from which we derived the jitter (instantaneous latency fluctuations) for each connected player. We found that using real-world traffic resulted in a highly correlated relationship between jitter and latency (jitter being generally one fifth, or less, of the path's latency), making it difficult to derive any independent relationship between jitter and player satisfaction. However, our results do demonstrate that absolute jitter over typical Internet paths is far less significant than the absolute latency for interactive games such as Quake III. This suggests Internet service providers (ISPs) should focus primarily on bringing latency within reasonable bounds.

#*Keep healthy with fun: an entertainment system for keeping the motivation of daily, dull, and monotone exercise.
#@Takuya Shimada,Itaru Kuramoto,Yu Shibuya,Yoshihiro Tsujino
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index4995
#arnetid4997
#%5419
#!Daily exercise is one of the popular methods to keep healthy. However, it is hard for most people to fit some exercise into their daily routine, because such exercise is often dull and monotone enough that their motivation of the exercise falls down. In this paper, we propose an entertainment system, "Exercise Game System (ExS)", to improve the person's motivation of daily exercises. It provides an entertainment which has a charactergrowing up based on the amount of exercise. The amount is estimated by the heart rate during the exercise. At weekend, the character participates a battle game, in which it fight against some other characters owned by other exercising people. By watching growth of a character and the battle game, users feel that dull and monotone exercise becomes fun.

#*Optimizing returns in the gaming industry for players and operators of Video Poker machines.
#@Tristan Barnett,Stephen R. Clarke
#year2004
#confAdvances in Computer Entertainment Technology
#citation1
#index4996
#arnetid4998
#!Video Poker in Australia is on the verge of extinction. These machines are being replaced in casinos as it is claimed they generate less money than the traditional slot machines. A brief outline of Video Poker is given and a method of calculating the optimal strategies for any Video Poker machine is developed. The distinction between non-progressive and progressive machines is highlighted by an extensive analysis of a Joker Wild Video Poker machine still offered at Star City casino. Video Poker is interesting to analyze due to the changing strategies produced by progressive jackpots. These allow players to have the odds in their favor, while paradoxically allowing the casinos to increase their percentage margin on extra turnover as the jackpot rises. This situation makes progressive jackpots beneficial for both the player and the casino and it seems reasonable these machines should be accessible to players in all Australian casinos. Progressive jackpots applied to other industries are also discussed.

#*The user in the group: evaluating the effects of autonomous group dynamics.
#@Rui Prada,Nuno Otero,Ana Paiva
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index4997
#arnetid4999
#%769820
#%1043050
#%87597
#%1133689
#%593841
#!Autonomous characters in virtual environmentshave the potential to improve the interaction experience of users, specially, their social experience.This effect is driven by the interactions occurring between users and the autonomous characters, that in certain scenarios can be in the context of a group.However, for these group interactions to be successful, it is not enough to assure that the autonomous charactersbehave in a coherent manner from an individual perspective,but it is also necessary that they exhibit behavioursthat are coherent with the group composition, context andstructure. Therefore, we have developed a model to support believable group dynamics of autonomous characters, inspired in theories developed in human social psychological sciences. This model defines the knowledge that eachindividual should build about the others and about the group it belongs, and how this knowledge drives their interactions in the group. The model was integrated in the mind of the autonomous characters that perform a collaborative task, in a computer game, with a human player. The game was used in a study that showed that players' interaction experience was better when interaction with groups that followed our model, namely, regarding trust and social identification with the group. In addition, we found some evidence that players prefer playing in groups that have higher level of conflict.

#*Massively multi-player games: matching game design with technical design.
#@Anne-Gwenn Bosser
#year2004
#confAdvances in Computer Entertainment Technology
#citation9
#index4998
#arnetid5000
#%512719
#%512807
#%519570
#!We propose a framework model to facilitate the prototyping and refinement of Massively Multi-player Online Games (MMOG), when included in the appropriate development environment. This work-in-progress report is motivated by observations made in the video game industry about the industrial process of designing such a demanding application, and based upon the technical know-how in that domain. A major benefit of the development environment based on this framework would be to validate game-design interactions when confronted with technical feasibility. A further benefit of this tool would be to assist the rest of the development process: for a spiral life-cycle style process, the tool could provide some interesting ways for analyzing the performance of more and more accurate prototypes at each stage of the development.

#*Designing a mobile game to reduce culture shock.
#@Nipan Maniar,Emily Bennett
#year2007
#confAdvances in Computer Entertainment Technology
#citation6
#index4999
#arnetid5001
#%495237
#%270363
#%89266
#%89971
#!The project aims to develop an educational mobile game to reduce the 'culture shock' that a sojourner experiences upon arriving in a new country. This paper focuses on the early stage of the project and explains the design process involved in creating a prototype game. This game, which is presented on a mobile telephone, is targeted at international students studying in the UK.

#*Robot's play: interactive games with sociable machines.
#@Andrew G. Brooks,Jesse Gray,Guy Hoffman
#year2004
#confAdvances in Computer Entertainment Technology
#citation28
#index5000
#arnetid5002
#%1497556
#%127876
#%70497
#%593090
#%13985
#%875263
#%751326
#!Personal robots for human entertainment form a new class of computer-based entertainment that is beginning to become commercially and computationally practical. We expect a principal manifestation of their entertainment capabilities will be socially interactive game playing. We describe this form of gaming and summarize our current efforts in this direction on our lifelike, expressive, autonomous humanoid robot. Our focus is on teaching the robot via playful interaction using natural social gesture and language. We detail this in terms of two broad categories: teaching as play and teaching with play.

#*"Kage no Sekai": interactive animation of shadow based on physical action.
#@Yu Uchida,Mami Naito,Shiho Hirayama
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5001
#arnetid5003
#%5288
#!"Kage no Sekai" is an interactive content. It makes us able to communicate through the actual shadow with the marvelous creatures; that we can see when we look in the shadow. The world, which we can see when we look in to the shadow of the objects on the table, is making their own world view that we won't usually find out. Users can communicate with the world of shadow by approaching to the space or, by using a shadow made by putting an object or, changing the shadow's shape by moving the object's direction or their own shadow.

#*Mobile sound communities.
#@William Carter,Scott S. Fisher
#year2004
#confAdvances in Computer Entertainment Technology
#citation3
#index5002
#arnetid5004
#!This paper describes a research project aimed at developing authoring tools for the collaborative creation of soundscapes and an associated system for the storage and playback of those soundscapes in a physical environment.

#*Motivated reinforcement learning for adaptive characters in open-ended simulation games.
#@Kathryn Elizabeth Merrick,Mary Lou Maher
#year2007
#confAdvances in Computer Entertainment Technology
#citation16
#index5003
#arnetid5005
#%13672
#%5196
#!Recently a new generation of virtual worlds has emerged in which users are provided with open-ended modelling tools with which they can create and modify world content. The result is evolving virtual spaces for commerce, education and social interaction. In general, these virtual worlds are not games and have no concept of winning, however the open-ended modelling capacity is nonetheless compelling. The rising popularity of open-ended virtual worlds suggests that there may also be potential for a new generation of computer games situated in open-ended environments. A key issue with the development of such games, however, is the design of non-player characters which can respond autonomously to unpredictable, open-ended changes to their environment. This paper considers the impact of open-ended modelling on character development in simulation games. Motivated reinforcement learning using context-free grammars is proposed as a means of representing unpredictable, evolving worlds for character reasoning. This technique is used to design adaptive characters for the Second Life virtual world to create a new kind of open-ended simulation game.

#*IPD for emotional NPC societies in games.
#@David Joseph Chaplin,Abdennour El Rhalibi
#year2004
#confAdvances in Computer Entertainment Technology
#citation5
#index5004
#arnetid5006
#!"Using Emotional Drives and Interaction to model Intelligent NPC's in Role Playing Games"; Modern video games have very little in the way of producing realistic Non Player Characters (NPCs) behavior based on its emotions. In life there are effects on people emotions that have to be taken into account. Any action taken by/on an NPC (agent) should have a residual effect in its drives, and this in turn should affect the emotional decisions of the agent. This paper introduces possible emotional models to control NPCs behavior. The system is based on an agents model interacting with a Rule Based System (RBS) to manage agent emotions, drives and relationships with other agents - the Iterated Prisoners Dilemma (IPD) is used to simulate interactions between agents. The RBS is a separate component of the agent model. It maintains and regulates the agent's emotional states and needs, and provides the data to the agent system to execute a 3D world with animated and skinned agents. The 3D output was created to allow the interactions and drives to be examined based on scenarios and to view the emotional effect of an event on an agent.

#*Magic Story Cube: an interactive tangible interface for storytelling.
#@Zhiying Zhou,Adrian David Cheok,Jiun Horng Pan,Yu Li
#year2004
#confAdvances in Computer Entertainment Technology
#citation14
#index5005
#arnetid5007
#!From of old, storytelling is important for both education and entertainment. With the augmented reality (AR) technology, storytelling becomes more and more interactive and intuitive in the sense of human computer interaction. Although AR technology is not new, it's potential in education is just beginning to be explored. In this demo we present a tangible AR interactive interface for storytelling using physical cube. We embed both the concept of AR and the concept of tangible interaction in the prototype - "Magic Story Cube". Multiple modalities including speech, 3D audio, 3D graphics and touch are used to provide the user (especially children) with multi-sensory experiences in the process of storytelling. Our research explores a new interface for children education and entertainment.

#*Vision-based Korean Manual Alphabet recognition game for beginners.
#@Young-Joon Oh,Keechul Jung
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5006
#arnetid5008
#!The Korean Manual Alphabet (KMA) corresponds to the vocabulary of Korean Sign Language (KSL) and people use this KMA when he/she spells each letter of a word such as a newly coined word without current body language in deaf society [1]. Hearing people usually does not know/understand KSL words, because he/she can use KMA in order to communicate simply with the deaf without learning complex sign languages. Min, et al developed the glove-based KMA recognition using blue-tooth [2]. In this paper, we propose the vision-based KMA recognition game interface using a low price Universal Serial Bus (USB) based camera. We aim to provide that beginners can learn KMA letters easily when playing game at the same time. In addition, the system is able to detect a user's hand from captured images and find out one Korean Alphabet (KA) falling letter in game that corresponds to a KMA letter. We evaluated capabilities of the proposed system in order to provide convenience and reliability to the users.

#*Compelling experiences in mixed reality interactive storytelling.
#@Fred Charles,Marc Cavazza,Steven J. Mead,Olivier Martin,Alok Nandi,Xavier Marichal
#year2004
#confAdvances in Computer Entertainment Technology
#citation-1
#index5007
#arnetid5009
#%56571
#%437933
#%773070
#%55560
#%775046
#%875097
#%874550
#%808176
#%29773
#%464183
#%1011261
#!Entertainment systems promise to be a significant application for Mixed Reality. Recently, a growing number of Mixed Reality applications have included interaction with virtual actors and storytelling. However, AI-based Interactive Storytelling techniques have not yet been explored in the context of Mixed Reality. In this paper, we describe a fully-integrated first prototype based upon the adaptation of an Interactive Storytelling technique to a Mixed Reality system. After a description of the real time image processing techniques that support the creation of a hybrid environment, we introduce the storytelling technique and the essential modalities of user interactions in the Mixed Reality context. Finally, we illustrate these experiments by discussing examples obtained from the system.

#*Jumanji Singapore: an interactive 3D board game turning hollywood fantasy into reality.
#@Zhiying Zhou,Adrian David Cheok,Tingting Chan,Yu Li
#year2004
#confAdvances in Computer Entertainment Technology
#citation3
#index5008
#arnetid5010
#%88799
#!Traditional board games encourage social and physical interactions among players. However, there is a lack of visual and auditory fantasies supported by computer games. In this demo we present an tangible augmented reality (AR) board game, called "Jumanji Singapore", to turn Hollywood fantasy into reality. Players are allowed to transport among physical world, 3D AR world, and 3D virtual reality (VR) world. Physical dices are used to directly interact with AR/VR graphics and control the process of the board game. This demo shows an example of tangible AR interface for interactive board game application.

#*Human Pacman: a mobile wide-area entertainment system based on physical, social, and ubiquitous computing.
#@Adrian David Cheok,Kok Hwee Goh,Wei Liu,Farzam Farbiz,Sze Lee Teo,Hui Siang Teo,Shang Ping Lee,Yu Li,Siew Wan Fong,Xubo Yang
#year2004
#confAdvances in Computer Entertainment Technology
#citation157
#index5009
#arnetid5011
#!Human Pacman is a novel mixed reality interactive entertainment system that ventures to embed the natural physical world seamlessly with a fantasy virtual playground by capitalizing on infrastructure provided by wearable computer, mixed reality, and ubiquitous computing research. We have progressed from the old days of 2D arcade Pacman on screens, with incremental development, to the popular 3D game home console Pacman, and the recent mobile online Pacman. Finally with our research system Human Pacman, we have a physical role-playing computer fantasy together with real human-social and mobile-gaming that emphasizes on collaboration and competition between players in a wide outdoor area that allows natural wide-area human-physical movements. Pacmen and Ghosts are now human players in the real world experiencing computer graphics fantasy-reality by using the wearable computers on them. Virtual cookies and actual tangible physical objects are incorporated into the game play to provide unique experiences of seamless transitions between real and virtual worlds. We believe Human Pacman is pioneering a new form of gaming that anchors on physicality, mobility, social interaction, and ubiquitous computing.

#*The spinning screen: a movable experience between virtual and real.
#@Hyun-Jean Lee,Ali Mazalek,Kirti Goel
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5010
#arnetid5012
#%88799
#%892783
#!In screen-based experiences, the screen itself can become the physical device used for interaction. The "move-ability" of the screen affords interactivity between the screen artifact and the viewer and between the virtual and physical spaces. As a movable screen interface, we have created the spinning screen, a two-sided monitor on a revolving base. This interface invites user interaction through the action of spinning the screen to manipulate media content. By allowing viewers to grasp the interplay between visibility and invisibility, the spinning screen can enrich user experiences of virtual imagery through direct tangible interaction in both playful and practical contexts. We describe an art piece and an application for 3D visualization and modeling.

#*Development of force-feedback device for PC-game using vibration.
#@Sam-ha Choi,Hee-Dong Chang,Kyung-Sik Kim
#year2004
#confAdvances in Computer Entertainment Technology
#citation1
#index5011
#arnetid5013
#%85969
#!Among recent technologies that are applied to game development, virtual reality part is getting much attention for its technological effectiveness in transmitting game processing circumstances in variety that are happening in game world very realistically. In this study we analyze interface for game that is based on a action realization technology and force-feedback technology among technologies for developing virtual reality, in other words, technical analogy on game controller and the positive and negative sides of game controller for each platform. Based on that, more ordinary and effective way to deliver the functions to users in PC game field where application of force-feedback technology is least satisfied. And, Force-Feedback device has been developed to satisfy the users' needs by using vibration.

#*Sound candy.
#@Shuichi Ishibashi,Daisuke Uriu,Naohito Okude
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index5012
#arnetid5014
#!Sound Candy is a device with which anyone in the world can create his/her own playground anywhere of using sounds and movements around him/her. In our daily life, we are surrounded by the "Kings of Entertainment" such as theme parks and home video game machines. However, the entertainment gives us only passively experience without our creation or creativity. In this paper, we suggest Sound Candy designed as the tool with which each user can create a new way of playing actively. In its small body, Sound Candy has two functions as follows. First, it has a recording function. Second, it has a function to integrate recorded sounds and signals from sensors, such as vibration or acceleration caused from variety of movements. Sound Candy can be attached to any part of user's body and almost objects in his/her environments. So users can convert the recorded sound to the one synchronized with various actions by selecting a play mode from four play modes including Angle, Vibration, Speed and Rotation Mode.

#*Augmented Reality Chinese Checkers.
#@Nicholas Cooper,Aaron Keatley,Maria Dahlquist,Simon Mann,Hannah Slay,Joanne Zucco,Ross Smith,Bruce H. Thomas
#year2004
#confAdvances in Computer Entertainment Technology
#citation7
#index5013
#arnetid5015
#%1501689
#%85929
#%459673
#%1047420
#%1047179
#%648307
#%502253
#%593843
#%512749
#!This paper presents an application, Augmented Reality Chinese Checkers that we created to investigate user interface issues for table top projected augmented reality entertainment applications. A new tangible interaction device, the wireless button enhanced fiducial, is introduced to support selection tasks in mixed reality environments. The Augmented Reality Chinese Checkers game is built on a framework which can be used to create other computer supported collaborative games. The system is built using the Passive Detection Framework to track the 6 degrees of freedom position in real time of marked objects in the environment. The game supports up to six players at a time.

#*Space-time travel blogging using a mobile phone.
#@William Bamford,Paul Coulton,Reuben Edwards
#year2007
#confAdvances in Computer Entertainment Technology
#citation29
#index5014
#arnetid5016
#%90293
#%256955
#%121881
#%789398
#!Whilst location based services have long been envisioned as an important element of future mobile user experiences, they have only recently become realizable for the average phone user. This is due to the emergence of: flat rate date tariffs on mobile networks; low cost Bluetooth GPS units and a large user base of phones capable of installing and running applications. In this paper we discuss the design, implementation, and results of a six month open user trial of a space-time photo travel blogging service called LocoBlog. The user experiences, over 1100 photographs from 14 countries, show that such a service is practical, affordable and seen as a new and exciting way of not only recording and sharing travel experiences but also general activities within their daily lives.

#*"SeeSaw videogame" a new multi-user collaborative game device.
#@Diego J. Díaz,Clara Boj Tovar,Moisés Mañas Carbonell
#year2004
#confAdvances in Computer Entertainment Technology
#citation3
#index5015
#arnetid5017

#*Using emotion in games: emotional flowers.
#@Regina Bernhaupt,Andreas Boldt,Thomas Mirlacher,David Wilfinger,Manfred Tscheligi
#year2007
#confAdvances in Computer Entertainment Technology
#citation6
#index5016
#arnetid5018
#%634110
#%334101
#%5225
#%5419
#%88065
#%89342
#%140099
#%90195
#!It can be argued that one of the main reasons for playing games is to achieve an emotional reaction of the player. To be surprised, happy, angry or anxious - to perceive different emotional states - is one of the main reasons to play games. The "Emotional Flowers" game harnesses the player's emotions as the primary means for the game interaction. Within the game the player's facial expression of emotion is used to control the growth of a flower. Multiple players can play "Emotional Flowers" simultaneously. The main idea is to grow the flower as fast as possible based on positive emotions like happiness and surprise. Flowers of all participants within the game are additionally displayed on an ambient display in a public area. This influences not only emotions by the user, but also has an effect on social interactions within the group of players. In this paper, we present design, implementation and evaluation of the "Emotional Flowers" game.

#*Audio-visual interfaces in digital art.
#@Ernest A. Edmonds,Andrew Martin,Sandra Pauletto
#year2004
#confAdvances in Computer Entertainment Technology
#citation2
#index5017
#arnetid5019
#%691372
#!This paper outlines the evolution, in the history of art and technology, of image-sound interface systems. This can be called the evolution of the "audiovisual discourse" in art and technology. Recent software for audio and visual material manipulation is briefly described and audiovisual digital art works, developed during the COSTART Research Project, are illustrated as examples of contemporary artistic projects concerned with this theme. Different artistic approaches in the use of audiovisual systems are identified on the basis of the historical research and the author's work, as artist and technologist, in collaboration with the artists participating to the project. Finally the role of the computer as audiovisual instrument is discussed.

#*An experimental setting to measure contextual perception of embodied conversational agents.
#@Michael Lankes,Regina Bernhaupt,Manfred Tscheligi
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5018
#arnetid5020
#%912167
#%5386
#!We introduce an experimental setting to observe and measure the perception of facial expression performed by embodied conversational agents (ECAs). The experimental set-up enables to measure the implications of embodied conversational agents invarious contextual settings. We developed a matrix, distinguishing three types of stimuli dimensions (simultaneous, sequential, adaptive) and three contextual configurations. The aim of the study is to establish an experimental framework to analyze subjects' emotional status in different context dimensions. The experimental setting helps to close a gap in the intersection of affective computing and embodied conversational agents.

#*A user-centric adaptive story architecture: borrowing from acting theories.
#@Magy Seif El-Nasr
#year2004
#confAdvances in Computer Entertainment Technology
#citation11
#index5019
#arnetid5021
#%769820
#!Interactive virtual environments are becoming increasingly popular for their utility in education, virtual training, and entertainment. These applications often rely on a scenario that is revealed to the user as he/she interacts with synthetic objects and characters that inhabit virtual worlds. Current interactive narrative architectures used in the interactive entertainment industry often use decision trees, which are hard to author and modify. Some interactive entertainment productions are starting to use more generative techniques, such as plan-based or goal-based narrative. In this paper, I present an interactive narrative architecture that extends current research in interactive narrative by integrating a user modeling and user behavior analysis technique, which I argue facilities a more engaging and fulfilling experience. I have implemented the architecture within an interactive story called Mirage. The architecture resulted from an iterative design and development process involving a team that included film and theatre professionals. During this design and development process, I have experimented and evaluated different narrative techniques, which resulted in the proposed architecture.

#*The commentator information system: a usability evaluation of a real-time sport information service.
#@Marie-Anne Midy,Carlos Jensen,Yunrim Park
#year2007
#confAdvances in Computer Entertainment Technology
#citation2
#index5020
#arnetid5022
#%8017
#!Many of the most vivid recollections we have of major sporting events and accomplishments as TV viewers and sports fans are things like scores, statistics, or the TV images of specific events. What make many of these live in our memories, or grab our attention in the first place is often the commentator or sports-caster, their words of wisdom, or lack thereof, the excitement and emotion in their voices, echoing our own. The commentator is a vital part to the sportscast experience, part of what can make watching sports remotely more enjoyable than at the stadium. In order to provide accurate and timely data to TV viewers, radio, or online listeners, commentators sometimes rely on a system called the Commentator Information System (CIS). In this paper we present an in-depth usability study of a CIS, how commentators do their job, how the process may be improved, and how to make sportscasts and simulations more enjoyable in the future.

#*Extending game participation with embodied reporting agents.
#@Dan Fielding,Mike Fraser,Brian Logan,Steve Benford
#year2004
#confAdvances in Computer Entertainment Technology
#citation15
#index5021
#arnetid5023
#%593389
#%459179
#%560487
#%776114
#%29760
#%88277
#!We introduce a multi-agent framework to generate reports of players' activities within multi-player computer games so that other players who are currently unable to participate can keep track of the activities of their colleagues. We describe an initial implementation of our framework as an extension to the Capture the Flag game within Unreal Tournament. We report the results of a preliminary experiment that shows that embodied reporter agents give varying coverage depending on deployment strategies used, and, in particular, suggests that the dynamic assignment of reporter agents by an editor agent can provide more effective coverage than static assignment schemes. Finally, we explore future applications of this work including other genres of games, the emergence of games as spectator sports, implications for pervasive games as well as non-gaming applications.

#*VisiCon: a robot control interface for visualizing manipulation using a handheld projector.
#@Kazuhiro Hosoi,Vinh Ninh Dao,Akihiro Mori,Masanori Sugimoto
#year2007
#confAdvances in Computer Entertainment Technology
#citation5
#index5022
#arnetid5024
#%634469
#%786526
#%453090
#%691626
#%459298
#%634118
#%624916
#%89480
#%1119460
#%90842
#!The miniaturization of image projectors leads to the expectation that projectors could be embedded in mobile devices such as cellular phones and PDAs. A projector mounted on a mobile device, freely movable in 3D space under user control, could operate not only as an output device but also as an input device for enabling humans to manipulate mobile robots. We therefore explore the possibilities of human-robot interaction techniques using handheld projectors. For this purpose, we propose an innovative interface called VisiCon. We have also developed a cooperative game, CoGAME, in which players guide a simple robot using handheld projectors. In this game, users can connect projected maps together, and cooperatively lead a robot to a specified goal. In this paper, we explain the techniques used in CoGAME, and present an evaluation.

#*Defining grief play in MMORPGs: player and developer perceptions.
#@Chek Yang Foo,Elina M. I. Koivisto
#year2004
#confAdvances in Computer Entertainment Technology
#citation-1
#index5023
#arnetid5025
#!In current literature, grief play in Massively Multi-player Online Role-Playing Games (MMORPGs) refers to play styles where a player intentionally disrupts the gaming experience of other players. In our study, we have discovered that player experiences may be disrupted by others unintentionally, and under certain circumstances, some will believe they have been griefed. This paper explores the meaning of grief play, and suggests that some forms of unintentional grief play be called greed play. The paper suggests that greed play be treated as griefing, but a more subtle form. It also investigates the different types of griefing and establishes a taxonomy of terms in grief play.

#*WikiTUI: leaving digital traces in physical books.
#@Chih-Sung (Andy) Wu,Susan J. Robinson,Alexandra Mazalek
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index5024
#arnetid5026
#%44036
#%893674
#%772578
#%88799
#!This article describes the design of WikiTUI, a tangible user interface system that allows readers to manipulate multimedia information tied to page-level locations in common books. This system will also facilitate the exchange of information with other readers using wiki technology. While other projects have coupled the dual worlds of atoms and bits, few have combined the idea of collaborative and distributed authoring with tangible interfaces. WikiTUI not only bridges the real and digital worlds, but facilitates multiple contributions to a reference base spanning across these worlds. The goal of our work is to apply the paradigm of coupling atoms and bits in order to extend the collaborative annotation and authoring possibilities of wiki media.

#*Audio games: new perspectives on game audio.
#@Johnny Friberg,Dan Gärdenfors
#year2004
#confAdvances in Computer Entertainment Technology
#citation34
#index5025
#arnetid5027
#%1116894
#!This paper discusses the design of audio games, a quite new computer game category that originates from games for players with visual impairments as well as from mainstream music games. In the TiM project (Tactile Interactive Multimedia), SITREC develops three sound-based games that point out new directions for game audio design. The TiM games demonstrate different ways in which games can be designed around an auditory experience. Several unique features of audio games are presented emphasising unexplored potentials for interactivity and future development areas are suggested.SITREC proposes an approach to the design of auditory interfaces that takes three listening modes into consideration: casual listening, semantic listening and reduced listening. A semiotic model is presented that illustrates this view on sound object design and ways in which sounds can be combined. The discourse focuses on issues of continuous display, musicality and clarity, and introduces the notion of "spatialised game soundtracks," as opposed to separated background music and game effect sounds.The main challenge when developing auditory interfaces is to balance functionality and aesthetics. Other important issues are the inclusion of meta-level information in order to achieve a high level of complexity and to provide elements of open-endedness. This refers to planning the overall gameplay, as well as to designing individual sound objects and combining them into complex, interactive soundscapes.

#*Tangible comics: a performance space with full-body interaction.
#@Özge Samanci,Yanfeng Chen,Ali Mazalek
#year2007
#confAdvances in Computer Entertainment Technology
#citation-1
#index5026
#arnetid5028
#%89118
#%1043090
#!Tangible Comics is a computer vision based full-body interactive storytelling environment that also functions as a comics generator. Prevailing applications of full-body computer vision have not utilized the full storytelling or performance potential of these environments.allOur aim is to produce an environment that can create a space for redefining the conventions of comics, performance, film, photography, and animation. In relation to that, we are exploring the design problems that can arise when computer vision technology is contextualized in an interactive story telling environment.

#*The effect of stereoscopic viewing of a virtual space on a networked game using haptic media.
#@Masaki Fujimoto,Yutaka Ishibashi
#year2004
#confAdvances in Computer Entertainment Technology
#citation3
#index5027
#arnetid5029
#%481878
#%1503569
#%401124
#!This paper deals with a game in which a user moves an object in a virtual space using haptic media in distributed virtual environments. We make a comparison of the operationality of the game between stereoscopic viewing of the virtual space and normal (i.e., non-stereoscopic) viewing by experiment. We also clarify the relation between the effect of stereoscopic viewing and the deterioration in the operationality owing to the network delay and its jitter. In addition, we calculate the gain of stereoscopic viewing by using experimental results.

#*The spelling bee: an augmented physical block system that knows how to spell.
#@Amnon Dekel,Galit Yavne,Ela Ben-Tov,Yulia Roschak
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5028
#arnetid5030
#%892567
#%1285162
#!Physical games have always been with us. In this paper we explore the utility of adding tangible interfaces and embedded computing into a well known children's ABC spelling blocks game and thus enable it to offer intelligent, immediate and meaningful feedback to the players. We developed a prototype using simple low cost elements and tested it with five children aged 7 - 12. The children understood the functionality of the system almost immediately and found the game easy to use and familiar in appearance, yet at the same time it inspired them to try and spell words in order to elicit feedback. A number of problems were identified and possible solutions are offered.

#*Using frustration in the design of adaptive videogames.
#@Kiel Mark Gilleade,Alan J. Dix
#year2004
#confAdvances in Computer Entertainment Technology
#citation53
#index5029
#arnetid5031
#%90454
#%88373
#%786675
#!In efforts to attract a wider audience, videogames are beginning to incorporate adaptive gameplay mechanics. Unlike the more traditional videogame, adaptive games can cater the gaming experience to the individual user and not just a particular group of users as with the former. Affective videogames, games that respond to the user's emotional state, may hold the key to creating such gameplay mechanics. In this paper we discus how the emotion frustration may be used in the design of adaptive videogames and the ongoing research into its detection and measurement.

#*Interactive digital violin tutor (IDVT): an edutainment system for violin learners.
#@Ye Wang,Jia Zhu
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5030
#arnetid5032
#%502934
#%503174
#%502700
#!We present in this demo our current design of an Interactive Digital Violin Tutor (iDVT), which enables students to have reflective practice when human teachers are not available. iDVT combines violin audio transcription with visualization. Our transcription method is designed for violin audio recorded in home environments. The visualization is designed to be useful to people with different level of music knowledge. The different visualization modalities-video, 2D fingerboard animation, 3D avatar animation-help learners to practice and learn more effectively. The entire system has been implemented with off-the-shelf hardware and shown to be practical in home environments.

#*A lightweight rule-based Al engine for mobile games.
#@Lynne E. Hall,Adrian Gordon,Russell James,Lynne Newall
#year2004
#confAdvances in Computer Entertainment Technology
#citation3
#index5031
#arnetid5033
#%13672
#%13761
#%744412
#%745815
#%744453
#!The growth of the mobile gaming market offers considerable potential for the deployment of engaging and compelling games constructed using AI components and techniques. This paper discusses a rule-based approach for constructing lightweight Game AI systems for deployment on mobile devices. The development environment and the mimosa programming language for constructing Game AI components are outlined. A prototype game of Texas Hold'em Poker implemented using this environment is described. Ideas for future work, including the development of games mentors for deployment on mobile devices are briefly presented.

#*Plot monitoring for interactive narrative games.
#@Guylain Delmas,Ronan Champagnat,Michel Augeraud
#year2007
#confAdvances in Computer Entertainment Technology
#citation6
#index5032
#arnetid5034
#%5178
#%874550
#!Interactive narrative and video games are two fields divided between the will to follow a scenario and that to offer a maximum of freedom and interaction. We propose a method combining emergent narrative theory and game monitoring to create a new system of dynamic generation of narrative. This method is based on a multi-agent architecture, which supervises and monitors the game execution.allIt uses of narrative structures descriptors as a reference to lead the evolution of an emergent narrative world. A first application has been developed to test the validity of the system in term of effectiveness and computational cost.

#*Embodied 3D story space.
#@Junichi Hoshino,Hiroshi Mori,Atsushi Nakano,Jun Takazawa
#year2004
#confAdvances in Computer Entertainment Technology
#citation0
#index5033
#arnetid5035
#%593092
#%593838
#%593656
#%769820
#%520757
#%1062487
#%593158
#!In this paper, we propose the immersive 3D movie system using contextual constraint action model. Important actions that define the structure of the story are called key-actions. Structure of key-action network represents story patterns. Spontaneous actions between key actions are interpolated using action networks. By integrating attention behaviors such as eye contact and joint attention, the user can get feeling that the user is communicating with the actor.

#*Graceful anytime interruptibility for virtual agents.
#@Klaus Brügmann,Helmut Prendinger,Marc Stamminger,Mitsuru Ishizuka
#year2007
#confAdvances in Computer Entertainment Technology
#citation2
#index5034
#arnetid5036
#%70418
#%874774
#%1330618
#!The demo will show two highly expressive virtual agents introducing the audience to a traditional Japanese room. The agent models and gestures have been created by a professional Japanese character designer. By adapting and extending an influential technique ("Verbs and Adverbs"), we added parameterized emotional expression and gesture interruptibility as new behaviors to increase agent believability, interactivity, and responsiveness. In the demo, users will be provided a simple interface to test the new features.

#*Free viewpoint video synthesis and presentation of sporting events for mixed reality entertainment.
#@Naho Inamoto,Hideo Saito
#year2004
#confAdvances in Computer Entertainment Technology
#citation7
#index5035
#arnetid5037
#%438113
#%593959
#%1133404
#%1133749
#%647580
#%593030
#%437918
#%437854
#!This paper presents a new framework for arbitrary view synthesis and presentation of sporting events for mixed reality entertainment. In accordance with the viewpoint position of an observer, virtual view image of sporting scene is generated by view interpolation among multiple videos captured at real stadium. Then the synthesized sporting scene is overlaid onto a desktop stadium model in the real world via HMD. This makes it possible to watch the event in front of the observer. Projective geometry between cameras is used for virtual view generation of the dynamic scene and geometric registration between the real world and the virtual view image of sporting scene. The proposed method does not need to calibrate multiple video cameras for capturing the event and the HMD camera. Therefore it can be applied even to dynamic events in a large space and enables observation with immersive impression. The proposed approach leads to make a new type of mixed reality entertainment for sporting events.

#*Rhythmism: a VJ performance system with maracas based devices.
#@Satoru Tokuhisa,Yukinari Iwata,Masa Inakage
#year2007
#confAdvances in Computer Entertainment Technology
#citation5
#index5036
#arnetid5038
#%5267
#%88799
#%514362
#%87458
#%514583
#%514492
#%789362
#%789464
#%514465
#!We propose a nonconventional VJ performance system rhythmism which uses an original maraca based device that has 2 different functions, material maraca and effect maraca. Rhythmism uses the structure characteristic and the operating characteristics of maracas and adopts the interface to ensure the freedom of the user's physical movement and to realize the powerful attraction of the performance itself and aims to attain the multi-functionality and the arbitrary controllability.allIn this paper, we introduce the advantages and the interaction techniques of the maracas based device when used for VJ performances.

#*Media synchronization between voice and movement of avatars in networked virtual environments.
#@Yutaka Ishibashi,Katsunori Inazumi,Shuji Tasaka,Toshio Asano
#year2004
#confAdvances in Computer Entertainment Technology
#citation4
#index5037
#arnetid5039
#%481878
#%502255
#%330099
#%401124
#%502287
#%894049
#!This paper studies media synchronization control between voice and movement of avatars constructed by computer graphics (CG) in networked virtual environments. For the control, we adopt the virtual-time rendering (VTR) media synchronization algorithm, which the authors previously proposed. In the VTR algorithm, we choose the voice as the master stream and the movement of an avatar as the slave stream. By carrying out an experiment in which we interactively move both arms of the avatar synchronously with the voice, we assess the media synchronization quality and demonstrate the effectiveness of the media synchronization control.

#*Synchronized background music generation for video.
#@Jong-Chul Yoon,In-Kwon Lee
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5038
#arnetid5040
#%1118915
#%1119550
#!We synchronize background music with a video by changing the timing of music, an approach that minimizes the damage to music data. Starting from a MIDI file and video data, feature points are extracted from both sources, paired, and then synchronized using dynamic programming to time-scale the music. We also introduce the music graph, a directed graph that encapsulates connections between many short music sequences. By traversing a music graph, we cangenerate large amounts of new background music, in which we expect to find a sequence which matches the video features better than the original music.

#*An intra-stream synchronization algorithm for haptic media in networked virtual environments.
#@Yutaka Ishibashi,Hidehiko Kasugai,Masaki Fujimoto
#year2004
#confAdvances in Computer Entertainment Technology
#citation-1
#index5039
#arnetid5041
#%481878
#%401124
#%1330710
#!This paper proposes an intra-stream synchronization algorithm for haptic media in networked virtual environments where a user manipulates a CG object collaboratively in a 3-D virtual space by using a haptic interface device. The algorithm behaves as the Virtual-Time Rendering (VTR) algorithm, which the authors previously proposed, on the light traffic conditions and as Skipping algorithm, which was also proposed by them, on the heavy traffic conditions. By experiment, we demonstrate the effectiveness of the proposed algorithm.

#*MiXer: the communication entertainment content by using "entrainment phenomenon" and "bio-feedback".
#@Tomohisa Tomida,Anna Ishihara,Atsuro Ueki,Yoshitaka Tomari,Kensuke Fukushima,Masa Inakage
#year2007
#confAdvances in Computer Entertainment Technology
#citation4
#index5040
#arnetid5042
#!We suggest a new communication entertainment content to create a nonverbal connecting in communication by using human physical information. The "miXer" we produce is a content of attraction type for two people by applying medical discovery such "bio-feedback" and "entrainment phenomenon". In the "miXer" it senses a physical information and feed back them in the information like visualization, sound, and vibration we can recognize, so you can enjoy an unprecedented communication in this fantastic space.

#*A novel interaction system with force feedback between real - and virtual human: an entertainment system: "virtual catch ball".
#@Seung Zoo Jeong,Naoki Hashimoto,Makoto Sato
#year2004
#confAdvances in Computer Entertainment Technology
#citation19
#index5041
#arnetid5043
#%1496582
#%593886
#%88283
#%874774
#%1330647
#%1043069
#%464236

#*Learning onomatopoeic expressions by animation.
#@Miki Namatame,Fusako Kusunoki
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5042
#arnetid5044
#%90511
#!This paper focuses on a design solution to Japanese onomatopoeic accessibility problems for the hard-of-hearing. Our research suggests that the onomatopoeic expressions accompanied by animation would be able to transmit emotional images of words. The animations were more effective than text or video clips. We believe that an animation dictionary would be an effective educational material that is understandable by hard-of-hearing students.

#*From text to images through meanings.
#@Jayakumar S. Kandhasamy,Ming Xie
#year2004
#confAdvances in Computer Entertainment Technology
#citation0
#index5043
#arnetid5045
#%502019
#%593207
#%816853
#%41624
#!Natural language is an easy and effective medium to interact with computers by humans and we foresee that it is an effective way to visualize or realize one's imagination by computer. And it makes the complex task of creating 3D scenes or images faster and easier. As a result, creation of 3D scenes will be seen as just programming the computer with human language such as English. This paper presents a meaning centric framework for text to 3D image system to visualize the meaning of text and we propose an active memory, which is based on object oriented programming technique, to construct the mental world or active database. Thus each word in the active database acts as an agent compared to just a graphic based annotation, which can be found in existing systems. The active memory incrementally acquires and organizes the lexicon of natural language, visual objects and behaviors through real time interaction with the environment (including human masters). Based on the meaning centric framework, we have started the development of a software agent called KnowNet. KnowNet is an on-line learning, tutoring and visualization system for English language, which supports bi-directional learning activities such as human learning from computer and computer learning from human. It uses VRML browser to render 3D images. Most importantly, KnowNet acts as an entertainer for people who is proficient in English language and it act as an English language teacher for those who wants to learn English language.

#*Double dribble: illusionism, mixed reality, and the sports fan experience.
#@Jeffrey Bardzell,Shaowen Bardzell,Craig Birchler,William Ryan
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5044
#arnetid5046
#%5557
#%1116881
#%1312886
#%88543
#%1043133
#!Fans of spectator sports are changing the ways they access sports media faster than major sports leagues and media are changing their delivery approaches. The result is a situation that fails both the marketing and communication needs of the teams/leagues and the fan experience needs of the fans. In this project, we conceptualize a mixed reality platform that connects globally distributed fans to each other and live NBA games in real-time. We ask whether the design direction is even plausible and devise a low-cost experience prototype with which to experiment. We present the findings from two rounds of experimentation. We also see this study as an expansion on the notion of "transformation" in mixed reality including not merely actual changes of states across realities, but also illusory ones, which may contribute to uses of mixed reality in entertainment contexts.

#*Magic mirror: a new VR platform design and its applications.
#@Ig-Jae Kim,Hyun Jin Lee,Hyoung-Gon Kim
#year2004
#confAdvances in Computer Entertainment Technology
#citation2
#index5045
#arnetid5047
#%594034
#!This paper describes a case study of VR platform Magic Mirror and its applications that are economic in development process and cost, flexible by contents and installation conditions, and that has business potential for consumer market. Magic Mirror uses video based virtual world and tangible interaction by motion tracking. Magic Mirror platform enables a user to monitor their action and to collaborate with other users of remote place within attractive interaction feedback. Magic Mirror system gives serious distance learning experience with tutoring and group collaboration. They are presented in public exhibitions and tested by exhibition visitors. They showed application potential of Magic Mirror platform in interactive game, distance learning, and entertainment field.

#*Tabby: designing of coexisting entertainment content in everyday life by expanding the design of furniture.
#@Atsuro Ueki,Maiko Kamata,Masa Inakage
#year2007
#confAdvances in Computer Entertainment Technology
#citation4
#index5046
#arnetid5048
#%686134
#%5625
#%88799
#!We investigated the new entertainment content that seamlessly mixed into our everyday life in the coming ubiquitous era. For this purpose, we attempted to expand the possibility of furniture with interactivity. First, we evaluated the entertaining quality of such "coexisting" entertainment as "comfort" and "pleasure" in everyday life and, consequently, we focused attention on the furniture that is the most familiar objects around us and brings comfortableness to our living environment. We constructed the framework of the "coexisting" entertainment content design that consists of "sustention" and "concurrency" being based on the original quality of furniture and then implemented a prototype named Tabby. Tabby is a "coexisting" content that has both the function of a lamp and the entertaining quality of an interactive content. We also examined "Tabby" by SD method and found its possibility of amplifying the pleasure without decreasing the original comfortable quality. In this paper, for revealing the possibility of "coexisting" entertainment content, we describe our design framework and its expanding ability.

#*How can entertainment improve workers' motivation and their productivity?
#@Itaru Kuramoto,Kazumasa Kashiwagi,Yu Shibuya,Yoshihiro Tsujino,Shigeki Ohtsuka
#year2004
#confAdvances in Computer Entertainment Technology
#citation2
#index5047
#arnetid5049
#%1322976
#%590308
#%87869
#!We still have dull but nonautomated work. The work falls workers' motivation down, so their productivity is decreased. In order to keep their motivation high, we propose the method to install the power of entertainment, which makes people relax, fun and active.In this paper, we discuss what should be the entertainment for workers, and propose the guidelines of it. For instance:• The entertainment should reflect their amount of work.• The amount of work must follow their subjectivity.• The entertainment should not require any operations because it must not distract workers.Then we describe the estimation method of amount of work and an entertainment representation system in detail. The system shows a virtual tree for each worker. This grows up corresponding to his/her subjective amounts of work.As the result of the evaluation experiment, we found the joy of the entertainment can raise up the workers' motivation and their productivity.

#*Hitch haiku: an interactive generation system of haiku.
#@Hideto Obara,Naoko Tosa,Michihiko Minoh
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5048
#arnetid5050
#%571329
#!The theme of our research is "Cultural Computing", which means of cultural translation using scientific methods to represent essentcial aspects of Japanese culture. We study reproducing a traditional Japanese haiku of by computer. Our system condenses an essence of a book into a Haiku, a Japanese minimal poem form. A user chooses arbitrary phrases from a chapter of a famous Japanese essay called "1000 Books and 1000 Nights," which introduces 1000 books covering many genres from all over the world. Then the system generates a Haiku by using the corpus of the essay and several databases dedicated for Haiku generation, then transfers it into English. Thus even foreigners can catch the essence of the book.

#*The sensing board enhanced by interactive sound system for collaborative work.
#@Fusako Kusunoki,Ayako Isyama,Kouji Tokiwa,Takuichi Nishimura
#year2004
#confAdvances in Computer Entertainment Technology
#citation1
#index5049
#arnetid5051
#%90405
#%90707
#%88800
#%90612
#%121910
#%89984
#%634314
#%634069
#%634338
#!In this paper, we describe a new sensing board system enhanced with audio devices. Our previous board system provides users with common display images using tangible pieces, thus, users collaboratively work with visual and tangible information. On the other hand, the proposed system is characterized by the functionality of the direct responses of both sounds and images from the contents. Using the system, we develop three application systems with the following objectives: (1) Users enjoy interaction of sounds and images; (2) Users have high level of engagement; and (3) Users enjoy personal sounds and images. We have carried out experiments to evaluate the benefits and have found that these systems enhance user engagement, participation, and continuous operation.

#*The gopher game: demonstration.
#@Sean Casey,Duncan Rowland
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5050
#arnetid5052
#!The paper "The Gopher Game: A Social, Mobile, Locative Game with User Generated Content and Peer Review" has been published in the proceedings of the ACE2007 conference. In order to further present our work, we are executing a live game demonstration at the conference. This document summarises how the demo is to be exhibited, presents an overview of the gameplay and provides a list of necessary requirements.

#*Multi-Audible table for collaborative work.
#@Fusako Kusunoki,Ikuko Eguchi Yairi,Takuichi Nishimura
#year2004
#confAdvances in Computer Entertainment Technology
#citation2
#index5051
#arnetid5053
#%90405
#%121910
#%89984
#%634314
#%634069
#%1123293
#%634338
#!This paper presents a prototype Multi-Audible system. By Multi-Audible, we mean that plural users have a portable device to hear different audio information during the interaction. The proposed system is an interactive art system that sends auditory information to a user through the device based on the position of that user's finger on a table with touch screen functionality. We describe the hardware and software configuration, contents of the proposed system, and some midterm experimental results.

#*Constructing negotiation of meaning model for task-based language training online game.
#@Kazuhito Shiratori,Rai Chan,Junichi Hoshino
#year2007
#confAdvances in Computer Entertainment Technology
#citation2
#index5052
#arnetid5054
#!In this paper, we propose a model of 'negotiation of meaning' for a task-based language training online game. In the process of acquiring language skill through task-based learning, it is important for learners to try to convey information to one another and reach mutual comprehension through restating, clarifying, and confirming information via the process of communication. Therefore, we constructed a model of negotiation of meaning for an NPC (Non-player Character). When the learner has a conversation with an NPC, the NPC could help the learner get started on or work through a stumbling block via the negotiation of meaning function.

#*Motion editing with data glove.
#@Wai-Chun Lam,Feng Zou,Taku Komura
#year2004
#confAdvances in Computer Entertainment Technology
#citation3
#index5053
#arnetid5055
#%593886
#%593571
#%593589
#%1119107
#%593588
#%593551
#%594155
#%1119523
#%593360
#%586945
#%1330613
#!In this paper, we propose a new method to edit captured human motion data by using the data glove. The animator first wears a glove and mimics the human body motion observed in the graphical display using his/her hand. Then, a mapping function that converts the motion of the hand to that of the whole body will be generated. Finally, by moving the hand in a slightly different way, a new motion with different taste will be generated. For example, after mimicking the walking motion by alternatively moving the index finger and the middle finger, by quickly moving the fingers with larger strides, it is possible to obtain a running motion. To achieve this goal, a method to map the hand motion to the whole body is proposed. Our method can be used not only for editing human motion, but also for controlling human figures in real time environments such as games and virtual reality systems.

#*Personal behavior and virtual fragmentation.
#@Tobias Fritsch,Jochen H. Schiller,Benjamin Voigt
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index5054
#arnetid5056
#%5212
#%512798
#%464275
#!In the last few years the importance of multiplayer games has seen an immense growth. On par with that, the virtual environments (VEs) increased in their size. Today there exist more than 120 MMOGs (Massive Multiplayer Online Games) ranging from FPS (first person shooter) to classic RPG (role playing game) settings. Such an evolution leads to the fact that players start to "live" in a virtual world. Thus each player at least partially merges with his character (playing figure) and acts in the virtual world. Nevertheless there can be huge gaps between ones real and virtual behavior. This paper uses a well balanced set of questions based on the psychological big5 model to show the mentioned gaps between real world and virtual world attitude. The underlying online survey models 30 selected questions about online and real world behavior. The results are stored in a database in order to statistically interpret them afterwards. The analysis includes correlations between deterministic values (such as age, nationality and gender) and traits of the big5 model (like surgery, emotional stability and conscientiousness). Furthermore it contains other surprising conclusions about the difference in behavior.

#*A synthetic traffic model for Quake3.
#@Tanja Lang,Philip Branch,Grenville J. Armitage
#year2004
#confAdvances in Computer Entertainment Technology
#citation64
#index5055
#arnetid5057
#%512761
#%396828
#!This paper presents our development of a synthetic traffic model for the interactive online computer game Quake3. The goal is a traffic model that can be used by researchers and Internet Service Provider engineers to estimate the potential future impact of Quake3 traffic over IP networks. We developed our ns2 simulation model for Quake3's IP traffic by running live network experiments and characterising the observed packet length, packet inter-arrival times, and data rates (in packets- and bits- per second). Our observations are documented in this paper, and we expect our traffic model will assist network planners who wish to better support real-time game traffic.

#*Simplified motion language for 3D computer animation with turtle metaphor.
#@Masayuki Ueno,Kazuma Tanida,Katsuhide Tsushima
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5056
#arnetid5058
#%5257
#!Human visual cognition in 3D is depend on view point, therefore, making 3D animation process is very complex for human. Simplified Motion Language to describe motion for animator has been developed. On this interface, animator describe 3D object motion with motion icons that correspond to elemental motion with turtle metaphor. Arranged icons of elemental motions are combined and synthesized to one motion on each time step, then, the complex motion in animation is generated. Hence, animators without programming skill can also make 3D animation with this system.

#*Multiplayer internet gaming with VRML: a relook.
#@Peter K. K. Loh,S. Phong,Wentong Cai,Tony Kai Yun Chan
#year2004
#confAdvances in Computer Entertainment Technology
#citation0
#index5057
#arnetid5059
#%648036
#!In this paper, we discuss the viability and technical constraints faced when implementing a multiplayer internet game with VRML 2.0.

#*A voice-to-MIDI system for singing melodies with lyrics.
#@Naoki Itou,Kazushi Nishimoto
#year2007
#confAdvances in Computer Entertainment Technology
#citation6
#index5058
#arnetid5060
#%157533
#%634140
#%503073
#!In this paper, we propose a robust Voice-to-MIDI (V to M) system with which a user can input MIDI sequence data by naturally singing melodies with lyrics. A Voice-to-MIDI system translates singing voices into digital musical data, i.e., MIDI sequence data. Therefore, with such a system, users can input melodies intuitively, which releases them from manual translating memorized melodies into chromatic pitches. However, the quality of translation of ordinary Voice-to-MIDI systems is insufficient. One of the most significant problems is the poor accuracy of the segmentation of notes. We solve this problem by employing "rhythmic tapping" concurrently with singing. We examined the proposed method by the accuracy of the numbers of segmented notes and their pitches. As a result, we confirmed that our system outperformed ordinary Voice-to-MIDI systems. Thus, this system satisfies both of easy and intuitive composition of MIDI sequence data and high accuracy of translation of sung data into MIDI sequence data.

#*The intelligent street: responsive sound environments for social interaction.
#@Henrik Lörstad,Mark d'Inverno,John Eacott
#year2004
#confAdvances in Computer Entertainment Technology
#citation8
#index5059
#arnetid5061
#%751778
#!The Intelligent Street is a music installation that is able to respond intelligently to the collective requests of users interacting together. The performance it creates is largely influenced by the collective set of text commands from users' mobile phones. In this way, users in shared environments, subjugated for so long to uncontrollable and often undesired 'Muzak', can now directly influence their sonic environment and collectively create the aural soundscape that they desire. We see our project as enabling inhabitants of any given space from passive consumers to active creators, and anticipate it has significant commercial, social and educational potential.In this paper we present a description of the installation, its software architecture and implementation, as well as a report on subsequent user-evaluation in providing a musical public playground and, moreover, our over-arching goals as musicians and software engineers.

#*How to build a hard-to-use mouse.
#@Florian Mueller
#year2007
#confAdvances in Computer Entertainment Technology
#citation-1
#index5060
#arnetid5062
#%89534
#!Computer games do not afford much physical activity and hence do not require significant energy expenditure, which can contribute to the prevalence of a sedentary lifestyle. A "hand exerciser" handgrip can help strengthen hand and forearm muscles through a simple spring mechanism. We are presenting the mousegrip, an exertion interface to control computer games while simultaneously exercising hand and arm muscles based on a handgrip device. Unlike conventional vision or accelerometer-based exertion interface devices, the mousegrip is very low-cost and supports cheap force-feedback through a simple spring mechanism. Due to its low cost, its mobile form factor and compatibility to existing mouse drivers, the mousegrip can augment traditional mouse interactions with an exertion activity to make exercising more enjoyable, and gameplay healthier. It provides a familiar affordance of interaction and supports increased calorie expenditure, hence contributing to people's fitness. We hope to encourage other researchers to incorporate exertion activity into their interfaces in order to support a healthy lifestyle.

#*Augmenting the virtual domain with physical and social elements: towards a paradigm shift in computer entertainment technology.
#@Carsten Magerkurth,Timo Engelke,Maral Memisoglu
#year2004
#confAdvances in Computer Entertainment Technology
#citation75
#index5061
#arnetid5063
#%88800
#%89338
#%502646
#%892783
#!In this paper, means of enriching computer entertainment experiences by emphasizing physical and social game elements are discussed. A conceptual framework in which the relations between the virtual, the physical, and the social domains are modelled is presented. Interfaces that mediate between the domains are discussed along with a complementary software architecture that helps developing hybrid computer games. Finally, sample games that follow the approach of physical and social augmentation are presented.

#*Playing on a line: location-based games for linear trips.
#@Peter Kiefer,Sebastian Matyas,Christoph Schlieder
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index5062
#arnetid5064
#%5238
#%789517
#%875864
#%1117027
#!Most location-based games are designed for players who move freely around a geographic game board such as a city centre or acampus. By contrast, we discuss design issues for location-based games played when traveling from A to B on a predefined route, e.g. when following a biking trail along a river. We present the results of a simulation study that compares different alternatives of adopting a two-dimensional location-based game to a linear feature. As our running example for a linear location-based game, we use a geographic version of the board game Alak, the most popular linear game from the family of Go games.

#*Dynamic streaming media: creating custom programmes in real-time.
#@Nipan Maniar,William Garrison
#year2004
#confAdvances in Computer Entertainment Technology
#citation0
#index5063
#arnetid5065
#!This demonstration examines the potential of streaming media to deliver custom programmes and interactivity using database systems. It examines the development of the Lifesign Project in the UK where a substantial collection of video programmes were supported by virtual editing tools allowing users to structure programmes for their own needs.

#*The private city through the hot images.
#@Cristina Portalés
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5064
#arnetid5066
#%1043184
#!Hot Images is an artistic mixed reality application that deals with the relation between human beings and city environments, thus proposing a novel cartography and navigation tool for the city. Within the virtual recreated environment of the Hot Images, the inert city is closed to the human field, transforming the cold aspect of the city into the hotness of the close friends and relatives. The user is carrying a laptop where a 3D virtual model of the city is presented within a blue color. Some images of past events related to the user are hidden in the city, and s/he has to find them. As the user gets closer to the images locations, the environment changes to red color. Once the user arrives to a location, s/he can catch some images that will appear mapped on some of the buildings' facades, thus changing the aspect of the city. The location of the user is achieved with a combination of a GPS and an inertial sensor. The interface is done with the Max/MSP Jitter software.

#*AR-bowling: immersive and realistic game play in real environments using augmented reality.
#@Carsten Matysczok,Rafael Radkowski,Jan Berssenbrügge
#year2004
#confAdvances in Computer Entertainment Technology
#citation12
#index5065
#arnetid5067
#%5568
#%379580
#%892783
#%87932
#%464179
#!The game and entertainment industry plays an enormous role within the development and extensive usage of new technologies. They are one major technology driver concerning the development of powerful graphics hardware, innovative interaction devices and efficient game engines.Actual game developments show the trend to include the player with his whole body - the time of sitting in darkened rooms in front of a computer monitor is outdated. Therefore, special hard-and software components have been developed and new user interfaces have been designed allowing an unprecedented game play.The subsequent consequential step is to play games everywhere (independent from time and place), to include the game player completely in the game (high level of immersion) and to integrate the game seamlessly into reality (blurring the edges of reality and virtuality). Therefore, new and innovative technologies must be used. One of these technology is Augmented Reality.In this paper, we describe the use of Augmented Reality to enable an immersive and realistic game play in real environments. As game we chose bowling. To support the bowling game with AR-technology a dedicated concept has been developed. The level of game realism is enhanced by an integrated real-time kinematics multi-body system simulation. A first prototypical realization, which is used for user testings, confirms the previously identified potentials of AR-technology within game entertainment.

#*Immaterial display for interactive advertisements.
#@Ismo Rakkolainen,Artur Lugmayr
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index5066
#arnetid5068
#%503378
#%60970
#%648356
#!We present some of our experiments with the "immaterial" walk-through FogScreen for advertising. We use interactivity for creating visually compelling advertisements with the immaterial screens in mid-air. An immaterial projection screen has many advantages for advertisements and other applications. It is visually intriguing and can also be made two-sided so that the opposing viewers on each side see both their side of the screen and each other through it, and can even walk through it. The screen is unbreakable and stays always clean. Our results show that the audience stayed with the walk-through advertisement over extended periods of time and the overall comments were positive. It was generally assessed to be very captivating and inspiring. However, the whole concept of immaterial, interactive mid-air display is so new that viewers would have needed more instructions for using it, like for example a text in mid-air saying "touch me" or such. This underlines the importance of well-designed content with any media platform.

#*The HoverMesh: a deformable structure based on vacuum cells: new advances in the research of tangible user interfaces.
#@Andrea Mazzone,Christian P. Spagno,Andreas M. Kunz
#year2004
#confAdvances in Computer Entertainment Technology
#citation1
#index5067
#arnetid5069
#%1043333
#%1047372
#%648283
#%648284
#%647352
#!In this paper we propose a novel attempt to develop a spatial tangible user interface (TUI) [1] based on a deformable structure, the so-called HoverMesh. It consists of a stiff cubical, whose upper wall is composed of a deformable mesh of particle filled inflatable cells. This mesh can be deformed by inflating and/or deflating the cubical while consolidating (evacuating) and/or releasing (inflating) the cells. The HoverMesh is both an input and output device and we see its major benefit in the wide interaction area. The haptic feedback modality is thus embedded as well. The first results in our early experiments sustain the concept of a mesh based on inflatable cells.

#*Serious video game effectiveness.
#@Wee Ling Wong,Cuihua Shen,Luciano Nocera,Eduardo Carriazo,Fei Tang,Shiyamvar Bugga,Harishkumar Narayanan,Hua Wang,Ute Ritterfeld
#year2007
#confAdvances in Computer Entertainment Technology
#citation20
#index5068
#arnetid5070
#%893773
#%789371
#%789434
#%89366
#%789410
#!Given the interactive media characteristics and intrinsically motivating appeal, computer games are often praised for their potential and value in education.allHowever, comprehensive research testing these assumptions is still missing. Preliminary comparative studies on the learning effects of games versus traditional media have shown some promise. In this paper, we describe a comparative study that thoroughly investigates the effects of interactivity and media richness on science learning among college students. We also discuss important results and implications yielded from comparisons among four conditions in our experiment (game, replay, hypertext and text).

#*The need for real time consistency management in P2P mobile gaming environments.
#@Duncan McCaffery,Joe Finney
#year2004
#confAdvances in Computer Entertainment Technology
#citation11
#index5069
#arnetid5071
#%296855
#%681661
#%512753
#%519570
#%298571
#%298704
#%1012861
#%343281
#%512811
#!The introduction of more powerful, feature rich, portable handsets is enabling more engaging mobile multimedia entertainment. Improvements in wireless technology infrastructure are enabling access to ubiquitous, always-on data networks. We believe that based on the popularity of multiplayer games over IP networks, there will be significant demand for mobile multiplayer games. Based upon our early trials, we also believe that the current trend for using centralised client/server models will not offer the most suitable architecture to enable them. To support our research we have built a novel augmented reality real time game as a requirements gatherer for gaming in a wireless environment. In this paper we indicate why a centralised approach will not be suitable for real-time interactions. As an alternative we propose a decentralised approach which includes support for consistency and interest management over heterogeneous networked wireless environments.

#*Playing with your brain: brain-computer interfaces and games.
#@Anton Nijholt,Desney S. Tan
#year2007
#confAdvances in Computer Entertainment Technology
#citation17
#index5070
#arnetid5072
#!In this workshop we investigate a possible role of brain-computer interaction in computer games and entertainment computing. The assumption is that brain activity, whether it is consciously controlled and directed by the user or just recorded in order to obtain information about the user's affective state, should be modeled in order to provide appropriate feedback and a context where brain activity information is one of the multi-modal interaction modalities that is provided to the user.

#*Automatic dance generation from music annotation.
#@Hiroshi Mori,Sayuri Ohta,Junichi Hoshino
#year2004
#confAdvances in Computer Entertainment Technology
#citation1
#index5071
#arnetid5073
#!Automatic dance generation from music is useful for various entertainment applications including computer games. In this paper, we propose the automatic dance generation technique from music annotation.

#*Crossing colorful communication: a system for enhancing sound communication.
#@Ryota Oiwa,Mitsuyo Hashida,Haruhiro Katayose
#year2007
#confAdvances in Computer Entertainment Technology
#citation-1
#index5072
#arnetid5074
#!We describe an interactive multimedia application called crossing colorful communication (C.C.C), players of which can enjoy collaborative and interactive media control by speaking or making sound. Players of C.C.C. fire visual bullets, the direction and the size of which are determined by the pitch and the intensity of each player's voice. When bullets collide on the screen, visual and sound effects are created. Players of C.C.C. can enjoy a new style of communication powered by mediatechnologies.

#*Proposal of an algorithm to synthesize music suitable for dance.
#@Hirofumi Morioka,Mie Nakatani,Shogo Nishida
#year2004
#confAdvances in Computer Entertainment Technology
#citation1
#index5073
#arnetid5075
#!The authors come up with an algorithm of synthesizing music that can appropriately express emotions in dances. This algorithm can help one compile music suitable for dance movies or animation films, and is also applicable to any entertainment systems that use music or dance. This algorithm is composed of three modules. The first is the module of computing emotions from an inputted dance, the second that of computing emotions from music in the database and the last that of selecting music suitable for inputted dance via an interface of emotion. Present paper deals with the process of development and evaluation of such algorithm as mentioned above.

#*Plantio: an interactive pot to augment plants' expressions.
#@Satoshi Kuribayashi,Yusuke Sakamoto,Maya Morihara,Hiroya Tanaka
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5074
#arnetid5076
#!This paper introduces an interactive pot called "Plantio" which realizes hybridization between plants and electronic computing systems. The goal for this research is to create an intimate relationship between human and plants. Plantio represents plants' biopotentials changed by surroundings, and it makes various expressions according to daily interactions with human. Plantios' representation begins to have individuality as it interacts with users and environments.

#*Making sense of a game: a preliminary sketch for a semantic approach to games.
#@Gabriele Ferri
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5075
#arnetid5077
#!In this paper a semiotic approach to video games will be presented. Structuralist semiotic notion of text will be criticized for being unable to account for the nonlinear and unstable nature of interactive ludic objects, and Rastier's [9]paradigm will be adopted. Integrating it with recent proposals in semantic of perception [4], a sketch for a semantic and semiotic analytic methodology for computer games will be outlined. Such methodology will be field-tested on the computer game flOw [1].

#*Remote augmented reality for multiple players over network.
#@Daniel Chun-Ming Leung,Pak-Shing Au,Irwin King,Edward Hon-Hei Yau
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5076
#arnetid5078
#%85929
#%459673
#%453330
#%1312805
#%648307
#!Augmented Reality (AR) in multimedia gaming is a dynamic and exciting field of research. One of the challenges is to have multiple users interacting in the networked augmented reality environment. In recent years, camera-based body motion capturing console games, which captures the player's body movement to control the objects rendered by the computer, have been developed. In this paper, we present a system called, Tele-Table which allows multiple users to interact with each other through the network using real objects. Each player's set-up consists of an overhead mounted camera perceiving real objects, a plasma TV placed horizontally to act as a game table, and a computer. One of the most challenging tasks is data synchronization between two terminals. There are mainly three synchronization tasks we need to handle. They are temporal synchronization, spatial synchronization, and game states synchronization between the two terminals. We present these difficulties and present solutions and discussion to solve them. The design goals of the Tele-Table are real-time and realistic user experience. The features of the system are changeable background, using real objects, and real-time augmented reality gaming between two terminals. We outline the system, present the detailed description, and discuss current achievements.

#*Edutaining school pupils for Japanese hand alphabets.
#@Miki Namatame,Yasushi Harada,Fusako Kusunoki,Takao Terano
#year2004
#confAdvances in Computer Entertainment Technology
#citation0
#index5077
#arnetid5079
#!This paper presents Practice! Yubimoji AIUEO (PYA) to let ordinary elementary school pupils learn basic character expressions (AIUEO) of the Japanese hand characters (Yubimoji). PYA at a Personal Computer has an easy-to-use and look-and-feel visual interfaces. This paper describes what are the principles of PYA, how PYA works, and why PYA is effective from the edutainment view.

#*The gopher game: a social, mobile, locative game with user generated content and peer review.
#@Sean Casey,Ben Kirman,Duncan Rowland
#year2007
#confAdvances in Computer Entertainment Technology
#citation30
#index5078
#arnetid5080
#%5302
#%1179282
#%87478
#%5591
#%88277
#%665285
#%89769
#%1450369
#%87382
#%87388
#!This paper introduces 'Gophers', a social game for mobile devices that utilises task oriented gameplay to create a novel entertainment experience. The study combines a number of key research themes: mobile social gaming, acquiring useful data through gameplay and content sharing in mobile settings. The experience of trialling the game in the real world is discussed and the findings from the study are presented.

#*Virtual environment system layered object model.
#@Manuel Oliveira
#year2004
#confAdvances in Computer Entertainment Technology
#citation3
#index5079
#arnetid5081
#%648167
#%1122070
#%893887
#!The current development trend concerning online games and virtual environments has and continues to yield monolithic solutions, which are responsible for the wide proliferation of system implementations. However, there is much overlap of functionality, but the adopted design principles make reusability unfeasible, representing a significant waste of resources.This paper presents an alternative novel approach based on a layered object model, addressing the pitfalls associated to the existing systems. The approach relies on object-oriented methodology coupled with component layered design to system architectures. The aim is to design and implement systems that promote reusability and flexibility, thus allowing system construction based on smaller building blocks.The proposed methodology revolves around a four layered object model consisting of a universal platform, networking, middleware and application. This paper presents a solution for the universal platform - Java Adaptive Dynamic Environment.

#*Pinocchio: conducting a virtual symphony orchestra.
#@Bernd Bruegge,Christoph Teschner,Peter Lachenmaier,Eva Fenzl,Dominik Schmidt,Simon Bierbaum
#year2007
#confAdvances in Computer Entertainment Technology
#citation16
#index5080
#arnetid5082
#%680815
#%89361
#!We present a system that allows users of any skill to conduct a virtual orchestra. Tempo and volume of the orchestra's performance are influenced with a baton. Pinocchio works with several types of batons, differing in tracking method and in algorithms for gesture recognition. The virtual orchestra can be configured, allowing the muting, hiding and positioning of individual musicians or instrument groups in 3D space. The audio and video material is based on a professional recording session with the Bavarian symphony orchestra. Pinocchio's long-term goal is the creation of a multi-modal, device independent framework for gesture-based applications which require motor skills or the control and operation of a complex set of sensors in intelligent house or car driver assistance systems. In this paper, we describe the current development status of the project, detail its usage and finally give an overview over our future project goals.

#*Foot-based mobile interaction with games.
#@Volker Paelke,Christian Reimann,Dirk Stichling
#year2004
#confAdvances in Computer Entertainment Technology
#citation39
#index5081
#arnetid5083
#%238329
#%650971
#!Interaction with mobile applications is often awkward due to the limited and miniaturized input modalities available. This is especially problematic for games where the only incentive to use an application is the pleasure derived from the interaction. It is therefore interesting to examine novel forms of interaction in order to increase the "playability" of mobile games.In this paper we present a simple mobile gaming application on a standard Pocket PC PDA that employs computer vision (CV) as it's main interaction modality. Practical experience with the application demonstrates the feasibility of CV as a primary interaction modality and indicates the high potential of CV as an input modality for mobile devices in the future. Our approach exploits the video capabilities that are becoming ubiquitous on camera equipped smart-phones and PDAs to provide a fun solution for interaction tasks in games like "Pong", "Break-out" or soccer.

#*The dream of Peter Pan: user interaction arts using computer vision techniques.
#@Kirak Kim,Wooup Kwon,Eunsun Choi,Jinsu Park,Mijeong Jeon,Hyesun Ju,Hyunchul Choi,Woonhyuk Baek,Dongwuk Kyoung,Keechul Jung
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index5082
#arnetid5084
#!In this paper, we present the user interaction arts in mixed reality environment using computer vision techniques. In most of the mixed reality environment, user has to wear specific equipment. However, users want to be free from any device and enable them to have more interaction with the computer's scene. In this study, we propose that the user does not need to wear any device, and virtual scenes can be projected everywhere and this creates an excellent platform for user interaction.

#*Performance evaluation of client-side video stream quality selection using autonomous avatars.
#@Peter Quax,Patrick Monsieurs,Wim Lamotte
#year2004
#confAdvances in Computer Entertainment Technology
#citation1
#index5083
#arnetid5085
#%339060
#%1312888
#%593841
#%512825
#!In this paper we present test results performed on our framework for networked virtual environment (NVE) applications that incorporates real-time video communication between avatars. The primary goal of the architecture is to provide efficient scalability for large scale networked virtual environments. To realize this, our solution maximizes client responsibilities and relies on direct client-to-client communication streams. By employing multiple multicast groups to channel the video streams, we achieve bandwidth adaptation at client side with minimal server intervention. This results in a reduced server-load and at the same time guarantees a highly scalable end-result, depending only on the available processing power of the individual connected clients.

#*Quatronome: a stomp box for jam session with movies.
#@Jun Usui,Hirotaka Hatayama,Naohito Okude
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5084
#arnetid5086
#%5217
#!Quatronome is a stomp box to make user's room change into his/her own stage by connecting his/her instrument or microphone and playing it. There has been much equipment aiming for good sounds. However, we found another need for players to play music of one's taste and enjoy playing with others from some fieldworks. By using Quatronome, users can play music together with three movies, and can also record the sound and movie of their performance. Thus users can play music as if he/she were a member of the band.

#*"Fancy a schmink?": a novel networked game in a café.
#@Josephine Reid,Mathew Lipson,Jenny Hyams,Kate L. Shaw
#year2004
#confAdvances in Computer Entertainment Technology
#citation-1
#index5085
#arnetid5087

#*Visuo-haptic collaborative augmented reality ping-pong.
#@Benjamin Knoerlein,Gábor Székely,Matthias Harders
#year2007
#confAdvances in Computer Entertainment Technology
#citation15
#index5086
#arnetid5088
#%453151
#%775046
#%8072
#%131193
#%1312805
#%647582
#%5107
#!In our current work we examine the development of visuohaptic augmented reality setups and their extension to collaborative experiences in entertainment settings. To this end, an expandable system architecture supporting multiple users is one of the most indispensable prerequisites. In addition, system stability, low latency, accurate calibration and stable overlay of the virtual objects have to be assured. In this paper we provide an overview of our framework and present our collaborative example application, an augmented reality visuo-haptic ping-pong game for two players. The users play with a virtual ball in a real environmentwhile, by using virtual bats colocated with haptic devices, they are able to feel the impact of the simulated ball on the bat.

#*Entertainment feature of a game using skin conductance response.
#@Shigeru Sakurazawa,Naofumi Yoshida,Nagisa Munekata
#year2004
#confAdvances in Computer Entertainment Technology
#citation9
#index5087
#arnetid5089
#!There are many computer games in the world, but generally game players challenge either the computer, or real players in the case of many person games. In view of the strong connectivity advocated between communication and entertainment in the field of entertainment computing, the use of biological signals for computer games is of interest. Here, a novel type of game using biological signals was developed as an entertainment device. The change in skin conductance caused by sweating was measured as a signal reflecting the player's agitation during the game. This type of game incorporates various characteristics relating to communication. First, players of the game challenge themselves because they are able to view their detected biological signals. In this situation, a kind of self-reference system is constructed. Second, the environments in which the game is played changed how the game was enjoyed. Third, the game system reveals differences of context between player and observer. From these characteristics, it is considered that the use of biological signals is attractive for entertainment computing.

#*Insectopia: exploring pervasive games through technology already pervasively available.
#@Johan Peitz,Hannamari Saarenpää,Staffan Björk
#year2007
#confAdvances in Computer Entertainment Technology
#citation14
#index5088
#arnetid5090
#%90539
#%459673
#%453330
#%776871
#%5214
#%87478
#%1117027
#%1047093
#%88277
#%89820
#%789398
#%593916
#!We present the pervasive game Insectopia, which have been designed by the approach of utilizing commercially available mobile phones to provide context-dependent gameplay. The design and evaluation of the game is described together with a discussion on how this approach can speed up making pervasive games a viable game genre for the general public.

#*ABRCon, Adaptive oBject Re-CONfiguration: an approach to enhance, repeat playability of games and repeat watchability of movies.
#@Dhananjay Sampath
#year2004
#confAdvances in Computer Entertainment Technology
#citation1
#index5089
#arnetid5091
#%1497800
#%840142
#%464218
#!One of the major issues that exist, while creating a computer game, is its replayability. To increase game replayability is to increase the life of the game. Here I propose a preliminary development of a method to enhance the replayability by binding various objects of a map/environment/level as certain parameters to a 'location' equation which will randomize the allocation of the object's position in a virtual world with respect to its last stored location. This enhances the game's replayable nature as the expectation of an object at a location ceases to exist. The idea finds greatest application in the Action genre games; where as of now, changes in environment can be achieved by changing the entire map whereas a single map could be made more playable by changing the position and the location of the numerous familiar objects that a player encounters, each time he plays that particular level or map. The Game AI could be made adaptive with respect to the player's skill as the game progresses within a level.Adaptive Object Re-Configuration or the ABRCon when applied to the cinema could prove to be an entirely different paradigm. It involves more pre-production work of storing the entire movie in the form of meta data which when fed into a high-performance image processing player would produce the adaptively reconfigured image sequence.

#*Evaluating children's gaming experiences.
#@Regina Bernhaupt,Daniel Schwaiger,Stefan Riegler,David Enthaler
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5090
#arnetid5092
#%88065
#!We present a game for children, developed to inform children about global warming. The main focus is the evaluation of children's user experience with easy to use methods. We show how a field usability study including a questionnaire addressing user experience can be used, to enhance game design. The goal was to evaluate whether the game is fun or not, and what kind of improvements would increase the positive user experience of children.

#*Artificial intelligence based on fuzzy behavior for game programming.
#@Nitiwat Sanornoi,Pitikhate Sooraksa
#year2004
#confAdvances in Computer Entertainment Technology
#citation4
#index5091
#arnetid5093
#!This paper applies the behavior-based control for mobile robots to design the artificial-intelligent characteristics of game programming in order to reduce the complexity of the intelligence features of the enemies in a game. The artificial intelligence in this paper composes of fuzzy system for creation of the natural behavior. This fuzzy model employs Takagi-Sugeno's methodology for building program modules. The character described in the model herein is the enemy of 'Mage in the Demon Zone' game.

#*Interactive AR bowling system by vision-based tracking.
#@Yuko Uematsu,Hideo Saito
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5092
#arnetid5094
#!This paper presents an interactive bowling system using vison-based tracking for AR. With the bowling system, a user can enjoy the bowling game by rolling a real ball down a bowling lane model placed on a tabletop in the real world. On the lane model, there are virtual pins generated with CG. The virtual pins are overlaid onto the input images, which are captured by a web-camera attached to a hand-held tablet PC, according to the camera motion. The camera motion is estimated by multiple 2D markers which are also placed on the tabletop around the lane model. The lane and the ball are also tracked by vision-based tracking. According to the detected ball's trajectory on the lane, the geometrical relationship between the real ball and the virtual pins is computed to judge whether the ball is touching any pins or not. After judging, the pins touching the ball are knocked down. Our vision-based tracking method can run in real-time, so it can also be applied to other interactive applications.

#*Communication environment for sharing fond memories.
#@Masumi Shimizu,Mie Nakatani,Hirokazu Kato,Shogo Nishida
#year2004
#confAdvances in Computer Entertainment Technology
#citation0
#index5093
#arnetid5095
#!Fond memories are kept in one's mind and are used to reminisce from time to time. They provide not only a life of pleasure to those who possess them, but also bonds that tie people who share them together. Utilizing this property, we propose to develop an environment where people can share their feelings for fond memories, as well as empathize and communication with each other.We consider this environment like a park, where you drop in and take a rest on a bench, look at the fountain and feel comfortable atmosphere away from your daily life. Instead of benches or fountains, we provide some triggers for fond memories and create a warm environment for your heart. We named this environment "Reminiscence Park." The triggers for remembering in Reminiscence Park are the old popular songs common to the users' younger days. Such songs are expected to have many connections to people's memory because they are widely listened to.One of the many possible applications we are developing for Reminiscence Park is a prototyping system modeling a music box. Opened by one or more people, the box starts to play a common song from their youth. The box chooses the songs based on their ages and ranks them based on the activeness to their conversation.

#*Exploring social, cultural and pedagogical issuesin AR-gaming through the live lego house.
#@Cristina Portalés,Carlos D. Perales,Adrian David Cheok
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5094
#arnetid5096
#%5408
#%789538
#!Live LEGO House (LLH) is an interactive Augmented Reality (AR) environment to explore coexistence and multicultural factors through gaming. The system consists basically of a physical/real house built with the LEGO blocks, which is enriched with different non-physical/virtual multimedia files (sounds, videos and 3D animations), insisting in social, cultural and pedagogical issues that the AR technology can bring for children. Tactile, visual and auditory stimuli are present at the game.

#*A step towards anywhere gaming.
#@Siddharth Singh,Adrian David Cheok,Soh Chor Kiong
#year2004
#confAdvances in Computer Entertainment Technology
#citation1
#index5095
#arnetid5097
#!In this paper we describe the first stage of work in our ongoing research on novel multi-platform, multi-device Anywhere Gaming system. Developing a networked game that can run seamlessly on different devices with different connectivity methods is a challenging task and various issues have to be addressed. Our approach is to develop a small-scale, real-time, multiplayer game which can be then used to study these issues. Our multi-player networked Pong game can be played in real-time on mobile devices and stationary PCs. The system comprises the Sony-Ericsson P800 phone, a central game server, and personal computers.

#*Purple crayon: from sketches to interactive environment.
#@Min Xin,Ehud Sharlin,Mario Costa Sousa,Saul Greenberg,Faramarz Samavati
#year2007
#confAdvances in Computer Entertainment Technology
#citation4
#index5096
#arnetid5098
#%634144
#%90553
#%70274
#%1043090
#!Abstract controls often required for gameplay hinder the potential for social interaction, especially in domestic settings. Purple Crayon, an interactive electronic entertainment environment for children, attempts to reclaim the sociable qualities of traditional entertainment occurring in the physical world by replacing abstract controls with intuitive interaction. Purple Crayon allows children to sketch virtual entities and interact with them in a physical manner. The sketched entities become animated and playful and afford interaction within their physical locality or between several localities. Various techniques for physical interaction are explored, demonstrating the feasibility and promise of the approach.

#*Augmented reality post-it system.
#@Siddharth Singh,Adrian David Cheok,Guo Loong Ng,Farzam Farbiz
#year2004
#confAdvances in Computer Entertainment Technology
#citation1
#index5097
#arnetid5099
#!The Augmented Reality Post-It (AR Post-It) messaging system uses the mobile phone as an augmented reality (AR) interface allowing users to view electronic messages in an AR context. The distinguishing feature of the system is that the messages are displayed only when the receiver is present at the location specified by the sender. Our system does not use any sophisticated location tracking technology, instead making use of simple fiducial markers to tag different locations. The sender posts messages over the internet to the mobile phone user, specifying the location where the message should be displayed. These messages are stored in a central server, and downloaded onto the phone when the recipient uses her phone's digital camera to view a marker.

#*SoundSpot: a next-generation audio-guide system for museums.
#@Fusako Kusunoki,Ichiro Satoh,Hiroshi Mizoguchi,Shigenori Inagaki
#year2007
#confAdvances in Computer Entertainment Technology
#citation6
#index5098
#arnetid5100
#%538751
#!In this paper, we propose a system called SoundSpot, which is A Next-generation Audio-guide System for museums. Although the original goal of the system is to solve problems in audio-based annotations, the system can attract a lot of interest as an magical entertainment system. So though the system we aim that children can enhance their motivation to know information which are related to exhibitions. We evaluated the system in a Japanese science museum and confirmed its effectiveness.

#*Carplication: a rhetorical study information racer.
#@Steffen P. Walz,Gerhard M. Buurman,Christoph Wartmann,Simon Schirm,Ádám Moravánszky,Ronald Vuillemin
#year2004
#confAdvances in Computer Entertainment Technology
#citation0
#index5099
#arnetid5101
#!In this paper, we summarize our one-level single player game Carplication, a "study information racer" which we produced to let prospective students, as well as third parties, testplay and experience our newly established three-year Game Design B.A. program in an enjoyable, content appropriate rhetorical form.

#*Understanding social interaction in world of warcraft.
#@Vivian Hsueh-hua Chen,Henry Been-Lirn Duh
#year2007
#confAdvances in Computer Entertainment Technology
#citation20
#index5100
#arnetid5102
#%1043059
#%121629
#%88130
#!Research has argued that social interaction is a primary driving force for gamers to continue to play Massive Multiple Online Role Playing Games (MMORPGs). However, one recent study argues that gamers don't really socialize with other players but play alone. Part of the confusion over whether players socialize much and/or enjoy socializing while playing MMORPGs may be due to the lack of a conceptual framework that adequately articulates what is meant by 'social interaction in MMORPGs to understand how users experience interactions within the game. This study utilized ethnography to map out social interaction within the game World of Warcraft. It provides a broad framework of the factors affecting social interaction. The framework developed can be further verified and modified for future research.

#*Gaze-triggered selective information display.
#@Junji Watanabe,Hideyuki Ando,Taro Maeda
#year2004
#confAdvances in Computer Entertainment Technology
#citation2
#index5101
#arnetid5103
#!We propose a 2 dimensional information display triggered by the eye movement of the viewer. This display is composed of two units, a rapid frame rate camera and a single LED (Light Emitting Diode) array. The camera captures images around the viewer's eyeball. When the display detects the viewer's rapid eye movement known as a saccade, the LED array flickers synchronized with the saccade. Through the retinal afterimages drawn by the saccade, the viewer can perceive 2D images with only a single light array. If we can detect the viewer's saccade as it occurs in real-time we can successfully show 2D images by flickering the light sources within its interval. Additionally, if we can detect when and who makes saccades, the gaze-triggered display can present different 2D images to each person using only one light array. Considering these characteristics, gaze-triggered display can be a new type of augmented reality visual display.

#*Augmenting amusement rides with telemetry.
#@Brendan Walker,Holger Schnädelbach,Stefan Rennick Egglestone,Angus Clark,Tuvi Orbach,Michael Wright,Kher Hui Ng,Andrew French,Tom Rodden,Steve Benford
#year2007
#confAdvances in Computer Entertainment Technology
#citation7
#index5102
#arnetid5104
#%89979
#!We present a system that uses wireless telemetry to enhance the experience of fairground and theme park amusement rides. Our system employs wearable technologies to capture video, audio, heart-rate and acceleration data from riders, which are then streamed live to large public displays and are also recorded. This system has been embedded into a theatrical event called Fairground: Thrill Laboratory in which riders are first selected from a watching audience and their captured data is subsequently presented back to this audience and discussed by experts in medical monitoring, psychology and ride design. Drawing on our experience of deploying the system on three contrasting rides, during which time it was experienced by 25 riders and over 500 audience members, we reflect on how such telemetry data can enhance amusement rides for riders and spectators alike, both during and after the ride.

#*The soul of ActiveCube: implementing a flexible, multimodal, three-dimensional spatial tangible interface.
#@Ryoichi Watanabe,Yuichi Itoh,Masatsugu Asai,Yoshifumi Kitamura,Fumio Kishino,Hideo Kikuchi
#year2004
#confAdvances in Computer Entertainment Technology
#citation35
#index5103
#arnetid5105
#%593058
#%88268
#%892567
#%459161
#%90222
#%88445
#%88799
#%647467
#!ActiveCube is a novel user interface which allows intuitive interaction with computers. ActiveCube allows users to construct and interact with Three Dimensional (3D) environments using physical cubes equipped with input/output devices. Spatial, temporal and functional consistency is always maintained between the physical object and its corresponding representation in the computer. In this paper we detail the design and implementation of our system. We describe the method we used to realize flexible 3D modeling by controlling the recognition signals of each face in each cube. We also explain how we integrated additional multimodal interaction options by a number of sophisticated I/O devices and by the inclusion of a second microprocessor in our cubes. We argue that ActiveCube, with its current real-time multimodal and spatial capabilities, is ready to enable a large range of interactive entertainment applications that were impossible to realize before.

#*How appearance of robotic agents affects how people interpret the agents' attitudes.
#@Takanori Komatsu,Seiji Yamada
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index5104
#arnetid5106
#%90444
#%459460
#!An experimental investigation of how the appearance of robotic agents affects interpretations people make of the agents' attitudes is described. We conducted a psychological experiment where participants were presented artificial sounds that can make people estimate specific agents' primitive attitudes from three kinds of agents, e.g., a Mindstorms robot, AIBO robot, and normal laptop PC. They were also asked to select the correct attitudes based on the sounds expressed by these three agents. The results showed that the participants had higher interpretation rates when a PC presented the sounds, while they had lower rates when Mindstorms and AIBO robots presented the sounds, even though the artificial sounds expressed by these agents were completely the same.

#*Scene-driver: a narrative-driven game architecture reusing broadcast animation content.
#@Annika Wolff,Paul Mulholland,Zdenek Zdráhal
#year2004
#confAdvances in Computer Entertainment Technology
#citation5
#index5105
#arnetid5107
#%88445
#%875097
#!Currently there is much interest in the development of computer and DVD-based games and activities that supplement or are marketed alongside broadcast television content. Scene-Driver was developed for the purpose of reusing content from an animated children's television series within the context of a narratively coherent game. Content from the children's television series "Tiny Planets" was used in the development and testing of Scene-Driver. Each episode of the series has been divided into a collection of scenes, each of which represents a narrative unit such as conflict introduction and resolution. The game is aimed at children of the ages 5-7 and an interface has been developed which can be intuitively used by children of this age. This interface takes the form of "domino-like" tiles which depict characters and objects from the television series (unlike ordinary dominoes that have numbers on either side). The tiles can be played according to different game rules. The child's choice of tile influences the direction of a narrative. The game and interface have been tested with children of the target age range in two evaluation studies. Both studies demonstrated the potential of Scene-Driver to produce engaging narratively coherent games using children's animation content.

#*Performance of input devices in FPS target acquisition.
#@Poika Isokoski,Benoît Martin
#year2007
#confAdvances in Computer Entertainment Technology
#citation7
#index5106
#arnetid5108
#%948609
#%913436
#!We evaluated the performance of a wheel mouse, an XBox360 controller, the combination of a mouse and a keyboard, and a Trackmouse in FPS target acquisition. The device combinations where mouse was used for aiming performed better than the Xbox360 controller.

#*CamBall: augmented networked table tennis played with real rackets.
#@Charles Woodward,Petri Honkamaa,Jani Jäppinen,Esa-Pekka Pyökkimies
#year2004
#confAdvances in Computer Entertainment Technology
#citation6
#index5107
#arnetid5109
#%648307
#%438016
#!We present a computer system for natural interaction in an augmented virtual environment, enabling people to play table tennis over Internet/LAN with real rackets. No special hardware is required except for the web cameras. The pose of the rackets is computed by marker detection from the image. The players see each other in the camera image, which is streamed real time over the network. The multicast implementation enables a network audience to view the game, too.

#*Tangible interaction in tabletop games: studying iconic and symbolic play pieces.
#@Saskia Bakker,Debby Vorstenbosch,Elise van den Hoven,Gerard Hollemans,Tom Bergman
#year2007
#confAdvances in Computer Entertainment Technology
#citation10
#index5108
#arnetid5110
#%90612
#%88268
#%89984
#%634069
#%89338
#%699879
#%88799
#%789354
#%235946
#%89816
#%634338
#%892783
#!In this paper, a study is described which investigates differences in game experience between the use of iconic and symbolic tangibles in digital tabletop interaction. To enable this study, a new game together with two sets of play pieces (iconic and symbolic) was developed and used in an experiment with 30 participants. In this experiment, the understanding of the game, the understanding of the play pieces and the fun experience were tested. Both the group who played with iconic play pieces and the group who played with symbolic play pieces were proven to have a comparable fun experience and understanding of the game. However, the understanding of the play pieces was higher in the iconic group and a large majority of both groups preferred to play with iconic play pieces rather then symbolic play pieces.

#*Frontmatter.
#@
#year2004
#confAdvances in Computer Entertainment Technology
#citation0
#index5109
#arnetid5111

#*Beowulf: an audio mostly game.
#@Mats Liljedahl,Nigel Papworth,Stefan Lindberg
#year2007
#confAdvances in Computer Entertainment Technology
#citation-1
#index5110
#arnetid5112
#%5211
#%5360
#%691431
#%5025
#%89982
#%87729
#!This paper stresses the importance and benefits of developing technique that let people use, reflect on and develop their capabilities to move, to imagine and to feel, and not only replace these abilities with computer technology. This paper describes a project that shifts focus from eye to ear in a computer game application in order to start answering questions about sound's ability to help users create inner, mental pictures and emotional responses to a game world. Can removing components from a computer game concept enhance the experience? Is less more.

#*Machine learning techniques for FPS in Q3.
#@Stephano Zanetti,Abdennour El Rhalibi
#year2004
#confAdvances in Computer Entertainment Technology
#citation20
#index5111
#arnetid5113
#%1495733
#!This paper presents a First Person Shooter Artificial Intelligence system that makes use of machine learning capabilities to achieve more human-like behavior and strategies. The AI is trained with a supervised learning paradigm using example recorded during the observation of expert human players. The Machine Learning section of the AI is based on various Feed Forward Multi-layer Neural Networks trained by Genetic Algorithms. The AI system is developed and tested in the Quake 3 Arena game engine. The system is able to learn certain behaviors but still lack on some others. The results are evaluated and possible improvements are proposed.

#*Application of dimensionality reduction techniques to HRTFS for interactive virtual environments.
#@Bill Kapralos,Nathan Mekuz
#year2007
#confAdvances in Computer Entertainment Technology
#citation5
#index5112
#arnetid5114
#!Fundamental to the generation of 3D audio is the HRTF processing of acoustical signals. Unfortunately, given the high dimensionality of HRTFs, incorporating them into dynamic/interactive virtual environment and gaming applications is computationally very demanding. This greatly limits the performance of such applications that incorporate real-time 3D audio. This paper examines the application of data reduction models to HRTFs. In particular, the locally linear Isomap, Locally Linear Embedding (LLE), and the globally linear Principal Components Analysis (PCA) dimensionality reduction tools are applied to the MIT HRTF dataset. Our motivation is to project the inherently high-dimensional space inherent in HRTF measurements onto a lower dimensionality such that they can be incorporated into interactive virtual environments and gaming applications.

#*Your way your missions: from location-based to route-based pervasive gaming.
#@Ling Chen,Steve Benford
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index5113
#arnetid5115
#%789354
#!In this paper, we describe the design and implementation of a route-based pervasive game named Your Way Your Missions (YWYM). Since the game obtains the planned routes of players and returns missions in the routes, players can play the game in a casual way, without changing their routes to respond to picked up missions. A self-reporting method is proposed to obtain the planned routes of players, and a corresponding route defining tool is developed upon Google Maps. Two approaches to realize route-based mission adaptation with spatial databases are presented.

#*Development of an augmented reality game by extendinga 3D authoring system.
#@Christian Geiger,Jörg Stöcklein,Florian Klompmaker,Robin Fritze
#year2007
#confAdvances in Computer Entertainment Technology
#citation7
#index5114
#arnetid5116
#%453330
#%5354
#!In this paper, we describe the development of augmented reality games using the virtools dev 3D authoring system and custom extensions that allows to integrate augmented reality features and advanced interaction techniques. We used this system to create an AR game by extending an existing board game with virtual objects. The concept of predefined high-level building blocks and the visual programming environment supports the iterative design approach and allows to quickly develop and test new game ideas.

#*Plantio: an interactive pot to augment plants' expressions.
#@Satoshi Kuribayashi,Yusuke Sakamoto,Maya Morihara,Hiroya Tanaka
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5115
#arnetid5117
#!This paper introduces an interactive pot called "Plantio" which realizes hybridization between plants and electronic computing systems. The goal for this research is to create an intimate relationship between human and plants. Plantio represents plants' biopotentials changed by surroundings, and it makes various expressions according to daily interactions with human. Plantios' representation begins to have individuality as it interacts with users and environments.

#*Shared virtual environment (SVE): a framework for developing social games.
#@M. Carmen Juan Lizandra,Mariano Alcañiz Raya,Luciano Gamberini,Irene Zaragozá,Francesco Martino
#year2007
#confAdvances in Computer Entertainment Technology
#citation-1
#index5116
#arnetid5118
#%928941

#*Panorama-based immersive story environment.
#@Atsushi Nakano,Rai Chan,Junichi Hoshino
#year2004
#confAdvances in Computer Entertainment Technology
#citation-1
#index5117
#arnetid5119

#*Shootball: the ball sport using dynamic goals.
#@Yoshiro Sugano,Yuya Mochizuki,Toshiya Usui,Naohito Okude
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5118
#arnetid5120
#%88800
#%5157
#%789376
#!Shootball is a goal-based ball game played in a field surrounded by 4 screens linked to each other. The game uses a ball with an embedded wireless sensor. In shootball, players are given the ability to move the location of the goal on will. Various attack patterns for multi-directions can be performed by effectively utilizing this mechanic. In enjoying the gameplay of shootball, players shall be able to experience a creative style of play and team communication not seen in previous goal-based sports.

#*Nail-mounted tactile display for boundary/texture augmentation.
#@Hideyuki Ando,Eisuke Kusachi,Junji Watanabe
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5119
#arnetid5121
#!We developed a device that can superimpose tactile information onto an object displayed on a computer monitor. With this device, we can present tactile sensations of boundaries or textures corresponding to the visual image. The device is composed of a small voice coil, and the tactile sensations are generated by controlling the modulation of the waveforms. For demonstration proposes, the device is integrated with a tool that allows users to draw a picture easily with their fingertips while experiencing tactile feedback.

#*Pileus: umbrella type entertainment browser.
#@Sho Hashimoto,Takashi Matsumoto,Naohito Okude
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5120
#arnetid5122
#%501880
#!Pileus is the Umbrella type Entertainment Browser to interact photos and videos on web services in urban environment, as a platform of interact with small personal entertainment contents in daily life. It was demonstrated at Ubicomp 2006, but current implementation works only indoor environment. In this paper, we describe upgrading system of Pileus in field-testing at city.

#*Methods for evaluating games: how to measure usability and user experience in games?
#@Regina Bernhaupt,Manfred Eckschlager,Manfred Tscheligi
#year2007
#confAdvances in Computer Entertainment Technology
#citation22
#index5121
#arnetid5123
#%88065
#%789319
#!This workshop addresses current needs in the games developers' community and games industry to evaluate the overall user experience of games. New forms of interaction techniques, like gestures, eye-tracking or even bio-physiological input and feedback present the limits of current evaluation methods for user experience, and even standard usability evaluation used during game development. This workshop intends to bring together practitioners and researchers sharing their experiences using methods from HCI to explore and measure usability and user experience in games. To this workshop we also invite contributions from other disciplines (especially from the games industry) showing new concepts for user experience evaluation.

#*Procedural generation of stylized 2D maps.
#@Mores Prachyabrued,Timothy Roden,Ryan G. Benton
#year2007
#confAdvances in Computer Entertainment Technology
#citation4
#index5122
#arnetid5124
#%236341
#%1119369
#!Outdoor worlds are often the setting for games and game worlds are often accompanied by a stylized version of the world drawn by an artist as a 2D map. Procedurally generating the terrain allows games to have a higher replay value. A limitation of procedural terrain generation is an artistic map of the terrain cannot be created by an artist beforehand. We propose an algorithm for generating a stylized 2D map from a simple procedurally generated 2D basis map. Our algorithm could be used in a game to generate stylized maps at execution time or in an offline application to serve as a guideline for an artist.

#*IGameFloor: a platform for co-located collaborative games.
#@Kaj Grønbæk,Ole Sejer Iversen,Karen Johanne Kortbek,Kaspar Rosengreen Nielsen,Louise Aagaard
#year2007
#confAdvances in Computer Entertainment Technology
#citation14
#index5123
#arnetid5125
#%256982
#%1028553
#%1047076
#%88799
#%89793
#%5694
#%89858
#%789398
#%90008
#!This paper introduces a novel interactive floor platform for social games and entertainment involving multiple co-located users in a collaborative game environment. The interactive floor used as the prototype platform, is a 12 m2 glass surface with bottom projection and camera based tracking of limb (e.g. foot, hand, and knee) contact points. The iGameFloor platform supports tracking of limb points for more than 10 users at the same time. This paper describes the technological platform and the interaction techniques used for social gaming and entertainment. Three iGameFloor applications are discussed with the purpose of displaying the potential of the physical computer game platform. Experiences and perspectives for further development of the iGameFloor platform are discussed.

#*CaMus: collaborative music performance with mobile camera phones.
#@Michael Rohs,Georg Essl
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index5124
#arnetid5126
#%771677
#%1117031
#%334310
#%514460
#%514415
#%514417
#%514582
#%514594
#%495403
#%514647
#%90717
#%90858
#!CaMus2 is a multi-user multi-phone extension of the CaMus system. Mobile camera phones use their cameras to track position, rotation, height, and other parameters over a marker sheet to allow interactive performance of music. Multiple camera phones can use the same or separate marker sheets and send their interaction parameters via Bluetooth to a computer where the sensor information is converted to MIDI format to allow control of a wide range of sound generation and manipulation hardware and software. The semantics of the mapping of MIDI message to performance parameters of the camera interactions are fed back into the visualization on the camera phone.

#*Collaborative immersive gaming over the high speed internet.
#@Takuya Abe,Tomoyuki Nazu,Masa Inakage
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5125
#arnetid5127
#%593209
#%437646
#%5181
#%5190
#!dotSPACE is an entertainment tool designing a new type of interactive communication. We use 10Gbps network, 10 displays multi-projection system and wearable wireless sensors to give an immersive experience to each player at each base on different remote locations. Therefore, players can communicate with each other through their own body movements.

#*Inter-glow: interaction by controlling light.
#@Takuji Narumi,Atsushi Hiyama,Tomohiro Tanikawa,Michitaka Hirose
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5126
#arnetid5128
#%538720
#!inter-glow is a system that facilitates close interaction and communication among users in real spaces by using multiplexed visible-light communication technology. By pointing light to shine on an object contains an embedded photo sensor, users can get information about the object. In addition, several users can communicate with each other intimately by shining light on the object at the same time. We built a prototype to show the technology plain. In our prototype, when users shine lamps on a table in a miniature living room, the system recognizes which lamps are illuminated the table. According to the combination of illuminating lamps, the system produces family conversations.

#*Transmedial interactions and digital games.
#@Shaowen Bardzell,Vicky Wu,Jeffrey Bardzell,Nick Quagliara
#year2007
#confAdvances in Computer Entertainment Technology
#citation2
#index5127
#arnetid5129
#%686137
#%459374
#%89233
#!As virtual worlds and games grow in both personal and cultural importance, present limitations in access to them is increasingly limiting their ability to achieve their potential. Transmedial access, in which a given player's access to a game is made possible across different devices, offers a promising solution to this problem. It also inaugurates a new category of interaction design: transmedial interaction. This workshop explores the state of the art of transmedial interaction in games, which today unfortunately is often at most mere afterthought. It provides a participatory environment in which attendees can chart new paths forward, from developing viable business models and understanding the technical infrastructure to developing critical vocabularies and evaluative frameworks.

#*"game_of_life": interactive art installation using eye-tracking interface.
#@Mika Satomi,Christa Sommerer
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index5128
#arnetid5130
#%190298
#%514552
#!In the field of new media art, HCI techniques are often used to let spectators interact with the artwork itself. In the interactive art installation "game_of_life" an eye-tracking interface is used by the spectators. The installation tries to merge the unique experience of the eye-tracking interface with an interactive art expression.

#*Building a table tennis game for three players.
#@Florian Mueller,Martin R. Gibbs
#year2007
#confAdvances in Computer Entertainment Technology
#citation1
#index5129
#arnetid5131
#%88800
#%5259
#%464236
#%89534
#%711250
#%5107
#!Physical leisure activities such as table tennis provide healthy exercise and can offer a means to connect with others socially; however, players have to be in the same physical location to play. Networked computer games support players in geographically distant locations, but their communication channel is often limited to text or audio only. Furthermore, recent input devices that encourage exertion often do not support adequate force-feedback. We have developed a networked table tennis-like game that is played with a real paddle and ball, augmented with a large-scale videoconference. Similar to networked computer games, this concept can support more than two locations, while simultaneously aiming to provide similar benefits known from traditional physical leisure activity such as exercise, enjoyment and bringing people together to socialize.

#*Capture the flag: simulating a location-based mobile game using the wizard-of-oz method.
#@Regina Bernhaupt,Stefan Jenisch,York Keyser,Manuel Will
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index5130
#arnetid5132
#%5480
#%87478
#%89208
#!We present a wizard of Oz framework for the simulation of location-based mobile games. We explore briefly the methodological concept of Wizard of Oz and show, based on a case study, advantages and shortcomings of the method. The case study realized a game called capture-the-flag. We show how such prototypes can be evaluated in a real field trial.

#*Controllable water particle display.
#@Shin'ichiro Eitoku,Kotaro Hashimoto,Tomohiro Tanikawa
#year2006
#confAdvances in Computer Entertainment Technology
#citation3
#index5131
#arnetid5133
#!We propose the new concept," Controllable particle display", there is no display in space and the space itself is a display. Moreover realizing the concept, we also propose a system of using a set of water drops designed to form a plane surface and developed a prototype system. In this paper, for long-term use, we improved this system to have the enough strength with standing long-term use.

#*The soundtrack of your mind: mind music - adaptive audio for game characters.
#@Mirjam Eladhari,Rik Nieuwdorp,Mikael Fridenfalk
#year2006
#confAdvances in Computer Entertainment Technology
#citation12
#index5132
#arnetid5134
#%520760
#%5360
#%514649
#%514673
#!In this paper we describe an experimental application for individualized adaptive music for games. Expression of emotion is crucial for increasing believability. Since a fundamental aspect of music is it's ability to express emotions research into the area of believable agents can benefit from exploring how music can be used. In our experiment we use an affective model that can be integrated to player characters. Music is composed to reflect the affective processes of mood, emotion, and sentiment. The composition takes results of empirical studies regarding the influence of different factors in musical structure on perceived musical expression into account. The musical output from the test application varies in harmony and time signature along a matrix of moods, moods that change depending on what emotions are activated during game play.

#*Straw-like user interface: virtual experience of the sensation of drinking using a straw.
#@Yuki Hashimoto,Naohisa Nagaya,Minoru Kojima,Satoru Miyajima,Junichiro Ohtaki,Akio Yamamoto,Tomoyasu Mitani,Masahiko Inami
#year2006
#confAdvances in Computer Entertainment Technology
#citation8
#index5133
#arnetid5135
#%438071
#%647700
#!The Straw-like User Interface is a novel interface system that allows us to virtually experience the sensations of drinking. These sensations are created based on referencing sample data of actual pressure, vibration and sound produced by drinking from an ordinary straw attached to the system. This research of presenting virtual drinking sensations to mouth and lips is the first in the world to have been attempted, and comes with high academic expectations. Moreover, due to the high sensitivity of the mouth and lips when used as a sensor, it is possible to develop many unique interfaces and so this could facilitate an extension of research fields in both interactive arts and entertainment.

#*A fast eye location method using ordinal features.
#@Xuetao Feng,Yangsheng Wang,Li Bai
#year2006
#confAdvances in Computer Entertainment Technology
#citation4
#index5134
#arnetid5136

#*Some positive effects of online gaming.
#@Ian Frank,Nobuhisa Sanbou,Katsuaki Terashima
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5135
#arnetid5137
#!We believe that Internet and computing technology have reached the stage where online games can offer an experience that is qualitatively different to what has gone before. To test how exposure to modern games could be of benefit to players, we recruited 12 subjects to play the MMORPG (Massively Multiplayer Online Role Playing Game) "Nobunaga no Yabou Online", collecting data over two months. We evaluated subjects before and after playing, using psychological tests and tests of communication skill, typing skill and knowledge of the Internet and of online games. While the psychological tests showed no significant changes in the subjects' state of mind, there were measurable improvements in online communication skill, typing skill and knowledge, with the largest increases experienced by the subjects with least Internet experience.

#*Sharelog: digital public art interaction by using "Suica".
#@Kotaro Hashimoto,Yasuhiro Suzuki,Tomohiro Tanikawa,Toshio Iwai,Michitaka Hirose
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5136
#arnetid5138
#%5288
#!In this paper, we propose a novel media art installation that uses personal item as the interface and as the exhibit at the same time. We conclude that our media art installation is an effective medium to encourage communication among our visitors.

#*Media synchronization control with prediction in a remote haptic calligraphy system.
#@Yutaka Ishibashi,Toshio Asano
#year2007
#confAdvances in Computer Entertainment Technology
#citation6
#index5137
#arnetid5139
#%1043255
#%775767
#%773788
#%512752
#%1330710
#%512773
#%783848
#!This paper presents a remote haptic calligraphy systemwhich can control a remote haptic interface device with another haptic interface device. In the system, a teacher can instruct a student at a remote location how to use a calligraphy brush while conveying the sense of force through a network. We also present media synchronization control with prediction in order to maintain a high quality of haptic transmission. Under the control, network delay jitter is absorbed by buffering, and the positional information is output by prediction if the information is lost or arrives significantly late. We demonstrate the effectiveness of the control by subjective assessment.

#*A method of virtual walkthrough image space construction using plural omnidirectional images.
#@Yuji Hoshi,Shinya Nakayama,Masami Kato
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5138
#arnetid5140
#!The present paper describes a method of virtual walkthrough image space construction using plural omnidirectional images by integrating a lower and an upper hemisphere omnidirectional image as one space and interpolating between adjoining spaces.

#*Three types of viewers' favorite music videos.
#@M. Kamata,K. Furukawa
#year2007
#confAdvances in Computer Entertainment Technology
#citation3
#index5139
#arnetid5141
#%502347
#!The purpose of this study is to classify viewers' favorite music videos based on viewers' attributes evaluation and identify their characteristics. In this study, we designed a web-based questionnaire survey to collect data from forty-three young people. Participants watched fifteen music videos one-by-one and rated overall preference and twelve attributes with five-point scales. Then, we carried out the k-means clustering analysis according to the viewers' attributes evaluation ratings. As a result, we found that there were three types of viewers' favorite music videos. Viewers gave high evaluations to those music videos primarily because: (1) auditory-leading type: they liked music and singer; (2) visual-leading type: they were amazed by the imaging technique; (3) synergic type: they got favorable impressions overall.allIt is noteworthy that stories related to the lyrics and time-order structured had especially a positive impact on the viewers' evaluation.

#*Morel: remotely launchable outdoor playthings.
#@Kenji Iguchi,Masa Inakage
#year2006
#confAdvances in Computer Entertainment Technology
#citation4
#index5140
#arnetid5142
#%88277
#!This paper proposes Morel, a physical plaything device that facilitates the emergence of new forms of outdoor physical play. It encourages the improvising of new games and behavior by not defining game rules on its own, but by providing players the ability to know the existence of other Morels in the vicinity, and to remotely make other Morels launch up in the air. One game that can be played with Morels is Police & Bomber, a variation of Kick-the-can with wireless ranges as vital gameplay elements.

#*Gaze-based infotainment agents.
#@Helmut Prendinger,Tobias Eichner,Elisabeth André,Mitsuru Ishizuka
#year2007
#confAdvances in Computer Entertainment Technology
#citation9
#index5141
#arnetid5143
#%90631
#%769820
#%875854
#%21030
#%948570
#%89938
#%459720
#%777237
#!We propose an infotainment presentation system that relies on eyegaze as an intuitive and unobtrusive input modality. The system analyzes eye movements in real-time to infer users' attention, visual interest, and preference regarding interface objects. The application consists of a virtual showroom where a team of two highly realistic 3D agents presents product items in an entertaining and attractive way. The presentation flow adapts to the user's attentiveness and interest, or lack thereof, and thus provides a more personalized and user-attentive experience of the presentation.

#*Paravision: the entertaining visualizer in public space.
#@Takafumi Iwai,Sohei Kitada,Mariko Higaki,Mizuki Deguchi,Kazuya Kaijima,Akira Wakita
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5142
#arnetid5144
#!In this paper, we describe the dynamic sign system in public space using RFID and transparent screen. This system called Paravision is made to experiment whether signs can be entertaining. With all users having their own RFID tags, and RFID reader placed in several places at site, Paravision can project dynamic signs on the transparent screen.

#*Ethical issues of entertainment computing in the home.
#@Andy Sloane
#year2007
#confAdvances in Computer Entertainment Technology
#citation-1
#index5143
#arnetid5145

#*The four impression factors of music videos.
#@Maiko Kamata,Makoto Arisawa
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5144
#arnetid5146
#!Music videos (MVs) are no mere promotional tools. They have become an important entertainment media. In order to increase their attractiveness, it is significant to understand viewers' psychology. The aim of this study is to clarify the impression factors of music videos. We set an examination and collected data from the participants of fifty university students. The result of semantic differential technique indicated that there are four impression factors: (1) lightness; (2) uniqueness; (3) beauty; (4) floridness.

#*HIPMATE: an entertainment system in the office.
#@Shingo Yoshida,Kumiko Osawa,Takahiro Ogawasara,Naohito Okude
#year2007
#confAdvances in Computer Entertainment Technology
#citation0
#index5145
#arnetid5147
#%5318
#%5157
#!HIPMATE is an entertainment system which business persons can play in the office in spare time. Users can enjoy themselves as they feel with touching each other by playing HIPMATE. HIPMATE consists of 3 chairs (we call them "HipBall") and a panel (we call it "HipPannel"). HipBall and HipPannel put in separated areas in the office. When a user sits on a Hipball, his/her buttocks are projected to the panel forming the buttocks. And another user can knead the panel. As a user kneads it, the buttocks of sitting user are appeared. On the other hands, the sitting user can see another user kneading his/her buttocks through a display. And the user can see the kneading user's face by touching the display. Users can enjoy the game using a diplomacy that is produced from emotional two needs. One need is touching other's buttocks, and another is trying to see the kneading person's face. By playing HIPMATE, users can get a feeling which he/she usually must not touch the others' body parts. And users can get on initiate terms through touching body parts. HIPMATE can help people to be in body communication with other people and we would like to make use of a new body communication from HIPMATE in the office.

#*User model in multiplayer mixed reality entertainment applications.
#@Stéphane Natkin,Chen Yan
#year2006
#confAdvances in Computer Entertainment Technology
#citation6
#index5146
#arnetid5148
#%240717
#%874550
#%459559
#%7999
#%248510
#!Most computer games and more generally entertainment applications use implicitly or explicitly a user model as a reference for the gameplay and dramaturgy progression. With mixed reality technology and ubiquitous computing, user-centered design is required now more than ever to provide an adaptable and personal content at any time and in any context. The goal of our research is to provide a narration model correlated to a user model in the design of mixed reality entertainment. In this paper we give a brief survey of the current researches on user model for adaptation and personalization of services and some empirical studies of user model in games and interactive narration. We propose three possible levels of the user model: generic, localized and personalized and three types of narration scheme. We will describe that the user model and narration schemes can be used in a mixed reality system.

#*Surveys of exhibition planners and visitors about a distributed haptic museum.
#@Toshio Asano,Yutaka Ishibashi,Satoshi Minezawa,Masaki Fujimoto
#year2005
#confAdvances in Computer Entertainment Technology
#citation10
#index5147
#arnetid5149
#%1330710
#%5037
#!This paper presents the results of surveys of exhibition planners and visitors about our distributed haptic museum, which is a distributed virtual museum with touchable exhibits. We visited 15 museums and talked with 23 exhibition planners such as curators and researchers in various types of museums and art galleries after explaining our system and its exhibits. In addition, a questionnaire was given to 75 students acting as visitors. The students experienced our system after a similar presentation to the one given to the exhibition planners. We studied the availability and directionality of the distributed haptic museum based on these discussions and questionnaire results in terms of the concept, haptic interface device, usage, contents, and so on.

#*Open experiments of mobile sightseeing support systems with shared virtual worlds.
#@Hiroyuki Tarumi,Kayo Yokoo,Shouji Nishimoto,Kazuya Matsubara,Yasushi Harada,Fusako Kusunoki,Sangtae Kim,Yuki Mizukubo
#year2006
#confAdvances in Computer Entertainment Technology
#citation8
#index5148
#arnetid5150
#%87897
#%453340
#%453131
#%1047225
#%90132
#%453328
#%88277
#%453236
#%571630
#%806817
#!In this paper, we describe results from the experiments of a location-dependent shared virtual world system applied to sightseeing entertainment. This system can be used with GPS-phones on the current Japanese market. Users can enjoy interacting with virtual objects including virtual animals/agents. Subjects of the experiments were real tourists who had their own GPS-phones compatible with our system. We found that evaluations on the system varied depending on age, gender, and experiences of subjects. Results from the experiments gave suggestions on prospective users and service design.

#*Low cost solution for location determination of mobile nodes in a wireless local area network.
#@Ansar-Ul-Haque Yasar,M. A. Ansari,Sherjeel Farooqui
#year2006
#confAdvances in Computer Entertainment Technology
#citation-1
#index5149
#arnetid5151
#!In this research paper we undertook the problem of Location Determination of Mobile nodes in a Wireless Local area network, as finding out the location in a wireless environment is to-date not very easy, cheap and accurate using 802.11b technology. We used the classical method of Triangulation with a little alteration which is later on described in the paper. Another method we used is the methods of calibration by research to produce more accurate results and also to cross verify the results of the method of Triangulation. The work in this paper attempts to illustrate the different aspects of the problem of location determination in WiFi networks. We started with an investigation of the influence that network characteristics have on the ability of middleware location determination protocols to accurately estimate position of mobile nodes. We presented an implementation based study that demonstrated the strong relationship between the two of the location determination methods and their performance. The main objective of this paper is to provide method in which no dedication hardware is required. Only Wireless Lan card is required and can be placed in any suitable location. The significance of this result lies in allowing a network designer to make a suitable tradeoff between QoS of location determination and other application protocols while choosing a network topology. The combination of two methods reduced the error rate of locating a mobile node to a great extent. The results were being plotted on a given map using both the algorithms.

#*Networked equilibrium sharing system "balance seat".
#@Nobuya Suzuki,Takahiro Kobayashi,Hiroshi Yasuda
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5150
#arnetid5152
#!This paper presents a networked system connecting real space, which is shared and operated by three people.We made three pneumatic triple-axis motion platforms as a system to share a "sense of balance" with other people, and examined control methods for this system. Cylinders, which go up and down due to air pressure are used as actuators, and by moving the cylinders up and down while performing position control, the system can make the platform tilt.Since we use three platforms, an important issue was how to incorporate the interaction of the user to control the system. Therefore, we considered and experimented with four control models.

#*Motion creation for online game characters.
#@Atsushi Nakano,Junichi Hoshino
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5151
#arnetid5153
#!The character creation that creates the player's characters has been adopted in various online games. It has an important role of creating unique characters. Although the creation of the body shape, the skin color and the hairstyle has been achieved, motion creation hasn't. In this paper, we propose the motion creation technique using the composite behavior synthesis for online game characters.

#*Nano-Scape: experiencing aspects of nanotechnology through a magnetic force-feedback interface.
#@Laurent Mignonneau,Christa Sommerer
#year2005
#confAdvances in Computer Entertainment Technology
#citation2
#index5152
#arnetid5154
#%514443
#%647584
#!In this paper we describe an interactive system called "Nano-Scape" which we developed in 2001 for the public exhibition "Science + Fiction" at the Sprengelmuseum in Hannover. The project was supported by the Volkswagenstiftung Germany and has been on tour through Europe and Asia. The aim of "Nano-Scape" is to let visitors intuitively experience aspects of nanotechnology by interacting with invisible self-organizing atoms through a magnetic force feedback interface.

#*Death matters: understanding gameworld experiences.
#@Lisbeth Klastrup
#year2006
#confAdvances in Computer Entertainment Technology
#citation14
#index5153
#arnetid5155
#!This paper presents a study of the staging and implementation of death and the death penalty in a number of popular MMOG's and relates it to players' general experience of gameworlds. Both game mechanics, as well as writings and stories by designers and players are analysed and discussed. The preliminary study shows that the death penalty is implemented much in the same way across worlds; that death can be both trivial and non-trivial, part of the grind of everyday life, and of the creation of heroes. In whatever function it serves, death however plays an important part in the shaping and emergence of the social culture of a world, and in the individual player's experience of life within it.

#*Gravity Jockey: a novel music experience with galvanic vestibular stimulation.
#@Naohisa Nagaya,Masashi Yoshidzumi,Maki Sugimoto,Hideaki Nii,Taro Maeda,Michiteru Kitazaki,Masahiko Inami
#year2006
#confAdvances in Computer Entertainment Technology
#citation3
#index5154
#arnetid5156
#!In this paper, we propose a Gravity Jockey (GJ) system in "Electric Dance Revolution" that allows subjects to experience vestibular sensation by means of galvanic vestibular stimulation (GVS) synchronized with music rhythms. The Gravity Jockey system enables people using GVS to feel music rhythms not only by the sense of hearing but also by visual perception and balance sensation. And in order to evaluate the effects of this system on user's perception, we conducted psychophysical experiments during GVS with alternating current (AC).

#*Keeping bots out of online games.
#@Philippe Golle,Nicolas Ducheneaut
#year2005
#confAdvances in Computer Entertainment Technology
#citation10
#index5155
#arnetid5157
#!We study the problem of restricting participation in online games to human players, so they can enjoy the game without interference from automated playing agents known as bots. We propose a range of techniques, both software and hardware based, to distinguish bots from human players in a wide variety of online games, from poker to "shoot'em ups."

#*A fitness game reflecting heart rate.
#@Soh Masuko,Junichi Hoshino
#year2006
#confAdvances in Computer Entertainment Technology
#citation10
#index5156
#arnetid5158
#%464236
#%686368
#!Lack of exercise is known to be detrimental to health, and various exercise machines that can be used indoors in a convenient manner are available. However, because expertise is required to ascertain which exercise to do and for how long, people sometimes sustain injuries by exercising excessively and find it difficult to sufficiently benefit from exercising. Therefore, fitness machines with automatic controls are being developed so that people can exercise efficiently, and exercise programs are being designed with game elements to encourage regular exercise. Monotonous exercise makes it difficult for people to experience a sense of accomplishment while exercising, and if the degree of difficulty is not set properly, people cannot perform the appropriate amount of exercise. The present study proposes a fitness game method in which heart rate is measured in real time while playing a game and the contents of the game are actively adjusted based on heart rate, thus allowing users to perform sufficient amounts of exercise and experience a sense of accomplishment. A fitness game based on boxercise movements was designed based on the present method and then evaluated.

#*Shootball: the tangible ball sport in ubiquitous computing.
#@Yoshiro Sugano,Jumpei Ohtsuji,Toshiya Usui,Yuya Mochizuki,Naohito Okude
#year2006
#confAdvances in Computer Entertainment Technology
#citation-1
#index5157
#arnetid5159
#%88800
#%88799
#!Shootball is a new sport in ubiquitous computing. This game is playing with tangible ball that could control movies displayed in surrounding screens. This game is team sport played between two teams of 3 players each. The object of the game is to score by displaying movies of own team by throwing the ball at surrounding screens.

#*Animated storytelling system via text.
#@Kaoru Sumi,Mizue Nagata
#year2006
#confAdvances in Computer Entertainment Technology
#citation4
#index5158
#arnetid5160
#%789196
#%593207
#!This paper describes a system, called Interactive e-Hon, for helping children understand difficult content. It works by transforming text into an easily understandable storybook style with animation and dialogue. In this system, easy-to-understand content is created by a semantic tag generator through natural language processing, an animation generator using an animation achieve and animation tables, a dialogue generator using semantic tag information, and a story generator using the Soar AI engine. Through the results of an experiment, this paper describes the advantages of attracting interest, supporting and facilitating understanding, and improving parent-child communication by using Interactive e-Hon.

#*Designing a narrative-based audio only 3D game engine.
#@Timothy Roden,Ian Parberry
#year2005
#confAdvances in Computer Entertainment Technology
#citation3
#index5159
#arnetid5161
#%90155
#%88381
#!Immersing players in believable and engaging virtual environments is a common goal for many interactive computer games. While PC-based audio only games set in virtual worlds have traditionally been developed for blind players, new technology will soon create a market for audio only games aimed at a mass audience. We propose a framework for authoring interactive narrative-based audio only adventure games set in 3D virtual environments. Our work builds on several years of research into audio only applications for sight impaired users, augmented reality systems and human-computer interaction studies. We argue that a simple user interface enhances both immersion and entertainment value, making audio only games practical for mobile computing. Novel features of our system include real-time gameplay and support for multiple players. We also describe a software architecture for creating audio only games, the current implementation of which uses low-cost existing PC-based hardware and software.

#*From driving to expressive music performance: ensuring tempo smoothness.
#@Jie Liu,Elaine Chew,Alexandre R. J. François
#year2006
#confAdvances in Computer Entertainment Technology
#citation3
#index5160
#arnetid5162
#%746126
#%514464
#%361967
#%514525
#%514565
#%514546
#!This paper focuses on the mapping strategies in the interface design for the Expression Synthesis Project (ESP). The goal of ESP is to use the metaphor of driving to allow non-experts to interactively create expressive renderings of music pieces. In ESP, the road represents the music, with bends and straight segments representing places where one might slow down and speed up respectively. The user controls the tempo (rate of beats) and dynamics (amplitude) by the way s/he drives through the road. Our design objective in the ESP environment is to define mapping strategies that guarantee tempo smoothness, a hallmark of expert and practiced performances, under all driving conditions. Because the road has non-zero width, several strategies exist for mapping the car's position on the road to the musical score. We propose mapping strategies that ensure tempo smoothness, and provide mathematical and empirical proofs for the success of these strategies.

#*From driving to expressive music performance: ensuring tempo smoothness.
#@Jie Liu,Elaine Chew,Alexandre R. J. François
#year2006
#confAdvances in Computer Entertainment Technology
#citation3
#index5161
#arnetid5163
#!This paper focuses on the mapping strategies in the interface design for the Expression Synthesis Project (ESP). The goal of ESP is to use the metaphor of driving to allow non-experts to interactively create expressive renderings of music pieces. In ESP, the road represents the music, with bends and straight segments representing places where one might slow down and speed up respectively. The user controls the tempo (rate of beats) and dynamics (amplitude) by the way s/he drives through the road. Our design objective in the ESP environment is to define mapping strategies that guarantee tempo smoothness, a hallmark of expert and practiced performances, under all driving conditions. Because the road has non-zero width, several strategies exist for mapping the car's position on the road to the musical score. We propose mapping strategies that ensure tempo smoothness, and provide mathematical and empirical proofs for the success of these strategies.

#*A stylized cartoon hair renderer.
#@Jung Shin,Michael Haller,R. Mukundan
#year2006
#confAdvances in Computer Entertainment Technology
#citation2
#index5162
#arnetid5164
#%1493894
#%519761
#%519748
#%786501
#%1119213
#%70442
#%593685
#%236050
#%236356
#%86163
#%540034
#%86114
#%86198
#%1133805
#%519778
#!This paper describes a new hair rendering technique for Anime characters. The overall goal is to improve current cel shaders by introducing a new hair model and hair shader. The hair renderer is based on a painterly rendering algorithm which uses a large amount of particles. The hair model is rendered twice: first for generating the silhouettes and second for shading the hair strands. In addition we also describe a modified technique for specular highlighting. Most of the rendering steps (except the specular highlighting) are performed on the GPU and take advantage of recent graphics hardware. However, since the number of particles determines the quality of the hair shader, a large number of particles is used which reduces the performance accordingly.

#*Demonstration for human scale haptic interaction with a reactive virtual human in a realtime physics simulator.
#@Shoichi Hasegawa,Ishikawa Toshiaki,Naoki Hashimoto
#year2005
#confAdvances in Computer Entertainment Technology
#citation-1
#index5163
#arnetid5165
#!We will present a virtual boxing system with a framework for haptic interaction with a reactive virtual human in a physically simulated virtual world. Figure 1 shows the setup of the demonstration. The user controls an avatar in the virtual world via human scale haptic interface and interacts with the virtual human through the avatar. The virtual human recognizes the user's motion and reacts to it.

#*Wireless home entertainment center: reducing last hop delays for real-time applications.
#@Claudio E. Palazzi,Giovanni Pau,Marco Roccetti,Stefano Ferretti,Mario Gerla
#year2006
#confAdvances in Computer Entertainment Technology
#citation9
#index5164
#arnetid5166
#%519570
#%94
#%597204
#%793348
#%608823
#%1016734
#!Future digital entertainment services available to home users will share several characteristics: i) they will be deployed and delivered through the Internet, ii) a single media center will be exploited to orchestrate all parallel services, and iii) wireless technologies integrated within the home entertainment system will be massively utilized for the transmission of various data streams to networked devices. In this scenario, new effective strategies are needed to regulate the concurrent access to the wireless network when parallel applications generate different but simultaneous UDP/TCP-based flows. In this work, we present a novel technique aimed at guaranteeing a fast and smooth data delivery for real-time streams while maintaining a high throughput for TCP-based applications. Our approach is based on the utilization of a smart Access Point able to exploit available information about the ongoing traffic and existing features of the regular TCP. We compare the performance of our solution with an alternative one that makes use of an optimal setting of the 802-11 MAC layer parameters. Simulation results confirm that our smart Access Point represents an optimal candidate to be exploited in complex wireless scenarios for in-home entertainment.

#*Augmenting digital audio broadcast with rich data.
#@Annelies de Bruine,Huw Jeffries,Erik Geelhoed,Richard Hull,Nick Piggott
#year2005
#confAdvances in Computer Entertainment Technology
#citation-1
#index5165
#arnetid5167
#%247080
#!HP Laboratories, GWR, Bristol University, ASL and Panasonic Semiconductor are collaborating to explore the potential of Digital Audio Broadcasting through a series of user trials. Our first iPAQ-based prototype allows listeners to GWR-Bristol to interact with a set of web pages broadcast alongside the digital audio stream and displayed on a small color display. In a hands-on study, typical GWR listeners responded very positively to the experience of viewing web pages on a visual radio. Local news, weather forecasts, event listings, and details of the last ten songs broadcast proved especially popular.

#*Mounting and application of bubble display system: bubble cosmos.
#@Masahiro Nakamura,Go Inaba,Jun Tamaoki,Kazuhito Shiratori,Junichi Hoshino
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5166
#arnetid5168
#%786746
#%438071
#!In this paper, we propose the soap bubble display method that the image can be projected to the real soap bubbles that white smoke entered. The position and the size of soap bubbles tossed in the air are detected with the camera. By projecting the image only to the position with the projector, the soap bubble display is realized. And the image and the sound can be interactively added when the explosion of soap bubbles are judged. We mount the soap bubble display, and evaluate usefulness as entertainment that player can enjoy.

#*Age invaders.
#@Khoo Eng Tat,Shang Ping Lee,Adrian David Cheok
#year2006
#confAdvances in Computer Entertainment Technology
#citation-1
#index5167
#arnetid5169

#*D4MD: deformation system for a vehicle simulation game.
#@Tiago Rodrigues,Rui Pires,José Miguel Salles Dias
#year2005
#confAdvances in Computer Entertainment Technology
#citation3
#index5168
#arnetid5170
#%593201
#!This paper presents a hybrid geometrical-physical, plastic deformation technique applicable for solids, in the context of a car simulation game. This technique doesn't aim to be mechanically correct but to produce visual appealing and realistic-looking results.

#*Sharelog: digital public art interaction by using "Suica".
#@Kotaro Hashimoto,Yasuhiro Suzuki,Tomohiro Tanikawa,Toshio Iwai,Michitaka Hirose
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5169
#arnetid5171
#!In this paper, we propose to use a digital private item to interact with media art works. And we make it clear that such object is very effective to generate communication.

#*AoIM in peer-to-peer multiplayer online games.
#@Abdennour El Rhalibi,Madjid Merabti,Yuanyuan Shen
#year2006
#confAdvances in Computer Entertainment Technology
#citation10
#index5170
#arnetid5172
#%1125170
#%512719
#%512724
#%512733
#%161
#%502311
#%666454
#%512720
#%512787
#%1122676
#%648124
#!MMOG are very large distributed applications, sharing very large states, and supporting communication between potentially thousands of player nodes. Despite the development of many solutions to define suitable architecture and communication protocol, and enabling efficient deployment of these types of applications, many issues remains which still require a solution. In this paper we discuss MMOG deployed over a Peer-to-Peer architecture, supporting a distributed model of systems with shared state and we address issues related to scalability, interest management and communication. We identify an efficient partitioning and distribution of the shared state as an important aspect in such models and propose a hierarchical multi-level interest management algorithm which enables contextual communication between peers. Experiments have been carried out and show the performance of the approach.

#*Development of the tool for artistic representation of internal information of the body.
#@Shigeru Sakurazawa,Junichi Akita,Masashi Toda
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5171
#arnetid5173
#!In this paper, we describe the idea of a new artistic representation tool to project performer's internal state of the body. To solve the problem of complicated wires and for detecting biological signals, the flexible conductive wear for wearable computing named as "TextileNet system" was applied to the system. In this paper, we also describe the experimental results of trial growing of the tool. The advantage of the conductive fabric was not only solving the problem but shielding effect, which could make the amplifier simple. Using the feature of TextileNet, huge number of biological information can be treated at same time, and more complex representation is expected.

#*AR baseball presentation system based on registration with multiple markers.
#@Yuko Uematsu,Hideo Saito
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5172
#arnetid5174
#!The AR Baseball Presentation System is an entertainment tool allowing users to watch "virtual baseball game" on the real tabletop field model through a web-camera attached to a LCD monitor. Our system uses multiple planar markers for geometrical registration of virtual catoons onto the tabletop field model. In contrast with most AR applications using multiple planar markers, we can place the markers at arbitrary positions and poses without measuring those arrangements manually. Since the markers can be placed at various positions and poses, the registration of the virtual objects becomes more stable than placing all the markers on the same directions. The baseball game scene is generated from the log history data of the baseball game.

#*Visual resonator: sight-based auditory experience.
#@Junji Watanabe,Yuki Hashimoto,Hideaki Nii,Masahiko Inami
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5173
#arnetid5175
#%90322
#!We present an auditory interface called Visual Resonator. The wearer of this interface can hear a voice or auditory information only from the direction in which he/she is facing, and can send his/her voice only in the direction towards which he/she is facing. Therefore, individuals who are within sight of each other can have a conversation, even if they are not close enough to talk directory. In addition, the speech that has taransmitted by an individual could be relayed, and then received by other people looking at the same object. This interface promotes communication between people who are within sight of each other and people with the same interests.

#*Implementing encrypted streaming video in a distributed server environment.
#@Jason But,Grenville J. Armitage
#year2005
#confAdvances in Computer Entertainment Technology
#citation5
#index5174
#arnetid5176
#%774255
#!Technical issues are not the only ones preventing large scale introduction of online streaming video services. Unlike generic web browsing applications, streaming video imposes greater demands on network resources. Caching of content through the use of distributed servers has been proposed as a solution to reduce resource requirements and improve scalability. Video caching presents a unique challenge to copyright protection schemes, particularly if we consider provision of functionality such as indexed and high-speed playback modes. This paper discusses the issues involved in implementing copyright protection for cached streaming video, concluding with a set of requirements for any proposed scheme.

#*Use of eye movements for video game control.
#@J. David Smith,T. C. Nicholas Graham
#year2006
#confAdvances in Computer Entertainment Technology
#citation36
#index5175
#arnetid5177
#%87988
#%90643
#%90891
#%90496
#%89740
#%334101
#%190330
#%634406
#!We present a study that explores the use of a commercially available eye tracker as a control device for video games. We examine its use across multiple gaming genres and present games that utilize the eye tracker in a variety of ways. First, we describe a first-person shooter that uses the eyes to control orientation. Second, we study the use of eye movements for more natural interaction with characters in a role playing game. And lastly, we examine the use of eye tracking as a means to control a modified version of the classic action/arcade game Missile Command. Our results indicate that the use of an eye tracker can increase the immersion of a video game and can significantly alter the gameplay experience.

#*Game design through self-play experiments.
#@Alasdair Macleod
#year2005
#confAdvances in Computer Entertainment Technology
#citation7
#index5176
#arnetid5178
#!The application of self-play experiments to computer games was pioneered by Thompson in 1982 with his chess machine BELLE. Since then the technique has been widely used in a variety of games to train artificial players employing a range of artificial neural network architectures. Of particular note is the TD-learning Backgammon program of Tesauro developed in 1995. When developing artificial game players that learn by experience, it is generally possible to accelerate the training process through self-play. Compared with training by humans, this confers the advantages of greater speed and a precise control of playing strength through parameter variation. In spite of these potential advantages, the use of self-play experiments is considered by many to be a treacherous road fraught with problems. The value of such experiments is unclear and the threshold of learning that can be achieved through self-play alone is unknown. There is the common-sense perception that only limited playing skill can be achieved through machine self-play, a notion that is challenged here. A new application that is immune from the problems associated with machine learning is the use of self-play experiments to test the integrity and fairness of games and modify the rules accordingly. We will show how the rules of a particular game, Perudo, can be analysed for fairness and how the excessive positive feedback that arises when forces become unbalanced can be curbed. We use the notion of fair in the same sense as in a soccer game - if a team loses a goal, neglecting psychological effects, the chance of losing a second goal is not significantly changed. It is recognised that the cumulative growth in advantage is part of many games and that it is inappropriate to alter the rules in these cases. However the rate at which advantages grow can be moderated by rule alterations. We will also consider the application of the technique to a range of traditional games. In chess, for example, White is considered to have an advantage over Black. The imbalance can be determined for different playing strengths and extrapolated. We will show that the principles can be extended to the more complex situations of computer games and propose that the development of unintelligent agents to explore game play is advantageous.

#*The mobile phone as a digital SprayCan.
#@Philip Garner,Omer Rashid,Paul Coulton,Reuben Edwards
#year2006
#confAdvances in Computer Entertainment Technology
#citation12
#index5177
#arnetid5179
#!Since the first appearance of modern man, one trait of human behavior in our interaction with the physical environment appears to be an inherent desire to leave our mark on a particular object or space. 'SprayCan' graffiti that appeared in the 1970s is but a modern extension of this phenomenon, yet it divides communities and generations in terms of how it should be dealt with in terms of either complete acceptance or punitive action. In this paper we present a system that tries to bridge the divide as it both provides writers with a means of tagging their environment, using mobile phones and RFID tags, whilst minimizing the physical effects to the landscape for the communities where it resides.

#*AI-based world behaviour for emergent narratives.
#@Jean-Luc Lugrin,Marc Cavazza
#year2006
#confAdvances in Computer Entertainment Technology
#citation14
#index5178
#arnetid5180
#%913601
#%744523
#%459184
#%691309
#%85972
#!Research in Interactive Narrative has developed new approaches to the behaviour of virtual actors, but has dedicated little attention to the physical behaviour of the environment in which the action takes place. In this paper, we describe a method supporting the AI-based simulation of object behaviour, so that interactive narrative can feature the physical environment inhabited by the player character as an "actor". The prototype we describe has been developed on top of the Unreal Tournament game engine and relies on a "causal engine", which essentially bypasses the native Physics engine to generate alternative consequences to player interventions. It operates using a small depth-bound planning system which determines the most appropriate object behaviours following player interaction. The prototype is illustrated through a test application called "Death Kitchen", freely inspired from various thriller and horror films, in which the kitchen is plotting against the player character to generate domestic accidents.

#*Early narrative experience: positive segue to narrative gameplay.
#@Krystina S. Madej
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5179
#arnetid5181
#!This paper theorizes that children segue into digital narrative game play easily and 'without pause' because of the perception of narrative they develop through their early print narrative experiences. These experiences are multimodal and socially constructed and are similar in nature to the engagement children enjoy with narrative gameplay. Rather than privileging the traditional forms of narrative considered the norm, children's emerging narrative process privileges a structure similar to that of narratives in games.

#*The VoodooIO gaming kit: a real-time adaptable gaming controller.
#@Nicolas Villar,Kiel Mark Gilleade,Devina Ramduny-Ellis,Hans-Werner Gellersen
#year2006
#confAdvances in Computer Entertainment Technology
#citation21
#index5180
#arnetid5182
#%634144
#%87491
#%5641
#!Existing gaming controllers are limited in their end-user configurability. As a complement to current game control technology, we present the VoodooIO Gaming Kit, a real-time adaptable gaming controller. We introduce the concept of appropriable gaming devices, which allow players to define and actively reconfigure their gaming space, making it appropriate to their personal preference and gaming needs. The technology and its conceived usage are illustrated through its application to two commercially available computer games, as well as through the results of a formal user study.

#*The CaveUT system: immersive entertainment based on a game engine.
#@Jeffrey Jacobson,Marc Le Renard,Jean-Luc Lugrin,Marc Cavazza
#year2005
#confAdvances in Computer Entertainment Technology
#citation27
#index5181
#arnetid5183
#%773070
#%648178
#%593209
#%874550
#%5007
#%55573
#%586868
#%29773
#!We describe recent developments in the CaveUT software, which supports immersive virtual reality installations based on the Unreal Tournament game engine. CaveUT implements several high-end VR features such as real-time stereoscopy with head and hand tracking. We demonstrate the use of CaveUT in the SAS Cube™, a PC-based CAVE™-like immersive four-screen display. One of the main advantages of the system is to support fully immersive VR while retaining the game engine's advanced features for interaction and behavioral (or AI) systems. We illustrate the use of CaveUT on two installations: an artistic VR installation and an immersive interactive storytelling system.

#*Computational support for compelling story telling.
#@Sara Owsley,Kristian J. Hammond,David A. Shamma
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5182
#arnetid5184
#!The Internet is a living, breathing reflection of who we are, what we think, and how we feel. The pages that make up the Web form the book of our contemporary life and culture. They are the ongoing and changing buzz of our world. The latest embodiment of this cultural reflection is found in blogs. Not only are blogs widespread, but they are incredibly dynamic, with hundreds updated per minute. The existence of millions of blogs on the web has resulted in more than the mere presence of millions of online journals, but rather, they generate a collective buzz around the events in the world.

#*POCOMZ: the ambient media device with IM "wija".
#@Kyoichi Sakamoto,Kenji Saito,Masa Inakage,Aya Shigefuji,Anna Takahashi
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5183
#arnetid5185
#!In this paper, we propose device "POCOMZ" to experience community based "Connection" as a lighting in a real space. Community members' present situation is reflected to POCOMZ as illumination of light, and the lighting changes by the change in member's situation. The public space and a private one's own space will be produced by "Connection" with others through this device.In this research, the device working with Instant Messaging system is designed to display, transmit and share users' presence information as an ambient environment message in the real space.Communications by the change in the ambience (atmosphere of the environment) are demonstrated by using the user presence shared on the internet as a lighting in a real space."Connected Feeling" caused by the communications of ambient presence through the device will be suggested as the way of new entertainment communications.

#*The VoodooIO gaming kit: a real-time adaptable gaming controller.
#@Nicolas Villar,Kiel Mark Gilleade,Devina Ramduny-Ellis,Hans-Werner Gellersen
#year2006
#confAdvances in Computer Entertainment Technology
#citation21
#index5184
#arnetid5186
#!Existing gaming controllers are limited in their end-user configurability. As a complement to current game control technology, we present the VoodooIO Gaming Kit, a real-time adaptable gaming controller. We introduce the concept of appropriable gaming devices, which allow players to define and actively reconfigure their gaming space, making it appropriate to their personal preference and gaming needs. The technology and its conceived usage are illustrated through its application to two commercially available computer games, as well as through the results of a formal user study.

#*Augmented reality with zooming camera: accurate pose and focal length estimation.
#@Widya Andyardja Weliamto,Seah Hock Soon,Feng Tian,Hu Meiqun
#year2005
#confAdvances in Computer Entertainment Technology
#citation-1
#index5185
#arnetid5187

#*Mixed reality for fun learning in primary school.
#@Wei Liu,Adrian David Cheok,Sim Hwee,Ang Ivene
#year2006
#confAdvances in Computer Entertainment Technology
#citation2
#index5186
#arnetid5188
#!In this poster, classroom based Mixed Reality teaching tools are introduced. Our aims are introducing the new technology to primary schools, providing a more interesting and attractive learning environment to students. Cooperating with students and teachers, all contents are based on the textbook and design by teachers, classroom based teaching tools - Solar system and Plants system are produced and used in school.

#*How real should virtual characters be?
#@Daniel Wagner,Mark Billinghurst,Dieter Schmalstieg
#year2006
#confAdvances in Computer Entertainment Technology
#citation25
#index5187
#arnetid5189
#%85929
#%87856
#%121939
#%5354
#%437887
#%29282
#%245846
#%30020
#%438086
#%453342
#!In recent years 3D virtual characters have become more common in desktop interfaces, particularly in gaming and entertainment applications. In this paper we describe how augmented reality (AR) technology can be used to bring virtual characters into the real world and compare AR characters to other types of virtual characters. We have developed a handheld AR educational application in which a virtual character teaches users about art history. We present results from a user study that explores how realistic the character needs to be for it to be an effective and engaging educational tool and if augmented reality offers benefits for this type of application.

#*Rendezvous: supporting real-time collaborative mobile gaming in high latency environments.
#@Angie Chandler,Joe Finney
#year2005
#confAdvances in Computer Entertainment Technology
#citation5
#index5188
#arnetid5190
#%519570
#%343281
#%5069
#!Despite the ever increasing popularity of handheld, networked gaming consoles, fully interactive real-time, multiplayer games designed for these platforms have yet to become a reality. This is primarily caused by the reliance of these handheld devices on telecoms networks such as GPRS and 3G to enable communications between players, introducing network latencies beyond the capacity of existing games and supporting consistency mechanisms to operate successfully.This paper motivates the need for a new approach to consistency in mobile multiplayer gaming environments, and introduces Rendezvous, a novel solution to the high latency consistency problem, based on the concept of elegant recovery from an inconsistent shared state, rather than the more traditional approach of prevention of the initial inconsistency. The paper goes on to present preliminary design, implementation and evaluation of Rendezvous, with respect to its application to a mobile real-time multiplayer game written for the smart phone platform called Knockabout.

#*Modifying game content with personal media.
#@Jukka Holm,Juha Arrasvuori,Kai Havukainen
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5189
#arnetid5191
#%5398
#!In recent years, the mobile phone has become a device for storing and consuming various media such as music, images, video, and text. People also play games with their mobile phones. This paper discusses the concept of media-controlled games, where each media file selected by the player makes the game look different and behave variedly. As an example of using still pictures in games, a prototype game called "Nitro" has been implemented.

#*Andrew Rivolski: multi-display cooperation game.
#@Andy Yamada,Tomoyuki Nezu,Masa Inakage
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5190
#arnetid5192
#!Andrew Rivolski is a multiplayer network game played in an environment consisting of multiple displays. The players are placed in two different remote locations, and by having mutual interactions the game allows the players to experience a cooperative phenomenon.

#*Heat sensation in image creation with thermal vision.
#@Daisuke Iwai,Kosuke Sato
#year2005
#confAdvances in Computer Entertainment Technology
#citation13
#index5191
#arnetid5193
#%593011
#%90130
#!We introduce how to involve the heat sensation in image creation by using thermal vision. We develop "ThermoTablet" which can detect touch regions of physical input objects on a sensing surface using changes of a temperature distribution of the surface when those objects are hotter or colder than the surface. Image creation applications of painting, image modifications are implemented on it. In the painting application, users can directly use physical paintbrushes and airbrushes with hot water in spite of paint, and even use their own fingers, hands, and breaths directly. "ThermoInk" transforms the temperature information into a variation of painting. Image modification application aims an intuitive user interface for color saturation modification, hue modification, shape modification and CAD model deformation which are strongly related to heat sensations.

#*Paper prototyping a pervasive game.
#@Elina M. I. Koivisto,Mirjam Eladhari
#year2006
#confAdvances in Computer Entertainment Technology
#citation-1
#index5192
#arnetid5194
#!We have evaluated a game called Garden of Earthly Delights (or GED) with a paper prototype and players. GED is a concept for the extension of conventional Massively Multiplayer Online Role-Playing Game (MMORPG) mechanics to integrate pervasive, mobile, and location-based play. A pervasive game can be defined as "a game that is always present, available to the player. These games can be location sensitive and use several different media to convey the game experience" [1]. GED is played both on PC and mobile platforms. This poster summarizes the main findings from the evaluations and compares the paper prototype testing method with focus group discussions.

#*Early narrative experience: positive segue to narrative gameplay.
#@Krystina S. Madej
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5193
#arnetid5195
#!This paper theorizes that children segue into digital narrative game play easily and 'without pause' because of the perception of narrative they develop through their early print narrative experiences. These experiences are multimodal and socially constructed and are similar in nature to the engagement children enjoy with narrative gameplay. Rather than privileging the traditional forms of narrative considered the norm, children's emerging narrative process privileges a structure similar to that of narratives in games.

#*Back to the 70's.
#@Cristina Portalés,Francisco Giner,Francisco Sanmartín
#year2005
#confAdvances in Computer Entertainment Technology
#citation2
#index5194
#arnetid5196
#%1496240
#%648160
#%1330584
#%437937
#%648236
#%1312927
#%786892
#!Back to the 70's is an augmented reality application, designed to deliver the Vera University campus back to the city centre as it was 30 years ago. Within this, the user is immersed in a new hypothetical environment where the campus buildings are seen together with some historical ones belonging to Valencia City. This paper describes the methodologies followed to deal with the occlusion problem via a conjunction of 3D objects acting as a subtracting models, and the acquisition of the user orientation inside the application, which is achieved via a combination of a visual and an inertial tracker.

#*Straw-like user interface: virtual experience of the sensation of drinking using a straw.
#@Yuki Hashimoto,Naohisa Nagaya,Minoru Kojima,Satoru Miyajima,Junichiro Ohtaki,Akio Yamamoto,Tomoyasu Mitani,Masahiko Inami
#year2006
#confAdvances in Computer Entertainment Technology
#citation8
#index5195
#arnetid5197
#!The Straw-like User Interface is a novel interface system that allows us to virtually experience the sensations of drinking. These sensations are created based on referencing sample data of actual pressure, vibration and sound produced by drinking from an ordinary straw attached to the system. This research of presenting virtual drinking sensations to mouth and lips is the first in the world to have been attempted, and comes with high academic expectations. Moreover, due to the high sensitivity of the mouth and lips when used as a sensor, it is possible to develop many unique interfaces and so this could facilitate an extension of research fields in both interactive arts and entertainment.

#*Motivated reinforcement learning for non-player characters in persistent computer game worlds.
#@Kathryn Elizabeth Merrick,Mary Lou Maher
#year2006
#confAdvances in Computer Entertainment Technology
#citation32
#index5196
#arnetid5198
#%13672
#%29562
#!Massively multiplayer online computer games are played in complex, persistent virtual worlds. Over time, the landscape of these worlds evolves and changes as players create and personalise their own virtual property. In contrast, many non-player characters that populate virtual game worlds possess a fixed set of pre-programmed behaviours and lack the ability to adapt and evolve in time with their surroundings. This paper presents motivated reinforcement learning agents as a means of creating non-player characters that can both evolve and adapt. Motivated reinforcement learning agents explore their environment and learn new behaviours in response to interesting experiences, allowing them to display progressively evolving behavioural patterns. In dynamic worlds, environmental changes provide an additional source of interesting experiences triggering further learning and allowing the agents to adapt their existing behavioural patterns in time with their surroundings.

#*Architecture of an authoring system to support the creation of interactive contents.
#@Koji Miyazaki,Yurika Nagai,Ryohei Nakatsu
#year2006
#confAdvances in Computer Entertainment Technology
#citation2
#index5197
#arnetid5199
#!In this paper, we propose a concept for a support system for creating interactive contents based on three-dimensional computer graphics (3D-CG). A content creator, by describing a script using two kinds of script files prepared by the system, can easily create 3D-CG scenes and can also control the interactions between a user and the system.

#*3DCG authoring system using turtle metaphor.
#@Katsuhide Tsushima,Masayuki Ueno,Takeshi Nishiki,Noboru Ashida,Kazuma Tanida
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5198
#arnetid5200
#!A new type of Authoring System for 3DCG animation is developed in which a user can easily manipulate three dimensional objects in three dimensional simulated space on the computer. The user can use programing, programming palette and several hardware interfaces to manipulate object comfortably with the help of turtle metaphor. All the manipulations of objects, cameras, lights and turtle are possible using turtle command in our system, so DMI for 3DCG animation is realized in this research.

#*Integrate and conquer: the next generation of intelligent avatars.
#@Jaroslaw Francik,Adam Szarowicz
#year2005
#confAdvances in Computer Entertainment Technology
#citation1
#index5199
#arnetid5201
#%593090
#%60004
#%593841
#%1119487
#%941849
#%1119650
#!FreeWill+ is a framework that aims at integrating various animation techniques for controlling human-like characters. With heterogeneity and multi-layering as its main design principles, the system contains a society of complex interrelated animation components (actions), executing on various levels of abstraction and also varying in the level of built-in intelligence. They arrange themselves into ad-hoc created associations to perform tasks and fulfil goals. As both reactive and proactive modes of operation are present, and the communication between actions is crucial, the overall structure may be considered as a multiagent system. We will show how a relatively simple, multi-layered and multi-agent structure can cope with collision-free motion planning problem.

#*Virtual experience: interactive domino simulation.
#@Qonita M. Shahab,Yong-Moo Kwon,Heedong Ko
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5200
#arnetid5202
#!This research studies on collaborative simulation-based virtual experience for physics e-learning. In view of educational science, simulation-based virtual experience is useful for better understanding of physics law. This paper presents our introductory researches on Domino Physics Simulation. We also implement collaborative simulation-based experience system through network for virtual experience together.

#*3D object modelling for entertainment applications.
#@Yi Song,Li Bai,Yangsheng Wang
#year2006
#confAdvances in Computer Entertainment Technology
#citation4
#index5201
#arnetid5203
#%593080
#%593583
#%593275
#%593605
#%1118986
#%593526
#%786750
#%1133586
#%1133612
#!Recent advances in three-dimensional (3D) data acquisition techniques have offered an alternative to the traditional 2D metamorphosis (or morphing) approaches, which gradually change a source object through intermediate objects into a target object. In this paper, we approach 3D metamorphosis via a novel 3D modelling technique, which reconstructs a fairly complex object with a single B-Spline patch. Our object representation is compact - over 90% compression rate can be achieved. Despite such huge amount of data reduction, our method achieves similar rendering result to that using polygonal representation. Our approach also allows a one-to-one mapping from the object space to a common parameter space to be established, to allow automatic correspondence between a pair of objects. This way to establishing object correspondence is advantageous over the common connectivity generation process, with which, if either the source or target object is changed, the whole process of establishing correspondences must be repeated. Several aesthetically pleasing examples of 3D morphing are demonstrated using the proposed method.

#*Real-time cinematic camera control for interactive narratives.
#@Dan Amerson,Shaun Kime,R. Michael Young
#year2005
#confAdvances in Computer Entertainment Technology
#citation35
#index5202
#arnetid5204
#%593430
#!Current 3D game engines offer the potential for new types of interactive storytelling. In this paper, we discuss automated cinematography as it relates to interactive narratives in virtual worlds. Due to the interactive nature of these environments, automated camera controllers cannot fully utilize all of the idioms in the domain of cinematography. It is important to note that substantial investigations into interactive cinematography have already been made [1, 2, 3]. In contrast to these individual systems, we propose a hybrid system that uses abstractly defined cinematographic idioms as constraints to choose the best camera placement for any shot at any moment within any geometry.

#*Applying recent techniques for retro games: in the case of undo function.
#@Yuu Shibata,Kei Hiraki
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5203
#arnetid5205
#!Emulation is one of the most important methods for providing lower compatibilities, and several game machines truly adopt emulations. A game emulator establishes executions of the games of its target machine. At the same time, when we append a new function on an emulator, we can apply the function for all games on the emulator. Actually, many game emulators adopt extra functions and we gain many benefits from these functions. These functions sometimes bridge the gaps between recent games and retro games. However, these functions leave rooms for improvements.We implemented and evaluated undo function as an example of the improvements. This function removed the problems of the traditional function, and achieved performance gains from the traditional. Except when we fully engaged in the traditional function, our function considerably reduced the penalties of the failures in games. In addition our function also homogenized the penalties without dedications. We can use our function easily and safely.

#*Computer aided drawing system based on prediction of drawing action.
#@Hirokatsu Sou,Ichiroh Kanaya,Kosuke Sato
#year2006
#confAdvances in Computer Entertainment Technology
#citation2
#index5204
#arnetid5206
#!Computer Aided Design (CAD) systems are widely used recent years. In general, however, designers sketch product images by their own hands during early stages of designing. The authors aim to aid these freehand design by predicting and guiding designer's drawings using computers and a display-tablet. The computer estimates geometrical figures that the designer is drawing in real-time. The experimental results shows that the proposed system is effective for simple designing processes.

#*Adapting a large scale networked virtual environment for display on a PDA.
#@Tom Jehaes,Peter Quax,Wim Lamotte
#year2005
#confAdvances in Computer Entertainment Technology
#citation3
#index5205
#arnetid5207
#%593671
#%531319
#%1312879
#%647971
#%512825
#!In order to allow users to access a large-scale online virtual environment at any time or place, some form of mobile access is needed using for instance a PDA or SmartPhone. In this paper, we describe how the display part of our in-house developed large scale online virtual environment was adapted for mobile devices. We discuss the main issues encountered and describe our approach for 3D rendering of a large virtual environment on a PDA. More specifically, we use a hybrid geometry/image-based rendering approach in order to limit the memory requirements and processing power needed. Our experimental results, using both software and hardware accelerated rendering, show that this hybrid approach strikes an effective balance between image quality and rendering speed.

#*Accuracy of musician's response time for an electronic music score system with a moving marker.
#@Tatsuo Kamitani,Manabu Yano,Minoru Matsuda
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5206
#arnetid5208
#!The authors considered an electronic music score system that denotes note length as visual stimuli by moving markers for non-expert musicians. These visual stimuli are synthesized by stimuli synthesized from general electronic music scores. A setup of the color and luminosity of a screen, adjustment of contrast, speed of the marker is possible at the time of visual stimulus generation.From the result of the experiment, it become clear that a moving marker system is useful to performing music.

#*Game execution control by analysis of player's behavior.
#@Karim Sehaba,Pascal Estraillier
#year2006
#confAdvances in Computer Entertainment Technology
#citation4
#index5207
#arnetid5209
#!Within the context of the games execution control, our objective is to define a model able to analyse the player's behavior from heterogeneous data. It concerns events generated by the player's actions. These events are the result of analysis of video stream (for gaze direction, head movement, etc.) and actions carried out on the controls elements (mouse click, entry selection, button, etc). The interest of such a model is the recognition of player's behaviors in order to control the execution of the game. We have applied our research results to an interactive environment of educational games for autistic children.

#*Geometric model reconstruction from streams of DirectX 3D game application.
#@Zhigeng Pan,Xiaochao Wei,Jian Yang
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5208
#arnetid5210
#%519739
#%519760
#%586958
#%593472
#%593610
#%593974
#!This paper presents a method of intercepting data stream, command stream and rendering states from DirectX 9 graphics pipeline by hooking the low-level graphics library. It also shows that it is useful to reconstruct geometric models or render models with new styles. The paper shows not only how the basic mechanics of intercepting streams in the DirectX 9 graphics pipeline lead to a non-invasive extension mechanism for graphics applications, but also how to manipulate the streams and states of pipeline properly to reconstruct geometric information and export models of different styles. While describing how our system efficiently reconstructs a declarative representation of the geometry implicit in the graphics library command stream, a set of application extensions built with this framework is presented including the replayer and reconstructer.

#*InScene: a communication device which uses incenses.
#@Yuichiro Katsumoto,Erika Kanai,Nadya Kirillova,Kaori Higashi,Hokuto Miura,Takashi Matsumoto,Reiko Sasaki,Masa Inakage
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5209
#arnetid5211
#%647700
#!InScene is a fantastic communication device which uses incenses. The sender implants his message in incense, and hands it to someone he wants to send the message to. The receiver lights the incense and releases the sender's message. The receiver will then be able to view the sender's message surrounded by sweet aroma.

#*Believable performance agents for interactive conversations.
#@Nathan D. Nichols,Kristian J. Hammond,David A. Shamma,Sara Owsley
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5210
#arnetid5212
#%674700
#!As computers become more integrated into our everyday lives, they will need to be able to interact with us within the context of our world as well as theirs. While it is unlikely that we will ever want all interactions with a computer to mimic dialogs with other people, it is clear that they will need to be able to engage in coherent, compelling conversations with people who are not thinking of them as machines. Our effort, and the system described below, is aimed at approaching this goal by creating a framework for believable performance agents within the content of interactive theatrical experiences.

#*Designing sound for a pervasive mobile game.
#@Inger Ekman,Laura Ermi,Jussi Lahti,Jani Nummela,Petri Lankoski,Frans Mäyrä
#year2005
#confAdvances in Computer Entertainment Technology
#citation14
#index5211
#arnetid5213
#%502738
#%5025
#%686396
#%453229
#%1077648
#%1116972
#!We examine the role of sound design in pervasive mobile games. As a case study, we present the sound design and evaluation of a working prototype game called The Songs of North. A play-test with 19 players was conducted over a two-week period. The results imply that using sound information can facilitate physical movement as a main game mechanic. However, using sound to convey information is still an unfamiliar game mechanic to many sighted players. The research highlights the importance of social playability in the sound design of mobile games. Also, some insights on the role of sound in producing immersive gaming experiences are discussed.

#*User case study and network evolution in the mobile phone sector (a study on current mobile phone applications).
#@Tobias Fritsch,Hartmut Ritter,Jochen H. Schiller
#year2006
#confAdvances in Computer Entertainment Technology
#citation14
#index5212
#arnetid5214
#!Networked games are becoming more and more important in the last years. One major focus is reducing the size and increasing the portability of the game devices. Therefore mobile phones are becoming a very popular platform for games. Their availability and rapidly increasing technology also promote them as a valid gaming device option.Nevertheless there are other portable game devices, such as the new age handhelds (Nintendo DS and PSP) or PDA's. Our user case study focuses on the differences between those gaming platforms, their capability of handling new age games and multimedia expectations and their used technology. Thus this paper should not only give an introduction into the current multimedia (gaming) handheld technology, it will also evaluate players' individual preferences. Afterwards it will compare social deterministic such as age, income and gender with their mobile phone preference.The aim of this research approach is an analysis of current portable game devices, based on a testbed to see how player behavior is influenced by the impairments of the mobile devices (reduced input capabilities and small display size).

#*Subjective assessment of fairness among users in multipoint communications.
#@Yutaka Ishibashi,Manabu Nagasaka,Noriyuki Fujiyoshi
#year2006
#confAdvances in Computer Entertainment Technology
#citation-1
#index5213
#arnetid5215
#%401124
#%502243
#%5037
#%783848
#!By subjective assessment, this paper investigates the influences of network latency and packet loss on the perception of fairness among users in multipoint communications where the users have a conversation with each other by using live voice and video. We also assess the fairness in the case where we use users' avatars constructed by computer graphics (CG) instead of video. Assessment results show that most of subjects perceive unfairness when the difference in network latency between two terminals exceeds approximately 100 ms, or when the difference in packet loss rate becomes larger than around 30 %. Furthermore, we demonstrate that we can estimate the value of MOS with high accuracy from the difference in network latency and packet loss rate.

#*Prosopopeia: experiences from a pervasive Larp.
#@Staffan Jonsson,Markus Montola,Annika Waern,Martin Ericsson
#year2006
#confAdvances in Computer Entertainment Technology
#citation-1
#index5214
#arnetid5216
#!Live action role playing, Larp, is a play genre that so far has received little attention from the game studies community. However, the Live action role playing community is perhaps the most interesting role play community of all in its intense focus on role-taking, improvisation, and immersion. Furthermore, Larping has been extensively used for serious purposes, both for crisis training and psychological treatment.In this paper, we focus on Pervasive Larp, Larp events that are staged in the real world and where both the people and the objects of the real world have a direct role in the game. This is a relatively novel variant of Larping, which poses higher demands on technology support than traditional Larps. We report on the experiences from designing and staging Prosopopeia, a pervasive Larp event based on an alternate reality aesthetics. In this game, every design choice was informed by the wish to keep the game as close to reality as possible. We conclude that the approach is indeed both possible and promising, and identify some suggestions for improvements.

#*Gaze computer interaction on stereo display.
#@Yong-Moo Kwon,Kyeong-Won Jeon
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5215
#arnetid5217
#!There are several researches on 2D gaze tracking techniques on the 2D screen. However, the researches for the gaze-based interaction to the stereo images or contents are not reported. This paper addresses gaze-based 3D interaction techniques on stereo display, such as parallax barrier display. This paper presents our researches on two issues for gaze-based 3D interaction, one is eye-vergence based 3D interaction, and the other is gaze vector based 3D interaction.

#*Internet pajama.
#@James Keng Soon Teh,Shang Ping Lee,Adrian David Cheok
#year2006
#confAdvances in Computer Entertainment Technology
#citation2
#index5216
#arnetid5218
#%453066
#!Internet Pajama is a novel application aimed at promoting physical closeness in remote communication between parent and child. A special pajama suit which is able to reproduce a hugging sensation is developed for the child. Parent is able to hug and physically interact with child by hugging a doll. Both pajama and doll are connected wirelessly to the Internet. Other features are incorporated to enhance the interaction and physical presence.

#*Paravie: dance entertainment system for everyone to express oneself with movement.
#@Jun Usui,Hirotaka Hatayama,Takashi Sato,Yumi Furuoka,Naohito Okude
#year2006
#confAdvances in Computer Entertainment Technology
#citation2
#index5217
#arnetid5219
#%647429
#%686362
#%88543
#%711097
#!This paper introduces Paravie, an entertainment system that anyone expresses oneself with movement. Paravie consists of a recording studio where a user mimics a role model movie and a mobile movie viewer which shows some people dancing with same music. User can enjoy learning dance skill with original expression as he draws upon various movies which recorded in various place and time.

#*Motivation-driven educational game design: applying best practices to music education.
#@Guillaume Denis,Pierre Jouvelot
#year2005
#confAdvances in Computer Entertainment Technology
#citation43
#index5218
#arnetid5220
#%789333
#%789390
#!Building upon research on motivation theory, we provide insights on how video games can be framed as expert tools that naturally reconcile learning and fun, a worthy goal since students are forced to where players volunteer, namely learning. Our main contribution is to suggest best practices rooted in psychology and motivation theory that we believe should be used when designing educational games.As a case study, we illustrate this approach by looking at the design of our ongoing Cha-Luva Swing Festival project, a video game dedicated to music education. Its overall pedagogical goal is to spur the players' curiosity and creativity by enabling them to easily play music using gamepads as musical instruments. This example perfectly illustrates our results, since motivational lapses due to instrumental limitations often lead to resignation and surrender.

#*PlantDisplay: turning houseplants into ambient display.
#@Satoshi Kuribayashi,Akira Wakita
#year2006
#confAdvances in Computer Entertainment Technology
#citation13
#index5219
#arnetid5221
#%502164
#!This paper discusses a new form of interface between humans and digital information. For this subject, we try to treat plants as ambient displays. As a first prototype, we propose PlantDisplay, which presents information as natural ambience. Furthermore, it gives a communication appealing to human sense and emotion by an organic change of plant.

#*Motion-capture-based avatar control framework in third-person view virtual environments.
#@Masaki Oshita
#year2006
#confAdvances in Computer Entertainment Technology
#citation11
#index5220
#arnetid5222
#%593453
#%593572
#%1119523
#%539874
#%88543
#%5396
#%593754
#%257325
#%1119696
#!This paper presents a motion-capture-based control framework for third-person view virtual reality applications. Using motion capture devices, a user can directly control the full body motion of an avatar in virtual environments. In addition, using a third-person view, in which the user watches himself as an avatar on the screen, the user can sense his own movements and interactions with other characters and objects visually. However, there are still a few fundamental problems. First, it is difficult to realize physical interactions from the environment to the avatar. Second, it is also difficult for the user to walk around virtual environments because the motion capture area is very small compared to the virtual environments. This paper proposes a novel framework to solve these problems. We propose a tracking control framework in which the avatar is controlled so as to track input motion from a motion capture device as well as system generated motion. When an impact is applied to the avatar, the system finds an appropriate reactive motion and controls the weights of two tracking controllers in order to realize realistic and also controllable reactions. In addition, when the user walks in position, the system generates a walking motion for the controller to track. The walking speed and turn angle are also controlled through the user's walking gestures. Using our framework, the system generates seamless transitions between user controlled motions and system generated motions. In this paper, we also introduce a prototype application including a simplified optical motion capture system.

#*Synchronization methods for supporting distributed 3D virtual environments in Java.
#@Kevin Gorman,Daneyand Singley,Yuichi Motai
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5221
#arnetid5223

#*The scenario and design process of childcare robot, PaPeRo.
#@Junichi Osada,Shinichi Ohnaka,Miki Sato
#year2006
#confAdvances in Computer Entertainment Technology
#citation7
#index5222
#arnetid5224
#!The scenarios and design process for a childcare robot, PaPeRo, are presented. The design process mainly consists of production and evaluations. The production is composed of three observations, namely, one in the user field, one with respect to the world view, and one about the assumed users and results for the basic role of the robot, its personality, and classification of users. Our investigation of available technologies deepened our understanding of the robot performance and characteristics. Preproduction, which consisted of a scenario design, prototyping, and a short play, made the scenario details more sophisticated. A six-month demonstration at the 2005 Aichi Expo started with seven different scenarios, which were improved using additional recognition words, more attractive robot personalities, and additional scenarios through on-site observations and discussion with staff members there. We conducted an extensive study on the robot personalities and recognizable words. Our study will play an important role in the scenario design process.

#*Scenario and design process of childcare robot PaPeRo.
#@Junichi Osada,Shinichi Ohnaka,Miki Sato
#year2006
#confAdvances in Computer Entertainment Technology
#citation7
#index5223
#arnetid5225
#!The scenario and design process for a childcare robot PaPeRo, are presented. We designed eight applications for the scenario. During a six-month demonstration at the 2005 Aichi Expo, we evaluated and improved the scenario.

#*The future of video: user experience in a large-scale, high-definition video display environment.
#@Belgacem Ben Youssef,Jim Bizzocchi,John Bowes
#year2005
#confAdvances in Computer Entertainment Technology
#citation1
#index5224
#arnetid5226
#!The new flatscreen displays provide a high-quality platform for the presentation of the moving image. The Introduction of High-Definition Television (HDTV) will push video quality to higher levels. We will see unprecedented cinema-quality moving images available in our homes. These and other emergent video technologies will support the use of more complex visual narrative constructions and enable the utilization of high-resolution flatscreen panel displays as ambient "video paintings". This paper provides an outline of some of the emergent production techniques enabled by large-scale high-definition video display environments. It also discusses the need for a new generation of postproduction tools in order to realize the aesthetic possibilities of this new medium. Finally, the paper reviews our creative visual explorations in the development of an ambient video genre through a set of three video works.

#*Reflex flower: ambient work rhythm visualization system in computer-aided work environments.
#@Itaru Kuramoto,Buntaro Kaji,Yu Shibuya,Yoshihiro Tsujino
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5225
#arnetid5227
#%590308
#%5419
#%5047
#!In order to keep and raise workers' productivity, it is important for them to know their "rhythm of work". It includes how long they should work continuously, when they should take a rest, and so on. Each worker has his/her own rhythm, but it is hard to be recognized, because its scent is so dim that he/she forget it easily when concentrating with his/her work. Therefore, showing the rhythm is effective to improve the worker's work environment.In this paper, we proposed the estimation and visualization method of the working rhythms. The rhythms estimate from workers' usage of keyboard and mouse. The rhythms is shown by their own "Reflex Flowers", which is always on their desktop. It indicates the estimated working rhythms ambiently, and it can notify each user the appriciate timing of rest. It also represents the user's daily/hourly amount of work. This function supports his/her feeling of achievements, which can lead improving his/her motivation.The result of the experimental evaluation pointed out that the participants could recognize their rhythms of work, and they felt happy when the flower is grown up.

#*Using a mobile device as an interface tool for HMD-based AR applications.
#@Kyong Joon Lee,Sang Chul Ahn,Hyoung-Gon Kim
#year2006
#confAdvances in Computer Entertainment Technology
#citation4
#index5226
#arnetid5228
#%236283
#%236266
#%437898
#!In this paper, we suggest that we can use our mobile devices as an effective interface for HMD-based augmented reality (AR) applications. These days most of us can possibly send short message with our mobile phones and watch the movies on our PDAs. Personal hand-held devices are well customized that they deserve to be familiar interfaces for interaction with AR applications. We can also add more interaction metaphors as mobile devices are designed to be programmable and extensible for some extra modules. Furthermore, the display panel of mobile devices makes a good marker which is changeable to variable features on user's demand.

#*Mosaic textile: wearable ambient display with non-emissive color-changing modules.
#@Akira Wakita,Midori Shibutani
#year2006
#confAdvances in Computer Entertainment Technology
#citation9
#index5227
#arnetid5229
#%453087
#%686190
#%236361
#%88826
#%711132
#%5729
#!Mosaic Textile is a wearable ambient display using non-emissive color-changing textiles. The system consists of textile modules, their controllers and substrate fabric. The textile module is called "Fabcell" (fabric element) and is composed of conductive yarns and liquid crystal ink. Combining fabcells, as if they are used as pixels, produces real-space ambient display. Different from emissive flexible display such as organic EL, dynamic graphics using non-emissive color-changing textiles actualizes hospitable and aesthetic information display, blending in with environment. Our method will be expected to design brand-new communication media intended for fabric artificial materials, used for fashion and interior decoration.

#*Emotional agent model and architecture for NPCs group control and interaction to facilitate leadership roles in computer entertainment.
#@Abdennour El Rhalibi,Nick Baker,Madjid Merabti
#year2005
#confAdvances in Computer Entertainment Technology
#citation5
#index5228
#arnetid5230
#%5004
#!The paper reports work involving the use of academic artificial intelligence to create realistic portrayals of leadership roles in computer game entertainment. In response to a perceived lack of depth and realism in the team relationship dynamics of modern gaming, the project developed a human agent architecture, multiagent system, and demonstrative game application. The agent architecture was based partially on research into social psychology, and utilized emotion and belief representations to drive action selection. Agent interaction and relationship development was produced on the basis of the Iterated Prisoner's Dilemma (IPD), through which a team's success came to be determined by its members' choices to cooperate or compete with its leader.

#*A component based architecture for distributed, pervasive gaming applications.
#@Carsten Magerkurth,Timo Engelke,Daniel H. Grollman
#year2006
#confAdvances in Computer Entertainment Technology
#citation8
#index5229
#arnetid5231
#%832513
#%1047179
#%89338
#%769959
#%5641
#%789354
#%892783
#!In this paper, we describe a component based architecture for developing distributed, pervasive games that integrate tangible and graphical user interface components. We first discuss some of the interface components we have developed and then present a coordination infrastructure called Pegasus that allows flexibly coupling and reconfiguring components during runtime. On top of Pegasus we have created a language for describing pervasive games called DHG and briefly present a first sample application that is based on the component based architecture and defined with the game description language DHG.

#*PAC-LAN: the human arcade.
#@Omer Rashid,William Bamford,Paul Coulton,Reuben Edwards
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5230
#arnetid5232
#%789517
#!PAC-LAN is a mixed reality game, which plays homage to the Namco classic Pacman, which utilises mobile phones equipped with in-built RFID readers. The game is played by 5 players around a suitable pedestrian area with their positions indicated on a graphical representation on their phone screen. Players use their mobile phone to interact with physical game pills (in the form of yellow plastic discs equipped with RFID tags and attached to lampposts) and opposing players (who have tags attached to their costumes). Whilst this is not the first game to play homage to Pacman the user experience shows that this technology is simple, easy to use, and allows the game to be played at very high speed over a large area with minimal setup. It is also the first that allows spectators to follow the action through an application running on any suitable Java enabled mobile phone. As current predictions estimate that half of mobile phones will be equipped with RFID capabilities by 2009 this project demonstrates an enormous potential for entertainment applications.

#*A model for mobile entertainment content consumption.
#@S. R. Subramanya,Byung K. Yi
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5231
#arnetid5233
#!The content targeted for mobile devices is expected to have enormous growths in the future. In order to sustain the growths in mobile content, technologies, and services, it is important to study schemes to enhance the content consumption experience of mobile users. This paper proposes a model for the consumption of mobile content, which is expected to aid the designers and developers of mobile content and services.

#*An extensible platform for interactive, entertaining social experiences with an animatronic character.
#@Sabrina A. Haskell,Andrew Hosmer,Eugenia Leu
#year2005
#confAdvances in Computer Entertainment Technology
#citation9
#index5232
#arnetid5234
#%770289
#!The fields of human-robot interaction and entertainment robotics are truly interdisciplinary, combining the best of computer science, psychology, and mechanical engineering. However, they are areas which have thus far been largely limited to technical specialists, excluding animators, writers, and other artists from the development of interactive content. We attempt to open these fields to non-technologists through an easily extensible platform for the rapid development of social interactions between humans and animatronic characters. Specifically, the Interbots Platform consists of 1) a servo-driven animatronic character named Quasi and 2) a suite of tools to author decisions, animate the character, and design complete, interactive, entertaining social experiences. We have created a graphical editor to author behaviors for the character, as well as extensions for Alias Maya and Macromedia Director, empowering artists already familiar with these applications to create animatronic-enabled content. The usability of the Interbots Platform was verified when interdisciplinary student teams of artists and computer scientists were able to create engaging entertainment experiences with Quasi in two-week development cycles.

#*Mobile TV.
#@Tanja K. Gompf
#year2006
#confAdvances in Computer Entertainment Technology
#citation-1
#index5233
#arnetid5235
#!My showcase will introduce the interactive DVB-H movie developed for handheld devices.We engage the user to explore and communicate the new challenging ways of an interactive experiment. This hybrid activity, where we believe in the artist as an actor in the innovation process, we are creating an autonomous experience, a mutual communication where the User becomes the Author and the Author become the User.I hear and I forgetI see and I rememberI (inter) act and I understand--- ConfuciusThe expanding usage of mobile high-end devices and the start of UMTS demand new applications dealing with multimedia and its data services. Especially with the launch of DVB-H and DMB as the leading formats, mobile TV will become a reality. Together with artists, industry partners as well as media and design researchers we are looking at ways of how to interact and represent moving images on handheld devices.

#*Dynamic evaluation of distribution of visual attention during playing video game.
#@Kenji Yokoi,Katsumi Watanabe,Takashi Kawai
#year2006
#confAdvances in Computer Entertainment Technology
#citation2
#index5234
#arnetid5236
#!In this study, we measured spatial distribution of visual attention in video game playing by a gaze-contingent window method. This method enables us to estimate the spatial extent of visual attention used for a player to play a given video game. The quantitative relationship between window size and game performance provides us useful information as for the online evaluation of performance and dynamic attentional allocation in playing video game.

#*Interactive three-dimensional rendering on mobile computer devices.
#@Javier Lluch,Rafael Gaitán,Emilio Camahort,Roberto Vivó
#year2005
#confAdvances in Computer Entertainment Technology
#citation9
#index5235
#arnetid5237
#%531319
#%280361
#%786519
#%786590
#!We present a client/server system that is able to display 3D scenes on handheld devices. This kind of devices have important restrictions of memory and computing power. Therefore, we need to limit the amount of geometry sent by the server to each client. We extract the geometry that is visible for each client and send it. The clients render the geometry using the OpenGL ES [10] API. Our geometry extraction algorithm employs multiresolution and view-dependent simplification. We present results of our system running on a software implementation of OpenGL ES that runs on a Pock-etPC 2003.

#*To use PYA tool or not for learning Japanese hand alphabets.
#@Miki Namatame,Yasushi Harada,Fusako Kusunoki,Shigenori Inagaki,Takao Terano
#year2006
#confAdvances in Computer Entertainment Technology
#citation2
#index5236
#arnetid5238
#%1491783
#%54069
#%53987
#%89614
#%5343
#%54010
#!We are developing an easy-to-use edutainment system: Practice! YUBIMOJI AIUEO (PYA). The objective is to promote basic expressions of Kana characters (AIUEO) of Japanese hand alphabets (YUBIMOJI) to ordinary children at elementary school age. PYA seems to work well from users' behaviors and responses, however, the effectiveness has not been fully confirmed, so far. In this paper, we have carried out series of intensive experiments at classrooms of Sumiyoshi Elementary School (7 or 8 years old; 83 subjects). The results are summarized as follows: 1) Devices the children use to learn do not affect the performance just after the study; 2) the PC use is effective when the target characters are complex and similar; and 3) The PC users keep remembering difficult shapes of characters after one month. These results have suggested that the use of PCs is superior to the ordinary oral lectures, however, it depends on the features of characters.

#*Kick-real, a mobile mixed reality game.
#@Christian Reimann
#year2005
#confAdvances in Computer Entertainment Technology
#citation6
#index5237
#arnetid5239
#!Interaction with mobile applications is often awkward due to the limited and miniaturized input modalities available. This is especially problematic for games where the only incentive to use an application is the pleasure derived from the interaction. It is therefore interesting to examine novel forms of interaction in order to increase the "playability" of mobile games.This demo presents a mobile mixed reality game using computer vision (CV) as it's main interaction modality. The user can kick a virtual ball with his real foot into a virtual goal.

#*Believable environments: generating interactive storytelling in vast location-based pervasive games.
#@Anton Gustafsson,John Bichard,Liselott Brunnberg,Oskar Juhlin,Marco Combetto
#year2006
#confAdvances in Computer Entertainment Technology
#citation19
#index5238
#arnetid5240
#%637009
#%5007
#%88277
#!Generating content into vast areas is a relevant challenge in the field of location-based pervasive games. In this paper, we present a game prototype that enables children travelling in the back seat of a car to enjoy a narrated experience where gameplay combines with the experience of traveling through the road network. The prototype is designed to provide what we refer to as a believable environment. We propose four design characteristics to persuasively include a journey within a pervasive game. First, the story should refer to geographical objects with their everyday meanings. Second, the game's scale needs to cover vast areas. Third, the application should provide sequential storytelling to make it fit with the journey experience, and finally it should provide interaction support where players can engage in gameplay and interact with the computer in various ways at the same time as they are looking out of the car window. We describe how these requirements have been implemented in the prototype and present an initial performance test.

#*Wizard's apprentice gameplay-oriented design of a computer-augmented board game.
#@Johan Peitz,Staffan Björk,Anu Jäppinen
#year2006
#confAdvances in Computer Entertainment Technology
#citation8
#index5239
#arnetid5241
#%459673
#%453336
#%89338
#%776871
#%5286
#%235946
#!This paper describes the prototype Wizard's Apprentice, a computer-augmented board game. Unlike many previous examples from research, which use board games as a means to explore technology, the game was developed from the starting point of gameplay design goals. The paper reports upon how the different starting point required iteration between the various design disciplines involved. The game and the design within the various disciplines are described together with sections on how results from one discipline affected other. The paper ends with reports from the first preliminary evaluation.

#*Wizard's apprentice gameplay-oriented design of a computer-augmented board game.
#@Johan Peitz,Staffan Björk,Anu Jäppinen
#year2006
#confAdvances in Computer Entertainment Technology
#citation8
#index5240
#arnetid5242
#!This paper describes the prototype Wizard's Apprentice, a computer-augmented board game. Unlike many previous examples from research, which use board games as a means to explore technology, the game was developed from the starting point of gameplay design goals. The paper reports upon how the different starting point required iteration between the various design disciplines involved. The game and the design within the various disciplines are described together with sections on how results from one discipline affected other. The paper ends with reports from the first preliminary evaluation.

#*Low cost solution for location determination of mobile nodes in a wireless local area network.
#@Ansar-Ul-Haque Yasar,M. A. Ansari,Sherjeel Farooqui
#year2006
#confAdvances in Computer Entertainment Technology
#citation-1
#index5241
#arnetid5243
#!In this research paper we undertook the problem of Location Determination of Mobile nodes in a Wireless Local area network, as finding out the location in a wireless environment is to-date not very easy, cheap and accurate using 802.11b technology. We used the classical method of Triangulation with a little alteration which is later on described in the paper. Another method we used is the methods of calibration by research to produce more accurate results and also to cross verify the results of the method of Triangulation. The work in this paper attempts to illustrate the different aspects of the problem of location determination in WiFi networks. We started with an investigation of the influence that network characteristics have on the ability of middleware location determination protocols to accurately estimate position of mobile nodes. We presented an implementation based study that demonstrated the strong relationship between the two of the location determination methods and their performance. The main objective of this paper is to provide method in which no dedication hardware is required. Only Wireless Lan card is required and can be placed in any suitable location. The significance of this result lies in allowing a network designer to make a suitable tradeoff between QoS of location determination and other application protocols while choosing a network topology. The combination of two methods reduced the error rate of locating a mobile node to a great extent. The results were being plotted on a given map using both the algorithms.

#*Free network visible network.
#@Clara Boj Tovar,Diego J. Díaz,Adrian David Cheok,Ke Xu,Wei Liu
#year2005
#confAdvances in Computer Entertainment Technology
#citation1
#index5242
#arnetid5244
#!This artistic project uses the possibilities of the new technologies to create new landscapes in the public space by means of the visualization of the data that flow between digital networks. It changes our perception of the world with the "invisible meanings" that are around us.

#*Development of the tool for artistic representation of internal information of the body.
#@Shigeru Sakurazawa,Junichi Akita,Masashi Toda
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5243
#arnetid5245
#!In this paper, we describe the idea of a new artistic representation tool to project performer's internal state of the body. To solve the problem of complicated wires and for detecting biological signals, the flexible conductive wear for wearable computing named as "TextileNet system" was applied to the system. In this paper, we also describe the experimental results of trial growing of the tool. The advantage of the conductive fabric was not only solving the problem but shielding effect, which could make the amplifier simple. Using the feature of TextileNet, huge number of biological information can be treated at same time, and more complex representation is expected.

#*Characterization of user behavior in a multi-player online game.
#@Michael Kwok,Gary Yeung
#year2005
#confAdvances in Computer Entertainment Technology
#citation9
#index5244
#arnetid5246
#%490033
#%519570
#%514128
#!In recent years, multi-player online games (MOGs) have gained enormous popularity and become a major trend in the entertainment industry. Much research has been focusing on improving the performance and scalability of MOG systems. However, relatively little attention has been paid to the study of user behavior. As with other complex interactive applications, a good understanding of user behavior is important to the design of MOG systems. In this paper, we discuss the advantages of a user behavior workload model to the software industry and the research community, and describe a method to develop such a model. For illustrative purposes, we study user behavior by using the measurement data collected from an existing MOG system. This includes the characterization of the interarrival time of logon users, the transition probability of avatars within the virtual environment, the residence time at a room, and the session length. Our results not only provide an insight into user behavior in MOGs, but they are also useful in the development of workload models in performance studies of MOG systems.

#*Computational support for compelling story telling.
#@Sara Owsley,Kristian J. Hammond,David A. Shamma
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5245
#arnetid5247
#!The Internet is a living, breathing reflection of who we are, what we think, and how we feel. The pages that make up the Web form the book of our contemporary life and culture. They are the ongoing and changing buzz of our world. The latest embodiment of this cultural reflection is found in blogs. Not only are blogs widespread, but they are incredibly dynamic, with hundreds updated per minute. The existence of millions of blogs on the web has resulted in more than the mere presence of millions of online journals, but rather, they generate a collective buzz around the events in the world.

#*Game space design foundations for trans-reality games.
#@Craig A. Lindley
#year2005
#confAdvances in Computer Entertainment Technology
#citation11
#index5246
#arnetid5248
#%775046
#%5061
#%648307
#!Trans-reality games are games that take advantage of pervasive, mobile, ubiquitous, location-based and mixed reality technical infrastructures to create game spaces that can include physical reality together with one or more virtual realities. Creating these games requires basic design decisions about the relationships between the large scale game spaces involved. In particular, the different game spaces can be related by general 3D coordinate system transforms, together with decisions regarding isomorphism at different levels of spatial scale. The result is a large space of possibilities for trans-reality game space design supporting very different forms of game mechanics.

#*Synthesizing pose, unconscious movement, and gesture for mental behavior expression of interactive characters.
#@Atsushi Nakano,Kenta Shioiri,Junichi Hoshino
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5247
#arnetid5249
#%1119550
#%593158
#%1330618
#!Mental communication with characters is important for many entertainment applications. Human's mental statuses are complex, and mental behaviors typically consist of multiple components, such as poses and various unconscious movements. In this paper, we propose the layered behavior synthesis technique for integrating mental behavior and conversational gestures. We compose various mental behavior representations by considering the spatial consistency and co-occurrence probability in interactive games. We also show an example of a game that incorporates the mental behavior synthesis technique.

#*Metazoa Ludens.
#@Roger Thomas Kok Chuen Tan,V. Todorovic,G. Andrejin,James Keng Soon Teh,Adrian David Cheok
#year2006
#confAdvances in Computer Entertainment Technology
#citation-1
#index5248
#arnetid5250
#!Metazoa Ludens is new gaming model which allows pets to play new mixed reality computer games with humans via custom built technologies and applications. These games for pets and humans will provide new beneficial relations, progressions and evolution of the Metazoa species.

#*Face decorating system based on improved active shape models.
#@Shuchang Wang,Yangsheng Wang,Li Bai
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5249
#arnetid5251
#%907739

#*Improving quality of service in videogames.
#@Inmaculada García,Ramón Mollá Vayá
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5250
#arnetid5252

#*Untethered robotic play for repetitive physical tasks.
#@Andrew G. Brooks,Matt Berlin,Jesse Gray
#year2005
#confAdvances in Computer Entertainment Technology
#citation9
#index5251
#arnetid5253
#%1497556
#%757840
#%593119
#%593090
#%673416
#%751326
#%5000
#%293003
#%907622
#%514459
#%54125
#!Personal robots are an increasingly promising new platform for human entertainment. In particular, socially interactive game playing can be used as a mechanism for imparting knowledge and skills to both the robot and the human player. Simultaneous advances in untethered sensing of human activity has widened the scope for inclusion of natural physical movement in these games. In particular, this places certain human health applications within the purview of entertainment robots. Socially responsive automata equipped with the ability to physically monitor unencumbered humans can help to motivate them to perform suitable repetitions of exercise and physical therapy tasks. We demonstrate this concept with two untethered playful interactions: arm exercise mediated by play with a physical robot, and facial exercise mediated by expression-based operation of a popular video game console.

#*Interactive free-hand drawing and in-between generation with DBSC.
#@Seah Hock Soon,Zhongke Wu,Feng Tian,Xian Xiao,Boya Xie
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5252
#arnetid5254
#!Based on our novel shape and stroke model, Disk B-spline Curve (DBSC), this demo provides user an interactive free-hand drawing system. With a digital tablet the user may draw directly onto the computer a picture whose strokes are then represented by DBSC functions. This representation will not only save space for storing and transmission, but also allow the user to manipulate strokes easily and effectively like zooming. Given two or more pictures, the system can automatically generate intermediate frames, so called in-betweens, thus forming a smooth sequence of animation.

#*Sketching-out virtual humans: from 2D storyboarding to immediate 3D character animation.
#@Chen Mao,Sheng Feng Qin,David K. Wright
#year2006
#confAdvances in Computer Entertainment Technology
#citation9
#index5253
#arnetid5255
#%70548
#%1119006
#%592992
#%1119114
#%593003
#%29241
#%1119573
#!Virtual beings are playing a remarkable role in today's public entertainment, while ordinary users are still treated as audiences due to the lack of appropriate expertise, equipment, and computer skills. In this paper, we present a fast and intuitive storyboarding interface, which enables users to sketch-out 3D virtual humans, 2D/3D animations, and character intercommunication. We devised an intuitive "stick figure→fleshing-out→skin mapping" graphical animation pipeline, which realises the whole process of key framing, 3D pose reconstruction, virtual human modelling, motion path/timing control, and the final animation synthesis by almost pure 2D sketching. A "creative model-based method" is developed, which emulates a human perception process, to generate the 3D human bodies of variational sizes, shapes, and fat distributions. Meanwhile, our current system also supports the sketch-based crowd animation and the storyboarding of the 3D multiple character intercommunication. This system has been formally tested by various users on Tablet PC. After minimal training, even a beginner can create vivid virtual humans and animate them within minutes.

#*A proactive file transfer scheme in a distributed haptic museum.
#@Toshio Asano,Masahito Isamu,Yutaka Ishibashi
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5254
#arnetid5256
#!This paper illustrates the effectiveness of a proactive file transfer scheme for adaptive display control in a distributed haptic museum with touchable exhibits, which is an application using haptic, audio and visual media. The proactive file transfer scheme dynamically changes the time to request the information files according to the network load in order to decrease the response time and to improve the media output quality. In this paper, we propose an estimation method which uses a part of information files as probe packets to estimate the network load. By experiment, we make a performance comparison among three schemes including the proactive file transfer scheme. Experimental results show that the proactive file transfer scheme with the proposed estimation method has smaller average switch times for display of an exhibited object than the other schemes.

#*Sketching-out virtual humans: from 2D storyboarding to immediate 3D character animation.
#@Chen Mao,Sheng Feng Qin,David K. Wright
#year2006
#confAdvances in Computer Entertainment Technology
#citation9
#index5255
#arnetid5257
#!Virtual beings are playing a remarkable role in today's public entertainment, while ordinary users are still treated as audiences due to the lack of appropriate expertise, equipment, and computer skills. In this paper, we present a fast and intuitive storyboarding interface, which enables users to sketch-out 3D virtual humans, 2D/3D animations, and character intercommunication. We devised an intuitive "stick figure→fleshing-out→skin mapping" graphical animation pipeline, which realises the whole process of key framing, 3D pose reconstruction, virtual human modelling, motion path/timing control, and the final animation synthesis by almost pure 2D sketching. A "creative model-based method" is developed, which emulates a human perception process, to generate the 3D human bodies of variational sizes, shapes, and fat distributions. Meanwhile, our current system also supports the sketch-based crowd animation and the storyboarding of the 3D multiple character intercommunication. This system has been formally tested by various users on Tablet PC. After minimal training, even a beginner can create vivid virtual humans and animate them within minutes.

#*A massively multi-authored mobile surrealist book.
#@William Bamford,Paul Coulton,Reuben Edwards
#year2006
#confAdvances in Computer Entertainment Technology
#citation2
#index5256
#arnetid5258
#%789322
#!In this paper we describe an innovative mobile game in the form a multi-authored book. Based upon the 1920s surrealist technique of "Exquisite Corpse", the book builds from a series of standard text message length contributions with each author being given only the previous message on which to base their own contribution. Previous contributors are encouraged to spread the awareness of the book, and hence the number of participants, by forwarding a text message to produce a mobile viral distribution mechanism. The book has been designed as a mobile multi-player game as it has, in common with the surrealist technique, its origins in the Victorian parlor game of 'Consequences', and as user feedback shows, it does demonstrate many game attributes. The book offers an interesting perspective into how massively multiplayer mobile games may be used, how they can be made appealing to the very broad mobile user demographic, and how the elusive phenomena of mobile viral distribution occurs in practice.

#*NeGAS: logo based authoring environment for 3D computer animation.
#@Ueno Masayuki,Nishiki Takeshi,Tsushima Katsuhide
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5257
#arnetid5259
#!There are already many software products to create 3DCG motion pictures. However, their products have complicated user interface to control massive degrees of freedom of manual character control.Authoring operation of 3D computer animation is complex and complicated task, therefore, to remove this bottleneck will increase productivity and speed up trial and error.Turtle metaphor which is conceived with Logo programming language is enhanced to construct animation authoring system with consistent policy. On this enhancement, 3D visual object can be constructed, and these objects can be moved with simple command sequence.According to this concept, O3Logo has been developed. And, A motion picture creation environment - NeGAS (Next Generation Authoring System) has been developed based on O3Logo. Especially, motion planning and editing is important task in computer animation. And, automatic animation generator using agent technology are designed which motion picture authors are helped and assisted to reduce load and time cost.However, intelligent systems are using symbolic rule description, therefore, it is difficult to use for novice. The solution on NeGAS is enhancement of motion flexibility and intelligent human interface which is visualized the invisible effects of rule description.

#*JGOMAS: game-oriented multi-agent system based on jade.
#@Antonio Barella,Carlos Carrascosa,Vicente J. Botti
#year2006
#confAdvances in Computer Entertainment Technology
#citation7
#index5258
#arnetid5260
#%13761
#%56394
#!This paper presents an initial stage of feasibility study for integrating Multi-Agent Systems (MAS) and Real-Time Graphic Applications. To do this, a multiagent framework has been developed. This system can also be used as a testbed for coordination, communication and learning mechanisms applied to MAS or any AI techniques in general. JGOMAS is available for download at: www.dsic.upv.es/users/ia/sma/tools/jgomas/index.html

#*Airhockey over a distance: a networked physical game to support social interactions.
#@Florian Mueller,Luke Cole,Shannon O'Brien,Wouter Walmink
#year2006
#confAdvances in Computer Entertainment Technology
#citation16
#index5259
#arnetid5261
#%121695
#%87670
#%789376
#!In modern society, people increasingly lack social interaction, even though it is beneficial to professional and personal life. Airhockey Over a Distance aims to work against this trend by recreating the social experience and rapport facilitated by physical, casual game play in a distributed environment. We networked two airhockey tables and augmented them with a videoconference. Concealed mechanics on each table allow for a physical puck to be shot back and forth between the two locations, creating a perceived physical shared space between the participants. The hitting of a fast-moving, tangible puck between the two players creates a compelling social game experience which can support social interactions and contribute to an increased connectedness between people who are physically apart.

#*InAuthoring environment: interfaces for creating spatial stories and gaming activities.
#@Filipe Barrenho,Teresa Romão,Tiago Martins,Nuno Correia
#year2006
#confAdvances in Computer Entertainment Technology
#citation11
#index5260
#arnetid5262
#%5378
#%502732
#%256583
#!This paper focuses on the design and development of an authoring environment for the InStory project. InStory is a platform for mobile storytelling, gaming activities and information access. It focuses on the exploration of cultural and historical physical spaces, promoting interaction between users. During those explorations, users have access to contextual geo-referenced multimedia data, through the use of mobile devices, such as PDAs or mobile phones, either for knowledge acquisition regarding the surrounding environment and its cultural and historical aspects or for engaging in story/gaming activities together with other users.The authoring environment for such story/gaming activities and media content, allows users to create and personalize their own stories. It comprises two frameworks -- InAuthor, a graphical story/game editor, and InContent, a visual editor for creating screen areas through the placing of multimedia and interface elements and their export to InAuthor, in order to be associated with activity nodes.

#*Drop*STAR: support system of musical arrangement and performance for small groups.
#@Seiko Myojin,Mie Nakatani,Hirokazu Kato
#year2006
#confAdvances in Computer Entertainment Technology
#citation-1
#index5261
#arnetid5263
#!The purpose of this study is to make users enjoy musical performance like a band regardless of skill level on musical instruments. Other studies have focused on only beginners or only experts [1] [5] [4]. Very few attempts have been made at our purpose. Our system consists of miniature stage and dolls as players. When users move dolls on the stage, sound changes with corresponding dolls' motion and position. If users play in concert, users enjoy not only instruments or music but also talking about the course of performance and practice process. Band members often practice with making conditioning in order to make their songs better. If users use this system, they discuss the mood and flow of their music, practice their timing to play under their policy, keep a good balance between instruments and contrive ways to move their dolls. And they will show off their playing prowess. In the process, users are able to experience performance like a band. We call this system Drop*STAR (<u>D</u>olls <u>R</u>hythmic Po<u>p</u> <u>Stars</u>).

#*Interpolation techniques for the artificial construction of video slow motion in the postproduction process.
#@David Steffen Bergman,Belgacem Ben Youssef,Jim Bizzocchi,John Bowes
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5262
#arnetid5264
#%5224
#!Motion compensated interpolation (MCI) refers to the process of taking a video sequence, finding motion information, and then using that information to produce interpolated video frames between source frames. In this study, we compare two MCI techniques: adjacent-frame motion compensated interpolation (AF-MCI) and wide-span motion compensated interpolation (WS-MCI). Using reproducible artificially generated video sequences, the methods are quantitatively compared with the objective of optimizing interpolated frame quality relative to control interpolated frames. This is useful because on a large flat-panel display with high resolution (such as HDTV), frame transition coherence becomes a crucial factor in assessing the quality of the user's viewing experience. To enhance MCI, the encoder should attempt to exploit long-term statistical dependencies, precisely estimate motion by modeling the motion vector field, and superimpose efficient prediction/interpolation algorithms. WS-MCI achieves this. Computer simulations using artificially generated video sequences demonstrate the consistent advantage of WS-MCI over adjacent-frame MCI under increasingly complex source scenes and chaotic occlusion conditions.

#*Gravity jockey: a novel music experience with galvanic vestibular stimulation.
#@Naohisa Nagaya,Masashi Yoshidzumi,Maki Sugimoto,Hideaki Nii,Taro Maeda,Michiteru Kitazaki,Masahiko Inami
#year2006
#confAdvances in Computer Entertainment Technology
#citation3
#index5263
#arnetid5265
#!In this paper, we propose a Gravity Jockey (GJ) system in "Electric Dance Revolution" that allows subjects to experience vestibular sensation by means of galvanic vestibular stimulation (GVS) synchronized with music rhythms. The Gravity Jockey system enables people using GVS to feel music rhythms not only by the sense of hearing but also by visual perception and balance sensation. And in order to evaluate the effects of this system on user's perception, we conducted psychophysical experiments during GVS with alternating current (AC).

#*Assessment of mobile experience engine, the development toolkit for context aware mobile applications.
#@Amitava Biswas,Tom Donaldson,Jagmit Singh,Sara Diamond,David Gauthier,Michael Longford
#year2006
#confAdvances in Computer Entertainment Technology
#citation9
#index5264
#arnetid5266
#%5580
#%5708
#%5557
#%89766
#%88271
#%5536
#%87946
#%5595
#%634242
#%233037
#!Non-technical designers are using pervasive, context aware and mobile technologies as new design media to deliver unique user experiences and new values. Designer, artists and technologists often collaborate to design and develop these new media applications. In such multi-disciplinary collaborations, lack of suitable development tools and software engineering methods often pose non-trivial challenges. The requirements for a development toolkit for such contexts are enumerated. The rational behind usage of Mobile Experience Engine, a suitable CASE tool, is presented along with its high level architecture. This paper also examines how this tool supports various software engineering tasks during context aware mobile application development.

#*User model in multiplayer mixed reality entertainment applications.
#@Stéphane Natkin,Chen Yan
#year2006
#confAdvances in Computer Entertainment Technology
#citation6
#index5265
#arnetid5267
#!Most computer games and more generally entertainment applications use implicitly or explicitly a user model as a reference for the gameplay and dramaturgy progression. with mixed reality technology and ubiquitous computing, user-centered design is required now more than ever to provide an adaptable and personal content at any time and in any context. The goal of our research is to provide a narration model correlated to a user model in the design of mixed reality entertainment. In this paper we give a brief survey of the current researches on user model for adaptation and personalization of services and some empirical studies of user model in games and interactive narration. We propose three possible levels of the user model: generic, localized and personalized and three types of narration scheme. We will describe that the user model and narration schemes can be used in a mixed reality system.

#*Ambient video.
#@Jim Bizzocchi
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5266
#arnetid5268
#!I propose to demonstrate my video productions, and discuss their style, purpose, and creative direction. I intend to show excerpts from my video works "Rockface" and "Streaming Video". These works are part of my overall research program. My research has led me to predict the emergence of a form of popular televisual art I call "Ambient Video". In the scholarly portion of my research, I write about Ambient Video, predicting its future by tracing its antecedents in popular cinema, experimental film, and video art. At the same time, I am engaged in the production of a series of Ambient Video production works. This creative arm of my research instantiates the directions I am predicting. The video productions act as "proof-of-concept" to demonstrate the ideas I am describing.

#*Interaction techniques for musical performance with tabletop tangible interfaces.
#@James Patten,Ben Recht,Hiroshi Ishii
#year2006
#confAdvances in Computer Entertainment Technology
#citation31
#index5267
#arnetid5269
#%90612
#%5533
#%745221
#%89816
#%514548
#!We present a set of interaction techniques for electronic musical performance using a tabletop tangible interface. Our system, the Audiopad, tracks the positions of objects on a tabletop surface and translates their motions into commands for a musical synthesizer. We developed and refined these interaction techniques through an iterative design process, in which new interaction techniques were periodically evaluated through performances and gallery installations. Based on our experience refining the design of this system, we conclude that tabletop interfaces intended for collaborative use should use interaction techniques designed to be legible to onlookers. We also conclude that these interfaces should allow users to spatially reconfigure the objects in the interface in ways that are personally meaningful.

#*Fuzzy cognitive goal net for interactive storytelling plot design.
#@Yundong Cai,Chunyan Miao,Ah-Hwee Tan,Zhiqi Shen
#year2006
#confAdvances in Computer Entertainment Technology
#citation8
#index5268
#arnetid5270
#%5474
#%55560
#%874550
#%5007
#%912722
#%260947
#!Interactive storytelling attracts a lot of research interests among the interactive entertainments in recent years. Designing story plot for interactive storytelling is currently one of the most critical problems of interactive storytelling. Some traditional AI planning methods, such as Hierarchical Task Network, Heuristic Searching Method are widely used as the planning tool for the story plot design. This paper proposes a model called Fuzzy Cognitive Goal Net as the story plot planning tool for interactive storytelling, which combines the planning capability of Goal net and reasoning ability of Fuzzy Cognitive Maps. Compared to conventional methods, the proposed model shows a well-established temporal structure for story plot. It delegates the storytelling process to drama manager agent and sub drama manager agents. Dynamic storylines are prepared for the audiences' interactions. Fuzzy Cognitive Maps provide the drama manager agents strong reasoning capability with respect to story context and user interactions, which empowers the storytelling characteristics of context-awareness and user-awareness. An interactive storytelling engine has been built with the proposed model and knowledge base of interactive storytelling scenario. Based on the interactive storytelling engine, a prototype system, namely "illness investigation in Singapore River City", was implemented in the virtual environment, in which the story of illness investigation is presented in the dynamic context by responding to the user interactions and environment variables.

#*Fast delivery of game events with an optimistic synchronization mechanism in massive multiplayer online games.
#@Stefano Ferretti,Marco Roccetti
#year2005
#confAdvances in Computer Entertainment Technology
#citation18
#index5269
#arnetid5271
#%512819
#%512753
#%512807
#%512761
#%673849
#%841313
#%674028
#%1128302
#%343281
#%502545
#%789382
#!As smart players often win MMOG sessions by adopting frantic gaming strategies along the game evolution, also the system activities concerned with the distributed support of MMOGs must advance at a very fast pace. Unfortunately, MMOGs' responsiveness requirements are hardly met when pessimistic approaches are adopted to synchronize the game event exchange activities among game servers. In this paper we show how MMOGs are better supported by optimistic synchronization schemes coupled with mechanisms that exploit the semantics of games. Results obtained from an experimental assessment of our developed scheme demonstrate the validity of our claim.

#*Adaptative execution of game: unfolding a correct story.
#@Ronan Champagnat,Pascal Estraillier,Armelle Prigent
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5270
#arnetid5272
#!Computer games have improved this last decade on technical aspects (graphical, sound design, etc.) as well as on the content. Actually games are getting more and more complex. Plot has been improved and is getting close to scenario movie or scenario novel.

#*Tri-Story as "intuitive cinema" interactive storytelling based on physical action for multi-screen.
#@Satoru Tokuhisa,Alice Ding,Masa Inakage
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5271
#arnetid5273
#%593209
#%1119377
#!This paper proposes "intuitive cinema" -- a new form of interactive storytelling, which emphasizes user motive and viewpoints, and implements its cinematic expressions based on immersive quality and audience's viewing methods. We use the quality of physical action that is made possible through a multi-screen system, and use it to approach a novel interactive storytelling method. From this concept comes "intuitive cinema", that allows its viewers freedom to watch the movies from their personal viewpoints. The content consists of 3 channels of live-action motion pictures, and the system applies interactive displays to realize the content "Tri-Story" based on the concept of intuitive cinema.

#*An empirical evaluation of TCP performance in online games.
#@Kuan-Ta Chen,Chun-Ying Huang,Polly Huang,Chin-Laung Lei
#year2006
#confAdvances in Computer Entertainment Technology
#citation17
#index5272
#arnetid5274
#%1121858
#%118
#%1122118
#%512827
#!A fundamental design question to ask in the development of a network game is---Which transport protocol should be used---TCP, UDP, or some other protocols? Seeking an objective answer to the choice of communication protocol for MMORPGs, we assess whether TCP, a popular choice, is suitable for MMORPGs based on empirical evidence. To the best of our knowledge, this work is the first evaluation of transport protocol performance using real-life game traces.We analyze a 1, 356-million-packet trace from ShenZhou Online, a TCP-based, commercial, mid-sized MMORPG. Our analysis indicates that TCP is unwieldy and inappropriate for MMORPGs. This is due to four distinctive characteristics of MMORPG traffic: 1) tiny packets, 2) low packet rate, 3) application-limited traffic generation, and 4) bidirectional traffic. We show that because TCP was originally designed for unidirectional and network-limited bulk data transfers, it cannot adapt well to MMORPG traffic. In particular, the window-based congestion control and the fast retransmit algorithm for loss recovery are ineffective. Furthermore, TCP is overkill, as not every game packet needs to be transmitted in a reliably and orderly manner. We also show that the degraded network performance did impact users' willingness to continue a game. Finally, we discuss guidelines in designing transport protocols for online games.

#*The 3D interactive visit to Piazza dei Miracoli, Italy.
#@Marcello Carrozzino,Andrea Brogi,Franco Tecchia,Massimo Bergamasco
#year2005
#confAdvances in Computer Entertainment Technology
#citation5
#index5273
#arnetid5275
#!This paper present an innovative VR application where the users, guided through structured narrative paths, are able to explore the space and the history of Piazza dei Miracoli in Pisa. The application was realized in the course of a research project whose objective was to create a complete multimedia system related to the renowned monumental complex. In order to be accessible from a wide audience, the application is hosted in a dedicated website. Several optimization techniques and a novel state-of-the-art 3D web technology were used to take in account issues related to VR real-time constraints and the limited web bandwidth.

#*Identifying MMORPG bots: a traffic analysis approach.
#@Kuan-Ta Chen,Jhih-Wei Jiang,Polly Huang,Hao-Hua Chu,Chin-Laung Lei,Wen-Chin Chen
#year2006
#confAdvances in Computer Entertainment Technology
#citation38
#index5274
#arnetid5276
#%777136
#%789465
#%512755
#%950122
#%512842
#%789357
#%1456759
#!Massively multiplayer online role playing games (MMORPGs) have become extremely popular among network gamers. Despite their success, one of MMORPG's greatest challenges is the increasing use of game bots, that is, autoplaying game clients. The use of game bots is considered unsportsmanlike and is therefore forbidden. To keep games in order, game police, played by actual human players, often patrol game zones and question suspicious players. This practice, however, is labor-intensive and ineffective. To address this problem, we analyze the traffic generated by human players versus game bots and propose general solutions to identify game bots. Taking Ragnarok Online as our subject, we study the traffic generated by human players and game bots. We find that their traffic is distinguishable by 1) the regularity in the release time of client commands, 2) the trend and magnitude of traffic burstiness in multiple time scales, and 3) the sensitivity to different network conditions. Based on these findings, we propose four strategies and two ensemble schemes to identify bots. Finally, we discuss the robustness of the proposed methods against countermeasures of bot developers, and consider a number of possible ways to manage the increasingly serious bot problem.

#*Telepresence racing game.
#@Yongjin Kim,Jaehoon Jung,Seokhee Jeon,Sangyoon Lee,Gerard Jounghyun Kim
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5275
#arnetid5277
#!Telepresence enables users to interact with and experience "real" environments by providing the display and means of interaction using sensors and actuators. In this demonstration, we apply the concept of telepresence to the good old sports car racing game. The user remotely controls, from a desktop computer, a toy car that is situated in a remote environment and equipped with wireless stereo-cameras and other sensors. The experience of the user is enriched by the information displayed to the user, namely the live stereo image and artificial multimodal special effects generated from the information from the sensors. The proposed telepresence game is expected to offer a different kind of fun and excitement compared to the 3D graphics based counterparts because the user does not have to suspend one's disbelief, and has to be aware and conscious of the actual physical implications of one's action. In the actual demo, two telepresence toy cars will run on a small mock up race track (thus requiring two control PC's).

#*Initial lessons from AR Façade, an interactive augmented reality drama.
#@Steven Dow,Manish Mehta,Annie Lausier,Blair MacIntyre,Michael Mateas
#year2006
#confAdvances in Computer Entertainment Technology
#citation12
#index5276
#arnetid5278

#*Building 3D interactive environments for the children's narrative: a didactic project.
#@Andrea Baroni,Chiara Evangelista,Marcello Carrozzino,Massimo Bergamasco
#year2005
#confAdvances in Computer Entertainment Technology
#citation1
#index5277
#arnetid5279
#!A didactic project based on computer technology and advanced computer graphics combined with an active classroom experience is presented. The final purpose is the creation and the test of a new authoring tool for building 3d interactive environments inside a narrative context.In the paper we will describe our didactic project, the current technology implementation and the final interactive application realized.

#*In game advertising: touching the elusive consumer.
#@Marc Duke
#year2006
#confAdvances in Computer Entertainment Technology
#citation0
#index5278
#arnetid5280
#!Consumers are bombarded with more and more advertising, while traditional media such as TV and radio become more and more fragmented, the challenge of reaching the consumer gets harder and harder. Consol and video games are a media that does not suffer from user 'switch off' or channel hopping and if carefully integrated advertisers can link in with games that match a brand and connect to other channels such as billboards, mobile phones and even retail locations. The process of in game advertising is a sophisticated one that offers advertisers a clear segment to advertise to and a water tight mechanism of measurement and return (two elusive items in the fast changing world of advertising). The session will look at In Game Advertising - Touching The Elusive Consumer -- with examples from across the globe.

#*Hypersexual avatars: who wants them?
#@Annika Waern,Anna Larsson,Carina Nerén
#year2005
#confAdvances in Computer Entertainment Technology
#citation1
#index5279
#arnetid5281
#!Women are less dedicated to computer gaming than men. Previous studies show that one reason might be that current games exhibit hypersexualised female avatars: avatars that have exaggerated sexual signals to which female players object. We report on a study in which this hypothesis was tested. The study was performed with men and women aged 17--22 from the Stockholm area. In our study, both women and men showed similar preferences in avatar selections. However, we also found that the women seemed to be more aware of personality stereotypes, in that they were more consistent in attributing a hypersexual avatar to a 'bimbo' personality.

#*Projecting tension in virtual environments through lighting.
#@Magy Seif El-Nasr
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5280
#arnetid5282
#%1119163
#%789343
#%88166
#!Interactive synthetic environments are currently used in a wide variety of applications, including video games, exposure therapy, education, and training. Their success in such domains relies on their immersive and engagement qualities. Filmmakers and theatre directors use many techniques to project tension in the hope of affecting audiences' affective states. These techniques include narrative, sound effects, camera movements, and lighting. This paper focuses on temporal variation of lighting color and its use in evoking tension within interactive virtual worlds. Many game titles adopt some cinematic lighting effects to evoke certain moods, particularly saturated red colored lighting, flickering lights, and very dark lighting. Such effects may result in user frustration due to the lack of balance between the desire to project tension and the desire to use lighting for other goals, such as visibility and depth projection. In addition, such lighting effects used tend to be very obvious and obtrusive. In this paper, the author will identify several lighting color patterns, both obtrusive and subtle, based on a qualitative study of several movies and lighting design theories. In addition, the author presents a system that dynamically modulates the lighting within an interactive environment to project the desired tension while balancing other lighting goals, such as establishing visibility, projecting depth, and providing motivation for lighting direction. This work extends the author's previous work on the Expressive Lighting Engine [1-3]. Results of incorporating this system within a game will be discussed.

#*Visual attention in 3D video games.
#@Magy Seif El-Nasr,Su Yan
#year2006
#confAdvances in Computer Entertainment Technology
#citation11
#index5281
#arnetid5283
#%562896
#%648183
#%593746
#%1119060
#!Understanding players' visual attention patterns within an interactive 3D game environment is an important research area that can improve game level design and graphics. Several graphics techniques use a perception based rendering method to enhance graphics quality while achieving the fast rendering speed required for fast-paced 3D video games. Game designers can also enhance game play by adjusting the level design, texture and color choices, and objects' locations, if such decisions are informed by a study of players' visual attention patterns in 3D game environments. This paper seeks to address this issue. We present results showing different visual attention patterns that players exhibit in two different game types: action-adventure games and first person shooter games. In addition, analyzing visual attention patterns within a complex 3D game environment presents a new challenge because the environment is very complex with many rapidly changing conditions; the methods used in previous research cannot be used in such environments. In this paper, we will discuss our exploration seeking a new approach to analyze visual attention patterns within interactive 3D environments.

#*A proposal of encoded computations for distributed massively multiplayer online services.
#@Keiichi Endo,Minoru Kawahara,Yutaka Takahashi
#year2006
#confAdvances in Computer Entertainment Technology
#citation3
#index5282
#arnetid5284
#%289508
#%512733
#%452786
#%519530
#%512787
#!This paper deals with Massively Multiplayer Online services, which are used to interact with other user in real time. Although it is possible to distribute the load on the server to users' computers, the distributed services are more vulnerable to cheating such as data theft. We propose a method for concealing data from a user who is authorized to manage the data. The method makes it possible to carry out various kinds of operations with data and program codes concealed. We show that concealed information can not be figured out with the knowledge of original programs or encoding keys which other users have.

#*A method for online adaptation of computer-game AI rulebase.
#@Ruck Thawonmas,Syota Osaka
#year2006
#confAdvances in Computer Entertainment Technology
#citation1
#index5283
#arnetid5285
#!It is not an easy task to balance the level of computer controlled characters that play computer games against human players. In this paper, we focus on a method called Dynamic Scripting (DS) that has been recently proposed for this task. This method online updates rule weights in rule-base that describe the behavior of the computer controlled character. However, the weight updating mechanism of DS is not effective if improper initialization of the rulebase is done. To cope with this problem, we propose a complementary technique to DS that replaces inefficient rules with newly generated rules. Evaluation of the proposed technique is conducted confirming its effectiveness.

#*A qualitative exploration of entertainment experiences.
#@Greg Hale
#year2005
#confAdvances in Computer Entertainment Technology
#citation7
#index5284
#arnetid5286
#!Research into film experiences can reveal much about experiences of computer based entertainment. This paper reports on the first stage of an investigation of people's film content experiences. Ten young adults matching the prime demographic for film-goers watched a short film. Afterwards they were interviewed about their experiences of the film. The most important themes were similarities of experience, differences in experience and plausibility. This material was then set in the context of mental models. The paper concludes by outlining the implications of this work for computer based entertainment.

#*3D edutainment environment: learning physics through VR/AR experiences.
#@Sylvia Irawati,Sengpyo Hong,Jinwook Kim,Heedong Ko
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5285
#arnetid5287
#%593884
#%648315
#%1119795
#%269701
#!Virtual Reality (VR) as well as Augmented Reality (AR) environment can be used as media for edutaining. They provide pleasant environments for educating students through experiences. In this paper, we present a 3D edutainment environment which provides an experience-based learning environment for understanding the Newtonian physics law. We design a physics-based simulation application that simulates a domino effect in the 3D environment. Using this application, the user can learn physics by interacting and experiencing different kinds of domino effect in the VR/AR environment. We propose a new way to help the user tuning the simulation conditions to produce a desired simulation effect by illustrating an expected trajectory of the object of interest. Therefore, the user can easily distinguish the simulation results from different configurations by comparing the trajectories of the selected object.

#*Forces, clashes and remnants: a model for event-driven iterative multidisciplinary game design.
#@Sus Lundgren,Staffan Björk
#year2005
#confAdvances in Computer Entertainment Technology
#citation4
#index5286
#arnetid5288
#%89338
#%235946
#!In this paper we present a model that describes how design disciplines interact with each other in mulltidisciplinary game design. We base this model on experience from the design of a computer-augmented card game. myTHeme. Our purpose is to show how hardware, software and game rules interact with and affect each other during the design process of games that are computer augmented. The model revolves around a flexible core of design requirements, suitable for multidisciplinary design projects. This model is an adaptation of the classic iterative design model, helping to explain clashes between design areas and aid focus shifting from one design discipline to another.

#*Automatic kinetic typography composer.
#@Mitsuru Minakuchi,Katsumi Tanaka
#year2005
#confAdvances in Computer Entertainment Technology
#citation2
#index5287
#arnetid5289
#%87706
#%634241
#%634238
#%640848
#%88295
#%89497
#%641483
#%90701
#!Animated text, commonly called kinetic typography, is any attractive visual expression used in films, TV programs, video games, etc. Previous studies have developed tools that support the authoring and rendering of kinetic typography. However, authoring kinetic typography is not easy because its methodology is still at an early stage. Hence, we systematize expression elements in kinetic typography and propose an automatic composer that converts raw text into kinetic typography data.

#*Transforming your shadow into colorful visual media: multi-projection of complementary colors.
#@Yugo Minomo,Yasuaki Kakehi,Makoto Iida
#year2005
#confAdvances in Computer Entertainment Technology
#citation7
#index5288
#arnetid5290
#%1500786
#%648280
#%437945
#%437947
#%647612
#%640559
#!This paper proposes a real-time system that transforms your shadows on a floor into colorful visual media. This system is based on the effect of complementary color and multiprojection techniques. By exactly calibrating the system geometrically and photometrically, our system makes it possible to display various images such as texture animation, colorful picture, text and live videos in your shadows without any digitized artifact or latency. Since it can display any images you like, it is applicable for various purposes such as media art, entertainment, and advertisement.

#*Rokkatan: scaling an RTS game design to the massively multiplayer realm.
#@Jens Müller,Jan Hendrik Metzen,Alexander Ploss,Maraike Schellmann,Sergei Gorlatch
#year2005
#confAdvances in Computer Entertainment Technology
#citation32
#index5289
#arnetid5291
#%526392
#!While massively multiplayer online role-playing games involve large numbers of simultaneous players, two other popular game classes - first person action and real-time strategy games - are still rarely discussed for massively multiplayer gaming. This paper presents our work on Rokkatan, an online game which implements the common concept of real-time strategy in a scalable multiplayer design. In order to allow hundreds of users to participate in a single game session, Rokkatan uses our proxy-server network architecture which provides the required scalability and responsiveness required for a fast-paced gaming style. An analytical scalability model integrated into Rokkatan allows to forecast the maximum number of simultaneous players. Our experiments demonstrate good prediction quality of the model and high scalability of Rokkatan, which allows several hundreds of users to participate in a single game session.

#*Clouds and stars: efficient real-time procedural sky rendering using 3D hardware.
#@Timothy Roden,Ian Parberry
#year2005
#confAdvances in Computer Entertainment Technology
#citation6
#index5290
#arnetid5292
#%786552
#!Real-time virtual reality applications, including games, increasingly use outdoor environments. A common task in an earth-type environment is to render a sky that is realistic both in terms of imagery and physics. Programmable graphics hardware offers the opportunity to procedurally generate and render a highly realistic sky at a minimal cost. We propose an integrated set of efficient algorithms that run in graphics hardware for interactive sky rendering that is fully parameterized for real-time control. Features of our method include multi-layered dynamic clouds and stars that individually flicker at varying intensity and rate.

#*Playmakers in multiplayer game communities: their importance and motivations for participation.
#@Antti Salovaara,Mikael Johnson,Kalle Toiskallio,Sauli Tiitta,Marko Turpeinen
#year2005
#confAdvances in Computer Entertainment Technology
#citation4
#index5291
#arnetid5293
#!In many game-like open-ended multiplayer communities, the success of the game, and well-being of the community, depends on the efforts of certain individuals who arrange resources for gameplay to other players. These include e.g. game masters, server hosts, and fan site creators. We identify the importance of these voluntary "playmakers" by describing their activities in four communities: (1) Habbo Hotel moderators, creative room designers and fan site builders, (2) Live-action role-playing game masters and non-player characters, (3) Geocaching cache creators, and (4) Neverwinter Nights dungeon masters, player guides, developers, and server hosts. Based on an analysis of this empirical data we describe motivations that the playmakers have for participation in game community activities. Such descriptions will help to improve design for games where playmaker involvement is of critical importance to the game's success.

#*Virtual reality school for children with learning difficulties.
#@Lucí Vera,Gerardo Herrera,Elias Vived
#year2005
#confAdvances in Computer Entertainment Technology
#citation10
#index5292
#arnetid5294
#!This paper describes the process starting from the identification of educational needs of children with learning difficulties to the design of a fully interactive virtual school, where it is possible to learn about the physical and social world. The fundamentals of this design are the exclusive advantages that Real Time Graphics offer for developing tools in which children can learn while playing. This development has been done in the framework of a strongly-funded project by the Spanish Government. This ongoing project is in its final stage of development and will produce tools which are valid both for special and mainstream education, ready to be used and tested over final users.

#*Interactive MR game based on intelligent agent.
#@Jaemin Soh,Gowun Jeon,Kyusung Cho,Hyun Seung Yang
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5293
#arnetid5295
#!Up to date handheld devices have been developed enough in order to be used as platforms for Mixed Reality (MR). In the previous work, we have discussed incorporating a dynamic environment to offer better experience, which is verified as a new element for the field of digital elements. Providing users with more immersive and realistic experience, we have designed an agent system which regards agents as characters in a game to make them collaborate with each other. The characters are expected to behave more intelligently and naturally thanks to this advance.

#*An alpha-activity-based binaural beat sound entrainment system using arousal state model.
#@Sittapong Settapat,Michiko Ohkura
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5294
#arnetid5296
#!We developed a new real-time control system for customizing an auditory stimulus (the binaural beat sound) by judging a user's alpha waves to entrain his/her feeling in the most relaxed way. We use an autoregressive forecasting model to estimate the frequency response series of the alpha frequency bands and a fuzzy logic controller to regulate the binaural beat control signal on a forecasting error signal. The arousal state determination model plays a role in regulating an appropriate binaural beat sound correlating with a change in alpha activity. According to studies of the relationship between arousal state and alpha activity, the alpha activity level may state-dependent, which can be modeled following the "inverted-U" model. The inverted-U concept is employed to determine the user arousal state, and tries to understand the user arousal state through the change in alpha activity. From the results of experiments, it is confirmed that the inverted-U model for arousal state determination is an effective model to regulate a stimulus properly with the determined arousal state.

#*Phrase animation generation reflecting impression of words.
#@Ryou Morita,Takehisa Onisawa
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5295
#arnetid5297
#%88295
#!This paper proposes a phrase animation generation reflecting impressions of words. The process of generating phrase animations consists of two procedures; impression estimation and animation output. In the former procedure, impressions of an inputted phrase are estimated from impressions of an inputted adjective/adjectival verb. That is derived from the number of co-occurrence on web search between the adjective/adjectival verb and prepared specific words. Experiments are performed in order to confirm validity of outputted phrase animations. As a result, it is found that the phrase animations have the possibility to reflect impressions of inputted adjective/adjectival verb.

#*Cyclone Uppercut, a boxing game for an immersive environment.
#@Ronald Sidharta,Carolina Cruz-Neira
#year2005
#confAdvances in Computer Entertainment Technology
#citation5
#index5296
#arnetid5298
#%593209
#!Cyclone Uppercut is a Virtual Reality (VR) boxing game designed to run in a six sided CAVE-like projection system such as the C6 at Iowa State University. In this game, the player assumes the role of a young boxer fighting in the final match to be the Japanese Rookie Boxer Champion. In the C6's immersive environment, the player uses his/her body to interface with the game. The game play requires the player to dodge enemy's attacks, and to execute various punches to win the game. In this paper we discuss the challenges of creating interfaces to simulate a sport like boxing for an immersive space. We also discuss the philosophy that influences the game play, and followed by the detail of implementation. We argue that the unique design of the game make it an experience that can only be experienced in a fully immersive environment like the C6.

#*Dialogue management for social game characters using statecharts.
#@Jenny Brusk
#year2008
#confAdvances in Computer Entertainment Technology
#citation3
#index5297
#arnetid5299
#%57347
#%815519
#%874774
#%738664
#%1056831
#!Character development in games tend to refer to those features that augment the character's skills and experiences in order for it to become better equipped to meet the challenges in the game. We mean that the next step should be to provide the characters with social skills, including the ability to interact using natural language. To date an extensive amount of significant work has been done in the field of believable characters, but not specifically aimed at being placed in game worlds. This means that the methods used not necessarily meet the necessary requirements. In this paper we present a method we believe is capable of handling both game flow as well as dialogue flow, namely statecharts. By example we also show how to specify statecharts for describing socially intelligent dialogue behavior.

#*BodyMusic: a novel framework design for body-driven music composition.
#@Horace Ho-Shing Ip,Belton Kwong,Ken C. K. Law
#year2005
#confAdvances in Computer Entertainment Technology
#citation2
#index5298
#arnetid5300
#%502374
#%514679
#!This paper presents the design and development of a novel framework for interactive body-driven music composition. This framework consists of three layers and we call the resulting system, BodyMusic. BodyMusic acts as a cyber instrument that enables both musicians and music laypersons to interactively and intuitively control and compose the tonality and the melody of the music through body motions without real musical instruments. This work is an innovative approach that enables users to dynamically generate music through their body motions and gestures without chronic learning and training. BodyMusic can be used in entertainment and can also be used for music education in primary schools. Music theories are embedded in the design so that melody flow and musical expressions including the pitch, rhythm and volume of the melody can be varied in real time.

#*IncreTable, a mixed reality tabletop game experience.
#@Jakob Leitner,Michael Haller,Kyungdahm Yun,Woontack Woo,Maki Sugimoto,Masahiko Inami
#year2008
#confAdvances in Computer Entertainment Technology
#citation9
#index5299
#arnetid5301
#%634144
#%89338
#%5354
#%789518
#%235946
#%624916
#%634354
#%459856
#%699879
#%273988
#!IncreTable is a mixed reality tabletop game inspired by The Incredible Machine. Users can combine real and virtual game pieces in order to solve puzzles in the game. Game actions include placing virtual domino blocks with digital pens, controlling a virtual car by modifying the virtual terrain through a depth camera interface or controlling real robots to topple over real and virtual dominoes.

#*Real life is an odyssey: proposal for a videogame linked to reality.
#@Yukari Hori,Masaki Iwabuchi,Akira Baba
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5300
#arnetid5302
#!The strong attractiveness held by games is a very useful tool for content development. To demonstrate this, we propose a game linked to reality. In addition, it is sometimes feared that games often facilitate estrangement from the real world, but this system promotes associations with reality instead. The game was publicly exhibited and obtained a favorable reception.

#*RoboGamer: development of robotic tv game player using haptic interface and GPU image recognition.
#@Akihiko Shirai,Lionel Dominjon,Masafumi Takahashi
#year2005
#confAdvances in Computer Entertainment Technology
#citation4
#index5301
#arnetid5303
#!"RoboGamer" is a robotic system which is able to play a video game togather with a human player. In previous computer game systems, the computers are always designed as enemies to the human. However, in this project, we realized a physically connected friendly computer player by a simple robotic system that is composed of a video camera, wire based force feedback display SPIDAR and a program that made with GPU fast image recognition without any modification for original video game system. RoboGamer has three functions that are autonomous play, augmented effects like force feedback and/or rich graphics for original old video game and collaboration play with A. I. and human player via force feedback on the joystick.

#*Magic moments in situated mediascapes.
#@Josephine Reid,Richard Hull,Kirsten Cater,Constance Fleuriot
#year2005
#confAdvances in Computer Entertainment Technology
#citation18
#index5302
#arnetid5304
#%87508
#%89982
#!In this paper, we describe the situation and factors that lead to "Magic Moments" in mediascape experiences and discuss the implications for how to design these magic moments without them appearing contrived. We introduce a framework for Experience Design and describe a set of design heuristics which should extend the field of HCI to encompass aspects of user experience, mobility, the outside environment and facets of the new medium. The distinctive feature of mediascapes is their link to the physical environment. The findings are primarily based on analysis of public reaction to Riot! 1831, a mediascape in the form of an interactive drama which is based on the actual riots that took place in a public square in Bristol, England in 1831.

#*Haptic wind.
#@Andrei Sherstyuk
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5303
#arnetid5305
#!A new wearable haptic system is proposed for interactive immersive Virtual Reality (VR) installations. The core of the system is a common cooling CPU fan attached to a user hand, tracked in 3D, and operated from a host computer. The proposed system is suitable for entertainment applications where immersed VR users interact with fuzzy, cloud-like or jelly-like objects, producing soft and gentle tactile sensations upon contact with user hands.

#*Training social learning skills by collaborative mobile gaming in museums.
#@Jolien Schroyen,Kris Gabriëls,Kris Luyten,Daniël Teunkens,Karel Robert,Karin Coninx,Eddy Flerackers,Elke Manshoven
#year2008
#confAdvances in Computer Entertainment Technology
#citation6
#index5304
#arnetid5306
#%1140953
#%459424
#%686645
#%506882
#%495171
#%495442
#%789353
#!The use of handheld computers as a tool to enrich the museum experience has found its way into many museums, opening up new possibilities to increase the attractiveness of museum visits, especially for youngsters. We developed a mobile guide framework that supports the creation of mobile guides and adheres to social-constructivist principles of learning. The mobile museum game we created with this framework aims at developing the social, cognitive and technical skills of the users. Large scale evaluations show the potential power of our approach to stimulate interaction between youngsters and to create a playful learning experience.

#*Tag around: a 3D gesture game for image annotation.
#@Duarte Gonçalves,Rui M. Jesus,Filipe Grangeiro,Teresa Romão,Nuno Correia
#year2008
#confAdvances in Computer Entertainment Technology
#citation3
#index5305
#arnetid5307
#%205390
#%91753
#%833272
#%87382
#!Manual annotation is difficult to perform in large image databases and the automatic methods deliver results that are far from what is desired by the users. New and fun ways to provide image annotation are required. This paper describes Tag Around, a computer game for image tagging. The application is based on a 3D game interface, a game engine that uses a system for automatic image classification and gestural input to play the game. We present the game, how it is used to improve image annotation, the design principles of the interface and the usability tests that were carried out in order to validate the application.

#*RoboGamer: a robotic tv game player.
#@Akihiko Shirai,Lionel Dominjon,Masafumi Takahashi
#year2005
#confAdvances in Computer Entertainment Technology
#citation1
#index5306
#arnetid5308
#!"RoboGamer" is a robotic system which is able to play a video game togather with a human player. In previous computer game systems, the computers are always designed as enemies to the human. However, in this project, we realized a physically connected friendly computer player by a simple robotic system that is composed of a video camera, wire based force feedback display SPIDAR and a program that made with GPU fast image recognition without any modification for original video game system. RoboGamer has three functions that are autonomous play, augmented effects like force feedback and/or rich graphics for original old video game and collaboration play with A. I. and human player via force feedback on the joystick.

#*Achieving fairness in multiplayer network games through automated latency balancing.
#@Sebastian Zander,Ian Leeder,Grenville J. Armitage
#year2005
#confAdvances in Computer Entertainment Technology
#citation22
#index5307
#arnetid5309
#%512774
#%512761
#%514128
#%512810
#%512731
#%512827
#%512817
#%512779
#%4994
#%512727
#!Over the past few years, the prominence of multiplayer network gaming has increased dramatically in the Internet. The effect of network delay (lag) on multiplayer network gaming has been studied before. Players with higher delays (whether due to slower connections, congestion or a larger distance to the server) are at a clear disadvantage relative to players with low delay. In this paper we evaluate whether eliminating the delay differences will provide a fairer solution whilst maintaining good gameplay. We have designed and implemented an application that can be used with existing network games to equalize the delay differences. To evaluate the effectiveness of the approach we use a novel method involving computer players (bots) instead of human players. This method provides some advantages over difficult and time-consuming human usability trials. We show that bots experience similar unfairness problems as humans and demonstrate that the application we have developed significantly improves fairness.

#*Real-time motion control by data gloves.
#@Katsuya Ishiguro,Masaki Oshita
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5308
#arnetid5310
#!Nowadays, there is a demand that users want to move a character freely for computer games and communications using avatar in a virtual world such as Second Life. However, the flexibility of the current motion control interfaces are very limited, because the character is simply controlled by playing the motion data that are created in advance in response to on the user's input. In this research, we proposed a motion control method that uses data gloves as an input device to make virtual character perform various motions.

#*Mixed reality robotic user interface: virtual kinematics to enhance robot motion.
#@Noriyoshi Shimizu,Maki Sugimoto,Dairoku Sekiguchi,Shoichi Hasegawa,Masahiko Inami
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5309
#arnetid5311
#%771589
#%789470
#%5000
#%438071
#!A Robotic User Interface (RUI) is part of a concept in which a robot is used as an interface for human behavior. By combining the RUI with Mixed Reality (MR) technology, we propose a MR RUI system that enables the presentation of enhanced visual information of a robot existing in the real world. In this paper, we propose the virtual kinematics to enhance robot motion. A MR RUI system with virtual kinematics can present a selection of visual information by controlling the robot through physical simulation and by changing the parameter dynamically.

#*Teddy-bear based robotic user interface.
#@Noriyoshi Shimizu,Naoya Koizumi,Maki Sugimoto,Hideaki Nii,Dairoku Sekiguchi,Masahiko Inami
#year2005
#confAdvances in Computer Entertainment Technology
#citation9
#index5310
#arnetid5312
#%586957
#%88799
#%5103
#%5000
#%593017
#%593669
#!A Robotic User Interface (RUI) is part of a concept in which a robot is used as an interface for human behavior. Our RUI, which we have been developing for communications, is a system for interpersonal exchanges that uses robots as agents for physical communication. In this paper, we propose a new type of RUI for interactive entertainment. This RUI enables people to directly interact with the information world.

#*Combining body sensors and visual sensors for motion training.
#@Doo Young Kwon,Markus H. Gross
#year2005
#confAdvances in Computer Entertainment Technology
#citation23
#index5311
#arnetid5313
#%4165
#%647429
#%453345
#%514644
#!We present a new framework to build motion training systems using machine learning techniques. The goal of our approach is the design of a training method based on the combination of body and visual sensors. We introduce the concept of a Motion Chunk to analyze human motion and construct a motion data model in real-time. The system provides motion detection and evaluation and visual feedback generation. We discuss the results of user tests regarding the system efficiency in martial art training. With our system, trainers can generate motion training videos and practice complex motions precisely evaluated by a computer.

#*Identity SA 1.6: an artistic software that produces a deformed audiovisual reflection based on a visually interactive swarm.
#@Tatsuo Unemi,Yoshiaki Matsui,Daniel Bisig
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5312
#arnetid5314
#%593841
#!Identity SA is an interactive and generative installation that combines a swarm-based simulation with real time camera based interaction. The agents' distributions are transformed into painterly images by employing a variety of different visualization techniques and styles. Camera based interaction is based on a simple motion detection algorithm that affects the agents' movements as well as their coloring. Identity SA acts as a visual and acoustic mirror, which distorts the continuity of the visitor's physical existence into ephemeral patterns and flowing motions. The new version 1.6 adds the capability to select musical tracks depending on the agents' movements. This system has been employed both as an experimental installation in an exhibition and as interactive video projection for a contemporary dance performance.

#*Gesture recognition in flow based on PCA analysis using multiagent system.
#@Ronan Billon,Alexis Nédélec,Jacques Tisseau
#year2008
#confAdvances in Computer Entertainment Technology
#citation5
#index5313
#arnetid5315
#%205719
#%1032199
#%56045
#%757697
#%2067
#%1330618
#%235821
#%293879
#%292892
#%349063
#%1118916
#%984931
#!Our context is Virtual Theater. Our aim is to put on a short play featuring a real actor and a virtual actor, who will communicate through movements and choreography with mutual synchronization. We currently work on a system that can recognize key-gestures made by a real actor. In this paper, we cover a method for real-time recognition. Our idea is that the data for movements from any motion-capture system can be reduced to a single artificial signature. We use properties from Principal Component Analysis (PCA) to generate it. This artificial gesture representation is used in real-time by our multiagent systems to simultaneously perform segmentation (gesture's beginning and end) and recognition. We conducted various experiments which demonstrate our system and define its limitations.

#*Artistic brushstroke representation and animation with disk b-spline curve.
#@Seah Hock Soon,Zhongke Wu,Feng Tian,Xian Xiao,Boya Xie
#year2005
#confAdvances in Computer Entertainment Technology
#citation7
#index5314
#arnetid5316
#%593469
#%593970
#%834339
#!A novel modeling and representation approach for brushstroke and animation is proposed in this paper based on disk B-spline curve (DBSC). This method represents not only the 2D region of the stroke but also its centerline so that various attributes like scalar and vector field can be applied to the stroke. Given two or more animation drawings represented by DBSC, the intermediate frames can be automatically generated to form a smoother sequence, either linearly or non-linearly. Moreover, compared to other models like polygon and triangle mesh, DBSC allows more flexible manipulation of brushstroke. With smaller dataset, DBSC has advantages to store and transmit the model across the network thus may be suitable to online games and animation.

#*Avatar mediated cinema.
#@Peggy Weil,Nonny de la Peña
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5315
#arnetid5317
#!In this paper, we describe an example of integrating video within a virtual environment, demonstrating a new form of visual storytelling we term spatial cinema. A subset of machinima documentary video footage is discussed for the potential for "cinema veritar." We focus on issues affecting avatar viewing experience: scale, placement and progression through the space; and avatar emotional experience including attention and viewer identity with the avatar. We also discuss cinematic techniques designed to take control of the avatar for special, scripted avatar events. We argue that avatar viewing and, even more importantly, avatar experience will prove central to evolving techniques of storytelling and narrative.

#*"Dip in the Wave": interactive sound installation controlled by the rope.
#@Seiichiro Matsumura
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5316
#arnetid5318
#!"Dip in the Wave" is the interactive sound installation that people can directly compose continuous sound design in space by their physical approach. The way of the interaction is just changing the shape of the rope laid on the floor across the area. That shape is captured by the video camera and is converted to 1 cycle of sound wave. Then its sound comes out from audio speakers. The relation between what people do and the result is obvious both in visual and in hearing.

#*KAMI CHAT.
#@Atsumi Osada,Sae Takeshita,Machi Miyahara,Masa Inakage
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5317
#arnetid5319
#!KAMI CHAT is a novel communication tool with drawing on paper by ultraviolet rays.

#*Digiwall: an interactive climbing wall.
#@Mats Liljedahl,Stefan Lindberg,Jan Berg
#year2005
#confAdvances in Computer Entertainment Technology
#citation-1
#index5318
#arnetid5320
#%5059
#!Digiwall is a climbing wall enhanced with hardware and software. It combines the computer game with sport climbing, and extends both concepts with new features. Digiwall frees the user from focusing on a computer screen. Instead sound and music are used to convey the gaming experience. The Digiwall concept is designed to support a large number of games, competitions, challenges and even aesthetic experiences. It is an example of how technology can promote physical activity and engage people's senses and capabilities in a way that traditional computer gaming and sport climbing do not.

#*E-Tree: affective interactive art.
#@Stephen W. Gilroy,Marc Cavazza,Rémi Chaignon
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5319
#arnetid5321
#%647414
#!As part of the CALLAS project [1], our aim is to explore multimodal interaction in an Arts and Entertainment context. This creative showcase is an Augmented Reality Art installation, which reacts to user behaviour using multimodal analysis of affective signals. The installation features a virtual tree, whose growth is influenced by the perceived emotional response from the spectators. The system implements a 'magic mirror' paradigm (using a large-screen display or projection system) and produces interactive graphics based on the ARToolkit [2, 3] with extended representations for scene graphs [4]. The system relies on a PAD dimensional model [5] to support the fusion of affective modalities, each input modality being represented as a PAD vector. A further advantage of the PAD model is that it supports the representation of affective responses that relate to aesthetic impressions. The influence of affective input on the visual component is achieved by mapping affective data to an L-System governing virtual tree behaviour. We have performed an early evaluation of the system, both from the technical perspective and in terms of user experience.

#*Possession techniques for interaction in real-time strategy augmented reality games.
#@Keith Phillips,Wayne Piekarski
#year2005
#confAdvances in Computer Entertainment Technology
#citation3
#index5320
#arnetid5322
#%459673
#%453267
#%453131
#%453330
#%1047179
#%90394
#%633981
#%1117000
#%786508
#%586855
#%770538
#%593714
#%438103
#%438095
#%438107
#%586980
#%586997
#%702811
#!There have been a number of interactive games created for Augmented Reality (AR) environments. In this paper, interaction techniques to support Real-Time Strategy (RTS) games in AR environments are investigated. One limiting factor is that the user's position within the virtual environment must correspond to their position in the physical world. If it is obvious to the user there is no correspondence between the two, the illusion of a consistent environment will be broken. The primary problem with adapting an RTS game for an AR environment is that the player will need to manage a large force of life-sized military units, which cannot be done effectively if the user is confined to what they can see and how fast they can move in the physical world. In this paper, we introduce the use of AR-VR transitions and a new technique that is called possession, which attempts to address these problems. Possession essentially gives the player the ability to move inside the head of any of their units. This allows the user to see everything that is visible to that unit, and manage their forces with the usual interface even though they are detached from their own body. The possession technique allows control of units over large ranges, makes micromanagement of distant groups possible, and implements realistic views of the world that match what a user would expect in the physical world. Our user interface supports a more realistic interface than is possible in traditional desktop games. Our new techniques were implemented in an operational AR-RTS game that we have named ARBattleCommander.

#*Integrating plan-based behavior generation with game environments.
#@R. Michael Young,Mark O. Riedl
#year2005
#confAdvances in Computer Entertainment Technology
#citation5
#index5321
#arnetid5323
#!In this paper, we describe an architecture called Mimesis, designed to integrate a range of intelligent components with conventional game engines. The architecture is designed to bridge the gap between game engine design and development and much of the work in artificial intelligence that focuses on the automatic creation of novel and effective action sequences.

#*"wavers": a perceptible vibration system.
#@Takashi Suzuki,Kunihiro Nishimura,Michitaka Hirose
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5322
#arnetid5324
#!"wavers" is a novel perceptible vibration system which enables a user to feel the difference of various textures. Tracing and scratching the textures make sounds. This system translates these sounds into perceptible vibration. The "wavers" consists mainly of vibrators and a vibration board. When the user is on the vibration board and trace or scratch it with a gripping environment, the user can feel texture directly with their body. The "wavers" aims to shed light on how to bind information to vibration by looking into the relationship between sound and vibration, the usage of vibration, and the way vibration is perceived.

#*Talktic: a development environment for pervasive computing applications.
#@Yoshimasa Niwa,Satoru Tokuhisa,Masa Inakage
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5323
#arnetid5325
#!Talktic is a platform for the easy production of entertainment content developed under the keyword of "pervasive computing." The Talktic platform consists of runtime environment, library, and development environment to support applications using an MCU board, personal computer, and network. It uses a virtual machine in the runtime environment and provides a programming environment and library based on a lightweight scripting language for easy development of entertainment content. The linkage with web services and the high degree of compatibility for the virtual machine and scripts are expected to generate new forms of entertainment content.

#*Improving patient motivation in game development for motor deficit rehabilitation.
#@Eletha Flores,Gabriel Tobon,Ettore Cavallaro,Francesca I. Cavallaro,Joel C. Perry,Thierry Keller
#year2008
#confAdvances in Computer Entertainment Technology
#citation14
#index5324
#arnetid5326
#!It has been stated repeatedly that active participation in rehabilitation programs increases the benefit and effectiveness of therapy. In developing robotic devices for stroke rehabilitation, the existing use of boring task interfaces produces a significant reduction in elderly patient motivation. To combine robot-aided therapy with appealing games, then, is not only a matter of creating entertainment, but a real necessity for motor recovery. Besides emphasizing a lack of attention to elderly patients in conceiving games for post-stroke rehabilitation, this paper launches a challenge to two fields with tremendous collaborative potential. As a precursor to this collaboration, the following research consolidates the gaming scenario criteria for both rehabilitation and elderly entertainment. Conclusions are then formed from the adaptability of existing games to identify the direction of future game development.

#*Reflections on the methodology of pervasive gaming.
#@Bo Kampmann Walther
#year2005
#confAdvances in Computer Entertainment Technology
#citation12
#index5325
#arnetid5327
#%383548
#%88799
#!The paper introduces four axes of pervasive gaming (PG): mobility, distribution, persistence, and transmediality. Further, it describes and analyses three key units of PG (rules, entities, and mechanics) as well as discusses the role of space in PG by differentiating between tangible space, information embedded space, and accessibility space.

#*May Day masks augmented on mobile phones.
#@Charles Woodward,Petri Honkamaa,Timo Kinnunen,Markus Tallgren,Teppo Veijonen
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5326
#arnetid5328
#!In this paper we describe a fun application of augmenting masks on people's faces using mobile camera phones. The application was published on May Day 2008 in Finland, gaining thousands of visitors and downloads within a couple of days. We provide a description of the user interface and implementation issues, as well as analysis of user statistics and their comments.

#*Semi-autonomous avatars in world of minds: a case study of AI-based game design.
#@Mirjam Palosaari Eladhari,Michael Mateas
#year2008
#confAdvances in Computer Entertainment Technology
#citation3
#index5327
#arnetid5329
#%520760
#%912586
#!In this paper we describe the Mind Module (MM), a technical framework for modeling personality and emotion for both player and non-player characters, and describe the World of Minds (WoM), an MMORPG that employs an AI-based game mechanic designed around the MM. Where most research on character AI has focused on autonomous characters, the focus of this work is on a semi-autonomous agent architecture built to be used in a multiplayer environment as part of the player's avatar. The MM models personality using the Five Factor Model from personality psychology, and maintains emotional state as a function of the personality and the avatar's interactions with people and objects in the world. WoM is a prototype MMORPG where the personalities of the player characters are the base for the game mechanics. In this paper, we provide a case-study of AI-based game design, describing the Mind Module, the game mechanic designed around the Mind Module, and lessons learned for both the AI and the game design from a playtest of a paper prototype of the game.

#*Energy browser: to make exercise enjoyable and interesting.
#@Satoshi Nakamura,Mitsuru Minakuchi,Katsumi Tanaka
#year2005
#confAdvances in Computer Entertainment Technology
#citation4
#index5328
#arnetid5330
#%464236
#%122048
#!Previously, we developed a Web browser called the EnergyBrowser system that gives people an incentive to exercise. In the EnergyBrowser system, the user wears a motion sensor and walks/runs on a treadmill. Web pages are displayed incrementally in proportion to the rate of walking/running. The user can exercise while browsing the Web. In this paper, we will evaluate the effectiveness of the EnergyBrowser system, which we exhibited at an open house and evaluated using a questionnaire. We will discuss the effectiveness of our system.

#*REMUPP: an interface for evaluation of relations between musical parameters and perceived properties.
#@Johnny Wingstedt,Jan Berg,Mats Liljedahl,Stefan Lindberg
#year2005
#confAdvances in Computer Entertainment Technology
#citation-1
#index5329
#arnetid5331
#%5360
#%514673
#!New media offers new roles, functions and challenges to music, calling for new methods and tools for music research. To meet these increasingly important challenges. REMUPP, a new software tool for the investigation of relations between music and perceived properties or characteristies, was designed. The ideas behind REMUPP and the technology used to realize it is deseribed. In order to test the sensitivity and validity of REMUPP. a simple experiment aimed to examine some properties of music was carried out. 38 subjects were listening to music and instructed to indicate their priority for different aspects of the music (musical parameters) while they actively controlled these aspects. The results show that REMUPP is able to bring out significant differences between the musical parameters, and that these differences correspond well with findings by others.

#*Mobile display-based manipulation: an intuitive and interactive technique for manipulating simple robots.
#@Kazuhiro Hosoi,Vinh Ninh Dao,Akihiro Mori,Masanori Sugimoto
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5330
#arnetid5332
#%5022
#!In this paper, we propose the Mobile Display-based Manipulation (MDM) technique for manipulating simple robots such as automated cleaning robots. By capturing images of robots with a camera-attached mobile display and moving it in a three-dimensional space, a user can easily and intuitively manipulate the robots. To verify the validity and effects of the MDM technique, we developed two prototype systems using a handheld display and a projection display. Issues to be investigated and lessons learned through the design and evaluations of the systems are discussed.

#*Networked penalty shootout with haptic media and video.
#@Takeshi Fujimoto,Yutaka Ishibashi,Shinji Sugawara
#year2008
#confAdvances in Computer Entertainment Technology
#citation2
#index5331
#arnetid5333
#%401124
#%1334682
#%5137
#%1330710
#%512752
#%783848
#!This paper deals with a networked penalty shootout in which two users play a penalty shootout through a network by using haptic interface devices while watching video. We realize the networked penalty shootout by using two haptic media and video transfer systems. In each system, a user can control a haptic interface device via a network by using another haptic interface device while watching video. One of the two systems is used by a user who shoots a soccer ball (i.e., a shooter), and the other is employed by another user who tries to block shots (i.e., a keeper). We investigate the influences of network latency on the networked penalty shootout by subjective assessment.

#*Modulobe: a creation and sharing platform for articulated models with complex motion.
#@Kouichirou Eto,Masahiro Hamasaki,Kuniaki Watanabe,Yoshinori Kawasaki,Takuichi Nishimura
#year2008
#confAdvances in Computer Entertainment Technology
#citation2
#index5332
#arnetid5334
#!In this paper, we propose Modulobe: a creation and sharing platform for articulated 3D models with complex motion. Modulobe has two components: a 3D modeling application and a model sharing web site. The former is intended to achieve complex motion simulation of a 3D model and provide a user-friendly interface. Motion pattern of angle for each hinge can be set easily by specifying pattern on a graph. The latter has a feature to show uploaded models on bases of tags, comments and popularity which is designed to stimulate users to create new models. This paper presents design concept of Modulobe and show the user interface and model sharing site. We are delivering Modulobe application and opened the model sharing site for about two years. Modulobe application had been downloaded about 170,000 times and the web site had been accessed 686 million times from various sites whose unique IP is about 100,000 variations. More than 3,000 models were uploaded.

#*A pressure sensing floor for interactive media applications.
#@Prashant Srinivasan,David Birchfield,Gang Qian,Assegid Kidané
#year2005
#confAdvances in Computer Entertainment Technology
#citation20
#index5333
#arnetid5335
#%89793
#%892496
#%90008
#!This paper explores the design of a reconfigurable large-area high-resolution pressure sensing floor to help study human dance movement. By measuring the pressure of a user interacting with the system, our device is able to provide real-time knowledge about both the location of the performer on the floor as well as the amount and distribution of force being exerted on the floor. This system has been designed to closely integrate and synchronize with external systems including marker-based motion capture systems, audio-sensing equipment and video-sensing technology, thus allowing for robust multimodal sensing of a subject in the integrated environment. Furthermore, the mats comprising the floor can be readily re-arranged in order to allow for a large number of configurations. Some other possible applications of the pressure sensing floor include virtual reality based entertainment systems or video game control interfaces as well as rehabilitation projects for disabled people with foot or motor-control disorders.

#*ARForce: a marker-based augmented reality system for force distribution input.
#@Kensei Jo,Yasuaki Kakehi,Kouta Minamizawa,Hideaki Nii,Naoki Kawakami,Susumu Tachi
#year2008
#confAdvances in Computer Entertainment Technology
#citation5
#index5334
#arnetid5336
#%89100
#%594358
#%634333
#%634463
#%236386
#%786748
#%87424
#%236033
#!In recent years, the use of augmented reality (AR) systems has become quite common. Many marker-based AR systems can input the positions of physical markers and realize a combination of real-world and computer-generated graphics. However, few systems can recognize other information such as fingertip motions. The objective of our study is to create AR environments in which users can manipulate virtual objects by using natural finger motions. Toward this end, we propose a novel marker-based AR system called "ARForce." ARForce enables users to measure the 3D position of markers as well as also the distribution of force vectors that are applied by a user. Using this system, users can manipulate virtual objects using various finger motions. Our proposed system comprises a camera and an input device. The input device is an elastic body and it comprises two types of markers. One is a square-shaped marker that enables a user to detect the position of the device. The other markers are small circular-shaped ones that are placed within the elastic body. The positions of the circular markers are moved when a user applies a force to the device. This enables force detection.

#*Towards manifold learning for gamebot behavior modeling.
#@Christian Thurau,Christian Bauckhage
#year2005
#confAdvances in Computer Entertainment Technology
#citation5
#index5335
#arnetid5337
#!Traditionally Computer Game Agent behaviors are generated by top-down approaches like finite state machines or scripts. So far, however, this had only mediocre success in creating life-like impressions. The bottom-up approach of imitation learning for agents has become very popular in recent robotics research and, in earlier work, we already discussed how imitation learning may apply to the programming of life-like computer game characters. However, so far we ignored problems concerning high dimensional state spaces for the most part, although behavior execution and learning takes place in such spaces.In this paper, we investigate the usage of non-linear dimensionality reduction for gamedata. We therefore focus on the aspect of topological gameworld representations and their dimensionality reduced counterparts. Dimensionality reduction is achieved by learning manifolds using Locally Linear Embedding. A mapping between data and embedding space is realized by Radial Basis Function interpolators. Experiments focus on movement path calculation and comparison in 3D and 2D embedding space world representations. The results indicate certain problems inherent to this approach but nevertheless justify further investigations.

#*Enhancement of aligning accuracy on zooming camera for augmented reality.
#@Widya Andyardja Weliamto,Hock Soon Seah,Feng Tian,Li Li
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5336
#arnetid5338
#%128864
#%1033457
#%786508
#%169368
#%1030956

#*Facial expressions as game input with different emotional feedback conditions.
#@Michael Lankes,Stefan Riegler,Astrid Weiss,Thomas Mirlacher,Michael Pirker,Manfred Tscheligi
#year2008
#confAdvances in Computer Entertainment Technology
#citation4
#index5337
#arnetid5339
#%5016
#%686128
#%121814
#%88595
#%89316
#!We propose a game design approach that utilizes facial expressions as an input method under different emotional feedback configurations. A study was conducted in a shopping centre to assess our game "EmoFlowers" focusing on user experience and user effectiveness. The study revealed that interaction with a game via facial expression is perceived naturally, is easy to learn, and provides a positive user experience.

#*Reduced dimensional HRTF processing for gaming environments.
#@Arun Ravindran
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5338
#arnetid5340
#%2358
#!Processing of acoustic signals with head-related transfer functions (HRTFs) is a commonly used technique for simulating 3D audio in interactive virtual environments and gaming applications. It is computationally very demanding to process the high dimensional HRTFs and yet capturing the variability across listeners and this could be a limiting factor for real time 3D audio applications. In this paper we show how the dimensionality of the HRTFs can be reduced to their minimum phase components, without losing the localization information contained in them, and their performance is evaluated under a localization classification paradigm using decision trees and compared with PCA.

#*A real-time collision detection algorithm for mobile billiards game.
#@Bailin Yang,Xi Cheng,Zhigeng Pan
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5339
#arnetid5341
#%586881
#!Collision detection is a key technique in game design. However, some algorithms employed in PC game are not suitable for mobile game because of the low performance and small screen size in mobile devices. Combining with the features of the mobile devices, this paper proposes a quick and feasible collision detection algorithm. This algorithm makes use of the multi-level collision detection and dynamic multi-resolution grid subdivision to reduce the computing time for collision detection, which improves the algorithm performance greatly. In the collision response phase, this paper adopts the time step binary search algorithm to ensure both the computing precision and system efficiency. The mobile billiards game designed for the Bird Company indicates that this algorithm has good performance and real-time interaction.

#*Contents oriented space.
#@Hidenori Watanave
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5340
#arnetid5342
#%594104
#!Some of 3D databases of the world-wide Internet material have been constructed on the 3D Internet, as application of the method of spacio-designing 'Contents Oriented Space'.

#*Evaluation of a pervasive game for domestic energy engagement among teenagers.
#@Anton Gustafsson,Magnus Bång
#year2008
#confAdvances in Computer Entertainment Technology
#citation-1
#index5341
#arnetid5343
#%87508
#%256642
#%985049
#!In this paper, we present Power Agent - a pervasive game designed to encourage teenagers and their families to reduce energy consumption in the home. The idea behind this mobile phone-based game was twofold; to transform the home environment and its devices into a learning arena for hands on experience with electricity usage and to promote engagement by means of a team competition scheme. We report on its evaluation with six teenagers and families that were playing the game for ten days in two cities in Sweden. Data collection consisted of home energy measurements before, during and after game play in addition to interviews with participants after the game session. The results suggest that the game concept was highly efficient in motivating and engaging the players and their families to change their daily energy consumption patterns during the game sessions. The study indicates that pervasive games for behavior change and learning may also be appropriate to approach related domains such as environmental conservation and lifestyle-induced health problems.

#*SEI.
#@Makoto Danjou,Hiroko Uchiyama
#year2008
#confAdvances in Computer Entertainment Technology
#citation-1
#index5342
#arnetid5344
#!This is an interactive installation with which one can gradually appreciate artwork by maintaining a calm and peaceful state, both physically and spiritually. Japan has long embraced the custom of cherishing a sense of tranquility. Potential subjects of stillness can be time, space or human motion. For example, in the art of tea ceremony, a Japanese tradition, quiet time and quiet space are treasured. In kendo, the marshal art of swordsmanship, they meditate in order to achieve a state of deep mental concentration. Installation works in the past often featured major changes due to dynamic human actions. With this installation, however, unlike other previous works, the participant can experience the work by cherishing stillness.

#*What you look like when learning hand alphabets.
#@Miki Namatame,Yasushi Harada,Fusako Kusunoki,Takao Terano,Shigenori Inagaki
#year2005
#confAdvances in Computer Entertainment Technology
#citation2
#index5343
#arnetid5345
#%1494119
#%89614
#!When ordinary people learn hand languages, it is critical to properly understand that the forms of the hand shapes and moves are different for speakers and listeners. To cope with the issue, we have equipped a PC camera with the visual interface of an edutainment system for Japanese hand alphabets. To investigate the visual interface, we have conducted experiments with/without the camera device to measure the eye movement when subjects use the interface The experimental results have shown the effectiveness of the how-you-look-smart interface with a PC camera.

#*IntelligentBox as component based development system for body action 3D games.
#@Yoshihiro Okada
#year2005
#confAdvances in Computer Entertainment Technology
#citation1
#index5344
#arnetid5346
#%86200
#%70407
#%70545
#%648196
#%648143
#%648261
#%648246
#%648358
#%648315
#%648330
#!This paper treats component based approach for the development of body action 3D games. The research group of the author has already proposed a 3D software development system called IntelligentBox. IntelligentBox has provided various software components called boxes, which are 3D visible, reactive objects. IntelligentBox allows the user to develop 3D graphics applications including 3D games by combining already existing boxes through direct manipulations on a computer screen. This is the main feature of IntelligentBox, which is a difference from other conventional systems. In this paper, the author introduces the extension of IntelligentBox to the development of body action 3D games. To deal with body actions, various components, i.e., particular boxes, those handle input devices frequently used in virtual reality applications, are introduced to IntelligentBox. Furthermore, the author introduced a particular component called virtual mouse pointer to make it possible to manipulate 3D objects using an input device like a data-glove.

#*Synthetic group dynamics in entertainment scenarios: creating believable interactions in groups of synthetic characters.
#@Rui Prada,Ana Paiva
#year2005
#confAdvances in Computer Entertainment Technology
#citation5
#index5345
#arnetid5347
#%166619
#%769820
#%87597
#!Today, many interactive games and virtual communities engage several users and synthetic characters, all interacting in the same virtual environment. In addition, these interactive scenarios, often present tasks to the participants that must be solved collaboratively. However, to achieve successful and believable interactions between users and such synthetic characters, the latter must be able to show a coherent and set of behaviours. Thus, in scenarios where users and syn-thetic characters interact as a group, it is very important that the interactions follow a believable group dynamics. Focusing on this problem, we have developed a model that supports the dynamics of a group of synthetic characters, inspired by theories of group dynamics developed in human social psychological sciences. The dynamics is driven by a characterization of the different types of interactions that may occur in the group. This characterization addresses socio-emotional interactions as well as task related interactions.We have implemented the model into the behaviour of synthetic characters that collaborate with the user in the resolution of tasks within a collaborative game. This game was used in an evaluation experiment which showed that the model had a positive effect on the users' social engagement in the group, namely on their trust and identification with the group.

#*Loop-R: real-time video interface.
#@Rui Pereira
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5346
#arnetid5348
#%88268
#!Loop-R is a real-time video performance tool, based in the exploration of low-tech, used technology and human engineering research. With this tool its author is giving a shout to industry, using existing and mistreated technology in innovative ways, combining concepts and interfaces: blending segregated interfaces (GUI and Physical) into one. After graspable interfaces and the "end" of WIMP interfaces, hardware and software blend themselves in a new genre providing free control of video-loops in an expressive hybrid tool.

#*Towards a cinematically enhanced narrative.
#@Alejandro Ramírez
#year2005
#confAdvances in Computer Entertainment Technology
#citation2
#index5347
#arnetid5349
#%593430
#%772107
#%503979
#!This paper describes the automatic creation of simple cinematic scenes and events that use film language (FL) as the basis for the creation of a visual story, aiming to improve its narrative. Taking a simple screenplay as our input, we generate relevant cinematic events and conditions using a film grammar. Our system, using a Knowledge-Base (KB) approach, generates the cinematic view of the story, providing 3D animation clips that correspond to the screenplay. A prototype under development is described, together with its applications and current status.

#*Adaptive mixed reality games.
#@Christian Reimann,Volker Paelke
#year2005
#confAdvances in Computer Entertainment Technology
#citation3
#index5348
#arnetid5350
#%775046
#!Emerging technologies for positioning and context recognition together with advances in mobile computing and wireless communication technology enable the creation of new styles of games that are not only suited to mobile use but also exploit the dynamic context of the user. While spatial aspects and the task of "navigation" have been present in computer games from the beginning this has mostly been in the form of simulation on a fixed display. This paper presents an exploratory study on the use of real world geographic environments for and within games.

#*Teddy-bear based robotic user interface for interactive entertainment.
#@Noriyoshi Shimizu,Naoya Koizumi,Maki Sugimoto,Hideaki Nii,Dairoku Sekiguchi,Masahiko Inami
#year2005
#confAdvances in Computer Entertainment Technology
#citation-1
#index5349
#arnetid5351
#%88799
#!A Robotic User Interface (RUI) is part of a concept in which a robot is used as an interface for human behavior. Our RUI, which we have been developing for communications, is a system for interpersonal exchanges that uses robots as agents for physical communication. In this paper, we propose a new type of RUI for interactive entertainment. This RUI enables people to directly interact with the information world.

#*The augmented conversation engine: a system for achieving believable conversation in games and interactive stories.
#@Chris Swain
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5350
#arnetid5352
#%55560
#%520757
#%29809
#!Much work has been done by academic researchers as well as game industry designers to achieve more compelling and emotionally rich storytelling in interactive media. Many projects take character-based approaches by allowing the player to act as the main character in the story and by communicating key story elements via software-based non-player characters (NPCs). This paper provides details about an innovative methodology and writer-centric system called the Augmented Conversation Engine. The engine enables authoring for crafting believable interactive conversations with NPC characters.

#*When RFIDs meet artist's painting.
#@Olivier Haberman,Romain Pellerin,Ugo Haberman
#year2008
#confAdvances in Computer Entertainment Technology
#citation4
#index5351
#arnetid5353
#!This work challenges to create paintings augmented with RFIDs.

#*How to make games for visually impaired children.
#@Dominique Archambault,Damien Olivier
#year2005
#confAdvances in Computer Entertainment Technology
#citation10
#index5352
#arnetid5354
#%288272
#%288469
#!This paper discusses the principal constraints encountered when adapting computer game so they work for visually impaired children. A game platform, the blindstation, was developed to answer to the technical problem. It allows to adapt existing content or create some new games. It provides a set of Python functions to describe those games in an way, independent from their representation. The platform can then render the game in a multi-modal way using the screen, keyboard, mouse and joystick, but also using some specific devices like a Braille terminal, 3D sound, a tactile board or a speech synthesiser. The rendering is done according to an XML style sheet which describes the available resources. It can be customised depending on the available devices but also on the user's choices and disabilities. Our experience is based on the TiM project intends to develop and to adapt computer games for visually impaired children. Several games specially adapted for blind children (from 3 to 10 years old) were designed, involving blind children to evaluate and improve the games. We have established that this is more than games that are strictly accessible, that is games in which all contents can be accessed (directly or via an alternative), but games that are still considered as games by the targeted users.

#*Social gaming: what attracts the most attention?: an investigation using an improved diary method.
#@Mitchell Tan,Looi Qin En,See Swee Lan
#year2008
#confAdvances in Computer Entertainment Technology
#citation2
#index5353
#arnetid5355
#!The twenty first century has seen leaps in quality of integration of computing into entertainment systems involving human-computer interaction (HCI). Various games have attracted their masses of audiences, some hitting international records of 6 million subscribers, as in World of Warcraft by Blizzard [1]. This study hopes to further develop the preferred game model by developing and testing a new methodology for HCI assessment.

#*MonkeyBridge: autonomous agents in augmented reality games.
#@István Barakonyi,Markus Weilguny,Thomas Psik,Dieter Schmalstieg
#year2005
#confAdvances in Computer Entertainment Technology
#citation25
#index5354
#arnetid5356
#%1047179
#%775046
#%808176
#%437887
#%648307
#%5061
#%1011261
#%893658
#%70274
#!MonkeyBridge is a collaborative Augmented Reality (AR) game employing autonomous animated agents embodied by lifelike, animated virtual characters and "smart" physical objects. The game serves as a pilot application to examine how "smart" software and hardware components capable of observing and reacting to events in the physical and virtual world can be useful in AR applications. We describe the implementation details of our test setups as well as how autonomous agents offer a rich gaming experience in AR games.

#*A robot that learns in stages utilizing scaffolds: toward an active and long-term human-robot interaction.
#@Kazuaki Tanaka,Natsuki Oka
#year2008
#confAdvances in Computer Entertainment Technology
#citation-1
#index5355
#arnetid5357
#%1009240
#!In recent years, robots began to appear in our daily lives. However, people get bored with them after a short time. We therefore consider that robots that contact with people must have an ability to learn new actions, so that people enjoy the interaction for a long time. However, it is difficult for them to learn complex actions like games through human-robot interaction. If humans learn through human-human interaction, it is known that scaffolding is effective. Scaffolding is a method of promoting learning by gradually giving difficult learning tasks according to the ability of learners. If robots learn through human-robot interaction, it is possible that scaffolding also supports their learning. However, it has not clarified that scaffolding occurs actually through interactions with ordinary people in everyday situations. In this experiment, we clarify this problem, and propose the method of utilizing the scaffold given by ordinary people in everyday situations for robots that contact with people.

#*Introducing narrative principles into planning-based interactive storytelling.
#@Leandro Motta Barros,Soraia Raupp Musse
#year2005
#confAdvances in Computer Entertainment Technology
#citation14
#index5356
#arnetid5358
#%1495733
#%744375
#%623530
#%520757
#%744523
#!There is a growing interest for interactive computational systems with emphasis in dramatic and narrative aspects, for artistic and entertainment applications. Interactive Storytelling (IS) is the research area that intends to allow the use of interactive computer systems as a new medium for storytellers. One approach used by IS researchers is the use of planning algorithms and STRIPS domains as the base for story generation. The present work explores methods that can be used to introduce some narrative principles into systems using the referred approach. In particular, this paper shows techniques that can be used to enforce the classical three-act structure, and to avoid stalls in the generated story when the player cannot correctly decide what to do.

#*Adaptable pluggable multimodal input with extensible accessible soft dialogues for games.
#@Anthony Savidis,Yannis Lilis
#year2008
#confAdvances in Computer Entertainment Technology
#citation2
#index5357
#arnetid5359
#%584952
#!We propose a game input system with two-level multimodality: an action may be performed via a number of virtual input devices, while the latter may be associated to a number of physical input devices that can be plugged or unplugged on-the-fly. Our input system includes a mode manager, capable to dynamically judge if the offered game commands are not possible via the available physical input devices. In such situations, the mode manager automatically activates interactive graphical panels providing all game commands, supporting pointing and switch-based input, the latter accessible by hand-motor impaired users. We refer to such panels as soft input dialogues, offering an automatic, extensible, and adaptable intermediate input layer among the game system and the input devices. Our input system supports pluggability, enabling locally or remotely connected devices to be utilized on-the-fly, a feature particular useful for pervasive games.

#*Fully automated texture tracking based on natural features extraction and template matching.
#@Rafael Bastos,José Miguel Salles Dias
#year2005
#confAdvances in Computer Entertainment Technology
#citation9
#index5358
#arnetid5360
#%437942
#!In this work we propose a novel approach to real-time texture tracking and registration, based on natural feature extraction from planar objects and template matching, Our method is oriented to planar objects with arbitrary textures but with rectangular topologies and well contrasted contours and does not require any external fiducial marker, either for the set-up or the tracking phases. Once the initial pose condition is obtained, previous planar object information is used to compute subsequent planar object's pose, so that the time coherence of the input video stream is exploited. Our system is completely automated and produces real-time efficient tracking which can be applied to entertainment AR applications and other. The paper discusses also the novelty of the approach, in relation to other existing texture tracking algorithms.

#*Billiard instruction system for beginners with a projector-camera system.
#@Akira Suganuma,Yusuke Ogata,Atsushi Shimada,Daisaku Arita,Rin-ichiro Taniguchi
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5359
#arnetid5361
#%453151
#!The purpose of our work is to develop an instruction system for billiards for beginners using a projector-camera system. The direction and strength of shot are quite important in order to make the shot successful. The player's shooting stance is also important to shoot the cue-ball exactly. The direction and strength of shot and the proper shooting stance are non-symbolic information which is difficult to send to the beginner. It is generally useful that the beginner easily gets these kinds of information. We use a projector to resolve this problem. In this paper, we describe the method recognizing objects on the table, the method calculating a shooting path and shot difficulty, and the method showing the supporting information. We have confirmed experimental effectiveness of our support information.

#*Relations between selected musical parameters and expressed emotions: extending the potential of computer entertainment.
#@Jan Berg,Johnny Wingstedt
#year2005
#confAdvances in Computer Entertainment Technology
#citation7
#index5360
#arnetid5362
#%5329
#%514673
#!A fundamental aspect of music is its ability to express emotions. To develop and extend the potential of music in computer entertainment, a deeper understanding of music's emotional aspects is essential. An experiment was designed to explore the suitability of a specially designed interface (REMUPP) as a means to investigate how musical parameters can contribute to expressing the emotions of 'happiness' and 'sadness'. In the experiment, a number of subjects listened to music examples where the musical performance was governed by a set of musical parameters that were controlled by the subject. The subjects adjusted the parameter settings to best express a given emotion. These settings were recorded and analyzed. The experiment verifies the REMUPP tool as a valid means for the investigation of musical parameters and emotion. Issues of importance for realization of music in the computer entertainment context are also addressed.

#*The research of interactive new media on the application of product customization web interface design strategy: take interactive online system for example.
#@Tsen Wang
#year2008
#confAdvances in Computer Entertainment Technology
#citation-1
#index5361
#arnetid5363
#!'New Media' generally refers to the innovation of information technology and user interface. On the other hand, new media also means the qualitative change of the traditional media on form, content and variety. New media combines the digital information of text, images, animation and videos in digital format. In addition, the 'Interactive New Media' make the user has the ability to access and control the content actively or passively. Following the coming of digital area, the consumers are not only passively aware the advertising and buy the general design products; the modern consumers wish actively involves the process of design and make the product which can satisfied his/her personal wish. However, what strategies that designer can choose to help them to confront with such complex and interactive needing on the new media design? This research cooperates with a traditional frame factory at Tainan, Der-Horng Art Frame. Because of Der-Horng Art Frame proposed the needing of branding and marking design change, the research group takes the case as an example to practice an interactive online customized frame ordering system (see figure1). The case plan and design by following the creative process of Scient studio, an well known global e business consultant company. In addition, the research also uses the methodology of interview, content analysis and case studies compare and revise the design. The results could be the possible reference of the creative model for future new media design, visual communication and consumers' activities research in the future.

#*Game logic portability.
#@Ahmed BinSubaih,Steve Maddock,Daniela Romano
#year2005
#confAdvances in Computer Entertainment Technology
#citation6
#index5362
#arnetid5364
#%893773
#%807036
#%671151
#%587048
#!Many game engines integrate the game logic with the graphics engine. In this paper we separate the two, thus making the logic portable between game engines. In our architecture the logic is represented as an ontology and a set of rules for a particular application domain. A mediator with an embedded rules-engine links the logic to a suitable game engine.We demonstrate our architecture in two ways. First, we show a traffic accident scenario running on two different game engines, with a separate mediator for each engine. The logic type is smart-terrain logic, with participants triggering events based on interaction and proximity tests. In the second demonstration (a simple first-person shooting game) we show the extensibility and performance of the architecture to control non-player characters quickly manoeuvring using proximity tests and waypoints.

#*Detection of MMORPG bots based on behavior analysis.
#@Ruck Thawonmas,Yoshitaka Kashifuji,Kuan-Ta Chen
#year2008
#confAdvances in Computer Entertainment Technology
#citation8
#index5363
#arnetid5365
#%789357
#!Game bots, i.e., autoplaying game clients, are currently causing troubles to both game publishers and bona fide players of Massively Multiplayer Online Role-Playing Games (MMORPGs). Use of game bots leads to collapse of game balance, decrease of player satisfaction, and even retirement from game. To prevent this, in-game polices, played by actual human players or game masters, often roam around game zones and individually question suspicious players, which is obviously laborious and ineffective task. In contrast to other work on automatic detection of MMORPG game bots based on the window events such as keystrokes, the game traffic, and the CAPTCHA test, our research focuses on log typically recorded by game publishers for database rollback. In particular, our research is based on discrepancies in action frequencies and action types in the log between human and bot characters. We propose the bot-detection methodology consisting of two stages. In the first stage an unknown character will be classified as "bot" if its frequencies of particular actions are much higher than those of known human characters. In the second stage, the rest of characters will be classified by the support vector machine classifier based on their action types. We evaluate the proposed methodology using game log of a Korean MMORPG titled Cabal Online and confirm its effectiveness.

#*Natural interaction with virtual objects using vision-based six DOF sphere tracking.
#@Derek Bradley,Gerhard Roth
#year2005
#confAdvances in Computer Entertainment Technology
#citation8
#index5364
#arnetid5366
#%834813
#%771367
#%593396
#%786698
#%892783
#%1046252
#%947355
#!A common task in computer entertainment is the ability to interact with virtual 3D objects. Interacting with these objects using standard computer input devices such as a mouse and keyboard can often be a difficult task. For this reason, Tangible User Interfaces (TUIs) were developed to allow more natural interaction with complex virtual objects by manipulating physical objects in a familiar way. Applying the movements of a physical object to control the movement of a virtual object is often done by embedding devices in the physical object, or by passively tracking the object. We present a new TUI system that includes a passive optical tracking method to determine the six degree-of-freedom (DOF) pose of a sphere in a real-time video stream, and then apply the pose to a virtual object. Our tracking system is based on standard computer vision techniques and applications of 3D geometry. The pose of the sphere is accurately resolved under partial occlusions, allowing the object to be manipulated by hand without a tracking failure. We demonstrate the use of our TUI system to control virtual 3D objects in an interactive way, proving to be a useful tool for computer entertainment applications.

#*Space+a: participating audience on performance stage.
#@Ryohei Takagi,Kosuke Kazato,Suzuki Shugo,Naohito Okude
#year2008
#confAdvances in Computer Entertainment Technology
#citation-1
#index5365
#arnetid5367
#%91829
#!Space+a is a megaphone that produce interactive cheering method in ubiquitous computing world. This megaphone can show the digital photos that you've taken to the wall, and you can also make an effect to the screen by banging or swinging your megaphone in the performance area. Audiences are able to create the whole space by cheering with this megaphone. The purpose of space+a is to let the audience to be more active, and helps to increase the performer's potential.

#*Developing games with Magic Playground: a gesture-based game engine.
#@Carolina Cabral,Juana Dehanov,José Miguel Salles Dias,Rafael Bastos
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5366
#arnetid5368
#!This paper presents Magic Playground, a game engine that enables the development of entertainment applications with realtime gesture-based Human-Computer Interaction (HCI). We describe the main architectural elements of our system and provide a guideline on how to program the engine in order to create games. Finally, we present usability evaluation results of a game, which emulates the known Tetris game1

#*Strategy-acquisition system for video trading card game.
#@Nobuto Fujii,Mitsuyo Hashida,Haruhiro Katayose
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5367
#arnetid5369
#%1023792
#%1009543
#!Behavior and strategy of computers(COM) have recently attracted considerable attention with regards to video games, with the development of hardware and the spread of entertainment on the Internet. Previous studies have reported strategy-acquisition schemes for board games and fighting games. However, there have been few studies dealing with the scheme applicable for video Trading Card Games (video TCG). We present an automatic strategy-acquisition system for video TCGs. The proposed strategy-acquisition system uses a sampling technique, Action predictor, and State value function for obtaining rational strategy from many unobservable variables in a large state space. Computer simulations, where our agent played against a Rule-based agent, showed that a COM with the proposed strategy-acquisition system becomes stronger and more adaptable against an opponent's strategy.

#*Notbook AR.
#@Moisés Mañas Carbonell,Francisco Giner Martínez,Javier Montesa Andrés
#year2005
#confAdvances in Computer Entertainment Technology
#citation-1
#index5368
#arnetid5370
#!Notbook is an art installation created with multi-user means of multimedia documental narration using AR technology (Augmented Reality). It invites the spectator to play with the concept of reading and explore the space of action by means of 3D elements, including video and sound.

#*Absolute field: proposal for a re-configurable spatial structure.
#@Takuji Narumi,Tomohiro Akagawa,Young Ah Seong,Michitaka Hirose
#year2008
#confAdvances in Computer Entertainment Technology
#citation2
#index5369
#arnetid5371
#%1179227
#%1179210
#%808017
#!Only architects have designed and built architectures until now. However, even if usage of the space is changed, it is difficult to change the internal space structure of architectures. On the other hand, we proposed the spatial structure which is dynamically configurable by using information technology. As such a technique, we consider a way to create a virtual architecture in real world without physical walls by using physical computing technology. This led to realization of re-configurable spatial structures which change according to the situation and the usage of space. In this paper, as an implementation of a proposed re-configurable spatial structure, we made "Absolute Field," which is an interactive art installation. In this artwork, we can duplicate a spatial structure in memory as a spatial structure in real world.

#*Lowering the development time of multimodal interactive application: the real-life experience of the XVR project.
#@Marcello Carrozzino,Franco Tecchia,Sandro Bacinelli,Carlo Cappelletti,Massimo Bergamasco
#year2005
#confAdvances in Computer Entertainment Technology
#citation44
#index5370
#arnetid5372
#%593861
#%637055
#%647939
#%647423
#%586843
#!In this paper we present XVR, an integrated development environment for the rapid development of Virtual Reality applications. Using a modular architecture and a VR-oriented scripting language, XVR contents can be embedded on a variety of container applications. This makes it suitable to write contents ranging from web-oriented presentations to more complex VR installations involving advanced devices, such as real-time trackers, haptic interfaces, sensorized gloves and stereoscopic devices, including HMDs. Some case studies are also presented to illustrate the development processes related to XVR and its features.

#*MPML3D: agent authoring language for virtual worlds.
#@Sebastian Ullrich,Helmut Prendinger,Mitsuru Ishizuka
#year2008
#confAdvances in Computer Entertainment Technology
#citation6
#index5371
#arnetid5373
#%806817
#%648292
#!This paper describes an authoring language for specifying communicative behavior and interaction of agents in virtual worlds. We focus on the popular three-dimensional (3D) multi-user online world "Second Life" and the emerging "OpenSimulator" project. While tools for designing avatars and in-world objects exist, technology to support content creators in scripting (computer-controlled) agents ("bots") is currently missing. Therefore, we have implemented new client software that controls the verbal and non-verbal behavior of bots based on the Multimodal Presentation Markup Language 3D (MPML3D). This paper compares both platforms and discusses the merits and limitations of each from the perspective of adding agents.

#*Gaming on the edge: using seams in ubicomp games.
#@Matthew Chalmers,Marek Bell,Barry Brown,Malcolm Hall,Scott Sherwood,Paul Tennent
#year2005
#confAdvances in Computer Entertainment Technology
#citation31
#index5372
#arnetid5374
#%634350
#%5581
#%88277
#!Outdoor multi-player games are an increasingly popular application area for ubiquitous computing, supporting experimentation both with new technologies and new user experiences. This paper presents an outdoor ubicomp game that exploits the gaps or seams that exist in complex computer systems. Treasure is designed so that players move in and out of areas of wireless network coverage, taking advantage not only of the connectivity within a wireless 'hotspot' but of the lack of connectivity outside it. More broadly, this paper discusses how the notion of seamful design can be a source of design ideas for ubicomp games.

#*The Indian neighbourhood user and designing for mobile internet.
#@Karthikeya Acharya
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5373
#arnetid5375
#%5508
#%686189
#%664209
#%502104
#%731897
#%237185
#!With a population of over 1.1 billion people, India has an internet penetration of just 3% while mobile phone penetration is above 22% [7]. This paper looks at the potential of mobile internet for closing this gap. With nearly half the population of internet users using the cyber cafe as one of the platforms for accessing the internet, the study focuses on understanding internet usage by looking at the culture of internet use mainly through cyber cafes in various contexts of the Indian neighbourhood. The contexts as locations of the cyber cafes were chosen based on the socio cultural nature of the neighbourhood within the urban fabric. The study also looks into understanding internet non users who may be potential future users. The aim of the study was to arrive at a set of broad design guidelines for mobile internet through user research.

#*A logic-based tool for interactive generation and dramatization of stories.
#@Angelo E. M. Ciarlini,Cesar Tadeu Pozzer,Antonio L. Furtado,Bruno Feijó
#year2005
#confAdvances in Computer Entertainment Technology
#citation32
#index5374
#arnetid5376
#%183050
#%874550
#%56572
#%745862
#!A key issue in interactive storytelling is how to generate stories which are, at the same time, interesting and coherent. On the one hand, it is desirable to provide means for the user to intervene in the story. On the other hand, it is necessary to guarantee that user intervention will not introduce events that violate the rules of the intended genre. This paper describes LOGTELL, a tool we have been developing for interactively generating and dramatizing stories. We focus on the specification of a formal logic model for events and characters' behaviour. Based on the model, the user can interact with the tool at various levels, obtaining a variety of stories agreeable to individual tastes, within the imposed coherence requirements. The system alternates stages of goal inference, planning, user intervention and 3D visualization. Our experiments have shown that the system can be used not only for entertainment but also to help in the creation and adaptation of stories in conformity with a specified genre.

#*CAMEO - camera, audio and motion with emotion orchestration for immersive cinematography.
#@Hyunju Shim,Bo Gyeong Kang
#year2008
#confAdvances in Computer Entertainment Technology
#citation9
#index5375
#arnetid5377
#%593430
#%502000
#!This paper introduces a system for an automatic 3D animation production, CAMEO, which offers various kinds of direction knowledge from the real world in a unified manner. To accumulate direction knowledge, we have worked in cooperation with real world experts and developed a system which orchestrates direction knowledge into computer algorithm and data. We also defined a set of XML schema to represent 3D animation contents in XML format. The advantage of our approach is the harmony of direction factors which enables users to write the narrative and expect 3D animation reflected with all direction factors automatically.

#*Scenario analysis based on linear logic.
#@Frédéric Collé,Ronan Champagnat,Armelle Prigent
#year2005
#confAdvances in Computer Entertainment Technology
#citation-1
#index5376
#arnetid5378
#%625691
#%1091489
#!This paper deals with game analysis. We begin by the proposal of a terminology relevant to game scenario. Then, we propose an approach dedicated to analyze game scenarii. This approach consists in expressing a scenario by using a fragment of linear logic. This model is then translated into a Petri net model. This model allows us to generate the possible narratives for the given scenario that are at last analyzed. Morever, in addition to usual provable properties such as liveness and safety properties, we propose a new class of properties establishing conclusions with respect to the scenario relevance.

#*Designing location-based mobile games with a purpose: collecting geospatial data with CityExplorer.
#@Sebastian Matyas,Christian Matyas,Christoph Schlieder,Peter Kiefer,Hiroko Mitarai,Maiko Kamata
#year2008
#confAdvances in Computer Entertainment Technology
#citation14
#index5377
#arnetid5379
#%805598
#%875864
#%5078
#%5014
#%502004
#!The games with a purpose paradigm proposed by Luis von Ahn [9] is a new approach for game design where useful but boring tasks, like labeling a random image found in the web, are packed within a game to make them entertaining. But there are not only large numbers of internet users that can be used as voluntary data producers but legions of mobile device owners, too. In this paper we describe the design of a location-based mobile game with a purpose: CityExplorer. The purpose of this game is to produce geospatial data that is useful for non-gaming applications like a location-based service. From the analysis of four use case studies of CityExplorer we report that such a purposeful game is entertaining and can produce rich geospatial data collections.

#*InStory: a system for mobile information access, storytelling and gaming activities in physical spaces.
#@Nuno Correia,Luís Alves,Helder Correia,Luís Romero,Carmen Morgado,Luís Soares,José C. Cunha,Teresa Romão,A. Eduardo Dias,Joaquim A. Jorge
#year2005
#confAdvances in Computer Entertainment Technology
#citation16
#index5378
#arnetid5380
#%505746
#%363046
#%362827
#%252524
#%232920
#%88075
#%505701
#%559451
#%256583
#%789420
#%808427
#%808300
#%806199
#%806703
#%1047479
#%927835
#%1123509
#!This paper describes the work carried out in the InStory project. InStory has the goal of defining and implementing a platform for mobile storytelling, information access, and gaming activities. The platform has a flexible computational architecture that integrates heterogeneous devices, different media formats and computational support for different narrative modes and gaming activities. The system is driven and validated by a set of story threads and narratives that are centered on the exploration of physical spaces. This exploration is combined with the perspective of sharing information between users and providing historic context. The project also wants to explore the social aspect of shared narratives and activities, with the idea that the technology can provide new innovative approaches to social participation in different types of events.

#*An affective model of user experience for interactive art.
#@Stephen W. Gilroy,Marc Cavazza,Rémi Chaignon,Satu-Marja Mäkelä,Markus Niranen,Elisabeth André,Thurid Vogt,Jérôme Urbain,Hartmut Seichter,Mark Billinghurst,Maurice Benayoun
#year2008
#confAdvances in Computer Entertainment Technology
#citation4
#index5379
#arnetid5381
#%647414
#%5007
#!The development of Affective Interface technologies makes it possible to envision a new generation of Digital Arts and Entertainment applications, in which interaction will be based directly on the analysis of user experience. In this paper, we describe an approach to the development of Multimodal Affective Interfaces that supports real-time analysis of user experience as part of an Augmented Reality Art installation. The system relies on a PAD dimensional model of emotion to support the fusion of affective modalities, each input modality being represented as a PAD vector. A further advantage of the PAD model is that it can support a representation of affective responses that relate to aesthetic impressions.

#*A viable approach to deliver television events, having multiple and selectable plots: MultiChannelStory.
#@Massimo Deriu
#year2005
#confAdvances in Computer Entertainment Technology
#citation1
#index5380
#arnetid5382
#!In this paper we describe an idea to develop interactive narrative with iTV. We propose a framework to deliver television events, usually dramas or cartoons, having multiple and selectable plots, using the DVB-MHP platform. We define these events as MultiChannelStories.

#*Anime de Blog: animation CGM for content distribution.
#@Kaoru Sumi
#year2008
#confAdvances in Computer Entertainment Technology
#citation3
#index5381
#arnetid5383
#%593360
#%593207
#%460871
#!Anime de Blog is an animation consumer generated media (CGM) by which we can create blogs with animation content; the system can collect 3D animation and image data. The animations or image data are searched for and selected from shared consumer-generated databases by using simple words. If users cannot find appropriate data, they can easily create new data by using the provided animation editor and upload it by entering related words. Our animation database, Animebase, correlates natural language with three-dimensional animation data. When an animation is uploaded, the system applies the motion data of this model to other models and generates new animations, which are then stored in Animebase. Anime de Blog has been put up on the Web as a test installation. This paper describes the system and a follow-up report of the test installation.

#*Personality model for a companion AIBO.
#@Iulia Dobai,Léon J. M. Rothkrantz,Charles van der Mast
#year2005
#confAdvances in Computer Entertainment Technology
#citation8
#index5382
#arnetid5384
#!In this paper we describe the architecture that allows the modeling of an emotionally intelligent robot. We chose to implement these architectures on AIBO, which is a quadruped autonomous robot, developed by Sony. AIBO was developed as an entertainment robot with its "mind" resident on a memory stick. Our goal is to develop a new mind for a companion AIBO with a more complex personality model. The focus of this paper is on a model of personality. Taking into consideration the realities concerning an emotionally intelligent AIBO, that acts in an unpredictable and changing environment, the existing models of personality need improvement, modifications and adaptations to the current situation. Most existing personality models that are used in virtual humans and agents take into consideration three layers: personality, mood and emotions or just two: personality and emotions. We, on the other hand will try to add a new set of parameters: needs that will not constitute a new layer but together with the personality layer, a pillar for the top two layers of mood and emotions. This paper introduces the architecture that renders valuable the personality model discussed above.

#*Design and evaluation of a virtual mobile time machine in education.
#@Hiroyuki Tarumi,Keitaro Yamada,Takafumi Daikoku,Fusako Kusunoki,Shigenori Inagaki,Makiko Takenaka
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5383
#arnetid5385
#%90132
#%5384
#%87508
#!We have developed a "virtual time machine" for edutainment, which needs only commercially available mobile phones. In reality, the system just shows graphical images of a past scene within a given area, viewing from the location given by GPS and with arbitrary viewing angles. Users can virtually explore the past world with it. We applied it to junior high school students. They virtually visited a world of 1938, when a landslide disaster occurred. They were able to directly compare now and the past. In this paper, the design approach and evaluation of our edutainment practice are given. Our system raised students' motivations.

#*Exploring spatial narratives and mixed reality experiences in Oakland Cemetery.
#@Steven Dow,Jaemin Lee,Christopher Oezbek,Blair MacIntyre,Jay David Bolter,Maribeth Gandy
#year2005
#confAdvances in Computer Entertainment Technology
#citation23
#index5384
#arnetid5386
#%87897
#%1047324
#%636970
#%121787
#%87429
#%87379
#%1140953
#%87735
#%88104
#!The Historic Oakland Cemetery in downtown Atlanta provides a unique setting for exploring the challenges of location-based mixed-reality experience design. Our objective is to entertain and educate visitors about historically and culturally significant events related to the deceased inhabitants of the cemetery. We worked with the constraints and affordances of the physical environment of the cemetery to design an audio-based dramatic experience. The dramatic narrative is realized through voice actors who play the parts of cemetery residents and tell stories about the time periods in which they lived. The experience provides navigation and linearity through a main narrator who guides visitors to various gravesites. While at each grave, the visitor can choose from several categories of content using a handheld controller. Formative evaluations conducted with users in the cemetery indicate strengths of the current experience and suggest ideas for continued development.

#*Augmented reality and rigid body simulation for edutainment: the interesting mechanism - an AR puzzle to teach Newton physics.
#@Philip Buchanan,Hartmut Seichter,Mark Billinghurst,Raphael Grasset
#year2008
#confAdvances in Computer Entertainment Technology
#citation2
#index5385
#arnetid5387
#%562946
#%748852
#%437862
#%437861
#%593017
#!Physics simulation is becoming more common in computing. We have developed a comprehensive toolkit to connect the physical and virtual world within Augmented Reality (AR) using rigid body simulation. Unlike existing techniques of embedding physics simulations into 3D environments, the use of rigid body simulations within AR requires a different approach. To demonstrate our approach we developed an edutainment game based on the concept of chain reactions and physical contraptions. In this paper we elaborate on the constraints introduced by mixing AR and rigid body simulation, and how it subsequently effects the visual richness and perceptual appearance of an AR simulation. We describe our implementation approach and provide an analysis of additional scenarios which would be enriched by physical simulation.

#*Real or unreal?: an evaluation setting for emotional characters using unreal technology.
#@Manfred Eckschlager,Michael Lankes,Regina Bernhaupt
#year2005
#confAdvances in Computer Entertainment Technology
#citation1
#index5386
#arnetid5388
#%773177
#%648185
#%88143
#%90701
#!This paper sketches a setup to perform user experience tests on game characters which act emotionally based on their personality and situation. The test setting is primarily designed to benchmark Nemesys, a system designed to elicit emotions based on an artificial neural network that is able to learn six basic emotional states. Nemesys is based on models drawn from the state of the art in modeling emotions in the field of psychology and also includes the Five-Factor Model of Personality to represent different personalities.The test and application scenario employs the commercial 3D game engine from Unreal Tournament 2003, a stereoscopic projecting of the scene and biofeedback measurements of the affective state of the player.

#*Photogeist: an augmented reality photography game.
#@Cody Watts,Ehud Sharlin
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5387
#arnetid5389
#%453131
#%1047420
#%1047372
#!In this paper, we present Photogeist, a photography-based augmented reality game in which players use a physical handheld camera device to take pictures of floating virtual ghosts. Players must creep, sneak, and maneuver themselves through physical space in order to approach their ghostly subjects and snap a picture using their paranormal camera. In this paper, we describe Photogeist's inspiration, design, implementation and resultant gameplay. A brief discussion of related games is also included.

#*Challenges for pervasive mobile game design: examining players' emotional responses.
#@Laura Ermi,Frans Mäyrä
#year2005
#confAdvances in Computer Entertainment Technology
#citation4
#index5388
#arnetid5390
#%5211
#%686396
#%686128
#!The research is focused on developing pervasive and persistent game concepts that are most suitable for contemporary mobile phones. The analysis of the emotional responses of the testplayers in the first play-test and of the game prototype The Songs of North pointed at some key challenges to be met in order to successfully design pervasive mobile games that provide pleasant gameplay experiences: overcoming and exploiting the technical limitations and uncertainties, inventing means to ensure the sufficiency of meaningful tasks, and paying special attention to social playability and acceptance.

#*Entertainment character for information display.
#@Tetsuya Saito,Kenichi Hirota,Junichi Hoshino
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5389
#arnetid5391
#!In games and movies that use characters, utterances are important expressions of action. However, currently, interactive characters have their conversation topics prepared beforehand by the creator. If the topics are few, they repeat the same content with fixed variations, resulting in the user losing interest. In this paper, we propose the concept of entertainment character for emotional information display. We use RSS, which provides live feeds on news and weather forecasts on the Internet, to provide real-world information thereby enriching characters conversation topics. And, we generate various conversations between the user and the characters by adding topics related to the utterances and feelings appropriate to the topic for improving the expressiveness of talk.

#*Painting the town red: configuring location-based games by colouring maps.
#@Martin Flintham
#year2005
#confAdvances in Computer Entertainment Technology
#citation8
#index5390
#arnetid5392
#%459673
#%453330
#%5009
#%88277
#!ColourMaps enable designers to author location-based games by directly colouring over maps. This provides a simple, familiar and yet highly flexible approach to matching location-triggers to complex physical spaces. It also supports configuring and managing other aspects of a game, including setting start positions, filtering inaccurate position data, and underpinning orchestration tools. We describe the use and evolution of this approach to create four location-based games that have toured internationally over the past four years. From this, we draw out a general design for a ColourMap tool that includes concepts of multiple levels, multiple and specialized content layers within a level, and different options for triggering game events from user movements and other actions.

#*A service based framework for developing mobile, collaborative games.
#@Florian Klompmaker,Christian Reimann
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5391
#arnetid5393
#%928717
#%512720
#!In this paper we introduce a framework that enables developers of mobile, collaborative applications - especially games - to easily use so called services. Services may run either locally on a mobile device or on a remote server application that is also part of the framework. Those that are executed locally are replaceable software libraries. Services may be used to log in to a portal, send messages between multiple devices or doing other kinds of calculation and communication. The benefit of this framework is that it may be used within different operating systems and that it is very easy to be used as an SDK. Therefore developing such kinds of applications has not longer be done from scratch and can be accomplished quite fast.

#*Tierra Inhospita: exploring a virtual world with your face.
#@Ginés García-Mateos,Sergio Fructuoso Muñoz
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5392
#arnetid5394
#%1032684
#!In this poster, we describe the application of advanced computer vision techniques to create a perceptual interface based on face detection, tracking and pose estimation."Tierra Inhospita" is a virtual 3D world, similar to a first-person game, controlled by means of the user's head. Using integral projections, faces are tracked in a fast and reliable way. Then, additional information is extracted from the projections to estimate 3D position and orientation of the face. Although not accurate in terms of 3D locations, these estimations accomplish their purposes of stability and responsiveness to user's gestures. Finally, these parameters are converted into movement in the virtual world.The proposed technique has been implemented and tested in a prototype, which is publicly available [1]. Our experiments have proved the viability of the method.

#*Metaphorical affect sensing in an intelligent conversational agent.
#@Li Zhang
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5393
#arnetid5395
#%57554
#%55879
#%459930
#!We report new developments of an affect detection component on the processing of several different types of metaphorical affective expressions. The component has been embedded in an intelligent conversational AI agent interacting with human users under loose scenarios. The detected affective states also play an important role in producing emotional animation for users' avatars. Evaluation for the affect detection component is provided. Our work contributes to the conference themes on human-robots interaction based on affect sensing, affective computing, learning and children, narrative storytelling and evaluation of affective social interaction.

#*SymBall: camera driven table tennis for mobile phones.
#@Mika Hakkarainen,Charles Woodward
#year2005
#confAdvances in Computer Entertainment Technology
#citation16
#index5394
#arnetid5396
#%5081
#%438033
#%5107
#!We present a table tennis game implemented for Symbian OS Series 60 mobile phones, using the phone's integrated camera as the main game controller. The game demonstrates how the integrated cameras are already usable for interaction on mobile phones, with real time performance. Data communication between the phones is handled using Bluetooth, but the implementation would allow for using slower radio links too.

#*Hanmadang: entertainment systems for massive face-to-face interaction.
#@Geonhyeok Go,Sujung Han,Jongeun Lee,Yuri Choi,Bowen Sun,Youngwoo Park,Donggi Jung,Sungjae Hwang,Changyoung Lim
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5395
#arnetid5397
#%538599
#!We created entertainment systems called "Hanmadang". The goal of the Hanmadang project is to allow players to experience massive face-to-face interaction. To reduce entry barriers of participation, it enables players to use their own mobile phone as an input interface by using an audio response system. Two games "Youngcha!" and "Hankanoid" are developed as parts of this project.

#*Human scale haptic interaction with a reactive virtual human in a realtime physics simulator.
#@Shoichi Hasegawa,Ishikawa Toshiaki,Naoki Hashimoto
#year2005
#confAdvances in Computer Entertainment Technology
#citation-1
#index5396
#arnetid5398
#%593090
#%593551
#%593865
#%593453
#%5041
#!In this paper, we propose a framework for haptic interaction with a reactive virtual human in a physically simulated virtual world. The user controls an avatar in the virtual world via human scale haptic interface and interacts with the virtual human through the avatar. The virtual human recognizes the user's motion and reacts to it. We create a virtual boxing system as an application of the proposed framework. We performed an experiment to evaluate the validity of the reaction of the virtual human. We get confirmation that proposed framework creates realistic reactions and users can easily estimate the input motions of the avatar.

#*Understanding the use of video games in non-formal education in Barcelona.
#@Daniel Aranda,Jordi Sánchez-Navarro
#year2008
#confAdvances in Computer Entertainment Technology
#citation2
#index5397
#arnetid5399
#!Video games, as with any other cultural resource, are basic tools in social and cultural learning, tools for socialising that provide players with instrumental and social competences and skills. We have just completed a pilot project entitled ELLAD, (Esplai de Lleure i Aprenentatge Digital - Digital Learning and non-formal education classroom), looking at the use of video games in non-formal educational contexts as a tool to improve the quality and effectiveness of their education practices and processes. In this paper, we summarise the factors that led to the creation of the video games classroom in the context of non-formal education, the dynamics established, the initial conclusions reached and the further research related to this pilot project: the forthcoming study "Rethinking Digital Entertainment: a project on young people's digital socialization in spare time", funded by the Spanish Ministry of Industry, that will be developed between 2009 and 2011.

#*Personalizing game content using audio-visual media.
#@Jukka Holm,Kai Havukainen,Juha Arrasvuori
#year2005
#confAdvances in Computer Entertainment Technology
#citation7
#index5398
#arnetid5400
#!This paper introduces the concept of media-controlled games, where game content is personalized using audio-visual media as an input to the game. Each piece of background music or picture selected by the player makes the game look different and behave variedly.

#*Brain activity during playing video game correlates with player level.
#@Shingo Hattahara,Nobuto Fujii,Shinpei Nagae,Koji Kazai,Haruhiro Katayose
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5399
#arnetid5401
#!Many studies have focused on the relationship between playing video games and brain activity. Most of these studies have reported that regions of the prefrontal cortex are deactivated when video games are played. However, it is natural to assume that the effect on humans varies with the player's age, attitude, or mastery level. In this paper, we focus on the mastery level of the video game player. We measured the brain activity at the prefrontal cortex using functional near-infrared spectroscopy (fNIRS) while novices, intermediate players, and master-level players ("masters") played video games. We observed the activation of brain activity at the prefrontal cortex while masters were playing the game that they had mastered.

#*The case for dynamic difficulty adjustment in games.
#@Robin Hunicke
#year2005
#confAdvances in Computer Entertainment Technology
#citation17
#index5400
#arnetid5402
#%256879
#!Conventional wisdom suggests that while players enjoy unpredictability or novelty during gameplay experiences, they will feel "cheated" if games are adjusted during or across play sessions. In order for adjustment to be effective, it must be performed without disrupting or degrading the core player experience. This paper examines basic design requirements for effective dynamic difficulty adjustment (DDA) given this constraint, presents an interactive DDA system (Hamlet), and offers preliminary evaluation results which challenge common assumptions about player enjoyment and adjustment dynamics.

#*The memory book.
#@Mari C. Juan,Beatriz Rey,D. Perez,D. Tomas,Mariano Alcañiz Raya
#year2005
#confAdvances in Computer Entertainment Technology
#citation-1
#index5401
#arnetid5403
#%5005
#%438015
#!In this paper we present an Augmented Reality book for remembering past events and to plan future ones. We have developed this system using Brainstorm eStudio. We have incorporated Augmented Reality options into Brainstorm eStudio using a plugin of ARToolKit. The user can create his own book selecting images, objects and videos from a database. The selection of elements and their inclusion into the book is achieved using a tangible interface.

#*Towards an intelligent storyboarding tool for 3D games.
#@Arnav Jhala,William H. Bares,R. Michael Young
#year2005
#confAdvances in Computer Entertainment Technology
#citation1
#index5402
#arnetid5404
#%593430
#%459516
#!We present an intelligent storyboarding tool that takes as an input abstract annotated action specification to generate camera actions and geometric constraints for executing as a dynamic storyboard.

#*Dynamically reconfigurable multi-display environment for CG contents.
#@Takashi Ohta
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5403
#arnetid5405
#!We are designing an application framework for creating graphics contents that utilize a multi-display environment. The processes store and exchange the geometry and event information via a shared space. We use a sensor to detect the placement of the displays. This enables the environment to change the number and layout of its displays dynamically.

#*The art of game-mastering pervasive games.
#@Staffan Jonsson,Annika Waern
#year2008
#confAdvances in Computer Entertainment Technology
#citation-1
#index5404
#arnetid5406
#%712896
#%5214
#%1117027
#%89979
#%87997
#!Pervasive Games can benefit greatly from being game-mastered rather than fully automatic. However, game-mastering pervasive games is not a simple task neither from a technical nor a game design perspective. In this article we discuss some of the core issues for pervasive game mastering based on two example games. The first game was a long duration pervasive larp, where the core game activity was role-play. The second game is a pervasive game which relies extensively on technology installations, and where game mastering is used to create a coherent experience mixing technology-mediated gaming with live role-play events. Based on these rather different games we outline the core issues and methods available for pervasive game mastering.

#*"structured creature": a prototype for interactive architecture.
#@Yosuke Ushigome,Kunihiro Nishimura,Michitaka Hirose
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5405
#arnetid5407
#!This work, named "structured creature" is a prototype of moving space structure and is a so flexible structure that "structured creature" wriggles slowly, rising and collapsing repetitively. It gives a strong presage of the future where physical space completely corresponds to the subjective space that people perceive.

#*Body/persona/action!: emerging non-anthropomorphic communication and interaction in virtual worlds.
#@Jacquelyn Ford Morie,Gustav Verhulsdonck
#year2008
#confAdvances in Computer Entertainment Technology
#citation2
#index5406
#arnetid5408
#%912167
#%592426
#%89182
#%91015
#!Avatars are traditionally understood as representing their human counterparts in virtual contexts by incorporating many aspects of a person's real world physical characteristics within the virtual form. An alternate approach, in which avatars are instead imbued with non-human characteristics, challenges the limitations of solely anthropomorphic principles and expands the potential of avatars for virtual world interaction and communication. This paper provides a brief history of non-anthropomorphic avatars, with a focus on exploring the current use of such avatars in virtual worlds. In order to explain the shift in degree of anthropomorphism, we discuss Goffman's theory of symbolic interactionism, which holds that the self is constructed as a persona through social performance and relates identity to social behavior rather than appearance. Since non-anthropomorphic avatars are persistent characters engaged in a prolonged performance in virtual worlds, their use also may motivate emerging social mores, politics and ideologies. This paper argues that such avatar species create new social interactions and modes of communication that may signal interesting directions for future research.

#*"DELEM - Delayed Mirror".
#@Gregorio Jimenez,Francisco Sanmartín,Emanuele Mazza
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5407
#arnetid5409
#!DELEM is an interactive installation involving the tracking of the viewer and the processing in real time of the sound and the image obtained in video, which is subject to time-based alterations. The program application is Max/MSP/Jitter, which features allow us to reinforce the aesthetic experience of the viewer seeing the changing relations in terms of image, sound and time that he/she establishes with his/her movement in the space.

#*SCORPIODROME: an exploration in mixed reality social gaming for children.
#@Georgios Metaxas,Barbaros Metin,Jutta Schneider,G. Shapiro,W. Zhou,Panos Markopoulos
#year2005
#confAdvances in Computer Entertainment Technology
#citation15
#index5408
#arnetid5410
#%1498361
#%87358
#%927616
#%90171
#!This paper describes the design of SCORPIODROME a mixed reality game for groups of 3--4 children aged 11--14. SCORPIODROME is designed for social gaming; i.e., computer gaming that is intended to support and trigger social interaction between players to occur within and around playing the game. The paper discusses some of the lessons learnt from this design process and how SCORPIODROME paves the way towards the development of a whole class of mixed reality games. Finally, we reflect upon some of the methodological issues encountered.

#*AIRSF: a new entertainment adaptive framework for stress free air travels.
#@Hao Liu,Jun Hu,Matthias Rauterberg
#year2008
#confAdvances in Computer Entertainment Technology
#citation5
#index5409
#arnetid5411
#%712935
#!In this paper, we present a new entertainment adaptive framework AIRSF for stress free air travels. Based on the passenger's current and target comfort states, user entertainment preference, and context of use, the system uses a Markov decision process to recommend context-aware and personalized stress reduction entertainment to transfer the passenger from the current state to the target comfort state with the minimum time cost if he/she is stressed, or keep the passenger at comfort state with context-aware and personalized non stress induction entertainment if the passenger is not stressed. Compared to the current in-flight entertainment framework, it can regulate the passenger's physical and psychological states to comfort states with context-aware and personalized stress reduction entertainment; Compared to the current entertainment stress reduction methods, it uses a linear bio feedback system to regulate the user to comfort state with context-aware and personalized entertainment recommendation.

#*A remote Chinese chess game using mobile phone augmented reality.
#@Lieu-Hen Chen,Chi-Jr Yu,Shun-Chin Hsu
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5410
#arnetid5412
#%648481
#%437898
#%127952
#!In this paper, we use Augmented Reality (AR) technology to implement a client-server Chinese chess game on mobile phones. Without a real chess board, users can play Chinese chess or learn "kifu" on the server. Kifu, recording every step in playing Chinese chess, is very helpful for players to learn and analyze the strategies for playing Chinese chess. Moreover, users can "directly" pick up a chess piece and move it through his mobile phone. This approach gives users the most natural human-computer interface. Because of the convenience of mobile phones, users do not need to sit in front of their computers or to buy an expensive device for AR technology (like HMD), and they can play board games ubiquitously and inexpensively with the system. With the wireless communication technology and client-server architecture, the system will not be restricted by storage memory and compute speed of any mobile phone. The system server can get AI of the advanced computer chess and numerous kifu resources from a "advanced Chinese chess knowledgebase system" developed by professor Shun-Chin Hsu.

#*Through the looking glass: you can play against your own reflection.
#@Yasuaki Kakehi,Takeshi Naemura
#year2005
#confAdvances in Computer Entertainment Technology
#citation4
#index5411
#arnetid5413
#%70497
#%786746
#!This interactive artwork overturns the commonsense assumption that a looking glass reflects the world in front of it. The worlds outside and inside the looking glass are not symmetric in our optical system. This feature allows you to play an air-hockey game against yourself reflected in the looking glass.

#*Virtual mirror for augmented presence applications.
#@Andrei Sherstyuk,Kar-Hai Chu,Sam Joseph
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5412
#arnetid5414
#!We propose a method for overlaying CG elements onto real indoor scenes, without making a viewer wear special display devices, such as HMDs or monocles. The Virtual Mirror utilizes a computer display that operates in a mirror mode. It can be mounted on a wall or on a desktop, providing wide-angle viewing of the augmented scene.

#*AI middleware as means for improving gameplay.
#@Börje Karlsson,Bruno Feijó
#year2005
#confAdvances in Computer Entertainment Technology
#citation3
#index5413
#arnetid5415
#%745306
#%1048963
#!Current commercial AI middleware are still far from being a generic and flexible tool for developing computer games. Also the literature lacks proposals in this field. In this work we present some of our current research on developing a new proposal for a flexible architecture that can be used in several types of games. This AI engine is designed to provide support for the implementation of AI functionalities in computer games, streamlining this implementation and allowing the developers to focus their attention on the creative side of the game, but is also focused on introducing new techniques that could allow for an improved gameplay experience or even new gameplay styles. In order to fulfill this goal, this research focuses on the design issues of such a system and its integration into games, using more powerful techniques from academic AI and strongly relying on software engineering principles.

#*An augmented reality weather system.
#@Marko Heinrich,Bruce H. Thomas,Stefan Müller,Christian Sandor
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5414
#arnetid5416
#%1047420
#%461156
#%61292
#%594014
#!This paper presents ARWeather, a simulation application, which can simulate three types of precipitation: rain, snow, and hail. We examined a range of weather phenomenon and how they may be simulated in a mobile augmented reality system. ARWeather was developed and deployed on the Tinmith wearable computer system to enable autonomous and free movement for the user. The user can move freely inside the simulated weather without limitation. The result of this work, the ARWeather application, has been evaluated with a user study to determine the user's acceptance and draw conclusions to the applicability of augmented reality simulated weather.

#*ARMS: a trading card game using AR technology.
#@Haruhiro Katayose,Kazuhiko Imanishi
#year2005
#confAdvances in Computer Entertainment Technology
#citation3
#index5415
#arnetid5417
#!Trading card games have become very popular among children all over the world. This paper describes an example of enhancing a trading card game involved with Augmented Reality technologies, the players of which can experience monster summoning and battles, as if they are happening on their own arms.

#*Motion capture system using single-track gray code.
#@Tomoko Fujii,Hideaki Nii,Takuji Tokiwa,Maki Sugimoto,Masahiko Inami
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5416
#arnetid5418
#%1119807
#!In this paper, we describe a high speed optical motion capture method that has a simple mechanism. We use a light shielding filter using a pattern of Single-Track Gray Code (STGC) [1] absolute encoder to take location of IR light marker tags instead of high-speed camera or row of binary coded masks. Therefore, this system can convert the position coordinate of tags into the digital signal directly, and it can track faster than the traditional method, with only the combination of inexpensive optical parts.

#*Telepresence meets racing games.
#@Yongjin Kim,Jaehoon Jung,Seokhee Jeon,Sangyoon Lee,Gerard Jounghyun Kim
#year2005
#confAdvances in Computer Entertainment Technology
#citation0
#index5417
#arnetid5419
#%757669
#%502719
#%913082
#!Telepresence is an advanced form of teleoperation that enables humans to interact with and experience environments that are normally difficulty to access such as remote or dangerous environments. As a technology, telepresence emphasizes the richness of the experience of the user, or "presence," how much the user feels being situated at the target environment. In this poster, we present a telepresence racing game. The user remotely controls a toy car that operates in the real environment and equipped with wireless stereo-cameras and other sensors. The experience of the user is enriched by the information displayed to the user, namely the live stereo image and artificial multimodal special effects generated from the information from the sensors. The proposed telepresence game is expected to offer a different kind of fun and excitement without the "suspension" of disbelief compared to the 3D graphics based games.

#*Photonastic surface: pin matrix type display controlled with light.
#@Ryo Oguchi,Yasuaki Kakehi,Keita Takahashi,Takeshi Naemura
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5418
#arnetid5420
#!We present Photonastic Surface, a novel pin matrix type 3D form display. In Photonastic Surface, a photosensor is attached to each pin of the matrix, and the height of pins are independently controlled with light luminance or fast light flicker. It can express volume information effectively by overlapping projected images on the pin matrix and provide a new type of interaction between the pin matrix and human through light.

#*Weekend battle: an entertainment system for improving workers' motivation.
#@Itaru Kuramoto,Kazumasa Kashiwagi,Tomomi Uemura,Yu Shibuya,Yoshihiro Tsujino
#year2005
#confAdvances in Computer Entertainment Technology
#citation5
#index5419
#arnetid5421
#%87869
#%590308
#%237077
#%5047
#%89534
#%122050
#!Entertainment has the power to improve workers' motivation. This improvement affects their productivity. Based on this idea, we have proposed the entertainment system for workers in the working environment. Weekend Battle is a new entertainment system which extends the fun of competition and collection, and which solves the problems which we pointed out in the previous entertainment system. In Weekend Battle, workers rear their avatars at weekdays, and their avatars fight against each other at weekend. The growth at weekdays is related with whether their avatars win or not at weekend, so we expect that they will work harder than without Weekend Battle.We implemented and evaluated Weekend Battle by an experiment for five weeks. The result indicated that Weekend Battle could improve the participants' motivation, and especially the competition could improve their productivity. Moreover, the entertainment system could produce the topic for their informal communication, so it was expected that it make their relationships better.

#*An authoring tool for urban audio tours with animated maps.
#@Ken'ichi Tsuruoka,Masatoshi Arikawa
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5420
#arnetid5422
#%1179227
#!Podcasts are getting popular as a new type of radio or television for mobile media players. The Podcasts are often free. Anyone can also easily publicize Podcasts like Blog on the Internet. People can choose and listen to their intended Podcasts at anytime and at any place without using any mobile telecommunication services. PodWalk is a new kind of Podcast which has been designed for guiding real spaces such as towns and museums while walking. One of the disadvantages of PodWalks is its difficulty for listeners in synchronizing their locations with narrators' ones. Listeners often get lost and cannot synchronize with narrators' locations. To solve the problem of listeners' losing their ways in PodWalks, we propose a new framework maPodWalks as an extension of PodWalks to provide egocentric mappings synchronized with narrations on mobile media players. We have developed a new authoring tool for user-generated maPodWalks.

#*Interactive and enjoyable interface in museum.
#@Fusako Kusunoki,Takako Yamaguti,Takuichi Nishimura,Koji Yatani,Masanori Sugimoto
#year2005
#confAdvances in Computer Entertainment Technology
#citation1
#index5421
#arnetid5423
#%665401
#!Exhibitions at a scientific museum are usually difficult for ordinary school pupils. To improve the issues of current explanation systems, we use Personal Data Assistant (PDA) devices. Recent PDAs have enough functionality for people to interactively, individually, but it is not easy to assist that school pupils learn scientific knowledge merely using PDA.This research examined the main focus of the design and implementation of visual interfaces for PDAs for such a learning system. We aims the visual interface for PDAs have more interactive and entertainment to engage for learning scientific knowledge. Experiments using two prototype systems(Pi-book and Pit A Pat)implemented in the Flash/MX software toolkit have suggested the effectiveness on the performance and functionality of the proposed method.

#*Culinary art designer.
#@Fumihiro Kato,Mina Shiina,Takashi Tokizaki,Hironori Mitake,Takafumi Aoki,Shoichi Hasegawa
#year2008
#confAdvances in Computer Entertainment Technology
#citation2
#index5422
#arnetid5424
#%1119406
#!Cooking, as an every day task, is one of time consuming but essential task in home. However, designing of cooking is not very easy. Cooks design their cooking based on their empirical knowledge and such knowledge is difficult to learn without long time experience and/or hard practice under senior cooks. That is why we propose "Culinary Art Designer"--- a system that supports one to dynamically design their own recipe visually.

#*VisualHaptics: generating haptic sensation using only visual cues.
#@Keita Watanabe,Michiaki Yasumura
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5423
#arnetid5425
#%89168
#!This paper describes a new interaction technique for Graphical User Interface (GUI) which is referred to as "VisualHaptics" because it creates haptic sensations using visual cues. VisualHaptics can convey haptic cues, reminiscient of sensations received through the sense of touch, by changing the shape, movement, and size of the cursor in a GUI. For example, VisualHaptics can express "roughness" of materials by jiggling a cursor slightly.

#*Shadow agent: a new type of virtual agent.
#@Philippe Pasquier,Eunjung Han,Kirak Kim,Keechul Jung
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5424
#arnetid5426
#%5082
#%89534
#%514676
#!The shadow agent is a new type of intelligent virtual agent exploiting the metaphor of the shadow as a medium. The core of the shadow agent is a behavioral architecture inspired by the BDI (Belief, Desire and Intention) cognitive agent model. The shadow agent perceives the world through two video cameras and a microphone. Advanced computer graphics techniques are used to locate the user's feet and analyses his/her behavior. The shadow agent is embodied as an animated silhouette projected on the floor using the Everywhere Display system and is endowed with simple sonic behavior. While presented as an interactive installation, this model is thought to be a generic approach that can support many more applications, including: video games, museum guides and digital performance to name a few.

#*Development of an automatic pool trainer.
#@Lars Bo Larsen,Rene B. Jensen,Kasper Løvborg Jensen,Søren Larsen
#year2005
#confAdvances in Computer Entertainment Technology
#citation8
#index5425
#arnetid5427
#%453151
#%334061
#!This paper presents the development of an automatic pool trainer (APT). The rationale behind the user interface design is outlined and the system architecture and modules are described. The APT utilises a camera and a projector for visual in-and output to the system. In addition, the user can issue spoken commands to an interface agent acting as a personification of the system. The camera and projector are placed unobtrusively in the ceiling above the pool table and no modifications of the table or other equipment (cues, pool balls, etc.) are required by the system. The camera is used to detect the positions and movements of the pool balls as well as user hand gestures. The projector will display menus, text and graphics directly on the surface of the table. Optionally, the communication can be carried out by speech via the interface agent. Several user tests have shown high degree of user acceptance and that users quickly become familiar with the system and use it as intended. It is discussed how the concept can be extended to other games (or variants) than pool.

#*BeatBender: subsumption architecture for autonomous rhythm generation.
#@Aaron Levisohn,Philippe Pasquier
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5426
#arnetid5428
#%329237
#%90735
#!BeatBender is a computer music project that explores a new method for generating emergent rhythmic drum patterns using the subsumption architecture. Rather than explicitly coding symbolic intelligence into the system using procedural algorithms, BeatBender uses a behavior-based model to elicit emergent rhythmic output from six autonomous agents. From an artistic perspective, the rules used to define the agent behavior provide a simple but original composition language. This language allows the composer to express simple and meaningful constraints that direct the behavior of the agent-percussionists. From these simple rules emerge unexpected behavioral interactions that direct the formation of complex rhythmic output. What is striking is that these rhythmic patterns, whose complexity is beyond human grasp, are both musically interesting and aesthetically pleasing. The output from the system is evaluated using both subjective and objective criteria to assess degrees of complexity, convergence, and aesthetic interest.

#*Massive flux design for an interactive water installation: water games.
#@Narcís Parés,Jaume Durany,Anna Carreras
#year2005
#confAdvances in Computer Entertainment Technology
#citation12
#index5427
#arnetid5429
#!This paper identifies and contextualizes the limitations and problems found in interactive installations that require a massive flux of users. It then presents a set of solutions for these practical problems and shows how they have been applied to a real life installation with exceptionally good results. The application is an interactive water installation for children and their families for the international event called "Universal Forum of Cultures, Barcelona 2004".

#*Fighting with jelly: user-centered development of wireless infrastructure visualization tools for authoring location-based experiences.
#@Leif Oppermann,Boriana Koleva,Steve Benford,Matt Watkins,Rachel Jacobs
#year2008
#confAdvances in Computer Entertainment Technology
#citation1
#index5428
#arnetid5430
#%87897
#%5390
#%641414
#!Previous research has proposed that authoring tools for location-aware mobile experiences should be extended to reveal the usually hidden ubiquitous computing infrastructure to designers so that they can take account of its characteristics when placing digital content. This paper explores this idea in practice, describing how a suite of such authoring tools has evolved through an iterative process of collaborating with artists to create a location-based game. Reflections on the design process identify the need to support the mobile capture, verification and annotation of mapping data 'in the field' and the visualization and use of this data back 'in the studio' as part of a tightly integrated workflow. We also identify the need for more powerful visualizations that can deal with multiple layers of information representing different locations and networks, and that can move between abstract and detailed views of the data on demand.

#*Augmented duality: overlapping a metaverse with the real world.
#@Mark Wright,Henrik Ekeus,Richard Coyne,James Stewart,Penny Travlou,Robin Williams
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5429
#arnetid5431
#!The advent of metaverses provide exciting opportunities for augmented reality research. We have created a number of interactions between the metaverse Second Life and the real world. Camera phone image matching creates portals and triggers the metaverse to mimic real locations. Image processing, tracking, projection and 3D video sprites create varied possibilities for people and avatars to have presence in each others worlds. We argue that these multiform contacts and overlaps between multiple points in the real world and an extensive and distinct metaverse constitute a new class of augmented reality interaction. Such a system of multiple parallel social existences may point to a mass social networking phenomenon built on the overlapping of a metaverse with the real world which we call Augmented Duality.

#*Motion capture system contextualization.
#@Francois Picard,Pascal Estraillier
#year2008
#confAdvances in Computer Entertainment Technology
#citation2
#index5430
#arnetid5432
#!The notion of contextualization has been introduced in an existing motion capture system driven by the segmented silhouettes of a person filmed from several points of view. The principle is to create a dependence of each module of the process (in this case, the different modules are the motion capture itself, the adaptive background modeling and the silhouette segmentation) from the results of the preceding ones. Thus, the influence of these elements, one with the other, guides locally the different computations. So, this optimization increases the reliability of the whole process while decreasing significantly its processing time. Yet it is obvious that this concept can be applied to several aspects of a motion capture system. As a matter of fact, it is possible to contextualize the captured motion, by modeling the context in which it takes place, allowing to make strong assumptions about the following sequence of movements executed by the filmed person. Thus, by recognizing the current and the next gestures of a captured person, the system can adapt its reactions and evolve with the constantly changing comprehension of the context by the player.

#*Motion controlled mobile 3D multiplayer gaming.
#@Fadi Chehimi,Paul Coulton
#year2008
#confAdvances in Computer Entertainment Technology
#citation3
#index5431
#arnetid5433
#%789322
#%1047447
#!Due to limitations in the user interface one of the oft cited most desirable features for mobile games is that they can be played using a single button. However, games using this type of control are extremely difficult to design and thus far it has been primarily utilized for casual games. As a number of mobile phones are starting to appear with accelerometers, mobile game developers have the opportunity to investigate new interaction mechanisms and as this paper we illustrate how accelerometers can greatly simplify the interaction for 3D graphical action games. In particular we present the design and user trials for a novel motion controlled 3D Bluetooth multiplayer space game. The results show that this experience is seen as fun and much more intuitive for gamers and non-gamers alike.

#*Whadget: animation using perceptual interaction through personified hand gestures.
#@Yu Nagao,Haruka Yamaguchi,Kazuhiro Harada,Kaori Omura,Kenta Kawano,Masa Inakage
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5432
#arnetid5434
#!Our research is about interactions using personified gesture movements of a hand. Multi-touch gesture interaction has become a popular genre for usage both commercial and experimental alike, as they are being applied to various interfaces. However, those fingertip gestures are used in tool-like ways, such as tapping, dragging, and pinching digital objects. Whadget focuses on the human-like gestures our hands can perform such as by pointing the index and middle fingers downward and making strides with them, which is a form of non-tool-like and expressive use of hand. Through distinguishing various personified hand gestures, users are able to interact and play alongside with digital creatures, while those creatures treat your personified hand as a unique and independent character.

#*Evaluating SuperMusic: streaming context-aware mobile music service.
#@Arto Lehtiniemi
#year2008
#confAdvances in Computer Entertainment Technology
#citation2
#index5433
#arnetid5435
#%1047232
#%1112318
#%731875
#%495417
#!The digital music offering and consumption is rapidly increasing and more and more portable devices are offering music listening capabilities. Mobile network bandwidth is also increasing but streaming the music isn't yet common. Most of the mobile music players still rely on locally stored music. They also lack possibilities to request proper music recommendations from online music catalog. This paper presents an evaluation of SuperMusic: prototype streaming context-aware mobile music service. SuperMusic is bringing a large 200 000 track test music catalog available everywhere and including two different music recommendation methods in addition to social interaction of the users. A five week user trial was conducted with 42 users to find out the feasibility of the SuperMusic concept, to find out critical design issues and to evaluate the performance of the music recommendation methods compared to random recommendations. SuperMusic concept satisfied 97% of the users and it was seen as a potential killer application in the music domain with some modifications. The evaluation brings up many suggested design improvements including rebuilding the user interface, improving the streaming of music and the recommendation algorithms, in addition to further enhancing social interaction between the users.

#*Exploring interpersonal touch in computer games.
#@Cody Watts,Ehud Sharlin,Peter Woytiuk
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5434
#arnetid5436
#!Acts of interpersonal touch are used by couples to communicate with their partner in a simple, lightweight and emotionally significant way. In this abstract, we briefly present our motivation and initial design approach for Matchmaker -- a cooperative, romantically-themed game for tabletop computers which integrates acts of interpersonal into its game mechanics.

#*In polite company: rules of play in five Facebook games.
#@Elizabeth Losh
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5435
#arnetid5437
#%789353
#!Applications developed for the popular social network site Facebook frequently take the form of online games, but designers need to consider the conventions governing politeness, aggression, reciprocity, and obligation carefully in both online and face-to-face communities when structuring the rules of game play in the context of highly formalized and conceptualized social networks. In particular, the combination of egalitarian mechanisms for "friending" across generational and class lines and extremely hierarchical systems of ranking on leaderboards among particular cohorts can make it a challenging environment for creating sustained and synergistic game play.

#*Process of indexing and querying for theatrical texts.
#@Tahiry Andriamarozakaniaina,Véronique Gaildrat,Matthieu Pouget
#year2008
#confAdvances in Computer Entertainment Technology
#citation0
#index5436
#arnetid5438
#!We briefly present a tool, called DRAMAtexte, for indexing theatrical texts in order to emphasize the existing informations about characters, sets, and accessories. After the indexation step, a process of simple or crossed querying allows the user an easy access to the previously indexed informations.

#*Styles of play in immersive and interactive story: case studies from a gallery installation of AR Fa&ccedil;ade.
#@Steven Dow,Blair MacIntyre,Michael Mateas
#year2008
#confAdvances in Computer Entertainment Technology
#citation-1
#index5437
#arnetid5439
#%1043532
#%90966
#%57066

#*Mobile exergaming.
#@Carlos Garcia Wylie,Paul Coulton
#year2008
#confAdvances in Computer Entertainment Technology
#citation-1
#index5438
#arnetid5440
#%789398
#%236434
#!With many industrialized societies bearing the cost of an increasingly sedentary on the health of their populations there is a need to find new ways of encouraging physical activities to promote better health and well being. Exergaming is a term used to describe video games that also provide exercise as part of the experience and is thus a possible means of encouragement, particularly for an audience that may be reluctant to undertake more conventional forms of exercise. With the increasing power of mobile phones and the recent emergence of personal heart rate monitors, aimed at dedicated amateur runners, there is now a possibility of enabling Mobile Exergaming incorporating realtime physiological data along with other general fitness applications designed to promote well being. In this paper we present a novel heart rate and movement controlled Mobi