ppxscal/embedding_network huggingface dataset:
Distributed deadlock detection in Ada run-time environments
Authors: Chia-Shiang Shih, John A. Stankovic
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

Distributed deadlock detection has been studied in distributed database systems and distributed timesharing operating systems, but has not been widely used in real-time systems such as Ada runtime environments. In this paper we are interested in explicitly tying the formal properties of deadlock algorithms to Ada and its runtime system. We analyze and categorize the deadlock problem in Ada environments into four levels of complexity by using Knapp's hierarchy of deadlock models. To fully support Ada semantics it is necessary to develop solutions for the most complex level. Many Ada applications, however, do not utilize all the features that Ada provides. Consequently, according to the characteristics of an application, the deadlock problem may be simplified by imposing certain restrictions on the use of Ada. We develop a series of solutions depending on the level of restriction imposed on the use of Ada and we relate those solutions to the levels of complexity associated with the theoretical models. Two algorithms related to the first two levels of complexity are presented in this paper.
Clearance Pricing and Inventory Policies for Retail Chains
Authors: Stephen A. Smith, Dale D. Achabal
Venue: Management Science (1998)

Clearance pricing and end of season inventory management are challenging and important problems in retailing. Sales rates depend upon price, seasonal effects, and the remaining assortment of items available to customers. There is little time to react to observed sales, and pricing errors result in either loss of potential revenue or excess inventory to be liquidated. This paper develops optimal clearance prices and inventory management policies that take into account the impact of reduced assortment and seasonal changes on sales rates. Versions of these policies have been tested and implemented at three major retail chains and these applications are summarized and discussed.
Forward model checking techniques oriented to buggy designs
Authors: Hiroaki Iwashita, Tsuneo Nakata
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

Forward model checking is an efficient symbolic model checking method for verifying realistic properties of sequential circuits and protocols. In this paper, we present the techniques that modify the order of state traversal on forward model checking, and that dramatically improve average CPU time for finding design errors. A failing property has to be checked again and again to analyze the bug until it is corrected. The techniques, therefore, can have significant impacts on actual verification tasks. We use a modified regular/omega-regular expression to represent a set of illegal state transition sequences of an FSM. It makes the problem clear and gives us a sense of depth-first traversal, not on the state space, but on the property.
A note on before and after metamethods
Authors: Chris Zimmermann
Venue: ACM SIGPLAN Notices (1997)

With the advent of object-oriented metalevel architectures, a new programming paradigm in the shape of before and after metamethods has arrived. This paradigm allows the hidden execution of additional functionality that previously had to be inserted explicitly into the source code of a program. Typically, this was implemented as a pair of invocations to some initialisation and finalisation routines. This paper provides the formal proof that before and after metamethods have the same expressive power as the explicit invocation of functionality, resulting in the equivalence of both paradigms.
Recent trends in automatic information retrieval
Authors: Gerard Salton
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

Substantial successes were achieved in the early years in automatic indexing and retrieval using single term indexing theories with term weight assignments based on frequency considerations. The development of more refined indexing systems using thesaurus aids and automatically constructed term association maps changed the retrieval effectiveness only slightly. The recent introduction of the relevance concept in the form of probabilistic retrieval models provided a firm basis for term weighting and document ranking practices. However, the probabilistic methods were not helpful in substantially enhancing the retrieval effectiveness. At the present time, attempts are made to add artificial intelligence concepts to the document retrieval environment in the form of fancy graphics interfaces, learning systems for query and document indexing and for collection searching, extended logic models relating documents and information requests, and analysis methods based on the use of semantic maps and other kinds of knowledge structures. Using the earlier developments and evaluation results as guidelines, an attempt is made to outline the information retrieval environment of the future and to assess the usefulness of some of the currently proposed search and retrieval methods.
Random variate generation in one line of code
Authors: Luc Devroye
Venue: Proceedings of the 28th conference on Winter simulation (1996)

A random variate with a given non-uniform distribution can often by generated in one assignment statement if a uniform source and some simple functions are available. We review such one-line methods for most of the key distributions.
3-D Heart Modeling and Motion EstimationBased on Continuous Distance Transform Neural Networks andAffine Transform
Authors: Yen-Hao Tseng, Jenq-Neng Hwang, Florence H. Sheehan
Venue: Journal of VLSI Signal Processing Systems (1998)

