ppxscal/embedding_network huggingface dataset:
A classification of plane and planar 2-trees
Authors: G. Labelle, C. Lamathe, P. Leroux
Venue: Theoretical Computer Science (2003)

We present new functional equations for the species of plane and of planar (in the sense of Harary and Palmer, Graphical Enumeration, Academic Press, New York, 1973) 2-trees and some associated pointed species. We then deduce the explicit molecular expansion of these species, i.e. a classification of their structures according to their stabilizers. Therein result explicit formulas in terms of Catalan numbers for their associated generating series, including the asymmetry index series. This work is related to the enumeration of polyene hydrocarbons of molecular formula CnHn+2.
Mix&Match: a construction kit for visualization
Authors: Alex Pang, Naim Alper
Venue: Proceedings of the conference on Visualization '94 (1994)

We present an environment in which users can interactively create different visualization methods. This modular and extensible environment encapsulates most of the existing visualization algorithms. Users can easily construct new visualization methods by combining simple, fine grain building blocks. These components operate on a local subset of the data and generally either look for target features or produce visual objects. Intermediate compositions may also be used to build more complex visualizations. This environment provides a foundation for building and exploring novel visualization methods.
Employing the Intellectual Bandwidth Model to Measure Value Creation in Collaborative Environments
Authors: Christian Bach, Salvatore Belardo, Sue R. Faerman
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Nunamaker et al. [1] introduced the intellectual bandwidth (IB) model as a research tool to help decision makers to better understand value creation. Bach et al. [2] used the IB model to map value creation attributes of an information system in a conceptual real-world business case involving the diagnosis and treatment of HIV patients. This paper describes a methodological approach that enables practitioners to use the IB model to identify potential areas of value creation. It presents a pragmatic way of employing the IB model for the HIV information system and discusses possible ways to conceptualize, operationalize, and ultimately measure value creation in collaborative environments, such as those encountered in worldwide networked research environments.Technical and human aspects are inseparable factors for value creation in organizations. The technological aspects include the application of technology as well as organization concepts such as strategy. Human aspects include collaboration and the collaborative interplay between humans employing technology. With the IB model it is possible to emphasize the importance of both dimensions. This model makes pragmatic data analysis possible without requiring practitioners to deal with complicated statistical analyses. In this way research that is useful for theory and practice is possible.
A Probabilistic Active Support Vector Learning Algorithm
Authors: Pabitra Mitra, C. A. Murthy, Sankar K. Pal
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--The paper describes a probabilistic active learning strategy for support vector machine (SVM) design in large data applications. The learning strategy is motivated by the statistical query model. While most existing methods of active SVM learning query for points based on their proximity to the current separating hyperplane, the proposed method queries for a set of points according to a distribution as determined by the current separating hyperplane and a newly defined concept of an adaptive confidence factor. This enables the algorithm to have more robust and efficient learning capabilities. The confidence factor is estimated from local information using the k nearest neighbor principle. The effectiveness of the method is demonstrated on real-life data sets both in terms of generalization performance, query complexity, and training time.
An adaptable recognition system for biological and other irregular objects
Authors: J. A. Landry
Venue:  (2002)

Automated visual recognition and detection processes are becoming increasingly prevalent in almost all scientific fields and being currently implemented in many fields of industry. In most cases, systems are painstakingly designed and developed in order to detect only a single and specific object or property of an object. The objective of this project was to create a framework of development in which any object distinguishable in a two-dimensional digital image could be analyzed and subsequently detected in other images. Furthermore, as new methods are developed, they could be easily incorporated into this framework to ultimately improve the performance of the system. This thesis describes a highly adaptable, general-application visual detection system as well as several innovative methods for the description of objects without which such adaptivity would be impossible. Two-dimensional, still images are analyzed and objects of interest can be introduced to the system. Objects are then described by a variety of properties through derived attributes and stored in a database. Occurrences of these objects can then be detected in future images through comparisons to selected models. The system is fully expandable in that new properties and comparison techniques or criteria can be added as they are developed and as their need becomes apparent. The system is presented with a basic set of attribute representations and methods of comparison, and their development and origin are described in detail. The database structure is outlined and the process by which new properties and comparative methods can be added is described. Seventeen different images containing nearly two thousand separate objects were searched for various model objects and the average classification accuracy was 98.3%. In most images, more than 100 object classifications could be performed per second at an accuracy higher than 95% when no higher order analyses were required.
Concurrency in timed automata
Authors: Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini
Venue: Theoretical Computer Science (2003)

