ppxscal/embedding_network huggingface dataset:
Multisplitting Methods: Optimal Schemes for the Unknowns in a Given Overlap
Authors: R. E. White
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

Consider a linear algebraic problem where the set of unknowns is a union of subsets. Let the coefficient matrix have a splitting associated with each subset. The traditional multisplitting method forms a weighted sum, over the overlapping unknowns, of the iterates for each such splitting to obtain a single parallel iterative method. An optimal alternative to the weighted sums will be presented. Convergence of this new form of multisplitting (MS) method can be studied for both symmetric positive definite (SPD) matrices and M-matrices. Applications to PDEs and the equilibrium equations for fluid flow in a driven cavity will be presented.
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
Authors: John T. Robinson
Venue: Proceedings of the 1981 ACM SIGMOD international conference on Management of data (1981)

The problem of retrieving multikey records via range queries from a large, dynamic index is considered. By large it is meant that most of the index must be stored on secondary memory. By dynamic it is meant that insertions and deletions are intermixed with queries, so that the index cannot be built beforehand. A new data structure, the K-D-B-tree, is presented as a solution to this problem. K-D-B-trees combine properties of K-D-trees and B-trees. It is expected that the multidimensional search effieciency of balanced K-D-trees and the I/O efficiency of B-trees should both be approximated in the K-D-B-tree. Preliminary experimental results that tend to support this are reported.
Algorithms for the Relaxed Online Bin-Packing Model
Authors: Giorgio Gambosi, Alberto Postiglione, Maurizio Talamo
Venue: SIAM Journal on Computing (2000)

The typical online bin-packing problem requires the fitting of a sequence of rationals in (0,1] into a minimum number of bins of unit capacity, by packing the ith input element without any knowledge of the sizes or the number of input elements that follow. Moreover, unlike typical online problems, this one issue does not admit any data reorganization, i.e., no element can be moved from one bin to another. In this paper, first of all, the "Relaxed" online bin-packing model will be formalized; this model allows a constant number of elements to move from one bin to another, as a consequence of the arrival of a new input element. Then, in the context of this new model, two online algorithms will be described. The first presents linear time and space complexities with a 1.5 approximation ratio and moves, at most once, only "small" elements; the second, instead, is an O(n log n) time and linear space algorithm with a 1.33. . . approximation ratio and moves each element a constant number of times. In the worst case, as a result of the arrival of a new input element, the first algorithm moves no more than three elements, while the second moves as many as seven elements. Please note that the number of movements performed is explicitly considered in the complexity analysis. Both algorithms are below the theoretical 1.536. . . lower bound, effective for the online bin-packing algorithms without the movement of elements. Moreover, our algorithms are "more online" than any other linear space online bin-packing algorithm because, unlike the algorithms already known, they allow the return of a (possibly relevant) fraction of bins before the work is carried out.
Importance sampling with hemispherical particle footprints
Authors: Heinrich Hey, Werner Purgathofer
Venue: Proceedings of the 18th spring conference on Computer graphics (2002)

We present a new importance sampling technique for stochastic ray-based global illumination methods. It allows to enhance the efficiency of global illumination calculations in general scenes with complex illumination settings by selecting preferably those sampling or shooting directions which yield a high contribution. The probability density functions for this are generated with a photon map or importance map that represents the expected contribution. An outgoing direction for a given point in the scene is selected by making directional footprints of the nearest neighbor particles onto the hemisphere above the point. By selecting the radii of the footprints adaptively according to the directional density of the particles, rays can be shot precisely into highly contributing regions where several particles come from a small solid angle. We compare our new technique with existing importance sampling techniques in photon map global illumination simulation, and show that our new technique achieves a considerably lower level of noise in the same computation time.
Database Management Systems, 2nd edition
Authors: Raghu Ramakrishnan, Johannes Gehrke
Venue:  (1999)

