ppxscal/embedding_network huggingface dataset:
Dialogue act modeling for automatic tagging and recognition of conversational speech
Authors: Andreas Stolcke, Noah Coccaro, Rebecca Bates, Paul Taylor, Carol Van Ess-Dykema, Klaus Ries, Elizabeth Shriberg, Daniel Jurafsky, Rachel Martin, Marie Meteer
Venue: Computational Linguistics (2000)

We describe a statistical approach for modeling dialogue acts in conversational speech, i.e., speech-act-like units such as STATEMENT, QUESTION, BACKCHANNEL, AGREEMENT, DISAGREEMENT, and APOLOGY. Our model detects and predicts dialogue acts based on lexical, collocational, and prosodic cues, as well as on the discourse coherence of the dialogue act sequence. The dialogue model is based on treating the discourse structure of a conversation as a hidden Markov model and the individual dialogue acts as observations emanating from the model states. Constraints on the likely sequence of dialogue acts are modeled via a dialogue act n-gram. The statistical dialogue grammar is combined with word n-grams, decision trees, and neural networks modeling the idiosyncratic lexical and prosodic manifestations of each dialogue act. We develop a probabilistic integration of speech recognition with dialogue modeling, to improve both speech recognition and dialogue act classification accuracy. Models are trained and evaluated using a large hand-labeled database of 1,155 conversations from the Switchboard corpus of spontaneous human-to-human telephone speech. We achieved good dialogue act labeling accuracy (65% based on errorful, automatically recognized words and prosody, and 71% based on word transcripts, compared to a chance baseline accuracy of 35% and human accuracy of 84%) and a small reduction in word recognition error.
Atomistic calculation of leakage current through ultra-thin metal-oxide barriers
Authors: Leonardo R. C. Fonseca, Anatoli Korkin, Alexander A. Demkov, Xiadong Zhang, Andrey Knizhnik
Venue: Microelectronic Engineering (2003)

We investigate the effect of O vacancies and B interstitial on the leakage current through monoclinic HfO2. Transport is calculated from a combination of first-principles molecular dynamics simulation using local-orbital density functional theory, and non-perturbative scattering theory. Five different defects were considered: (1) O vacancy at a three- and (2) a four-coordinated O site located in the HfO2 region, (3) O vacancy along a Hf-O-Si bond and (4) along a Si-O-Si bond at the Si/HfO2 interface, and (5) an interstitial B atom in the HfO2 region. Bulk vacancies decrease the leakage current because they act as hole, not electron traps, while an interface vacancy along the Si-O-Si bond has a minor effect on the leakage. On the other hand, a vacancy along the Hf-O-Si bond creates states in the Si band gap that strongly enhance the leakage current at a low bias. The presence of an interstitial B atom in bulk HfO2 enhances the leakage current possibly through a resonant tunneling mechanism.
Managing heterogeneous distributed computing systems: using information repositories
Authors: Gerald A. Winters, Toby J. Teorey
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

An integral part of managing heterogeneous distributed computing systems is an information repository. The ultimate goal of our research is to specify a methodology for the design, analysis, and comparison of information repositories for such systems. We first outline the general characteristics of data repositories, including requirements and data model features. Then we build an experimental prototype system to test two candidate repositories: X.500 and AFS (Andrew File System). Performance and scalability measurements are collected, analyzed, and compared for the two platforms; and some preliminary conclusions are reached.
Investigation of C60 fullerene films on polymer substrates
Authors: Yu. F. Biryulin, D. A. Syckmanov, S. S. Moliver, S. E. Orlov, S. N. Mikov, A. V. Novoselova, M. A. Yagovkina
Venue: Microelectronic Engineering (2003)

[60]Fullerene solid films deposited by vacuum sublimation on polymer substrates were studied by methods of X-ray diffraction structure analysis, IR optical transmission, and laser-excited photoluminescence (PL) spectroscopy. Mechanism of good chemical adsorption to centers with unsaturated bonds C=N and C≡N was on trial. Room-temperature PL band at 1.78 eV has its origin in interface chemical bonds or molecular complexes, that arise most probably according to Diels-Alder cyclo-addition of fullerene and polymer molecules.
Phenomena: a visual query language for continuous fields
Authors: Luca Paolino, Genoveffa Tortora, Monica Sebillo, Giuliana Vitiello, Robert Laurini
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

