ppxscal/embedding_network huggingface dataset:
On mutli-resolution document transmission in mobile Web
Authors: Stanley M. T. Yau, Hong Va Leong, Dennis McLeod, Antonio Si
Venue: ACM SIGMOD Record (1999)

We propose a multi-resolution transmission mechanism that allows various organizational units of a web document to be transferred and browsed according to the amount of information captured. We define the notion of information content for each individual organizational unit of a web document as an indication of its captured information. The concept of information content is used as a foundation for defining the notion of relative information content which determines the transmission order of various units. Our mechanism allows a web client to explore the more content-bearing portion of a web document earlier so as to be able to terminate browsing a possibly irrelevant document sooner. This scheme is based on our observation that different organizational units of a document contribute to different amount of information to the document. Such a multi-resolution transmission paradigm is particularly useful in mobile web where the wireless bandwidth is a scarce resource and browsing every document in detail would consume the bandwidth unnecessarily. This is becoming more serious when the size of a web document is getting large, such as technical documents. We then present a prototype of the system in Java and CORBA to illustrate its feasibility.
Internet-based groupware for user participation in product development
Authors: Monica Divitini, Babak A. Farshchian, Tuomo Tuikka
Venue: ACM SIGCHI Bulletin (2000)

The workshop on Internet-based Groupware for User Participation in Product Development (IGROUP) was held on November 14, 1998, in conjunction with the conferences CSCW 98 and PDC 98 in Seattle, WA, USA. The workshop gathered 16 participants from both academia and industry. The topic discussed was how we can use groupware technology to involve end-users in the development of software and non-software products.The context for product development has traditionally been separated from the users' work context (Grudin 1991). In a product development process the user group is often unknown. Products are often purchased off-the-shelf, and the developers can in most cases only guess which user community and what types of users will be using their products. The only source of user feedback in these situations is from laboratory experiments with "typical users," and in some occasions from product resellers. The result is often sub-optimal solutions.In the recent years this picture has changed drastically. Technical innovations, in particular the Internet, have made it possible to bring closer together product developers and end-users. In its beginning, the developers started using a "feedback button" as a menu choice in their programs. Pushing this button would let the user compose a "complaint" message and send it to the developer. Lately, more advanced methods have emerged, trying to construct mixed communities of end-users and developers, where one of the aims is to deliver products users really want.In this workshop, we took a look at how groupware is or could be used to facilitate collaboration between users and developers in order to increase the quality of the product. Ten position papers discussed different aspects of user involvement using groupware technology. In this report we will first give a summary of the position papers and then discuss the areas that we saw as important for further investigation.
Solving Generalized Least-Squares Problems with LSQR
Authors: Steven J. Benbow
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

An iterative method for solving augmented linear systems in a generalized least-squares sense is given. The method, LSQR(A-1), is shown to be a natural extension of the LSQR algorithm of Paige and Saunders [ACM Trans. Math. Software, 8 (1982), pp. 43--71], with generalized orthogonality properties so that the Cholesky factor of A is not required. Instead it is only assumed that some method of calculating the effect of (A-1) on a vector is available. Numerical experiments comparing LSQR(A-1)with similar preconditioned Krylov methods are described which demonstrate that the new method exhibits superior numerical properties when the Schur complement BTA-1B is ill conditioned.
Value of Information in Capacitated Supply Chains
Authors: Srinagesh Gavirneni, Roman Kapuscinski, Sridhar Tayur
Venue: Management Science (1999)

We incorporate information flow between a supplier and a retailer in a two-echelon model that captures the capacitated setting of a typical supply chain. We consider three situations: (1) a traditional model where there is no information to the supplier prior to a demand to him except for past data; (2) the supplier knows the (s, S) policy used by the retailer as well as the end-item demand distribution; and (3) the supplier has full information about the state of the retailer. Order up-to policies continue to be optimal for models with information flow for the finite horizon, the infinite horizon discounted and the infinite horizon average cost cases. Study of these three models enables us to understand the relationships between capacity, inventory, and information at the supplier level, as well as how they are affected by the retailer's (S - s) values and end-item demand distribution. We estimate the savings at the supplier due to information flow and study when information is most beneficial.
Medical Data Mining on the Internet: Research on a Cancer Information System
Authors: Andrea L. Houston, Hsinchun Chen, Susan M. Hubbard, Bruce R. Schatz, Tobun D. Ng, Robin R. Sewell, Kristin M. Tolle
Venue: Artificial Intelligence Review (1999)

