ppxscal/embedding_network huggingface dataset:
ATOMIC: A Low-Cost, Very-High-Speed, Local Communication Architecture
Authors: Danny Cohen, Gregory Finn
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

ATOMIC1 is an inexpensive O(gigabit) speed LAN built by USC/ISI. It is based upon Mosaic technol ogy developed for fine-grain, message-passing, massively parallel computation. Each Mosaic processor is capable of routing variable length packets, while providing added value through simultaneous computing and buffering. ATOMIC adds a general routing capability to the native Mosaic wormhole routing through store-and-forward. ATOMIC scales linearly, with a small interface cost. Each ATOMIC channel has a data carrying capacity of 500Mbls. A prototype ATOMIC LAN has been con structed along with host interfaces and software that pro vides full TCP/IP compatibility. Using ATOMIC, 1J00 byte packets have been exchanged between hosts at an aggregate transfer rate of more than lGbls. Other tests have demonstrated throughput of 5.25 million packets per second over a single Mosaic channel. This paper describes the architecture and performance of ATOMIC.
The validation and threshold values of object-oriented metrics
Authors: Wei Li
Venue:  (2006)

Previous research has shown that object-oriented software metrics can predict error proneness and maintenance activities of classes, as well as project progress during the development process. However, whether the metrics' predictive capability still exists after the software is released is not known. This research has three objectives: (1) to investigate whether software metrics can predict class error proneness; (2) to investigate whether software metrics can predict the class error probability in three error-severity categories; and (3) to identify the distinct metrics threshold values that are clearly associated with error categories, by examining the data collected from the post-release evolution of an open-source system. Our empirical research is conducted on three releases of the Eclipse project---a continuously evolving, large industrial-strength open source system. The research results show that some object-oriented metrics can predict class error probabilities in the three error-severity categories. Furthermore, we report that the classes can be grouped into different error categories based on the probability-predication models. By using the large open-source system, we also verify the previous research result: some OO metrics can predict class error proneness. In previous research and practice, threshold values of object-oriented metrics were identified. However, most metric threshold values used in practice, such as the threshold values suggested by the Software Assurance Technology Center at the National Aeronautic and Space Agency (NASA), were suggested intuitively. Few empirical studies have identified threshold values of object-oriented metrics from empirical error data. Our research reports that there are significant differences among the metric means in the three error-severity categories and these means can be used to calculate the metrics threshold values.
Comparative analysis of hidden Markov models for multi-modal dialogue scene indexing
Authors: A. A. Alatan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

A class of audio-visual content is segmented into dialogue scenes using the state transitions of a novel hidden Markov model (HMM). Each shot is classified using both the audio track and the visual content to determine the state/scene transitions of the model. After simulations with circular and left-to-right HMM topologies, it is observed that both performing very well with multi-modal inputs. Moreover, for the circular topology, the comparisons between different training and observation sets show that audio and face information together gives the most consistent results among different observation sets.
Adaptive identification of bilinear systems
Authors: Zhiwen Zhu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The paper considers the adaptive identification of bilinear systems using the equation-error approach. An improved least squares (ILS) objective function is presented to reduce the bias of coefficient estimation in the case of large measurement noise when the standard least squares (LS) technique is used. An adaptive algorithm based on the ILS criterion is proposed for the identification of the bilinear system. Numerical simulations are given to demonstrate the effectiveness of the adaptive ILS algorithm. Compared with the least mean square (LMS) technique, the proposed algorithm has superior identification performance.
Using Register Lifetime Predictions to Protect Register Files against Soft Errors
Authors: Pablo Montesinos, Wei Liu, Josep Torrellas
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

