ppxscal/embedding_network huggingface dataset:
Exponentiation using Canonical Recoding
Authors: Omer Egecioglu, Cetin K Koc
Venue:  (1993)

The canonical bit recoding technique can be used to reduce the average number of multiplications required to compute $X^E$ provided that $X^{-1}$ is supplied along with $X$. We model the generation of the digits of the canonical recoding $D$ of an $n$-bit long exponent $E$ as a Markov chain, and show that binary, quaternary, and octal methods applied to $D$ require $\frac{4}{3}\,n$, $\frac{4}{3}\,n$, and $ \frac{23}{18}\,n $ multiplications, compared to $\frac{3}{2} \, n$, $\frac{11}{8} \, n$, and $\frac{31}{24}n$ required by these methods applied to $E$. We show that in general the canonically recoded $m$-ary method for constant $m$ requires fewer multiplications than the standard $m$-ary method. However, when $m$ is picked optimally for each method for a given $n$, then the average number of multiplications required by the standard method is fewer than those required by the recoded version.
Theory for the Feedback Inhibition of Fast Release of Neurotransmitter
Authors: K. Yusim, H. Parnas, L. A. Segel
Venue:  (1999)

Autoinhibition of neurotransmitter release occurs via binding of transmitter to appropriate receptors. Experiments have provided evidence suggesting that the control of neurotransmitter release in fast systems is mediated by these inhibitory autoreceptors. The authors earlier formulated and analyzed a mathematical model for a theory of release control in which these autoreceptors played a key role. The key experimental findings on which the release-control theory is based are (i)&#x00A0;the inhibitory autoreceptor has high affinity for transmitter under rest potential and shifts to low affinity upon depolarization; (ii)&#x00A0;bound (with transmitter) autoreceptor associates with exocytotic machinery Ex and thereby blocks it, preventing release of neurotransmitter. Release commences when depolarization shifts the autoreceptor to a low affinity state and thereby frees Ex from its association with the autoreceptors. Here we extend the model that describes control of release so that it also accounts for release autoinhibition. We propose that inhibition is achieved because addition of transmitter, above its rest level, causes transition of the complex of autoreceptor and Ex to a state of stronger association. Relief of Ex from this state requires higher depolarization than from the weakly associated complex. In contrast to the weakly associated complex that only requires binding of transmitter to the autoreceptor to be formed, the transition to the strongly associated complex is induced by second messenger, which is produced as a result of receptor binding to transmitter. The theory explains the following experimental results (among others): for inhibition via transmitter or its agonists the magnitude of inhibition decreases with depolarization; a plot of inhibition as function of the concentration of muscarine (an acetylcholine agonist) yields an S-shaped curve that shifts to the right for higher depolarizations; the time course of release does not change when transmitter is added; the time course of release also does not change when transmitter antagonists are added, although quantal content increases; however, addition of acetylcholine esterase (an enzyme that hydrolyses acetylcholine) prolongs release.
Two Topologies are Better Than One
Authors: S. J. O''Neill
Venue:  (1995)

Partially ordered sets and metric spaces are used in studying semantics in Computer Science. Sets with both these structures are hence of particular interest. The partial metric spaces introduced by Matthews are an attempt to bring these ideas together in a single axiomatic framework. We consider an appropriate context in which to consider these spaces is as a bitopological space, i.e. a space with two (related) topologies. From this starting point, we cover the groundwork for a theory of partial metric spaces by generalising ideas from topology and metric spaces. For intuition we repeatedly refer to the real line with the usual ordering and metric as a natural example. We also examine in detail some other examples of more relevance to Computer Science. 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
Recognising Cubes in Images
Authors: Robert A. McLaughlin, Mike Alder
Venue:  (1994)

This paper adopts a syntactic approach to a pattern recognition task. This entails decomposing an object into a set of simpler component objects. For example, a cube may be viewed as comprising a set of parallelograms. Each component object may in turn be decomposed into yet simpler sub-objects and this repeated recursively until some set of primitives, in this case points in R^2 representing pixels, is reached. Recognition involves assembling a set of sub-objects into a single higher level entity. This paper outlines a method by which such sets may be automatically identified, provided that the sub-objects can be mapped to points in a space. Although this method is highly general, it is explored in the restricted context of recognising wire frame images of cubes. A computer program implementing the method outlined here has been found to successfully extract cubes from simple wire frame images.
E-workcell: a virtual reality web-based decision support system for assembly line planning
Authors: Oleg Gusikhin, Erica Klampfl, Giuseppe Rossi, Celestine Aguwa, Gene Coffman, Terry Martinak
Venue: Enterprise information systems IV (2003)

