ppxscal/embedding_network huggingface dataset:
Dates and times in email messages
Authors: Mia K. Stern
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

In this paper, we present a user interface which allows users to keep track of calendar related email messages. We provide visual cues for calendar related items, as well as allow users to search these for messages based on the dates and times they contain. We also provide an easier way for users to convert these calendar related messages into actual calendar entries.
Power Adaptive Broadcasting with Local Information in Ad Hoc Networks
Authors: Xiaohu Chen, Michalis Faloutsos, Srikanth V. Krishnamurthy
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

Network wide broadcasting is an energy intensive function. In this paper we propose a new method that performs transmission power adaptations based on information available locally, to reduce the overall energy consumed per broadcast. In most of the prior work on energy efficient broadcasting it is assumed that the originator of the broadcast has global networkinformation (both topology information as well as the geographical distance between nodes). This can be prohibitive in terms of the consumed overhead. In our protocol, each node attempts to tune its transmit power based on local information (of up to two hops from the transmitting node). We perform extensive simulations to evaluate our protocol. Our simulations take into account the possible loss of packets due to collision effects and the additional re-broadcasts that are necessary due to lower power transmissions.We show that our protocol achieves almost the same coverage as other non power-adaptive broadcast schemes but with a reduction of approximately 40 % in terms of the consumed power as compared to a scheme that does not adapt its power.
Speech recognition using discriminative classifiers
Authors: Aldebaro Barreto Da Rocha Klautau,  Jr.
Venue:  (2003)

This work concerns the automatic speech recognition (ASR) problem, which roughly speaking, consists in converting digitized speech into text. More specifically, we study front ends and acoustic modeling, which together with language modeling and search, constitute a typical ASR system. The main approach is to investigate how ASR can benefit from recent advances in machine learning. We study feature selection and discriminative classifiers, such as support vector machines (SVM) and other kernel methods. These kernel classifiers achieved state-of-art results in many applications, but early experiments in ASR have exposed some difficulties. One of them is that the classifier's input in ASR is a variable-length vector. A second issue is that SVM and similar classifiers are restricted to binary (two-classes) problems. Another point is that the computational cost of training kernel classifiers can be prohibitive, given that relatively large datasets are used in ASR. We address all these three issues in this work. We use a hybrid framework, where discriminative classifiers are combined to hidden Markov models (HMM), such that the system is able to cope with a variable-length input. We discuss different architectures and expose their limitations. We propose a new architecture that is suitable for continuous speech recognition. We study error-correcting output code (ECOC) and improve existing bounds on the error rate of the multiclass classifier given the average binary distortion. We also present experimental results comparing several ECOC schemes, which bring new insights on ECOC performance. The proposed hybrid framework allows for adopting a heterogeneous set of features. When using only 25 selected features per SVM, the accuracy of the heterogeneous set was higher than when using a homogeneous set of 118 features based on a standard PLP front end. We also propose an algorithm to discriminatively train Gaussian mixture models (GMM), which is based on the extended Baum-Welch used for maximum mutual information estimation (MMIE) in ASR. Using this algorithm, we train a discriminative GMM classifier (DGMM) and compare its accuracy and sparsity to the ones obtained with kernel classifiers, such as SVM and the relevance vector machine.
A note on entropy of intuitionistic fuzzy sets
Authors: Wen-Liang Hung
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

In this paper, two new formulas of fuzzy entropy induced by distances between two intuitionistic fuzzy sets are given. These entropy measures can be computed easily and give reliable results. Some examples are illustrated for the comparison with Burillo and Bustince (1996) and Szmidt and Kacprzyk (2001).
A Unified Probabilistic Framework for Web Page Scoring Systems
Authors: Michelangelo Diligenti, Marco Gori, Marco Maggini
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--The definition of efficient page ranking algorithms is becoming an important issue in the design of the query interface of Web search engines. Information flooding is a common experience especially when broad topic queries are issued. Queries containing only one or two keywords usually match a huge number of documents, while users can only afford to visit the first positions of the returned list, which do not necessarily refer to the most appropriate answers. Some successful approaches to page ranking in a hyperlinked environment, like the Web, are based on link analysis. In this paper, we propose a general probabilistic framework for Web Page Scoring Systems (WPSS), which incorporates and extends many of the relevant models proposed in the literature. In particular, we introduce scoring systems for both generic (horizontal) and focused (vertical) search engines. Whereas horizontal scoring algorithms are only based on the topology of the Web graph, vertical ranking also takes the page contents into account and are the base for focused and user adapted search interfaces. Experimental results are reported to show the properties of some of the proposed scoring systems with special emphasis on vertical search.
On-line case discussion: a methodology
Authors: Henri Isaac
Venue: Current issues in IT education (2003)