To increase the resistance of register files to soft errors, this paper presents the ParShield architecture. ParShield is based on two observations: (i) the data in a register is only useful for a small fraction of the register's lifetime, and (ii) not all registers are equally vulnerable. ParShield selectively protects registers by generating, storing, and checking the ECCs of only the most vulnerable registers while they contain useful data. In addition, it stores a parity bit for all the registers, re-using the ECC circuitry for parity generation and checking. ParShield has no SDC AVF and a small average DUE AVF of 0.040 and 0.010 for the integer and floating-point register files, respectively. ParShield consumes on average only 81% and 78% of the power of a design with full ECC for the SPECint and SPECfp applications, respectively. Finally, ParShield has no performance impact and little area requirements.
Stochastic model based audio watermark and whitening filter for improved detection
Authors: Hongseok Kim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Digital watermarking is a means of copyright protection by embedding an imperceptible signal into the multimedia data. Nearly all watermarking schemes developed basically employ a spread spectrum technique, and the extraction of embedded watermark depends on the correlation method. In this paper, we propose a stochastic model based public audio watermark. Based on the stochastic model and detection theory, the watermark shaping effect on detection is well explained. We also provide the theoretical whitening filter SNR gain and show that the detection performance can be significantly improved with the whitening filter. As regards robust detection with the whitening filter, we propose a robust detection parameter and demonstrate the reliability of the proposed estimated whitening filter to various kinds of audio degradation and distortions, e.g., MPEG compression, filtering, requantization, resampling, etc. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A unique degree program in wireless information systems
Authors: P. Krishnamurthy
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

This paper describes the development and details of a unique degree program in wireless information systems. The wireless curriculum in most engineering schools deal with the lower layers of the OSI model and emphasize traditional digital communications and electromagnetics. The Wireless Information Systems (WIS) Track at the University of Pittsburgh adopts a systems approach that will enable the students to obtain a grasp of all issues required for design, deployment, management and administration of future wireless information systems.
The influence of self-esteem and locus of control on perceived email-related stress
Authors: M. Hair, K. V. Renaud, J. Ramsay
Venue: Computers in Human Behavior (2007)

Electronic mail has become an indispensable tool in business and academia, and personal use is increasing every day. However, there is also evidence that Email, unlike more traditional communication media, can exert a powerful hold over its users and that many computer users experience stress as a direct result of email-related pressure. This paper develops a three-fold typology of orientations to email: 'relaxed', 'driven' and 'stressed'. It further investigates whether the personality traits of self-esteem and locus of control are associated with email-related stress. It finds that low self-esteem is associated with the 'driven' orientation. It further suggests that the 'stressed' orientation may be related to how distractive email is perceived to be, compared with other forms of communication.
The Impact of Scaling on Planning Activities in an Agile Software Development Center
Authors: Hubert Smits
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper evaluates agile practices when applied in multi-team and multi-person-year projects. It does so through inspection of the requirements brought on by scaling projects, and applying basic agile principles to those requirements. In the introduction section the main agile principles are introduced, as well as the Lean principles upon which the agile methods are built. One of those Lean principles, Muri or overburdening of people, is addressed through the extension of the agile planning process. The extension of the most used agile planning technique (iteration planning) is described in detail, both the motivation for the extension as well as the collaboration practices behind each planning level. In the final chapter the impact of product complexities on the planning process is evaluated, and a solution to create a smooth flow in the planning/delivery cycle is presented.
Trouble Shooting in Distributed Service Centers
Authors: A. Al-Ta'ani, C. Begall, A. Waadt
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

The increasing number of internetworking communication networks and technologies require more and more flexible computing solutions, connecting resources in a transparent, open and reliable way. Parallelism and redundancy enables distributed service centers to provide sustained high Quality of Service and performance. Similar approaches are also used in other distributed systems. Unfortunately, the resulting concurrencies of such systems complicate control and maintenance. In this paper, the authors present the system framework of a distributed service center and a rule-based software for the evaluation of status reports coming from the different components of the distributed service center. This software has been developed for a commercial SMS Center. Trouble shooting in the resulting distributed hardware and software system is achieved by using data mining techniques.
Dynamic Sharing of Large-Scale Visualization
Authors: Jian Huang, Huadong Liu, Micah Beck, Andrew Gaston, Jinzhu Gao, Terry Moore
Venue: IEEE Computer Graphics and Applications (2007)

