ppxscal/embedding_network huggingface dataset:
Stabilizing the Hierarchical Basis by Approximate Wavelets II: Implementation and Numerical Results
Authors: Panayot S. Vassilevski, Junping Wang
Venue: SIAM Journal on Scientific Computing (1998)

This paper is the second part of a work on stabilizing the classical hierarchical basis HB by using wavelet-like basis functions. Implementation techniques are of major concern for the multilevel preconditioners proposed by the authors in the first part of the work, which deals with algorithms and their mathematical theory. Numerical results are presented to confirm the theory established there. A comparison of the performance of a number of multilevel methods is conducted for elliptic problems of three space variables.
Off-Chip Diagnosis of Aperture Jitter in Full-Flash Analog-to-Digital Converters
Authors: Richard Rosing, Hans Kerkhoff, Ronald Tangelder, Manoj Sachdev
Venue: Journal of Electronic Testing: Theory and Applications (1999)

Gaussian aperture jitter leads to a reduction in the Signal-to-Noise-Ratio of A/D converters. Other noise sources, faults and nonlinearities also effect the digital output signal. A new off-chip diagnosis method, which systematically separates the jitter-induced errors from the errors caused by these other factors, is described. Deterministic errors are removed via a subtraction technique. High-level ADC simulations have been carried out to determine relations between the size of the jitter or decision-level noise and the remaining random errors. By carrying out two tests at two different input frequencies and using the simulation results, errors induced by decision-level noise can be removed.
Modeling personnel and roles for electronic commerce retail
Authors: Simon Fong, Chan Se-Leng
Venue: Proceedings of the 2000 ACM SIGCPR conference on Computer personnel research (2000)

Most of the electronic commerce businesses have to address the same issues such as the four core business activities namely Attract, Interact, Act and React. The success of an E-Commerce business hinges on how competent the personnel who operate the four activities are. In this paper, we identify the job functions of the personnel for a typical Internet retail. In particular, we present an object-oriented model of the personnel specialized for Internet-based retail business. The model is designed according to the four core business activities. The personnel are designed to support the fundamental functions that make a successful E-Commerce business. Our model can serve as a high-level infrastructure planning or ERP for Internet retail, and it can be modified to suit other E-commerce domains such as Business-to-Business commerce.
Simultaneous subordinate microthreading (SSMT)
Authors: Robert S. Chappell, Jared Stark, Sangwook P. Kim, Steven K. Reinhardt, Yale N. Patt
Venue: Proceedings of the 26th annual international symposium on Computer architecture (1999)

Current work in Simultaneous Multithreading provides little benefit to programs that aren't partitioned into threads. We propose Simultaneous Subordinate Microthreading (SSMT) to correct this by spawning subordinate threads that perform optimizations on behalf of the single primary thread. These threads, written in microcode, are issued and executed concurrently with the primary thread. They directly manipulate the microarchitecture to improve the primary thread's branch prediction accuracy, cache hit rate, and prefetch effectiveness. All contribute to the performance of the primary thread. This paper introduces SSMT and discusses its potential to increase performance. We illustrate its usefulness with an SSMT machine that executes subordinate microthreads to improve the branch prediction of the primary thread. We show simulation results for the SPECint95 benchmarks.
How to roll a join: asynchronous incremental view maintenance
Authors: Kenneth Salem, Kevin Beyer, Bruce Lindsay, Roberta Cochrane
Venue: ACM SIGMOD Record (2000)

Incremental refresh of a materialized join view is often less expensive than a full, non-incremental refresh. However, it is still a potentially costly atomic operation. This paper presents an algorithm that performs incremental view maintenance as a series of small, asynchronous steps. The size of each step can be controlled to limit contention between the refresh process and concurrent operations that access the materialized view or the underlying relations. The algorithm supports point-in-time refresh, which allows a materialized view to be refreshed to any time between the last refresh and the present.
The streamlined cognitive walkthrough method, working around social constraints encountered in a software development company
Authors: Rick Spencer
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

