ppxscal/embedding_network huggingface dataset:
Lower Bounds in a Parallel Model without Bit Operations
Authors: Ketan Mulmuley
Venue: SIAM Journal on Computing (1999)

We define a natural and realistic model of parallel computation called the PRAM model without bit operations. It is like the usual PRAM model, the main difference being that no bit operations are provided. It encompasses virtually all known parallel algorithms for (weighted) combinatorial optimization and algebraic problems. In this model we prove that for some large enough constant b, the mincost-flow problem for graphs with n vertices cannot be solved deterministically (or with randomization) in $\sqrt n /b$ (expected) time using $2^{\sqrt {n}/b}$ processors; this is so even if we restrict every cost and capacity to be an integer (nonnegative if it is a capacity) of bitlength at most an for some large enough constant a. A similar lower bound is also proved for the max-flow problem. It follows that these problems cannot be solved in our model deterministically (or with randomization) in $\Omega(N^{c})$ (expected) time with $2^{\Omega(N^{c})}$ processors, where c is an appropriate positive constant and N is the total bitlength of the input. Since these problems were known to be P-complete, this provides concrete support for the belief that P-completeness implies high parallel complexity and for the $P\not = NC$ conjecture. Our lower bounds also extend to the PRAM model with limited bit operations, which provides instructions for parity and left or right shift by one bit.Our proof is based on basic algebraic geometry. So we investigate if the algebrogeometric approach could also work for the P versus NC problem. Our results support this possibility, and a close analysis of the limitation of our technique in this context suggests that such a proof of $P \not = NC$ should somehow use geometric invariant theory in a deep way.
General strategies for dynamic reconfiguration
Authors: Elizabeth L. White
Venue: ACM SIGSOFT Software Engineering Notes (2000)

In recent years there has been a great deal of attention in the software engineering community on the development of techniques and tools that provide support for dynamic reconfiguration, the ability to make changes to a running application. The changes of interest include 1) adding/removing/moving components; 2) adding/removing bindings (communication channels); 3) changing the characteristics of the components or bindings. My work in this area has focused both on software support for dynamic reconfiguration of parallel applications and on frameworks and static software analysis techniques for determining the validity of component-level adaptations in the context of dynamic reconfiguration.
Analysis of bounded disorder file organization
Authors: M. V. Ramakrishna, P. Mukhopadhyay
Venue: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1988)

Recently Litwin and Lomet proposed the Bounded Disorder (BD) file organization which uses a combination of hashing and tree indexing Lomet provided an approximate analysis with a mention of the difficulty involved in exact modeling and analysis. The performance analysis of the method involves solving a classical sequential occupancy problem. We encountered this problem in our attempt to obtain a general model for single access and almost single access retrieval methods developed in the recent years. In this paper, we develop a probability model and present some preliminary results of the exact analysis.
Determination of the Interface Between the Fluids in a Hall--Héroult Cell from Measurements of Electric Potentials and Currents on the Electrodes
Authors: D. J. Cedio-Fengya, M. V. Romerio, M. Vogelius
Venue: SIAM Journal on Control and Optimization (1999)

In this paper we apply the method of electrical impedance tomography to the problem of determining the interface between two fluid layers in a shallow electrolytic cell. We show that any nontrivial set of boundary currents and corresponding boundary voltages suffices to uniquely identify the interface. We propose a very simple reconstruction method that in an essential way uses the fact that the cell is of very small height. Estimates of the accuracy of this method are also provided. Finally we perform a number of computational experiments to demonstrate the efficiency of the method we propose. For the numerical reconstructions we use synthetic data generated from a discretized boundary integral formulation of the underlying conductivity problem.
A methodology for correct-by-construction latency insensitive design
Authors: Luca P. Carloni, Kenneth L. McMillan, Alexander Saldanha, Alberto L. Sangiovanni-Vincentelli
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

