ppxscal/embedding_network huggingface dataset:
Dual Norms and Image Decomposition Models
Authors: Jean-François Aujol, Antonin Chambolle
Venue: International Journal of Computer Vision (2005)

Following a recent work by Y. Meyer, decomposition models into a geometrical component and a textured component have recently been proposed in image processing. In such approaches, negative Sobolev norms have seemed to be useful to modelize oscillating patterns. In this paper, we compare the properties of various norms that are dual of Sobolev or Besov norms. We then propose a decomposition model which splits an image into three components: a first one containing the structure of the image, a second one the texture of the image, and a third one the noise. Our decomposition model relies on the use of three different semi-norms: the total variation for the geometrical component, a negative Sobolev norm for the texture, and a negative Besov norm for the noise. We illustrate our study with numerical examples.
Beyond computer science
Authors: James D. Herbsleb
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Computer science is necessary but not sufficient to understand and overcome the problems we face in software engineering. We need to understand not only the properties of the software itself, but also the limitations and competences humans bring to the engineering task. Rather than rely on commonsense notions, we need a deep and nuanced view of human capabilities in order to determine how to enhance them. I discuss what I regard as promising examples of cognitive and organizational theories and propose research directions to develop new ways of representing run-time behavior and ways of thinking about project coordination. I conclude with observations on creating an interdisciplinary culture.
Group divisible designs with block size four and group type gum1 with minimum m
Authors: Gennian Ge, Alan C. H. Ling
Venue: Designs, Codes and Cryptography (2005)

In this paper, we continue to investigate the spectrum for {4}-GDDs of type gum1 with m as small as possible. We determine, for each admissible pair (g, u), the minimum values of m for which a {4}-GDD of type gum1 exists with four possible exceptions.
Infomax Boosting
Authors: Siwei Lyu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In this paper, we described an efficient feature pursuit scheme for boosting. The proposed method is based on the infomax principle, which seeks optimal feature that achieves maximal mutual information with class labels. Direct feature pursuit with infomax is computationally prohibitive, so an efficient gradient ascent algorithm is further proposed, based on the quadratic mutual information, non-parametric density estimation and fast Gauss transform. The feature pursuit process is integrated into a boosting framework as infomax boosting. The performance of a face detector based on infomax boosting is reported.
An easy implementation of PiL (Prolog in Lisp)
Authors: Richard S. Wallace
Venue: Issue 85 (July 1983) (1983)

Much attention has been drawn to Prolog, the implementation of logic as a programming language. The decision of the Japanese to use Prolog as the core language of the Fifth Generation Computer [Warren, 1982] has given rise to some concern that Prolog may emerge as the chief rival to Lisp in artificial intelligence programming. I [Wallace, 1983] and others [Robinson and Sibert, 1982; Komorowski, 1982] have argued the benefits of extending Lisp to do what Prolog does. Here I present a simple procedure for implementing Prolog in Lisp (PiL), in order to demonstrate that it is easy to extend Lisp to do what Prolog does.
Building adaptable and reusable XML applications with model transformations
Authors: Ivan Kurtev, Klaas van den Berg
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

We present an approach in which the semantics of an XML language is defined by means of a transformation from an XML document model (an XML schema) to an application specific model. The application specific model implements the intended behavior of documents written in the language. A transformation is specified in a model transformation language used in the Model Driven Architecture (MDA) approach for software development. Our approach provides a better separation of three concerns found in XML applications: syntax, syntax processing logic and intended meaning of the syntax. It frees the developer of low-level syntactical details and improves the adaptability and reusability of XML applications. Declarative transformation rules and the explicit application model provide a finer control over the application parts affected by adaptations. Transformation rules and the application model for an XML language may be composed with the corresponding rules and application models defined for other XML languages. In that way we achieve reuse and composition of XML applications.
A Tree-Structured Persistence Server for Data Management of Collaborative Applications
Authors: Chien-Min Wang, Hsi-Min Chen, Gen-Cher Lee, Shun-Te Wang, Shyn-Fong Hong
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

