ppxscal/embedding_network huggingface dataset:
Creating reusable well-structured PDF as a sequence of component object graphic (COG) elements
Authors: Steven R. Bagley, David F. Brailsford, Matthew R. B. Hardy
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

Portable Document Format (PDF) is a page-oriented, graphically rich format based on PostScript semantics and it is also the format interpreted by the Adobe Acrobat viewers. Although each of the pages in a PDF document is an independent graphic object this property does not necessarily extend to the components (headings, diagrams, paragraphs etc.) within a page. This, in turn, makes the manipulation and extraction of graphic objects on a PDF page into a very difficult and uncertain process.The work described here investigates the advantages of a model wherein PDF pages are created from assemblies of COGs (Component Object Graphics) each with a clearly defined graphic state. The relative positioning of COGs on a PDF page is determined by appropriate 'spacer' objects and a traversal of the tree of COGs and spacers determines the rendering order. The enhanced revisability of PDF documents within the COG model is discussed, together with the application of the model in those contexts which require easy revisability coupled with the ability to maintain and amend PDF document structure.
A model of the growth of intermediate phase islands in multilayers
Authors: G. Lucenko, A. Gusak
Venue: Microelectronic Engineering (2003)

Recent experiments on reactive diffusion in multilayer films have shown that the first phase formation includes two steps: (i) nucleation and lateral growth of islands, and (ii) classical diffusion controlled growth. We present a model of diffusion-controlled growth of the phase 1 island on the interface AB. In this model a capillary effect and corresponding drift term related to the gradient of the curvature of the interface as the well as the chemical driving force are taken into account. This model predicts an asymptotic maximal thickness of growing island, the shape of island, and gives Avrami exponents between 1 and 2, which correspond to experimental data.
Introduction to SQURL
Authors: Douglas McLean Jones
Venue: ACM SIGPLAN Notices (1981)

This paper introduces SQURL, a new programming language designed to fulfill a need for a simple, flexible alternative to languages currently available for micro-computers. SQURL is a structured language designed for general purpose applications and intended for implementation on almost any micro-computer. A compiler does exist.
Forming Agents for Business Process Orchestration
Authors: M. Brian Blake
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Distributed component-based services and semantic web services are promising technologies for next generation inter-enterprise integration. The dynamic nature of this domain presents a complex problem for potential software agent-based approaches that support this cross-organizational integration. Currently, there are few studies that measure the impact of the dynamic environmental effects on service composition. On an on-going basis, composite services or workflow processes of web services may be constantly changing in terms ofresponsiveness of services, accessibility of services and their meta-information, business process schema changes, etc. This paper describes an approach, model, and supporting software toward the efficient formation of agent teams and interaction protocols for business process orchestration in response to certain environmental conditions.
Composing with the Soundscape of Jones Street
Authors: Reynold Weidenaar
Venue: Organised Sound (2002)

This article traces the audio production and soundscape composition for a multimedia work for any solo instrument, colour video, and digital sound. There is an account of earlier soundscape recordings of the Brooklyn Bridge. A description of the visual images of Jones Street is followed by a portrayal of the street life and consequent soundscape. There is a report on stereo recording techniques, the sounds that were gathered, and the sounds that were selected as source material. A discussion of philosophical and aesthetic considerations precedes a detailed explanation of the digital processing and composing methods. 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
Generating English summaries of time series data using the Gricean maxims
Authors: Somayajulu G. Sripada, Ehud Reiter, Jim Hunter, Jin Yu
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

We are developing technology for generating English textual summaries of time-series data, in three domains: weather forecasts, gas-turbine sensor readings, and hospital intensive care data. Our weather-forecast generator is currently operational and being used daily by a meteorological company. We generate summaries in three steps: (a) selecting the most important trends and patterns to communicate; (b) mapping these patterns onto words and phrases; and (c) generating actual texts based on these words and phrases. In this paper we focus on the first step, (a), selecting the information to communicate, and describe how we perform this using modified versions of standard data analysis algorithms such as segmentation. The modifications arose out of empirical work with users and domain experts, and in fact can all be regarded as applications of the Gricean maxims of Quality, Quantity, Relevance, and Manner, which describe how a cooperative speaker should behave in order to help a hearer correctly interpret a text. The Gricean maxims are perhaps a key element of adapting data analysis algorithms for effective communication of information to human users, and should be considered by other researchers interested in communicating data to human users.
Managing uncertainty in sensor database
Authors: Reynold Cheng, Sunil Prabhakar
Venue: ACM SIGMOD Record (2003)

