ppxscal/embedding_network huggingface dataset:
Using RT Level Component Descriptions for Single Stuck-at Hierarchical Fault Simulation
Authors: Zainalabedin Navabi, Shahrzad Mirkhani, Meisam Lavasani, Fabrizio Lombardi
Venue: Journal of Electronic Testing: Theory and Applications (2004)

This paper presents a novel fault simulation environment in VHDL. By writing a library of special fault simulation models, a traditional model is transformed into a new model that performs fault simulation using a VHDL simulation engine. Pre- and post-synthesis VHDL models are used for an effective implementation, better performance and to minimize the overhead associated with VHDL simulation. Models are written such that an automatic switching mechanism selects gate level descriptions for originating faults and behavioral descriptions for propagating them.
Proceedings of the 2005 international symposium on Physical design
Venue: International Symposium on Physical Design (2005)

It is our great pleasure to welcome you to the 2005 International Symposium on Physical Design (ISPD). This year's symposium continues a long tradition of being the premier forum for the exchange of ideas on the physical design automation of VLSI systems. This year's ISPD is being held at the Marines' Memorial Club & Hotel in San Francisco. This 9th ISPD meeting evolved from the ACM/SIGDA Physical Design Workshops that were held intermittently in the years 1987-1996. The scope of this symposium includes all aspects of physical layout design, from high-level interactions with logic synthesis, thru placement and routing down to back-end performance analysis and verification.By mastering billions of components, physical design automation tools and algorithms enable the design of the most complex man-made systems in human history. Not surprisingly, the interest in physical design has grown considerably. The 20% increase in the number of papers submitted to ISPD 2005 underlines the growing interest and importance of this field.The call for papers attracted over 70 submissions from all over the world. After a thorough review process, an outstanding set of 26 technical papers has been selected to be included in the program. These papers are complemented by talks from invited speakers that cover a wide range of topics. In addition to the contents of these proceedings, we provide access to most slides presented at the conference. Please check them out at our familiar web address: http://www.ispd.cc.We are delighted to start the symposium with a key note address by Rajeev Madhavan who is co-founder and CEO of Magma Design Automation. His vision and entrepreneurship is thoroughly influencing the field physical design. Rajeev's presentation deals with the entanglement of logic and physical design. The first day also contains an interesting tutorial on geometric programming by Steve Boyd of Stanford. Tuesday starts of with a special keynote by Jue-Hsien Chern of Mentor Graphics, who will present his vision on the evolution of physical design. Andrej Strojwas will follow with a talk on the new manufacturability issues that layout design needs to address. Tuesday also features invited presentation on advanced physical synthesis methods presented by people who are working on the latest designs. Wednesday is 'placement day'. No less than 9 teams have entered in the first ISPD placement contest, placing a number of large industrial designs. Each of the placement teams will give a short presentation before the winner will be announced at the end of the symposium. It will be very exiting to find out which method prevails.Finally, we would like to thank our reviewers and our sponsors, ACM SIGDA in cooperation with the IEEE Circuits and Systems Society. Generous support has also been provided by (in alphabetical order): Cadence Design Systems, GoldenGate Technology, IBM, Intel Corp., Magma Design Automation, Sierra Design Automation, and Synopsys Inc.
The Push Tree problem
Authors: Frédéric Havet, Marc Wennink
Venue: Networks (2004)

In this article, we introduce the Push Tree problem, which exposes the tradeoffs between the use of push and pull mechanisms in information distribution systems. One of the interesting features of the Push Tree problem is that it provides a smooth transition between the minimum Steiner Tree and the Shortest Path problems. We present initial complexity results and analyze heuristics. Moreover, we discuss what lessons can be learned from the static and deterministic Push Tree problem for more realistic scenarios characterized by high uncertainty and changing information request and update patterns. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;4&rpar;, 281&ndash;291 2004This work was done when F. Havet was supported by British Telecom
Scenario-Oriented Design for Single Chip Heterogeneous Multiprocesso
Authors: JoAnn M. Paul
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

The design of next generation single chip computers may require the selection, programming and coordination of tens to hundreds of individual processing elements (PEs) of several or tens of heterogeneous types. This paper outlines differences in the design process for these next generation single chip systems from that of traditional designs. Then it focuses on a novel design strategy, Scenario-Oriented Design (SOD). SOD is just one design strategy that arises because of the potential of considering applications, schedulers, and hardware as they interact to form a system instead of viewing them as separate design domains. By leveraging one against the other, the system and its design process can be optimized in new ways. This is made possible by reducing the modeling detail of each design domain within a system in high level simulation.
Protein name tagging guidelines: lessons learned: Conference Papers
Authors: Inderjeet Mani, Zhangzhi Hu, Seok Bae Jang, Ken Samuel, Matthew Krause, Jon Phillips, Cathy H. Wu
Venue: Comparative and Functional Genomics (2005)