We introduce Concurrent Timed Automata (CTAs) where automata running in parallel are synchronized. We consider the subclasses of CTAs obtained by admitting, or not, diagonal clock constraints and constant updates, and by letting, or not, sequential automata to update the same clocks. We prove that such subclasses recognize the same languages but differ w.r.t. the succinctness of the models. Moreover, we distinguish between subclasses that are polynomially closed w.r.t. finite union and finite intersection, and subclasses that do not have such properties.
Random Access Scan: A solution to test power, test data volume and test time
Authors: Dong Hyun Baik, Kewal K. Saluja, Seiji Kajihara
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Adherence to serial scan is preventing the researchersfrom investigating alternative design for test techniquesthat may offer larger test benefit at the cost of somewhat higher overhead.In this paper, we investigate theuse of random access scan for simultaneous reduction oftest power, test data volume and test application time.We provide an asymmetric traveling salesman formulationof these problems to minimize random access scansand the test data.Application of our method resultsinto nearly 3x speedup in test application time, 60% reductionin test data volume and over 99% reduction inpower consumption for benchmark circuits.
On the existence of positive solutions of p-Laplacian difference equations
Authors: Zhimin He
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper, by means of fixed point theorem in a cone, the existence of positive solutions of p-Laplacian difference equations is considered.
A propositional logic for access control policy in distributed systems
Authors: Mirosław Kurkowski, Jerzy Pejaś
Venue: Artificial intelligence and security in computing systems (2003)

The goal of this paper is to pursue a proposal of the logic-based model for interpreting the basic events and properties of the distributed access control systems. We provide a convenient formal language, an axiomatic inference system, a model of computation, and semantics. We prove some important properties of this logic and show how our logical language can express some access control policies proposed so far.
Early Warning of Failures through Alarm Analysis - A Case Study in Telecom Voice Mail Systems
Authors: Dorron Levy, Ram Chillarege
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

This paper presents three principles foralarm analysis to develop early warnings of failure.The concepts are illustrated with real data and experiencedrawn from Comverse Voice Mail systemsinstalled by Telecom service providers worldwide.The case study demonstrates practicality of theapproach and insight to further advance this body ofresearch.
The EVE companion simulator
Authors: D. K. Beece, R. Damiano, G. Papp, R. Schoen
Venue: Proceedings of the conference on European design automation (1990)

This paper describes the EVE Companion Simulator, ECS, a four-valued gate level simulator which compliments a simulation methodology that uses the Engineering Verification Engine, EVE. ECS is, like EVE, a zero- and unit-delay cycle simulator, but unlike EVE, ECS is a software simulator which runs on a general purpose computer. The basic simulation paradigm of ECS is even driven to exploit latency. ECS uses the same design description interface as EVE, enabling an EVE model to be run on either the hardware accelerator or the software simulator. The major use of ECS is in the interactive debug of large models, where the model is run on the hardware accelerator, a checkpoint is taken and then loaded into the software simulator. In this paper, we give an overview of the ECS architecture and simulation technique, and describe how ECS is used in conjunction with EVE.
Hand motion gestural oscillations and multimodal discourse
Authors: Yingen Xiong, Francis Quek, David McNeill
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

To develop multimodal interfaces, one needs to understand the constraints underlying human communicative gesticulation and the kinds of features one may compute based on these underlying human characteristics.In this paper we address hand motion oscillatory gesture detection in natural speech and conversation. First, the hand motion trajectory signals are extracted from video. Second, a wavelet analysis based approach is presented to process the signals. In this approach, wavelet ridges are extracted from the responses of wavelet analysis for the hand motion trajectory signals, which can be used to characterize frequency properties of the hand motion signals. The hand motion oscillatory gestures can be extracted from these frequency properties. Finally, we relate the hand motion oscillatory gestures to the phases of speech and multimodal discourse analysis.We demonstrate the efficacy of the system on a real discourse dataset in which a subject described her action plan to an interlocutor. We extracted the oscillatory gestures from the x, y and z motion traces of both hands. We further demonstrate the power of gestural oscillation detection as a key to unlock the structure of the underlying discourse.
Enterprise Application Integration using a Component-based Architecture
Authors: Piyush Maheshwari
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Enterprise Application Integration (EAI) and Business-to-Business integration (B2B) leverage several key technologies including middleware and message brokers.However, an effective integration solution largely dependson the right combination of technologies that provide theglue between disparate applications. To build a technologyinfrastructure that can adapt to changes as the integrationarchitecture evolves is crucial. The solution to theintegration problem is forcing companies to think indistributed terms. In this paper, we show that a formula forsuccessful deployment of an integrated organization is tohave a technology infrastructure, consisting of a standardmiddleware and application server, that incorporates adistributed object infrastructure as well as platform todevelop and integrate component-based applications. Inparticular, the paper evaluates the suitability of CORBAand EJBs as the enablers of EAI, and also the suitability ofXML as a data definition and integration language.
Web Coordination Bonds: A Simple Enhancement to Web Services Infrastructure for Effective Collaboration
Authors: Sushil K. Prasad, Janaka Balasooriya
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