Over the past several years, a number of research studies have investigated the application of Internet technologies to the classroom. Most of the research focus on asynchronous technology such as newsgroups or Web sites, or on GSS. No research investigates the possibility of conducting on-line case discussion. As case discussion in the classroom is a key pedagogical method in an executive program, our research examines a methodology for on-line case discussion. In this chapter, the results of an experiment conducted in an executive MBA program to investigate the use of on-line case discussion is presented. First, other research to determine the distinguishing characteristics of case discussion is reviewed. Then, the pedagogical context for the experiment is provided, and the experimental method is described. Finally, the results of a satisfaction questionnaire completed by the participants in the experiment are presented. Suggestions for further research and experiments are also discussed.
Evaluating dynamic correctness properties of domain reference architectures
Authors: K. Suzanne Barber, Tom Graser, Jim Holt
Venue: Journal of Systems and Software (2003)

The goals of evaluating correctness properties of software architectures include: (1) to provide an early opportunity to correct defects in requirements embodied in the software architecture, and (2) to ensure that the software architecture is an accurate blueprint for system implementers. While evaluation of both static and dynamic correctness properties is essential to achieve these goals, this paper focuses on dynamic correctness properties, including safety, liveness, and completeness. A new software architecture evaluation tool called Arcade, developed to support the Systems Engineering Process Activities (SEPA), provides dynamic correctness property evaluations using the complementary techniques of simulation and model checking. SEPA suggests a comprehensive approach to capture and represent yet separate different types of requirements as a multi-level software architecture. One SEPA architecture level, the Domain Reference Architecture (DRA), is employed early in the analysis process to represent requirements inherent to the domain, thereby specifying a reusable blueprint in terms of what processes, data, and timing are required, rather than how a system should be implemented. Arcade provides the architect with early feedback from correctness evaluations by leveraging the formal DRA meta-model to enable model checking and generating a Execution Space visualization to aid completeness validation.
Generational Cache Management of Code Traces in Dynamic Optimization Systems
Authors: Kim Hazelwood, Michael D. Smith
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

A dynamic optimizer is a runtime software system thatgroups a program's instruction sequences into traces, optimizesthose traces, stores the optimized traces in a software-basedcode cache, and then executes the optimized code inthe code cache. To maximize performance, the vast majorityof the program's execution should occur in the codecache and not in the different aspects of the dynamic optimizationsystem. In the past, designers of dynamic optimizershave used the SPEC2000 benchmark suite to justifytheir use of simple code cache management schemes.In this paper, we show that the problem and importance ofcode cache management changes dramatically as we movefrom SPEC2000, with its relatively small number of dynamicallygenerated code traces, to large interactive Windowsapplications. We also propose and evaluate a new cachemanagement algorithm based on generational code cachesthat results in an average miss rate reduction of 18% over aunified cache, which translates into 19% fewer instructionsspent in the dynamic optimizer. The algorithm categorizescode traces based on their expected lifetimes and groupstraces with similar lifetimes together in separate storage areas.Using this algorithm, short-lived code traces can easilybe removed from a code cache without introducing fragmentationand without suffering the performance penaltiesassociated with evicting long-lived code traces.
MAIS: Multichannel Adaptive Information Systems
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

The MAIS project studies adaptivity at all levels in information systems, from application level to network and device level. Several levels of adaptivity are considered and in particular the requirements pose by multichannel information systems and system for user with disabilities are being studied.
Detecting Spatial Outliers with Multiple Attributes
Authors: Chang-Tien Lu, Dechang Chen, Yufeng Kou
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

A spatial outlier is a spatially referenced object whose non-spatial attribute values are significantly different from the values of its neighborhood. Identification of spatial outliers can lead to the discovery of unexpected, interesting, and useful spatial patterns for further analysis. Previous work in spatial outlier detection focuses on detecting spatial outliers with a single attribute. In the paper, we propose two approaches to discover spatial outliers with multiple attributes. We formulate the multi-attribute spatial outlier detection problem in a general way, provide two effective detection algorithms, and analyze their computation complexity. In addition, using a real-world census data, we demonstrate that our approaches can effectively identify local abnormality in large spatial data sets.
Documents, concepts and neural networks
Authors: Jennifer Farkas
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

