ppxscal/embedding_network huggingface dataset:
Circuit-simulated obstacle-aware Steiner routing
Authors: Yiyu Shi, Paul Mesa, Hao Yu, Lei He
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2007)

This article develops circuit-simulated routing algorithms. We model the routing graph by an RC network with terminals as inputs, and show that the faster an output reaches its peak, the higher the possibility for the corresponding Hanan or escape node to become a Steiner point. This enables us to select Steiner points and then apply any minimum spanning tree algorithm to obtain obstacle-free or obstacle-aware Steiner routing. Compared with existing algorithms, our algorithms have significant gain on either wirelength or runtime for obstacle-free routing, and on both wirelength and runtime for obstacle-aware routing.
Very sparse kernel models: predicting with few examples and few features
Authors: Gregory Grudic
Venue:  (2006)

Machine learning methods are being used in application domains as diverse as robotics, natural language processing, and bioinformatics which all involve large amounts of data. The data is typically organized as a set of examples, where each example has a set of features and a label. Supervised machine learning is the study of automatically building a model from a set of labeled training data. After building a model it is then used on unseen data to predict labels from a set of features. Many algorithms in the field of sparse kernel models find a model that can be evaluated using only a small number of training examples (the training examples are used to construct the basis/kernel functions of the model). In this sense, these models are "predicting with few examples". "Predicting with few features" has been studied extensively in the field of feature selection. The idea of feature selection is to choose only a small subset of the available features for predicting. Feature selection is typically used in domains where the data contains many spurious features, i.e. features which are not relevant for predicting labels. This thesis proposes to combine "predicting with few examples" and "predicting with few features" into a single framework. The goal is to produce accurate models which use a small number of examples and a small number of features when making predictions. These models are obtained by a novel learning algorithm which simultaneously minimizes the number of examples and the number of features used for making predictions. Experimental results on synthetic, benchmark, and robotic vision data demonstrating the effectiveness of the proposed framework are provided.
A Model for Automatic Data Partitioning
Authors: Paul D. Hovland, Lionel M. Ni
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

In order to efficiently exploit global parallelism, it is essential to find a good way to distribute data among the processors in distributed-memory parallel computer systems. A formal technique utilizing augmented data access descriptors (ADADs) to determine this distribution is presented. This technique differs from previous approaclies in that it views the problem of finding a good distribution as an extension of data dependence analysis. The importance of this difference is demonstrated through an explanation of how ADADs facilitate interprocedural analysis, directed loop transformations, and incremental analysis, which may lead to improvements in the eficieiicy of both program developn~enta nd the program itself.
SLA-based Data Integration on Database Grids
Authors: Tiezheng Nie, Guangqi Wang, Derong Shen, Meifang Li, Ge Yu
Venue: Proceedings of the 31st Annual International Computer Software and Applications Conference - Volume 02 (2007)

A Database grid can provide a robust distributed environment for accessing and manipulating different database resources. While current challenges focus on managing database resources and ensuring the quality of data integration. This paper describes a Service Level Agreement (SLA) based data integration model, which includes SLA-based Resource Description Model, SLA-based Query Model, SLA-based Matching Algorithm and SLA-based Evaluation Model. The SLAs of a database resource is defined by SLA-based Resource Description Model. The SLA-based Query Model is defined to normalize the various types of queries. The SLA-based Matching Algorithm has been proposed to match schemas of resources for each subquery, and then the quality of database resources is evaluated by SLA-based Evaluation Model to obtain the final query solutions. Experimental results have shown that SLA-based Data Integration Model can provide more stable database resources and save time cost in data integration applications as well.
Smell Peak Prediction During Black Tea Fermentation Process Using Time-Delay Neural Network on Electronic Nose Data
Authors: Bipan Tudu, Barun Das, Nabarum Bhattacharyya, Arun Jana, Devdulal Ghosh, Rajib Bandyopadhyay
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Fermentation process in black tea manufacturing plays the key role in determining the quality of finished tea. During this process, a complex chain of biochemical changes occurs and the process should be terminated once the optimum fermentation point is reached. Present day practice for detection of optimum fermentation point is purely subjective, and is carried out by experienced industry personnel. Even though chemical methods are available, but they are expensive, time-consuming and off-line. A study has been made on real time smell monitoring of black tea during fermentation process using electronic nose and is reported in this paper. Time-delay neural network (TDNN) architecture has been used on time series data obtained from electronic nose for smell peak prediction during the fermentation process. The online predicted result using TDNN seems very promising to detect the optimum fermentation time for black tea manufacturing process.
Opportunistic log: efficient installation reads in a reliable storage server
Authors: James O'Toole, Liuba Shrira
Venue: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation (1994)