The cognitive walkthrough method described by Wharton et al. may be difficult to apply in a large software development company because of social constraints that exist in such companies. Managers, developers, and other team members are pressured for time, tend to lapse into lengthy design discussions, and are sometimes defensive about their user-interface designs. By enforcing four ground rules, explicitly defusing defensiveness, and streamlining the cognitive walkthrough method and data collection procedures, these social constraints can be overcome, and useful, valid data can be obtained. This paper describes a modified cognitive walkthrough process that accomplishes these goals, and has been applied in a large software development company.
A construction approach for software agents using components
Authors: Liu Hong, Lin Zongkai, Zeng Guangzhou
Venue: ACM SIGSOFT Software Engineering Notes (1999)

This paper presents a construction approach for software agents. A software agent is regarded as a main frame plus some components, and it is constructed by selecting suitable main frame and software components, assembling and running through the control mechanism on the main frame. The multi-agent system is organised on the Client/Server model. The developed system based on this method profits from software reuse in the distributed environment.
Generalized "Big-Match"
Authors: Stephen A. Strauss, Stephen C. Graves, J. M. Coulomb
Venue: Mathematics of Operations Research (1999)

We define a specific class of zero-sum stochastic games with signals which are a generalization of the "Big-Match" game of Blackwell and Ferguson. We show the existence of the max min.
A logarithmic lower bound for time-spread multiple-access (TSMA) protocols
Authors: Stefano Basagni, Danilo Bruschi
Venue: Wireless Networks (2000)

Time&dash;Spread Multiple&dash;Access &lpar;TSMA&rpar; protocols are scheduled access protocols for mobile multi&dash;hop radio networks that guarantee deterministic access to the shared channel regardless of the possibility of radio interference. In scheduled access methods, time is considered to be slotted and time slots are cyclically organized into frames. In general, the shorter the frame, the more efficient the protocol. An &OHgr;(loglog n) lower bound is known on the minimum length of the frame of TSMA protocols in networks with n nodes. In this note we improve that lower bound by characterizing the multiple access to the radio channel as a combinatorial problem. The proposed characterization allows us to prove that no TSMA protocols can successfully schedule the transmissions of the nodes of a multi&dash;hop radio network in frames with less than log n time slots.
Applications of micro-CT and MR microscopy to study pre-clinical models of osteoporosis and osteoarthritis
Authors: Rasesh D. Kapadia, George B. Stroup, Alison M. Badger, Bruno Koller, Joshua M. Levin, Robert W. Coatney, Robert A. Dodds, Xiaguong Liang, Michael W. Lark, Maxine Gowen
Venue: Technology and Health Care (1998)

There is a tremendous unmet therapeutic need for the treatment of osteoporosis and osteoarthritis. The ovariectomized rat and the guinea pig are widely used animal models for the evaluation of new therapeutics for osteoporosis and osteoarthritis, respectively. We have utilized X-ray micro-CT techniques to quantitatively evaluate the differences in trabecular bone in the rat proximal tibia following ovariectomy and treatment with estrogen (17-B-estradiol). Results demonstrate a loss of trabecular bone and architecture following ovariectomy (p<0.001), and a marked inhibition of trabecular bone loss in the estrogen treated group (p<0.001). A similar change in architecture can be visualized in images obtained by high resolution MR microscopy. In addition, a good correlation was observed between the values of trabecular bone fraction (BV/TV) in the rat tibiae as obtained from 3-dimensional micro-CT data and 2-dimensional static histomorphometry (r=0.89, 0.73, 0.79 for sham, OVX, and treated groups, respectively). Micro-CT images were also obtained from a set of lumbar vertebrae from sham operated and ovariectomized rats. Significant bone loss can be measured as early as 8 weeks following ovariectomy (p<0.005). Micro-CT and MR images were also obtained to study age related changes in the stifle joint of the guinea pig. Significant boney changes can be seen in the tibia and femur from the animals at various ages. Changes in cartilage and joint space can also be visualized in the images. The utility of micro-CT imaging in evaluating the mouse skeletal system is illustrated by obtaining morphological and architectural details from high resolution images of the mouse hind limb and proximal tibia, respectively. The results demonstrate the advantages that multi-dimensional imaging techniques can offer in evaluating bone and joint related changes in animal models of osteoporosis and osteoarthritis.
ID-based secret-key cryptography
Authors: Marc Joye, Sung-Ming Yen
Venue: ACM SIGOPS Operating Systems Review (1998)

