ppxscal/embedding_network huggingface dataset:
Speech user interfaces for information retrieval
Authors: Juan E. Gilbert, Yapin Zhong
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

The research proposed here concentrates on the problem of designing and developing a spoken query retrieval (SQR) system to access large document databases via voice. The main challenge is to identify and address issues related to designing an effective and efficient speech user interface (SUI), especially if the aim is to facilitate spoken queries of large document databases. Furthermore, the task of presenting large query result sets aurally should be performed such that the user's short term memory is not overloaded. In this paper, a framework allowing information retrieval to large document databases via voice is presented and findings from a research study using the framework will be discussed as well.
Runtime Software Architecture Based Software Online Evolution
Authors: Qianxiang Wang, Gang Huang, Junrong Shen, Hong Mei, Fuqing Yang
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Runtime environment of software are becoming moreand more dynamic and changeful, while pervasivecomputing and web services further this situation.Software systems are not only becoming larger, morecomplex, and also more rigid, which make it difficult toevolve software. This paper focuses on online evolution,more exactly, how to make online evolution processconvenient and smart, with help of Runtime SoftwareArchitecture (RSA). Following issues are discussed in thispaper: types of software environment changes, theincarnation of RSA, retrieval and manipulation of RSA,the relation between RSA and the runtime system, and avisual tool to show RSA, and make evolution processmore easy and intuitionist.
A Logic for the Exclusion Basis System
Authors: Samuel T. Redwine,  Jr.
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

In 2003, Morales and coauthors published the broadcast/multicast-oriented Exclusion Basis System (EBS) that imposes low server and communication loads to securely broadcast new keys to the other participants after an individual participant leaves. This paper provides a method for dealing with multiple participants leaving simultaneously. In doing so it develops a general approach to encrypting messages to restrict them to a subset of participants defined by the keys they know as described by a logical expression. Difficulties presented by and countermeasures to collusion by EBS participants are discussed.
&beta;&eta;-complete models for System F
Authors: Stefano Berardi, Chantal Berline
Venue: Mathematical Structures in Computer Science (2002)

We show that Friedman's proof of the existence of non-trivial &beta;&eta;-complete models of &lambda;&rarr; can be extended to system F. We isolate a set of conditions that are sufficient to ensure &beta;&eta;-completeness for a model of F (and &alpha;-completeness at the level of types), and we discuss which class of models we get. In particular, the model introduced in Barbanera and Berardi (1997), having as polymorphic maps exactly all possible Scott continuous maps, is &beta;&eta;-complete, and is hence the first known complete non-syntactic model of F. In order to have a suitable framework in which to express the conditions and develop the proof, we also introduce the very natural notion of &lsquo;polymax models&rsquo; of System F.
Features and formulae
Authors: Mark Johnson
Venue: Computational Linguistics (1991)

Feature structures are a representational device used in several current linguistic theories. This paper shows how these structures can be axiomatized in a decidable class of first-order logic, which can also be used to express constraints on these structures. Desirable properties, such as compactness and decidability, follow directly. Moreover, additional types of feature values, such as "set-valued" features, can be incorporated into the system simply by axiomatizing their properties.
Development of a remote-access laboratory: a dc motor control experiment
Authors: Kin Yeung, Jie Huang
Venue: Computers in Industry (2003)

This paper presents the development of a remote-access control system which allows users to perform control experiments through Internet. A dc motor control module is used as an example to illustrate our design. The system is composed of an internal distributed system and an application system linked by a data acquisition (DAQ) interface card. Web server, video server and Laboratory Virtual Instrument Engineering Workbench (LabVIEW) controller server are designed based on a client-server structure. The experiment can be accessed from http://www.acae.cuhk.edu.hk/~accl/ibc/.
Multicriteria Analysis in Telecommunications
Authors: Janusz Granat, Andrzej P. Wierzbicki
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

The paper presents an overview of multicriteria analysis techniques applied to the design oftelecommunication networks. A special module called ISAAP for interactive multicriteria analysis is adapted for this purpose. We will also present the use of multicriteria analysis for supporting strategic decisions related to negotiating interconnection agreements in telecommunications.
Interactive Open Architecture Computer Vision
Authors: Qingcang Yu, Harry H. Cheng, Wayne W. Cheng, Xiaodong Zhou
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