In Deep Sub-Micron (DSM) designs, performance will depend critically on the latency of long wires. We propose a new synthesis methodology for synchronous systems that makes the design functionally insensitive to the latency of long wires. Given a synchronous specification of a design, we generate a functionaly equivalent synchronous implementation that can tolerate arbitrary communication latency between latches. By using latches we can break a long wire in short segments which can be traversed while meeting a single clock cycle constraint. The overall goal is to obtain a design that is robust with respect to delays of long wires, in a shorter time by reducing the multiple iterations between logical and physical design, and with performance that is optimized with respect to the speed of the single components of the design. In this paper we describe the details of the proposed methodology as well as report on the latency insensitive design of PDLX, an out-of-order microprocessor with speculative-execution.
CTI in the corporate enterprise
Authors: James J. Wetterau
Venue: International Journal of Network Management (1998)

The goal of computer telephony integration &lpar;CTI&rpar; is to present information about the caller on a data screen, while the call is in progress. It has the potential to reduce the cost of customer contact, and improve the quality of customer service. So how, precisely, is this done? &copy; 1998 John Wiley & Sons, Ltd.
The essential guide to telecommunications (2nd ed.)
Authors: Annabel Z. Dodd
Venue:  (1999)

Your complete, up-to-the-minute telecom/Internet briefing! Whatever your role in telecom or Internet services, you'll be more effective if you understand the basics of telecommunications technology and the realities of the fast-changing telecom business. With The Essential Guide to Telecommunications, Second Edition, you will get this understanding-even if you have no technical background at all. In this book, leading consultant Annabel Z. Dodd teaches you everything you must know to understand the telecommunications industry. You'll find up-to-the-minute coverage of today's hottest technologies, including: Convergence: what it means, what to expect, and how to see through the hype Revolutionary new IP networking applications: telephony, virtual private networks, streaming media, call centers, PBXs, and beyond High-speed Internet access alternatives: cable modems, DSL, and more Frame relay, ATM, ISDN, wireless and other business communications alternatives Dense Wavelength Division Multiplexing (DWDM): the new revolution in fiber optics Dodd presents crystal-clear explanations of the fundamentals everyone in the business assumes you know: what bandwidth is, types of digital cellular services, what multiplexing and compression are, the differences between analog and digital, the role of the public network, the evolution of the Internet, and much more. Most important, she offers crucial insights into the fast-changing competitive landscape, including local competition, Internet access and the impact of new technologies. The Essential Guide to Telecommunications, Second Edition provides an easy to read, comprehensive understanding of what's hot in the telecommunications industry.
Broadcast protocols to support efficient retrieval from databases by mobile users
Authors: Anindya Datta, Debra E. VanderMeer, Aslihan Celik, Vijay Kumar
Venue: ACM Transactions on Database Systems (TODS) (1999)

Mobile computing has the potential for managing information globally. Data management issues in mobile computing have received some attention in recent times, and the design of adaptive braodcast protocols has been posed as an important probllem. Such protocols are employed by database servers to decide on the content of bbroadcasts dynamically, in response to client mobility and demand patterns. In this paper we design such protocols and also propose efficient retrieval strategies that may be employed by clients to download information from broadcasts. The goal is to design cooperative strategies between server and client to provide access to information in such a way as to minimize energy expenditure by clients. We evaluate the performance of our protocols both analytically and through simulation.
The impact of campus-wide portable computing on computer science education
Authors: Cary Laxer, Tomohiro Nishida, Helen Sherlock
Venue: ACM SIGCSE Bulletin (1998)

At least fifty colleges and universities throughout the world have initiated plans under which all students buy, lease, or provide their own portable/laptop computer. The impact of these initiatives on the general educational environment has been widely discussed; however, the impact on the delivery of computer science education has not been. In this working group report we discuss a number of issues pertaining to computer science education in light of campus-wide computing initiatives. Our report relates experiences of faculty already involved in such endeavors plus ideas regarding the future of portable computers in computer science education. As such, it will be beneficial to computer science programmes currently involved in campus-wide computing initiatives as well as those that may become involved in the near future.
The UI design process
Authors: Paul McInerney, Rick Sobiesiak
Venue: ACM SIGCHI Bulletin (2000)