In this paper, we apply the previously proposed continuous distance transform neural network (CDTNN) to represent 3-D endocardial (inner) and epicardial (outer) contours and quantitatively estimate the motion of left ventricles of human hearts from ultrasound images acquired using transesophageal echo-cardiography. This CDTNN has many good properties as the conventional distance transforms, which are suitable for 3-D object representation and deformation estimation. We have successfully represented the 3-D epicardia and endocardia of left ventricles using CDTNNs trained by as few as 7.5% of the manually traced data. The mean absolute error in the testing for one patient over the 27 testing planes were (1.4 &plusmn; 1.2 mm) for the endocardium, (1.3 &plusmn; 1.0 mm) for the epicardium at end diastole and (1.4 &plusmn; 1.2 mm) for the endocardium vs. 1.2 &plusmn; 1.0 mm for the epicardium at end systole. The absolute error measured compares favorably with the human inter-observer variability reported for analyzing distances. With this unique distance transform representation that is continuous and differentiable, we are also able to systematically and effectively measure the amount of 3-D heart motion in terms of affine transform.
Using metalevel techniques in a flexible toolkit for CSCW applications
Authors: Paul Dourish
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1998)

Ideally, software toolkits for collaborative applications should provide generic, reusable components, applicable in a wide range of circumstances, which software developers can assemble to produce new applications. However, the nature of CSCW applications and the mechanics of group interaction present a problem. Group interactions are significantly constrained by the structure of the underlying infrastructure, below the level at which toolkits typically offer control. This article describes the design features of Prospero, a prototype CSCW toolkit designed to be much more flexible than traditional toolkit techniques allow. Prospero uses a metalevel architecture so that application programmers can have control over not only how toolkit components are combined and used, but also over aspects of how they are internally structured and defined. This approach allows programmers to gain access to &ldquo;internal&rdquo; aspects of the toolkit's operation that affect how interaction and collaboration proceed. This article explains the metalevel approach and its application to CSCW, introduces two particular metalevel techniques for distributed data management and consistency control, shows how they are realized in Prospero, and illustrates how Prospero can be used to create a range of collaborative applications.
Adaptive plug-and-play components for evolutionary software development
Authors: Mira Mezini, Karl Lieberherr
Venue: ACM SIGPLAN Notices (1998)

In several works on design methodologies, design patterns, and programming language design, the need for program entities that capture the patterns of collaboration between several classes has been recognized. The idea is that in general the unit of reuse is not a single class, but a slice of behavior affecting a set of collaborating classes. The absence of large-scale components for expressing these collaborations makes object-oriented programs more difficult to maintain and reuse, because functionality is spread over several methods and it becomes difficult to get the "big picture". In this paper, we propose Adaptive Plug and Play Components to serve this need. These components are designed such that they not only facilitate the construction of complex software by making the collaborations explicit, but they do so in a manner that supports the evolutionary nature of both structure and behavior.
Fold and unfold for program semantics
Authors: Graham Hutton
Venue: Proceedings of the third ACM SIGPLAN international conference on Functional programming (1998)

In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion operator fold can be used to structure denotational semantics, how the dual recursion operator unfold can be used to structure operational semantics, and how algebraic properties of these operators can be used to reason about program semantics. The techniques are explained with the aid of two main examples, the first concerning arithmetic expressions, and the second concerning Milner's concurrent language CCS. The aim of the paper is to give functional programmers new insights into recursion operators, program semantics, and the relationships between them.
Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification
Authors: Masayuki Ito, Naofumi Takagi, Shuzo Yajima
Venue: IEEE Transactions on Computers (1997)

An efficient initial approximation method for multiplicative division and square root is proposed. It is a modification of the piecewise linear approximation. The multiplication and the addition required for the linear approximation are replaced by only one multiplication with a slight modification of the operand. The same accuracy is achieved. The modification of the operand requires only a bit-wise inversion and a one-bit shift, and can be implemented by a very simple circuit. One clock cycle may be saved, because the addition is removed. The required table size is also reduced, because only one coefficient instead of two has to be stored.
Module generation of complex macros for logic-emulation applications
Authors: Wen-Jong Fang, Allen C.-H. Wu, Duan-Ping Chen
Venue: Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays (1997)

