ppxscal/embedding_network huggingface dataset:
Hyper Mochi Sheet: a predictive focusing interface for navigating and editing nested networks through a multi-focus distortion-oriented view
Authors: Masashi Toyoda, Etsuya Shibayama
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Multi-focus distortion-oriented views are useful in viewing large information on a small screen, but still have problems in managing multiple foci during editing. The user may have to navigate information space by focusing and defocusing multiple parts to obtain multi-focus layouts that change according to various editing situations. As a result, it becomes haphazard to navigate and edit large nested networks such as hypertexts. We propose a user interface for quickly obtaining desirable layouts. The interface uses two techniques: focus size prediction and predictive focus selection. These techniques are based on a user test and experiences in applications. We also describe two example applications.
The GAZE groupware system: mediating joint attention in multiparty communication and collaboration
Authors: Roel Vertegaal
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

In this paper, we discuss why, in designing multiparty mediated systems, we should focus first on providing non-verbal cues which are less redundantly coded in speech than those normally conveyed by video. We show how conveying one such cue, gaze direction, may solve two problems in multiparty mediated communication and collaboration: knowing who is talking to whom, and who is talking about what. As a candidate solution, we present the GAZE Groupware System, which combines support for gaze awareness in multiparty mediated communication and collaboration with small and linear bandwidth requirements. The system uses an advanced, desk- mounted eyetracker to metaphorically convey gaze awareness in a 3D virtual meeting room and within shared documents.
On Nonconservative Algorithms for Grid Interfaces
Authors: H. S. Tang, T. Zhou
Venue: SIAM Journal on Numerical Analysis (1999)

In computations of fluid flows by domain decomposition methods, the necessity of conservation at grid interfaces is now widely claimed. In this paper we consider nonconservative algorithms for the interfaces. Our investigation begins with discussions about typical nonconservative interface treatments for one-dimensional calculations. The analysis shows that the conservation error of a numerical solution caused by a nonconservative interface matching has an upper bound when the solution itself is bounded. Furthermore, if the numerical solution converges as the mesh size goes to zero, it converges to a weak solution of the problem under certain conditions that may be detected numerically. Also, we acquire similar results for two-dimensional calculations on grids intersecting with each other in an arbitrary way. In order to illustrate the theoretical results, we present numerical examples and demonstrate that, under those conditions, conservation error reduces and accuracy for jumps as well as locations of discontinuities improves as the mesh size decreases.
Convergence of Moment Methods for Linear Kinetic Equations
Authors: Christian Schmeiser, Alexander Zwirchmayr
Venue: SIAM Journal on Numerical Analysis (1998)

Numerical methods for linear kinetic equations based on moment expansions for a discretization in the velocity direction are examined. The moment equations are hyperbolic systems which can be shown to converge to the kinetic equation as the order of the expansion tends to infinity and to a drift-diffusion model as the Knudsen number tends to zero. A discretization of the moment equations with respect to time and space is presented, a stability result is proven, and some aspects of an implementation are discussed. In particular, an adaptive procedure is described where the order of the expansion is determined locally. Results of numerical experiments are presented.
Live from the stacks: user feedback on mobile computers and wireless tools for library patrons
Authors: Michael L. W. Jones, Robert H. Rieger, Paul Treadwell, Geri K. Gay
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

Digital library research is made more robust and effective when end-user opinions and viewpoints inform the research, design and development process. A rich understanding of user tasks and contexts is especially necessary when investigating the use of mobile computers in traditional and digital library environments, since the nature and scope of the research questions at hand remain relatively undefined. This paper outlines findings from a library technologies user survey and on-site mobile library access prototype testing, and presents future research directions that can be derived from the results of these two studies.
Multinomial Logit Market Share Models: Equilibrium Characteristics and Strategic Implications
Authors: Suman Basuroy, Dung Nguyen
Venue: Management Science (1998)

