ppxscal/embedding_network huggingface dataset:
Getting more out of programming-by-demonstration
Authors: Richard G. McDaniel, Brad A. Myers
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Programming-by-demonstration (PBD) can be used to create tools and methods that eliminate the need to learn difficult computer languages. Gamut is a PBD tool that nonprogrammers can use to create a broader range of interactive software, including games, simulations, and educational software, than they can with other PBD tools. To do this, Gamut provides advanced interaction techniques that make it easier for a developer to express all aspects of an application. These techniques include a simplified way to demonstrate new examples, called nudges, and a way to highlight objects to show they are important. Also, Gamut includes new objects and metaphors like the deck-of-cards metaphor for demonstrating collections of objects and randomness, guide objects for demonstrating relationships that the system would find too difficult to guess, and temporal ghosts which simplify showing relationships with the recent past. These techniques were tested in a formal setting with nonprogrammers to evaluate their effectiveness.
Using Administrative Databases for Outcomes Research: Select Examples from VA Health Services Research and Development
Authors: Diane C. Cowper, Denise M. Hynes, Joseph D. Kubal, Patricia A. Murphy
Venue: Journal of Medical Systems (1999)

The U.S. Department of Veterans Affairs (VA) operates and maintains one of the largest health care systems under a single management structure in the world. The coordination of administrative and clinical information on veterans served by the VA health care system is a daunting and critical function of the Department. This article provides an overview of VA Health Services Research and Development Service initiatives to assist researchers in using extant VA databases to study patient-centered health care outcomes. As examples, studies using the VA's Patient Treatment File (PTF) and the Beneficiary Identification and Records Locator System (BIRLS) Death File are described.
The digital Michelangelo project: 3D scanning of large statues
Authors: Marc Levoy, Kari Pulli, Brian Curless, Szymon Rusinkiewicz, David Koller, Lucas Pereira, Matt Ginzton, Sean Anderson, James Davis, Jeremy Ginsberg, Jonathan Shade, Duane Fulk
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

We describe a hardware and software system for digitizing the shape and color of large fragile objects under non-laboratory conditions. Our system employs laser triangulation rangefinders, laser time-of-flight rangefinders, digital still cameras, and a suite of software for acquiring, aligning, merging, and viewing scanned data. As a demonstration of this system, we digitized 10 statues by Michelangelo, including the well-known figure of David, two building interiors, and all 1,163 extant fragments of the Forma Urbis Romae, a giant marble map of ancient Rome. Our largest single dataset is of the David - 2 billion polygons and 7,000 color images. In this paper, we discuss the challenges we faced in building this system, the solutions we employed, and the lessons we learned. We focus in particular on the unusual design of our laser triangulation scanner and on the algorithms and software we developed for handling very large scanned models.
ATM adaptation layer choice for IP&ndash;ATM integration
Authors: Fahad Haj Hoymany
Venue: International Journal of Network Management (1999)

This paper gives a detailed evaluation of different ATM adaptation layers in terms of overhead, functionality, efficiency, and performance, and introduces a new adaptation layer that overcomes the shortcomings of existing layers. Copyright &copy; 19991999 John Wiley Sons, Ltd.
i-LAND: an interactive landscape for creativity and innovation
Authors: Norbert A. Streitz, Jörg Geißler, Torsten Holmer, Shin'ichi Konomi, Christian Müller-Tomfelde, Wolfgang Reischl, Petra Rexroth, Peter Seitz, Ralf Steinmetz
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