Logic emulation is a technique that uses dynamically reprogrammable systems for prototyping and design verification. Using an emulator, designers can realize designs through a software configuration process and perform real-time design verification before fabricating the chip into silicon. However, converting designs into an emulator involves the use of multi-phase design tasks, which is a very time-consuming process. Hence, shortening the Time-To-Emulation (TTE) is always the main concern for the logic-emulation design process. One approach t o shorten the design processing time is to replace portions of the design with macro cells. This paper presents a module generator for logic-emulation applications, which is able to generate macro cells of arbitrarily complex functions described in High-level Descriptive Languages the (HDLs), Furthermore, the module generator can effectively generate a multiple-FPGA macro for large macros which can not fit in a single FPGA chip. Experiments using the module generator for logic emulation are reported. The results demonstrate that the module generator can effectively and efficiently generate complex macros from their Register-Transfer-Level (RTL) description. In addition, the results also show that the design processing time is significantly shortened when the module generation method is incorporated into the logic-emulation design flow.
Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits
Authors: Gianpiero Cabodi, Paolo Camurati, Luciano Lavagno, Stefano Quer
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Extending the applicability of reachability analysis to large andreal circuits is a key issue.In fact they are still limited forthe following reasons: peak BDD size during image computation,BDD explosion for representing state sets and very highsequential depth.Following the promising trend of partitioning and problem decomposition,we present a new approach based on a disjunctivepartitioned transition relation and on an improved iterativesquaring.In this approach a Finite State Machine is decomposedand traversed one "functioning-mode" at a time bymeans of the "disjunctive" partitioned approach.The overall algorithm aims at lowering the intermediate peakBDD size pushing further reachability analysis.Experimentson a few industrial circuits containing counters and on somelarge benchmarks show the feasibility of the approach.
Selection using a one-eyed cursor in a fish tank VR environment
Authors: Colin Ware, Kathy Lowther
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1997)

This study investigates the use of a 2D cursor presented to one eye for target selection in Fish Tank VR and other stereo environments. It is argued that 2D selection of 3D objects should be less difficult than 3D selection. Vision research concerning binocular rivalry and the tendency we have to project images onto surfaces suggests that this mode of viewing will not seem particularly unnatural. A Fitt's Law experiment was done to directly compare target acquisition with a one-eyed 2D cursor and target acquisition using a 3D cursor. In both cases we used the same input device (Polhemus Fastrak) so that the device lag and gain parameters were exactly matched. The results show a large improvement in target acquisition time using the 2D cursor. The practical implications of this is that the 2D selection method using a one-eyed cursor in preferable to the 3D selection method. Theoretical implications relate to methods for extending Fitts' Law from the one-dimensional task for which it was designed to 2D and 3D tasks. We conclude that the existing approaches to this problem are not adequate.
Extending the Schematic Protection Model II: revocation
Authors: Vijay Varadharajan
Venue: ACM SIGOPS Operating Systems Review (1997)

The Schematic Protection Model, SPM, allows us to specify the protection structure of a system and gives an algorithm to reason about the transmission of privileges in the system. This paper extends the SPM model to address revocation of privileges.In [9], we had proposed an extension of the SPM to provide authentication. The two extensions are independent in the sense that each one affects a different part of the decision algorithm.
Improving functional density through run-time constant propagation
Authors: Michael J. Wirthlin, Brad L. Hutchings
Venue: Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays (1997)

Circuit specialization techniques such as constant propagation are commonly used to reduce both the hardware resources and cycle time of digital circuits. When reconfigurable FPGAs are used, these advantages can be extended by dynamically specializing circuits using run-time reconfiguration (RTR). For systems exploiting constant propagation, hardware resources can be reduced by folding constants within the circuit and dynamically changing the constants using circuit reconfiguration. To measure the benefits of circuit specialization, a functional density metric is presented. This metric allows the analysis of both static and run-time reconfigured circuits by including the cost of circuit reconfiguration. This metric will be used to justify runtime constant propagation as well as analyze the effects of reconfiguration time on run-time reconfigured systems.
Chip parasitic extraction and signal integrity verification (extended abstract)
Authors: Wayne W.-M. Dai
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

In was projected by the National TechnologyRoadmap for Semiconductors that by the year 1998 thefeature size will shrink to 0.25¿m and the chips maycontain as many as 28 million transistors.As the widthof wires shrinks, resistance increases more rapidly thancapacitance decreases.As the result, interconnect contributes50% of total delay in 0.35¿m technology andis expected to contribute up to 70% in 0.25¿m.Interconnectdelay on chip dominates the gate delay.Largeheight to width ratio, 2:1 in 1998 and 2.5:1 in 2001,and many interconnect layers, 5-8 in 1998 and 8-10 in2001, make lateral coupling increasingly more significantthan coupling to ground.Cross talk not only causes awrong logic result on one particular clock cycle, but alsoleads to a different timing behavior of neighboring lines.Delay cannot be calculated accurately without takingcross talk into account.Not to mention conformal dielectricsand non-orthogonal conductor cross sections.The above technology shift calls for 3D parasitic extraction.However, it is prohibitively expensive to extractevery net in 3D; in fact, it is not necessary to do so.Beforepresenting the multi-tiered extraction methodology,I will first classify various extracion methodologies.
Multitasking and resequencing in a two-stage multiprocessing system
Authors: Helen D. Karatza
Venue: Proceedings of the 28th conference on Winter simulation (1996)