We specify and analyze the conditions under which the MNL market share models are appropriate for equilibrium analysis. Our results show that a linear price response function as is often used in empirical research, in conjunction with the typical concavity assumed in a large range of marketing response functions, would yield an interior equilibrium solution. We then consider the optimal reactions on pricing and marketing spending to entry and potential market expansion. In the context of the MNL models, we demonstrate that the entry of a new brand evokes a decrease in the equilibrium prices of the existing brands as a defensive reaction. This is true in both an expanding market as well as a fixed market. However, while new entry into a fixed market would trigger the incumbents to lower the marketing expenditure, we show that firms tend to raise marketing activities as they experience market expansion. Consequently, there exist distinct possibilities that marketing efforts for the existing brands increase in view of entry in an expanding market. Further managerial and marketing implications for endogeneity of the number of firms are explored.
In vivo evaluation of a new method for chemical analysis of volatile components in the respiratory gas of mechanically ventilated patients
Authors: J. K. Schubert, I. Esteban-Loos, K. Geiger, J. Guttmann
Venue: Technology and Health Care (1999)

Using the volatile anaesthetic isoflurane as a marker substance a gas chromatographic method for analysis of exhaled gas in mechanically ventilated patients was evaluated. Twelve patients with and 10 patients without preceding isoflurane exposure and seven blank respiratory circuits were investigated. Respiratory gas was sampled at four different sites in the respiratory tubing system. Analysis of volatile components was based upon adsorption onto activated charcoal, desorption by means of microwave energy, gas chromatographic separation and flame ionisation or mass spectrometric detection. Isoflurane concentrations in the blank respiratory circuits, in the control group, and in the inspiratory limb of patients with preceding isoflurane inhalation were at the limit of detection ($<10^{-12}$ mol/l). In the isoflurane group, isoflurane concentrations in the inspiratory and expiratory limb differed considerably. Using the method described, substances at very low concentrations could be identified as originating in the patient or as coming from the gas delivery system.
Sparse Representations for Image Decompositions
Authors: Davi Geiger, Tyng-Luh Liu, Michael J. Donahue
Venue: International Journal of Computer Vision (1999)

We are given an image I and a library of templates {\cal L} , such that {\cal L} is an overcomplete basis for I. The templates can represent objects, faces, features, analytical functions, or be single pixel templates (canonical templates). There are infinitely many ways to decompose I as a linear combination of the library templates. Each decomposition defines a representation for the image I, given {\cal L} .What is an optimal representation for I given {\cal L} and how to select it? We are motivated to select a sparse/compact representation for I, and to account for occlusions and noise in the image. We present a concave cost function criterion on the linear decomposition coefficients that satisfies our requirements. More specifically, we study a &ldquo;weighted L norm&rdquo; with 0 < p < 1. We prove a result that allows us to generate all local minima for the L norm, and the global minimum is obtained by searching through the local ones. Due to the computational complexity, i.e., the large number of local minima, we also study a greedy and iterative &ldquo;weighted L Matching Pursuit&rdquo; strategy.
Regions: an abstraction for expressing array computation
Authors: Bradford L. Chamberlain, E. Christopher Lewis, Calvin Lin, Lawrence Snyder
Venue: ACM SIGAPL APL Quote Quad (1998)

Most array languages, including Fortran 90, Matlab, and APL, provide support for referencing arrays by extending the traditional array subscripting construct found in scalar languages. We present an alternative to subscripting that exploits the concept of regions---an index set representation that can be named, manipulated with high-level operators, and syntactically separated from array references. This paper develops the concept of region-based programming and describes its benefits in the context of an idealized array language called RL. We show that regions simplify programming, reduce the likelihood of errors, and enable code reuse. Furthermore, we describe how regions accentuate the locality of array expressions and how this locality is important when targeting parallel computers. We also show how the concepts of region-based programming have been used in ZPL, a fully-implemented practical parallel programming language in use by scientists and engineers. In addition, we contrast region-based programming with the array reference constructs of other array languages.
An Improved Error Bound for a Lagrange--Galerkin Method for Contaminant Transport with Non-Lipschitzian Adsorption Kinetics
Authors: John W. Barrett, Peter Knabner
Venue: SIAM Journal on Numerical Analysis (1998)