The root cause of many user interface (UI) design deficiencies is not a lack of knowledge about human-computer interaction principles nor a lack of information on user needs. Rather, many UI deficiencies arise because the UI design process is ad hoc and the design is not communicated successfully to the programmers who will implement it. Many UI designers are seeking and discovering ways to plan, manage, and document UI design work more effectively. This workshop provided an opportunity for participants to share lessons learned and obtain advice from other participants.In the weeks leading up to the workshop, participants selected the specific topics that were of prime concern to them. As a result, we narrowed the focus of the workshop to the following topics: bull; Division of UI design activities into stages bull; Division of labor and interdisciplinary collaboration bull; Collaborating in geographically-dispersed projects bull; Writing the UI specification bull; Defining the maturity of the UI design process.The following sections summarize the results of the workshop activities for each of these topics.
High Phase-Lag-Order Runge--Kutta and Nyström Pairs
Authors: S. N. Papakostas, Ch. Tsitouras
Venue: SIAM Journal on Scientific Computing (1999)

We exploit the freedom in the selection of the free parameters of one family of eighth-algebraic-order Runge--Kutta (RK) pairs and of three families of fourth-, sixth-, and eighth-order RK Nyström (RKN) pairs with the purpose of obtaining specific pairs of the highest possible phase-lag order, which are also characterized by minimized principal truncation error coefficients. We present a method for the analytic derivation of the dissipation-order conditions for RK methods and the phase-lag- and dissipation-order conditions for Nyström methods. The RK pairs we study here are based on a one-parameter generalization of some older families of pairs. An algorithm and specific optimized 8(6) Nyström pairs are also provided. For a class of initial value problems, whose solution is known to be described by free oscillations or free oscillations of low frequency with forced oscillations of high frequency superimposed, over long integration intervals, these new pairs seem to offer some advantages with respect to some older pairs. The latter are of the same algebraic orders as the new ones but are characterized by the minimal phase-lag order according to their algebraic order and number of stages.
Leader Election in Asynchronous Distributed Systems
Authors: Scott D. Stoller
Venue: IEEE Transactions on Computers (2000)

In a previous paper, Garcia-Molina specifies the leader election problem for synchronous and asynchronous distributed systems with crash and link failures and gives an elegant algorithm for each type of system. This paper points out a flaw in Garcia-Molina's specification of leader election in asynchronous systems and proposes a new specification.
As-rigid-as-possible shape interpolation
Authors: Marc Alexa, Daniel Cohen-Or, David Levin
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

We present an object-space morphing technique that blends the interiors of given two- or three-dimensional shapes rather than their boundaries. The morph is rigid in the sense that local volumes are least-distorting as they vary from their source to target configurations. Given a boundary vertex correspondence, the source and target shapes are decomposed into isomorphic simplicial complexes. For the simplicial complexes, we find a closed-form expression allocating the paths of both boundary and interior vertices from source to target locations as a function of time. Key points are the identification of the optimal simplex morphing and the appropriate definition of an error functional whose minimization defines the paths of the vertices. Each pair of corresponding simplices defines an affine transformation, which is factored into a rotation and a stretching transformation. These local transformations are naturally interpolated over time and serve as the basis for composing a global coherent least-distorting transformation.
High-Performance Radix-2, 3 and 5 Parallel 1-D Complex FFT Algorithms for Distributed-Memory Parallel Computers
Authors: Daisuke Takahashi, Yasumasa Kanada
Venue: The Journal of Supercomputing (2000)