Interest in information extraction from the biomedical literature is motivated by the need to speed up the creation of structured databases representing the latest scientific knowledge about specific objects, such as proteins and genes. This paper addresses the issue of a lack of standard definition of the problem of protein name tagging. We describe the lessons learned in developing a set of guidelines and present the first set of inter-coder results, viewed as an upper bound on system performance. Problems coders face include: (a) the ambiguity of names that can refer to either genes or proteins; (b) the difficulty of getting the exact extents of long protein names; and (c) the complexity of the guidelines. These problems have been addressed in two ways: (a) defining the tagging targets as protein named entities used in the literature to describe proteins or protein-associated or -related objects, such as domains, pathways, expression or genes, and (b) using two types of tags, protein tags and long-form tags, with the latter being used to optionally extend the boundaries of the protein tag when the name boundary is difficult to determine. Inter-coder consistency across three annotators on protein tags on 300 MEDLINE abstracts is 0.868 F-measure. The guidelines and annotated datasets, along with automatic tools, are available for research use. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Compact MOS Implementation of a Reaction-Diffusion CNN
Authors: Koray Karahaliloğlu, Sina Balkir
Venue: Analog Integrated Circuits and Signal Processing (2005)

A biologically inspired single layer cellular neural network (CNN) with trigger wave formation capability is presented. A novel compact MOS cell circuit is proposed which exhibits a third order I-V characteristic with negative differential resistance (NDR). Certain D.C. characteristics of both the proposed cell and the network are described and corresponding theoretical estimations are presented. It is shown that the CNN formed by resistive coupling of these cells has very low complexity and realizes a reaction-diffusion system. The dynamical network behavior is demonstrated by transient simulations of a 2D cell array at the circuit level.
On the error-detecting performance of some classes of block codes
Authors: R. Dodunekova, S. M. Dodunekov, E. Nikolova
Venue: Problems of Information Transmission (2004)

We establish the properness of some classes of binary block codes with symmetric distance distribution, including Kerdock codes and codes that satisfy the Grey-Rankin bound, as well as the properness of Preparata codes, thus augmenting the list of very few known proper nonlinear codes.
Does Use of CAM for Specific Health Problems Increase With Reduced Access to Care?
Authors: Christine S. Ritchie, Stephan F. Gohmann, W. Paul Mckinney
Venue: Journal of Medical Systems (2005)

The objective of this paper was to determine predictors of complementary and alternative medicine (CAM) use among individuals with specific health problems. Data were derived from the 1998 Medical Expenditure Panel Survey (MEPS). After adjustment for potential confounders, individuals with perceived barriers to obatining care were more likely to use any CAM treatment (OR 2.16), herbal therapy (OR 2.70) and spiritual care (OR 3.99) for a specific health problem. Individuals dissatisfied with their family's access to care were more likely to use acupuncture (OR 3.43). Dissatisfaction with quality of care was associated with increased use of spiritual therapy (OR 4.74). Perceptions of inadequate access to health care may contribute to utilization of CAM therapies; such therapies in this instance appear to be used as an alternative to mainstream medicine.
Towards an information infrastructure for the grid
Authors: S. Bourbonnais, V. M. Gogate, L. M. Haas, R. W. Horman, S. Malaika, I. Narang, V. Raman
Venue: IBM Systems Journal (2004)

In this paper we present our vision of an information infrastructure for grid computing, which is based on a service-oriented architecture. The infrastructure supports a virtualized view of the computing and data resources, is autonomic (driven by policies) in order to meet application goals for quality of service, and is compatible with the standards being developed in the technical community. We describe how we are implementing this vision in IBM today and how we expect the implementation to evolve in the future.
Visualizing the Behavior of Dynamically Modifiable Code
Authors: Bradley Dux, Anand Iyer, Saumya Debray, David Forrester, Stephen Kobourov
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Recent years have seen an increased recognition of some of the advantages offered by dynamically modifiable code, i.e., code that changes during the execution of the program. Inits full generality, it can be very difficult to understand the behavior of such self-modifiable code. This paper describes a system that graphically displays the execution behavior of dynamic code, focusing on code modifications and their effect on the structure of theprogram, i.e., the call graph and control flow graphs of functions. This can help users visualize the structure of runtime code modifications and understand the behavior of dynamically modifiable programs.
Watermarking on CNN-UM for image and video authentication: Research Articles
Authors: M. E. Yalçın, J. Vandewalle, P. Arena, A. Basile, L. Fortuna
Venue: International Journal of Circuit Theory and Applications (2004)

