ppxscal/embedding_network huggingface dataset:
How Many Real Numbers Are There?
Authors: Paul C. Gilmore
Venue:  (1989)

The question posed in the title of this paper is raised by a reexamination of Cantor''s diagonal argument. Cantor used the argument in its most general form to prove that no mapping of the natural numbers into the reals could have all the reals as its range. It has subsequently been used in a more specific form to prove, for example, that the computable reals cannot be enumerated by a Turing machine. The distinction between these two forms of the argument can be expressed within a formal logic as a distinction between using the argument with a parameter F, denoting an arbitrary map from the natural numbers to the reals, and with a defined term F, representing a particular defined map. \nThe setting for the reexamination is a natural deduction based set theory, NaDSet, presented within a Gentzen sequent calculus. The elementary and logical syntax of NaDSet, as well as its semantics, is described in the paper. The logic extends an earlier form by removing a restriction on abstraction, and by replacing first and second order quantifiers by a single quantifier. The logic remains second order, however; this is necessary to avoid an abuse of use and mention that would otherwise arise from the interpretation of atomic sentences. \nThat there can be doubt about the number of reals is suggested by the failure of the general form of Cantor''s diagonal argument in NaDSet. To provide a basis for discussion, a formalization of Godel-Bernays set theory is provided within NaDSet. The subsequent discussion reinforces Skolem''s relativistic answer to the question posed. \nAlthough the general form of Cantor''s argument fails in NaDSet, a rule of deduction which formalizes the argument for defined maps is derived. A simple application of the rule is provided. \nFeferman has argued that a type-free logic is required for the formalization of category theory since no existing logic or set theory permits self-reference of the kind required by the theory. A demonstration is provided elsewhere that category theory can be formalized within NaDSet. An elementary form of the demonstration is provided in the paper by proving a theorem suggested by _{A}<$ for which $\oplus $ is a binary, commutative. and associative _{A},$ is itself such a structure under cartesian product and isomorphism.
QRS detection using artificial neural networks for ambulatory ECGs.
Authors: Arkell
Venue:  (1994)

Abstract unavailable. 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
Realization of Cooperative Agents Using an Active Object-OrientedDatabase Management System
Authors: Andreas Geppert, Markus Kradolfer, Dimitrios Tombros
Venue:  (1995)

Cooperative, process-oriented environments (CPEs) are systems whose behavior is defined in terms of process models. We show how CPEs are realized through brokers, which are a special form of software agents used to model participating entities in CPEs. A broker can represent a human participant, an existing software tool, or a part of the environment infrastructure. In our approach, we implement brokers on top of the active object-oriented database management system (ADBMS) SAMOS. Particularly, we use the facilities of SAMOS for implementing communication/cooperation between and control of brokers in CPEs. Our approach allows the construction of flexible, extensible systems and the definition of the behavior of participating entities local to brokers, avoiding the need for a centralized process engine.
Combining spatial and navigational structure in the hyper-hitchcock hypervideo editor
Authors: Frank Shipman, Andreas Girgensohn, Lynn Wilcox
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

Existing hypertext systems have emphasized either the navigational or spatial expression of relationships between objects. We are exploring the combination of these modes of expression in Hyper-Hitchcock, a hypervideo editor. Hyper-Hitchcock supports a form of hypervideo called "detail-on-demand video" due to its applicability to situations where viewers need to take a link to view more details on the content currently being presented. Authors of detail-on-demand video select, group, and spatially arrange video clips into linear sequences in a two-dimensional workspace. Hyper-Hitchcock uses a simple spatial parser to determine the temporal order of selected video clips. Authors add navigational links between the elements in those sequences. This combination of navigational and spatial hypertext modes of expression separates the clip sequence from the navigational structure of the hypervideo. Such a combination can be useful in cases where multiple forms of inter-object relationships must be expressed on the same content.
Toward Parallel Mathematical Software for Elliptic Partial Differential Equations
Authors: Calvin J. Ribbens, Layne T. Watson, Colin DeSa
Venue:  (1991)

Three approaches to parallelizing important components of the mathematical software package ELLPACK are considered: an explicit approach using compiler directives available only on the target machine, an automatic approach using an optimizing and parallelizing precompiler, and a two-level approach based on extensive use of a set of low level computational kernels. The focus is on shared memory architectures. Each approach to parallelization is described in detail, along with a discussion of the effort involved. Performance on a test problem, using up to sixteen processors of a Sequent Symmetry S81, is reported and discussed. Implications for the parallelization of a broad class of mathematical software are drawn.
An Extension of Kaczmarz''s Projections Method with Relaxation Parameter to Inconsistent and Rank Defficient Least-Squares Problems
Authors: C. Popa
Venue:  (1996)