The persistence problem of collaborative applications is an essential issue in the research of computer-supported collaborative work. A collaborative computing environment requires a simple and transparent persistence middleware to deal with complex data accesses. Therefore, in this paper, we propose a data persistence mechanism and implement a persistence server, called Tree-Structured Persistence Server (TSPS), to support the data management for collaborative applications. The TSPS allows states of collaborative applications to be stored in a tree fashion beside tables. By introducing TSPS, the problems of collaborative applications, such as persistence data access, asynchronous collaboration, latecomer, version control, etc., can be solved easily. The TSPS was originally developed to serve as a persistence layer to support a project of computer-supported collaborative work. We intend to develop our persistence mechanism for universal use so that it can be applied in more application areas.
The Applicability of Adaptive Control Theory to QoS Design: Limitations and Solutions
Authors: Keqiang Wu, David J. Lilja, Haowei Bai
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

Due to the increasing complexity, the behavior of large-scale distributed systems becomes difficult to predict. The ability of on-line identification and autotuning of adaptive control systems has made the adaptive control theoretical design an attractive approach for quality of service (QoS) guarantee. However, there is an inherent constraint in adaptive control systems, i.e. a conflict between asymptotically good control and asymptotically good parameter estimates. This paper addresses these limitations via sensitivity analysis. The simulation study demonstrates that the adaptive control theoretical design depends on the excitation signal, environment uncertainty, and a priori knowledge on the system. In addition, this paper proposes an adaptive dual control framework for mitigating these constraints in QoS design. By incorporating the existing uncertainty of the on-line prediction into the control strategy, the dual adaptive control framework optimizes the tradeoff between the control goal and the uncertainty.
Characterisation of a Novel Indexing Technique for Case-Based Reasoning
Authors: David W. Patterson, Mykola Galushka, Niall Rooney
Venue: Artificial Intelligence Review (2005)

In this paper, we investigate two novel indexing schemes called D-HS and D-HS+PSR(II) designed for use in case-based reasoning systems. D-HS is based on a matrix of cases indexed by their discretised attribute values. D-HS+PSR(II) extends D-HS by combining the matrix with an additional tree-like indexing structure to allow for solution reuse. D-HS+PSR(II)'s novelty lies in its ability to improve retrieval efficiency over time by reusing previously encountered solution patterns. Benefits include simplicity, accuracy, speed, robustness to missing values and ability to facilitate efficient real time maintenance of retrieval knowledge as the size of the case-base grows. We present empirical results from an analyses of 20 case-bases and demonstrate the techniques to be of similar competency to C4.5 yet much more efficient. Performance advantages over C4.5 are shown to be especially apparent when tested on case-bases which grow in size over time or those with missing values.
Conceptual model for investigation of the information servicing in a distributed informational-learning environment
Authors: Radi Romansky, Iva Nikolova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper examines some aspects of the information servicing in a distributed information-learning environment called DILE. The problems concerning the educational and informational resources sharing between the dispersed users and a resource discovery mechanism in the context of the distributed resource sharing environments are discussed. We present a conceptual model and its organization for investigation of information servicing and preliminary performance evaluation of simple resource discovery mechanisms based on request propagation.
Book review: An Introduction to Neural and Electronic Networks. Edited by Steven E Zornetzer, Joel L. Davis, and Clifford Lau (Academic Press)
Venue: ACM SIGART Bulletin (1990)

The volume is a collection of papers on neural networks (real and artificial) edited by staff members of the Office of Naval Research (ONR). ONR has been a major supporter of research in this area for many years and the editors have directly overseen some of the work described in this book, making them especially qualified to organize this collection. The chapters themselves are authored by talented individuals in neuroscience, engineering, physics, psychology, computer science and mathematics, making the book genuinely multidisciplinary in nature. Most of the papers are original, although a few are reprints of material previously published elsewhere.
A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions, I: The Two-Level Case
Authors: Calogero G. Zarba, Domenico Cantone, Jacob T. Schwartz
Venue: Journal of Automated Reasoning (2004)

2LS is a decidable many-sorted set-theoretic language involving one sort for elements and one sort for sets of elements. In this paper we extend 2LS with constructs for expressing monotonicity, additivity, and multiplicativity properties of set-to-set functions. We call the resulting language 2LSmf. We prove that 2LSmf is decidable by reducing the problem of determining the satisfiability of its sentences to the problem of determining the satisfiability of sentences of 2LS. Furthermore, we prove that the language 2LSmf is stably infinite with respect to the sort of elements. Therefore, by using a many-sorted version of the Nelson--Oppen combination method, 2LSmf can be combined with other languages modeling the sort of elements.
Description of the SAIC DX system as used for MUC-6
Authors: Lance A. Miller
Venue: Proceedings of the 6th conference on Message understanding (1995)