We describe the i-LAND environment which constitutes an example of our vision of the workspaces of the future, in this case supporting cooperative work of dynamic teams with changing needs. i-LAND requires and provides new forms of human-computer interaction and new forms of computer-supported cooperative work. Its design is based on an integration of information and architectural spaces, implications of new work practices and an empirical requirements study informing our design. i-LAND consists of several roomware components, i.e. computer-aug- mented objects integrating room elements with information technology. We present the current realization of i-LAND in terms of an interactive electronic wall, an interactive table, two computer-enhanced chairs, and two bridges for the Passage-mechanism. This is complemented by the description of the creativity support application and the technological infrastructure. The paper is accompanied by a video figure in the CHI99 video program.
Periodically Regular Chordal Rings
Authors: Behrooz Parhami, Ding-Ming Kwai
Venue: IEEE Transactions on Parallel and Distributed Systems (1999)

Chordal rings have been proposed in the past as networks that combine the simple routing framework of rings with the lower diameter, wider bisection, and higher resilience of other architectures. Virtually all proposed chordal ring networks are node-symmetric, i.e., all nodes have the same in/out degree and interconnection pattern. Unfortunately, such regular chordal rings are not scalable. In this paper, periodically regular chordal (PRC) ring networks are proposed as a compromise for combining low node degree with small diameter. By varying the PRC ring parameters, one can obtain architectures with significantly different characteristics (e.g., from linear to logarithmic diameter), while maintaining an elegant framework for computation and communication. In particular, a very simple and efficient routing algorithm works for the entire spectrum of PRC rings thus obtained. This flexibility has important implications for key system attributes such as architectural scalability, software portability, and fault tolerance. Our discussion is centered on unidirectional PRC rings with in/out-degree of 2. We explore the basic structure, topological properties, optimization of parameters, VLSI layout, and scalability of such networks, develop packet and wormhole routing algorithms for them, and briefly compare them to competing fixed-degree architectures such as symmetric chordal rings, meshes, tori, and cube-connected cycles.
The elusive goal of workload characterization
Authors: Allen B. Downey, Dror G. Feitelson
Venue: ACM SIGMETRICS Performance Evaluation Review (1999)

The study and design of computer systems requires good models of the workload to which these systems are subjected. Until recently, the data necessary to build these models---observations from production installations---were not available, especially for parallel computers. Instead, most models were based on assumptions and mathematical attributes that facilitate analysis. Recently a number of supercomputer sites have made accounting data available that make it possible to build realistic workload models. It is not clear, however, how to generalize from specific observations to an abstract model of the workload. This paper presents observations of workloads from several parallel supercomputers and discusses modeling issues that have caused problems for researchers in this area.
The Asilomar report on database research
Authors: Phil Bernstein, Michael Brodie, Stefano Ceri, David DeWitt, Mike Franklin, Hector Garcia-Molina, Jim Gray, Jerry Held, Joe Hellerstein, H. V. Jagadish, Michael Lesk, Dave Maier, Jeff Naughton, Hamid Pirahesh, Mike Stonebraker, Jeff Ullman
Venue: ACM SIGMOD Record (1998)

The database research community is rightly proud of success in basic research, and its remarkable record of technology transfer. Now the field needs to radically broaden its research focus to attack the issues of capturing, storing, analyzing, and presenting the vast array of online data. The database research community should embrace a broader research agenda &mdash; broadening the definition of database management to embrace all the content of the Web and other online data stores, and rethinking our fundamental assumptions in light of technology shifts. To accelerate this transition, we recommend changing the way research results are evaluated and presented. In particular, we advocate encouraging more speculative and long-range work, moving conferences to a poster format, and publishing all research literature on the Web.
Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
Authors: Tatsuhiro Tsuchiya, Masatoshi Yamaguchi, Tohru Kikuno
Venue: IEEE Transactions on Parallel and Distributed Systems (1999)