This paper introduces ID-based secret-key cryptography, in which secret keys are privately and uniquely binded to an identity. This enables to extend public-key cryptography features at the high throughput rate of secret-key cryptography. As applications, efficient login protocols, an enhanced version of Kerberos, and an ID-based MAC algorithm are presented.ID-based systems were initially developed in the context of public-key cryptography by removing the need of explicit public keys. The idea was to derive, in a publicly known way, a public key from an identity. Similarly, in secret-key cryptography, ID-based systems allow authorized entities to derive a secret key from an identity. So, large databases maintaining the correspondence between an identity and the corresponding secret key are no longer required, resulting in better performances and higher security.
Learning and performing by exploration: label quality measured by latent semantic analysis
Authors: Rodolfo Soto
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Models of learning and performing by exploration assume that the semantic similarity between task descriptions and labels on display objects (e.g., menus, tool bars) controls in part the users search strategies. Nevertheless, none of the models has an objective way to compute semantic similarity. In this study, Latent Semantic Analysis (LSA) was used to compute semantic similarity between task descriptions and labels in an applications menu system. Participants performed twelve tasks by exploration and they were tested for recall after a l-week delay. When the labels in the menu system were semantically similar to the task descriptions, subjects performed the tasks faster. LSA could be incorporated into any of the current models, and it could be used to automate the evaluation of computer applications for ease of learning and performing by exploration.
A tutorial on default logics
Authors: Grigoris Antoniou
Venue: ACM Computing Surveys (CSUR) (1999)

Default logic is one of the most prominent approaches to nonmonotonic reasoning, and allows one to make plausible conjectures when faced with incomplete information about the problem at hand. Default rules prevail in many application domains such as medical and legal reasoning. Several variants have been developed over the past year, either to overcome some perceived deficiencies of the original presentation, or to realize somewhat different intuitions. This paper provides a tutorial-style introduction to some important approaches of Default Logic. The presentation is based on operational models for these approaches, thus making them easily accessible to a broader audience, and more easily usable in practical applications.
SUIF Explorer: an interactive and interprocedural parallelizer
Authors: Shih-Wei Liao, Amer Diwan, Robert P. Bosch,  Jr., Anwar Ghuloum, Monica S. Lam
Venue: Proceedings of the seventh ACM SIGPLAN symposium on Principles and practice of parallel programming (1999)

The SUIF Explorer is an interactive parallelization tool that is more effective than previous systems in minimizing the number of lines of code that require programmer assistance. First, the interprocedural analyses in the SUIF system is successful in parallelizing many coarse-grain loops, thus minimizing the number of spurious dependences requiring attention. Second, the system uses dynamic execution analyzers to identify those important loops that are likely to be parallelizable. Third, the SUIF Explorer is the first to apply program slicing to aid programmers in interactive parallelization. The system guides the programmer in the parallelization process using a set of sophisticated visualization techniques.This paper demonstrates the effectiveness of the SUIF Explorer with three case studies. The programmer was able to speed up all three programs by examining only a small fraction of the program and privatizing a few variables.
Operations, Quality, and Profitability in the Provision of Banking Services
Authors: Andreas Soteriou, Stavros A. Zenios
Venue: Management Science (1999)