In this paper, design and implementation of an interactive open architecture computer vision software package called Ch OpenCV is presented. Benefiting from both Ch and OpenCV, Ch OpenCV has many salient features. It is interactive, capable of interface with binary static or dynamical C/C++ libraries, integrated with advanced numerical features and embeddable. It isespecially suitable for rapid prototyping, web-based applications, and teaching and learning about computer vision. Applications of Ch OpenCV including Web-based image processing are illustrated with examples.
Generalization of Classification Rules
Authors: Zhipeng Xie, Wynne Hsu, Mong Li Lee
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Traditional classification rules are in the form of production rules. Recent works in hybrid classification algorithms have proposed the generation of contextual rules, whereby the right-hand side of the production rule is replaced by a classifier, to achieve higher accuracy. Inthis work, we present a framework to further generalize classification rules such that the left-hand side of a production rule is expressed as a conjunction of classifiers, called space splitters. An intelligent divide-and-conquer approach is designed to construct such generalized classification rules. The construction algorithm, GCTree, is elegant, efficient and scalable. Theresulting classifier is able to achieve high predictive accuracy that outperforms Naïve Bayes and C4.5. Experiments demonstrate that GCTree is compact and stable.
Exploiting Multilevel Preconditioning Techniques in Eigenvalue Computations
Authors: Gerard L. G. Sleijpen, Fred W. Wubs
Venue: SIAM Journal on Scientific Computing (2003)

In the Davidson method, any preconditioner can be exploited for the iterative computation of eigenpairs. However, the convergence of the eigenproblem solver may be poor for a high quality preconditioner. Theoretically, this counter-intuitive phenomenon with the Davidson method is remedied by the Jacobi--Davidson approach, where the preconditioned system is restricted to appropriate subspaces of codimension one. However, it is not clear how the restricted system can be solved accurately and efficiently in the case of a good preconditioner. The obvious approach introduces instabilities that hamper convergence.In this paper, we show how incomplete decomposition based on multilevel approaches can be used in a stable way. We also show how these preconditioners can be efficiently improved when better approximations for the eigenvalue of interest become available. The additional costs for updating the preconditioners are negligible. Furthermore, our approach leads to a good initial guess for the wanted eigenpair and to high quality preconditioners for nearby eigenvalues. We illustrate our ideas for the MRILU preconditioner.
Applications considered harmful for ambient systems
Authors: Simon Dobson
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

The notion of application - a single, bounded piece of functionality presented to users - goes almost unquestioned. However in the context of highly adaptive and ambient systems it is not clear that pre-building and pre-packaging functions is useful, and it may be that a more dynamic model of providing functionality is required. We re-assess the traditional notion of packaged applications, and instead explore a dynamic model of component composition. The model is naturally adaptive in the sense that services "self-assemble" in direct response to user needs, environmental factors and information relationships. We explore some ways in which this might change the way we think about adaptability in ambient systems, and sketch some directions for the future.
An evaluation of dynamic electronic catalog models in relational database systems
Authors: Kiryoong Kim, Dongkyu Kim, Jeuk Kim, Sang-uk Park, Ighoon Lee, Sang-goo Lee, Jong-hoon Chun
Venue: Managing e-commerce and mobile computing technologies (2003)

Electronic catalogs are electronic representations about products and services in the electronic commerce environment and require diverse and flexible schemas. Although relational database systems seem to be an obvious choice for their storage, traditional designs of relational schemas do not support electronic catalogs in the most effective ways. Therefore, new models for managing diverse and flexible schemas in relational databases are required for such systems. Proposed in this paper are several models for electronic catalogs using relational tables, and an experimental evaluation of their efficiency. The results of this study can be put to practical use and are, in fact, being applied in the design of a commercial software product.
Conceptual structures and computational methods for indexing and organization of visual information
Authors: Shih-Fu Chang
Venue:  (2003)

We address the problem of automatic indexing and organization of visual information through user interaction at multiple levels. Our work focuses on the following three important areas: (1) understanding of visual content and the way users search and index it; (2) construction of flexible computational methods that learn how to automatically classify images and videos from user input at multiple levels; (3) integration of generic visual detectors in solving practical tasks in the specific domain of consumer photography. In particular, we present the following: (1) novel conceptual structures for classifying visual attributes (the Multi-Level Indexing Pyramid ); (2) a novel framework for learning structured visual detectors from user input (the Visual Apprentice); (3) a new study of human eye movements in observing images of different visual categories; (4) a new framework for the detection of non-identical duplicate consumer photographs in an interactive consumer image organization system; (5) detailed study of duplicate consumer photographs. In the Visual Apprentice (VA), first a user defines a model via a multiple-level definition hierarchy (a scene consists of objects, object-parts, etc.). Then, the user labels example images or videos based on the hierarchy (a handshake image contains two faces and a handshake) and visual features are extracted from each example. Finally, several machine learning algorithms are used to learn classifiers for different nodes of the hierarchy. The best classifiers and features are automatically selected to produce a Visual Detector (e.g., for a handshake), which is applied to new images or videos. In the human eye tracking experiments we examine variations in the way people look at images within and across different visual categories and explore ways of integrating eye tracking analysis with the VA framework. Finally, we present a novel framework for the detection of non-identical duplicate consumer images for systems that help users automatically organize their collections. Our approach is based on a multiple strategy that combines knowledge about the geometry of multiple views of the same scene, the extraction of low-level features, the detection of objects using the VA and domain knowledge.
Computing conditional probabilities in large domains by maximizing renyi's quadratic entropy
Authors: Charles Lawrence Zitnick,  III
Venue:  (2003)