The use of quorums is a well-known approach to achieving mutual exclusion in distributed computing systems. This approach works based on a coterie, a special set of node groups where any pair of the node groups shares at least one common node. Each node group in a coterie is called a quorum. Mutual exclusion is ensured by imposing that a node gets consensus from all nodes in at least one of the quorums before it enters a critical section. In a quorum-based mutual exclusion scheme, the delay for reaching consensus depends critically on the coterie adopted and, thus, it is important to find a coterie with small delay. In [5], Fu introduced two related measures called max-delay and mean-delay. The former measure represents the largest delay among all nodes, while the latter is the arithmetic mean of the delays. She proposed polynomial-time algorithms for finding max-delay and mean-delay optimal coteries when the network topology is a tree or a ring. In this paper, we first propose a polynomial-time algorithm for finding max-delay optimal coteries and, then, modify the algorithm so as to reduce the mean-delay of generated coteries. Unlike the previous algorithms, the proposed algorithms can be applied to systems with arbitrary topology.
Robust Design of Basic Low Voltage CMOS Transconductors
Authors: Tuna B. Tarim, H. Hakan Kuntman, Mohammed Ismail
Venue: Journal of VLSI Signal Processing Systems (1999)

Two new low voltage transconductors are introduced and the statistical design of these transconductors are presented. The circuits operate in the saturation region with fully balanced input signals. Initial circuit simulation results are given. Response surface methodology and design of experiment techniques are used as statistical VLSI design tools together with the statistical MOS (SMOS) model. The response surfaces obtained for the two transconductors show the trade-off between area and functional yield. Using these contours, the designer will be able to estimate the functional yield of the circuits before fabrication. The contours also provide information regarding which transistor aspect ratios are to be altered to achieve a better functional yield.
Power-optimal encoding for DRAM address bus (poster session)
Authors: Wei-Chung Cheng, Massoud Pedram
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

This paper presents Pyramid code, an optimal code for transmitting sequential addresses over a DRAM bus. Constructed by finding an Eulerian cycle on a complete graph, this code is optimal for conventional DRAM in the sense that it minimizes the switching activity on the time-multiplexed address bus from CPU to DRAM. Experimental results on a large number of testbenches with different characteristics (i.e. sequential vs. random memory access behaviors) are reported and demonstrate a reduction of bus activity by as much as 50%.
An improved pass transistor synthesis method for low power, high speed CMOS circuits
Authors: Tudor Vinereanu, Sverre Lidholm
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

A synthesis method for generating hybrid pass gate circuits is presented. These circuits combine features from both complementary CMOS and pass gates architectures. The simulation results using a 0.7 &mgr;m technology show that circuits synthesized according to the proposed method may achieve significant improvements in terms of area, power and delay over traditional full swing pass transistor logic and complementary CMOS.
Extending requirement specifications using analogy
Authors: Yusuf Pisan
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

Creating the specifications for a new system is a labour intensive task. Analogical reasoning provides a flexible mechanism to retrieve and adapt past specifications. Previous work in applying analogical reasoning to requirement specifications has departed from the psychological foundations of analogical reasoning, introducing specific ontologies and abstract templates to constrain the reasoning process. We argue that similar results can be obtained without introducing domain specific constraints and that using analogical reasoning engines based on well-established psychological theories, such as the Structure-Mapping Engine, will lead to better results and scale up more effectively.
Multimedia Signal Processors: An Architectural Platform with Algorithmic Compilation
Authors: Yen-Kuang Chen, S. Y. Kung
Venue: Journal of VLSI Signal Processing Systems (1998)

Novel algorithmic features of multimedia applications and advances in VLSI technologies are driving forces behind the new multimedia signal processors. We propose an architecture platform which could provide high performance and flexibility, and would require less external I/O and memory access. It is comprised of array processors to be used as the hardware accelerator and RISC cores to be used as the basis of the programmable processor. It is a hierarchical and scalable architecture style which facilitates the hardware-software codesign of multimedia signal processing circuits and systems. While some control-intensive functions can be implemented using programmable CPUs, other computation-intensive functions can rely on hardware accelerators.To compile multimedia algorithms, we also present an operation placement and scheduling scheme suitable for the proposed architectural platform. Our scheme addresses data reusability and exploits local communication in order to avoid the memory/communication bandwidth bottleneck, which leads to faster program execution. Our method shows a promising performance: a linear speed-up of 16 times can be achieved for the block-matching motion estimation algorithm and the true motion tracking algorithm, which have formed many multimedia applications (e.g., MPEG-2 and MPEG-4).
A Behavioral Approach to Control of Distributed Systems
Authors: Harish K. Pillai, Shiva Shankar
Venue: SIAM Journal on Control and Optimization (1999)

