ppxscal/embedding_network huggingface dataset:
A non-deterministic call-by-need lambda calculus
Authors: Arne Kutzner, Manfred Schmidt-Schauß
Venue: Proceedings of the third ACM SIGPLAN international conference on Functional programming (1998)

In this paper we present a non-deterministic call-by-need (untyped) lambda calculus lambda;nd with a constant choice and a let-syntax that models sharing. Our main result is that lambda;nd has the nice operational properties of the standard lambda calculus: confluence on sets of expressions, and normal order reduction is sufficient to reach head normal form. Using a strong contextual equivalence we show correctness of several program transformations. In particular of lambda-lifting using deterministic maximal free expressions. These results show that lambda;nd is a new and also natural combination of non-determinism and lambda-calculus, which has a lot of opportunities for parallel evaluation.An intended application of lambda;nd is as a foundation for compiling lazy functional programming languages with I/O based on direct calls. The set of correct program transformations can be rigorously distinguished from non-correct ones. All program transformations are permitted with the slight exception that for transformations like common subexpression elimination and lambda-lifting with maximal free expressions the involved subexpressions have to be deterministic ones.
Cayenne&mdash;a language with dependent types
Authors: Lennart Augustsson
Venue: Proceedings of the third ACM SIGPLAN international conference on Functional programming (1998)

Cayenne is a Haskell-like language. The main difference between Haskell and Cayenne is that Cayenne has dependent types, i.e., the result type of a function may depend on the argument value, and types of record components (which can be types or values) may depend on other components. Cayenne also combines the syntactic categories for value expressions and type expressions; thus reducing the number of language concepts.Having dependent types and combined type and value expressions makes the language very powerful. It is powerful enough that a special module concept is unnecessary; ordinary records suffice. It is also powerful enough to encode predicate logic at the type level, allowing types to be used as specifications of programs. However, this power comes at a cost: type checking of Cayenne is undecidable. While this may appear to be a steep price to pay, it seems to work well in practice.
Analysis of Petri Nets by Ordering Relations in Reduced Unfoldings
Authors: Alex Kondratyev, Michael Kishinevsky, Alexander Taubin, Sergei Ten
Venue: Formal Methods in System Design (1998)

This paper suggests a way for Petri Net analysis by checking the ordering relations between places and transitions. The method is based on unfolding the original net into an equivalent acyclic description. We improved on the previously known cutoff criterion for truncating unfoldings [13]. No restrictions are imposed on the class of general PNs. The new criterion significantly reduces the size of an unfolding obtained by a PN. The properties of PNs for analysis can be various: boundedness, safety, persistency etc. A practical example of the suggested approach is given in an application to asynchronous design. Circuit behavior is specified by an interpreted Petri net, called a Signal Transition Graph (STG) which is then analyzed for implementability by an asynchronous hazard-free circuit. The implementability conditions are formulated in such a way that they can be checked by analysis of ordering relations between signal transitions rather than by traversal of states. This allows us to avoid the state explosion problem for highly parallel specifications. The experimental results show that for highly parallel STGs checking their implementability by an unfolding is one to two orders of magnitude less time-consuming than checking it by symbolic BDD traversal of the corresponding State Graph.
Simulated Annealing and Genetic Algorithms for the Facility LayoutProblem: A Survey
Authors: Thelma D. Mavridou, Panos M. Pardalos
Venue: Computational Optimization and Applications (1997)

The facility layout problem (FLP) has many practical applications and is known to be NP-hard. During recent decades exact and heuristic approaches have been proposed in the literature to solve FLPs. In this paper we review the most recent developments regarding simulated annealing and genetic algorithms for solving facility layout problems approximately.
Error control techniques for interactive low-bit rate video transmission over the Internet
Authors: Injong Rhee
Venue: ACM SIGCOMM Computer Communication Review (1998)

A new retransmission-based error control technique is presented that does not incur any additional latency in frame playout times, and hence are suitable for interactive applications. It takes advantage of the motion prediction loop employed in most motion compensation-based codecs. By correcting errors in a reference frame caused by earlier packet loss, it prevents error propagation. The technique rearranges the temporal dependency of frames so that a displayed frame is referenced for the decoding of its succeeding dependent frames much later than its display time. Thus, the delay in repairing lost packets can be effectively masked out. The developed technique is combined with layered video coding to maintain consistently good video quality even under heavy packet loss. Through the results of extensive Internet experiments, the paper shows that layered coding can be very effective when combined with the retransmission-based error control technique for low-bit rate transmission over best effort networks where no network-level mechanism exists for protecting high priority data from packet loss.
Machine interpretation of CAD data for manufacturing applications
Authors: Qiang Ji, Michael M. Marefat
Venue: ACM Computing Surveys (CSUR) (1997)

