ppxscal/embedding_network huggingface dataset:
Review of "Synthetic Creatures with Learning and Reactive Behaviors by Alex J. Champandard", New Riders Publishing, 2004, 768 pp.
Authors: Georgios N. Yannakakis
Venue: Computers in Entertainment (CIE) (2005)

This book is the first attempt to bridge the current gap between artificial intelligence (AI) research in academia and computer-game development in industry. The book bridges the gap successfully. The author uses FEAR (Flexible Embodied Animat 'Rchitecture), which is an open-source project integrated with a commercial first-person shooter (FPS) game, to analyze, implement, test, and evaluate various AI approaches to various behavioral tasks for nonplayer characters (NPCs). The tasks start with low-level obstacle-avoidance and progress to high-level character emotions; each task with its own part in the book.] Each part is structured into chapters and follows a standard schema: the problem is analyzed, potential mechanisms (including AI) are discussed informally, details of the selected approach are outlined formally, an implementation is provided, the approach is evaluated (primarily visually) through simulation, and finally the advantages and disadvantages of the proposed approach are discussed.
A framework for scalable delivery of digitized spaces
Authors: David Gotz, Ketan Mayer-Patel
Venue: International Journal on Digital Libraries (2005)

We present a framework for scalable delivery of digitized environments. Today&#x2019;s digital museums distribute images, text, sounds, and videos. Our work targets the distribution of a more advanced media type that allows users to independently and interactively explore digitized spaces. We describe a multidimensional and multiresolutional representation that maps directly to a set of communication channels. Clients receive data by subscribing to and unsubscribing from these channels. Client adaptation to current application and network conditions is performed by managing a working set of channels. This mechanism enables distribution of digitized environments to large groups of independent digital museum visitors.
Bisimilarity for the Region Calculus
Authors: Simon Helsen
Venue: Higher-Order and Symbolic Computation (2004)

A region calculus is a programming language calculus with explicit instrumentation for memory management. Every value is annotated with a region in which it is stored and regions are allocated and deallocated in a stack-like fashion. The annotations can be statically inferred by a type and effect system, making a region calculus suitable as an intermediate language for a compiler of statically typed programming languages.Although a lot of attention has been paid to type soundness properties of different flavors of region calculi, it seems that little effort has been made to develop a semantic framework. In this paper, we present a theory based on bisimulation, which serves as a coinductive proof principle for showing equivalences of polymorphically region-annotated terms. Our notion of bisimilarity is reminiscent of open bisimilarity for the ¿-calculus and we prove it sound and complete with respect to Morris-style contextual equivalence.As an application, we formulate a syntactic equational theory, which is used elsewhere to prove the soundness of a specializer based on region inference. We use our bisimulation framework to show that the equational theory is sound with respect to contextual equivalence.
Applications software programming
Authors: James T. Streib, James W. Chaffee
Venue: Journal of Computing Sciences in Colleges (2004)

The purpose of this paper is to consider various aspects of applications software programming. In particular, programming in Visual Basic for Applications (VBA) is examined and various samples of code are given. The implementation of a service course for students not majoring in either computer science or management information systems is discussed. Lastly, the results of an informal survey are presented as part of the conclusion.
Comparative study of numerical explicit time integration algorithms
Authors: Gérard Rio, Anthony Soive, Vincent Grolleau
Venue: Advances in Engineering Software (2005)

The aim of the present research is to make a comparative study of numerical explicit time integration algorithms used in the domain of shock and impact. Numerical simulation of such problems, with explicit algorithms for time integration, involves minute time steps for reasons of stability. Consequently, due to spatial discretization, very high numerical frequencies are found in the final solution in displacement or stress. Usually, the high frequencies and mode shapes of the spatially discretized equations do not accurately represent the behavior of the original problem. It has been proven that algorithms such as these of Chung-Lee, Zhai, HHT, Tchamwa-Wielgosz and the central difference method, are useful in solving problems including high-speed phenomena. The consistency, the different regions of stability, but also the ability of each numerical scheme to smooth very high frequencies are compared. Finally, the integration schemes are implemented in the HEREZH++ finite element code developed at the LG2M laboratory [http//www-lg2m.univ-ubs.fr]. For some simple problems, the solutions obtained from HEREZH++ with these different schemes are compared with continuous and discretized theoretical solutions. Conclusions are independent of the problems and can be applied to more complex geometry. For instance, following these simulations, it seems that the Tchamwa-Wielgosz and the Chung-Lee algorithms are particularly efficient in smoothing the highest frequencies.
Collective efficacy as a measure of community
Authors: John M. Carroll, Mary Beth Rosson, Jingying Zhou
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

As human-computer interaction increasingly focuses on mediated interactions among groups of individuals, there is a need to develop techniques for measurement and analysis of groups that have been scoped at the level of the group. Bandura's construct of perceived self-efficacy has been used to understand individual behavior as a function of domain-specific beliefs about personal capacities. The construct of collective efficacy extends self-efficacy to organizations and groups, referring to beliefs about collective capacities in specific domains. We describe the development and refinement of a collective efficacy scale, the factor analysis of the construct, and its external validation in path models of community-oriented attitudes, beliefs, and behaviors.
"A conjecture in numerical linear algebra"
Authors: I. Farkas
Venue: ACM SIGNUM Newsletter (1976)

In [1] and [2] we proposed a conjecture in numerical linear algebra and here we would like to clarify an implicit assumption in our note. Throughout we meant by a matrix always a <u>dense</u> matrix. It was clear to us that for real symmetric band matrices the "chasing" strategy proposed by Rutishauser [3] is superior to the unmodified form of tridiagonalization. It has also been pointed out [4] that for very sparse matrices the Givens' method can take more advantage of the sparsity than Householder's method. At present intensive research is being done in the field of very large matrix problems [5] and here new approach is necessary. In spite of the development of a fast Givens transformation [6], [7], we still feel that our conjecture may hold true for dense matrices, because we request minimum of operations and optimal numerical properties.
Whitney constants and approximation of m-quasi-linear forms by m-linear forms
Authors: I. A. Vestfrid
Venue: Journal of Approximation Theory (2005)

We discuss some relations between Whitney constants wm(BX, Y) for bounded functions from, the unit ball of a real normed space X into another real normed space Y. In particular, we generalize a result of Tsar'kov that wml(BX, Y) ∼ n(m-1)/2 for X =l2n and for any Y to any n-dimensional X (here wml denotes linearized Whitney constant).
A Methodology for Long Time Constant Log-Domain Filters in CMOS
Authors: Patrick Shoemaker
Venue: Analog Integrated Circuits and Signal Processing (2005)

A simple methodology for implementation of low-order, current-mode, log-domain filters in CMOS technology is presented. The key transistors in the circuit are operated in weak inversion and in contrast with previous approaches may pass into the triode regime. The concept is particularly suited to implementation in silicon-on-insulator technology, because dielectric isolation of the transistors eliminates leakage currents, and because influence of the body effect on circuit function is limited. Very long time constants, on the order of 1 s or more, are obtainable. A simple elaboration of the basic unit circuit allows the time constant to be controlled by a bias current.
Matroid Matching Via Mixed Skew-Symmetric Matrices
Authors: James Geelen, Satoru Iwata
Venue: Combinatorica (2005)

Tutte associates a V by V skew-symmetric matrix T, having indeterminate entries, with a graph G=(V,E). This matrix, called the Tutte matrix, has rank exactly twice the size of a maximum cardinality matching of G. Thus, to find the size of a maximum matching it suffices to compute the rank of T. We consider the more general problem of computing the rank of T + K where K is a real V by V skew-symmetric matrix. This modest generalization of the matching problem contains the linear matroid matching problem and, more generally, the linear delta-matroid parity problem. We present a tight upper bound on the rank of T + K by decomposing T + K into a sum of matrices whose ranks are easy to compute.
Mobile Web Services Discovery and Invocation Through Auto-Generation of Abstract Multimodal Interface
Authors: Robert Steele, Khaled Khankan, Tharam Dillon
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

With the advancement in wireless technologies in general and mobile devices capabilities in particular, ubiquitous access of mobile Web services continues to be in the focal point of research. This paper presents a novel architecture for discovery and invocation of mobile Web services through automatically generated abstract multimodal user interface for these services. A prototype has been developed to auto-generate user interface based on XForms and VoiceXml from a WDSL file. In this proposed architecture, the discovered Web services are invoked dynamically with a transparent mechanism. Moreover, the proposed architecture is a component-based architecture that provides its core functionality as Web services.
High Performance of Artificial Neural Network for Resolving Ambiguous Nucleotide Problem
Authors: Kitiporn Plaimas, Chidchanok Lursinsap, Apichat Suratanee
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

The information of DNA sequence data - the string of symbol A, C, G, and T - is used to construct a resolving ambiguous symbol method on DNA sequence. The relative position that means nucleotides and their positions relating to their neighboring nucleotides of each strain is the feature extraction from the sequence for learning and prediction process by a neural network for each symbol. To recognize of all possible feature vectors, the large training set was divided into data subsets by the rule that feature vectors of each set has the same group of feature values in the key feature and the size of each set is small enough to produce the completely recognition network. As a result of the rule, the recognition network is consist of sub networks for each data subset. They can be simultaneously trained. Using this approach, we can obtain many sub optimal neural networks in place of one unacceptable network and can reduce the training-time and facilitate the recognition of large data sets.
Architectural modifications to deployed software
Authors: A. S. Klusener, R. Lämmel, C. Verhoef
Venue: Science of Computer Programming (2005)

We discuss the nuts and bolts of industrial large-scale software modification projects. These projects become necessary when system owners of deployed systems hit architectural barriers. The mastery of such projects is key to the extension of the best-before date of business-critical software assets. Our discussion comprises the process for problem analysis, pricing and contracting for such projects, design and implementation of tools for code exploration and code modification, as well as details of service delivery. We illustrate these concerns by way of a real-world example where a deployed management information system required an invasive modification to make the system fit for future use. The chosen project is particularly suited for a complete treatise because of its size (just 90,000 LOC), and the nature of the relevant architectural modification (namely, a form of data expansion). We share the lessons that we learned in this and other architectural modification projects.
Mobile Intelligent Agent Technologies to Support VoIP Seamless Mobility
Authors: Chen-Han Lin, Jen-Shun Yang, Ko-Ching Wu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Seamless handover is required in VoIP mobility services in order to limit the period of the service disruption experienced by a MN when moving between different IP subnets. Our seamless handover method involves sending multiple copies of the mobile agents to potential MN locations of movement for early authentication. Both VPN and multi-homing techniques play an important role in the reduction of the handover delay and packet loss ratio. The implementation aspect of seamless handover in Mobile Agent based VoIP services is provided. In the performance analyses, a comparison in the handover delay is made between the standard Mobile IP mobility and our method.
Review of "Balancing Agility and Discipline: A Guide for the Perplexed by Barry Boehm and Richard Turner"; Addison Wesley, 2004, ISBN 0-321-18612-5
Authors: Charles Beasley
Venue: ACM SIGSOFT Software Engineering Notes (2005)

Balancing Agility and Discipline: A Guide for the Perplexed is a book written for the developers who live it the world caught between two conflicting approaches to software development, the Agile method and the Traditional methods. This book breaks out the basic reading to the main text and puts the technical material in the appendices. It also provides "fast track" summaries, side bar discussions, and margin notes. The book overall is organized to define the boundaries of the two methods followed by a chapter discussing where each method work the best. The next chapter covers the way a day might go using each method followed by a chapter describing two project cases. Chapter five gives a way to determine how to choose one method over the other with the final chapter giving you a summery of the material. Discussion, technical background and notes follow this.
An interconnected success factor approach for service functional in Malaysian electronic government
Authors: Trevor Wood-Harper, Othman Ibrahim, Norafida Ithnin
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Electronic Government initiatives have often sounded very promising but been difficult to implement. However, many countries are continuing to face the challenge of implementing Electronic Government successfully. Therefore, investigation of factors that contribute to the success of Electronic Government services is needed. In the case of Malaysian Electronic Government, the aim of implementation was to serve the public and government officials via multiple channel service access led by technological advancement, to create integrated service systems that could be used effectively for internal government processes and external government service delivery. This paper discusses an example of success factors in Malaysian Electronic Government services delivery through the E-Services application.
An efficient data structure for branch-and-bound algorithm
Authors: Wu Jigang, Thambipillai Srikanthan
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

An efficient data structure called cube heap is presented in this paper to reduce both the time complexity and data movements of the branch-and-bound (B&B) algorithm. We show that the time complexity of B&B algorithm is reduced from O(m log log m + h log m) to O(m + h log h) and the number of the data movements is reduced from O(m log m) to O(m + h log h), where m is the number of the active nodes and h is the number of expanded nodes in the solution tree.
AN OBJECT USER INTERFACE FOR AN ENVIRONMENTAL INFORMATION SYSTEM
Authors: Ken Yap
Venue: ACM SIGCHI Bulletin (1991)

The OUI is a graphical user interface developed for our Environmental Decision Support System project. The EDSS is a sophisticated browser and editor for environmental databases. Data held includes geographic data, text documents and pictures.
Toward wearable social networking with iBand
Authors: Marije Kanis, Niall Winters, Stefan Agamanolis, Anna Gavin, Cian Cullinan
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The iBand is a wearable bracelet-like device that exchanges information about its users and their relationships. This exchange happens during the common gesture of the handshake, which is detected by the device. As such, iBand seeks to explore potential applications at the intersection of social networking and ubiquitous computing. In this paper, we discuss the iBand technology and feedback from an initial study in which 11 devices were used at two different social networking events. The results suggest that control over personal information is an ongoing issue, but they also highlight the possibility for wearable devices to enable the creation of a set of invented techno-gestures with different affordances and constraints that might be more appropriate for certain social interaction applications.
Omnidirectional Vision and Inertial Clues for Robot Navigation
Authors: Irem Stratmann, Erik Solda
Venue: Journal of Robotic Systems (2004)

The structural features inherent in the visual motion field of a mobile robot contain useful clues about its navigation. The combination of these visual clues and additional inertial sensor information may allow reliable detection of the navigation direction for a mobile robot and also the independent motion that might be present in the 3D scene. The motion field, which is the 2D projection of the 3D scene variations induced by the camera-robot system, is estimated through optical flow calculations. The singular points of the global optical flow field of omnidirectional image sequences indicate the translational direction of the robot as well as the deviation from its planned path. It is also possible to detect motion patterns of near obstacles or independently moving objects of the scene. In this paper, we introduce the analysis of the intrinsic features of the omnidirectional motion fields, in combination with gyroscopical information, and give some examples of this preliminary analysis. &copy; 2004 Wiley Periodicals, Inc.
Secrets, hot spots, and generalization: preparing students to design software families
Authors: H. Conrad Cunningham, Pallavi Tadepalli, Yi Liu
Venue: Journal of Computing Sciences in Colleges (2005)

An important technique for coping with the increasing size, variability, and complexity of software systems is the construction of software families. This technique exploits the common properties of a group of related software systems to achieve reuse of design or code. Computing science students should be introduced to the concept of software families and the methods for constructing them. This paper describes a course on the principles and practice of developing software families. It outlines the structure of the course and evaluates it from the perspective of the students and the instructor.
A hardware architecture for multi-resolution volume rendering
Authors: G. Wetekam, D. Staneker, U. Kanus, M. Wand
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2005)

In this paper we propose a hardware accelerated ray-casting architecture for multi-resolution volumetric datasets. The architecture is targeted at rendering very large datasets with limited voxel memory resources for both cases where the working set of a frame does or does not fit into the voxel memory. We describe the multi-resolution model used to organize the volume data, especially the wavelet based compression scheme. An efficient hardware implementation of the wavelet decompression is presented and the considerations for volume memory management are discussed. By incorporating the wavelet decompression in hardware a multiple of the decompression bandwidth compared to a PC can be achieved We also show that the impact of our multi-resolution scheme on the actual ray-casting pipeline is minimal.
Designing human friendly human interaction proofs (HIPs)
Authors: Kumar Chellapilla, Kevin Larson, Patrice Simard, Mary Czerwinski
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

HIPs, or Human Interactive Proofs, are challenges meant to be easily solved by humans, while remaining too hard to be economically solved by computers. HIPs are increasingly used to protect services against automatic script attacks. To be effective, a HIP must be difficult enough to discourage script attacks by raising the computation and/or development cost of breaking the HIP to an unprofitable level. At the same time, the HIP must be easy enough to solve in order to not discourage humans from using the service. Early HIP designs have successfully met these criteria [1]. However, the growing sophistication of attackers and correspondingly increasing profit incentives have rendered most of the currently deployed HIPs vulnerable to attack [2,7,12]. Yet, most companies have been reluctant to increase the difficulty of their HIPs for fear of making them too complex or unappealing to humans. The purpose of this study is to find the visual distortions that are most effective at foiling computer attacks without hindering humans. The contribution of this research is that we discovered that 1) automatically generating HIPs by varying particular distortion parameters renders HIPs that are too easy for computer hackers to break, yet humans still have difficulty recognizing them, and 2) it is possible to build segmentation-based HIPs that are extremely difficult and expensive for computers to solve, while remaining relatively easy for humans.