In this dissertation we discuss methods for efficiently approximating conditional probabilities in large domains by maximizing the entropy of the distribution given a set of constraints. The constraints are constructed from conditional probabilities, typically of low-order, that can be accurately computed from the training data. By appropriately choosing the constraints, maximum entropy methods can balance the tradeoffs in errors due to bias and variance. Standard maximum entropy techniques are too computationally inefficient for use in large domains in which the set of variables that are being conditioned upon varies. Instead of using the standard measure of entropy first proposed by Shannon, we use a measure that lies within the family of R&eacute;nyi's entropies. If we allow our probability estimates to occasionally lie outside the range from 0 to 1, we can efficiently maximize R&eacute;nyi's quadratic entropy relative to the constraints using a set of linear equations. We develop two algorithms, the inverse probability method and recurrent linear network, for maximizing R&eacute;nyi's quadratic entropy without bounds. The algorithms produce identical results. However, depending on the type of problem, one method may be more computationally efficient than the other. We also propose an extension to the algorithms for partially enforcing the constraints based on our confidence in them. Our algorithms are tested on several applications including: collaborative filtering, image retrieval and language modeling.
Regression Clustering
Authors: Bin Zhang
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Complex distribution in real-world data is oftenmodeled by a mixture of simpler distributions. Clusteringis one of the tools to reveal the structure of this mixture.The same is true to the datasets with chosen responsevariables that people run regression on. Withoutseparating the clusters with very different responseproperties, the residue error of the regression is large.Input variable selection could also be misguided to ahigher complexity by the mixture. In RegressionClustering (RC), K (>1) regression functions are appliedto the dataset simultaneously which guide the clusteringof the dataset into K subsets each with a simplerdistribution matching its guiding function. Each functionis regressed on its own subset of data with a muchsmaller residue error. Both the regressions and theclustering optimize a common objective function. Wepresent a RC algorithm based on K-Harmonic Meansclustering algorithm and compare it with other existingRC algorithms based on K-Means and EM.
Structuring the New Product Development Pipeline
Authors: Ming Ding, Jehoshua Eliashberg
Venue: Management Science (2002)

In many new product development (NPD) situations, the development process is characterized by uncertainty, and no single development approach will necessarily lead to a successful product. To increase the likelihood of having at least one successful product, multiple approaches may be simultaneously funded at the various NPD stages. The managerial challenge is to construct ex ante an appropriate NPD pipeline by choosing the right number of approaches to be funded at each stage. This so-called pipeline problem is also present in, among others, advertising copy selection and new products test markets problems. We describe here a normative model for structuring pipelines for such situations. The optimal structure of the pipeline is driven by the cost of the development approach, its probability of survival, and the expected profitability. We illustrate the workability and implications of the model by applying it to some real-world scenarios in the pharmaceutical industry, and by comparing its normative pipeline recommendations against actual pipelines. Our results suggest that, for the cases we studied, firms tend to use narrower pipelines for their new drug development than they should, and thereby they underspend on research and development. We also present general qualitative insights for one- and two-stage NPD optimal pipeline structures.
Metrics for data warehouse quality
Authors: Manuel Serrano, Coral Calero, Mario Piattini
Venue: Effective databases for text & document management (2003)

This chapter proposes a set of metrics to assess data warehouse quality. A set of data warehouse metrics is presented, and the formal and empirical validations that have been done with them. As we consider that information is the main organizational asset, one of our primary duties should be assuring its quality. Although some interesting guidelines have been proposed for designing "good" data models for data warehouses, more objective indicators are needed. Metrics are a useful objective mechanism for improving the quality of software products and also for determining the best ways to help professionals and researchers. In this way, our goal is to elaborate a set of metrics for measuring data warehouse quality which can help designers in choosing the best option among more than one alternative design.
Concurrent computing machines and physical space-time
Authors: Philippe Matherat, Marc-Thierry Jaekel
Venue: Mathematical Structures in Computer Science (2003)