In this paper we consider the Lagrange--Galerkin finite element approximation by continuous piecewise linears in space of the following problem:Given $\Omega \subset \mbox{\boldmath$R$}^{d}, 1 \leq d \leq 3$, find $u(\underline{x},t)$ and $v(\underline{x},t)$ such that \begin{eqnarray*} &\partial_{t}u + \partial_{t}v - \underline{\nabla}.(\underline{\underline{D}}\, \underline{\nabla} u) + \underline{q}.\underline{\nabla} u = f \; \mbox{ in } \Omega \times (0,T],&\\ &\partial_{t}v = k (\varphi(u)-v) \; \mbox{ in } \Omega \times (0,T],& \\ &u(\underline{x},0) = g_{1}(\underline{x}),\; v(\underline{x},0) = g_{2}(\underline{x}) \; \forall \:\underline{x} \in \Omega,& \end{eqnarray*} with periodic boundary conditions. Here $k \in \mbox{\boldmath$R$}^{+}$ and the spatial differential operator is uniformly elliptic, but $\varphi \in C^{0}(\mbox{\boldmath$R$}) \cap C^{1}(-\infty,0]\cup(0,\infty)$ is a monotonically increasing function satisfying $\varphi (0)=0$, which is only locally Hölder continuous, with exponent $p \in (0,1)$ at the origin; e.g., $\varphi(s) := [s]^{p}_{+}.$We obtain error bounds which improve on those in the literature.
Semantic video indexing: approach and issues
Authors: Arun Hampapur
Venue: ACM SIGMOD Record (1999)

Providing concept level access to video data requires, video management systems tailored to the domain of the data. Effective indexing and retrieval for high-level access mandates the use of domain knowledge. This paper proposes an approach based on the use of knowledge models to building domain specific video information systems. The key issues in such systems are identified and discussed.
Cocyclic Generalised Hadamard Matrices and Central RelativeDifference Sets
Authors: A. A. I. Perera K. J. Horadam
Venue: Designs, Codes and Cryptography (1998)

Cocyclic matrices have the form M = [ \psi(g, h)]_{g, h \in G}, where G is a finite group, C is a finite abelian group and \psi : G \times G \rightarrow C is a (two-dimensional) cocycle; that is, \psi(g, h) \psi(gh, k) = \psi(g, hk) \psi(h, k), \forall g, h, k \in G. This expression of the cocycle equation for finite groups as a square matrix allows us to link group cohomology, divisible designs with regular automorphism groups and relative difference sets. Let G have order v and C have order w, with w|v. We show that the existence of a G-cocyclic generalised Hadamard matrix GH (w, v/w) with entries in C is equivalent to the existence of a relative ( v, w, v, v/w)-difference set in a central extension E of C by G relative to the central subgroupC and, consequently, is equivalent to the existence of a (square) divisible ( v, w, v, v/w)-design, class regular with respect to C, with a central extension E of C as regular group of automorphisms. This provides a new technique for the construction of semiregular relative difference sets and transversal designs, and generalises several known results.
Analog State Transmission with Digital Hardware
Authors: J. T. Marienborg, T. S. Lande
Venue: Analog Integrated Circuits and Signal Processing (2000)

A novel strategy for analog state transmission providing a large number of analog channels is presented. The total bandwidth of a digital asynchronous bus is dynamically divided by a large number of separate channels using relatively simple modulation and arbitration circuitry. The concept introduces several interesting aspects like random quantization noise, good scaling capabilities and low area consumption. The feasibility of the method has been proven by measurements on a working chip implementation.
Stochastic $H^\infty$
Authors: D. Hinrichsen, A. J. Pritchard
Venue: SIAM Journal on Control and Optimization (1998)