In this paper, we propose high-performance radix-2, 3 and 5 parallel 1-D complex FFT algorithms for distributed-memory parallel computers. We use the four-step or six-step FFT algorithms to implement the radix-2, 3 and 5 parallel 1-D complex FFT algorithms. In our parallel FFT algorithms, since we use cyclic distribution, all-to-all communication takes place only once. Moreover, the input data and output data are both in natural order.We also show that the suitability of a parallel FFT algorithm is machine-dependent because of the differences in the architecture of the processor elements in distributed-memory parallel computers. Experimental results of 2^p3^q5^r point FFTs on distributed-memory parallel computers, HITACHI SR2201 and IBM SP2 are reported. We succeeded to get performances of about 130 GFLOPS on a 1024PE HITACHI SR2201 and about 1.25 GFLOPS on a 32PE IBM SP2.
Towards robust distributed systems (abstract)
Authors: Eric A. Brewer
Venue: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)

Current distributed systems, even the ones that work, tend to be very fragile: they are hard to keep up, hard to manage, hard to grow, hard to evolve, and hard to program. In this talk, I look at several issues in an attempt to clean up the way we think about these systems. These issues include the fault model, high availability, graceful degradation, data consistency, evolution, composition, and autonomy. These are not (yet) provable principles, but merely ways to think about the issues that simplify design in practice. They draw on experience at Berkeley and with giant-scale systems built at Inktomi, including the system that handles 50% of all web searches.
Oscillation Ring Delay Test for High Performance Microprocessors
Authors: Wen Ching Wu, Chung Len Lee, Ming Shae Wu, Jwu E. Chen, Magdy S. Abadir
Venue: Journal of Electronic Testing: Theory and Applications (2000)

This paper proposes a new test scheme, oscillation ring test, and its associated test circuit organization for delay fault testing for high performance microprocessors. For this test scheme, the outputs of the circuit under test are connected to its inputs to form oscillation rings and test vectors which sensitize circuit paths are sought to make the rings oscillate. High speed transition counters or oscillation detectors can then be used to detect whether the circuit is working normally or not. The sensitizable paths of oscillation rings cover all circuit lines, detecting all gate delay faults, a large part of hazard free robust path delay faults and all the stuck-at faults. It has the advantage of testing the circuit at the working speed of the circuit. Also, with some modification, the scheme can also be used to measure the maximum speed of the circuit. The scheme needs minimal simple added hardware, thus ideal for testing, embedded circuits and microprocessors.
Integrated Range Comparison for Data-Parallel Compilation Systems
Authors: Xian-He Sun, Mario Pantano, Thomas Fahringer
Venue: IEEE Transactions on Parallel and Distributed Systems (1999)

A major difficulty in restructuring compilation, and in parallel programming in general, is how to compare parallel performance over a range of system and problem sizes. Execution time varies with system and problem size and an initially fast implementation may become slow when system and problem size scale up. This paper introduces the concept of range comparison. Unlike conventional execution time comparison in which performance is compared for a particular system and problem size, range comparison compares the performance of programs over a range of ensemble and problem sizes via scalability and performance crossing point analysis. A novel algorithm is developed to predict the crossing point automatically. The correctness of the algorithm is proven and a methodology is developed to integrate range comparison into restructuring compilations for data-parallel programming. A preliminary prototype of the methodology is implemented and tested under Vienna Fortran Compilation System. Experimental results demonstrate that range comparison is feasible and effective. It is an important asset for program evaluation, restructuring compilation, and parallel programming.
Bifurcation Stabilization with Local Output Feedback
Authors: Guoxiang Gu, Xiang Chen, Andrew G. Sparks, Siva S. Banda
Venue: SIAM Journal on Control and Optimization (1999)

