ppxscal/embedding_network huggingface dataset:
A modal characterization of Peirce algebras
Authors: Maarten Rijke
Venue:  (1995)

Peirce algebras combine sets, relations and various operations linking the two in a unifying setting.This note offers a modal perspective on Peirce algebras.It uses modal logic to characterize the full Peirce algebras.
Creating Emotion in Games: The Art and Craft of Emotioneering
Authors: Arthur M. Freeman
Venue:  (2003)

:David Freeman brings you the insider scoop on how to apply the emotioneering techniques he's so well known for. David's techniques are a highly sought after feature in games because they greatly increase a players level of immersion and involvement which is key to a games success in today's market. David teaches readers how to identify and apply his techniques so that they can apply these same techniques and better their games. His techniques include dialog and plot deepening, game repeatability, game and player transitioning, non-player character (NPC) arc, NPC to NPC chemistry, relationship building, among many others. Part 4 of this book is an entire section of case studies from well-known games like Grand Theft Auto III, Elite Force, American McGee's Alice, and Thief 1. Through these games, David teaches the reader how to identify specific techniques and then understand how they are applied so that the reader will be able to duplicate the skill in their games. For the highly visual elements in this book there are a 16 page 4-color section and a 4-color fold out card.
Regression Using JMP
Authors: Rudolf J. Freund, Ramon C. Littell, Lee Creighton
Venue:  (2003)

:This book is part of our continuing publishing partnership with the SAS® Books by Users Program. It fits in with our many books on regression and linear models, and uses JMP®, a software product from SAS®.
Generating Abstractions for Visualization
Authors: Steven P. Reiss, Manojit Sarkar
Venue:  (1992)

Modern technology allows us to view our programs through the visual representations that we normally use to describe and understand them. We are currently developing a new visualization system that will take advantage of today''s technology to provide a flexible interface to a wide range of program visualizations. This system will allow the programmer to define visualizations as abstractions using queries over an object-oriented database of information about program. These abstractions can then be visualized and browsed using easily defined type-based mapping and a generic filtering mechanism. This paper details the mechanisms and techniques we use to integrate the variety of information sources in a software system and to provide the programmer with a simple and convenient interface for defining abstractions.
Windows Server 2003 For Dummies, 1 edition
Authors: Ed Tittel, James Michael Stewart
Venue:  (2003)

:If you're afraid of getting all tangled up in the mysteries of Windows Server 2003, fear no more! This friendly guidebook makes it easy to install, configure, secure, and manage a network. You'll understand networking basics, find out how to use cool new Windows Server 2003 features, and become network-savvy in no time.
Optimal Proof Systems and Sparse Sets
Authors: Buhrman Harry, Fenner Steve, Fortnow Lance, Melkebeek Dieter van
Venue:  (1999)

We exhibit a relativized world where the class of sparse NP sets has no complete sets. This gives the first relativized world where no optimal proof systems exist. We also examine under what reductions the class of sparse NP sets can have complete sets. We show a close connection between these issues and reductions from sparse to tally sets. We also consider the question as to whether the sparse NP sets have a computable enumeration.
eBizSearch: a niche search engine for e-business
Authors: C. Lee Giles, Yves Petinot, Pradeep B. Teregowda, Hui Han, Steve Lawrence, Arvind Rangaswamy, Nirmal Pal
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Niche Search Engines offer an efficient alternative to traditional search engines when the results returned by general-purpose search engines do not provide a sufficient degree of relevance. By taking advantage of their domain of concentration they achieve higher relevance and offer enhanced features. We discuss a new niche search engine, eBizSearch, based on the technology of CiteSeer and dedicated to e-business and e-business documents. We present the integration of CiteSeer in the framework of eBizSearch and the process necessary to tune the whole system towards the specific area of e-business. We also discuss how using machine learning algorithms we generate metadata to make eBizSearch Open Archives compliant. eBizSearch is a publicly available service and can be reached at [3].
Multiple-valued immune network model and its simulations
Authors: Z. Tang, T. Yamaguchi, K. Tashima, O. Ishizuka, K. Tanno
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