In the present paper we introduce a visual query language, Phenomena, able to manage continuous fields, which represent real-world events. In GIS applications, continuous fields represent phenomena related to the environment and its resources. Recently, much attention has been devoted to the field view of geographic phenomena, where the geographic world can be described by a number of variables, each measurable at any point. While objects are distinguished by their dimensions, and can be associated with points, lines, or areas, fields can be distinguished by what varies, and how smoothly. Thus, when dealing with continuous fields, a basic requirement is represented by users' capability to capture some features of a scenario, by selecting an area of interest and handling the heterogeneous events involved. Phenomena makes this task easy to implement, thanks to a quite intuitive visual representation of both continuous fields and conditions, which involve them. A peculiar feature of the visual language is the use of geometries to select portions of continuous fields, on the basis of spatial conditions. The heterogeneous nature of fields and objects is also reflected in the visualization of query results.
Graph-Based Functional Test Program Generation for Pipelined Processors
Authors: Prabhat Mishra, Nikil Dutt
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Functional verification is widely acknowledged as a major bottleneck in microprocessor design. While early work on specification driven functional test program generation has proposed several promising ideas, many challenges remain in applying them to realistic embedded processors. We present a graph coverage based functional test program generation approach for pipelined processors. The proposed methodology makes three important contributions. First, it automatically generates the graph model of the pipelinedprocessor from the speci.cation using functional abstraction. Second, it generates functional test programs based on the coverage of the pipeline behavior. Finally, the test generation time is drastically reduced due to the use of module level property checking. We applied this methodology on the DLX processor to demonstrate the usefulness of our approach.
A companion technology approach to CS1: handheld computers with concept visualization software
Authors: James Allert
Venue: ACM SIGCSE Bulletin (2003)

All incoming freshmen majoring in computer science at the University of Minnesota Duluth (UMD) are required to purchase a handheld computer with wireless capability (HP/Compaq IPAQ). The integration of these devices into the CSI curriculum was primarily achieved by authoring and distributing a number of applications written to allow students to interact with visualizations of key concepts using their handheld computers. Downloadable from the campus wireless network and used in class (large lecture and discussion) the contribution of these applications to the course was substantial. The handheld computers and accompanying visualization software served as course companions, instantly providing meaningful content and engaging instruction anywhere the student went, on campus or off. Students rated the concept visualization software as the most useful aspect of the course. The success of this initiative leads to several important conclusions about the relationship of handhelds to laptops as learning tools, the importance of visualization software and the successfull integration of companion technology into the CS1 curriculum.
Lean, light, adaptive, agile and appropriate software development: the case for a less methodical methodology
Authors: John Mendonca, Jeff Brewer
Venue: Practicing software engineering in the 21st century (2003)

Historically, the approach to sotware engineering has been based on a search for an optimal (ideal) methodology -- that is, the identification and application of a set of processes, methods and tools that can consistently and predictably lead to software development success. This chapter presents the basis for pursuing a more flexible and adaptive approach to methodology. Less methodical methodologies, under a variety of names, take a contingency-oriented approach. Because of the limitations in the nature of methodology, the high failure rate in software development, the need to develop methodology within an environmental context and the pressures of fast-paced "e-development," the authors argue that further exploration and definition of an adaptive, contingency-based approach to methodology is justified.
Uniform convergence of Cesàro means of negative order of double Walsh--Fourier series
Authors: Ushangi Goginava
Venue: Journal of Approximation Theory (2003)

In this paper we prove that if f ∈ Cw([0, 1]2) and the function f is bounded partial p- variation for some p ∈ [1, + ∞) then the double Walsh-Fourier series of the function f is uniformly (C;-α,-β) summable (α + β < 1/p, α, β > 0) in the sense of Pringsheim. If α + β ≥ 1/p then there exists a continuous function f0 of bounded partial p-variation on [0, 1]2 such that the Cesàro (C;-α,-β) means σn,m-α,-β (f0, 0, 0) of the double Walsh-Fourier series of f0 diverge over cubes.
A novel method for stemmer generation based on hidden markov models
Authors: Massimo Melucci, Nicola Orio
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