In this paper a new approach to fragile watermarking technique is introduced. This problem is particularly interesting in the field of modern multimedia applications, when image and video authentication are required. The approach exploits the cellular automata suitability to work as pseudorandom pattern generators and extends the related algorithms under the framework of the cellular non-linear networks (CNNs). The result is a novel way to perform watermarking generation in real time, using the presently available CNN-universal chip prototypes. In this paper, both the CNN algorithms for fragile watermarking as well as on-chip experimental results are reported, confirming the suitability of CNNs to successfully act as real-time watermarking generators. The availability of CNN-based visual microprocessors allows to have powerful algorithms to watermark in real time images or videos for efficient smart camera applications. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Optimal broadcasting on incomplete star graph interconnection networks
Authors: Tzung-Shi Chen, Nen-Chung Wang
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

Broadcasting is an important collective communication operation in many applications which use parallel computing. In this paper, we focus on designing broadcasting algorithms for general incomplete star graphs. We propose two optimal one-to-all broadcasting algorithms for incomplete star graphs with a single-port communication model. An incomplete star graph with N nodes, where (n - 1)! < N < n!, is a subgraph of an n-dimensional star graph. The first scheme is single-message one-to-all broadcasting that takes O(nlogn) steps. The second one is multi-message one-to-all broadcasting that takes O(nlogn + m) steps.
MUC-4 evaluation metrics
Authors: Nancy Chinchor
Venue: Proceedings of the 4th conference on Message understanding (1992)

The MUC-4 evaluation metrics measure the performance of the message understanding systems. This paper describes the scoring algorithms used to arrive at the metrics as well as the improvements that were made to the MUC-3 methods. MUC-4 evaluation metrics were stricter than those used in MUC-3. Given the differences in scoring between MUC-3 and MUC-4, the MUC-4 systems' scores represent a larger improvement over MUC-3 performance than the numbers themselves suggest.
A Low-order Nonconforming Finite Element for Reissner--Mindlin Plates
Authors: C. Lovadina
Venue: SIAM Journal on Numerical Analysis (2004)

We propose a locking-free element for plate bending problems, based on the use of nonconforming piecewise linear functions for both rotations and deflections. We prove optimal error estimates with respect to both the meshsize and the analytical solution regularity.
Localization in Urban Environments: Monocular Vision Compared to a Differential GPS Sensor
Authors: Eric Royer, Maxime Lhuillier, Michel Dhome, Thierry Chateau
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper we present a method for computing the localization of a mobile robot with reference to a learning video sequence. The robot is first guided on a path by a human, while the camera records a monocular learning sequence. Then a 3D reconstruction of the path and the environment is computed off line from the learning sequence. The 3D reconstruction is then used for computing the pose of the robot in real time (30 Hz) in autonomous navigation. Results from our localization method are compared to the ground truth measured with a differential GPS.
Exploring the impact of architectural parameters on energy efficiency of application-specific block-enabled SRAMs
Authors: Prassanna Sithambaram, Alberto Macii, Enrico Macii
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Application-Specific Block-Enabled (ASBE) SRAMs represent a viable solution for reducing energy consumption in embedded memories. The basic idea behind ASBE architectures is that of partitioning the memory array into a number of non-uniformly sized blocks, such that memory access cost is reduced. The number and sizes of the partitions yielding a minimum power implementation of the SRAM macro is determined by the partitioning algorithm based on the memory access profile obtained as a result of the application (or application mix) executed by the processor. Given the complexity of the design space we are dealing with, there are several degrees of freedom that the partitioning engine may exploit to come up with the most energy-efficient memory architecture. In this paper, we investigate how the quality of the partitioned memory depends on the architectural parameters that define the memory structure (e.g., min and max number of lines per partition, min and max number of words per line, granularity of the partitions); such parameters, in turn, are constrained by the technology and process of choice. We believe that the results presented in this work will provide very useful guidelines for a succesfull adoption of the ASBE approach in practice, as this design paradigm is gaining a lot of attention for the new generations of embedded systems.
Asymmetrical Occlusion Handling Using Graph Cut for Multi-View Stereo
Authors: Yichen Wei, Long Quan
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel formulation that handles occlusion using only one depth map in an asymmetrical way. Consequently, multiview information is efficiently accumulated to achieve high accuracy. The resulting energy function is complex and approximate graph cut based solutions are proposed. Our approach complements the theory and extends the applicability of using graph cut in stereo. The experiments demonstrate that the approach is comparable with the state of the art and potentially more efficient for multi-view stereo.
OverHear: augmenting attention in remote social gatherings through computer-mediated hearing
Authors: David Smith, Matthew Donald, Daniel Chen, Daniel Cheng, Changuk Sohn, Aadil Mamuji, David Holman, Roel Vertegaal
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