This is a very young project, operational for only a few months. The focus of the effort is data-extraction, the identification of instances of data-classes in "commercial" text -- e.g., newspapers, technical reports, business correspondence, intelligence briefs. Instances of data-classes in text are phrases which identify factual content, such as names of people or organizations, products, financial amounts, quantities, and so forth. 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
Hubble: an advanced dynamic folder system for XML
Authors: Ning Li, Joshua Hui, Hui-I Hsiao, Kevin Beyer
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Organizing large document collections for finding information easily and quickly has always been an important user requirement. This paper describes a flexible and powerful dynamic folder technology, called Hubble, which exploits XML semantics to precisely categorize XML documents into categories or folders.
Testing the media equation with children
Authors: Sonia Chiasson, Carl Gutwin
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Designers of children's technology are often more interested in user motivation than those who design systems for adults. Since children's technology often has aims such as education or practice, keeping the user engaged and interested is an important objective. The Media Equation - the idea that people respond socially to computers - shows potential for improving engagement and motivation. Studies have shown that people are more positive about both themselves and the computer when software exhibits certain social characteristics. To explore the possible value of the Media Equation as a design concept for children's software, we replicated two of the original Media Equation studies, concerning the effects of praise and team formation. Our results, however, were contrary to our expectations: we did not find evidence that children were significantly affected by social characteristics in software, and adults were influenced in only a few cases. These results raise questions about using the Media Equation as a design principle for children's software.
A Proposal of Short Proxy Signature using Pairing
Authors: Takeshi Okamoto, Atsuo Inomata, Eiji Okamoto
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper, we propose a new pairing-based proxy signature. Most remarkable point in our proposal is that our scheme realizes short signature. More concretely, the explicit proxy signature consists of only one parameter. This means that the size of signature is reduced to at least halfsize compared to previous schemes. Amount of work for proxy signature generation is also small. Although some previous schemes such as Boneh-Lynn-Shacham or Hess, need a special hash function, our scheme does not require such a function. This means that our scheme can use general hash function, e.g., SHA-1. To construct our scheme, we propose a new problem named the (extended) k-plus problem. We also propose a short signature scheme which has satisfactory properties from the point of efficiency.
Is your web page accessible?: a comparative study of methods for assessing web page accessibility for the blind
Authors: Jennifer Mankoff, Holly Fait, Tu Tran
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Web access for users with disabilities is an important goal and challenging problem for web content developers and designers. This paper presents a comparison of different methods for finding accessibility problems affecting users who are blind. Our comparison focuses on techniques that might be of use to Web developers without accessibility experience, a large and important group that represents a major source of inaccessible pages. We compare a laboratory study with blind users to an automated tool, expert review by web designers with and without a screen reader, and remote testing by blind users. Multiple developers, using a screen reader, were most consistently successful at finding most classes of problems, and tended to find about 50% of known problems. Surprisingly, a remote study with blind users was one of the least effective methods. All of the techniques, however, had different, complementary strengths and weaknesses.
What you always wanted to know about agile methods but did not dare to ask
Authors: Frank Maurer, Grigori Melnik
Venue: Proceedings of the 27th international conference on Software engineering (2005)

A fleet of emerging agile methods is both gaining popularity and generating lots of controversy. Real-world examples argue for (e.g. [4]) and against (e.g. [6]) agile methods. Several leading software engineering experts suggest that synthesizing the two (agile with traditional) may provide developers with a comprehensive spectrum of methods (e.g. [1], [2], [5]). This high-level overview tutorial provides background to understand how agile teams are trying to solve modern software development issues.
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
Authors: Derek Leonard, Vivek Rai, Dmitri Loguinov
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

To understand how high rates of churn and random departure decisions of end-users affect connectivity of P2P networks, this paper investigates resilience of random graphs to lifetime-based node failure and derives the expected delay before a user is forcefully isolated from the graph and the probability that this occurs within his/her lifetime. Our results indicate that systems with heavy-tailed lifetime distributions are more resilient than those with light-tailed (e.g., exponential) distributions and that for a given average degree, k-regular graphs exhibit the highest resilience. As a practical illustration of our results, each user in a system with n = 100 billion peers, 30-minute average lifetime, and 1-minute node-replacement delay can stay connected to the graph with probability 1 - 1 n using only 9 neighbors. This is in contrast to 37 neighbors required under previous modeling efforts. We finish the paper by showing that many P2P networks are almost surely (i.e., with probability 1-o(1)) connected if they have no isolated nodes and derive a simple model for the probability that a P2P system partitions under churn.
Guest Editors' Introduction: Identity Management
Authors: Duncan A. Buell, Ravi Sandhu
Venue: IEEE Internet Computing (2003)

