ppxscal/embedding_network huggingface dataset:
Cycle-Accurate Energy Measurement and Characterization of FPGAs
Authors: Hyung Gyu Lee, Kyungsoo Lee, Yongseok Choi, Naehyuck Chang
Venue: Analog Integrated Circuits and Signal Processing (2005)

Field Programmable Gate Arrays (FPGAs) play many important roles, ranging from small glue logic replacement to System-on-Chip (SoC) designs. Nevertheless, FPGA vendors cannot accurately specify the power consumption of their products on device data sheets because the power consumption of FPGAs is strongly dependent on the target circuit, including resource utilization, logic partitioning, mapping, placement and routing. Although major CAD tools have started to report average power consumption under given transition activities, power-efficient FPGA design demands more detailed information about power consumption. In this paper, we introduce an in-house cycle-accurate FPGA energy measurement tool and energy characterization schemes spanning low-level to high-level design. This tool offers all the capabilities necessary to investigate the energy consumption of FPGAs for operation-based energy characterization, which is applicable to high-level and system-wide energy estimation. It also includes features for low-level energy characterization. We compare our tool with Xilinx XPower and demonstrate the state-machine-based energy characterization of an SDRAM controller.
Classification of flourescence in situ hybridization images using belief networks
Authors: Roy Malka, Boaz Lerner
Venue: Pattern Recognition Letters (2004)

The structure and parameters of a belief network are learned in order to classify images enabling the detection of genetic abnormalities. We compare a structure learned from the data to another structure obtained utilizing expert knowledge and to the naive Bayesian classifier and study quantization in comparison to density estimation in parameter learning.
Probability Gradient Estimation by Set-Valued Calculus and Applications in Network Design
Authors: Georg Ch. Pflug, Heinz Weisshaupt
Venue: SIAM Journal on Optimization (2005)

Let $\vartheta \mapsto P(\vartheta)$ be a set-valued mapping from $\RR^d$ into the family of closed compact polyhedra in $\RR^s$. Let $\xi$ be a $\RR^s$ valued random variable. Many stochastic optimization problems in computer networking, system reliability, transportation, telecommunication, finance, etc. can be formulated as a problem to minimize (or maximize) the probability $\PP \{ \xi \in P(\vartheta) \}$ under some constraints on the decision variable $\vartheta$. For a practical solution of such a problem, one has to approximate the objective function and its derivative by Monte Carlo simulation, since a closed analytical expression is only available in rare cases. In this paper, we present a new method of approximating the gradient of $\PP \{ \xi \in P(\vartheta) \}$ w.r. t. $\vartheta$ by sampling, which is based on the concept of setwise (weak) derivative. Quite surprisingly, it turns out that it is typically easier to approximate the derivative than the objective itself.
The mobile groups approach for the coordination of mobile agents
Authors: Raimundo J. Araújo Macêdo, Flávio M. Assis Silva
Venue: Journal of Parallel and Distributed Computing (2005)

We present the concept of mobile groups as a basic mechanism for the reliable coordination of mobile agents. Analogously to traditional group systems, mobile groups also provide message delivery guarantees and virtual synchrony. Furthermore, they make agent mobility not only visible for the group, but also consistently ordered with other group actions (such as crashes, joins, leaves, and other migrations). The mobile groups approach represents a novel mobility support mechanism, which can be used to handle reliability of mobile agents required at both, the application and system level (e.g., for coordinating distributed agents and for reliable agent migration, respectively). In this paper, we discuss the motivations for the mobile groups approach, formally define their properties, and present a membership protocol for such groups. We also discuss some implementation issues and related performance data, and present the advantages of mobile groups against mechanisms commonly employed for the coordination of mobile agents.
CHILDREN'S USE OF A DIRECT MANIPULATION LIBRARY CATALOG
Authors: Christine L. Borgman, Virginia A. Walter
Venue: ACM SIGCHI Bulletin (1991)

The Science Library Catalog project is a component of Project SEED, a hands-on science project for elementary schools based at the California Institute of Technology. The Science Library Catalog has been implemented in the libraries of two elementary schools in Los Angeles and will soon be installed in the Los Angeles Public Library, each with location-specific databases of science and technology materials. Our primary interface is a graphical browsing structure, consisting of a hierarchy of bookshelves based on the Dewey Decimal Classification, implemented in HyperCard on the Macintosh.
Proposed standard subprograms for basic linear algebraic operations
Authors: C. L. Lawson
Venue: ACM SIGNUM Newsletter (1974)