In a distributed storage system, client caches managed on the basis of small granularity objects can provide better memory utilization then page-based caches. However, object servers, unlike page servers, must perform additional disk reads. These installation reads are required to install modified objects onto their corresponding disk pages. The opportunistic log is a new technique that significantly reduces the cost of installation reads. It defers the installation reads, removing them from the modification commit path, and manages a large pool of pending installation reads that can be scheduled efficiently. Using simulations, we show that the opportunistic log substantially enhances the I/O performance of reliable storage servers. An object server without the opportunistic log requires much better client caching to outperform a page server. With an opportunistic log, only a small client cache improvement suffices. Our results imply that efficient scheduling of installation reads can substantially improve the performance of large-scale storage systems and therefore introduces a new performance tradeoff between page-based and object-based architectures.
Incorporating VHDL into the digital curriculum
Authors: K. J. Reid
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Summary form only given. Traditional courses in digital design, especially in engineering technology, have focused on and used TTL logic integrated circuits in lecture and lab. It is still difficult to find a textbook suitable for a technology program that is not based on these chips. However, TTL is very rarely used in industry today. This work in progress report discusses the planned implementation of advanced programmable logic devices (PLDs) and associated software into the digital curriculum, including introductory courses. 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
Effects of Projectile and Cover Material Strength and Projectile Shape on the Impact Initiation of Composition B
Authors: W. Lawrence, J. Starkenberg
Venue: Proceedings of the HPCMP Users Group Conference (2006)

To improve understanding of the response of munitions impacted by various types of projectiles, a combined experimental and computational study was conducted. The experimental configurations were simulated using the CTH hydrocode and the History Variable Reactive Burn (HVRB) initiation model. Three-dimensional simulations of projectile impact on covered explosives were performed and the critical velocities for initiation were determined. Simulations performed for the purpose of determining whether the relative strength of the projectile and the cover affect the critical velocity showed little influence. Additional simulations for projectiles shaped like parallelepipeds were performed to shed light on the effect of the aspect ratio of the impacting face of the projectile. The results showed that face area alone does not determine critical velocity.
Discrete-time GI/Geo/1 queue with multiple working vacations
Authors: Ji-Hong Li, Nai-Shuo Tian, Wen-Yuan Liu
Venue: Queueing Systems: Theory and Applications (2007)

Consider the discrete time GI/Geo/1 queue with working vacations under EAS and LAS schemes. The server takes the original work at the lower rate rather than completely stopping during the vacation period. Using the matrix-geometric solution method, we obtain the steady-state distribution of the number of customers in the system and present the stochastic decomposition property of the queue length. Furthermore, we find and verify the closed property of conditional probability for negative binomial distributions. Using such property, we obtain the specific expression for the steady-state distribution of the waiting time and explain its two conditional stochastic decomposition structures. Finally, two special models are presented.
Synthesis and Control of Asynchronous and Distributed Systems
Authors: Philippe Darondeau
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

We survey research works on asynchronous systems synthesis, including PN synthesis and control synthesis.
Escher: A New Technology Transitioning Model
Authors: Janos Sztipanovits, John Bay, Larry Rohrbough, Shankar Sastry, Douglas C. Schmidt, Norm Whitaker, Don Wilson, Don Winter
Venue: Computer (2007)

The Escher model relies on a mix of government and industry funding to identify cross-industry needs and select technologies for maturation and transitioning.
Texture decomposition and correlation thresholding for realistic low-bit rate model-based coding
Authors: L. Yin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Facial texture updating and compression are crucial in achieving realistic facial animation for low-bit rate coding. We present an efficient way to update and encode facial textures in model-based coding. Differing from traditional methods which update the entire facial texture, we propose a partial texture updating method for realistic facial expression synthesis with facial wrinkles. Experiments on video sequences demonstrate the advantage of the proposed algorithm in keeping transmission cost low while producing realistic expressions.
Reliability, efficiency, and timeliness as selectable services in wireless sensor networks
Authors: John Heidemann
Venue:  (2006)