This paper develops a theory of control for distributed systems (i.e., those defined by systems of constant coefficient partial differential operators) via the behavioral approach of Willems. The study here is algebraic in the sense that it relates behaviors of distributed systems to submodules of free modules over the polynomial ring in several indeterminates. As in the lumped case, behaviors of distributed ARMA systems can be reduced to AR behaviors. This paper first studies the notion of AR controllable distributed systems following the corresponding definition for lumped systems due to Willems. It shows that, as in the lumped case, the class of controllable AR systems is precisely the class of MA systems. It then shows that controllable 2-D distributed systems are necessarily given by free submodules, whereas this is not the case for n-D distributed systems, $n \ge 3$. This therefore points out an important difference between these two cases. This paper then defines two notions of autonomous distributed systems which mimic different properties of lumped autonomous systems.Control is the process of restricting a behavior to a specific desirable autonomous subbehavior. A notion of stability generalizing bounded input--bounded output stability of lumped systems is proposed and the pole placement problem is defined for distributed systems. This paper then solves this problem for a class of distributed behaviors.
Java resources for computer science instruction
Authors: Joseph Bergin, Thomas L. Naps, Constance G. Bland, Stephen J. Hartley, Mark A. Holliday, Pamela B. Lawhead, John Lewis, Myles F. McNally, Christopher H. Nevison, Cheng Ng, George J. Pothering, Tommi Teräsvirta
Venue: ACM SIGCUE Outlook (1998)

The goal of this working group was to collect, evaluate, and foster the development of resources to serve as components of both new and revised traditional courses that emphasize object-oriented software development using Java. These courses could, for example, integrate Internet-based distributed programming, concurrency, database programming, graphics and visualization, human interface design and object-oriented development. They could therefore also be suitable as capstone courses in computer science. The focus of the working group was on tools and techniques, including demonstrations, projects, syllabi, and pedagogical patterns. The working group members are coordinating the development of a Web site (sol.pace.edu/iticse98) devoted to sharing such tools and techniques among educators.
Axisymmetric Vortex Sheet Motion: Accurate Evaluation of the Principal Value Integral
Authors: Monika Nitsche
Venue: SIAM Journal on Scientific Computing (1999)

This paper concerns the accurate evaluation of the principal value integral governing axisymmetric vortex sheet motion. Previous quadrature rules for this integral lose accuracy near the axis of symmetry. An approximation by de Bernadinis and Moore (dBM) that converges pointwise at the rate of O(h3) has maximal errors near the axis that are O(h). As a result, the discretization error is not smooth. It contains high wavenumber frequencies that make it difficult to resolve the vortex sheet motion. This paper explains the reason for the degeneracy near the axis and proposes a modified quadrature rule that is uniformly O(h3). The results are based on an analytic approximation of the integrand, whose integral can be precomputed. The modification is implemented at negligible additional cost per timestep. As an example, it is applied to compute the evolution of an initially spherical vortex sheet.
Customer Satisfaction for Financial Services: the Role of Products, Services, and Information Technology
Authors: M. S. Krishnan, Venkatram Ramaswamy, Mary C. Meyer, Paul Damien
Venue: Management Science (1999)

