ppxscal/embedding_network huggingface dataset:
A Hierarchical Approach to Modeling and Improving the Performance of Scientific Applications on the KSR1
Authors: Eric L. Boyd, Waqar Azeem, Hsien-Hsin Lee, Tien-Pao Shih, Shih-Hao Hung, Edward S. Davidson
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

We have developed a hierarchical performance bounding methodology that attempts to explain the performance of loop-dominated scientific applications on particular systems. The Kendall Square Research KSR1 is used as a running example. We model the throughput of key hardware units that arc common bottlenecks in concurrent machines. The four units currently used are: memory port, floating-point, instruction issue, and a loop-carried dependence pseudo-unit. We propose a workload characterization, and derive upper bounds on the performance of specific machine-workload pairs. Comparing delivered performance with bounds focuses attention on areas for improvement and indicates how much improvement might be attainable. We delineate a comprehensive approach to modeling and improving application performance on the KSR1. Application of this approach is being automated for the KSR1 with a series of tools including K-MA and K-MACSTAT (which enable the calculation of the MACS hierarchy of performance bounds), K-Trace (which allows parallel code to be instrumented to produce a memory reference trace), and K-Cache (which simulates inter-cache communications based on a memory reference trace).
Evaluating HDR rendering algorithms
Authors: Jiangtao Kuang, Hiroshi Yamaguchi, Changmeng Liu, Garrett M. Johnson, Mark D. Fairchild
Venue: ACM Transactions on Applied Perception (TAP) (2007)

A series of three experiments has been performed to test both the preference and accuracy of high dynamic-range (HDR) rendering algorithms in digital photography application. The goal was to develop a methodology for testing a wide variety of previously published tone-mapping algorithms for overall preference and rendering accuracy. A number of algorithms were chosen and evaluated first in a paired-comparison experiment for overall image preference. A rating-scale experiment was then designed for further investigation of individual image attributes that make up overall image preference. This was designed to identify the correlations between image attributes and the overall preference results obtained from the first experiments. In a third experiment, three real-world scenes with a diversity of dynamic range and spatial configuration were designed and captured to evaluate seven HDR rendering algorithms for both of their preference and accuracy performance by comparing the appearance of the physical scenes and the corresponding tone-mapped images directly. In this series of experiments, a modified Durand and Dorsey's bilateral filter technique consistently performed well for both preference and accuracy, suggesting that it is a good candidate for a common algorithm that could be included in future HDR algorithm testing evaluations. The results of these experiments provide insight for understanding of perceptual HDR image rendering and should aid in design strategies for spatial processing and tone mapping. The results indicate ways to improve and design more robust rendering algorithms for general HDR scenes in the future. Moreover, the purpose of this research was not simply to find out the &ldquo;best&rdquo; algorithms, but rather to find a more general psychophysical experiment based methodology to evaluate HDR image-rendering algorithms. This paper provides an overview of the many issues involved in an experimental framework that can be used for these evaluations.
Biometric Nanotechnology and Nonlinear Dynamics
Authors: S. Raiesdana, M. H. Gholpayeghani, A. M. Nasrabadi
Venue: Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies (2007)

The biological approach to nanotechnology - biomimetic nanotechnology- is a new field in the area of nanostructuring and specially nonorobotic. Mimicking biology to extract useful strategies, needs good knowledge of its exquisite dynamic (evolutionary nonlinear dynamic) which arises from a vast network of molecular interactions and structure-function hierarchical solidity from small scales (nano) to large scales (macro). In this sense the identification of self-assembly processes in living systems and their self-organized dynamical states with the knowledge about their sensitivity and selectivity have paved the way for developing new strategies for conb.olling the dynamic of self-assembled structures in nanoscale. Hence by mimicking the way in which biological structural components are built, the process of pattern formation or self-assembly can be directed in a desired form.
Letting ants labeling point features [sic.: for 'labeling' read 'label']
Authors: M. Schreyer, G. R. Raidl
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper describes an ant colony system (ACS) for labeling point features. A pre-processing step reduces the search space in a safe way. The ACS applies local improvement and masking, a technique that focuses the optimization on critical regions. Empirical results indicate that the ACS reliably identifies high-quality solutions which are in many cases better than those of a state-of-the-art genetic algorithm for point-feature labeling.
Workstation support for real-time multimedia communication
Authors: Olof Hagsand, Peter Sjdin
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

