ppxscal/embedding_network huggingface dataset:
Robust multiresolution computation of optical flow
Authors: E. P. Ong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper presents an algorithm that provides good estimates of the optical flow at motion discontinuities and occlusion regions based on the least-median-squares robust estimator. The use of a multiresolution scheme enables optical flow to be computed for objects with large motions. A movable overlapping neighbourhood strategy eliminates block-effects and also deals with cases of the local neighbourhood straddling regions of two or three motions. Results for both synthetic and real image sequences are presented. A quantitive comparison with the matching technique of Anandan (1989) and the differential technique of Odobez and Bouthemy (see Proceedings of 7th European Conference on Signal Processing, 1994) shows that the proposed algorithm gives much lower angular and absolute errors.
Hybrid, Incremental Assertion-Based Verification for TLM Design Flows
Authors: Nicola Bombieri, Franco Fummi, Graziano Pravadelli, Andrea Fedeli
Venue: IEEE Design Test (2007)

Transaction-level modeling (TLM) has been proposed as the leading strategy to address the ever-increasing complexity of digital systems. However, its introduction brings a new challenge for designers and verification engineers. Because no tools are available to automatically derive an RTL implementation from a transaction-level (TL) design, manual refinements are necessary. This article presents a hybrid, incremental assertion-based verification (ABV) methodology to check the correctness of the TL-to-RTL refinement. The methodology relies on reusing assertions and already-checked code and is guided by assertion coverage metrics.
Instantaneous frequency estimation: Bayesian approaches versus reassignment-application to gravitational waves
Authors: P. Duvaut
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Three new methods of instantaneous frequency estimation are introduced and compared in view of characterizing gravitational waves. Two methods are Bayesian and can be formulated as solutions of an ill-posed inverse problem with two different stochastic regularizations. Using either a state-space model for the time-frequency data or a compound non-uniform Bernoulli-Gauss model for the instantaneous frequency. The third method uses a reassignment technique applied to a spectrogram. In each case, averages based on different windowings permit to enhance the signal-to-noise ratio, leading to accurate results even below 0 dB.
Predictive performance modelling of parallel component compositions
Authors: Lei Zhao, Stephen A. Jarvis
Venue: Cluster Computing (2007)

Large-scale scientific computing applications frequently make use of closely-coupled distributed parallel components. The performance of such applications is therefore dependent on the component parts and their interaction at run-time. This paper describes a methodology for predictive performance modelling and evaluation of parallel applications composed of multiple interacting components. In this paper, the fundamental steps and required operations involved in the modelling and evaluation process are identified--including component decomposition, component model combination, M×N communication modelling, dataflow analysis and overall performance evaluation. A case study is presented to illustrate the modelling process and the methodology is verified through experimental analysis.
Performance Evaluation of Agent Network Topologies Based on the AOCD Architecture
Authors: Hao Lan Zhang, Clement H. C. Leung, Gitesh K. Raikundalia
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Agent network topology is one of the fundamental issues in the multi-agent area. Different from existing network topological theory, such as LAN or distributed system networks, agent network topology emphasises communications and transactions between agents. Mobility and intelligence issues are major concerns in agent network topologies and these have not received much attention. In this paper, we illustrate the experimental results of agent network topologies based on our recently developed Agent-based Open Connectivity for Decision support systems (AOCD), in which concurrency control, mobility and intelligence issues have been taken into account. Our experimental results reflect some factors that impact on the performances of agent network topologies.
Pip: detecting the unexpected in distributed systems
Authors: Patrick Reynolds, Charles Killian, Janet L. Wiener, Jeffrey C. Mogul, Mehul A. Shah, Amin Vahdat
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

