ppxscal/embedding_network huggingface dataset:
Chip multi-processor scalability for single-threaded applications
Authors: Neil Vachharajani, Matthew Iyer, Chinmay Ashok, Manish Vachharajani, David I. August, Daniel Connors
Venue: ACM SIGARCH Computer Architecture News (2005)

The exponential increase in uniprocessor performance has begun to slow. Designers have been unable to scale performance while managing thermal, power, and electrical effects. Furthermore, design complexity limits the size of monolithic processors that can be designed while keeping costs reasonable. Industry has responded by moving toward chip multi-processor architectures (CMP). These architectures are composed from replicated processors utilizing the die area afforded by newer design processes. While this approach mitigates the issues with design complexity, power, and electrical effects, it does nothing to directly improve the performance of contemporary or future single-threaded applications.This paper examines the scalability potential for exploiting the parallelism in single-threaded applications on these CMP platforms. The paper explores the total available parallelism in unmodified sequential applications and then examines the viability of exploiting this parallelism on CMP machines. Using the results from this analysis, the paper forecasts that CMPs, using the "intrinsic" parallelism in a program, can sustain the performance improvement users have come to expect from new processors for only 6-8 years provided many successful parallelization efforts emerge. Given this outlook, the paper advocates exploring methodologies which achieve parallelism beyond this "intrinsic" limit of programs.
Study on Network Topology Visualization Algorithm and Implement Based on A Algorithm
Authors: Wei Yuan, Changxing Pei, Haiyun Xiao, Changhua Zhu, Nan Chen, Yun-hui Yi
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

This paper presents a network topology visualization algorithm based on A* algorithm. This algorithm is not only very universally applicable which can improve greatly the speed of operation and save the memory and meet the real-time requirement of network topology visualization, but also solve the problem of loop caused by single topology visualization algorithm, therefore, it's preferably suitable for the research on complicated network topology.
Location and Extraction of Broadcast in News Video Based on QGMM and BIC
Authors: Ling Guo, Ying-Chun Shi, Xian-Zhong Zhou, Feng Zhang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

An algorithm on location and extraction of broadcast in news video is proposed in this paper. Firstly, input audio stream is divided into speech and non- speech segments by VQ (Vector Quantification) after a set of new features representing audio segments' time-variant characteristics are extracted, including HZCRR (High Zero-crossing Rate Ratio), LSTER (Low Short-time Energy Ratio) and HBFERR (High Basic-frequency-energy Rate Ratio), etc. Then a QGMM (Quasi Gaussian Mixture Model) is presented to describe the speaker's identity and BIC (Bayesian Information Criterion) is used to detect speaker change. Finally speaker clustering is carried out with BIC, and location and extraction of broadcast is realized based on rules. Satisfactory results from experiments prove the effectiveness of this algorithm.
Learning, anticipation and time-deception in evolutionary online dynamic optimization
Authors: Peter A. N. Bosman
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

In this paper we focus on an important source of problem-difficulty in (online) dynamic optimization problems that has so far received significantly less attention than the traditional shifting of optima. Intuitively put, decisions taken now (i.e. setting the problem variables to certain values) may influence the score that can be obtained in the future. We indicate how such time-linkage can deceive an optimizer and cause it to find a suboptimal solution trajectory. We then propose a means to address time-linkage: predict the future by learning from the past. We formalize this means in an algorithmic framework. Also, we indicate why evolutionary algorithms are specifically of interest in this framework. We have performed experiments with two new benchmark problems that contain time-linkage. The results show, as a proof of principle, that in the presence of time-linkage EAs based upon this framework can obtain better results than classic EAs that do not predict the future.
Data cache prefetching design space exploration for BlueGene/L supercomputer
Authors: Jose R. Brunheroto, Valentina Salapura, Fernando F. Redigolo, Dirk Hoenicke, Alan Gara
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

Scientific applications exhibit good spatial and temporal data memory access locality. It is possible to hide memory latency for the Level 3 cache, and reduce contention between multiple cores sharing a single Level 3 cache, by using a prefetch cache to identify data streams which can be profitably prefetched, and decouple the cache line size mismatch between L3 cache and the Level 1 data cache. In this work, a design space exploration is presented, which helped shape the design of the BlueGene/L supercomputer memory sub-system. The prefetch cache consists of a small number of 128 line buffers that speculatively prefetches data from the L3 cache, since applications present some sequential access pattern, this prefetching scheme increases the likelyhood that a request from the Level 1 data cache will be present in the prefetch cache. Since most compute intensive applications contain a small number of data streams, it is sufficient for the prefetch cache to have small number of line buffers to track and detect the data streams. This paper focuses on the evaluation of stream detection mechanismis and the influence of varying the replacement policies for stream prefetch caches.
Accent Classification in Speech
Authors: Shamalee Deshpande, Sharat Chikkerur, Venu Govindaraju
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