Data dissemination protocols for sensor networks provide resource discovery and data delivery to applications in unadministered, energy-limited, volatile environments. In order to be useful to a wide variety of applications these protocols must balance effectiveness with energy conservation. Data dissemination protocols, therefore, typically provide constrained levels of reliability, efficiency, and timeliness to the applications that use them. The levels of service actually delivered to an application are the result of design trade-offs at lower layers as well as environmental factors such as radio interference and topology. While the resultant levels of service may be appropriate for some applications, other applications require higher levels in order to function as intended. We therefore propose and demonstrate a well-engineered approach to the provision of service levels that fits nicely into existing sensor network architectures. This dissertation defines a service space for data dissemination and demonstrates how to provide regions in this space in a manner based on the proven architectural principles of abstraction, layering, and dynamic protocol stacks. We furnish a wide range of service levels related to resource discovery and data delivery in sensor networks with emphasis on those that are difficult to achieve in real-world deployments. We eschew the construction of monolithic data dissemination protocols that are specific to the service needs of a particular class of application. Rather we combine our service components with existing general purpose network modules to produce desired levels of service. We introduce three new protocols in this dissertation that provide non-default levels of service. The Reliable Broadcast Propagation (RBP) protocol provides probabilistic guarantees that a broadcast will propagate to all nodes in a network. Bayesian Assisted Resource Discovery (BARD) provides efficient resource discovery by modeling search and discovery as a stochastic process. Reliable Multi-Segment Transport (RMST) is a transport layer for sensor networks that provides data delivery guarantees. Our protocols expand the service space made available to applications, which is a sure way to increase the viability and applicability of sensor networks in solving real-world problems.
Information and interaction in marketspace: towards an open agent-based market infrastructure
Authors: Joakim Eriksson, Niclas Finne, Sverker Janson
Venue: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2 (1996)

The lack of structure of information and interaction in current web-based electronic commerce makes partial or full automation infeasible. We describe the first steps towards an open agent-based market infrastructure, with well-defined information and interaction models allowing agents to locate relevant market participants, exchange interests, and negotiate deals. We also describe an architecture and a prototype based on these ideas, and illustrate the operation of the prototype in an example scenario.
Advances in using hierarchical mixture of experts for signal classification
Authors: V. Ramamurti
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

The hierarchical mixture of experts (HME) architecture is a powerful tree structured architecture for supervised learning. An efficient one-pass algorithm to solve the M-step of the EM iterations while training the HME network to perform classification tasks, is first described. This substantially reduces the training time compared to using the IRLS method to solve the M-step. Further, a pre-processing stage is proposed, consisting of radial basis function kernels, aimed at reducing the tree height of the HME network. Alternatively, employment of a localized form of gating network is suggested to reduce the tree height. Shorter HME trees, with much fewer network parameters, are significantly faster to train. Simulation results are presented on a real life data set.
Memory Reference Behavior of Compiler Optimized Programs on High Speed Architectures
Authors: John W. C. Fu, Janak H. Patel
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

High speed architectures usually employ some form of parallelism or concurrency. Parallel or concurrent execution of a program not only increases the rate at which references are issued to the memory system but also changes the behavior of these references, relative to its serial-scalar execution. This paper reports the variations in program memory reference behavior when automatically transformed by a compiler and executed on parallel and vector archirectures. Using traces of the PERFECT benchmark set, executed on on Aliiant FX180 in a single scalar processor, single vector processor, scalar multiprocessor and vector multiprocessor modes, measurements are reported for issue rates, reference locality and data sharing.
A Retrospective on Information, Strategy, and Economics: After 20 Years at HICSS, What Have We Learned about IT and Strategy?
Authors: Eric K. Clemons
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In its twenty years the mini-track on information, strategy, and economics has made considerable progress in developing theory that can serve as the basis for decision-making when managers face ambiguous and uncertain problems in an unfamiliar and rapidly changing environment. Just as scientists in other disciplines use experience and a small set of paradigmatic problems to structure unfamiliar situations, information strategy and economics provides its own set of paradigms to guide and structure the use of experience in managerial settings.
Using a computer game to promote a healthy life style to college students: knowledge gain and attitudinal change
Authors: Margaret Mclaughlin
Venue:  (2006)