We develop a framework for combining strategic benchmarking with efficiency benchmarking of the services offered by bank branches. In particular, a cascade of efficiency benchmarking models is developed guided by the service-profit chain. Three models-based on the nonparametric technique of Data Envelopment Analysis-are developed in order to implement the framework in a practical setting: (i) an operational efficiency model, (ii) a service quality efficiency model, and (iii) a profitability efficiency model. The use of the models is illustrated using data from the branches of a commercial bank. Empirical results indicate that we gain superior insights by analyzing simultaneously the design of operations together with the quality of the provided services and profitability, rather than by benchmarking these three dimensions separately. Relationships are also established between operational efficiency and profitability, and between operational efficiency and service quality.
Towards Automatic Creation of Realistic Anthropomorphic Models for Realtime 3D Telecommunication
Authors: Jochen Wingbermuehle
Venue: Journal of VLSI Signal Processing Systems (1998)

This contribution describes the creation of highly realistic 3D models of participants for distributed 3D videoconferencing systems. These models consist of a flexible triangular mesh surrounding an interior skeleton structure, which is based on a simplified human skeleton. The vertices of the predefined mesh template are arranged in rigid rings along the bones of the skeleton. Using 3D data obtained by a stereoscopic approach the size and shape of this initial mesh is adapted to the real person. Adaptation allows to texture the model from real images leading to a natural impression. The mesh organization in rigid rings gives an efficient way for surface deformation according to the skeleton movements. The resulting model is transmitted once and subsequently animated using the simple parameter set of the interior skeleton structure.
A framework for testing core-based systems-on-a-chip
Authors: Srivaths Ravi, Ganesh Lakshminarayana, Niraj K. Jha
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

Available techniques for testing core-based systems-on-a-chip (SOCs) do not provide a systematic means for synthesising low-overhead test architectures and compact test solutions. In this paper, we provide a comprehensive framework that generates low-overhead compact test solutions for SOCs. First, we develop a common ground for addressing issues such as core test requirements, core access and test hardware additions. For this purpose, we introduce finite-state automata for modeling tests, transparency modes and test hardware behavior. In many cases, the tests repeat a basic set of test actions for different test data which can again be modeled using finite-state automata. While earlier work can derive a single symbolic test for a module in a register-transfer level (RTL) circuit as a finite-state automation, this work extends the methodology to the system level, and, additionally contributes a satisfiability-based solution to the problem of applying a sequence of tests phased in time. This problem is known to be a bottleneck in testability analysis not only at the system level, but also at the RTL. Experimental results show that the system-level average area overhead for making SOCs testable with our method is only 4.4%, while achieving an average test application time reduction of 78.5% over recent approaches. At the same time, it provides 100% test coverage of the precomputed test sets/sequences of the embedded cores.
Hedonic and ergonomic quality aspects determine a software's appeal
Authors: Mare Hassenzahl, Axel Platz, Michael Burmester, Katrin Lehner
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

The present study examines the role of subjectively perceived ergonomic quality (e.g. simplicity, controllability) and hedonic quality (e.g. novelty, originality) of a software system in forming a judgement of appeal. A hypothesised research model is presented. The two main research question are: (1) Are ergonomic and hedonic quality subjectively different quality aspects that can be independently perceived by the users? and (2) Is the judgement of appeal formed by combining and weighting ergonomic and hedonic quality and which weights are assigned? The results suggest that both quality aspects can be independently perceived by users. Moreover, they almost equally contributed to the appeal of the tested software prototypes. A simple averaging model implies that both quality aspects will compensate each other. Limitations and practical implication of the results are discussed.
Sketching in 3D
Authors: Robert Zeleznik
Venue: ACM SIGGRAPH Computer Graphics (1998)