The Web Services need to extend beyond the basic service architecture (invoke and respond) to self-coordinating Web processes collaborating among themselves in the desired configuration as per user's application (transient to long lasting). A core set of artifacts are needed to allow these Web processes to hook together in a desired structure to enforceautomatic information flow, group constraint satisfaction, and data and control dependencies, all without any central coordinating authority. We propose Web Coordination Bonds, analogous to the chemical bonds, as a set of such core artifacts for effective collaboration among Web Services. There are two types of Web bonds: subscription bonds allow information, control and event flows whereas negotiation bonds enforce dependencies and contracts. Web bonds are simple yet powerful, and we demonstrate how they can be employed to create (model) and enforce (deploy and execute) producer-consumer and shared-resource relationships, workflow scenarios, and atomic transactions. We have developed and prototyped a middleware called System on Devices (SyD) incorporating Web bonds, and have employed it to prototype a few distributed applications which bond existing Web Services together to collaborate. Much remains to be done, including theoretical treatment of Web coordination bonds.
Planning text for advisory dialogues: capturing intentional and rhetorical information
Authors: Johanna D. Moore, Cécile L. Paris
Venue: Computational Linguistics (1993)

To participate in a dialogue a system must be capable of reasoning about its own previous utterances. Follow-up questions must be interpreted in the context of the ongoing conversation, and the system's previous contributions form part of this context. Furthermore, if a system is to be able to clarify misunderstood explanations or to elaborate on prior explanations, it must understand what it has conveyed in prior explanations. Previous approaches to generating multisentential texts have relied solely on rhetorical structuring techniques. In this paper, we argue that, to handle explanation dialogues successfully, a discourse model must include information about the intended effect of individual parts of the text on the hearer, as well as how the parts relate to one another rhetorically. We present a text planner that records this information and show how the resulting structure is used to respond appropriately to a follow-up question.
The Bayes Point Machine for computer-user frustration detection via pressuremouse
Authors: Yuan Qi, Carson Reynolds, Rosalind W. Picard
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

We mount eight pressure sensors on a computer mouse and collect mouse pressure signals from subjects who fill out web forms containing usability bugs. This approach is based on a hypothesis that subjects tend to apply excess pressure to the mouse after encountering frustrating events. We then train a Bayes Point Machine in an attempt to classify two regions of each user's behavior: mouse pressure where the form- filling process is proceeding smoothly, and mouse pressure following a usability bug. Different from current popular classifiers such as the Support Vector Machine, the Bayes Point Machine is a new classification technique rooted in the Bayesian theory. Trained with a new efficient Bayesian approximation algorithm, Expectation Propagation, the Bayes Point Machine achieves a person-dependent classification accuracy rate of 88%, which outperforms the Support Vector Machine in our experiments. The resulting system can be used for many applications in human-computer interaction including adaptive interface design.
Software Development for Small Teams: A RUP-Centric Approach
Authors: Gary Pollice, Liz Augustine, Chris Lowe, Jas Madhur
Venue:  (2003)

Do you want to improve the process on your next project? Perhaps you'd like to combine the best practices from the Rational Unified Process (RUP) and from agile methodologies (such as Extreme Programming). If so, buy this book!Software Development for Small Teams describes an entire software development project, from the initial customer contact through delivery of the software. Through a case study, it describes how one small, distributed team designed and applied a successful process. But this is not a perfect case study. The story includes what worked and what didn't, and describes how the team might change its process for the next project. The authors encourage you to assess their results and to use the lessons learned on your next project.Key topics covered include: Achieving a balance between people, process, and tools; recognizing that software development is primarily a human endeavor Using RUP as an appropriate foundation for a small project; combining RUP and agile principles to create a workable process Configuring a process that supports the project members, helping them work more effectively Adjusting the process over the course of the project Selecting tools to support a small, distributed team Dealing effectively with your customerWhether you're a project lead, a programmer, or another member of the development team, this book will show you how to tap the strengths of specific processes to dramatically increase the productivity of your team.
Spectral Characterizations for Hermitian Centrosymmetric K-Matrices and Hermitian Skew-Centrosymmetric K-Matrices
Authors: Mark Yasuda
Venue: SIAM Journal on Matrix Analysis and Applications (2003)