This paper is devoted to an example of the advantages of intranet applications of e-technology. We describe a new multimedia decision support interface that exploits web-enabled database information to provide an interactive planning tool for the automotive assembly line. Specifically, we integrate a web-based client server architecture, a Virtual Reality Modeling Language (VRML) interface, analytical modeling, and simulation. The system is designed to facilitate collaboration between the different functions that participate in the assembly line planning process.
Structure and Performance of Decision Support Algorithms on Active Disks
Authors: Anurag Acharya, Mustafa Uysal, Joel Saltz
Venue:  (1998)

Growth and usage trends for large decision support databases indicate that there is a need for architectures that scale the processing power as the dataset grows. These trends indicate that the processing demand for large decision support databases is growing faster than the improvement in performance of commodity processors. To meet this need, several researchers have recently proposed Active Disk/IDISK architectures which integrate substantial processing power and memory into disk units. In this paper, we examine the utility of Active Disks for decision support databases. We try to answer the following questions. First, is it possible to restructure algorithms for common decision support tasks to utilize Active Disks? Second, how does the performance of Active Disks compare with that of traditional servers for these tasks? Finally, how would Active Disks be integrated into the software architecture of decision support databases?
Computational Geometric Performance Analysis of Limit Cycles in TimedTransition Systems
Authors: Marc Abrams
Venue:  (1993)

Certain parallel software performance evaluation problems are equivalent to computational geometric problems. Consider a timed transition system representing a parallel program: a set of variables, a set of states, an initial state, a transition function mapping a set to a set of successor states, and a description of the time between transitions. Given a timed transition system, the paper solves four problems: (1) state the necessary and sufficient conditions for a TES to contain a LCES; (2) given the initial starting time of each process, find a representation of the set of all possible TESs; (3) determine if any initial process starting times exist that lead to a LCES in which no process ever blocks; and (4) find the set of all possible LCESs.
Better Approximation Guarantees for Job-shop Scheduling
Authors: L. A. Goldberg, M. S. Paterson, E. Sweedyk
Venue:  (1996)

Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee. We improve the approximation guarantee of their work, and present further improvements for some important NP-hard special cases of this problem (e.g., in the preemptive case where machines can suspend work on operations and later resume). Some of these improvements represent the first constant-factor approximation algorithms. We also present NC algorithms with improved approximation guarantees for some NP-hard special cases.
Diagnostic Assistance Using Digraph Representation of Discrete Event Simulation Model Specifications
Authors: C. M Overstreet, Richard E. Nance
Venue:  (1986)

Automated diagnosis of digraph representations of discrete event simulation models is illustrated as an effective model verification technique, applicable prior to coding the model in an executable language. The Condition Specification is shown to provide an effective representation, from which automated analysis can initiate with a digraph extraction. Subsequent diagnostic simplification techniques are applied to the digraph, either automatically or in concert with the modeler.
Hypertext Structures and Software Documentation
Authors: James C. French, John C. Knight, Allison L. Powell
Venue:  (1996)

Software documentation represents a critical resource to the successful functioning of many enterprises. However, because it is static, documentation often fails to meet the needs of the many diverse users who are required to consult it on a regular basis in the course of their daily work. Software documentation is a rich resource that has not been fully exploited. Treatment of software documentation presents a number of interesting problems that require a blend of information retrieval and hypertext techniques for their successful solution. The evolving nature of a software project and the diverse demands on its documentation present an especially challenging environment. This is made even more challenging by the variety of information resources, ranging from formal specification languages to source code, that must be integrated into a coherent whole for the purpose of querying. In this paper we discuss the issues involved with automating the management of software documentation to better increase its utility. We describe the mechanics of a prototype system, SLEUTH, currently under investigation at the University of Virginia as a vehicle for software documentation management. The prototype maintains software documentation as a hypertext with typed links for the purpose of browsing by users with varying needs. These links are synthesized by the system and kept accurate under update. Appropriate authoring tools provide the system with the information it needs for this maintenance function. Ad hoc querying is provided over the documentation and hypertext documents are synthesized in response to these queries.
Toward the Rectilinear Crossing Number of K_n: New Drawings, Upper Bounds, and Asymptotics
Authors: Alex Brodsky, Stephane Durocher, Ellen Gethner
Venue:  (2000)

Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.'' A rectilinear drawing of K_n is an arrangement of n vertices in the plane, every pair of which is connected by an edge that is a line segment. We assume that no three vertices are collinear, and that no three edges intersect in a point unless that point is an endpoint of all three. The rectilinear crossing number of K_n is the fewest number of edge crossings attainable over all rectilinear drawings of K_n. For each n we construct a rectilinear drawing of K_n that has the fewest number of edge crossings and the best asymptotics known to date. Moreover, we give some alternative infinite families of drawings of K_n with good asymptotics. Finally, we mention some old and new open problems.
CARAFE USER''S MANUAL, Alpha.2 Release
Authors: Alvin Jee
Venue:  (1990)