:Database Management Systems (DBMS) is a must for any course in database systems or file organization. DBMS provides a hands-on approach to relational database systems, with an emphasis on practical topics such as indexing methods, SQL, and database design. New to this edition are the early coverage of the ER model, new chapters on Internet databases, data mining, and spatial databases, and a new supplement on practical SQL assignments (with solutions for instructors' use). Many other chapters have been reorganized or expanded to provide up-to-date coverage.
Professional PHP Programming
Authors: Chris Scollo, Sascha Shumann
Venue:  (1999)

From the Book:Over the past few years, the Internet has gone from the preserve of academics to the cutting edge of business. A large part of this has been driven by the growth of the Web, with its graphical browsers and high media profile. The change from static HTML pages to dynamic, user interactive presentations has been achieved largely through the introduction of scripting technologies.Working with the usual markup language of a web page, scripting languages enable clients to demand specific information from their servers, and their servers, in turn, to receive important user input in order to process and display data on demand.In the forefront of this advancement has been the open source community, dedicated to providing web-based solutions purely for the love of the technology itself. Open source is not only about free software (though not everything is free anyway), but it is about, as the name suggests, being open about the source of the code.Having free access to the source means that authors are forced to keep to standards. If these are not maintained, the deviation is labeled a bug, and if the author doesn't fix it, someone else will. Large numbers of independent programmers being able to understand what a program does, and ensuring that standards are maintained, prevents the author from being able to exploit the user, as happens in the commercial software world.
Teach Yourself to Create a Home Page in 24 Hours, 1st edition
Authors: Ned Snell, Rogers Cadenhead
Venue:  (1998)

:In just 24 sessions of one hour or less, you will pick up all the skills you need to easily create great-looking Web pages. Using a straightforward, step-by-step approach, each lesson builds upon the previous one, allowing you to quickly learn the essentials of Web authoring from the ground up.
General perfectly periodic scheduling
Authors: Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir
Venue: Proceedings of the twenty-first annual symposium on Principles of distributed computing (2002)

In a perfectly-periodic schedule, time is divided into time-slots, and each client is scheduled precisely every some predefined number of slots, called the period of that client. Periodic schedules are useful in wireless communication and other settings. The quality of a schedule is measured by the proportion between the requested and the granted periods: either the maximum over all jobs, or the average. There exist good scheduling algorithms for the average measure in the unit-length single-server model in which all jobs are one slot long, and at most one job is served in each time unit. In this paper we study the general model, where each job may have a different length, and m jobs can be served in parallel for some given m. We give a lower bound for this model which demonstrates the inherent difficulty of multiple lengths, and present a sequence of algorithms, culminating in an algorithm for the general case which is asymptotically optimal under the maximum ratio measure (and hence also the average ratio measure). The new algorithms utilize new techniques which are rather different from the known algorithms used for the unit-length model. Some of the algorithms improve on the best known bounds for the unit-length model.
America Online Amazing Secrets
Authors: Laura Arendal
Venue:  (1998)

:With more than 9 million users and still growing strong, America Online is the single most popular online service and Internet access provider in the world. Its ease of use makes it virtually idiot-proof. Who needs a low-level guide to navigating AOL? That's why Sybex has introduced a new title that concentrates on little known features and services of AOL. Readers will learn the secrets of instant messaging, how to avoid spams, playing games, archiving, performing searches, publishing on the Web, and much more. This unique guide enhances any AOL user's mobility and versatility.
Supporting cross-cultural communication with a large-screen system
Authors: Masayuki Okamoto, Katherine Isbister, Hideyuki Nakanishi, Toru Ishida
Venue: New Generation Computing (2002)

As opportunities for international collaboration and cross-cultural communication among people from heterogeneous cultures increase, the importance of electronic communication support is increasing. To support cross-cultural communication, we believe it is necessary to offer environments in which participants enjoy conversations, which allow them to share one another's background and profile visually.We believe that the following three functions are important: (1) showing topics based on participants' profiles and cultural background; (2) life-sized, large-screen interface; and, (3) displaying objects which show feelings of identify. In this paper, we discuss the implementation and the empirical evaluation of two systems that were designed to support cross-cultural communication in the real world or between remote locations.From the empirical evaluation of these systems, we conclude that these systems add new functionality to support conversation contents, which may be especially useful in a cross-cultural context where language skills are an issue, and this type of environment may be especially useful in a pre-collaboration context.
What Does It Mean To Be Local?
Authors: Kate Ehrlich
Venue: ACM SIGCHI Bulletin (1995)

If you have browsed the back cover of this Bulletin recently you might have noticed the slow but steady growth in local SIGCHI groups. There are now 25 local SIGs in various stages of formation. Three of them are in Europe and four of them are in Canada. Given the number, diversity and geographical spread of these groups it seems a good time to reflect on what it means to be a local group. By way of emphasizing the international flavor of local groups, the featured SIG in this issue is CHISIG (Australia). Although still in the process of determining whether to join CHI, CHISIG is representative of many of the issues facing local groups - distance from other groups and from a central organization, importance of retaining a local culture yet remaining part of an international group, attracting and keeping members.Physical distance is no longer a serious barrier to communication or collaboration. One of the technologies helping to bring groups together is the World Wide Web. In the "News and Views" section you will see that some local SIGs have begun publishing their own World Wide Web home pages. The addresses of these home pages will henceforth be included with the other contact information on the inside back cover.
The missing link: augmenting biology laboratory notebooks
Authors: Wendy E. Mackay, Guillaume Pothier, Catherine Letondal, Kaare Bøegh, Hans Erik Sørensen
Venue: Proceedings of the 15th annual ACM symposium on User interface software and technology (2002)

Using a participatory design process, we created three prototype augmented laboratory notebooks that provide the missing link between paper, physical artifacts and on-line data. The final a-book combines a graphics tablet and a PDA. The tablet captures writing on the paper notebook and the PDA acts as an "interaction lens" or window between physical and electronic documents. Our approach is document-centered, with a software architecture based on layers of physical and electronic information.
A hierarchical tag-graph search scheme with layered grammar rules for spontaneous speech understanding
Authors: Bor-shen Lin, Berlin Chen, Hsin-min Wang, Lin-shan Lee
Venue: Pattern Recognition Letters (2002)

It has always been difficult for language understanding systems to handle spontaneous speech with satisfactory robustness, primarily due to such problems as the fragments, disfluencies, out-of-vocabulary words, and ill-formed sentence structures. Also, the search schemes used are usually not flexible enough in accepting different input linguistic units, and great efforts are therefore required when they are used with different acoustic front ends in different tasks, specially in multi-modal and multi-lingual systems. In this paper, a new hierarchical tag-graph-based search scheme for spontaneous speech understanding is proposed. This scheme is based on a layered hierarchy of grammar rules, and therefore can integrate all the statistical and rule-based knowledge including acoustic scores, language model scores and grammar rules into the search process. More robust speech understanding is thus achievable. In addition, this scheme can accept graphs of different linguistic units such as phonemes, syllables, characters, words, spotted keywords, or phrases as the input, thus compatible to different acoustic front ends and multi-modal and multi-lingual applications can be easily developed. This search scheme has been successfully applied to a multi-domain, multi-modal dialogue system.
Authenticating public access networking
Authors: Joseph W. Graham,  II
Venue: Proceedings of the 30th annual ACM SIGUCCS conference on User services (2002)

The University of Pittsburgh began offering network connections to residence hall students in 1998. Initially, students were assigned static IP addresses and manual processes were implemented to record the each computer's network card MAC address. This quickly became unwieldy as service was expanded to all of the nearly 6,000 residence hall rooms. In 2000, DHCP was used to provide student IP addresses in conjunction with registration software to record the necessary machine information. Tracing activity in response to security issues was still time-consuming because of the time needed to research activity logs.The adaptation of the Point-to-Point Protocol (PPP) for broadband use by commercial Internet Services Providers (ISP's) provided a much simpler solution for registering users, and providing IP addresses. Direct user authentication to the network is accomplished by requiring the entry of a username and password each time the user establishes a connection. Tracing specific activity is simplified because it is not necessary to research different sets of logs to determine the IP address and username. Management of the system is entirely dynamic. The system can be used just as easily for ports located in public areas, classrooms, and in conjunction with wireless network services. The need for authenticated access to the network from these locations is even more important than from the residence halls.Although PPPoE has been used for authenticated access in the residence halls during the past academic year, this service will be converted to the IEEE 802.1x standard, which eliminates the requirement for client authentication software in the coming year. Our experience with PPPoE is that support requirements are very low and are primarily limited to client software installation assistance. Further reduction of support requirements is expected with the introduction of 802.1x authentication for residence hall, public access, classroom, and wireless network connections.
Recognition, Resolution, and Complexity of Objects Subject to Affine Transformations
Authors: Margrit Betke, Nicholas C. Makris
Venue: International Journal of Computer Vision (2001)