Sensors are often employed to monitor continuously changing entities like locations of moving objects and temperature. The sensor readings are reported to a centralized database system, and are subsequently used to answer queries. Due to continuous changes in these values and limited resources (e.g., network bandwidth and battery power), the database may not be able to keep track of the actual values of the entities, and use the old values instead. Queries that use these old values may produce incorrect answers. However, if the degree of uncertainty between the actual data value and the database value is limited, one can place more confidence in the answers to the queries. In this paper, we present a frame-work that represents uncertainty of sensor data. Depending on the amount of uncertainty information given to the application, different levels of imprecision are presented in a query answer. We examine the situations when answer imprecision can be represented qualitatively and quantitatively. We propose a new kind of probabilistic queries called Probabilistic Threshold Query, which requires answers to have probabilities larger than a certain threshold value. We also study techniques for evaluating queries under different details of uncertainty, and investigate the tradeoff between data uncertainty, answer accuracy and computation costs.
Multimodal interaction to support multilingualism acquisition and development in young children
Authors: Marie-Luce Bourguet
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

The aim of our research is to explore new interaction paradigms for the design of multilingual educational software. In this poster, we present some early work on the use of multimodal interaction techniques to facilitate the simultaneous acquisition of more than one language during the period of primary language development. We suggest that multimodality can be used to deal with common multilingual phenomena such as language mixing and language dominance or specialization.
Location-aware data broadcasting: an application for digital mobile broadcasting in Japan
Authors: Kinji Matsumura, Kazuya Usui, Kenjiro Kai, Koichi Ishikawa
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Terrestrial digital broadcasting that uses the ISDB-T (Integrated Services Digital Broadcasting-Terrestrial) system is scheduled for launch in Japan in December 2003. This system also enables mobile broadcasting service, which will be offered a few years later. We are developing a Location-Aware Data Broadcasting Service as a remarkably new type of interactive mobile broadcasting service. In this paper, we describe the service application, information filtering method, and presentation techniques for this location-aware data service. We also discuss a further experiment that uses scalable vector graphics.
Superconducting vortex-latticed memories
Authors: Leonid V. Belevtsov
Venue: Microelectronic Engineering (2003)

An idea for the creation of vortex memories is proposed based on the phase transition in vortex lattice of layered high-temperature superconductor of Bi(2223) system as well as the artificial layer structure. The transition of the vortex lattice is accompanied by a sharp increase of critical current. As a result we have two stable states to perform the memory operations. Memory devices which are proposed, as both the operative and long-term one, must have a write-in speed of the order of 10-12-10-14 s, which is essentially more than in other vortex-based memories.
Sorting in a paging environment
Authors: Barbara S. Brawn, Frances G. Gustavson, Efrem S. Mankin
Venue: Communications of the ACM (1970)

This sorting study was part of an extensive measurement project undertaken on the M44/44X, an experimental paging system which was conceived and implemented at IBM Research in order to explore the virtual machine concept. The study was concerned with the implementation of sorting procedures in the context of the dynamic paging environment characteristic of virtual memory machines. Descriptions of the experimental sort programs and analysis of the performance measurement results obtained for them are presented. The insight gained from the experimental effort is used to arrive at a set of broad guidelines for writing sort programs for a paging environment.
Heteroscedastic Regression in Computer Vision: Problems with Bilinear Constraint
Authors: Yoram Leedan, Peter Meer
Venue: International Journal of Computer Vision (2000)

We present an algorithm to estimate the parameters of a linear model in the presence of heteroscedastic noise, i.e., each data point having a different covariance matrix. The algorithm is motivated by the recovery of bilinear forms, one of the fundamental problems in computer vision which appears whenever the epipolar constraint is imposed, or a conic is fit to noisy data points. We employ the errors-in-variables (EIV) model and show why already at moderate noise levels most available methods fail to provide a satisfactory solution. The improved behavior of the new algorithm is due to two factors: taking into account the heteroscedastic nature of the errors arising from the linearization of the bilinear form, and the use of generalized singular value decomposition (GSVD) in the computations. The performance of the algorithm is compared with several methods proposed in the literature for ellipse fitting and estimation of the fundamental matrix. It is shown that the algorithm achieves the accuracy of nonlinear optimization techniques at much less computational cost.
A Simulator Independent Semiconductor Model Implementation Based on SPICE Model Equations
Authors: T. Leitner
Venue: Analog Integrated Circuits and Signal Processing (1999)