In the SIGNUM Newsletter, Vol. 8, No. 4, October 1973, page 16, Hanson, Krogh and Lawson presented the thesis that certain advantages would accrue to the scientific computing community if general agreement could be reached on the specifications of a set of FORTRAN callable subprograms for basic linear algebraic operations such as the dot product, y : = &alpha;x + y, etc. It was also proposed that constructive discussion of this idea would be furthered by having definite specifications to consider. Specific proposals for subprogram names, parameter lists, and functional specifications were given for a set of thirty-nine such subprograms in the Jet Propulsion Laboratory report JPL TM 33-660 of November 15, 1973.
Can neural networks learn cross products?
Authors: Jesse Wrenn, Andreea Olea
Venue: Journal of Computing Sciences in Colleges (2005)

The goal of our research is to determine whether a neural network, the best available model of the way the human brain works, can compute the cross-product of two vectors, and if so, what kind of architecture it needs and how small it can be.
Data Redistribution and Remote Method Invocation in Parallel Component Architectures
Authors: Felipe Bertrand, Randall Bramley, Alan Sussman, David E. Bernholdt, James A. Kohl, Jay W. Larson, Kostadin B. Damevski
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

With the increasing availability of high-performance massively parallel computer systems, the prevalence of sophisticated scientific simulation has grown rapidly. The complexity of the scientific models being simulated has also evolved, leading to a variety of coupled multi-physics simulation codes. Such cooperating parallel programs require fundamentally new interaction capabilities, to efficiently exchange parallel data structures and collectively invoke methods across programs. So-called "M×N" research, as part of the Common Component Architecture (CCA) effort, addresses these special and challenging needs, to provide generalized interfaces and tools that support flexible parallel data redistribution and parallel remote method invocation. Using this technology, distinct simulation codes with disparate distributed data decompositions can work together to achieve greater scientific discoveries.
Power-performance simulation: design and validation strategies
Authors: David Brooks, Pradip Bose, Margaret Martonosi
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Microprocessor research and development increasingly relies on detailed simulations to make design choices. As such, the structure, speed, and accuracy of microarchitectural simulators is of critical importance to the field. This paper describes our experiences in building two simulators, using related but distinct approaches.One of the most important attributes of a simulator is its ability to accurately convey design trends as different aspects of the microarchitecture are varied. In this work, we break down accuracy---a broad term--- into two sub-types: relative and absolute accuracy. We then discuss typical abstraction errors in power-performance simulators and show when they do (or do not) affect the design rule choices a user of those simulator might make. By performing this validation study using the Wattch and Power Timer simulators, the work addresses validation issues both broadly and in the specific case of a fairly widely-used simulator.
Mac Os X: The Missing Manual, Tiger Ed: The Missing Manual, Tiger Edition (Missing Manual)
Authors: David Pogue
Venue:  (2005)

You can set your watch to it: As soon as Apple comes out with another version of Mac OS X, David Pogue hits the streets with another meticulous Missing Manual to cover it with a wealth of detail. The new Mac OS X 10.4, better known as Tiger, is faster than its predecessors, but nothing's too fast for Pogue and Mac OS X: The Missing Manual. There are many reasons why this is the most popular computer book of all time. With its hallmark objectivity, the Tiger Edition thoroughly explores the latest features to grace the Mac OS. Which ones work well and which do not? What should you look for? This book tackles Spotlight, an enhanced search feature that helps you find anything on your computer; iChat AV for videoconferencing; Automator for automating repetitive, manual or batch tasks; and the hundreds of smaller tweaks and changes, good and bad, that Apple's marketing never bothers to mention.Mac OS X: The Missing Manual, Tiger Edition is the authoritative book that's ideal for every user, including people coming to the Mac for the first time. Our guide offers an ideal introduction that demystifies the Dock, the unfamiliar Mac OS X folder structure, and the entirely new Mail application. There are also mini-manuals on iLife applications such as iMovie, iDVD, and iPhoto, those much-heralded digital media programs, and a tutorial for Safari, Mac's own web browser.And plenty more: learn to configure Mac OS X using the System Preferences application, keep your Mac secure with FileVault, and learn about Tiger's enhanced Firewall capabilities. If you're so inclined, this Missing Manual also offers an easy introduction to the Terminal application for issuing basic Unix commands.There's something new on practically every page, and David Pogue brings his celebrated wit and expertise to every one of them. Mac's brought a new cat to town and we have a great new way to tame it.
Defensive programming: using an annotation toolkit to build DoS-resistant software
Authors: Xiaohu Qie, Ruoming Pang, Larry Peterson
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 describes a toolkit to help improve the robustness of code against DoS attacks. We observe that when developing software, programmers primarily focus on functionality. Protecting code from attacks is often considered the responsibility of the OS, firewalls and intrusion detection systems. As a result, many DoS vulnerabilities are not discovered until the system is attacked and the damage is done. Instead of reacting to attacks after the fact, this paper argues that a better solution is to make software defensive by systematically injecting protection mechanisms into the code itself. Our toolkit provides an API that programmers use to annotate their code. At runtime, these annotations serve as both sensors and actuators: watching for resource abuse and taking the appropriate action should abuse be detected. This paper presents the design and implementation of the toolkit, as well as evaluation of its effectiveness with three widely-deployed network services.
Elliptic curve cryptography: Java implementation
Authors: Kossi D. Edoh
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