The dietary habits and physical activity level of young adults between the ages of 18 and 24 have increasingly drawn researchers' attention. The current dissertation study developed a computer game-based healthy lifestyle promotion program to target young adults, especially college students. In collaboration with a dietitian and two programmers, this RightWay Caf&eacute; game was developed based on Social Cognitive Theory, Health Belief Model, and Theory of Reasoned Action. This dissertation study examined the effect of using a computer game to teach nutrition and weight management knowledge, and to change psychosocial determinants of behavioral change regarding leading a healthy lifestyle. Two experiments were conducted. Experiment 1 (N=40) was a randomized controlled study, which demonstrated that playing the RightWay Caf&eacute; game was effective in increasing nutrition knowledge, self-efficacy, perceived benefit, and intention to lead a healthy lifestyle. The game also had long-term effects on these psychosocial determinants of behavioral change regarding leading a healthy lifestyle. To investigate the underlying mechanism of how the computer game works, experiment 2 (N=80) adopted a 2 by 2 design with the experience mode (game playing vs. game watching) and role similarity (playing or watching a similar role vs. playing or watching a dissimilar role) as the two between-subjects factors. Playing the game was more effective than watching the playback of other people's game playing to increase self-efficacy and intention to lead a healthy lifestyle, even though the contents the participants received were comparable. Identification with the role in the game was the mediator for the playing effect. In addition, playing or watching a similar role was more effective than playing or watching a dissimilar role. This study extended Social Cognitive Theory into the virtual experience domain. The summative evaluation of the RightWay Caf&eacute; game also demonstrated that computer game could be an effective tool for health intervention. Theoretical and practical implications of the current dissertation study are discussed.
Discriminative utterance verification using minimum string verification error (MSVE) training
Authors: M. G. Rahim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper focuses on one aspect of achieving flexible speech recognition, namely, improving the ability to cope with naturally spoken utterances through discriminative utterance verification. We propose an algorithm for training utterance verification systems based on the minimum verification error (MVE) training framework. Experimental results on speaker-independent connected digits, show a significant improvement in verification accuracy when the discriminant function used in MVE training is made consistent with the confidence measure used in utterance verification. At a 10% rejection rate, for example, the new proposed method reduces the string error rate by a further 22.7% over our previously reported results in which the MVE based discriminative training was not incorporated.
An object-oriented communication mechanism for parallel systems
Authors: Eshrat Arjomandi, William G. O'Farrell, Gregory V. Wilson
Venue: Proceedings of the 2nd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 2 (1996)

ABC++ is a portable object-oriented type-safe class library for parallel programming in C++. It supports active objects, synchronous and asynchronous object interactions, and object-based shared regions on both shared- and distributed-memory parallel computers. ABC++ is written in, and compatible with, standard C++: no language extensions or pre-processors are used. This paper focuses on its use of an object-oriented technique called smart messages to support object interactions. Smart messages demonstrate the effectiveness of object-oriented programming in encapsulating low-level details of concurrency and in improving software portability.
AFRAID: a frequently redundant array of independent disks
Authors: Stefan Savage, John Wilkes
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

Disk arrays are commonly designed to ensure that stored data will always be able to withstand a disk failure, but meeting this goal comes at a significant cost in performance. We show that this is unnecessary. By trading away a fraction of the enormous reliability provided by disk arrays, it is possible to achieve performance that is almost as good as a non-parity-protected set of disks. In particular, our AFRAID design eliminates the small-update penalty that plagues traditional RAID 5 disk arrays. It does this by applying the data update immediately, but delaying the parity update to the next quiet period between bursts of client activity. That is, AFRAID makes sure that the array is frequently redundant, even if it isn't always so. By regulating the parity update policy, AFRAID allows a smooth trade-off between performance and availability. Under real-life workloads, the AFRAID design can provide close to the full performance of an array of unprotected disks, and data availability comparable to a traditional RAID 5. Our results show that AFRAID offers 42% better performance for only 10% less availability, 97% better for 23% less, and as much as a factor of 4.1 times better performance for giving up less than half RAID 5's availability. We explore here the detailed availability and performance implications of the AFRAID approach.