There has been a recent trend for large groups of users to collaborate on large data sets across geographical distances. In this context, if users could share and modify a visualization over the standard Internet without requiring local replication of the data, the visualization community would have an even greater impact on the conduct of today's research. Various remote and collaborative visualization approaches have been proposed. This article presents a different viewpoint. The authors believe that for dynamic sharing of large-scale visualization, distributed heterogeneous resources that are free, unscheduled, and unreserved could serve as a fundamental and sufficient platform to support large groups of users--with greater potential usability, scalability, and cost efficiency.
The bucket box intersection (BBI) algorithm for fast approximative evaluation of diagonal mixture Gaussians
Authors: J. Fritsch
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Today, most of the state-of-the-art speech recognizers are based on hidden Markov modeling. Using semi-continuous or continuous density hidden Markov models, the computation of emission probabilities requires the evaluation of mixture Gaussian probability density functions. Since it is very expensive to evaluate all the Gaussians of the mixture density codebook, many recognizers only compute the M most significant Gaussians (M=1,...,8). This paper presents an alternative approach to approximate mixture Gaussians with diagonal covariance matrices, based on a binary feature space partitioning tree. The proposed algorithm is experimentally evaluated in the context of large vocabulary, speaker independent, spontaneous speech recognition using the JANUS-2 speech recognizer. In the case of mixtures with 50 Gaussians, we achieve a speedup of 2-5 in the computation of HMM emission probabilities, without affecting the accuracy of the system.
Anton, a special-purpose machine for molecular dynamics simulation
Authors: David E. Shaw, Martin M. Deneroff, Ron O. Dror, Jeffrey S. Kuskin, Richard H. Larson, John K. Salmon, Cliff Young, Brannon Batson, Kevin J. Bowers, Jack C. Chao, Michael P. Eastwood, Joseph Gagliardo, J. P. Grossman, C. Richard Ho, Douglas J. Ierardi, István Kolossváry, John L. Klepeis, Timothy Layman, Christine McLeavey, Mark A. Moraes, Rolf Mueller, Edward C. Priest, Yibing Shan, Jochen Spengler, Michael Theobald, Brian Towles, Stanley C. Wang
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

The ability to perform long, accurate molecular dynamics (MD) simulations involving proteins and other biological macro-molecules could in principle provide answers to some of the most important currently outstanding questions in the fields of biology, chemistry and medicine. A wide range of biologically interesting phenomena, however, occur over time scales on the order of a millisecond--about three orders of magnitude beyond the duration of the longest current MD simulations. In this paper, we describe a massively parallel machine called Anton, which should be capable of executing millisecond-scale classical MD simulations of such biomolecular systems. The machine, which is scheduled for completion by the end of 2008, is based on 512 identical MD-specific ASICs that interact in a tightly coupled manner using a specialized high-speed communication network. Anton has been designed to use both novel parallel algorithms and special-purpose logic to dramatically accelerate those calculations that dominate the time required for a typical MD simulation. The remainder of the simulation algorithm is executed by a programmable portion of each chip that achieves a substantial degree of parallelism while preserving the flexibility necessary to accommodate anticipated advances in physical models and simulation methods.
Strategic Analysis Using Value Modeling--The c3-Value Approach
Authors: Hans Weigand, Paul Johannesson, Birger Andersson, Maria Bergholtz, Ananda Edirisuriya, Tharaka Ilayperuma
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

E3-value has proven to be a useJirl modeling technique and method to support the analysis of business models. However, for strategic analysis, the representhtion of a business model is not suflcient, as it does not include the rationale behind the model. In this paper, we propose an extension of e3-value to support strategic analysis on three dimensions: competititjn analysis, customer analysis and capability analysis.
PFAAM An Active Appearance Model based Particle Filter for both Robust and Precise Tracking
Authors: Sven, McElory Hoffmann, Karin Hunter, Andreas Schilling
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

Model based tracking is one key component of many systems today, e.g. within video surveillance or human computer interfaces (HCI). Our approach consists of a combination of particle filters (PFs) and active appearance models (AAMs): the PFAAM. It combines the robustness of PFs with the precision of AAMs. Experimental results are given. PFAAM shows superior perfomance compared to both standard AAMs and PFs using AAMs as cues only, i.e. without using a local optimization loop.
Distributed communication model in hierarchical Infostation systems: Research Articles
Authors: M. Tlais, F. Weis
Venue: Concurrency and Computation: Practice Experience (2007)

The Infostations system, small and separated islands of coverage, provides intermittent but very high speed data rates. A new communication model is needed to carry this kind of architecture. Mainly, the discontinuous coverage affects the way data are exchanged between mobile terminals and the network. Moreover, the short time the mobile terminal spends in the coverage area has a direct impact on the network performance. Thus, it is essential to avoid bandwidth wasting due to the overall delay by performing mobility prediction. A new mobility prediction protocol called the Distributed Neighbor Discovery Protocol (DNDP) is proposed. DNDP handles a neighbor graph table that dynamically configures itself according to the terminals' mobility. The simulation shows that the terminals service continuity is significantly improved thanks to DNDP. Copyright &copy; 2007 John Wiley & Sons, Ltd.
A self-recovering RAKE receiver for asynchronous CDMA systems
Authors: M. Torlak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

