ppxscal/embedding_network huggingface dataset:
Parallel Resultant Computation
Authors: Doug J. Ierardi, Dexter Kozen
Venue:  (1990)

A resultant is a purely algebraic criterion for determining when a finite collection of polynomials have a common zero. It has been shown to be a useful tool in the design of efficient parallel and sequential algorithms in symbolic algebra, computational geometry, computational number theory, and robotics. We begin with a brief history of resultants and a discussion of some of their important applications. Next we review some of the mathematical background in commutative algebra that will be used in subsequent sections. The Nullstellensatz of Hilbert is presented in both its strong and weak forms. We also discuss briefly the necessary background on graded algebras, and define affine and projective spaces over arbitrary fields. We next present a detailed account of the resultant of a pair of univariate polynomials, and present efficient parallel algorithms for its computation. The theory of subresultants is developed in detail, and the computation of polynomial remainder sequences is derived. A resultant system for several univariate polynomials and algorithms for the gcd of several polynomials are given. Finally, we develop the theory of multivariate resultants as a natural extension of the univariate case. Here we treat both classical results on the projective (homogeneous) case, as well as more recent results on the affine (inhomogeneous) case. The u-resultant of a set of multivariate polynomials is defined and a parallel algorithm is presented. We discuss the computation of generalized characteristic polynomials and relate them to the decision problem for the theories of real closed and algebraically closed fields.
Computationally Manageable Combinatorial Auctions
Authors: M. H. Rothkopf, A. Pekec, R. M. Harstad
Venue:  (1995)

There is interest in designing simultaneous auctions for situations in which the value of assets to a bidder depends upon which other assets he or she wins. In such cases, bidders may well wish to submit bids for combinations of assets. When this is allowed, the problem of determining the revenue maximizing set of nonconflicting bids can be a difficult one. We analyze this problem, identifying several different structures of combinatorial bids for which computational tractability is constructively demonstrated and some structures for which computational tractability cannot be guaranteed.
The Object Group Design Pattern
Authors: Silvano Maffeis
Venue:  (1996)