It is well known that for inconsistent rank-defficient least-squares problems classical Kaczmarz''s relaxation together with some further developements,generates sequences which do no more converge to the minimal norm solution ,denoted here x>sub<LS>/sub<.In this paper we construct an extension of Kaczmarz''s iteration,with two relaxation parameters which can be properly choosen in (0,2),which in the general case of inconsistent rank-defficient least-squares problems,generates sequences convergent to x>sub<LS>/sub<. 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
Optimal Parallel Algorithms for Convex Polygon Separation
Authors: Norm Dadoun, David G. Kirkpatrick
Venue:  (1989)

Cooperative parallel algorithms are presented for determining convex polygon separation and constructing convex polygon mutual tangents. Given two $n$-vertex convex polygons, using $k$ CREW processors $(1 \leq k \leq n)$, each of these algorithms has an $ \Theta (\log n/(l + \log k)) $ time bound. This provides algorithms for these problems which run in $O(\log n)$ time sequentially or in constant time using a quasi-linear $(n^{\alpha}$ for some $\alpha < 0$) number of processors. \n\n These algorithms make use of hierarchical data structures to solve their respective problems. The polygonal hierarchy used by our algorithms is available implicitly (with no additional preprocessing) within standard representations of polygons.
A Theory of Schema Labelling
Authors: William S. Havens
Venue:  (1984)

Schema labelling is a representation theory which focuses on composition and specialization as two major aspects of machine perception. Previous research in computer vision and knowledge representation have identified computational mechanisms for these tasks. We show that the representational adequacy of schema knowledge structures can be combined advantageously with the constraint propagation capabilities of network consistency techniques. In particular, composition and specialization can be realized as mutually- interdependent cooperative processes which operate on the same underlying knowledge representation. In this theory, a schema is a generative representation for a class of semantically related objects. Composition builds a structural description of the scene from rules defined in each schema. The scene description is represented as a network consistency graph which makes explicit the objects found in the scene and their semantic relationships. The graph is hierarchical and describes the input scene at varying levels of detail. Specialization applies network consistency techniques to refine the graph towards a global scene description. Schema labelling is being used for interpreting hand-printed Chinese characters [10], and for recognizing VLSI circuit designs from their mask layouts [2]. 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
Illumination Problems in Computer Augmented Reality
Authors: Alain Fournier
Venue:  (1994)

The ability to merge a real video image (RVI) with a computer-generated image (CGI) enhances the usefulness of both. To go beyond "cut and paste" and chroma-keying, and merge the two images successfully, one must solve the problems of common viewing parameters. common visibility and common illumination. The result can be dubbed Computer Augmented Reality (CAR). The solution needs contributions from both computer graphics and computer vision. The problems of common illumination are especially challenging, because they test our understanding and practice of shadow and global illumination computation. In this paper we will describe and illustrate work in our laboratory where the emphasis is on extracting illumination information from real images and computing the common illumination between the real and the computer generated scene.
Generation of Natural-Looking 3D Shapes by Simulated Evolution
Authors: F. Manolache, S. Edelman
Venue:  (1993)

Diverse complex simulated objects are widely used in psychophysical study of visual recognition, in computer graphics, and in animation. This paper describes a method to generate artificially objects belonging to a given subjectively characterized class. The method uses artificial evolution and is based on the observation that humans may classify objects by comparing them with previously encountered structural prototypes. An efficient artificial evolution algorithm was obtained using a thermodynamical point of view of the object universe, which regarded objects as populations of generic parts characterized by an entropy-like function used as fitness. The object''s evolution is driven by the prototypes, is locally controlled by the external conditions, and tends to maximize a measure of fitness which is analogous to entropy in the second law of thermodynamics.
Flexible Collaboration Transparency
Authors: Begole James "Bo", Shaffer Clifford A.
Venue:  (1998)