The use of Java in developing commercial Internet applications is growing very rapidly. A major requirement for e-commerce applications is the provision of security. In this work we consider Elliptic Curve Cryptography (ECC) because of the high level of security it provides with small key sizes. ECC is ideal for use on constrained environments such as pagers, personal digital assistants, cellular phones and smart cards. We implement the ECC algorithms approved by the National Institute of Standards and Technology (NIST) in Java on the Dell Inspiron 7500. The speeds of the various ECC algorithms are provided.
Autonomic Computing and Reliability Improvement
Authors: Yuan-Shun Dai
Venue: Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2005)

The rapidly increasing complexity of systems is driving the movement towards autonomic systems that are capable of managing themselves without the need for human intervention. Without autonomic technologies, many conventional systems suffer reliability degradation due to the accumulation of errors. The autonomic management techniques break the traditional reliability degradation trend. This paper comprehensively describes the roles and functions of various autonomic components, and systematically reviews past and current technologies that have been developed to address the specific areas of the autonomic computing environment. A new mechanism of model-driven autonomic management is further presented, which is more intelligent and efficient.
A General Theory of Pass-Through in Channels with Category Management and Retail Competition
Authors: Sridhar Moorthy
Venue: Marketing Science (2005)

I provide a general formulation of the channel pass-through problem as a comparative static of the retail price equilibrium, and I analyze the impact of category management and retail competition on pass-through, focusing on brand and retailer differences, and the nature of the cost change being passed through--whether it is brand specific, retailer specific, both, or neither.With category management, a retailer's response to a brand-specific cost change is not limited to that brand; in general, a retailer will also change the prices of other brands. The cross-brand effect can be positive or negative, and, depending on its sign, it either enhances or attenuates pass-through. I explain the cross-brand effect as an interaction between two forces: a demand-substitution force that pushes for a negative cross-brand effect, and a strategic-complementarity force that pushes for a positive cross-brand effect. Retail competition adds another layer of strategic complementarity, causing other retailers to respond even for retailer-specific cost changes and increasing pass-through of categorywide cost changes. But its effect for brand-specific cost changes is ambiguous.I apply the theory to two commonly used demand functions--linear demand and nested logit--and show that they have significantly different pass-through properties. The paper concludes with a discussion of how the theory relates to the empirical literature, including the companion piece by Besanko et al. (Besanko, D., J-P. DubÃ©, S. Gupta. 2005. Own-brand and cross-brand retail pass-through.Marketing Sci.24(1) 123-137.)
Efficient Reduction of HOL Blocking in Multistage Networks
Authors: T. Nachiondo, J. Flich, J. Duato
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 9 - Volume 10 (2005)

Head-of-line blocking is one of the main problems arising in input-buffered switches. The best-known solution to this problem consists of using Virtual Output Queues (VOQs). However this strategy is not scalable. Its implementation cost increases quadratically with the number of ports in the switch. Taking into account current trends, the demand for larger number of ports in high-performance switches is likely to increase very rapidly in the future. Therefore, a scalable and cost-effective solution is required. In this paper we propose an efficient and cost-effective strategy (belonging to a family of strategies previously proposed, referred to as Destination-Based Buffer Management (DBBM)), to reduce HOL blocking in single-stage and multistage networks. The proposed strategy is based on allowing certain destinations to share the same queue. Its main purpose is to maximize network throughput whereas keeping HOL blocking to negligible values. In this paper, we apply the strategy at every switch included in a bidirectional multistage network (BMIN). We have evaluated DBBM, VOQ, and alternative strategies in different BMIN sizes and with different traffic conditions (synthetic traffic, IP traces, and I/O traces). Results show that DBBM with a reduced number of queues at each switch obtains roughly the same throughput as the VOQ mechanism. Moreover, VOQ at the switch level (as many queues as output ports at every switch) has also been analyzed. Results demonstrate that it does not scale. As the number of stages in the network increases, the VOQ solution at the switch level introduces more HOL blocking that leads to a severe degradation in network throughput. With the DBBM using 16 queues, maximum network throughput is sustained for all the traffic cases analyzed. Moreover, as the network size increases (up to a 2048×2048BMIN), DBBM keeps roughly the same performance with the same number of queues.
Identification and authentication of integrated circuits: Research Articles
Authors: Blaise Gassend, Daihyun Lim, Dwaine Clarke, Marten van Dijk, Srinivas Devadas
Venue: Concurrency and Computation: Practice Experience (2004)