Machine interpretation of the shape of a component for CAD databases is an important problem in CAD/CAM, computer vision, and intelligent manufacturing. It can be used in CAD/CAM for evaluation of designs, in computer vision for machine recognition and machine inspection of objects, and in intelligent manufacturing for automating and integrating the link between design and manufacturing. This topic has been an active area of research since the late '70s, and a significant number of computational methods have been proposed to identify portions of the geometry of a part having engineering significance (here called &ldquo;features&rdquo;). However, each proposed mechanism has been able to solve the problem only for components within a restricted geometric domain (such as polyhedral components), or only for components whose features interact with each other in a restricted manner. The purposes of this article are to review and summarize the development of research on machine recognition of features from CAD data, to discuss the advantages and potential problems of each approach, and to point out some of the promising directions future investigations may take. Since most work in this field has focused on machining features, the article primarily covers those features associated with the manufacturing domain. In order to better understand the state of the art, methods of automated feature recognition are divided into the following categories of methods based on their approach: graph-based, syntactic pattern recognition, rule-based, and volumetric. Within each category we have studied issues such as the definition of features, mechanisms developed for recognition of features, the application scope, and the assumptions made. In addition, the problem is addressed from the perspective of information input requirements and the advantages and disadvantages of boundary representation, constructive solid geometry (CSG), and 2D drawings with respect to machine recognition of features are examined. Emphasis is placed on the mechanisms for attacking problems associated with interacting features.
BIST TPG for faults in system backplanes
Authors: Chen-Huan Chiang, Sandeep K. Gupta
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

A built-in self-test (BIST) methodology to test system backplanes by using BIST functionality in each of its constituent boards is presented. Since the configurations of systems change frequently, at the system level, the proposed methodology employs a simple test schedule which can be easily changed whenever the system configuration is changed. Since the boards used in such systems are designed for use in a wide variety of systems, the proposed methodology defines the test objectives to be achieved by a board's BIST circuit in terms of the board's edge pin connections, independent of the configurations of the systems in which the board may be used. It is shown that the combination of the proposed test schedule and the availability, on each board in the system, of any BIST circuit that satisfies the proposed test objectives, guarantees safe testing of faults in backplanes. A programmable test architecture and an algorithm to program the architecture to obtain BIST that satisfies the test objectives is also presented. Finally, the applicability and effectiveness of the methodology is demonstrated via its application to multiple configurations of an example system that uses a VME backplane.
MAP/1 tutorial
Authors: Laurie J. Rolston, Robin J. Miner
Venue: Proceedings of the 17th conference on Winter simulation (1985)

MAP/1 is a simulation-based Modeling and Analysis Program developed by Pritsker Associates for use in designing and evaluating discrete part manufacturing systems. MAP/1 is a generalized model of a discrete part manufacturing system, which is parameterized to represent a specific manufacturing facility. Parameters which describe the manufacturing facility configuration and associated operating rules are input to the MAP/1 analysis program, which produces a set of predefined output reports and provides measures of facility performance. Using MAP/1, indepth simulation analyses may be performed to investigate alternative system configurations and operating procedures.
Efficient Derivative Codes through Automatic Differentiation and Interface Contraction: An Application in Biostatistics
Authors: P. Hovland, C. Bischof, D. Spiegelman, M. Casella
Venue: SIAM Journal on Scientific Computing (1997)

Developing code for computing the first- and higher-order derivatives of a function by hand can be very time consuming and is prone to errors. Automatic differentiation has proven capable of producing derivative codes with very little effort on the part of the user. Automatic differentiation avoids the truncation errors characteristic of divided difference approximations. However, the derivative code produced by automatic differentiation can be significantly less efficient than one produced by hand. This shortcoming may be overcome by utilizing insight into the high-level structure of a computation. This paper focuses on how to take advantage of the fact that the number of variables passed between subroutines frequently is small compared with the number of variables with respect to which one wishes to differentiate. Such an "interface contraction," coupled with the associativity of the chain rule for differentiation, allows one to apply automatic differentiation in a more judicious fashion, resulting in much more efficient code for the computation of derivatives. A case study involving the ADIFOR (Automatic Differentiation of Fortran) tool and a program for maximizing a logistic-normal likelihood function developed from a problem in nutritional epidemiology is examined, and performance figures are presented.
Enhanced nearest neighbour search on the R-tree
Authors: King Lum Cheung, Ada Wai-Chee Fu
Venue: ACM SIGMOD Record (1998)