This paper describes a new model of multiple-valued immune network based on biological immune response network. The model of multiple-valued immune network is formulated based on the analogy with the interaction between B cells and T cells in immune system. The model has a property that resembles immune response quite well. The immunity of the network is simulated and makes several experimentally testable predictions. Simulation results are given to a letter recognition application of the network and compared with binary ones. The simulations show that, beside the advantages of less categories, improved memory pattern and good memory capacity, the multiple-valued immune network produces a stronger noise immunity than binary one.
Panel on Agent-Based Electronic Commerce: Opportunities and Challenges
Authors: Jen-Yao Chung, Juhnyoung Lee
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Recently it has been witnessed that intelligent software agents are used in various e-commerce applications where dynamic and heterogeneous interactions between organizations and individuals are involved. The involvement of agents in e-commerce shows promises of re-shaping the ways business is conducted in areas such as shopping, pricing, negotiation, auction, and brokerages, to name a few. Automation brought by e-commerce agents is expected to reduce certain types of frictional costs and time incurred in trading. However, many theoretical, technological, sociological and legal aspects still need to be addressed before such opportunities become a significant reality. The purpose of this panel is to bring together researchers, practitioners, and specialists in this area to identify and explore issues, opportunities, and challenges for intelligent agent-based electronic commerce.
The Modest Software Engineer
Authors: Martyn Thomas
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

Autonomous Decentralised Systems must be dependable or they will be unhelpful, at best, and may cause serious harm. Despite major advances in theoretical computer science and software engineering, industrial practice has not kept pace and most software intensive system development projects fail. If we are to achieve the benefits promised by new systemarchitectures, industry will have to adopt much more rigorous software engineering practices, and universities will have to extend the amount of software engineering they teach, and to use such methods routinely on their own projects.This paper is dedicated to the great computer scientist and programmer, Edsger Dijkstra, who influenced a generation and who died last year.
Enforcing quality of service of distributed objects
Authors: A. Avritzer, E. J. Weyuker
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Three algorithms designed to enforce different quality of service criteria are presented, as well as empirical assessments of the algorithms for three large industrial telecommunications systems. These assessments are made in terms of the simulated performance of each system on average loads selected from operational distributions collected during beta release and field use. In addition, synthetic heavy loads designed to cause the overall CPU utilization rates to exceed 90% of capacity were run. The algorithms build on previously defined load testing algorithms, and use parameters and operational distributions computed for that purpose. This makes the quality of service enforcement algorithms particularly efficient. The primary bases for the assessment of the algorithms were the overall deviation of the response time from the average, and the fraction of service requests that were throttled from clients under varying conditions.
Cluster-Based Segmentation of Natural Scenes
Authors: Eric J. Pauwels, Greet Frederix
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

In cluster-based segmentation pixels are mapped into various feature-spaces whereupon they are subjected to a grouping-algorithm. In this paper we develop a robust and versatile non-parametric clustering algorithm that is able to handle the unbalanced and irregular clusters encountered in such segmentation- applications.The strength of our approach lies in the definition and use of two cluster-validity indices that are independent of the cluster-topology. By combining them, an excellent clustering can be identified, and experiments confirm that the associated clusters do indeed correspond to perceptually salient image-regions.
User-Centered System Decomposition: Z-Based Requirements Clustering
Authors: Pei Hsia, C. T. Hsu, David C. Kung, Lawrence B. Holder
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

Requirements clustering (RC) provides a different approach to system decomposition, by enabling a system to be partitioned into user-recognizable components, where each component can be used, almost independently to satisfy part of the user's needs. Requirements clustering is essential for a software development approach called incremental delivery (ID). A successful clustering of system requirements produces a set of useful, usable, and semi-independent clusters that can be developed and delivered to the customers in increments. This paper presents a requirements clustering process based on ER modeling, scenarios, and the formal specification notation Z.
The Procrustes Problem for Orthogonal Stiefel Matrices
Authors: A. W. Bojanczyk, A. Lutoborski
Venue:  (1996)

(This abstract contains mathematical symbols that may not reproduce well in ASCII text.) In this paper we consider the Procrustes problem on the manifold of orthogonal Stiefel matrices. That is, given matrices A epsilon R(m*k), B epsilon R(m*p), m <= p <= k, we seek the minimum of ||A BQ||2 for all matrices Q epsilon R(p*k), QTQ = I(k*k). We introduce a class of relaxation methods for generating minimizing sequences and offer a geometric interpretation of these methods. Results of numerical experiments illustrating the convergence of the methods are given.
An involution for the Gauss identity
Authors: William Y. C. Chen, Qing-Hu Hou, Alain Lascoux
Venue: Journal of Combinatorial Theory Series A (2003)