This paper presents a new approach for the implementation of semiconductor models. The developed new model library uses object oriented techniques. Especially SPICE compatible models are implemented in the library. It is designed to support different simulators. The model implementation is separated completely from the simulator&rsquo;s interface. Thus, a change in the model&rsquo;s interface is possible without changing the model&rsquo;s implementation opening additional simulation feasabilities.
The computer graphics course in a small-college computer science program
Authors: Steve Cunningham
Venue: Journal of Computing Sciences in Colleges (2001)

Computer graphics has moved from the laboratory to everyday use in the last few years. New graphics programming systems and low-cost, high-powered computers have made computer graphics both much easier and much less expensive to use &mdash; and to both teach and learn. These now allow a beginning computer graphics programming course to be accessible to any student with reasonable programming skills, and consequently to be a service to a number of disciplines. This allows the course to take on a unique position on a small campus where cross-disciplinary interaction is valued. The author is developing such a course with a focus on graphics in the sciences, and will describe how the projected course topics and projects can involve students in scientific issues and support the development of skills in scientific visualization.
A situated computing framework for mobile and ubiquitous multimedia access using small screen and composite devices
Authors: Thai-Lai Pham, Georg Schneider, Stuart Goose
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

In recent years, small screen devices, such as cellular phones or Personal Digital Assistants (PDAs), enjoy phenomenal popularity. PDAs can be used to complement traditional computing systems to access personal multimedia information beyond the usage as digital organizers. However, due to the physical limitations accessing rich multimedia contents and diverse services using a single PDA is more difficult. Hence, the Situated Computing Framework (SCF) research project at Siemens Corporate Research (SCR) aims to develop a ubiquitous computing infrastructure that facilitates nomadic users to access rich multimedia contents using small screen devices. This paper describes a new distributed computing concept, the Small Screen/Composite Device (SS/CD) framework, which offers mobile users new classes of ubiquitous and mobile multimedia services without to limit the diversity and the richness of the provided services.
Constrained Discounted Markov Decision Processes and Hamiltonian Cycles
Authors: Eugene A. Feinberg
Venue: Mathematics of Operations Research (2000)

This paper establishes new links between stochastic and discrete optimization. We consider the following three problems for discrete time Markov Decision Processes with finite states and action sets: (i) find an optimal deterministic policy for a discounted problem with constraints, (ii) find an optimal stationary policy for a weighted discounted problem with constraints, (iii) find an optimal deterministic policy for a weighted discounted problem with constraints. We formulate mathematical programs for problems (i)--(iii) and show that the Hamiltonian Cycle Problem is a special case of each of these problems. Therefore problems (i)--(iii) areNP-hard. We also provide new mathematical programming formulations for the Hamiltonian Cycle and Traveling Salesman Problems.
Operations on generalized arrays with the genie compiler
Authors: G. A. Sitton
Venue: Communications of the ACM (1970)

Operations on vectors, matrices, and higher dimensional storage arrays are standard features of most compilers today. The elements of such structures are usually restricted to be scalars. For many sophisticated applications this restriction can impose cumbersome data representations. An efficient system has been devised and implemented which allows the elements of multi-dimensional arrays to themselves be multidimensional arrays. This system was developed from a storage structure in which the location, length, and content of each array is described by a codeword which can be interpreted by the system. Codewords may describe arrays containing more codewords, thus providing all needed descriptive information for hyperstructures of any form.
Iterative dynamic programming: a new class of query optimization algorithms
Authors: Donald Kossmann, Konrad Stocker
Venue: ACM Transactions on Database Systems (TODS) (2000)

The query optimizer is one of the most important components of a database system. Most commercial query optimizers today are based on a dynamic-programming algorithm, as proposed in Selinger et al. [1979]. While this algorithm produces good optimization results (i.e, good plans), its high complexity can be prohibitive if complex queries need to be processed, new query execution techniques need to be integrated, or in certain programming environments (e.g., distributed database systems). In this paper, we present and thoroughly evaluate a new class of query optimization algorithms that are based on a principle that we call iterative dynamic programming, or IDP for short. IDP has several important advantages: First, IDP-algorithms produce the best plans of all known algorithms in situations in which dynamic programming is not viable because of its high complexity. Second, some IDP variants are adaptive and produce as good plans as dynamic programming if dynamic programming is viable and as good-as possible plans if dynamic programming turns out to be not viable. Three, all IDP-algorithms can very easily be integrated into an existing optimizer which is based on dynamic programming.
Improving 3D geometry transformations on a simultaneous multithreaded SIMD processor
Authors: Claude Limousin, Julien Sebot, Alexis Vartanian, Nathalie Drach-Temam
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