In this paper, we present a method based on Hidden Markov Models (HMMs) to generate statistical stemmers. Using a list of words as training set, the method estimates the HMM parameters which are used to calculate the most probable stem for an arbitrary word. Stemming is performed by computing the most probable path, through the HMM states, corresponding to the input word. Linguistic knowledge or a training set of manually stemmed words are not required. We describe the method and the results of the experiments carried out using standard test collections for five different languages.
Adaptive duplicate detection using learnable string similarity measures
Authors: Mikhail Bilenko, Raymond J. Mooney
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied on generic or manually tuned distance metrics for estimating the similarity of potential duplicates. In this paper, we present a framework for improving duplicate detection using trainable measures of textual similarity. We propose to employ learnable text distance functions for each database field, and show that such measures are capable of adapting to the specific notion of similarity that is appropriate for the field's domain. We present two learnable text similarity measures suitable for this task: an extended variant of learnable string edit distance, and a novel vector-space based measure that employs a Support Vector Machine (SVM) for training. Experimental results on a range of datasets show that our framework can improve duplicate detection accuracy over traditional techniques.
Finding Related Hubs and Authorities
Authors: Paul-Alexandru Chirita, Daniel Olmedilla, Wolfgang Nejdl
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

In this paper a new algorithm for finding hubs (and authorities) related to a specific Web page is presented. Various aspects have been investigated in this direction, like extensions of the HITS algorithm or modifications to the Pagerank algorithm. Our focus is mainly oriented on computing hub scores, but the formulas for authority scores are almost always analogous.
Closed set based discovery of maximal covering rules
Authors: Marzena Kryszkiewicz
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

Many knowledge discovery tasks consist in mining databases. Nevertheless, there are cases in which a user is not allowed to access the database and can deal only with a provided fraction of knowledge. Still, the user hopes to find new interesting relationships. Surprisingly, a small number of patterns can be augmented into new knowledge so considerably that its analysis may become infeasible. In the article, we offer a method of inferring the concise lossless and sound representation of association rules in the form of maximal covering rules from a concise lossless representation of all derivable patterns. The respective algorithm is offered as well.
A Network Improvement Problem Under Different Norms
Authors: J. Z. Zhang, X. G. Yang, M. C. Cai
Venue: Computational Optimization and Applications (2004)

In this paper, we first consider a network improvement problem, called vertex-to-vertices distance reduction problem. The problem is how to use a minimum cost to reduce lengths of the edges in a network so that the distances from a given vertex to all other vertices are within a given upper bound. We use l&infin;, l1 and l2 norms to measure the total modification cost respectively. Under l&infin; norm, we present a strongly polynomial algorithm to solve the problem, and under l1 or weighted l2 norm, we show that achieving an approximation ratio O(log(&verbar;V&verbar;)) is NP-hard. We also extend the results to the vertex-to-points distance reduction problem, which is to reduce the lengths of edges most economically so that the distances from a given vertex to all points on the edges of the network are within a given upper bound.
Mission-Critical Development with Open Source Software: Lessons Learned
Authors: Jeffrey S. Norris, Poul-Henning Kamp
Venue: IEEE Software (2004)

Mission operators at NASA's Jet Propulsion Laboratory use Science Activity Planners to analyze data acquired by rovers and direct their activities. In designing the SAP for the Mars Exploration Rovers project, developers relied heavily on open source components. They found that using open source software components not only helped keep the project within budget but also resulted in a more robust and flexible tool. When considering an open source component, prospective users should evaluate the project for several characteristics: maturity, longevity, and flexibility. For greatest benefit, OSS users should also build and maintain a strong working relationship with the component's developers.
Continuous demand chain management: a downstream business model for e-commerce
Authors: Merrill Warkentin, Akhilesh Bajaj
Venue: Managing e-commerce and mobile computing technologies (2003)

The demand side of supply chain management has drawn considerable research attention, with focus on disintermediation and syndication models. In this chapter, we evaluate new business models for establishing a continuous demand chain structure to streamline the logistics between the vendor and its direct consumers. The Continuous Demand Chain Management (CDCM) model of E-Commerce is one in which the physical products for sale are delivered directly to the customer without the use of a third party logistics provider, such as a common carrier, and in which the physical product may be continuously "pulled" from the seller. We present three submodels of CDCM. The CDCM Model A applies to business-to-consumer (B2C) online sellers of physical goods who own or control their own delivery vehicles, and may provide further services to extend the value proposition for the buyer. The online grocer is a typical example of businesses in this category. The CDCM Model B applies to business-to-business (B2B) sellers of physical goods, who also own a significant portion of their delivery fleet and deliver goods on demand to local distributors or business customers. Office supply E-Merchants provide an example of this model. The CDCM Model C applies to businesses that typically provide virtually instantaneous delivery of third party goods to consumers or businesses. Businesses in this category own or control their own delivery fleet and add value by delivering items within very short periods of time, usually one-hour delivery. In order to analyze these models, we conducted structured interviews with key senior managers of one representative business each in the CDCM Model A and Model B categories. We extensively surveyed recent literature on companies in the CDCM Model C category. We use the results of our study to analyze different aspects, such as revenue streams, cost structure, and operational peculiarities of businesses following the CDCM model and, finally, discuss the long-term viability of the sub models.
Flexible interface migration
Authors: Renata Bandelloni, Fabio Paternò
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