One of the problems with mediated communication systems is that they limit the user's ability to listen to informal conversations of others within a remote space. In what is known as the Cocktail Party phenomenon, participants in noisy face-to-face conversations are able to focus their attention on a single individual, typically the person they look at. Media spaces do not support the cues necessary to establish this attentive mechanism. We addressed this issue in our design of OverHear, a media space that augments the user's attention in remote social gatherings through computer mediated hearing. OverHear uses an eye tracker embedded in the webcam display to direct the focal point of a robotic shotgun microphone mounted in the remote space. This directional microphone is automatically pointed towards the currently observed individual, allowing the user to OverHear this person's conversations.
Research Note--Cost Uncertainty Is Bliss: The Effect of Competition on the Acquisition of Cost Information for Pricing New Products
Authors: Markus Christen
Venue: Management Science (2005)

We examine the optimal acquisition of information about a common uncertain cost factor by two competing firms seeking to price a new product. We show that existing findings regarding the acquisition of demand information or the acquisition of either cost or demand information related to quantity decisions do not extend to this case. For cost information with price competition, the information acquisition strategies are strategic substitutes, even though the price decisions that are based on the information are strategic complements. Competition decreases the expected value of cost information. Moreover, when competition is intense and the cost of information low, identical firms do not acquire the same amount of cost information--even when information is free. Cost uncertainty acts like a "fog" that lessens the destructive effect of price competition when products are close substitutes, and thus increases expected profits. Buyers, on the other hand, are better off when competing firms are informed about cost. Even though the expected value of cost information strictly decreases with competition, the optimal price for industry-specific cost information set by an information vendor increases with competition when the firms' products are sufficiently substitutable.
Scalability and accuracy in a large-scale network emulator
Authors: Amin Vahdat, Ken Yocum, Kevin Walsh, Priya Mahadevan, Dejan Kostić, Jeff Chase, David Becker
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

This paper presents ModelNet, a scalable Internet emulation environment that enables researchers to deploy unmodified software prototypes in a configurable Internet-like environment and subject them to faults and varying network conditions. Edge nodes running user-specified OS and application software are configured to route their packets through a set of ModelNet core nodes, which cooperate to subject the traffic to the bandwidth, congestion constraints, latency, and loss profile of a target network topology.This paper describes and evaluates the ModelNet architecture and its implementation, including novel techniques to balance emulation accuracy against scalability. The current ModelNet prototype is able to accurately subject thousands of instances of a distrbuted application to Internet-like conditions with gigabits of bisection bandwidth. Experiments with several large-scale distributed services demonstrate the generality and effectiveness of the infrastructure.
High-Radix Logarithm with Selection by Rounding: Algorithm and Implementation
Authors: J. -A. Piñeiro, M. D. Ercegovac, J. D. Bruguera
Venue: Journal of VLSI Signal Processing Systems (2005)

A high-radix digit-recurrence algorithm for the computation of the logarithm, and an analysis of the tradeoffs between area and speed for its implementation, are presented in this paper. Selection by rounding is used in iterations j ¿ 2, and by table look-up in the first iteration. A sequential architecture is proposed, and estimates of the execution time and hardware requirements are obtained for n = 16, 24, 32, 53 and 64 bits of precision and for radix values from r = 8 to r = 1024. These estimates are obtained according to an approximate model for the delay and area of the main logic blocks. We show that the most efficient implementations are obtained for radices ranging from r = 32 to r = 256, reducing the execution time by half with respect to a radix-4 implementation with redundant arithmetic.
Synthesizing Representative I/O Workloads for TPC-H
Authors: Jianyong Zhang, Anand Sivasubramaniam, Hubertus Franke, Natarajan Gautam, Yanyong Zhang, Shailabh Nagar
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

Synthesizing I/O requests that can accurately capture workload behavior is extremely valuable for the design, implementation and optimization of disk subsystems. This paper presents a synthetic workload generator for TPC-H, an important decision-support commercial workload, by completely characterizing the arrival and access patterns of its queries. We present a novel approach for parameterizing the behavior of inter-mingling streams of sequential requests, and exploit correlations between multiple attributes of these requests, to generate disk block-level traces that are shown to accurately mimic the behavior of a real trace in terms of response time characteristics for each TPC-H query.