This paper presents two distinct contributions: First, we present a critique of collaboration transparency as it is currently implemented in contrast to collaboration-aware implementations. We find conventional collaboration-transparency systems lacking in terms of efficient use of network resources and support for key groupware principles: concurrent work, relaxed WYSIWIS, and group awareness. Second, we examine the causes of these deficiencies, and then present an alternative implementation approach based on an object-oriented replicated architecture where selected single-user interface objects are dynamically replaced by multi-user extensions. The replacement is transparent to the single-user application and its developer. As an instance of this approach, we described its incorporation into a Java-based collaboration-transparency system, called JAMM.
A case-based expert system for estimating the cost of refurbishing construction buildings
Authors: Farhi Marir, Frank Wang, Karim Ouazzane
Venue: Enterprise information systems IV (2003)

CBRefurb is a case-based reasoning (CBR) system for the strategic cost estimation for building refurbishment. This domain is characterised by many uncertainties and variation. Its cost estimation involves large amount of interrelated factors whose impact is difficult to assess. This paper report on the problems faced by the building cost information Services (BCIS) databases and several rule-based expert systems to tackle this complex cost estimation problem and, the design and evaluation of CBRefurb system implemented using ReMind Shell. CBRefurb imitates the domain expert in its approach of breaking down the whole building work into smaller work (building items) by organising the refurbishment cases as a hierarchical structure composed of cases and subcases. The process of estimation imitates the expert by considering only these pieces of previous cases of similar situation (or context). For this purpose, CBRefurb defines some of the building and its component (or items) features as a global context and local context information used to classify cases and subcases into context cases and subcases, and to decompose the cost estimation problem into adaptable subproblems. This is followed by a two indexing schemes to suit the hierarchical structure of the case and the problem decomposition and to allow classification and retrieval of contextual cases. CBRefurb features consolidate the aim of the project that is allowing multiple retrieval of appropriate pieces of the refurbishment which are easier to adapt, reflecting the expert method of estimating cost for complex refurbishment work.
Decentering the dancing text: from dance intertext to hypertext
Authors: Timothy Miles-Board, Deveril, Janet Lansdale, Leslie Carr, Wendy Hall
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

This paper explains and draws together two projects from different disciplines: dance studies and hypertext writing. Each project sets out to examine the processes and practices of hypertextuality, and to develop new ways of writing using electronic technology and the Internet. The dance studies project seeks to link the critical theory of intertextuality (as a means of dance interpretation) with the theoretical and practical concerns of hypertextuality. It hopes to show a convergence of the two into a working system for analysing dance in a network of people, institutions and information. The Associative Writing Framework (AWF) project seeks to explore how writers could best be supported in representing and exploring hypertextuality in a Web environment, and in producing new hypertexts which integrate or "glue together" existing Web resources (ideas, concepts, data, descriptions, experiences, claims, theories, suggestions, reports, etc.). Following the combining of the two projects we report on some initial evaluation of the AWF system by dance experts, and discuss where the relationship might lead and potential future outcomes of the collaboration.
Pipelining the Givens Linear Solver on Distributed Memory Machines
Authors: J. Papay, M. J. Zemerly, G. R. Nudd
Venue:  (1995)

Pipelining is normally associated with shared memory and vector computers and rarely used as an algorithm design technique for distributed memory architectures. In this paper we show how pipelining enables communication and computation to be overlapped on a distributed memory parallel computer (128 T800 Parsytec SuperCluster) yielding a significant speedup. A linear solver based on Givens rotations is selected and parallelised using two different techniques. A non-overlapping algorithm using collective communication, such as optimised broadcast and collection, is compared with a pipelined (overlapping) algorithm using only simple point-to-point communications between neighbouring processors. Both algorithms use the same computational modules which have been identified and extracted from the sequential code.
The QoSbox: A PC-Router for Quantitative Service Differentiation in IP Networks
Authors: Nicolas Christin, Jorg Liebeherr
Venue:  (2001)

We describe the design and implementation in UNIX-based PCs of the QoSbox, a configurable IP router that provides per-hop service guarantees on loss, delays and throughput to classes of traffic. There is no restriction on the number of classes or the specific service guarantees each class obtains. The novel aspects of the QoSbox are that (1) the QoSbox does not rely on any external component (e.g., no traffic shaping and no admission control) to enforce the desired service guarantees, but instead, (2) dynamically adapts packet forwarding and dropping decisions as a function of the instantaneous traffic arrivals; also, (3) the QoSbox can enforce both absolute bounds and proportional service guarantees on queueing delays, loss rates, and throughput at the same time. We evaluate the QoSbox in a testbed of PC-routers over a FastEthernet network, and show that the QoSbox is a possible solution allowing for incremental deployment to the problem of providing service differentiation in a scalable manner.
Dynamic Selection of Compression Formats to Reduce Transfer Delay
Authors: Chandra Krintz, Brad Calder
Venue:  (2000)