This document describes the user interface for CARAFE, the second generation Inductive Fault Analysis (IFA) program. The syntax of all the commands and their parameters are all described in this document along with a description of the formats of the various files used and created by CARAFE.
Formulations of an Extended NaDSet
Authors: Paul C. Gilmore, George K. Tsiknis
Venue:  (1991)

NaDSet, a {\underline N}atural {\underline D}eduction based {\underline Set} theory and logic, of this paper is an extension of an earlier logic of the same name. It and some of its applications have been described in earlier papers. A proof of the consistency and completeness of NaDSet is provided elsewhere. In all these earlier papers NaDSet has been formulated as a Gentzen sequent calculus similar to the formulation LK by Gentzen of classical first order logic, although it was claimed that any natural deduction formalization of first order logic, such as Gentzen''s natural deduction formulation NK, could be simply extended to be a formalization of NaDSet. This is indeed the case for the method of semantic tableaux of Beth or for Smullyan''s version of the tableaux, but the extensions needed for other formalizations, including NK and the intuitionistic version NJ, require some care. The consistency of NaDSet is dependant upon restricting its axioms to those of the form ${\bf A} \rightarrow {\bf A}$, where {\bf A} is an atomic formula; an equivalent restriction for the natural deduction formulation is not obvious. The main purpose of this paper is to describe the needed restriction and to prove the equivalence of the resulting natural deduction logic with the Gentzen sequent calculus formulation for both the intuitionistic and the classical versions of NaDSet. Additionally the paper provides a brief sketch of the motivation for NaDSet and some of its proven and potential applications. \nThe authors gratefully acknowledges support from the Natural Science and Engineering Research Council of Canada.
Consistency Maintenance using UNIFY
Authors: Anand Natrajan, Paul F. Reynolds,  Jr.
Venue:  (1995)

Distributed simulations comprised of aggregated entities (AEs) and disaggregated entities (DEs) pose critical consistency issues when AEs and DEs interact. Usually, meaningful interaction cannot take place without one of the two representing itself at a level of resolution compatible with the level of the other. Any approach that employs dynamic transitions between aggregated and disaggregated resolution levels suffers from not only potential consistency problems, but also chain disaggregation, network flooding, transition latency, and mapping problems between levels. Solutions meant to solve some or all of these problems leave one critical issue unresolved: proper and efficient maintenance of consistency among the levels of resolution for the same set of objects. An alternative approach, where AE and DE levels of resolution are maintained concurrently for the same objects, encounters the same consistency issues: anything that happens to a DE must be reflected accurately in the AE, and vice versa. The fundamental problem is this: consistency cannot be guaranteed without a unified, coherent approach to correct, efficient consistency maintenance among levels of resolution for a set of simulated objects. In our approach, UNIFY, we contend that multiple levels of resolution should be addressed inside individual simulations, in order to ensure an efficient, coherent, verifiable solution. We propose the concept of MREs (Multiple Resolution Entities) in lieu of AEs and DEs. MREs are capable of representing simulated objects at specified levels of resolution in a consistent manner. A MRE should be able to provide, when requested, bindings for attributes at any desired level in a timely manner. A number of key issues must be addressed in order to provide this capability. The most critical issues are: identification of core data, temporal consistency, and mapping consistency.
The MeTHOOD Approach: Measures, Transformation Rules, and Heuristicsfor Object-Oriented Design
Authors: Thomas Grotehen, Klaus R. Dittrich
Venue:  (1997)

The MeTHOOD approach makes design knowledge tangible that will help to improve conceptual object-oriented schemas. Although some of this important knowledge is available in current literature, it is nearly unusable for designers. Therefore, we propose a catalogue of measurements, heuristics, and transformation rules, and introduce an effective integration schema for these elements. This integration schema is the base for a design optimisation process allowing designers to improve conceptual schemata systematically. Besides the integration schema and the process, this paper describes a design support system called MEx. It consists of a design knowledge base (containing definitions of measures, heuristics, and transformation rules) that works on a specification database containing conceptual design schemas.
On the Visual Discrimination of Self-Similar Random Textures
Authors: R. Rensink
Venue:  (1986)