This paper discusses several data mining algorithms and techniques that we have developed at the University of Arizona Artificial Intelligence Lab. We have implemented these algorithms and techniques into several prototypes, one of which focuses on medical information developed in cooperation with the National Cancer Institute (NCI) and the University of Illinois at Urbana-Champaign. We propose an architecture for medical knowledge information systems that will permit data mining across several medical information sources and discuss a suite of data mining tools that we are developing to assist NCI in improving public access to and use of their existing vast cancer information collections.
Software for use: a practical guide to the models and methods of usage-centered design
Authors: Larry L. Constantine, Lucy A. D. Lockwood
Venue:  (1999)

In the quest for quality, software developers have long focused on improving the internal architecture of their products. Larry L. Constantine--who originally created structured design to effect such improvement--now joins with well-known consultant Lucy A. D. Lockwood to turn the focus of software development to the external architecture. In this book, they present the models and methods of a revolutionary approach to software that will help programmers deliver more usable software--software that will enable users to accomplish their tasks with greater ease and efficiency.Recognizing usability as the key to successful software, Constantine and Lockwood provide concrete tools and techniques that programmers can employ to meet that end. Much more than just another set of rules for good user-interface design, this book guides readers through a systematic software development process. This process, called usage-centered design, weaves together two major threads in software development methods: use cases (also used with UML) and essential modeling. With numerous examples and case studies of both conventional and specialized software applications, the authors illustrate what has been shown in practice to work and what has proved to be of greatest practical value.Highlights Presents a streamlined process for developing highly usable software Describes practical methods and models successfully implemented in industry Complements modern development practices, including the Unified Process and other object-oriented software engineering approaches
Computational geometry column 36
Authors: Joseph O'Rourke
Venue: ACM SIGACT News (1999)

Two results in "computational origami" are illustrated.
Quantifying the energy consumption of a pocket computer and a Java virtual machine
Authors: Keith I. Farkas, Jason Flinn, Godmar Back, Dirk Grunwald, Jennifer M. Anderson
Venue: ACM SIGMETRICS Performance Evaluation Review (2000)

In this paper, we examine the energy consumption of a state-of-the-art pocket computer. Using a data acquisition system, we measure the energy consumption of the Itsy Pocket Computer, developed by Compaq Computer Corporation's Palo Alto Research Labs. We begin by showing that the energy usage characteristics of the Itsy differ markedly from that of a notebook computer. Then, since we expect that flexible software environments will become increasingly prevalent on pocket computers, we consider applications running in a Java environment. In particular, we explain some of the Java design tradeoffs applicable to pocket computers, and quantify their energy costs. For the design options we considered and the three workloads we studied, we find a maximum change in energy use of 25%.
Control Flow Prediction Schemes for Wide-Issue Superscalar Processors
Authors: Simonjit Dutta, Manoj Franklin
Venue: IEEE Transactions on Parallel and Distributed Systems (1999)

In order to achieve high performance, wide-issue superscalar processors have to fetch a large number of instructions per cycle. Conditional branches are the primary impediment to increasing the fetch bandwidth because they can potentially alter the flow of control and are very frequent. To overcome this problem, these processors need to predict the outcome of multiple branches in a cycle. This paper investigates two control flow prediction schemes that predict the effective outcome of multiple branches with the help of a single prediction. Instead of considering branches as the basic units of prediction, these schemes consider subgraphs of the control flow graph of the executed program as the basic units of prediction and predict the target of an entire subgraph at a time, thereby allowing the superscalar fetch mechanism to go past multiple branches in a cycle. The first control flow prediction scheme investigated considers sequential block-like subgraphs and the second scheme considers tree-like subgraphs to make the control flow predictions. Both schemes do a 1-out-of-4 prediction as opposed to the 1-out-of-2 prediction done by branch-level prediction schemes. These two schemes are evaluated using a MIPS ISA-based 12-way superscalar microarchitecture. An improvement in effective fetch size of approximately 25 percent and 50 percent, respectively, is observed over identical microprocessors that use branch-level prediction. No appreciable difference in the prediction accuracy was observed, although the control flow prediction schemes predicted 1-out-of-4 outcomes.
Assessment of cancellous bone mechanical properties from micro-FE models based on micro-CT, pQCT and MR images
Authors: B. van Rietbergen, S. Majumdar, W. Pistoia, D. C. Newitt, M. Kothari, A. Laib, P. Rüegsegger
Venue: Technology and Health Care (1998)