In this paper, we study the drivers of customer satisfaction for financial services. We discuss a full Bayesian analysis based on data collected from customers of a leading financial services company. Our approach allows us to explicitly accommodate missing data and enables quantitative assessment of the impact of the drivers of satisfaction across the customer population. We find that satisfaction with product offerings is a primary driver of overall customer satisfaction. The quality of customer service with respect to financial statements and services provided through different channels of delivery, such as information technology enabled call centers and traditional branch offices, are also important in determining overall satisfaction. However, our analysis indicates that the impact of these service delivery factors may differ substantially across customer segments. In order to facilitate managerial action, we discuss how specific operational quality attributes for designing and delivering financial services can be leveraged to enhance satisfaction with product offerings and service delivery. Our approach and findings have significant implications for managing customer satisfaction in the financial services industry.
On the Weak Closure of Sets of Feasible States for Linear Elliptic Equations in the Scalar Case
Authors: Uldis Raitums
Venue: SIAM Journal on Control and Optimization (1999)

A suitable description of the weak closure of feasible states is given for the family of equations $$ \mathrm{div} A(x)\nabla u=f(x)\;\mbox{in}\;\Omega\;,\;u\in H_0^1(\Omega ),\;\Omega \subset {\bf R}^n, $$ with $A\in {\cal M}$, where the set ${\cal M}$ consists of all measurable symmetric matrices whose eigenvalues at almost every $x\in\Omega$ belong to a given finite set $\{(\lambda _1^1,\ldots ,\lambda _n^1);\ldots ;(\lambda _1^N,\ldots ,\lambda _n^N)\}\subset {\bf R}^n$ and which satisfy additional constraints on the measure of sets where the eigenvalues of $A$ are equal to some $(\lambda _1^i,\ldots,\lambda_n^i),\;i=1,\ldots ,N$. Applications to optimal control problems are also considered.
A general performance model for parallel sweeps on orthogonal grids for particle transport calculations
Authors: Mark M. Mathis, Nancy M. Amato, Marvin L. Adams
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

The key contribution of this paper is the first general model which can be used to predict the running time of transport sweeps on orthogonal grids for any regular mapping of the grid cells to processors. Our model, which accounts for machine dependent parameters such as computation cost and communication latency, can be used to analyze and compare the effects of various spatial decompositions on the running time of the transport sweep. Insight obtained from the model yields two significant contributions to the theory of optimal transport sweeps on orthogonal grids. First, our model provides a theoretical basis which explains why, and under what circumstances, the column decomposition of the current standard KBA algorithm is superior to the 'balanced' decomposition obtained by classic domain decomposition techniques. Second, our model enables us to identify a new decomposition, we call Hybrid, which proves to be almost as good as, and sometimes superior to, the current standard KBA method. Our analysis covers sweeps in two- and three-dimensional spatial domains, and first considers sweeps in only one direction, and then sweeps involving multiple simultaneous directions. We obtain expressions for the completion time and discuss theoretical results.
On distance education courseware
Authors: Marijana Lomic, Zoran Putnik
Venue: ACM SIGCSE Bulletin (1999)

Multimedia, WWW and advanced technologies are bringing changes in the field of education. Additional ways of interaction between students, study material, and teachers, are introduced. Development in technology and their introduction into education, changed the character and methods of it. A need exists for a distance education and additional education at home. With the cost of multimedia computers becoming lower, while availability of educational CD-ROM's higher, a proper inclusion of these into the curricula and distance education is needed. Here, some strategies for distance education software are being proposed.
A 2.4-GHz CMOS Monolithic VCO with an MOS Varactor
Authors: Pietro Andreani, Sven Mattisson
Venue: Analog Integrated Circuits and Signal Processing (2000)

A 2.4-GHz CMOS VCO is presented employing pMOS transistors as voltage-controlled capacitances and on-chip hollow spiral inductors. The design was implemented in a standard digital 0.8&mu;m CMOS process and exhibits a 15% tuning range at 2.5 V supply voltage and 9 mA supply current. Phase-noise measurements show a phase-noise of about &minus;118 dBc/Hz at 1 MHz from the carrier.