Bugs in distributed systems are often hard to find. Many bugs reflect discrepancies between a system's behavior and the programmer's assumptions about that behavior. We present Pip, an infrastructure for comparing actual behavior and expected behavior to expose structural errors and performance problems in distributed systems. Pip allows programmers to express, in a declarative language, expectations about the system's communications structure, timing, and resource consumption. Pip includes system instrumentation and annotation tools to log actual system behavior, and visualization and query tools for exploring expected and unexpected behavior. Pip allows a developer to quickly understand and debug both familiar and unfamiliar systems. We applied Pip to several applications, including FAB, SplitStream, Bullet, and RanSub. We generated most of the instrumentation for all four applications automatically. We found the needed expectations easy to write, starting in each case with automatically generated expectations. Pip found unexpected behavior in each application, and helped to isolate the causes of poor performance and incorrect behavior.
Perceptual segmentation and component selection in compact sinusoidal representations of audio
Authors: T. Painter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper presents two fundamental enhancements in a hybrid audio signal model consisting of sinusoidal, transient, and noise (STN) components. The first enhancement involves a novel application of a perceptual metric for optimal time segmentation for the analysis of transients. In particular, Moore and Glasberg's model of partial loudness is modified for use with general signals and then integrated into a, novel time segmentation scheme. The second and perhaps more significant STN enhancement is concerned with a new methodology for ranking and selection of the most perceptually relevant sinusoids.
Revisiting the Issue of Performance Enhancement of Discrete Event Simulation Software
Authors: Alex Bahouth, Steven Crites, Norman Matloff, Todd Williamson
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

New approaches are considered for performance enhancement of discrete-event simulation software. Instead of taking a purely algorithmic analysis view, we supplement algorithmic considerations with focus on system factors such as compiler/interpreter efficiency, hybrid interpreted/compiled code, virtual and cache memory issues, and so on. The work here consists of a case study of the SimPy language, in which we achieve significant speedups by addressing these factors.
Middleware Architecture in the Internet: Introduction
Authors: Keith Hazelton
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Middleware development has become an arena of increasing global collaboration for a number of reasons. This session of the SAINT 2007 conference covers recent results from some of these efforts. The introduction opens by defining a working perspective on middleware as understood by the investigators whose work is highlighted here.
xmb: dancing in the tar pits
Authors: Henry R. Tumblin, Charles E. McElwain
Venue: Proceedings of the 5th conference on Annual Tcl/Tk Workshop 1997 - Volume 5 (1997)

Managing software across multiple build platforms and environments can be thought of as dancing around a tar pit; if you slip and fall then you may not be able to get out for a long time! There's far too much knowledge about the local build environment required to enable software developers and release engineers to build, test, and release products. We intend to show that by using Tcl/Tk as a CASE integration engine, the amount of time and training required to bring a new developer, test or release engineer online is greatly reduced. Product build environments become standardized and the cost of adding new platforms is reduced.
Unsupervised topic clustering of switchboard speech messages
Authors: B. A. Carlson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper presents a statistical technique which can be used to automatically group speech data records based on the similarity of their content. A tree-based clustering algorithm is used to generate a hierarchical structure for the corpus. This structure can then be used to guide the search for similar material in data from other corpora. The SWITCHBOARD Speech Corpus was used to demonstrate these techniques, since it provides sets of speech files which are nominally on the same topic. Excellent automatic clustering was achieved on the truth text transcripts provided with the SWITCHBOARD corpus, with an average cluster purity of 97.3%. Degraded clustering was achieved using the output transcriptions of a speech recognizer, with a clustering purity of 61.4%.
Case Study in Mobile Internet Innovation: Does Advertising or Acquaintances Communication Decide Taiwan's Mobile Internet Diffusion?
Authors: Hui-Chih Wang, Yi-Cheng Ku, Her-Sen Doong
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Reporting the world's highest mobile phone penetration rate in 2002, Taiwan's experience in promoting mobile phone has offered global scholars a successful example in innovation marketing. Its current mobile Internet status is therefore received great attentions from international practitioners and researchers. However, despite various marketing efforts, Taiwan's mobile Internet services' diffusion is surprisingly slower than that of Korea and Japan. Aiming to provide some insights of innovation marketing, three diffusion models, i.e. external, internal, and mixed influence models, were applied in this study so as to reveal whether diffusion of mobile Internet services in Taiwan is affected by mass media advertising, interactions and imitations among acquaintances, or a combination of both. Findings indicated that the mixed influence model is the best fit, but acquaintance's influence is the dominant factor. The authors therefore argue that managers should consider "Source-Strategy Fit", i.e. it is essential to understand the innovation product's features and its influential sources when developing adequate marketing strategies.
RACC: an approach to cluster-based web servers
Authors: Xiaolan Zhang, Ravi Shanmugan, Michael Barrientos, J. Bradley Chen
Venue: Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2 (1998)