Recently, new micro-finite element (micro-FE) techniques have been introduced to calculate cancellous bone mechanical properties directly from high-resolution images of its internal architecture. Also recently, new peripheral quantitative computed tomography (pQCT) and magnetic resonance (MR) imaging techniques have been developed that can create images of whole bones in vivo with enough detail to visualize the internal cancellous bone architecture. In this study we aim to investigate if the calculation of cancellous bone mechanical properties from micro-FE models based on such new pQCT and MR images is feasible. Three bone specimens were imaged with the pQCT scanning system and the MR-imaging system. The specimens were scanned a second time using a micro-CT scanner with a much higher resolution. Digitized reconstructions were made based on each set of images and converted to micro-FE models from which the bone elastic properties were calculated. It was found that the results of both the pQCT and the MR-based FE-models compared well to those of the more accurate micro-CT based models in a qualitative sense, but correction factors will be needed to get accurate values.
The middleware muddle
Authors: David Ritter
Venue: ACM SIGMOD Record (1998)

A new menagerie of middleware is emerging. These products promise great flexibility in partitioning enterprise applications across the diverse corporate computing landscape. What factors should you consider when choosing a solution, and how do current products stack up? More important to the focus of this article, what role should Web servers play?
A scalable mobile host protocol for the internet
Authors: Anna Hać, Lei Guo
Venue: International Journal of Network Management (2000)

This paper describes a new Mobile IP protocol supporting wide area network. This protocol named Scalable Mobile IP &lpar;SMIP&rpar; allows any mobile host to move inside a large-scale area while being transparently connected to the Internet using its permanent IP address. Copyright &copy; 2000 John Wiley Sons, Ltd.
RLC interconnect delay estimation via moments of amplitude and phase response
Authors: Xiaodong Yang, Walter H. Ku, Chung-Kuan Cheng
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

A new category of moments&mdash;Amplitude and Phase moments (AP moments) are introduced for RLC interconnect delay estimation. We show that there are tight relationships between AP moments, circuit moments and central moments. The first order AP moment represents the Elmore delay while the higher order AP moments can be used to represent the error between the Elmore delay and the exact 50% delay from the view of gain and phase-shift variation. With the help of the physical meaning revealed by the AP moments, a closed-form 50% delay model&mdash;AP delay model is proposed for RLC interconnect delay estimation in terms of the first four AP moments. We also propose a new two-pole model (AP two-pole model) by matching the first two phase moments of the transfer function. The AP two-pole model can be used for more generally timing parameters estimation. The input signal's impact on delay estimation can be incorporated into these two delay models by simply combining the input signal's AP moments with the transfer function's AP moments. In our experiments these two models show significant accuracy improvement over the Elmore delay model.
Least Upper Bounds for the Size of OBDDs Using Symmetry Properties
Authors: Laura Heinrich-Litan, Paul Molitor
Venue: IEEE Transactions on Computers (2000)

This paper investigates reduced ordered binary decision diagrams (OBDD) of partially symmetric Boolean functions when using variable orders where symmetric variables are adjacent. We prove upper bounds for the size of such symmetry ordered OBDDs (SymOBDD). They generalize the upper bounds for the size of OBDDs of totally symmetric Boolean functions and nonsymmetric Boolean functions proven by Heap and Mercer [14], [15] and Wegener [37]. Experimental results based on these upper bounds show that the nontrivial symmetry sets of a Boolean function should be located either right up at the beginning or right up at the end of the variable order in order to obtain best upper bounds.
Technology as a catalyst for acquisitions? Year 2000 preparedness for the astute executive
Authors: Nav J. Gulati
Venue: International Journal of Network Management (1998)

&bull; How will Year 2000 technology problems create acquisitions opportunities? &bull; If we are heading towards deflationary times, will the Year 2000 problem further exacerbate the cycle? &bull; What are the technology action items today, so we can be prepared to buy our competitors if the regulators shut them down? &bull; If, due to the Millennium Bug, our targets fail as going concerns, what does it take to plug them into our technology environment? &copy; 1998 John Wiley & Sons, Ltd.
Cryptographic Verification of Test Coverage Claims
Authors: Premkumar Thomas Devanbu, Stuart G. Stubblebine
Venue: IEEE Transactions on Software Engineering (2000)

The market for software components is growing, driven on the ¿demand side¿ by the need for rapid deployment of highly functional products and, on the ¿supply side,¿ by distributed object standards. As components and component vendors proliferate, there is naturally a growing concern about quality and the effectiveness of testing processes. White-box testing, particularly the use of coverage criteria, is a widely used method for measuring the ¿thoroughness¿ of testing efforts. High levels of test coverage are used as indicators of good quality control procedures. Software vendors who can demonstrate high levels of test coverage have a credible claim to high quality. However, verifying such claims involves knowledge of the source code, test cases, build procedures, etc. In applications where reliability and quality are critical, it would be desirable to verify test coverage claims without forcing vendors to give up valuable technical secrets. In this paper, we explore cryptographic techniques that can be used to verify such claims. Our techniques have certain limitations, which we discuss in this paper. However, vendors who have done the hard work of developing high levels of test coverage can use these techniques (for a modest additional cost) to provide credible evidence of high coverage, while simultaneously reducing disclosure of intellectual property.
Efficient Asymptotic-Preserving (AP) Schemes For Some Multiscale Kinetic Equations
Authors: Shi Jin
Venue: SIAM Journal on Scientific Computing (1999)