In asynchronous CDMA systems, transmission over frequency-selective channels subjects the signal to interchip interference and intersymbol interference, both of which cause multiple access interference (MAI). MAI cannot be easily eliminated without the knowledge of the channel parameters. Both blind adaptive and subspace based multiuser receivers have been proposed to eliminate the interference. We propose a self-recovering RAKE receiver that does not require training sequences or knowledge of interfering user signature waveforms. The contribution of this paper is the combination of constant modulus algorithm and previously derived constrains. The constrains depend on the multipath structure of the desired signal. The proposed receiver converges faster than the blind adaptive multiuser receivers. Its fast convergence and low complexity make it well suited for rapidly time-varying mobile radio frequency selective fading channels. By simulation, we compare the proposed method with blind adaptive constrained LMS RAKE receiver and minimum output energy receiver.
A finite element method for investigating general elastic multi-structures
Authors: Jianguo Huang, Ling Guo, Zhongci Shi
Venue: Computers Mathematics with Applications (2007)

A finite element method is proposed for investigating the general elastic multi-structure problem, where displacements on bodies, longitudinal displacements on plates, longitudinal displacements and rotational angles on rods are discretized using conforming linear elements, transverse displacements on plates and rods are discretized respectively using TRUNC elements and Hermite elements of third order, and the discrete generalized displacement fields in individual elastic members are coupled together by some feasible interface conditions. The unique solvability of the method is verified by the Lax-Milgram lemma after deriving generalized Korn's inequalities in some nonconforming element spaces on elastic multi-structures. The quasi-optimal error estimate in the energy norm is also established. Some numerical results are presented at the end.
Efficient occlusion handling for multiple agent tracking by reasoning with surveillance event primitives
Authors: P. Guha, A. Mukerjee, K. S. Venkatesh
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

Tracking multiple agents in a monocular visual surveillance system is often challenged by the phenomenon of occlusions. Agents entering the field of view can undergo two different forms of occlusions, either caused by crowding or due to obstructions by background objects at finite distances from the camera. The agents are primarily detected as foreground blobs and are characterized by their motion history and weighted color histograms. These features are further used for localizing them in subsequent frames through motion prediction assisted mean shift tracking. A number of Boolean predicates are evaluated based on the fractional overlaps between the localized regions and foreground blobs. We construct predicates describing a comprehensive set of possible surveillance event primitives including entry/exit, partial or complete occlusions by background objects, crowding, splitting of agents and algorithm failures resulting from track loss. Instantiation of these event primitives followed by selective feature updates enables us to develop an effective scheme for tracking multiple agents in relatively unconstrained environments.
Lab Partners: If They're Good Enough for the Natural Sciences, Why Aren't They Good Enough for Us?
Authors: Laurie Williams, Lucas Layman
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Despite many professed benefits of collaboration, some computer science educators feel students need to master work individually, particularly in the courses early in the curriculum that feed into software engineering courses. In the natural sciences, however, students almost always work with one or more partners in the laboratory. What can computer science educators learn about collaborative lab settings from our natural science counterparts? We conducted a survey of science and computer science educators to compare views and use of collaboration in their classes. The positive and negative aspects of collaboration, as reported by the natural science educators, are strikingly similar to those of computer science educators. These results suggest that computer science educators should be more open to the use of collaborative labs, as is done in the natural sciences, for the overall benefit to students.
The L/sup 1/-norm of out-of-phase peaks of the aperiodic auto-correlation function of binary sequences
Authors: S. Stanczak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

For the mean-square errors of the maximum-likelihood channel estimate, the noise enhancement factor of an aperiodic invertible sequence is an optimality criterion. Massey posed a question as to whether there exist binary sequences that achieve the absolute optimum for the sequence length N/spl rarr//spl infin/ since then they would be preeminently eligible for channel estimation. However, the noise enhancement factor is extremely difficult to examine both analytically and numerically often making extensive investigations of sequences impossible. For this reason, it is convenient to consider the l/sup 1/-norm of out-of-phase peaks of the aperiodic auto-correlation magnitude. In this paper, it is shown that the l/sup 1/-norm can never have the required behaviour for solving Massey's problem in the case of binary sequences and that the best possible binary sequences in this connection are skew-symmetric Barker sequences. The paper is of interest in mobile radio channels' study.