RACC is a cluster-based design for scalable cost-effective web servers. Organized around the goal of locality enhancement, the RACC approach seeks to distribute requests arriving at the cluster among the nodes so as to enhance the locality of reference that occurs on individual nodes in the cluster. By improving locality on individual cluster nodes, we can reduce their working set sizes, thereby achieving superior performance for less cost than conventional approaches. We describe here the RACC architecture and its prototype implementation on Windows NT.
Environmental Bisimulations for Higher-Order Languages
Authors: Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulation proof method with "up-to context" techniques, and (2) obtaining definitions and results that scale to languages with different features. To meet these challenges, we present environmental bisimulations, a form of bisimulation for higher-order languages, and its basic theory. We consider four representative calculi: pure \lambda-calculi (call-by-name and call-by-value), call-by-value \lambda-calculus with higher-order store, and then Higher-Order \pi-calculus. In each case: we present the basic properties of environmental bisimilarity, including congruence; we show that it coincides with contextual equivalence; we develop some up-to techniques, including up-to context, as examples of possible enhancements of the associated bisimulation method. Unlike previous approaches (such as applicative bisimulations, logical relations, Sumii-Pierce-Koutavas-Wand), our method does not require induction/indices on evaluation derivation/steps (which may complicate the proofs of congruence, transitivity, and the combination with up-to techniques), or sophisticated methods such as Howe's for proving congruence. It also scales from the pure \lambda-calculi to the richer calculi with simple congruence proofs.
2007 Special Issue: Learning grammatical structure with Echo State Networks
Authors: Matthew H. Tong, Adam D. Bickett, Eric M. Christiansen, Garrison W. Cottrell
Venue: Neural Networks (2007)

Echo State Networks (ESNs) have been shown to be effective for a number of tasks, including motor control, dynamic time series prediction, and memorizing musical sequences. However, their performance on natural language tasks has been largely unexplored until now. Simple Recurrent Networks (SRNs) have a long history in language modeling and show a striking similarity in architecture to ESNs. A comparison of SRNs and ESNs on a natural language task is therefore a natural choice for experimentation. Elman applies SRNs to a standard task in statistical NLP: predicting the next word in a corpus, given the previous words. Using a simple context-free grammar and an SRN with backpropagation through time (BPTT), Elman showed that the network was able to learn internal representations that were sensitive to linguistic processes that were useful for the prediction task. Here, using ESNs, we show that training such internal representations is unnecessary to achieve levels of performance comparable to SRNs. We also compare the processing capabilities of ESNs to bigrams and trigrams. Due to some unexpected regularities of Elman's grammar, these statistical techniques are capable of maintaining dependencies over greater distances than might be initially expected. However, we show that the memory of ESNs in this word-prediction task, although noisy, extends significantly beyond that of bigrams and trigrams, enabling ESNs to make good predictions of verb agreement at distances over which these methods operate at chance. Overall, our results indicate a surprising ability of ESNs to learn a grammar, suggesting that they form useful internal representations without learning them.
PERC-a collaboration between engineering and arts and science faculty to help insure better student preparation
Authors: T. Mzoughi
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

In an attempt to enhance preparation of engineering students, the College of Engineering and the College of Arts and Sciences at Mississippi State University have been working together to try to enhance the effectiveness of pre-engineering courses. As part of this effort, the physics department has started supplementing regular physics for engineering courses with Web-based content. The goal is to develop tools and content that will help infuse proven effective teaching practices in the teaching of these courses. The aim is to have Web tools that affect both the in-class activities as well as the outside of class activities. Currently, some of the tools used allow for just-in-time teaching inquiry based learning through online tutorials. To accomplish this goal a set of dedicated tools and tutorials (PERC) was developed and placed on a dedicated Web server. Effort was made to ensure that the tools were easy to use by both students and faculty, and that they do not require an extra time investment from the faculty. Pre and post standard tests were administered and used to help evaluate the effect of PERC. We describe PERC, from both student and faculty viewpoints. We demonstrate an example tutorial and show the faculty-authoring interface. We address faculty and student use. We discuss collaboration issues both within the department and outside the department. We finally report the evaluation activities and their results.
Full Perfect Extension Pruning for Frequent Graph Mining
Authors: Christian Borgelt, Thorsten Meinl
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algorithms and to enhance their capability to find meaningful graph fragments. Here we present a method to achieve the former, namely an improvement of what we called "perfect extension pruning in an earlier paper [2]. With it the number of generated fragments and visited search tree nodes can be reduced, thus accelerating the search.
Microprocessors in the era of terascale integration
Authors: Shekhar Borkar, Norman P. Jouppi, Per Stenstrom
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Moore's Law will soon deliver tera-scale level transistor integration capacity. Power, variability, reliability, aging, and testing will pose as barriers and challenges to harness this integration capacity. Advances in microarchitecture and programming systems discussed in this paper are potential solutions.
Recursive cost function adaptation for echo cancellation
Authors: C. Rusu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The goal of this paper is to introduce the RCFA (recursive cost function adaptation) algorithm. The derivation of the new algorithm does not use an estimator of the instantaneous error as the previous CFA (cost function adaptation) algorithms did. In the RCFA case, the new error power is computing from the previous error power using an usual LMS recursive equation. The proposed method improves the sensitivity of the error power with respect to the noisy error, while the other benefits of the CFA algorithms in terms of the convergence speed and residual error remain. The properties of the new algorithm will be compared, using computer simulations, to standard LMS and least mean fourth (LMF). The effect of the parameters involved in the design of the error power adaptive subsystem is also discussed.
On the choice of parameters for the weighting method in vector optimization
Authors: L. M. Gra&#x00f1;ax Drummond, N. Maculan, B. F. Svaiter
Venue: Mathematical Programming: Series A and B (2007)