Multimedia databases usually deal with huge amounts of data and it is necessary to have an indexing structure such that efficient retrieval of data can be provided. R-Tree with its variations, is a commonly cited indexing method. In this paper we propose an improved nearest neighbor search algorithm on the R-tree and its variants. The improvement lies in the removal of two hueristics that have been used in previous R*-tree work, which we prove cannot improve on the pruning power during a search.
Logical process size in parallel simulations
Authors: Fang Hao, Karen Wilson, Richard Fujimoto, Ellen Zegura
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Most existing synchronization protocols require that the simulation application be partitioned and mapped to logical processes to make it suitable for parallel execution. Assuming the simulation models some number of physical components, an important design question is how many components should be mapped to each logical process? This is a nontrivial question because logical process "size" affects the efficiency of the synchronization protocol, load balance, and approach for implementing shared state variables, as well as the efficiency of the event processing loop within the parallel simulator. This question is studied in the context of a Time Warp-based parallel simulator. Results of two experimental studies are described that compare the performance of parallel simulators using different logical process sizes. One study uses synthetic workloads; the other uses an Asynchronous Transfer Mode (ATM) network. These results show that the choice of logical process size can have a significant effect on performance, and the optimal size depends on model size, the number of available processors, and detailed semantics of the model itself.
Exploiting Invariants in the Numerical Solution of Multipoint Boundary Value Problems for DAE
Authors: Volker H. Schulz, Hans Georg Bock, Marc C. Steinbach
Venue: SIAM Journal on Scientific Computing (1998)

This paper presents a new approach to the numerical solution of boundary value problems for higher-index differential-algebraic equations (DAEs). Invariants known for the original DAE as well as invariants of the reduced index 1 formulation are exploited to stabilize initial value problem (IVP) integration, derivative generation, and nonlinear and linear systems solution of an enhanced multiple shooting method. Extensions to collocation are given. Applications are presented for two important problem classes: parameter estimation in multibody systems given in descriptor form, and singular and state-constrained optimal control problems. In particular, generalizations of the "internal numerical differentiation" technique to DAE with invariants and a new multistage least squares decomposition technique for DAE boundary value problems are developed, which are implemented in the multiple shooting code PARFIT and in the collocation code COLFIT. Further, a method is described which minimizes the number of necessary directional derivatives in the presence of multipoint conditions and invariants. As numerical applications, a parameter identification problem for a slider crank mechanism and a periodic cruise optimal control problem for a motor glider aircraft are treated.
Analysis of the Superposition of Periodic Layers and TheirMoir&eacute; Effects through the Algebraic Structure of Their FourierSpectrum
Authors: Isaac Amidror, Roger D. Hersch
Venue: Journal of Mathematical Imaging and Vision (1998)

A new approach is presented for investigating the superposition of any number of periodic structures, and the moir&eacute; effects which may result. This approach, which is based on an algebraic analysis of the Fourier-spectrum using concepts from the theory of geometry of numbers, fully explains the properties of the superposition of periodic layers and of their moir&eacute; effects. It provides the fundamental notations and tools for investigating, both in the spectral domain and in the image domain, properties of the superposition as a whole (such as periodicity or almost-periodicity), and properties of each of the individual moir&eacute;s generated in the superposition (such as their profile forms and intensity levels, their singular states, etc.). This new, rather unexpected combination of Fourier theory and geometry of numbers proves very useful, and it offers a profound insight into the structure of the spectrum of the layer superposition and the corresponding properties back in the image domain.
The effectiveness of flow analysis for inlining
Authors: J. Michael Ashley
Venue: Proceedings of the second ACM SIGPLAN international conference on Functional programming (1997)

An interprocedural flow analysis can justify inlining in higher-order languages. In principle, more inlining can be performed as analysis accuracy improves. This paper compares four flow analyses to determine how effectively they justify inlining in practice. The paper makes two contributions. First, the relative merits of the flow analyses are measured with all other variables held constant. The four analyses include two monovariant and two polyvariant analyses that cover a wide range of the accuracy/cost spectrum. Our measurements show that the effectiveness of the inliner improves slightly as analysis accuracy improves, but the improvement is offset by the compile-time cost of the accurate analyses. The second contribution is an improvement to the previously reported inlining algorithm used in our experiments. The improvement causes flow information provided by a polyvariant analysis to be selectively merged. By merging flow information depending on the inlining context, the algorithm is able to expose additional opportunities for inlining. This merging technique can be used in any program transformer justified by a polyvariant flow analysis. The revised algorithm is fully implemented in a production Scheme compiler.
An exact gate decomposition algorithm for low-power technology mapping
Authors: Hai Zhou, D. F. Wong
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