This paper describes ``Object Group'''', an object behavioral pattern for group communication and fault-tolerance in distributed systems. The Object Group pattern allows the implementation of replicated objects, of load sharing, and of efficient multicast communication over protocols like IP-multicast and UDP-broadcast. Application areas of the pattern are fault-tolerant client/server systems, groupware, and parallel text retrieval engines. Events within an Object Group honor the Virtual Synchrony model. Owing to Virtual Synchrony, the size of an object group can be varied at run-time, while client applications are interacting with the object. A replicated state remains consistent in spite of objects entering and leaving the group dynamically and in spite of failures. The Object Group pattern has been implemented in the Electra and in the Orbix+Isis CORBA Object Request Broker.
Markov inequality for polynomials of degree n with mdistinct zeros
Authors: David Benko, Tamás Erdélyi
Venue: Journal of Approximation Theory (2003)

Let Pnm be the collection of all polynomials of degree at most n with real coefficients that have at most m distinct complex zeros. We prove that maxx ∈ [0,1] | P'(x| ≤ 32.8m n maxx ∈ [0,1] |P(x)| for every P∈ Pnm. This is far away from what we expect. We conjecture that the Markov factor 32.8mn above may be replaced by cmn with an absolute constant c > 0. We are not able to prove this conjecture at the moment. However, we think that our result above gives the best-known Markov-type inequality for Pnm on a finite interval when m ≤ c log n.
The Derivation of Compositional Programs
Authors: K. M Chandy, Carl Kesselman
Venue:  (1992)

This paper proposes a parallel programming notation and a method of reasoning about programs with the following characteristics: (1) Parallel Composition The notation provides different forms of interfaces between processes; the more restrictive the interface, the simpler the proofs of process composition. A flexible interface is that of cooperating processes with a shared address space; proofs of programs that use this interface are based on non-interference [OG76] and temporal logic [Pnu81,CM88, Lam9l]. We also propose more restrictive interfaces and specifications that allow us to use the following specificattion rule: the strongest specification of a parallel composition of processes is the conjunction of the strongest specifications of its components. This rule is helpful in deriving parallel programs. (2) Determinism A process that does not use certain primitives of the notation is guaranteed to be deterministic. Programmers who wish to prove that their programs are deterministic are relieved of this proof obligation if they restrict their programs to a certain subset of the primitives.
Experience with Secure Multi-Processing in Java
Authors: Dirk Balfanz, Li Gong
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

As the Java(TM) platform is the preferred environment for the deployment of network computers, it is appealing to run multiple applications on a single Java-enabled desktop. We experimented with using the Java platform as a multi-processing, multi-user environment. Although the Java Virtual Machine (JVM) is not inherently a single-application design, we have found that the implementation of the Java Development Kit (JDK) often implicitly assumes that the JVM runs exactly one application at any one time. In this paper, we report the limitations we encountered and propose improvements to several aspects of the Java technology architecture, including its security features. We have implemented all the proposed changes in a prototype based on an in-house beta version of JDK 1.2. Our prototype uses a Bourne shell-like command line tool to launch multiple applications (such as Appletviewer) within one JVM.
The Thread-Based Protocol Engines for CC-NUMA Multiprocessors
Authors: Hung-Chang Hsiao, Chung-Ta King
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

With the vast advances of Internet services, large-scale and high-performance servers, such as CC-NUMA multiprocessors, are gaining importance in network computing. In a CC-NUMA multiprocessor, the key component to connect a computing node to the interconnection network is the node controller. Node controllers perform protocol processing to transmit messages with other nodes in the system. As the new generation, CC-NUMA multiprocessors are moving towards application-specific protocol processing, a node controller will require very powerful protocol processors or engines to provide the flexibility of processing different kinds of protocols.In this paper, we study the design of a thread-based node controller, in which protocol engines have a multithreaded architecture. Multi-threading allows protocol processing of different requests to proceed in parallel, whereby reducing blocking and improving response time. Four important design parameters for a multithreaded protocol engine are examined: (1) the number of thread context storages, (2) the number of protocol operation units, (3) the scheduling policy and (4) the thread allocation scheme. From the application-driven simulation on six representative applications, we conclude that the number of threads contexts and protocol operation units have a great impact on the overall system performance. An appropriate thread allocation scheme for invalidation traffic is needed, and prioritizing a thread and scheduling it accordingly are important for the system performance.
Syntactic features in question answering
Authors: Xiaoyan Li
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Syntactic information potentially plays a much more important role in question answering than it does in information retrieval. Although many people have used syntactic evidence in Question Answering, there haven't been many detailed experiments reported in the literature. The aim of the experiment described in this paper is to study the impact of a particular approach for using syntactic information on question answering effectiveness. Our results indicate that a combination of syntactic information with heuristics for ranking potential answers can perform better than the ranking heuristics on their own.
Diagnosis of damage in RC structures based on structural static response with the ANN technique
Authors: C. H. Tsai, D. S. Hsu
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

This work develops a feasible diagnostic model for reinforced concrete structures through the artificial neural network technique, based on structural static responses, to detect the damage conditions. A simply supported RC beam with a specified size and assumed defect is theoretically analyzed to produce the structural static responses. The structural responses are then combined with relative damage conditions to generate training and testing numerical examples, necessary to assess the damage to the RC structure by using the artificial neural network. On the other hands, a test sample of RC beams with various extents of artificial damage is constructed and tested to diagnose the damage condition by using well-trained neural networks. Therefore, this work successfully fabricates a feasible diagnostic model, which will be needed for real world damage assessment applications.
Moving to Linux: Kiss the Blue Screen of Death Goodbye!!
Authors: Gagne
Venue:  (2003)

:Say goodbye to Windows® crashes, viruses, hassles, and cost!Moving to Linux can help you migrate from Windows to Linux in just hours! By the time you've finished, you'll be able to do virtually anything in Linux-without the aggravation, crashes, security risks, or high costs of running Windows!This is not a book for techies! It's a book for people like you: people who write documents, create spreadsheets, surf the Web, send emails, listen to CDs, play games-and want to do it simply in Linux, without becoming technical experts!Convert your Windows PC to a Linux system that does more for less money-one step at a timeBrowse the Internet, send and receive email, even send instant messages using your existing AOL, MSN, and Yahoo! accountsConnect your digital camera or scannerRip music, burn and play CDs Discover the world of Linux games: from solitaire to flight simulators, and beyondThere's more!! Write, calculate, and present with OpenOffice.org, the free office suite for Linux that can also read and write all of your existing Microsoft Office documents.Say goodbye to expensive software upgrades, burdensome Microsoft licensing, Windows viruses, and "blue screens of death." Say hello to computing the way it's supposed to be--with Linux!About the CD-ROMIncludes special bootable Linux "Knoppix" CD: prove the power, simplicity, and value of Linux to yourself without touching your current Windows system!
Particle seas and basic hypergeometric series
Authors: Sylvie Corteel
Venue: Advances in Applied Mathematics (2003)

Particle seas were introduced by Claude Itzykson to give a direct combinatorial proof of the Jacobi triple product [Viennot, Empilements, 1999]. We show here how generalized particle seas can be employed to give bijective proofs of several identities in the theory of basic hypergeometric series. We give details for the 1ψ1 summation and two limiting cases of the 6ψ5 summation.
Heuristic Self-Organization Algorithms for Software Reliability Assessment and Their Applications
Authors: Tadasji Dohi, Shunji Osaki, Kishor S. Trivedi
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

The GMDH (group method of data handling) network is an adaptive learning machine based on the principle of heuristic self-organization. In this paper, we apply the GMDH networks to predict software reliability in testing phase. Three kinds of networks: the basic GMDH and its improved versions based on PSS (prediction sum of squared) and AIC (Akaike information criterion), are introduced fro the prediction of the failure-occurrence times observed in testing phase of the software system. In numerical examples, the GMDH networks, the usual MLP (multi-layer perceptron) neural network and existing SRGMs (software reliability growth models) are compared from the viewpoint of predictive performance. It is shown that the GMDH networks can overcome the problem of determining a suitable network size in the use of an MLP neural network, and can provide a more accurate measure in the software reliability assessment than other prediction devices. Further, the problem to determine the optimal software release schedule, which minimizes the relevant expected total software cost, is considered in the framework of the GMDH network architecture.
Quality Mesh Generation in Higher Dimensions
Authors: Scott A. Mitchell, Stephen A. Vavasis
Venue:  (1996)

We consider the problem of triangulating a d-dimensional region. Our mesh generation algorithm, called QMG, is a qradtree-based algorithm that can triangulate any polyhedral region including nonconvex regions with holes. Furthermore, our algorithm guarantees a bounded aspect ratio triangulation provided that the input domain itself has no sharp angles. Finally, our algorithm is guaranteed never to overrefine the domain in the sense that the number of simplices produced by QMG is bounded above by a factor times the number produced by any competing algorithm, where the factor depends on the aspect ratio bound satisfied by the competing algorithm. The QMG algorithm has been implemented in C++ and is used as a mesh generator for the finite element method.
Brazil: the envisaged telecommunication scenario in the near future
Authors: A. A. Borges, L. E. C. Gomes
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The Brazilian telecommunication sector is experiencing a process of institutional and technological changes. The new Congress is discussing new rules for a market economy with flexibility, including the disruption of the TELEBRAS monopoly, where a conglomerate of 29 state companies are responsible for telecommunications in the country. Besides the necessary constitutional changes, the government has to guarantee access to telecommunication services by the low income population, the deployment of well defined networks and services standards and to prepare TELEBRAS for this new and more competitive environment. This paper describes how this process is being conducted, presents the technological perspectives of the services and networks evolution, including milestones of the present network and for the 1996, 2000 and 2010 transition scenarios and concludes with some issues on the deregulation trends, a matter that is attracting the Brazilian society attention and is part of the government program.
Improving Application Throughput With Enterprise JavaBeans Caching
Authors: Avraham Leff, James T. Rayfield
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We present the design of an Enterprise JavaBeans(EJBs) caching architecture, and show that EJB cachingcan greatly improve application throughput. Throughputis improved because data serving is offloaded from thedatabase server to the cache-enabled application server.An important feature of our architecture is that thecaching function is transparent to applications that use it.The cache-enabled application server uses the same(EJB) programming model, and the same transactionalsemantics, as provided by non-caching architectures.
A problem in the regularity calculus
Authors: H. P Hofstee
Venue:  (1993)

No Abstract. 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
Active Dressware: Wearable Proprioceptive Systems Based on Electroactive Polymers
Authors: Danilo de Rossi, Federico Lorussi, Alberto Mazzoldi, E. P. Scilingo, Piero Orsini
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

A technology based on conducting polymers and rubber microdispersed carbon phases enables the realization of truly wearable instrumented garments capable of recording proprioceptive maps and of stiffening body and hand segments with no discomfort for the subject, negligible motion artifacts and body overload. Applications are foreseen in virtual and augmented reality, teleoperation and rehabilitation fields.
Signal Attenuation in Transmission Lines
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Transmission lines are standard wave guiding structures used for data transmission in multi-point communications. Signal attenuation, signal integrity, and transmission loss associated with transmission lines are modeled and investigated in this paper. Performance of transmitting data in coaxial cables and in strip transmission lines are analyzed using an accurate and efficient Method of Moments (MoM) solution based on solving Maxwell's equations for the electromagnetic fields associated with wave guiding structures supporting data transmission in finite homogeneous and isotropic media. The analysis in this paper models attenuation losses, conductive losses, and dielectric losses for a coaxial cable and a Printed Circuit Board (PCB). The models show that transmission loss is mainly dominated by conductive losses in metals for frequencies up to 25 GHz and by dielectric losses at much higher frequencies. Results show that high attenuation prevents data transmission at much higher frequencies unless the transmission line is designed using low-loss dielectric materials in the dielectric medium and high conductive material in the metals. 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
Do the Pseudospectra of a Matrix Determine its Behavior?
Authors: Anne Greenbaum, Lloyd N. Trefethen
Venue:  (1993)

Let $A$ and $B$ be square matrices. It is shown that the condition $(R) ||(zI-A)^{-1}|| = ||(zI -B)^{-1}||$ for all $z \in \complex$ is equivalent to the condition $(P) ||p(A)|| = ||p(B)||$ for all polynomials $p$ if $|| \cdot ||$ is the Frobenius norm, but not if $|| \cdot ||$ is the 2-norm.
Effective Web Caching for GPRS Networks
Authors: Yingjie Li, Cho-Yu Chiang, Ming T. Liu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Recent years, providing Web access to mobile users has become a major focus of the wireless network operations. A number of Web caching schemes have been proposed toimprove response time of wireless Web access. Nevertheless, none of these schemes fit well into the GPRS model, which is an IP-based packet-switching extension of GSM. In this paper, various factors that must be considered in designing a Web caching scheme for GPRSare discussed. By taking those factors into account, we employ a known Web caching scheme, CNP, and extend its support of Web access for wireline networks into wireless GPRS environments. We also present how to incorporate CNP to deal with the Web proxy placement problem for GPRS.
Efficient Scheduling of DSP Code on Processors with Distributed Register Files
Authors: Bart Mesman, Carlos A. Alba Pinto, Koen Van Eijk
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

Code generation methods for digital signal processors are increasingly hampered by the combination of tight timing constraints imposed by the algorithms and the limited capacity of the available register files. Traditional methods that schedule spill code to satisfy storage capacity have difficulty satisfying the timing constraints. The method presented in this paper analyses the combination of limited register file capacity, resource- and timing constraints during scheduling. Value lifetimes are serialized until all capacity constraints are guaranteed to be satisfied after scheduling. Experiments in the FACTS environment show that we efficiently obtain high quality instruction schedules for inner-most loops of DSP algorithms.
Display Condensation of Program Text
Authors: James E. Archer,  Jr., Richard W. Conway
Venue:  (1981)

NO SUPPLIED
COCA: A Secure Distributed On-line Certification Authority
Authors: Lidong Zhou, Fred B. Schneider, Robbert van Renesse
Venue:  (2000)

COCA is a fault-tolerant and secure on-line certification authority that has been built and deployed both in a local area network and in the Internet. Replication is used to achieve availability; proactive recovery with threshold cryptography is used for digitally signing certificates in a way that defends against mobile adversaries which attack, compromise, and control one replica for a limited period of time before moving on to another. Relatively weak assumptions characterize environments in which COCA''s protocols will execute correctly. No assumption is made about execution speed and message delivery delays; channels are expected to exhibit only intermittent reliability; and with 3t+1 COCA servers up to t may be faulty or compromised. The result is a system with inherent defenses to certain denial of service attacks because, by their very nature, weak assumptions are difficult for attackers to invalidate. In addition, traditional techniques, including request authorization, resource management based on segregation and scheduling different classes of requests, as well as caching results of expensive cryptographic operations further reduce COCA''s vulnerability to denial of service attacks. Results from experiments in a local area network and the Internet allow a quantitative evaluation of the various means COCA employs to resist denial of service attacks.
Musician's Guide to the Internet, 2 edition
Authors: Todd Souvignier, Rob Levine
Venue:  (2002)

:There are many Internet guide books on the market, but this one is written specifically for musicians, with practical information on how to make new contacts to further their careers. This book shows aspiring musicians how to use the Net to promote their work, from putting (and protecting) their music on the Web, to running a band e-mail list, to setting up their own home page. Includes information on: musical hangouts on the Net; how to get into virtual magazines and chart on virtual radio; how to connect with fans; e-mail and URL directories of important industry people in cyberspace; and much more.
A New Database for Research on Bank-Check Processing
Authors: G. Dimauro, S. Impedovo, R. Modugno, G. Pirlo
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper presents a new database for off-line handwriting recognition. The database, that isparticularly devoted to research on bank-check recognition, up to now includes instances of isolated digits and characters, basic words of worded amounts, and signatures. Pattern images are stored using a standard image format, and hence they are easily usable by several commercial and scientific image processing packages.