We present a geometrical interpretation of the weighting method for constrained (finite dimensional) vector optimization. This approach is based on rigid movements which separate the image set from the negative of the ordering cone. We study conditions on the existence of such translations in terms of the boundedness of the scalar problems produced by the weighting method. Finally, using recession cones, we obtain the main result of our work: a sufficient condition under which weighting vectors yield solvable scalar problems.
Running "Fsck" in the background
Authors: Marshall Kirk McKusick
Venue: Proceedings of the BSD Conference 2002 on BSD Conference (2002)

Traditionally, recovery of a BSD fast filesystem after an uncontrolled system crash such as a power failure or a system panic required the use of the filesystem checking program, "fsck". Because the filesystem cannot be used while it is being checked by "fsck", a large server may experience unacceptably long periods of unavailability after a crash. Rather than write a new version of "fsck" that can run on an active filesystem, I have added the ability to take a snapshot of a filesystem partition to create a quiescent filesystem on which a slightly modified version of the traditinal "fsck" can run. A key feature of these snapshots is that they usually require filesystem write activity to be suspended for less than one second. The suspension time is independent of the size of the filesystem. To reduce the number and types of corruption, soft updates were added to ensure that the only filesystem inconsistencies are lost resources. With these two additions it is now possible to bring the system up immediately after a crash and then run checks to reclaim the lost resources on the active filesystems. Background "fsck" runs by taking a snapshot and then running its traditional first four passes to calculate the correct bitmaps for the allocations in the filesystem snapshot. From these bitmaps, "fsck" finds any lost resources and invokes special system calls to reclaim them in the underlying active filesystem.
Path to "Stardom" in Globally Distributed Teams: An Examination of a Knowledge-Centered Perspective Using Social Network Analysis
Authors: Saonee Sarker, Sarah Kirkeby, Suranjan Chakraborty
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In response to a call from the research community to identify individuals who become "stars" in globally-distributed teams, this study takes a knowledge-centered view in identifying the core factors leading to "stardom" in such teams. It adopts a structural/relational approach consistent with the core principles of social network analysis in developing and empirically validating the research model. Data from US-Norway and US-Denmark distributed teams engaged in systems development provide support for most of the predictions.
Improving Usability of Software Refactoring Tools
Authors: Erica Mealy, David Carrington, Paul Strooper, Peta Wyeth
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Post-deployment maintenance and evolution can account for up to 75% of the cost of developing a software system. Software refactoring can reduce the costs associated with evolution by improving system quality. Although refactoring can yield benefits, the process includes potentially complex, error-prone, tedious and time-consuming tasks. It is these tasks that automated refactoring tools seek to address. However, although the refactoring process is well-defined, current refactoring tools do not support the full process. To develop better automated refactoring support, we have completed a usability study of software refactoring tools. In the study, we analysed the task of software refactoring using the ISO 9241-11 usability standard and Fitts' List of task allocation. Expanding on this analysis, we reviewed 11 collections of usability guidelines and combined these into a single list of 38 guidelines. From this list, we developed 81 usability requirements for refactoring tools. Using these requirements, the software refactoring tools Eclipse 3.2, Condenser 1.05, RefactorIT 2.5.1, and Eclipse 3.2 with the Simian UI 2.2.12 plugin were studied. Based on the analysis, we have selected a subset of the requirements that will be incorporated into a prototype refactoring tool intended to address the full refactoring process.