In this paper we investigate the relevance of neural networks to the problem of document classification. We show that textual documents can be represented numerically in a semantically meaningful way, so that the back-propagation learning algorithm can be used to build a document classifying neural network. We show that the network can be taught to classify natural language text according to predefined specifications. The convergence properties of the prototype NeuroZ described in this paper make it clear that neural networks provide a new platform for the automatic classification of semantically similar documents and that a system can be built which distinguishes between relatively complex linguistic patterns.
Specification of Service Level Agreements: Problems, Principles and Practices
Authors: Jos J. M. Trienekens, Jacques J. Bouman, Mark Van Der Zwan
Venue: Software Quality Control (2004)

Software intensive systems (SIS) increasingly influence the ability of enterprises to be competitive in continuously changing market situations. The integration of these systems into organizations, and in particular the subsequent exploitation, maintenance and service activities, have become of utmost importance. Unfortunately the area of exploitation and operation, also known as service management, is still rather immature. Service management covers services such as performance and availability support, end-user and help desk support, education, and maintenance. One of the main concepts of service management is the Service Level Agreement (SLA). The goal of an SLA is to bridge the gap between service provider and users or customers. However, there exist many problems and unsolved questions regarding the specification and the quantification of SLAs. This paper addresses the specification of SLAs on the basis of three well-founded service management principles, respectively: &lsquo;continuity in service management,&rsquo; the pit/shell principle of a service, and the principle of specifying the quality of both a service process and a service object. Finally, the paper addresses the validation of these principles in practice.
Automated elicitation of inclusion dependencies from the source code for database transactions
Authors: Hee Beng Kuan Tan, Yuan Zhao
Venue: Journal of Software Maintenance: Research and Practice (2003)

Inclusion dependency is an important data dependency in databases. Enforcement of data dependencies is a major component in any database application. Due to the nature of software development and maintenance and the limitation of database management systems (DBMSs) in handling the enforcement of inclusion dependency, many inclusion dependencies are enforced not through the DBMS, but through the transactions that update the database. It is very difficult and time consuming to elicit (to extract or to recover) inclusion dependencies from transactions manually during the reengineering, verification and maintenance of database applications. With the use of program analysis, this paper proposes a novel approach for the automated elicitation of inclusion dependencies from the source code of transactions that update the database. The approach is based on detecting program path patterns for enforcing inclusion dependency.
Some remarks on abstract data types
Authors: Michael R. Levy
Venue: ACM SIGPLAN Notices (1977)

Some attention has been given recently to abstract data types as a powerful programming concept [1,2,3,4]. In this approach, abstract data types are viewed as sets together with the operators on these sets. One may define a data type either operationally, by writing the procedures for each operator, or denotationally, using many-sorted (heterogeneous) algebras as described for example by Guttag [1,2]. In the algebraic approach to specifying abstract data types, these two problems are raised.1) It is difficult to prove "sufficiency-completeness". That is, it is difficult to prove that the equations characterize the data structure in question.2) The algebraic presentation (that is, the set of equations defining the type) is not very readable or easy to construct.The purpose of this note is to point out that both these problems have a solution, and in fact the solutions are interrelated. These results were originally developed by Goguen et al [5], and an intuitive description of the process is given here.
System of information retrieval in XML documents
Authors: Saliha Smadhi
Venue: Effective databases for text & document management (2003)

This chapter introduces the process to retrieve units (or subdocuments) of relevant information from XML documents. For this, we use the Extensible Markup Language (XML) which is considered as a new standard for data representation and exchange on the Web. XML opens opportunities to develop a new generation of Information Retrieval System (IRS) to improve the interrogation process of document bases on the Web.Our work focuses instead on end-users who do not have expertise in the domain (like a majority of the end-users). This approach supports keyword-based searching like classical IRS and integrates structured searching with the search attributes notion. It is based on an indexing method of document tree leafs which authorize a content-oriented retrieval. The retrieval subdocuments are ranked according to their similarity with the user's query. We use a similarity measure which is a compromise between two measures: exhaustiveness and specificity.
Customers as Part of Value Webs: Towards a Framework for Webbed Customer Innovation Tools
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