We consider stochastic linear plants which are controlled by dynamic output feedback and subjected to both deterministic and stochastic perturbations. Our objective is to develop an $H^{\infty}$-type theory for such systems. We prove a bounded real lemma for stochastic systems with deterministic and stochastic perturbations. This enables us to obtain necessary and sufficient conditions for the existence of a stabilizing compensator which keeps the effect of the perturbations on the to-be-controlled output below a given threshhold $\gamma > 0$. In the deterministic case, the analogous conditions involve two uncoupled linear matrix inequalities, but in the stochastic setting we obtain coupled nonlinear matrix inequalities instead. The connection between $H^{\infty}$ theory and stability radii is discussed and leads to a lower bound for the radii, which is shown to be tight in some special cases.
Display and Interactive Languages for the Internet: HTML, PDF, andJava
Authors: Dirk Eddelbüttel, William L. Goffe
Venue: Computational Economics (1999)

The rapid rise of the Internet has lead to new technologies. These include HTML, the basic &rsquo;markup&lsquo; language for pages on the World Wide Web; PDF, a file format designed for precise layout control of documents like working papers and journals, and Java, a general purpose language ideally suited for use on the Internet. This paper introduces these technologies.
Tikhonov Regularization and Total Least Squares
Authors: Gene H. Golub, Per Christian Hansen, Dianne P. O'Leary
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

Discretizations of inverse problems lead to systems of linear equations with a highly ill-conditioned coefficient matrix, and in order to compute stable solutions to these systems it is necessary to apply regularization methods. We show how Tikhonov's regularization method, which in its original formulation involves a least squares problem, can be recast in a total least squares formulation suited for problems in which both the coefficient matrix and the right-hand side are known only approximately. We analyze the regularizing properties of this method and demonstrate by a numerical example that, in certain cases with large perturbations, the new method is superior to standard regularization methods.
Machine Learning for Intelligent Processing of Printed Documents
Authors: Floriana Esposito, Donato Malerba, Francesca A. Lisi
Venue: Journal of Intelligent Information Systems (2000)

A paper document processing system is an information system component which transforms information on printed or handwritten documents into a computer-revisable form. In intelligent systems for paper document processing this information capture process is based on knowledge of the specific layout and logical structures of the documents. This article proposes the application of machine learning techniques to acquire the specific knowledge required by an intelligent document processing system, named WISDOM++, that manages printed documents, such as letters and journals. Knowledge is represented by means of decision trees and first-order rules automatically generated from a set of training documents. In particular, an incremental decision tree learning system is applied for the acquisition of decision trees used for the classification of segmented blocks, while a first-order learning system is applied for the induction of rules used for the layout-based classification and understanding of documents. Issues concerning the incremental induction of decision trees and the handling of both numeric and symbolic data in first-order rule learning are discussed, and the validity of the proposed solutions is empirically evaluated by processing a set of real printed documents.
Generalised Epipolar Constraints
Authors: Kalle Åström, Roberto Cipolla, Peter Giblin
Venue: International Journal of Computer Vision (1999)

In this paper we will discuss structure and motion problems for curved surfaces. These will be studied using the silhouettes or apparent contours in the images. The problem of determining camera motion from the apparent contours of curved three-dimensional surfaces, is studied. It will be shown how special points, called epipolar tangency points or frontier points, can be used to solve this problem. A generalised epipolar constraint is introduced, which applies to points, curves, as well as to apparent contours of surfaces. The theory is developed for both continuous and discrete motion, known and unknown orientation, calibrated and uncalibrated, perspective, weak perspective and orthographic cameras. Results of an iterative scheme to recover the epipolar line structure from real image sequences using only the outlines of curved surfaces, is presented. A statistical evaluation is performed to estimate the stability of the solution. It is also shown how the motion of the camera from a sequence of images can be obtained from the relative motion between image pairs.
Design and implementation of network management systems for integrated management of LANs and WANs
Authors: Do-Hyeon Kim, You-Ze Cho
Venue: International Journal of Network Management (2000)