Apart form the word content and identity of a speaker; speech also conveys information about several soft biometric traits such as accent and gender. Accurate classification of these features can have a direct impact on present speech systems. An accent specific dictionary or word models can be used to improve accuracy of speech recognition systems. Gender and accent information can also be used to improve the performance of speaker recognition systems. In this paper, we distinguish between standard American English and Indian Accented English using the second and third formant frequencies of specific accent markers. A GMM classification is used on the feature set for each accent group. The results show that using just the formant frequencies of these accent markers is sufficient to achieve a suitable classification for these two accent groups.
A Student ID System Using a Cell Phone and Its Evaluation
Authors: Tetsuji Kobayashi, Jaewook Kim, Norifumi Machida
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

This paper proposes a method to construct a student ID (identification) system using a cell phone. The student ID data are stored in the server. Each student receives the student ID data in each cell phone. The cell phone displays the character data (name, affiliation, etc.), the face image and the twodimensional symbol. As the face image displayed on the cell phone is large enough in comparison with the photograph size of the conventional ID card, the precision is improved when the examiner compares the displayed face image to the live face. The student ID can be used not only when the examiner's terminal can communicate with the server, but also when it cannot communicate with the server. The cost for issuing or reissuing a student ID by using the proposed method is very low in comparison with the conventional student ID card. The prototype has been implemented and evaluated.
Rapid scene modelling, registration and specification for mixed reality systems
Authors: Russell Freeman, Anthony Steed, Bin Zhou
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

Many mixed-reality systems require real-time composition of virtual objects with real video. Such composition requires some description of the virtual and real scene geometries and calibration information for the real camera. Once these descriptions are available, they can be used to perform many types of visual simulation including virtual object placement, occlusion culling, texture extraction, collision detection and reverse and re-illumination methods.In this paper we present a demonstration where we rapidly register prefabricated virtual models to a videoed scene. Using this registration information we were able to augment animated virtual avatars to create a novel mixed reality system. Rather than build a single monolithic system, we briefly introduce our lightweight modelling tool, the Mixed-Reality Toolkit (MRT) which enables rapid reconfiguration of scene objects without performing a full reconstruction. We also generalise to outline some initial requirements for a Mixed Reality Modelling Language (MRML).
Modeling, simulation and design techniques for high-density complex photonic integrated devices and circuits
Authors: Ning-Ning Feng
Venue:  (2005)

High-density photonic integration based on the high-contrast optical waveguide structures has become increasingly appealing for realizing multi-functional photonic circuits of compact size. In the meanwhile, accurate and efficient modeling, simulation and design of such devices and circuits become increasingly challenging. Effects such as the vector nature of the fields, the reflection at waveguide junctions, and enhanced optical nonlinearity, etc., need to be considered. The main objectives of the research for this thesis are to investigate and develop novel numerical techniques that are suitable for modeling and simulation of waveguide structures made of high index contrasts and with complex structures. After an introduction, the thesis first describes several methods for computation of complex modes that exist in bending and anti-guiding optical waveguides. A cylindrical perfected matched layer (CPML) is first introduced and applied in computing the full-vectorial complex modes in cylindrical system. Subsequently, two powerful methods are proposed to handle multiple modes of leaky structures. The methods utilize the transverse resonance when a signal propagates along the waveguide. The &ldquo;information&rdquo; stored in the output signal is extracted by well-established digital signal processing technique and converted into the modal parameters. Theoretically, the new methods can compute all modes by post-processing the information stored in the output signal. Then the thesis devotes itself to the light wave propagation in and interaction with optical waveguide structures. Aim at handling high-density complex photonic integrated devices, various methods and algorithms have been developed to simulate the light wave propagation and scattering in both frequency and time domains. The main feature of these methods is that they are attempting to solve the complex problems by combining different approaches. Since those individual approaches are especially good at dealing with one particular problem, the combination, therefore, can significantly extend their applications in much wider range. The efficiency and accuracy of the proposed methods have been verified and demonstrated by various photonic integrated devices. Finally, the space mapping (SM) technique is introduced for the design and modeling of optical devices. This technique provides a unique way to let computational intensive models, such as finite difference time domain (FDTD) method, play an important role in design optimization and modeling. Remarkable designs have been achieved in only several FDTD simulations.
MoM — A Process Variation Aware Statistical Capacitance Extractor
Authors: Rohit Ananthakrishna, Shabbir Batterywala
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