We present an involution for a classical identity on the alternate sum of the Gauss coefficients in terms of the traditional Ferrers diagram. It turns out that the refinement of our involution with restrictions on the height of Ferrers diagram implies a generalization of the Gauss identity, which is a terminating form of the q-Kummer identity. Furthermore, we extend the Gauss identity to the pth root of unity.
Learning Unions of Rectangles with Queries
Authors: Zhixiang Chen, Steve Homer
Venue:  (1993)

Abstract We investigate the efficient learnability of unions of $k$ rectangles in the discrete plane $\{1,\ldots,n\}^{2}$ with equivalence and membership queries. We exhibit a learning algorithm that learns any union of $k$ rectangles with $O(k^{3}\log n)$ queries, while the time complexity of this algorithm is bounded by $O(k^{5}\log n)$. We design our learning algorithm by finding ``corners'''' and ``edges'''' for rectangles contained in the target concept and then constructing the target concept from those ``corners'''' and ``edges''''. Our result provides a first approach to on-line learning of nontrivial subclasses of unions of intersections of halfspaces with equivalence and membership queries.
Numerical analysis of ductility in reinforced concrete beams in the CASTEM 2000
Authors: M. P. Barbosa, A. L. Gamino
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Through constitutive non-linear numerical analysis using the finite element method employing the CASTEM 2000 program, we have sought to evaluate the global and local indexes in reinforced concrete beams subject to pure and simple flexion obtained by means of the load - deflection and moment - curvature functions respectively.For beams subject to the pure flexing, we have evaluated the influence of the concrete strength, the longitudinal tension reinforced ratio, the tensile reinforcement ratio, the spacing between stirrups and the scale effect in the process of deformability of the studied beams. For the beams subject to the simple flexing, the influence of the concrete strength on the global and local ductility was evaluated.The CASTEM 2000 uses the method of the finite elements for structural analysis, the elastic- plastic model of Drucker-Prager to describe the rheology of the concrete, the elastic- plastic perfect model for the steel and the method of Newton-Raphson, commonly used for solution of non-linear systems. The reliability of the numerical results has been confirmed by comparison with experimental results obtained by a number of researchers.
A multiagent approach for musical interactive systems
Authors: Rodolfo Daniel Wulfhorst, Lauro Nakayama, Rosa Maria Vicari
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The present work proposes a model for a Multiagent System capable to deal with music. Through such a Musical Multiagent System many Computer Music problems may appear. This proposal is based on a community of agents that interact through musical events (MIDI), simulating the behavior of a musical group. The result is the implementation of an intelligent accompaniment system, where agents "listen" and interact with each other. Agents with musical cognition were able to play their instruments with synchronism and satisfy their internal goals.
A segmentation algorithm for noisy images
Authors: Ying Xu, Victor Olman, Edward C. Uberbacher
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

This paper presents a 2-D image segmentation algorithm and addresses issues related to its performance on noisy images. The algorithm segments an image by first constructing a minimum spanning tree representation of the image and then partitioning the spanning tree into subtrees representing different homogeneous regions. The spanning tree is partitioned in such a way that the sum of gray-level variations over all partitioned subtrees is minimized under the constraints that each subtree has at least a specified number of pixels and two adjacent subtrees have significantly different ``average'' gray-levels. Two types of noise, transmission errors and Gaussian additive noise, are considered and their effects on the segmentation algorithm are studied. Evaluation results have shown that the segmentation algorithm is robust in the presence of these two types of noise.
Data Sniffing " Monitoring of Machine Learning for Online Adaptive Systems
Authors: Yan Liu, Tim Menzies, Bojan Cukic
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Adaptive systems are systems whose function evolves while adapting to current environmental conditions. Due to the real-time adaptation, newly learned data have a significant impact on system behavior. When online adaptation is included in system control, anomalies could cause abrupt loss of system functionality and possibly result in a failure.In this paper we present a framework for reasoning about the online adaptation problem. We describe a machine learning tool that sniffs data and detects anomalies before they are passed to the adaptive components for learning. Anomaly detection is based on distance computation. An algorithm for framework evaluation as well as sample implementation and empirical results are discussed. The method we propose is simple and reasonably effective,thus it can be easily adopted for testing.
Caching Intermediate Results for Program Improvement
Authors: Yanhong A. Liu, Tim Teitelbaum
Venue:  (1995)