We show how multimedia applications with real-time requirements can be supported in a distributed system. A UNIX system has been modified to give soft real-time support. The modifications include deadline-based scheduling, preemption points and prioritized interrupt processing. In addition, a system call interface for real-time application programming has been designed. We justify the modifications by experiments with a simple distributed multimedia delivery system. The experiments are made on an ATM network, where resources are reserved by means of the ST-2 internetworking protocol.
Thinking Outside the Box in Geometry and Art
Venue: Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems (2007)

Dr. Sequin has been a CAD tool builder for the last 30 years. He has participated in the design of solid-state filters and image sensors, institutional research buildings, mechanical toys, and, more recently, abstract geometrical sculptures.
Teaching object-oriented programming in python
Authors: Michael H. Goldwasser, David Letscher
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

Python's use in education has grown rapidly, due to its elegantly simple syntax. Though often viewed as a "scripting language," Python is a fully object-oriented language with an extremely consistent object model and a rich set of built-in classes. In this tutorial, we share our experiences using Python in the context of an object-oriented CS1 course. We will begin with an overview of the language, with particular emphasis on the object-orientation. We then present several coherent teaching strategies and a variety of graphical and non-graphical projects. Both new and experienced Python users are welcome.
Knowledge-based parameters for HMM speech recognition
Authors: N. N. Bitar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper presents acoustic parameters (APs) that were motivated by phonetic feature theory and employed as a signal representation of speech in a hidden Markov model (HMM) recognition framework. Presently, the phonetic features considered are the manner features: sonorant, syllabic, nonsyllabic, noncontinuant and fricated. The objective of the parameters is to directly target the linguistic information in the signal and to reduce the speaker-dependent information that may yield large speech variability. To achieve these goals, the APs were defined in a relational manner across time or frequency. For evaluation, broad-class recognition experiments were conducted comparing the APs to cepstral-based parameters. The results of the experiments indicate that the APs are able to capture the phonetically relevant information in the speech signal and that, in comparison to the cepstral-based parameters, they are more able to reduce the interspeaker variability.
A comparison of reproductive success and the effect of mating restrictions in coarse-grained parallel genetic algorithms
Authors: J. Vincent
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper examines the influence of mating restrictions in two parallel genetic algorithms; the island-model, and an alternative which adaptively partitions the search space into separately optimised regions. Mating restrictions are found critical in both cases, but particularly the island-model whose performance is only comparable when mating is significantly restricted.
A fuzzy Actor-Critic reinforcement learning network
Authors: Xue-Song Wang, Yu-Hu Cheng, Jian-Qiang Yi
Venue: Information Sciences: an International Journal (2007)

One of the difficulties encountered in the application of reinforcement learning methods to real-world problems is their limited ability to cope with large-scale or continuous spaces. In order to solve the curse of the dimensionality problem, resulting from making continuous state or action spaces discrete, a new fuzzy Actor-Critic reinforcement learning network (FACRLN) based on a fuzzy radial basis function (FRBF) neural network is proposed. The architecture of FACRLN is realized by a four-layer FRBF neural network that is used to approximate both the action value function of the Actor and the state value function of the Critic simultaneously. The Actor and the Critic networks share the input, rule and normalized layers of the FRBF network, which can reduce the demands for storage space from the learning system and avoid repeated computations for the outputs of the rule units. Moreover, the FRBF network is able to adjust its structure and parameters in an adaptive way with a novel self-organizing approach according to the complexity of the task and the progress in learning, which ensures an economic size of the network. Experimental studies concerning a cart-pole balancing control illustrate the performance and applicability of the proposed FACRLN.
Turkish speech corpora and recognition tools developed by porting SONIC: Towards multilingual speech recognition
Authors: Özgül Salor, Bryan L. Pellom, Tolga Ciloglu, Mübeccel Demirekler
Venue: Computer Speech and Language (2007)