Let A and K be real symmetric matrices with K2=I. In the article "A spectral characterization of generalized real symmetric centrosymmetric and generalized real symmetric skew-centrosymmetric matrices" [D. Tao and M. Yasuda, SIAM J. Matrix Anal. Appl., 23 (2002), pp. 885--895], it was shown that (1) AK=KA if and only if the spectrum of A equals the spectrum of KA up to sign and (2) AK=-KA if and only if the spectrum of A equals the spectrum of KA multiplied by i. This paper extends these spectral characterizations from the case of real symmetric matrices to that of self-adjoint compact linear operators in a complex Hilbert space. Some consequences of these results are mentioned, including an application that describes the correspondence between the spectrum of a real symmetric Toeplitz matrix T and its associated Hankel matrix JT, where J is the so-called exchange matrix.
Web Service Selection in Virtual Communities
Authors: Aldo de Moor, Willem-Jan van den Heuvel
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Virtual communities increasingly make use of standard Internet-enabled web services to support their collaborative activities. Such web services need to offer the right amount of functionality to meet community requirements. However, both requirements and enabling services are continuously in flux. A critical challenge therefore is that the community canefficiently ensure that web service changes are both technically feasible and socially acceptable.In this paper, we outline a selection approach for virtual communities that takes into account both the feasibility and the acceptability of web services. To this purpose, we adopt a semiotic view on the selection process, showing that for the adequate selection of web services three subprocesses are required: (1) syntactic discovery, (2) semantic matching, and (3) pragmatic interpretation. We then present a meta-model of web service selection support that is grounded in this view. This model can be used to detect gaps in web service selection support. This knowledge is essential for the construction of better selection support methodologies. We apply the meta-model to analyze a case on a courseware development community.
Facial expression recognition from video sequences: temporal and static modeling
Authors: Ira Cohen, Nicu Sebe, Ashutosh Garg, Lawrence S. Chen, Thomas S. Huang
Venue: Computer Vision and Image Understanding (2003)

The most expressive way humans display emotions is through facial expressions. In this work we report on several advances we have made in building a system for classification of facial expressions from continuous video input. We introduce and test different Bayesian network classifiers for classifying expressions from video, focusing on changes in distribution assumptions, and feature dependency structures. In particular we use Naive-Bayes classifiers and change the distribution from Gaussian to Cauchy, and use Gaussian Tree-Augmented Naive Bayes (TAN) classifiers to learn the dependencies among different facial motion features. We also introduce a facial expression recognition from live video input using temporal cues. We exploit the existing methods and propose a new architecture of hidden Markov models (HMMs) for automatically segmenting and recognizing human facial expression from video sequences. The architecture performs both segmentation and recognition of the facial expressions automatically using a multi-level architecture composed of an HMM layer and a Markov model layer. We explore both person-dependent and person-independent recognition of expressions and compare the different methods.
Evaluating the markov assumption for web usage mining
Authors: Søren Jespersen, Torben Bach Pedersen, Jesper Thorhauge
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

Web usage mining concerns the discovery of common browsing patterns, i.e., pages requested in sequence, from web logs. To cope with the enormous amounts of data, several aggregated structures based on statistical models of web surfing have appeared, e.g., the Hypertext Probabilistic Gramma(HPG) model [2]. These techniques typically rely on the Markov assumption with history depth n, i.e., it is assumed that the next requested page is only dependent on the last n pages visited. This is not always valid, i.e. false browsing patterns may be discovered. However, to our knowledge there has been no systematic study of the validity of the Markov assumption wrt. web usage mining and the resulting quality of the mined browsing patterns.In this paper we systematically investigate the quality of browsing patterns mined from structures based on the Markov assumption. Formal measures of quality, based on the closeness of the mined patterns to the true traversal patterns, are defined and an extensive experimental evaluation is performed, based on two substantial real-world data sets. The results indicate that a large number of rules must be considered to achieve high quality, that long rules are generally more distorted than shorter rules and that the model yield knowledge of a higher quality when applied to more random usage patterns. Thus we conclude that Markov-based structures for web usage mining are best suited for tasks demanding less accuracy such as pre-fetching, personalization, and targeted ads.