The problem of recognizing objects subject to affine transformation in images is examined from a physical perspective using the theory of statistical estimation. Focusing first on objects that occlude zero-mean scenes with additive noise, we derive the Cramer-Rao lower bound on the mean-square error in an estimate of the six-dimensional parameter vector that describes an object subject to affine transformation and so generalize the bound on one-dimensional position error previously obtained in radar and sonar pattern recognition. We then derive two useful descriptors from the object's Fisher information that are independent of noise level. The first is a generalized coherence scale that has great practical value because it corresponds to the width of the object's autocorrelation peak under affine transformation and so provides a physical measure of the extent to which an object can be resolved under affine parameterization. The second is a scalar measure of an object's complexity that is invariant under affine transformation and can be used to quantitatively describe the ambiguity level of a general 6-dimensional affine recognition problem. This measure of complexity has a strong inverse relationship to the level of recognition ambiguity. We then develop a method for recognizing objects subject to affine transformation imaged in thousands of complex real-world scenes. Our method exploits the resolution gain made available by the brightness contrast between the object perimeter and the scene it partially occludes. The level of recognition ambiguity is shown to decrease exponentially with increasing object and scene complexity. Ambiguity is then avoided by conditioning the permissible range of template complexity above a priori thresholds. Our method is statistically optimal for recognizing objects that occlude scenes with zero-mean background.
The Online Journalist, 3rd edition
Authors: Randy Reddick, Elliot King
Venue:  (2000)