This paper presents work on developing speech corpora and recognition tools for Turkish by porting SONIC, a speech recognition tool developed initially for English at the Center for Spoken Language Research of the University of Colorado at Boulder. The work presented in this paper had two objectives: The first one is to collect a standard phonetically-balanced Turkish microphone speech corpus for general research use. A 193-speaker triphone-balanced audio corpus and a pronunciation lexicon for Turkish have been developed. The corpus has been accepted for distribution by the Linguistic Data Consortium (LDC) of the University of Pennsylvania in October 2005, and it will serve as a standard corpus for Turkish speech researchers. The second objective was to develop speech recognition tools (a phonetic aligner and a phone recognizer) for Turkish, which provided a starting point for obtaining a multilingual speech recognizer by porting SONIC to Turkish. This part of the work was the first port of this particular recognizer to a language other than English; subsequently, SONIC has been ported to over 15 languages. Using the phonetic aligner developed, the audio corpus has been provided with word, phone and HMM-state level alignments. For the phonetic aligner, it is shown that 92.6% of the automatically labeled phone boundaries are placed within 20ms of manually labeled locations for the Turkish audio corpus. Finally, a phone recognition error rate of 29.2% is demonstrated for the phone recognizer.
A high quality MBE-LPC-FE speech coder at 2.4 kbps and 1.2 kbps
Authors: Tian Wang, Kun Tang, Chongxi Feng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper presents a high quality speech coder based on the multi-band excitation (MBE) model operating at 2.4 kb/s and 1.2 kb/s. The features of this coder mainly focus on two aspects. One is an accurate and reliable pitch estimation and voiced/unvoiced decision algorithm. The other is the efficient quantization of the variable dimension spectral amplitude vector. Besides representing the spectral envelope information using an all-pole model, we also encode error vectors of the spectral amplitude vector at several important positions. Informal listening tests indicate that the speech quality of this coder at 2.4 kb/s is comparable and even superior to the INMARSAT-M IMBE 4.15 kb/s coder. The coder has been implemented in real-time on a single TMS320C31 floating point DSP.
Towards Re-engineering Legacy Systems for Assured Dynamic Adaptation
Authors: Ji Zhang, Betty H. C. Cheng
Venue: Proceedings of the International Workshop on Modeling in Software Engineering (2007)

Increasingly, software must adapt its behavior in response to changes in the supporting computing, communication infrastructure, and in the surrounding physical environment. Since most existing software was not designed to adapt, research on techniques to make legacy software dynamically adaptive has gained increasing interest. Assurance is crucial for adaptive software to fulfill its intended purpose. Correctness is even more critical if it is to be applied in high assurance systems. This paper proposes a model-driven approach to introduce dynamic adaptation to non-adaptive legacy systems while maintaining assurance properties. An aspect-oriented technique is applied to achieve separation of concerns in the implementation.
Compiler-directed application mapping for NoC based chip multiprocessors
Authors: Guangyu Chen, Feihui Li, Mahmut Kandemir
Venue: Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems (2007)

The problem attacked in this paper is one of automatically mapping an application onto a Network-on-Chip (NoC) based chip multi-processor architecture in a locality-aware fashion. The proposed compiler approach has four major steps: task scheduling, processor mapping, data mapping, and packet routing. Our experimental result clearly shows that the proposed framework reduces energy consumption of our applications significantly (27.41% on average over a pure performance oriented application mapping strategy) as a result of improved locality of data accesses.
JavaTM just-in-time compiler and virtual machine improvements for server and middleware applications
Authors: Nikola Grcevski, Allan Kielstra, Kevin Stoodley, Mark Stoodley, Vijay Sundaresan
Venue: Proceedings of the 3rd conference on Virtual Machine Research And Technology Symposium - Volume 3 (2004)

This paper describes optimization techniques recently applied to the Just-In-Time compilers that are part of the IBM® Developer Kit for JavaTM and the J9 Java virtual machine specification. It focusses primarily on those optimizations that improved server and middleware performance. Large server and middleware applications written in the Java programming language present a variety of performance challenges to virtual machines (VMs) and justin-time (JIT) compilers; we must address not only steady-state performance but also start-up time. In this paper, we describe 12 optimizations that have been implemented in IBM products because they improve the performance and scalability of these types of applications. These optimizations reduce, for example, the overhead of synchronization, object allocation, and some commonly used Java class library calls. We also describe techniques to address server start-up time, such as recompilation strategies. The experimental results show that the optimizations we discuss in this paper improve the performance of applications such as SPECjbb2000 and SPECjAppServer2002 by as much as 10-15%.
Pipelined architectures for the TD-LMS adaptive filter
Authors: G.-O. Glentis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

In this paper, efficient pipelined architectures for the implementation of the transform domain LMS algorithm, are presented. Pipelining of the TD-LMS algorithm is achieved by introducing an amount of time delay into the original adaptive scheme. The adaptation delay introduced to the TD-LMS algorithm allows for the development of pipelined architectures. By retiming the delays existing in the error feedback loop, two efficient, pipelined implementations of the delayed TD-LMS algorithm are developed.
A New Charge based Compact Model for Lateral Asymmetric MOSFET and its application to High Voltage MOSFET Modeling
Authors: Yogesh Singh Chauhan, Francois Krummenacher, Renuad Gillon, Benoit Bakeroot, Michel Declercq, Adrian Mihai Ionescu
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