As the classical corporate boundaries are beginning to blur internally as well as externally traditional value chains loose their chain attributes, and are replaced by a web of fluid and flexible relations - the value web. This paper will extend the common view of value webs by defining customers as an important part of value creation. Customer integration into innovationprocesses taking place within a value web (a process that will be coined "webbed customer innovation" in this paper) is discussed as a beneficial method to overcome some of the flaws and challenges of new product and technology development. The role of the customer is changing from a pure consumer of products or services to a coequal partner in a process of adding value - consumers are becoming co-producers and co-designers. We offer in this paper a framework for webbed customer innovation tools by introducing the concept of the customer-integration-cube (CIC). The CIC renders a systematisation of webbed customer innovation tools on the basis of specific dimensions, which were identified as most important, and serves as an originator to reveal possible lacks of webbed customer innovation attempts.
A unified security framework for networked applications
Authors: Joerg Abendroth, Christian D. Jensen
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Various security models have been proposed for different types of applications and numerous types of execution environments. These models are typically reinforced by adding code to the application, which authenticates principals, authorises operations and establishes secure communication among distributed software components (e.g., clients and servers). This code is often application and context-specific, which makes it difficult to integrate an application with other each other.In this paper we propose a new unified access control mechanism that supports most of the existing security models and offers a number of additional controls that are not normally provided by security mechanisms. Moreover, the proposed mechanism integrates well with existing programming paradigms for distributed application, e.g., client/server technology and component based programming. This means that it can be seamlessly integrated with most existing distributed applications. We have implemented the proposed mechanism in a framework, that can be instantiated to implement different security models and policies. We present a qualitative evaluation that demonstrates the framework's ability to support a wide range of security policies and a preliminary performance evaluation of the framework.
Evaluation of MPEG-7 shape descriptors against other shape descriptors
Authors: Dengsheng Zhang, Guojun Lu
Venue: Multimedia Systems (2003)

Shape is an important image feature-it is one of the primary low level image features exploited in content-based image retrieval (CBIR). There are generally two types of shape descriptors in the literature: contour-based and region-based. In MPEG-7, the curvature scale space descriptor (CSSD) and Zernike moment descriptor (ZMD) have been adopted as the contour-based shape descriptor and region-based shape descriptor, respectively. In this paper, the two shape descriptors are evaluated against other shape descriptors, and the two shape descriptors are also evaluated against each other. Standard methodology is used in the evaluation. Specifically, we use standard databases, large data sets and query sets, commonly used performance measurement and guided principles. A Java-based client-server retrieval framework has been implemented to facilitate the evaluation. Results show that Fourier descriptor (FD) outperforms CSSD, and that CSSD can be replaced by either FD or ZMD.
Scaling dcache with RCU
Authors: Paul E. McKenney, Dipankar Sarma, Maneesh Soni
Venue: Linux Journal (2004)

As the numberof processors grow, Linux either can hit a performance wall or explore new algorithms.
Is Java augmented with the RTSJ a better real-time systems implementation technology than Ada 95?
Authors: Andy Wellings
Venue: ACM SIGAda Ada Letters (2003)

This paper argues that Java (augmented by version 1.1 of the Real-Time Specification) will become superior to Ada 95 as a real-time systems implementation technology-once efficient and full implementations of version 1.1 become available. This is because the RTSJ will have an integrated set of mechanisms for representing the characteristics of real-time activities and a framework from within which those activities can be scheduled. Ada 95, in contrast, has a set of orthogonal low-level mechanisms which are invisible to the scheduler. Ada must, therefore, rise to the challenge and enhance its real-time support.
A representation for comparing simulations and computing the purpose of geometric features
Authors: Thomas F. Stahovich, Levent Burak Kara
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

We present a new representation that allows a rigid-body dynamic simulation to be described as a set of &ldquo;causal-processes.&rdquo; A causal-process is an interval of time during which both the behavior and the causes of the behavior remain qualitatively uniform. The representation consists of acyclic, directed graphs that are isomorphic to the flow of causality through the kinematic chain. Forces are the carriers of causality in this domain; thus they are central to the representation. We use this representation to compute the purposes of the geometric features on the parts of a device. To compute the purpose of a particular feature, we simulate the behavior of the device with and without the feature present. We then re-represent the two simulations as causal-processes and identify any causal-processes that exist in one simulation but not the other. Such processes are indicative of the feature's purpose. Because they are already causal descriptions of behavior, they can be directly translated into natural language descriptions of the feature's purpose. We have implemented our approach in a computer program called ExplainIT II.