ppxscal/embedding_network huggingface dataset:
Synthesizing multi-phase HDL programs
Authors: Szu-Tsung Cheng, R. K. Brayton
Venue: Proceedings of the 1996 IEEE International Verilog HDL Conference (IVC '96) (1996)

We present a novel approach to synthesizing hardware implementation from hardware description language (HDL) programs that could not be automatically synthesized before. We deal with multi phase/multi stage designs, and demonstrate that this problem can be mapped into a class of timed automata which is called "multi phase" finite state machines (FSM). We propose three procedures to decompose a multi phase FSM into a network of interacting single phase FSMs. The first two procedures are based on the region graph expansion of a timed automata (R. Alur and D. Dill, 1990). The first procedure extracts single phase FSMs iteratively from a region graph. The second procedure formulates the decomposition problem as an integer linear programming. These two region graph based procedures may suffer from explosion in the number of regions. The third procedure, without building intermediate transition structures, constructs single phase FSMs directly from the transition structure of a multi phase FSM. It is more efficient but redundancy might exist in the constructed FSMs. Not only can these procedures be used for the synthesis from a multi phase design, they can also be used to speed up FSM based simulation.
Natural Language in Model World Interfaces
Authors: Ivan Bretan
Venue:  (1995)

An essay on rationale and methodology of combining natural language and other means of interaction in multimodal interfaces.
Design and Evaluation of an Extensible Web & Telephony Server based on the J-Kernel
Authors: Daniel Spoonhower, Grzegorz Czajkowski, Chris Hawblitzel, Chi Chang, Deyu Hu, Thorsten von Eicken
Venue:  (1998)

This paper describes the design and performance of the J-Server, an integrated web and telephony server that allows untrusted Java servlets to be dynamically uploaded to extend the server''s functionality. The J-Kernel provides for protection and communication between J-Server servlets, and ensures that servlets can be cleanly terminated. A resource monitor called JRes is used to account for servlet resource usage. Two sample applications show that the overhead of J-Kernel task boundary crossings is small compared to the applications'' overall running time. Experience developing applications for the J-Server demonstrates the benefits of extensible systems based on safe language protection, and the flexibility of the servlet model.
Locating me, locating others - usability, utility and ethics
Authors: Eija Kaasinen
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Introduces new position-based mobile services i.e. route guidance, locating people, property (cars, packages, pets) and location-aware services. Includes presentations on the usability and ethical issues of locating people and team workshops developing usage scenarios.
Set Based Analysis of ML Programs (Extended Abstract)
Authors: Nevin Heintze
Venue:  (1993)

Reasoning about a program by treating program variables as sets of "values" leads to a simple, accurate and intuitively appealing notion of program approximation. This paper presents such an approach for the compile-time analysis of ML programs. To develop the core ideas of the analysis, we consider a simple untyped call-by-value functional language. Starting with an operational semantics for the language, we develop an approximate "set based" operational semantics which formalizes the intuition of treating program variables as sets. The key 3 result of the paper is an O(n ) algorithm for computing the set based approximation of a program. We then show how the analysis can be extended in a natural way to deal with arrays, arithmetic, exceptions and continuations. We also briefly describe results from an implementation of this analysis for ML programs.
Optimizing the Energy-Delay-Ringing Product in On-Chip CMOS Line Drivers
Authors: Soroush Abbaspour, Massoud Pedram, Payam Heydari
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

This paper presents a detailed empirical study and analyticalderivation of voltage wave-form and energy dissipation of globallines driven by CMOS drivers. It is shown that at high clock frequencieswhere the output voltage at the termination point of the transmission linemay not reach its steady state value during the clock period, it is possibleto reduce energy dissipation while meeting a DC noise margin by driversizing. This is in sharp contrast with the steady state analysis, whichstates that driver size has no impact on the energy dissipation per outputchange. In addition, we propose a new design metric which is the productof energy, delay and some measure of ringing in lossy transmissionlines. In particular, this paper provides closed-form expressions for theenergy dissipation, 50% propagation delay and the percentage of maximumundershoot when the circuit exhibits an under-damped behavior.This metric is used during the driver sizing problem formulation for minimumenergy-delay-ringing product.
Performance Evaluation of a Communication Optimization Model in Network-Based Parallel Computing
Authors: Ming Zhu, Wentong Cai, Bu-Sung Lee
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Network based distributed computing has been gaining popularity over the past decade. Many parallel programming languages and related parallel programming modes are becoming widely accepted. However, the execution of parallel applications on distributed systems has been hampered by the high communication overhead.To reduce the communication overhead and the completion time of a parallel application, we propose a Key Message model for parallel computing on Network of Workstations (NOWs). In the Key Message model, all messages generated in a key message path are prioritized. A Key Message path in a task graph is defined as the path that is optimized by the Key Message algorithm. All messages generated in a key message path are prioritized. Besides, the Key Message algorithm automatically finds the key message paths.In this paper, we first describe the algorithm that identifies the key messages to be prioritized in a parallel application, and then analyze the cost of the algorithm, and finally evaluate the performance of the algorithm in a simulation. Our preliminary analysis of the algorithm shows improvement over the system, which does not use prioritization scheme.
Predicting Real-Time Planner Preformance by Domain Characterization
Authors: Jak Kirman
Venue:  (1994)

There is a large class of problems that involve real-time planning and execution in stochastic domains. Classical solutions either ignore the random element while planning and then modify the plan to deal with failures, or compute the best action to perform in any circumstance. These solutions are often either too brittle or too expensive computationally. I present an approach that interleaves planning and execution and reduces the set of circumstances that need to be considered at a given time. In previous work with other researchers I have shown that this approach is practical for some stochastic problems, but left open the question of which problems the approach can be applied to effectively. I present a classification of real-time stochastic decision problems that allows the prediction of the performance of this planning system (and others) without resorting to exhaustive empirical performance estimation. For a number of such planning problems, I present results showing the correlation between the predicted performance and the actual performance as estimated empirically.
Statistical visual feature indexes in video retrieval
Authors: Xiangming Mu, Gary Marchionini
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Four statistical visual feature indexes are proposed: SLM (Shot Length Mean), the average length of each shot in a video; SLD (Shot Length Deviation), the standard deviation of shot lengths for a video; ONM (Object Number Mean), the average number of objects per frame of the video; and OND (Object Number Deviation), the standard deviation of the number of objects per frame across the video. Each of these indexes provides a unique perspective on video content. A novel video retrieval interface has been developed as a platform to examine our assumption that the new indexes facilitate some video retrieval tasks. Initial feedback is promising and formal experiments are planned.
Affine Alignment for Stroke Classification
Authors: Alberto Ruiz
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

We propose a stroke classification method based on affine alignment, appropriate for online recognition of mathematical handwriting. The method, essentially linear, is simple and computationally efficient. The modeling limitations of the affine group are overcome by choosing adequate error functions and by performing alignment with respect to interpolated prototypes. So, moderate nonlinear transformations are tolerated, making the approach invariant to a wide range of handwriting deformations.
Injecting Multiple Upsets in a SEU Tolerant 8051 Micro-Controller
Authors: F. Lima, L. Carro, R. Velazco, R. Reis
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

This paper investigates the behavior of a SEU tolerant 8051-like micro-controller protected by single error correction Hamming Code in the presence of multiple upsets. Upsets were randomly injected in all sensitive parts of the design. The experiment was emulated in a Virtex FPGA platform. Results evaluate the robustness of the tolerant 8051 in a multiple upsets environment.
Color Image Retrieval Using Virtual Reality
Venue: Proceedings of the International Conference on Information Visualisation (2000)

This paper presents a new approach for Content-Based Image Retrieval (CBIR) using Virtual Reality (VR) technology. In this paper, VR is used for sorting and visualizing image databases in a 3D virtual environment and for representing the results of the search. After reviewing the state-of-the-art of color image retrieval, the paper introduces the techniques of feature extraction, filtering, feature fusion, image browsing and navigation, and their implications for VR-based color image retrieval. Although high level semantic processing is often necessary to produce useful navigation aids and search techniques, we apply low level color, texture and shapes features for our color image discrimination associating content with other multimedia information such as image titles (text) due to effective implementation. Our feature fusion based on Weighted Multidimensional Scaling (WMDS) has added to the existing techniques. Based on this experimental investigation using a color-texture database, we have shown that virtual reality offers significant advantages as a tool for image retrieval.
Private Simultaneous Messages Protocols with Applications
Authors: Yuval Ishai, Eyal Kushilevitz
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

We study the Private Simultaneous Messages (PSM)} model which is a variant of the model proposed by Feige, Kilian and Naor (STOC '94). In the PSM model there are n players P_1,\ldots,P_n, each player P_i holding a secret input x_i (say, a bit), and all having access to a common random string. Each player sends a single message to a special player, Carol, depending on its own input and the random string (and independently of all other messages). Based on these messages, Carol should be able to compute f(x_1,\ldots,x_n) (for some predetermined function f) but should learn no additional information on the values of x_1,\ldots,x_n.Our results go in two directions. First, we present efficient PSM protocols, which improve the efficiency of previous solutions, and extend their scope to several function classes for which no such solutions were known before. These classes include most of the important linear algebraic functions; as a result, we get efficient constant-round private protocols (in the standard model) for these classes. Second, we present reductions that allow transforming PSM protocols into solutions for some other problems, thereby demonstrating the power of this model. An interesting reduction of this sort shows how to construct, based on a standard \OT (Oblivious Transfer) primitive, generalized-OT (GOT) primitives that, we believe, might be useful for the design of cryptographic protocols.
Evaluating Uniform Expressions Within Two Stepsof Minimum Parallel Time
Authors: A R Wagner
Venue:  (1996)

Consider an array of Processing Elements %5BPEs%5D, connected by a 2-dimensional grid network, and holding at most one operand of an expression in PE. Suppose that each PE is allowed in any one parallel step, to receive one item of data from any of its 4 immediate neighbors, and to transmit on datum, as well. How can an associative operator, such as addition, combine all the operands, using as little time for communication as possible%3F An expression using such a single operator is termed a uniform expression. When the total number of communication links used is the measure of goodness, this problem becomes a Steiner Tree problem, in the Manhattan Distance metric. When the measure is minimizing the parallel time to completion, a method for solving this problem is given which is optimal to within an additive constant of 2 time-steps. The method has applications when the operands are matrices, spread over an array of PE`s, as well. Some lower bounds for this problem, in more general networks, are also proven.
Stable Computation of the Complex Roots of Unity
Authors: R S Tate
Venue:  (1992)

In this paper, we show that the problem of computing the complex roots of unity is not as simple as it seems at first. In particular, the formulas given in a standard programmer''s reference book [Knuth, {\em Seminumerical Algorithms}, 1981] are shown to be numerically unstable, giving unacceptably large error for moderate sized sequences. We give alternative formulas, which we show to be superior both by analysis and experiment.
A Framework for Live Software Upgrade
Authors: Lizhou Yu, Gholamali C. Shoja, Hausi A. Müller, Anand Srinivasan
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

The demand for continuous service in mission- and safety-criticalsoftware applications is increasing. For theseapplications, it is unacceptable to shutdown and restartthe system during software upgrade. This paper examinesissues relating to online upgrades for mission- and safety-criticalsoftware applications. We believe that a dynamicarchitecture and communication model provides anexcellent foundation for runtime software evolution. Tosolve the problems mentioned above, we designed andimplemented a framework, which addresses four mainareas: dynamic architecture and communication model,reconfiguration management, the upgrade protocol, andthe upgrade technique. The framework can be used for onlineupgrading of multi-task software applications, whichprovide multiple mission-critical services.In the framework discussed in the paper, the ability tomake runtime modifications is considered at the softwarearchitecture-level. The dynamic architecture andcommunication model makes it possible for softwareapplications to add, remove, and hot swap modules on thefly. The transition scenario is specified by the upgradeprotocol. The framework also provides the mechanism formaintaining state consistency. In order to ensure areliable upgrade, a two-phase commit protocol is utilizedto implement the atomic upgrade transactions. In addition,a command line interface facilitates the reconfigurationmanagement. A simulation study of the proposedframework was carried out for live software upgrade ofseveral practical applications. The results of thesimulation are also presented.
Automatic Synthesis of Multi-Tasking Implementations from Real-Time Object-Oriented Models
Authors: M. Saksena, P. Karvelas, Y. Wang
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

In this paper we present an approach towards automatic synthesis of implementations from real-time object-oriented design models. From an application design model that addresses the functional requirements of the system, and given end-to-end timing requirements, our synthesis approach generates a feasible implementation model, i.e., one that will meet the timing requirements.The synthesis process is supported by automatic code-generation that can take the application design model and the synthesized implementation model, and can generate code for the target platform. The synthesis of an implementation model is facilitated through the use of a generic (application independent) implementation architecture; thereby reducing the synthesis problem to selecting a mapping of the application design model to the artifacts of the implementation architecture.In this paper we use a multi-threaded event handling architecture with fixed event priorities. The synthesis problem then consists of determining priorities for events and mapping of events to threads. We show how, given such a mapping, the response times can be analyzed, and then how, using the analysis, a feasible implementation model can be automatically synthesized.
Eager Class Initialization for Java
Authors: Dexter Kozen, Matt Stillerman
Venue:  (2001)

We describe a static analysis method on Java bytecode to determine class initialization dependencies. This method can be used for eager class loading and initialization. It catches many initialization circularities that are missed by the standard lazy implementation. Except for contrived examples, the computed initialization order gives the same results as standard lazy initialization.
Sparse Hard Sets for P
Authors: Dieter van Melkebeek, Mitsunori Ogihara
Venue:  (1996)

Sparse hard sets for complexity classes has been a central topic for two decades. The area is motivated by the desire to clarify relationships between completeness/hardness and density of languages and studies the existence of sparse complete/hard sets for various complexity classes under various reducibilities. Very recently, we have seen remarkable progress in this area for low-level complexity classes. In particular, the Hartmanis'' sparseness conjectures for P and NL have been resolved. This article overviews the history of sparse hard set problems and exposes some of the recent results.
Fast and Efficient Searching of Multimedia Databases Using Holographic Memory
Authors: P. Bruce Berra, Pericles A. Mitkas, Shengluan Zhong
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

With the ever-expanding size of multimedia databases it is important to seek new technologies that improve the performance of systems that manage these databases. One such technology is holographic memory which has some very interesting attributes such as massive parallelism, high speed, and content searching. A Volume Holographic Database System (VHDS) serves as a building block for a postulated terabyte Electro-Optical Computer Architecture (EOCA). Data mining and image management applications are considered for the EOCA. Using the associative processing capabilities of the holographic memory a number of queries can be completed in a matter of seconds for the entire terabyte database. These queries could take hours on sequential computers. However, the state of the art in holographic memory lags far behind electronic computing and thus considerably more research and development must be performed before these systems can realize their vast potential.
Symmetry, Nonlinear Bifurcation Analysis, and Parallel Computation
Authors: J. C. Wohlever
Venue:  (1996)

In the natural and engineering sciences the equations which model physical systems with symmetry often exhibit an invariance with respect to a particular group G of linear transformations. G is typically a linear representation of a symmetry group g which characterizes the symmetry of the physical system. In this work, we will discuss the natural parallelism which arises while seeking families of solutions to a specific class of nonlinear vector equations which display a special type of group invariance, referred to as equivariance. The inherent parallelism stems for a global de-coupling, due to symmetry, of the full nonlinear equations which effectively splits the original problem into a set of smaller problems. Numerical results from a symmetry-adapted numerical procedure, (MMcontcm.m), written in MultiMATLAB are discussed. 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
Some Comments on Functional Self-Reducibility and the NP Hierarchy
Authors: Allan B. Borodin, Alan J. Demers
Venue:  (1976)

In Valiant [11] and Schnorr [9], concepts of "functional self-reducibility" are introduced and investigated. We concentrate on the class NP and on the NP hierarchy of Meyer and Stockmeyer [7] to further investigate these ideas. Assuming that the NP hierarchy exists (specifically, assuming that $P \stackrel{\subset}{+} NP = \sum^{P}_{1} \stackrel{\subset}{+} \sum^{P}_{2}$ we show that, while every complete set in $\sum^{P}_{2}$ is functionally self-reducible, there exist sets in $\sum^{P}_{2}$ which are not functionally self-reducible.
Using SDL to Model an Object-Oriented Real-Time Software Architectural Design
Authors: J. Jenny Li, J. Robert Horgan
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

Specification and Description Language (SDL) is a formal object-oriented language for modeling real-time interactive systems. It is an International Telecommunication Union (ITU) standard.A software architecture is the structure of a program including a set of inter-communication components. These components are often independently executable super objects. We use the architecture design to answer questions such as how thesuper objects fit together and how to reuse them. This paper investigates the feasibility and benefits of using SDL to represent the dynamic aspect of the software architectures. It includes a methodology and an accompanying tool, Workflow-to-SDL-Transformation (W2S), for deriving software architectures in SDL from an originally informal use case flow definitions.The focus of research is in telecom domain, many of which are real-time interactive systems. We applied our method to a partial telecom system. The experimental results are collected and presented. Our result shows the feasibility and benefits of representing the dynamic of software architecture in SDL.
Synthesis Principles for High Performance Software
Authors: U C Smith
Venue:  (1985)

Six general principles are presented for the synthesis of large-scale software systems with high performance objectives. They are applicable in early life cycle stages for formulating the requirements and the design specifications for the software. Performance is optimized early, at a high level of abstraction rather than late, to tune code after implementation. Each of the principles and the rationale for the selection of the six is presented. Examples of their applicability are provided. The effect of these principles on the responsiveness, the maintainability, and the use of software is discussed.