A systematic approach is given for symbolically caching intermediate results useful for deriving incremental programs from non-incremental programs. We exploit a number of program analysis and transformation techniques, centered around effective caching based on its utilization in deriving incremental programs, in order to increase the degree of incrementality not otherwise achievable by using only the return values of programs that are of direct interest. Our method can be applied straightforwardly to provide a systematic approach to program improvement via caching.
The Control Unit for a Head Mounted Operating Microscope Used for Augmented Reality Visualization in Computer Aided Sugery
Authors: Michael Figl, Wolfgang Birkfellner, Christopher Ede, Johann Hummel, Rudolf Hanel, Franz Watzinger, Felix Wanschitz, Rolf Ewers, Helmar Bergmann
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

Two main concepts of Head Mounted Displays (HMD) for augmented reality (AR) visualization exist, the optical and video-see through type. Several research groups havepursued both approaches for utilizing HMDs for computer aided surgery. While the hardware requirements for a video see through HMD to achieve acceptable time delay and frame rate seem to be enormous the clinical acceptance of such a device is doubtful from a practical point of view. Starting from previous work in displaying additional computer-generated graphics in operating microscopes, we have adapted a miniature head mounted operating microscope for AR by integrating two very small computer displays. To calibrate the projection parameters of this so called Varioscope AR we have used Tsai's Algorithm for camera calibration. Connection to a surgical navigation system was performed by defining an open interface to the control unit of the Varioscope AR. The control unit consists of a standard PC with an dual head graphics adapter to render and display the desired augmentation of the scene. We connected this control unit to an computer aided surgery (CAS) system by the TCP/IP interface. In this paper we present the control unit for the HMD and its software design.We tested two different optical tracking systems, the Flashpoint (Image Guided Technologies, Boulder, CO), which provided about 10 frames per second, and the Polaris(Northern Digital, Ontario, Can) which provided at least 30 frames per second, both with a time delay of one frame.
MIA: A Wearable Computer for Bridge Inspectors
Authors: Jirapon Sunkpho, James H. Garrett Jr, Asim Smailagic, Dan P. Siewiorek
Venue: Proceedings of the 2nd IEEE International Symposium on Wearable Computers (1998)

MIA (Mobile Inspection Assistance) is a wearable computer system that helps bridge inspectors collecting multimedia information in the field and producing the inspection report. MIA allows an inspector to fill out the inspection form, access previous inspection reports, make sketch(s) of the bridge element(s), take photograph(s), and produce the inspection report via a voice or pen interface. The first prototype of the system was developed by students in a Wearable Computer Project Design Course at Carnegie Mellon University during Spring 1998 semester. The hardware and software aspects of the system will be discussed, as well as the application of the system for inspection.
Device Physics Impact on Low Leakage, High Speed DSP Design Techniques
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The limitations of implementing low leakage schemes and their application to current state of the art components is discussed. In addition to source subthreshold leakage, both gate induced diode leakage current and tunneling gate leakage current must be comprehended. A viable leakage reduction strategy requires extensive modeling of circuits in the standby mode as well as new demands on the understanding of transistor physics. The ramifications of the physics of the behavior of transistors under conditions of high electric fields apply not only at the circuit level but can also impact the chip level system. In the coming applications of mobile electronics, understanding of this concept is critical.
eBroker: An Agent-Based Query Routing System for Distributed E-Commerce Databases
Authors: Yong Lin, Ee-Peng Lim, Wee-Keong Ng
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

With the rapid increase in the number of E-commerce web sites, Internet users are now able to purchase items from the web. Nevertheless, the large number of E-commerce web sites also brings about the problem of identifying sites that sell the desired products wanted by a potential buyer. To avoid broadcasting the same queries on products to large set of databases maintained at different E-commerce web sites, buyers can rely on a query routing system that matches the queries with the E-commerce database content. Much of the previous work in query routing has focused on databases that are document collections and queries that involve text attributes only. In this paper, we propose a new database selection technique designed for distributed E-commerce databases. The technique deals with queries that involve attributes of different data types. We have incorporated the proposed technique into an agent-based query routing system known as eBroker. The performance of e-Broker for the E-commerce databases of 5 online CD stores will be reported.
Designing Embedded Communications Software
Authors: T. A. Sridhar
Venue:  (2003)

:This book presents a thoroughly practical explanation of how system-level design and implementation choices affect the performance and maintainability of embedded communications software. It outlines the architectural requirements of software for various communications devices and explains the programming techniques (state tables, upper and lower level interfaces, configuration techniques, buffer and timer management) that enable clean, understandable implementations of complex protocols.