With the advent of newer technologies, the underlying manufacturing processes are becoming more complicated. This results in substantial variations between mask and actual fabricated geometries of the conductors. These variations in geometries can lead to significant differences in the interconnect capacitances computed using mask and actual geometries. The sources for these variations could be many and the variations could be independent or correlated. We present a novel extension to the statistical Monte-Carlo capacitance extractor to take into account the statistical models of these variations. The variations are handled by an additional Monte-Carlo sampling; hence termed Monte-Carlo over Monte-Carlo (MoM). Our technique reports the expected value and the expected spread of the capacitances along with the co-variance among the different capacitances. We demonstrate the correctness, accuracy and scalability of our technique analytically and experimentally.
Using a virtual lab to teach an online information assurance program
Authors: Wayne C. Summers, Bhagyavati, Carlos Martin
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

In this paper, we describe the development and implementation of a virtual computer lab for teaching online information assurance classes. This provides an opportunity for students to do hands-on security assignments. Different approaches to providing students with hands-on security assignments are briefly discussed and examples of several assignments are outlined.
Vanishing point
Authors: Mauricio Arango
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Vanishing Point is a presentation of the world as it responds to international newspaper coverage - not a measure of what the world is, but of what is most newsworthy. Consequently, countries that receive less media coverage gradually disappear from view. It consists of an interactive world map connected to a database fed by international news sources, and exists both in the form of a website (http://low-fi.org.uk/vanishingpoint) and as a physical gallery installation.The goal of this piece is to decipher the world that news media reconfigures and to observe if media coverage, or lack thereof, is creating a new cartography.
A 2D Range Hausdorff Approach for 3D Face Recognition
Authors: Trina D. Russ, Mark W. Koch, Charles Q. Little
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

This paper presents a 3D facial recognition algorithm based on the Hausdorff distance metric. The standard 3D formulation of the Hausdorff matching algorithm has been modified to operate on a 2D range image, enabling a reduction in computation from O(N2) to O(N) without large storage requirements. The Hausdorff distance is known for its robustness to data outliers and inconsistent data between two data sets, making it a suitable choice for dealing with the inherent problems in many 3D datasets due to sensor noise and object self-occlusion. For optimal performance, the algorithm assumes a good initial alignment between probe and template datasets. However, to minimize the error between two faces, the alignment can be iteratively refined. Results from the algorithm are presented using 3D face images from the Face Recognition Grand Challenge database version 1.0.
Annual Index
Venue: Computer (2005)

A listing of keywords and authors of articles published in Computer in 2005.
High Speed Robust Current Sense Amplifier for Nanoscale Memories: — A Winner Take All Approach
Authors: Srikanth Sundaram, Praveen Elakkumanan, Ramalingam Sridhar
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

The design of fast, low power and robust sense amplifier circuits is a challenge for nanoscale SRAMs due to the increasing bitline capacitance and process variations. Current sensing in SRAMs is promising to achieve high-speed operation in low-voltage application. In this paper, we propose a process variation tolerant, high performance and scalable current sense amplifier that uses a Winner Take All (WTA) approach for nanoscale SRAMs. Simulation of worst-case threshold voltage mismatch on our WTA sense amplifier shows that it could tolerate upto 10% variation in the threshold voltage, which is expected within die in a
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
Authors: Daniel Lemire, Martin Brooks, Yuhong Yan
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as possible and to alternate signs. We propose a quality metric for this problem, present an optimal linear time algorithm based on novel formalism, and compare experimentally its performance to a linear time top-down regression algorithm. We show that our algorithm is faster and more accurate. Applications include pattern recognition and qualitative modeling.
Product Associated Displays in a Shopping Scenario
Authors: Lubomira Spassova, Rainer Wasinger, Jorg Baus, Antonio Kruger
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

In this paper, we introduce the concept of Product Associated Displays — PADs — as a way of providing visual feedback to users interacting with physical objects in an instrumented environment. PADs are projected public displays created at locations that can be intuitively associated with the objects they show information about. The concept is illustrated in a shopping scenario.
Sketch-based retrieval on Flash movies via primary scene
Authors: Yu Yang, Qing Li, Minhao Yu, Yueting Zhuang
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

As a multimedia format, Flash is becoming more and more popular over the web. The typical structure of Flash can benefit from both image retrieval and video retrieval methods. In this paper, we present an approach of sketch-based retrieval on flash movies with analysis on directional and motional relations. Via the selection of primary scenes, query result can be displayed to users in an ideal way. Experiment of the proposed approach is evaluated on a test set with different genres of flash movies, and it shows the usefulness of the approach.
Finite Volume Discretization and Multilevel Methods in Flow Problems
Authors: S. Faure, J. Laminie, R. Temam
Venue: Journal of Scientific Computing (2005)

This article is intended as a preliminary report on the implementation of a finite volume multilevel scheme for the discretization of the incompressible Navier---Stokes equations. As is well known the use of staggered grids (e.g. MAC grids, Peri¿ et al. Comput. Fluids, 16(4), 389---403, (1988)) is a serious impediment for the implementation of multilevel schemes in the context of finite differences. This difficulty is circumvented here by the use of a colocated finite volume discretization (Faure et al. (2004a) Submitted, Peri¿ et al. Comput. Fluids, 16(4), 389---403, (1988)), for which the algebra of multilevel methods is much simpler than in the context of MAC type finite differences. The general ideas and the numerical simulations are presented in this article in the simplified context of a two-dimensional Burgers equations; the two-, and three-dimensional Navier---Stokes equations introducing new difficulties related to the incompressibility condition and the time discretization, will be considered elsewhere (see Faure et al. (2004a) Submitted and Faure et al. (2004b), in preparation).
Building Strongly-Reliable and High-Performance Storage Cluster with Network Attached Storage Disks Using PCs
Authors: Cai Bin, Changsheng Xie, Huaiyang Li
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Decentralized, cooperative and large-scale distributed storage systems that consist of a cluster of storage nodes attached with local disks can deliver high resource utilization, high availability and easy scalability. This paper describes the design and prototype implementation of a strongly reliable and high-performance storage cluster using commodity components, where each node is equipped with local storage disks. We present a self-adaptive redundancy scheme for file data access that uses a combination of RAID5 and RAID1 writes to store data. To solve the disks latency issue, we adopt a novel cluster caching scheme that shares memories between nodes in cluster to construct an efficient and cooperative cache-to-disk accesses policy. Performance measurements of such a system are encouraging -showing that such a storage cluster dynamically provide the high throughput and the strong reliability.
TCP Streaming for Low-DelayWireless Video
Authors: Chi-Fai Wong, Wai-Lam Fung, Jack T. Chi-Fai, S. H. Gary Chan
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

With the penetration and popularity of mobile devices such as pocket PCs and smart-phones, there is an increasing need of low-delay video streaming over wireless channel. Traditionally, UDP (User Datagram Protocol) is used for video streaming. However, due to unreliable transmission and fluctuating bandwidth of wireless channel, this requires error concealment and recovery mechanisms which greatly increases the complexity and delay of the system. Furthermore, UDP streams are often more difficult to penetrate firewalls. We hence propose using TCP (Transmission Control Protocol) for video streaming in this paper, due to its ease of use, reliability, and flexibility in selecting frames to transmit. After discussing the wireless system architecture under consideration, we present a multi-worker model as implemented at wireless proxy (or encoder) which handles client requests independently. Our model makes use of a technique (selective packet drop) which selectively drops those unimportant frames so as to maintain video quality and low delay in the presence of congestion and fluctuating bandwidth. We have implemented a cellular and WLAN-based surveillance system using the model, and conduct real network measurement on its performance. Our model is simple and effective for mobile clients of heterogeneous bandwidth and computing power. Our results show that using TCP for streaming leads to good video quality in wireless networks.
Analyzing and Improving Clustering Based Sampling for Microprocessor Simulation
Authors: Yue Luo, Ajay Joshi, Aashish Phansalkar, Lizy John, Joydeep Ghosh
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

We propose a set of statistical metrics for making a comprehensive, fair, and insightful evaluation of features, clustering algorithms, and distance measures in representative sampling techniques for microprocessor simulation. Our evaluation of clustering algorithms using these metrics shows that CLARANS clustering algorithm produces better quality clusters in the feature space and more homogeneous phases for CPI compared to the popular k-means algorithm. We also propose a new microarchitecture independent data locality based feature, Reuse Distance Distribution (RDD), for finding phases in programs, and show that the RDD feature consistently results in more homogeneous phases than Basic Block Vector (BBV) for many SPEC CPU2000 benchmark programs.