Concrete computing machines, either sequential or concurrent, rely on an intimate relationship between computation and time. We recall the general characteristic properties of physical time and of present realisations of computing systems. We emphasise the role of computing interferences, that is, the necessity of avoiding them in order to give a causal implementation to logical operations. We compare synchronous and asynchronous systems, and give a brief survey of some methods used to deal with computing interferences. Using a graphic representation, we show that synchronous and asynchronous circuits reflect the same opposition as the Newtonian and relativistic causal structures for physical space-time.
An algorithm to find a coordinate's mate
Authors: Joost Berson, Arno van den Essen
Venue: Journal of Symbolic Computation (2003)

In this paper an algorithm is given to decide if a given polynomial in two variables with coefficients in a finitely generated K-algebra is a coordinate and if so, find a mate for this polynomial.
PROMISE: peer-to-peer media streaming using CollectCast
Authors: Mohamed Hefeeda, Ahsan Habib, Boyan Botev, Dongyan Xu, Bharat Bhargava
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We present the design, implementation, and evaluation of PROMISE, a novel peer-to-peer media streaming system encompassing the key functions of peer lookup, peer-based aggregated streaming, and dynamic adaptations to network and peer conditions. Particularly, PROMISE is based on a new application level P2P service called CollectCast. CollectCast performs three main functions: (1) inferring and leveraging the underlying network topology and performance information for the selection of senders; (2) monitoring the status of peers and connections and reacting to peer/connection failure or degradation with low overhead; (3) dynamically switching active senders and standby senders, so that the collective network performance out of the active senders remains satisfactory. Based on both real-world measurement and simulation, we evaluate the performance of PROMISE, and discuss lessons learned from our experience with respect to the practicality and further optimization of PROMISE.
Spanning Trees in Dense Graphs
Authors: János Komlós, Gábor N. Sárkózy, Endre Szemerédi
Venue: Combinatorics, Probability and Computing (2001)

In this paper we prove the following almost optimal theorem. For any &delta; > 0, there exist constants c and n0 such that, if n &ge; n0, T is a tree of order n and maximum degree at most cn&#x002F;log n, and G is a graph of order n and minimum degree at least (1&#x002F;2 + &delta;)n, then T is a subgraph of G.
An approach for adaptable learning systems with respect to psychological aspects
Authors: Hildegard Rumetshofer, Wolfram Wöß
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Content delivered by multimedia-rich learning courses supported by passive media such as videos are not appropriate to guide students until the end of a learning course. Research identified the necessity to make learning systems more user-centric in order to prevent frustration and drop outs of students. For this, the presented approach integrates psychological factors in an adaptable learning system which is based on meta data enriched learning objects. An adaptation framework is introduced to show the interaction of the discussed concepts to fulfill the request for individualized learning systems.
Optimal quality of service routing and admission control using the utility model
Authors: Shahadat Khan, Kin F. Li, Eric G. Manning, Robert Watson, G. C. Shoja
Venue: Future Generation Computer Systems (2003)

Real-time multimedia applications such as video and audio streaming, video conferencing and online collaboration are becoming increasingly popular. In order to guarantee effective support of many of these applications, the Internet must provide absolute Quality of Service(QoS) guarantees for such parameters as network bandwidth and end-to-end delay by incorporating session admission control, session routing, and resource reservation. In this article, we present the Utility Model for optimal routing and admission control (RAC) of a data network supporting sessions requiring QoS guarantees. This model maps the optimal RAC problem to a Multiple-choice Multi-dimension 0-1 Knapsack Problem (MMKP), a variation of the classical 0-1 Knapsack Problem. We also present a design for an optimal RAC system based on the Utility Model. This method uses the MMKP formulation of the optimal RAC problem to provide an integrated solution of the session routing, admission control and resource allocation problems. Our experiments show that optimal RAC using the MMKP formulation (OptRAC) would provide 7-16% more revenue than the revenue provided by a traditional RAC system (TradRAC).
Time-based language models
Authors: Xiaoyan Li, W. Bruce Croft
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

We explore the relationship between time and relevance using TREC ad-hoc queries. A type of query is identified that favors very recent documents. We propose a time-based language model approach to retrieval for these queries. We show how time can be incorporated into both query-likelihood models and relevance models. These models were used for experiments comparing time-based language models to heuristic techniques for incorporating document recency in the ranking. Our results show that time-based models perform as well as or better than the best of the heuristic techniques.