Of the numerous changes to the implements for creating 2D images and 3D models, one of the most radical has been the recent adoption of WIMP interfaces. Ironically, there is good reason to believe that WIMP interaction for 3D modeling is actually inferior to the real-world interfaces (pencils, large sheets of paper, clay, paint palettes) that it supplants. In fact, WIMP interaction's principal benefit is its straightforward integration with computer 3D model representations which have many advantages including ease of transformation, archival, replication and distribution.Instead of interpreting user compliance as an affirmation of WIMP interaction, we explore the dichotomy of how easy it is to depict a 3D object with just a pencil and paper, and how hard it is to model the same object using a multithousand dollar workstation. Our challenge is to blend the essence of pencil sketching interfaces with the power of computer model representations.This paper presents an overview of ongoing research in "sketch-like" 3D modeling user interfaces. The objective of this research is to design interfaces that match human ergonomics, exploit prelearned skills, foster new skills and support the transition from novice to skilled expert. Thus pencil sketching is an interaction ideal, supporting users ranging from children to adults, and from doodlers to artists. Perhaps the best testament to the effectiveness of the pencil and paper interface is that very few people even consider it a user interface.
Gated-Vdd: a circuit technique to reduce leakage in deep-submicron cache memories
Authors: Michael Powell, Se-Hyun Yang, Babak Falsafi, Kaushik Roy, T. N. Vijaykumar
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Deep-submicron CMOS designs have resulted in large leakage energy dissipation in microprocessors. While SRAM cells in on-chip cache memories always contribute to this leakage, there is a large variability in active cell usage both within and across appliðcations. This paper explores an integrated architectural and circuit-level approach to reducing leakage energy dissipation in instrucðtion caches. We propose, gated-Vdd, a circuit-level technique to gate the supply voltage and reduce leakage in unused SRAM cells. Our results indicate that gated-Vdd together with a novel resizable cache architecture reduces energy-delay by 62% with minimal impact on performance.
Data management in hierarchical bus networks
Authors: F. Meyer auf der Heide, H. Räcke, M. Westermann
Venue: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures (2000)

A hierarchical bus network T = (V, E) uses hierarchically, tree-like connected buses as a communication network. New communication technologies like SCI (Scalable Coherent Interface) (see, e.g., [6, 7]) make such networks very attractive, because they allow their easy construction and guarantee reasonable communication performance. Such networks can be modeled as tree networks: leaves correspond to processors, inner nodes to buses, edges to switches, and bandwidths of inner nodes and edges are related to bandwidths of buses and switches, respectively.In this paper we address the problem of static data management. Given a set of shared data objects X and the read and write frequencies from the processors to the shared data objects, the goal is to compute a (maybe redundant) placement of the shared data objects to the processors, such that the congestion (the maximum over the load of all edges and inner nodes, induced by the read and write frequencies, divided by the bandwidth of the edge or inner node, respectively) is minimized. It is known [10] that this problem can be solved optimally in linear time, if inner nodes are allowed to hold copies of shared data objects. In our model, inner nodes correspond to buses and therefore cannot store copies of shared data objects. We show that this restriction increases the complexity of the placement problem drastically: It becomes NP-hard. On the other hand, the main contribution of our paper is an approximation algorithm with runtime O(|X|&middot;|V|&middot;height(T) &middot; log (degree(T)) that increases the congestion by a factor of at most 7.
Parsimonious Least Norm Approximation
Authors: P. S. Bradley, O. L. Mangasarian, J. B. Rosen
Venue: Computational Optimization and Applications (1998)

A theoretically justifiable fast finite successive linear approximation algorithm is proposed for obtaining a parsimonious solutionto a corrupted linear system Ax=b+p, where the corruptionp is due to noise or error in measurement. The proposedlinear-programming-based algorithm finds a solutionx by parametrically minimizing the number of nonzeroelements in x and the error &Verbar;Ax-b-p&Verbar;_1.Numerical tests on a signal-processing-based exampleindicate that the proposed method is comparable to a method that parametrically minimizesthe1 -norm of the solution x and the error &Verbar;Ax-b-p&Verbar;_1, and that both methods are superior, byorders of magnitude, to solutions obtained by least squares as well by combinatorially choosing an optimal solution with a specific number of nonzero elements.