In this paper we evaluate the performance of an SMT processor used as the geometry processor for a 3D polygonal rendering engine. To evaluate this approach, we consider PMesa (a parallel version of Mesa) which parallelizes the geometry stage of the 3D pipeline. We show that SMT is suitable for 3D geometry and we characterize the execution of the geometry stage in term of memory hierarchy, which is the main bottleneck. The results show that latency is not fully recovered by SMT; the use of L2 data prefetching does not succeed in increasing the performance. We show that this problem comes from a pollution of the instruction window by the threads experiencing L2 cache misses, thus reducing the window available for the other threads. We thus propose dcPRED, a hardware mechanism to predict L2 misses and control this pollution. Coupled with L2 data prefetching, dcPRED achieves gains up to 21% over the baseline SMT.
A Computational Approach to Finding Causal Economic Laws
Authors: I-Lok Chang, P. A. V. B. Swamy, Charles Hallahan, George S. Tavlas
Venue: Computational Economics (2000)

This paper states four realities of econometric model building and shows that an econometric model can be causal only if the interpretations given to its coefficients are consistent with these realities. A numerically stable algorithm for estimating such a model subject to equality and inequality constraints on the model parameters is presented. This algorithm is designed in such a way that it can be applied even when the matrix of observations on the model's independent variables and the covariance matrix of the model's errors are deficient in rank.
Introduction to a special section on: information systems management
Authors: Gordon B. Davis, M. H. Schwartz
Venue: Communications of the ACM (1983)

This month, Communications is devoting its Research Contributions section to a special purpose: to present the results of research on issues in information systems management. In our call for papers, we asked for contributions emphasizing empirical research&mdash;rather than conceptual formulations. In all, we received 29 papers. Five of those papers are presented in the section that follows. Many of the papers not included here, we believe, will be published later, in Communications or elsewhere.
A proposed new high level abstraction for computer technology
Authors: S. P. Maj, D. Veal, R. Duley
Venue: ACM SIGCSE Bulletin (2001)

Computer technology can be described using a range of models based on different levels of detail e.g. semiconductors, transistors, digital circuits. Such models are designed to progressively hid irrelevant detail and yet provide sufficient information to be useful for communication, design and documentation. However, developments in computer technology have resulted in a low cost, heterogeneous modular architecture that is difficult to model using current methods. This paper proposes a new generic method of modeling computer technology at a higher level of abstraction than those currently used. Investigations to date indicate that this model is independent of architectural detail and can therefore accommodate changes in technology. This new model is more directly relevant to the cheap, low-cost modular architectures in use today. Furthermore, all work to date has strongly indicated it may be useful as the basis of a new pedagogical framework for teaching not only introductory but also more advanced computer technology.
Use of tree structures for processing files
Authors: Edward H. Sussenguth,  Jr.
Venue: Communications of the ACM (1983)

In data processing problems, files are frequently used which must both be searched and altered. Binary search techniques are efficient for searching large files, but the associated file organization is not readily adapted to the file alterations. Conversely, a chained file allocation permits elcient alteration but cannot be searched efficiently. A file organized into a tree-like structure is discussed, and it is shown that such a file may both be searched and altered with times proportional to s log, N, where N is the number of file items and s is a parameter of the tree. It is also shown that optimizing the value of s leads to a search time which is only 25 per cent slower than the binary search. The tree organization employs two data chains and may be considered to be a compromise between the organizations for the binary search and the chained file. The relation of the tree organization to multidimensional indexing and to the trie structure is also discussed.
Developing an automated program checkers
Authors: Julia Isong
Venue: Proceedings of the seventh annual consortium for computing in small colleges central plains conference on The journal of computing in small colleges (2001)

This paper demonstrates the use of an automated program checker as a fast and effective technique for checking numerous programming assignments submitted by students. The process of designing and developing the checker is illustrated by a sample assignment. The paper concludes with a set of guidelines for preparing an assignment specification that is amenable to automated checking.
The Xedni Calculus and the Elliptic Curve Discrete LogarithmProblem
Authors: Joseph H. Silverman
Venue: Designs, Codes and Cryptography (2000)

Let E/\ff_p be an elliptic curve defined over a finite field, and let S,T\in E(\ff_p) be two points on E. The Elliptic Curve Discrete Logarithm Problem (ECDLP) asks that an integer m be found so that S=mT in E(\ff_p). In this note we give a new algorithm, termed the Xedni Calculus, which might be used to solve the ECDLP. As remarked by Neal Koblitz, the Xedni method is also applicable to the classical discrete logarithm problem for \ff_p^* and to the integer factorization problem.