Many kinetic models of the Boltzmann equation have a diffusive scaling that leads to the Navier--Stokes type parabolic equations as the small scaling parameter approaches zero. In practical applications, it is desirable to develop a class of numerical schemes that can work uniformly with respect to this relaxation parameter, from the rarefied kinetic regimes to the hydrodynamic diffusive regimes. An earlier approach in [S. Jin, L. Pareschi, and G. Toscani, SIAM J. Numer. Anal., 35 (1998), pp. 2405--2439] reformulates such systems into the common hyperbolic relaxation system by Jin and Xin for hyperbolic conservation laws used to construct the relaxation schemes and then uses a multistep time-splitting method to solve the relaxation system. Here we observe that the combination of the two time-split steps may yield hyperbolic-parabolic systems that are more advantageous, in both stability and efficiency, for numerical computations. We show that such an approach yields a class of asymptotic-preserving (AP) schemes which are suitable for the computation of multiscale kinetic problems. We use the Goldstein--Taylor and Carleman models to illustrate this approach.
httperf&mdash;a tool for measuring web server performance
Authors: David Mosberger, Tai Jin
Venue: ACM SIGMETRICS Performance Evaluation Review (1998)

This paper describes httperf, a tool for measuring web server performance. It provides a flexible facility for generating various HTTP workloads and for measuring server performance. The focus of httperf is not on implementing one particular benchmark but on providing a robust, high-performance tool that facilitates the construction of both micro- and macro-level benchmarks. The three distinguishing characteristics of httperf are its robustness, which includes the ability to generate and sustain server overload, support for the HTTP/1.1 protocol, and its extensibility to new workload generators and performance measurements. In addition to reporting on the design and implementation of httperf this paper also discusses some of the experiences and insights gained while realizing this tool.
BILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices
Authors: Yousef Saad, Jun Zhang
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

This paper describes a domain-based multilevel block ILU preconditioner (BILUTM) for solving general sparse linear systems. This preconditioner combines a high accuracy incomplete LU factorization with an algebraic multilevel recursive reduction. Thus, in the first level the matrix is permuted into a block form using (block) independent set ordering and an ILUT factorization for the reordered matrix is performed. The reduced system is the approximate Schur complement associated with the partitioning, and it is obtained implicitly as a by-product of the partial ILUT factorization with respect to the complement of the independent set. The incomplete factorization process is repeated with the reduced systems recursively. The last reduced system is factored approximately using ILUT again. The successive reduced systems are not stored. This implementation is efficient in controlling the fill-in elements during the multilevel block ILU factorization, especially when large size blocks are used in domain decomposition-type implementations. Numerical experiments are used to show the robustness and efficiency of the proposed technique for solving some difficult problems.
Protein structure determination using protein threading and sparse NMR data (extended abstract)
Authors: Ying Xu, Dong Xu Oakley H. Crawford, J. Ralph Einstein, Engin Serpersu
Venue: Proceedings of the fourth annual international conference on Computational molecular biology (2000)

It is well known that the NMR method for protein structure determination applies to small proteins and that its effectiveness decreases very rapidly as the molecular weight increases beyond about 30 kD. We have recently developed a method for protein structure determination that can fully utilize partial NMR data as calculation constraints. The core of the method is a threading algorithm that guarantees to find a globally optimal alignment between a query sequence and a template structure, under distance constraints specified by NMR/NOE data. Our preliminary tests have demonstrated that a small number of NMR/NOE distance restraints can significantly improve threading performance in both fold recognition and threading-alignment accuracy, and can possibly extend threading's scope of applicability from structural homologs to structural analogs. An accurate backbone structure generated by NMR-constrained threading can then provide a significant amount of structural information, equivalent to that provided by the NMR method with many NMR/NOE restraints; and hence can greatly reduce the amount of NMR data typically required for accurate structure determination. Our prelimenary study suggest that a small number of NOE restraints may suffice to determine adequately the all-atom structure when those restraints are incorporated in a procedure combining threading, modeling of loops and sidechains, and molecular dynamics simulation. Potentially, this new technique can expand NMR's capability to larger proteins.