:Since the first edition of THE ONLINE JOURNALIST appeared in 1995, the Internet and other computer-based communication networks have established themselves as dynamic, widespread, accessible channels of communication. THE ONLINE JOURNALIST explores and demonstrates how reporters can use the Internet and other online resources more efficiently and effectively. Reddick and King also discuss how this technology impacts journalism, the pitfalls reporters and editors should avoid, and the legal and ethical issues raised by online journalism. Equally useful for working journalists and journalism students, THE ONLINE JOURNALIST provides clear and practical advice for gathering accurate, timely information.
Intelligent User Interfaces
Authors: Joseph W. Sullivan
Venue:  (1991)

:This volume focuses on the enhancement of computer-human interfaces with AI technology. Its aim is to develop intelligent interfaces that can understand the intentions of the user, communicate, advise, and adapt as necessary. Intelligent User Interfaces discusses specific architectures for such interfaces.
Symmetry in class and type hierarchy
Authors: Liping Zhao, James O. Coplien
Venue: Proceedings of the Fortieth International Conference on Tools Pacific: Objects for internet, mobile and embedded applications (2002)

The class concept is central in OO programming (OOP) to implement abstract data types and enforce encapsulation. Type hierarchy has been regarded as a useful technique for consistency during extension. Yet, the importance of class and type hierarchy extends beyond their technical merits. Specifically, a class classifies objects and a type hierarchy classifies classes. Classification is fundamental to design, and its place in program evolution and programming language structure can be elucidated through formal symmetry models. Symmetry is the interplay between an invariant and the possibility of change. This paper discusses the importance of classification in OOP and shows the connection between classification and symmetry in class and type hierarchies.
Lagrangian Dual Interior-Point Methods for Semidefinite Programs
Authors: Mituhiro Fukuda, Masakazu Kojima, Masayuki Shida
Venue: SIAM Journal on Optimization (2002)

This paper proposes a new predictor-corrector interior-point method for a class of semidefinite programs, which numerically traces the central trajectory in a space of Lagrange multipliers. The distinguishing features of the method are full use of the BFGS quasi-Newton method in the corrector procedure and an application of the conjugate gradient method with an effective preconditioning matrix induced from the BFGS quasi-Newton method in the predictor procedure. Some preliminary numerical results are reported.
Extend: the extend simulation environment
Authors: David Krahl
Venue: Proceedings of the 33nd conference on Winter simulation (2001)

The Extend simulation environment provides an integrated structure for building simulation models and developing new simulation tools. This environment supports simulation modelers on a wide range of levels. Model builders can use Extend's pre-built modeling components to quickly build and analyze systems without programming. Simulation tool developers can use Extend's built-in, compiled language, ModL, to develop new reusable modeling components. All of this is done within a single, self-contained software program that does not require external interfaces, compilers, or code generators.
A new solid subdivision scheme based on box splines
Authors: Yu-Sung Chang, Kevin T. McDonnell, Hong Qin
Venue: Proceedings of the seventh ACM symposium on Solid modeling and applications (2002)

During the past twenty years, much research has been undertaken to study surface representations based on B-splines and box splines. In contrast, volumetric splines have received much less attention as an effective and powerful solid modeling tool. In this paper, we propose a novel solid subdivision scheme based on tri-variate box splines over tetrahedral tessellations in 3D. A new data structure is devised to facilitate the straightforward implementation of our simple, yet powerful solid subdivision scheme. The subdivision hierarchy can be easily constructed by calculating new vertex, edge, and cell points at each level as affine combinations of neighboring control points at the previous level. The masks for our new solid subdivision approach are uniquely obtained from tri-variate box splines, thereby ensuring high-order continuity. Because of rapid convergence rate, we acquire a high fidelity model after only a few levels of subdivision. Through the use of special rules over boundary cells, the B-rep of our subdivision solid reduces to a subdivision surface. To further demonstrate the modeling potential of our subdivision solid, we conduct several solid modeling experiments including free-form deformation. We hope to demonstrate that our box-spline subdivision solid (based on tetrahedral geometry) advances the current state-of-the-art in solid modeling in the following aspects: (1) unifying CSG, B-rep, and cell decomposition within a popular subdivision framework; (2) overcoming the shortfalls of tensor-product spline models; (3) generalizing both subdivision surfaces and free-form spline surfaces to a solid representation of arbitrary topology; and (4) taking advantage of triangle-driven, accelerated graphics hardware.