This paper proposes an integrated network management architecture that can simultaneously manage both LANs and WANs with either a standard or proprietary network management protocol. The features of the proposed architecture are analyzed in comparison with manager&hyphen;of&hyphen;managers architecture and common platform architecture. Copyright &copy; 2000 John Wiley Sons, Ltd.
Spatial Invasion of Pine Beetles into Lodgepole Forests: A Numerical Approach
Authors: Peter White, James Powell
Venue: SIAM Journal on Scientific Computing (1998)

We discuss a procedure for numerically approximating solutions to a system of nonlinear partial differential equations which describe mountain pine beetles attacking lodgepole pine {en masse}. A centered spatial discretization which yields a system of ordinary differential equations is presented, including a method for generating "transparent" spatial boundary conditions. A flux-based model estimates the phase speed of pheromone isoclines at the boundary, providing an overestimate of the flux of beetles across the boundaries and giving nearly transparent boundary conditions. An Adams variable-step predictor-corrector approach is applied to the discretized system. The numerical method and model are tested in both one and two space dimensions. In one space dimension a comparison of the solution using the flux estimates at the boundary is compared with a solution generated on a larger space domain. A spatially complicated example then is given to test the methodology in two dimensions.
A CMOS Quadrature Baseband Frequency Synthesizer/Modulator
Authors: Marko Kosunen, Jouko Vankka, Mikko Waltari, Lauri Sumanen, Kimmo Koli, Kari Halonen
Venue: Analog Integrated Circuits and Signal Processing (1999)

A quadrature baseband frequency synthesizer/modulator IC has been designed and fabricated in a 0.5 &mu;m CMOS. This quadrature baseband frequency synthesizer/modulator is intended for use in a wide variety of indoor/outdoor portable wireless applications in the 2.4&ndash;2.4835 GHz ISM frequency band. This frequency synthesizer/modulator is a capable of frequency and phase modulation. The major components are: a quadrature direct digital synthesizer, digital-to-analog converters and lowpass filters. By programming the quadrature direct digital synthesizer, adaptive channel bandwidths, modulation formats, frequency hopping and data rates are easily achieved. The quadrature baseband direct digital synthesizer produces an 80 MHz frequency band. The quadrature baseband spectrum could be upconverted with off-chip mixers into the 2.4 GHz ISM frequency band. The chip has a complexity of 17,803 transistors with a die area of 24 mm^2 and a core area of 9 mm^2. The power dissipation is 496 mW at 3.3 V.
Getting proactive network management from reactive network management tools
Authors: Timothy Chiu
Venue: International Journal of Network Management (1998)

Typical network management tools fail to prevent network outages and downtime. Network managers can set up proactive network management with existing tools, using SNMP automatic actions, triggered by thresholds. &copy; 1998 John Wiley & Sons, Ltd.
Convexity and HHD-Free Graphs
Authors: Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt
Venue: SIAM Journal on Discrete Mathematics (1999)

It is well known that chordal graphs can be characterized via m-convexity. In this paper we introduce the notion of m3-convexity (a relaxation of m-convexity) which is closely related to semisimplicial ordering of graphs. We present new characterizations of HHD-free graphs via m3-convexity and obtain some results known from [B. Jamison and S. Olariu, Adv. Appl. Math., 9 (1988), pp. 364--376] as corollaries. Moreover, we characterize weak bipolarizable graphs as the graphs for which the family of all m3-convex sets is a convex geometry. As an application of our results we present a simple efficient criterion for deciding whether a HHD-free graph contains a r-dominating clique with respect to a given vertex radius function r.
Normal meshes
Authors: Igor Guskov, Kiril Vidimče, Wim Sweldens, Peter Schröder
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

Normal meshes are new fundamental surface descriptions inspired by differential geometry. A normal mesh is a multiresolution mesh where each level can be written as a normal offset from a coarser version. Hence the mesh can be stored with a single float per vertex. We present an algorithm to approximate any surface arbitrarily closely with a normal semi-regular mesh. Normal meshes can be useful in numerous applications such as compression, filtering, rendering, texturing, and modeling.