The Lateral Asymmetric MOSFET, which has longitudinal doping variation in the channel, is the building block of many categories of High Voltage MOSFETs e.g. LDMOS, VDMOS. Here we report a new charge based analytical compact model for Lateral Asymmetric MOSFET (LAMOS). Numerical device simulations are used to validate the intrinsic MOS region of high voltage MOSFET for lateral doping gradient in the channel. The model shows good results in DC and most importantly in AC regime, especially the peaks in CGD, CGS and CGG capacitances. The LAMOS model is also validated along with the drift model on the measured DC characteristics of high voltage LDMOS transistor.
Shipment Localization Kit: An Automated Approach for Tracking and Tracing General Cargo
Authors: Christian Hillbrand, Robert Schoech
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

Tracking and tracing services are of great importance for the transportation and logistics industry and have become standard services for most logistics providers. Senders as well as consignees use this service in order to align their business and manufacturing processes with the respective forwarding activities. Within the field of parcel and expedited logistics, the use of standard parcel sizes enables a comparatively simple technical implementation of tracking and tracing by the use of bar code systems. However, for carriers of general cargo this issue can become rather challenging out of two reasons. First, shipments have all assumable sizes and shapes and second, forwarders are very often organized in open logistics chains or networks. This paper proposes a hybrid approach for automated tracking and tracing of general cargo based on cellular positioning and radio frequency identification (RFID). Based on the results of a field test of a leading European logistics provider, this paper discusses the opportunities arising from this approach as well as its future potential.
Quantization of line spectral parameters using a trellis structure
Authors: F. Lahouti
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

In this article, a low bit-rate low-complexity block-based trellis quantization (BTQ) scheme is proposed for quantization of line spectral frequencies for speech coding applications. The branches in the trellis diagram correspond to the LSF difference code-words and the states correspond to quantized LSF parameters. An efficient algorithm for the index generation (finding the index of a path in the trellis) is introduced. The proposed BTQ achieves the transparent coding quality at 23 bits/frame (1150 b/sec.) and offers a gain of 3 b/frame (150 b/s) and significant reduction in complexity, compared to the IS-641 split-VQ. An interframe BTQ scheme is also presented to exploit the redundancies between the adjacent frames. The interframe scheme is found to achieve an additional 50 b/sec reduction of the bit-rate and is based on adaptive block-based trellis quantization of the prediction residues.
Realizing a Generic Medical Image Repository for System of Systems
Authors: N Chandrashekar, S. M. Gautam, K. S. Srinivas, J Vijayananda
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

Ever since medical images were digitized in the late 1970's, there has been an explosion of diagnostic digital imaging techniques and procedures. Medical information systems have embraced the advances in technology to provide better health care for the patients and significant workflow improvements for the hospitals. This has led to a noteworthy evolution of medical information systems over the last few decades. From what used to be single stand alone modalities, the evolution has passed through cluster of modalities; multi modality clusters in a single hospital and has now reached a stage where in we have an enterprise network connecting many such hospitals thereby creating a System of Systems. Medical image repositories form a critical subsystem in the medical systems of systems. They have a diverse role to play in any hospital starting from storing of electronic patient records and scanned medical images generated by individual modalities like X-Ray and MR to storing of data in an enterprise hospital network. This paper discusses the challenges faced by a medical image repository used in the context of a system of systems and how we have realized the image repository to handle these challenges.
Software Engineering Decision Support
Authors: Guenther Ruhe, Shari Lawrence Pfleeger
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Developing software involves making hundreds, even thousands, of decisions. Decisions in the context of software systems are hard to make, as the information available is incomplete, uncertain and dynamically changing. Even worse, these decisions are often impacted by conflicting objectives, restricting constraints and stakeholder preferences.
Sting: a TCP-based network measurement tool
Authors: Stefan Savage
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

Understanding wide-area network characteristics is critical for evaluating the performance of Internet applications. Unfortunately, measuring the end-to-end network behavior between two hosts can be problematic. Traditional ICMP-based tools, such as ping, are easy to use and work universally, but produce results that are limited and inaccurate. Measurement infrastructures, such as NIMI, can produce highly detailed and accurate results, but require specialized software to be deployed at both the sender and the receiver. In this paper we explore using the TCP protocol to provide more accurate network measurements than traditional tools, while still preserving their near-universal applicability. Our first prototype, a tool called sting, is able to accurately measure the packet loss rate on both the forward and reverse paths between a pair of hosts. We describe the techniques used to accomplish this, how they were validated, and present our preliminary experience measuring the packet loss rates to and from a variety of Web servers.