The effects of multitasking and resequencing on system and program performance of a two-stage multiprocessing system are studied using simulation techniques. A closed queueing network model is considered. It consists of the CPU and the I/O channel. The CPU consists of a FCFS single-server sequential processing center and a multiprocessing center with two FCFS independent processors each serving its own queue. Resequencing of jobs after CPU service ensures that jobs leave the CPU on a first-in first-out basis. We examine how the synchronisation of tasks in the multiprocessing center in conjunction with the subsequent resequencing of jobs affects the overall performance for various coefficients of variation of the CPU service times (exponential and Branching Erlang distributions) and for different degrees of multiprogramming.
IR, NLP, AI and UFOS: or IR-relevance, natural language problems, artful intelligence and user-friendly online systems
Authors: Tamas E. Doszkocs
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

User Friendly Online Searching is examined in the context of Natural Language Processing in Information Retrieval and Artificial Intelligence. Opportunities for synergetic R D are identified as the basis for Intelligent Information Retrieval and Artificial Retrieval Intelligence.
On Positive Orthant Controllability of Bilinear Systems in Small Codimensions
Authors: Yuri L. Sachkov
Venue: SIAM Journal on Control and Optimization (1997)

For the bilinear control system of the form $\dot{x} = (A + \sum_{i=1}^m u_i B_i) x$, $x \in \R^n$, $u_i \in \R$, with $A$ essentially nonnegative and $B_i$ constant diagonal matrices, the following global controllability question is studied: when can any two points in $\R^n$ with positive coordinates be connected by a trajectory of this system? The answers for $m = n-1$ and $m=n-2$ for any $n > 2$ are given; some necessary conditions for other cases are proven.
A New Bit Rate Control of MPEG with Predictive and AdaptivePerceptual Quantization
Authors: Yig-Shyang Lin, Tsann-Shyong Liu, Long-Wen Chang
Venue: Multidimensional Systems and Signal Processing (1997)

Bit rate control has been proved to be an important technique used to transmit the variable rate bit stream over a fixed rate channel in MPEG coding. In this paper, a hybrid algorithm is proposed to achieve the rate control and obtain a good picture quality. In the picture layer, the algorithm estimates numbers of bits required for different type of frames. In the macroblock layer, it utilizes the predictive and adaptive perceptual techniques in the regulation of the quantization scale to allocate the target bits. In the upper and left boundary of the picture, the macroblocks are quantized with the perceptual basis to adjust the quantization scale and in the other part of the picture a predictive method is used to update the quantization scale. By using the proposed scheme, the distortion of coding is uniformly distributed in the picture layer as well as in the macroblock layer and better bit rate control is achieved.
Opportunities in computer integrated manufacturing
Authors: David A. Hodges
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

Improved computer-integrated manufacturing (CIM) systems are needed to enable competitive production of high-technology products. The increasing complexity of processes and products, the growing need to manufacture different products in a single (costly) factory, and the rapid rate of change in product and process technologies all are trends that create a demand for better utilization of information. The problems of VLSI production typify those in high technology manufacturing. There is a strong need to unify data used for product and process design; equipment, process and facility control; quality assurance and testing; and production scheduling and control. Improved capability for modeling, simulation, and direct control of production processes and equipment is needed. Guaranteed real-time performance is often required. Major advances in the human to computer interface are sought to facilitate effective use of complex integrated information systems.
Energy from space: a new potential application of interval computations
Authors: Misha Koshelev, Scott Starks
Venue: ACM SIGNUM Newsletter (1997)

The sun is a practically limitless source of energy. In some areas, solar cells enable us to use this source. In many places on Earth, however, clouds prevent us from tapping into solar energy. To use this energy, researchers have proposed placing solar cells on a satellite and beaming the collected energy down to the Earth.The problem with this solution is that the resulting high-energy beam is highly dangerous. Instead of using a single beam, we propose to use several beams from different satellites; this configuration will enable us to beam the energy to practically any location on Earth without endangering other locations. Since errors can be extremely dangerous, we need verified computations (i.e., interval computations) to compute the parameters of the beams. Thus, interval computations are useful for transmitting energy from space.