The computational paradigm of the Internet is such that applications are retrieved from remote sites and processed locally or are transfered for remote execution. Given the gap between processor and network speeds, mechanisms are needed to compensate for transfer time in order to maintain acceptable performance of mobile programs. Compression is used to reduce transfer delay by reducing the number of bytes transfered through the use of compact file encoding. In this paper, we examine two techniques for reducing compression-based transfer delay using Java as our platform for mobile code. We first examine the benefit from Selective Compression, a profile-directed optimization that combines and compresses only class files that are used during execution (as opposed to the entire application). Our results show that this approach reduces transfer delay from 11% to 13% on average across all compression techniques and networks studied. The second technique we examine is dynamic selection of compression formats based upon the underlying network connectivity. We consider compression-based transfer delay as the time required for transfer and decompression of files. We show that the compression format that achieves the least delay varies greatly with the network bandwidth available. Therefore, we propose to store mobile programs at the server in different compression formats. Dynamic Compression Format Selection (DCFS) is then used on the client to predict the compression format that will result in the least delay given the bandwidth predicted to be available when transfer occurs. Our results show that DCFS reduces 36% of compression-based transfer delay on average, for the networks and wire-transfer formats studied. When combined with selective compression, we achieve 47% average reduction in delay (60% reduction over the use of jar files).
Analysis of a Nonhierarchical Decomposition Algorithm
Authors: Jayashree Shankar, Calvin J. Ribbens, Robert T. Haftka, Layne T. Watson, Jaroslaw Sobieszczanski-Sobieski
Venue:  (1992)

Large scale optimization problems are tractable only if they are somehow decomposed. Hierarchical decompositions are inappropriate for some types of problems and do not parallelize well. Sobieszczanski-Sobieski has proposed a nonhierarchical decomposition strategy for nonlinear constrained optimization that is naturally parallel. Despite some successes on engineering problems, the algorithm as originally proposed fails on simple two dimensional quadratic programs. This paper carefully analyzes the algorithm for quadratic programs, and suggests a number of modifications to improve its robustness.
ASPECTS OF THE SOLUTION OF SOME MULTICLASS LOSS SYSTEMS
Authors: Alexandre Brandwajn, Anil K. Sahai
Venue:  (1990)

Stochastic service systems in which no queueing is allowed have been around for quite some time as models of telephone systems. Recently, such loss systems with a finite number of request sources were shown to be of interest in the modeling of path contention occurring in many current I/O computer architectures. This paper considers two aspects of finite source loss sytems with several classes of requests (``customers'''') arising, for instance, in the representation of more realistic I/O workloads. First, we present a simple approach to the solution of such systems in the case of classical multiple servers. This approach is based on the use of recurrence relationships which can be shown to exist among conditional averages, and leads to an efficient computation of server utilizations and loss probabilities. In the second part of this paper, we consider generalized loss systems in which the service resources are viewed as a global quantity (rather than a specific fixed number of servers), each class of customers requesting a given amount of the global resource. Such systems are useful, for example, as models of bus bandwidth shared among several types of transfers. We find that, although these systems exhibit a product-form solution, the simple recurrences derived for regular multiserver loss systems do not seem to carry over to the generalized systems. Therefore, we present an alternative approach, based on equivalence techniques, which allows to obtain the solution of such generalized systems through repeated solutions of a single-class loss model. A comparison with the existing convolution method for evaluation the product-form solution, indicates that the proposed method is significantly more efficient both in terms of computational complexity and computer memory requirements. (Supersedes 90-03.)
A Queueing Network Analysis of Dynamic Recon-figurability in a Hierarchical Information Network
Authors: Richard E. Nance, U. N Bhat
Venue:  (1992)

Using a queueing network model of a hierarchical information network, we compare the effect of limited dynamic reconfiguration on expected transmission delays. Two distinctive features characterize the queueing network model. First, the assignment of a set of weights to the nodes dependent on the hierarchical level reflects the increasing importance of information as it is transferred to higher levels. Second, the dynamic hierarchy requires a communications protocol that partitions the analysis of network delay into three periods: regular operation, reconfiguration, and adjustment. Characterization of the performance of the dynamic hierarchy entails the description of message transmission delay as a composite of the three periods.