The true value of identity management comes into play with business partners and consumers. The ability to federate identity across organizations while maintaining clear trust, liability, and cost responsibilities is a major challenge for enterprises as we continue to pursue efficiency and cost savings in cross-organizational business and customer-relationship processes.
University of Manitoba: description of the PIE system used for MUC-6
Authors: Dekang Lin
Venue: Proceedings of the 6th conference on Message understanding (1995)

The PIE (Principar-driven Information Extraction) system takes a different approach to the problem of information extraction from the NUBA system that was used in MUC-5. The NUBA system did not have a parser and relies on an abductive reasoner to construct the semantic relationships between domain specific concepts mentioned in a sentence. The PIE system, on the other hand, relies heavily on a principle-based broad-coverage parser, called PRINCIPAR [2, 6, 8], that we have developed over the past three years. Most of the information extracted are directly "read-off" the parser outputs by a subtree pattern-matcher, bypassing the usual step of constructing semantic representations.
Creating a Worldwide Community Security Structure Using Individually Maintained Home Computers: The e-JIKEI Network Project
Authors: Yusaku Fujii Noriaki Yoshiura Naoya Ohta
Venue: Social Science Computer Review (2005)

This article describes a project for creating a community security structure spread worldwide that uses individually maintained home computers connected to the Internet. The basic concept of the project is that every individual person watches in and around his or her house using cheap cameras as his or her eyes, personal computer as his or her brain, and Internet as his or her communication means by his or her own expense. The purpose of the project is to re-create, in the present day, a mutual watch system, which widely existed in old Japanese communities, as well as in other countries in the world, but in a much more powerful and flexible form with the aid of the information technology. In the first stage of the project, a preliminary system with the minimum necessary functions for realizing the concept has been developed, which consisted of free software and operation manuals.
Automatic generation of web portals using artificial ants
Authors: Hanene Azzag, Gilles Venturini, Christiane Guinot
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We present in this work a new model (named AntTree) based on artificial ants for document hierarchical clustering. This model is inspired from the self-assembly behavior of real ants. We have simulated this behavior to build a hierarchical tree-structured partitioning of a set of documents, according to the similarities between these documents. We have successfully compared our results to those obtained by ascending hierarchical clustering.
Robust stability of fuzzy-parameter systems
Authors: Le Hung Lan
Venue: Automation and Remote Control (2005)

The robust stability margin of fuzzy-coefficient polynomials is determined. Since the membership level of a fuzzy number is expressed by a functional interval, the method applied to analyze the robust stability of interval polynomials can be applied to solve this problem. A new method for computing the robust stability margin of fuzzy polynomials with a convenient graphic interpretation is developed on the basis of the Tsypkin-Polyak robust stability criterion and D-decomposition of interval polynomials. It can also be used to find the degree to which the membership level of every coefficient can be varied without violating the stability of a system.
CHANGES IN USER TASK STRATEGY DUE TO SYSTEM RESPONSE DELAY
Authors: Steven L. Teal, Alexander I. Rudnicky
Venue: ACM SIGCHI Bulletin (1991)

Despite recent advances in computer technologies, system response time remains an important factor in determining system usability, especially for newer and yet unperfected technologies such as speech recognition. Previous investigations of response delay have produced contradictory results. This study attempts to systematically investigate the relationship between response delay and a user's choice of task strategy. We address two questions. First, does response delay have a significant effect on user performance? Second, if response delay does affect user performance, can we define a model that describes the relationship?
Clarifying Obfuscation: Improving the Security of White-Box DES
Authors: Hamilton E. Link, William D. Neumann
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

To ensure the security of software executing on malicious hosts, as in digital rights management (DRM) applications, it is desirable to encrypt or decrypt content using white-boxencoded cryptographic algorithms in the manner of Chow et al. Such encoded algorithms must run on an adversary's machine without revealing the private key information used, despite the adversary's ability to observe and manipulate the running algorithm. We have implemented obfuscated (white-box) DES and triple-DES algorithms along the lines of Chow et al., with alterations that improve the security of the key. Our system is secure against two previously published attacks on Chow et al.'s system, and our own adaptation of a statistical bucketing attack on their system.