This work investigates the ability of the human visual system to discriminate self-similar Gaussian random textures. The power spectra of such textures are similar to themselves when rescaled by some factor $h < 1$. As such, these textures provide a natural domain for testing the hypothesis that texture perception is based on a set of spatial-frequency channels characterized by filters of similar shape. Some general properties of self-similar random textures are developed. In particular, the relations between their covariance functions and power spectra are established, and are used to show that many self-similar random textures are stochastic fractals. These relations also lead to a simple texture-generation algorithm that allows independent and orthogonal variation of several properties of interest. Several sets of psychophysical experiments are carried out to determine the statistical properties governing the discrimination of self-similar line textures. Results show that both the similarity parameter $H$ and the scaling ratio $h$ influence discriminability. These two quantities, however, are insufficient to completely characterize perceived texture. The ability of the visual system to discriminate between various classes of self-similar random texture is analyzed using a simple multichannel model of texture perception. The empirical results are found to be compatible with the hypothesis that texture perception is mediated by the set of spatial-frequency channels putatively involved in form vision. 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
Object-Oriented Metrics Which Predict Maintainability
Authors: Wei Li, Sallie M. Henry
Venue:  (1993)

Software metrics have been studied in the procedural paradigm as a quantitative means of assessing the software development process as well as the quality of software products. Several studies have validated that various metrics are useful indicators of maintenance effort in the procedural paradigm. However, software metrics have rarely been studied in the object oriented paradigm. Very few metrics have been proposed to measure object oriented systems, and the proposed ones have not been validated. This research concentrates on several object oriented software metrics and the validation of these metrics with maintenance effort in two commercial systems. Statistical analyses of a prediction model incorporating ten metrics are performed. In addition, a more compact model with fewer metrics was sought, analyses performed, and also presented.
Surface Reflectance and Shape from Images Using Collinear Light Source
Authors: Jiping Lu, Jim Little
Venue:  (1997)

The purpose of computer vision is to extract useful information from images. Image features such as occluding contours, edges, flow, brightness, and shading provide geometric and photometric constraints on the surface shape and reflectance of physical objects in the scene. In this thesis, two novel techniques are proposed for surface reflectance extraction and surface recovery. They integrate geometric and photometric constraints in images of a rotating object illuminated under a collinear light source (where the illuminant direction of the light source lies on or near the viewing direction of the camera). The rotation of the object can be precisely controlled. The object surface is assumed to be $C^2$ and its surface reflectance function is uniform. The first technique, called the {\it photogeometric technique}, uses geometric and photometric constraints on surface points with surface normal perpendicular to the image plane to calculate 3D locations of surface points, then extracts the surface reflectance function by tracking these surface points in the images. Using the extracted surface reflectance function and two images of the surface, the technique recovers the depth and surface orientation of the surface simultaneously. The second technique, named the {\it wire-frame technique}, further exploits geometric and photometric constraints on the surface points whose surface orientations are coplanar with the viewing direction and the rotation axis to extract a set of 3D curves. The set of 3D curves comprises a wire frame on the surface. The depth and surface orientation between curves on the wire frame are interpolated by using geometric or photogeometric methods. The wire-frame technique is superior because it does not need the surface reflectance function to extract the wire frame. It also works on piecewise uniform surfaces and requires only that the light source be coplanar with the viewing direction and the rotation axis. In addition, by interpolating the depth and surface orientation from a dense wire frame, the surface recovered is more accurate. The two techniques have been tested on real images of surfaces with different reflectance properties and geometric structures. The experimental results and comprehensive analysis show that the proposed techniques are efficient and robust. As an attempt to extend our research to computer graphics, work on extracting the shading function from real images for graphics rendering shows some promising results.
Vollstandige algebraische Beschreibung und Parallelisierung von translations-und rotationsinvarianten Transformationen fur Grauwertbilder
Authors: Michael Nolle, Hanns Schulz-Mirbach
Venue:  (1992)

The paper presents algorithms for the determination of translation- and rotation invariant features for gray-scale images. A complete algebraic description of the resulting feature spaces is given. That is achieved through the construction of a finite basis for the space of polynomial invariants. These basis features contain all relevant information since every other feature can be expressed in this basis by appropriate algebraic functions. Furthermore these basis features are complete in the sense that they describe a given gray-scale image uniquely up to rotations and translations. We present algorithms for an efficient parallel computation. Thereby the communication demands arising from the algorithm, which require local and global data access, are mapped simultaneously to a de Bruijn interconnection structure. Experimental results from an implementation on a multiprocessor machine are given.