With the remarkable growth of portable application and the increasing frequency and integration density, power is being given comparable weight to speed and area in IC designs. In technology mapping, how decomposition is done can have a significant impact on the power dissipation of the final implementation. In the literature, only heuristic algorithms are given for the low-power gate decomposition problem. In this paper, we prove many properties an optimal decomposition tree must have. Based on these optimality properties, we design an efficient exact algorithm to solve the low-power gate decomposition problem. Moreover, the exact algorithm can be easily modified to a heuristic algorithm which performs much better than the known heuristics.
Distance Metric Between 3D Models and 2D Images for Recognition and Classification
Authors: Ronen Basri, Daphna Weinshall
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1996)

Similarity measurements between 3D objects and 2D images are useful for the tasks of object recognition and classification. We distinguish between two types of similarity metrics: metrics computed in image-space (image metrics) and metrics computed in transformation-space (transformation metrics). Existing methods typically use image metrics; namely, metrics that measure the difference in the image between the observed image and the nearest view of the object. Example for such a measure is the Euclidean distance between feature points in the image and their corresponding points in the nearest view. (This measure can be computed by solving the exterior orientation calibration problem.) In this paper we introduce a different type of metrics: transformation metrics. These metrics penalize for the deformations applied to the object to produce the observed image.In particular, we define a transformation metric that optimally penalizes for "affine deformations" under weak-perspective. A closed-form solution, together with the nearest view according to this metric, are derived. The metric is shown to be equivalent to the Euclidean image metric, in the sense that they bound each other from both above and below. It therefore provides an easy-to-use closed-form approximation for the commonly-used least-squares distance between models and images. We demonstrate an image understanding application, where the true dimensions of a photographed battery charger are estimated by minimizing the transformation metric.
Automatic synthesis of a dual-PLA controller with a counter
Authors: David Binger, David W. Knapp
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

When datapath/controller designs are synthesized from high-level specifications, the control state graph can have hundreds of states and a large number of state transitions which depend only on the present state. For this class of finite state machines, an implementation with two PLAs and a counter can have much less area than a single-PLA implementation. This paper presents a new automatic procedure for coding the internal variables of an FSM with two PLAs and a counter in which the codes are selected to reduce the size of both PLAs. Analysis of the results shows that for a broad class of large FSMs our circuits have less cost than can be obtained using previously published automatic synthesis procedures.
A quadratic metric with a simple solution scheme for initial placement
Authors: Lawrence T. Pillage, Ronald A. Rohrer
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

For the initial placement problem a nets-as-points model provides a quadratic cost metric which when minimized localizes the gates. Fixed constraints are added to the cost function so that a minimum is guaranteed to exist, and can be obtained by means of a simple iterative solution. The initial placement is obtained in near linear time. An annular snap-to-grid heuristic completes the initial placement. The nets-as-points metric is shown to produce desirable results.
A Neuro-Fuzzy Approach to Identify LettuceGrowth and Greenhouse Climate
Authors: B. T. Tien, G. Van Straten
Venue: Artificial Intelligence Review (1998)

A hybrid neuro-fuzzy approach called the NUFZY system, which embeds fuzzy reasoning into a triple-layered network structure, has been developed to identify nonlinear systems. A set of membership functions at the input layer is partially linked with a layer of rules, using pre-set parameters. By means of a simplified centroid of gravity defuzzification method, the output becomes linear in the weights. Therefore, very fast estimation of the weight parameters can be achieved by using the orthogonal least squares (OLS) method, which also provides a method to efficiently remove the redundant fuzzy rules from the prototype rule base of the NUFZY system. In this paper, the NUFZY system is applied to identify lettuce growth and greenhouse temperature from real experimental data.Results show that the NUFZY model with the fast OLS training can perform quite well in predicting both lettuce growth and greenhouse temperature. In contrast to the mechanistic modeling procedures, the neuro-fuzzy approach offers an easier route and a fast way to build the nonlinear mapping of inputs and outputs. In addition, the resulting internal network structure of the NUFZY system is a self-explanatory representation of fuzzy rules. Under this frame, it is a perspective that one is able to incorporate the human knowledge in this approach, and, hopefully, to deduce any interpretable rules that describe the systems&lsquo; behavior.