Local output feedback stabilization with smooth nonlinear controllers is studied for parameterized nonlinear systems for which the linearized system possesses either a simple zero eigenvalue or a pair of imaginary eigenvalues and the bifurcated solution is unstable at the critical value of the parameter. It is assumed that the unstable mode corresponding to the critical eigenvalue of the linearized system is not linearly controllable. Results are established for bifurcation stabilization using output feedback where the critical mode can be either linearly observable or linearly unobservable. The stabilizability conditions are characterized in explicit forms that can be used to synthesize stabilizing controllers. The results obtained in this paper are applied to rotating stall control for axial flow compressors as an application example.
A Prefix Code Matching Parallel Load-Balancing Method for Solution-Adaptive Unstructured Finite Element Graphs on Distributed Memory Multicomputers
Authors: Yeh-Ching Chung, Ching-Jung Liao, Don-Lin Yang
Venue: The Journal of Supercomputing (2000)

In this paper, we propose a prefix code matching parallel load-balancing method (PCMPLB) to efficiently deal with the load imbalance of solution-adaptive finite element application programs on distributed memory multicomputers. The main idea of the PCMPLB method is first to construct a prefix code tree for processors. Based on the prefix code tree, a schedule for performing load transfer among processors can be determined by concurrently and recursively dividing the tree into two subtrees and finding a maximum matching for processors in the two subtrees until the leaves of the prefix code tree are reached. We have implemented the PCMPLB method on an SP2 parallel machine and compared its performance with two load-balancing methods, the directed diffusion method and the multilevel diffusion method, and five mapping methods, the AE/ORB method, the AE/MC method, the MLkP method, the PARTY library method, and the JOSTLE-MS method. An unstructured finite element graph Truss was used as a test sample. During the execution, Truss was refined five times. Three criteria, the execution time of mapping/load-balancing methods, the execution time of an application program under different mapping/load-balancing methods, and the speedups achieved by mapping/load-balancing methods for an application program, are used for the performance evaluation. The experimental results show that (1) if a mapping method is used for the initial partitioning and this mapping method or a load-balancing method is used in each refinement, the execution time of an application program under a load-balancing method is less than that of the mapping method. (2) The execution time of an application program under the PCMPLB method is less than that of the directed diffusion method and the multilevel diffusion method.
An Efficient Algorithm for Generating Necklaces with Fixed Density
Authors: Frank Ruskey, Joe Sawada
Venue: SIAM Journal on Computing (1999)

A k-ary necklace is an equivalence class of k-ary strings under rotation. A necklace of fixed density is a necklace where the number of zeros is fixed. We present a fast, simple, recursive algorithm for generating (i.e., listing) fixed-density k-ary necklaces or aperiodic necklaces. The algorithm is optimal in the sense that it runs in time proportional to the number of necklaces produced.
Webmaster in a nutshell (2nd ed.): a desktop quick reference
Authors: Stephen Spainhour, Robert Eckstein
Venue:  (1999)

Individuals, organizations, and businesses are relying on their web pages to provide and collect information, manage processes, and interact with communities and customers. A reliable, informative, and responsive web site can reduce cost, increase visibility, and create a positive image for the owner of that site. Behind every successful web page is an overworked and underappreciated webmaster. Webmasters make sure that the information on a site is accessible and usable; that the site is always available; that performance is good; that users can get the information that they need; and that the site can collect the information it needs to serve those users. These disparate tasks require many different tools and skills. Webmaster in a Nutshell pulls together in a single volume all the essential reference information for webmasters working on UNIX-based web servers. In this second edition of Webmaster in a Nutshell, we've updated our material to include the latest versions of HTML and Javascript, and also expanded the book to cover the newest technologies emerging on the Web. The book covers: HTML 4.0, with special attention to forms, tables and framesCSS (Cascading Style Sheets)XML, the next-generation markup language for the WebCGI, with a chapter dedicated to the Perl module CGI.pmJavaScript 1.2PHP, the HTML-embedded programming languageHTTP 1.1, the underlying protocol that drives the WebApache server administration, including Apache modulesmod_perl, the Apache module for enhancing CGIperformance and providing a Perl interface to the Apache API Webmaster in a Nutshell, part of the bestselling O'Reilly series of reference books, makes it easy to find the information you want about the technologies you use. You'll keep your other books on the shelf; you'll keep Webmaster in a Nutshell next to your keyboard.