The goal of this work is to provide users immersed in a multi-platform environment with the possibility of interacting with an application while freely moving from one device to another. We describe the solution that we have developed for a service to support platform-aware runtime migration for Web applications. This allows users interacting with an application to change device and continue their interaction from the same point. The service performs the migration of the application taking into account its runtime state and adapting the application interface to the features of the target platforms. The service is optimized for applications developed through a model-based, multiple-level approach. The intelligence of the adaptive interfaces resides in the migration server, which adapts data collected at runtime from their original format to the format best fitting the features of the target platform. We also indicate how it is possible to extend this result in order to support partial migration and synergistic access, by which a part of the user interface is kept on one device during runtime and the remaining part is moved to another with different characteristics.
An affinity-based image retrieval system for multimedia authoring and presentation
Authors: Shu-Ching Chen, Mei-Ling Shyu, Na Zhao, Chengcui Zhang
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this demonstration, we present an image retrieval system to support multimedia authoring and presentation. An affinity-based mechanism, Markov Model Mediator (MMM), is used as the search engine for the system, which utilizes both the low-level image features and the learned high-level concepts via user access patterns and access frequencies. This system is one of the major components of MediaManager, a distributed multimedia management system developed by us. Both retrieval and learning facilities are supported in this system. The retrieval system also provides input information to the Multimedia Augmented Transition Network (MATN) environment for multimedia authoring and presentation.
Terascale simulation of cumulus convection on ASCI WHITE
Authors: David Stevens
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This talk presents three-dimensional numerical simulations of oceanic trade cumulus clouds underlying stratocumulus clouds. They use a case studied in a Global Energy and Water Experiment Cloud System Study (GCSS) model intercomparison that is loosely based on observed conditions during the Atlantic Trade Cumulus Experiment (ATEX). This case study is motivated by the importance of this cloud type to global cloud radiative forcing, and their role as a feeder system for deep convection in the topics. This study focuses on the sensitivity of the modeled cloud field to the domain size and the grid spacing. Domain widths from 6.5 to 20 kilometers and horizontal grid spacings ranging from 10 to 80 meters, with corresponding vertical grid spacing ranging from 5 to 40 m, are studied, involving domains with over 1000 gridpoints in each horizontal dimension.The combination of large domain size and small grid resolution (up to 2.5 billion grid-cells) provides an unprecedented perspective on this type of convection. This is in contrast to prior LES simulations which have often used domains a few kilometers wide. The larger domain size considered here is comparable to the grid resolution of a typical current mesoscale model (a similar resolution will soon be achieved in some global weather forecast models), and can better represent the potential horizontal variability achievable within a mesoscale grid cell. These simulations are made possible by massively parallel computations using 1.3 terabytes of memory and over 1000 processors.
Feedback Mechanism Validation and Path Query Messages in the Label Distribution Protocol
Authors: Ahmed Gario, J. William Atwood
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In constraint-based routing a topology database ismaintained on all participating nodes to be used incalculating a path through the network. This databasecontains a list of the links in the network and the set ofconstraints the links can meet. Since these constraintschange rapidly, the topology database will not beconsistent with respect to the real network. A feedbackmechanism was proposed by Ashwood-Smith, et al, to helpcorrect the errors in the database. It behaves like a depthfirst search, and is meant to be useable only when thedatabase sees the availability of resources to be more thanthey really are. In this mechanism, the source node canlearn from the successes or failures of its path selectionsby receiving feedback from the path it is attempting. Thereceived information is used in the subsequent pathcalculations.We validated the feedback algorithm to see how itbehaves in all database situations, and found out that thefeedback algorithm was helpful in all cases (not only whenit was optimistic). We also propose adding query messagesto make the feedback algorithm behave more like breadthfirst search. The path query messages algorithm reducesthe retry attempts in setting up a path, and also utilizes thenetwork more effectively by gathering much moreinformation about the resources.