This paper describes a technique to reliably and securely identify individual integrated circuits (ICs) based on the precise measurement of circuit delays and a simple challenge&ndash;response protocol. This technique could be used to produce key-cards that are more difficult to clone than ones involving digital keys on the IC. We consider potential venues of attack against our system, and present candidate implementations. Experiments on Field Programmable Gate Arrays show that the technique is viable, but that our current implementations could require some strengthening before it can be considered as secure. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Local ambassadors: local action/global impact
Authors: Dirk Knemeyer, Nick Finck, Matteo Penzo
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This position paper for the CHI2005 Development Consortium introduces the Local Ambassadors Initiative of the User Experience Network (UXnet), a collaborative international vision that unites user experience professionals with a variety of skills and backgrounds in a shared effort to develop a productive user experience community.
EXPLANATIONS OF ARTIFACTS FOR DESIGN: THE USE OF TASK STRATEGIES
Authors: Rachel Bellamy
Venue: ACM SIGCHI Bulletin (1991)

Designers look at and emulate existing good designs. Psychological theory can therefore best leverage off design by providing analyses of what makes artifacts good (Carroll, CHI 1990). This work proposes that artifacts are good to the extent that they support effective task strategies.
Discrimination of Virtual Haptic Textures Rendered with Different Update Rates
Authors: Seungmoon Choi, Hong Z. Tan
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper addresses the discriminability of virtual haptic textures rendered with different update rates. Two psychophysical experiments were conducted. In the first experiment, we examined the pairwise discriminability of textured surfaces rendered with different update rates. In the second experiment, we measured the discrimination threshold of update rate for a reference textured surface rendered at 10 kHz. The results indicated that as long as the virtual textures were perceived to be stable (i.e., free of perceptual artifacts), subjects judged them to be perceptually equivalent. These findings, when taken together with our previous findings regarding the effect of update rate on perceived instability of virtual haptic texture [1], provide a general guideline for choosing an optimal update rate for haptic texture rendering, with explicit consideration for both control and perception performance.
A multilayered feed-forward network based on qubit neuron model
Authors: Noriaki Kouda, Nobuyuki Matsui, Haruhiko Nishimura
Venue: Systems and Computers in Japan (2004)

With the development of our highly information-oriented society, there is an increasing demand for large-scale and high-level information processing. Toward this goal, studies have sought to create a new computation principle having an information processing ability exceeding the existing Neumann-type computer, such as the creation of a new computation theory or the integration of the frameworks of existing computation theories. As one such approach, quantum neural computing is considered to be interesting, which integrates neural computing and quantum computation. This paper constructs the feed-forward neural network, which is widely used in practice, based on the qubit neuron model. The 4-bit parity-check problem and the general function identification problem are considered. The performance is compared to the feed-forward network based on the conventional neuron model, and it is shown that the proposed model has a higher performance than the conventional model, using the learning diagram composed of convergence rate and the number of learning iterations. The reason for the better performance is also discussed. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(13): 43&ndash;51, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10342
Pairs of Convex Bodies with Centrally Symmetric Intersections of Translates
Authors: Valeriu Soltan
Venue: Discrete Computational Geometry (2005)

For a pair of convex bodies $K$ and $K&#x2019;$ in $E^d$, the $d$-dimensional intersections $K \cap (x + K&#x2019;),$ $x \in E^d,$ are centrally symmetric if and only if $K$ and $K&#x2019;$ are represented as direct sums $K = R \oplus P$ and $K&#x2019; = R&#x2019; \oplus P&#x2019;$ such that: (i) $R$ is a compact convex set of some dimension $m$, $0 \le m \le d,$ and $R&#x2019; = z - R$ for a suitable vector $z \in E^d$, (ii) $P$ and $P&#x2019;$ are isothetic parallelotopes, both of dimension $d-m$.
An Evolutionary Approach for a Topologic Constrained Routing Problem
Authors: Jesus Fabian, Lopez Perez
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07 (2005)

Our problem is about a routing of a vehicle with pickup and delivery of product with time window constraints.This problem requires to be attended with instances of medium scale (nodes¿100).A strong active time window exists (¿90%) with a large factor of amplitude (¿75%). This problem is NP-hard and for such motive the application of an exact method is limited by the computational time.This paper proposes a specialized genetic algorithm.We report good solutions in computational times below 5 minutes.The previous finding allows its application in business environment where the decision time is critical.