ppxscal/embedding_network huggingface dataset:
Electronic Versus Paper Surveys: Analysis of Potential Psychometric Biases
Authors: Scott McCoy, Peter V. Marks,  Jr., Christopher L. Carr, Victor Mbarika
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

The Internet and World Wide Web are increasingly being used for survey distribution and administration in both academic and practitioner research. Little systematic research exists on the efficacy of these survey administration media or their potential psychometric effects. This paper reports on a study of the potential biasing effects of online versus paper surveys. We consider issues specifically related to the information systems research context and introduce psychometric issues of general interest to those considering testing for response stability between online and paper survey administration. The study provides an assessment of the psychometric differences between paper-and-pencil and online survey administration for the well-known Technology Acceptance Model (TAM) instrument. The results indicate that biasing effects can occur which significantly reduce the stability of an instrument across administration methods. We sound a cautionary note on the practice of placing any existing paper-and-pencil survey instrument on the web without consideration of the biasing effects of web-based survey administration.
Scattercast: an adaptable broadcast distribution framework
Authors: Yatin Chawathe
Venue: Multimedia Systems (2003)

Internet broadcasting - the simultaneous distribution of live content streams to a large audience - has a number of interesting applications ranging from real-time broadcasts of audio/video streams for online concerts or sporting events to efficient and reliable large-scale software distribution. We identify three fundamental requirements for scalable broadcasting services: an efficient infrastructure for large-scale broadcasting, an ability to adapt the infrastructure to suit the requirements of a wide range of applications, and ease of deployment of the infrastructure. Although solutions such as the network-layer IP multicast approach and a slew of overlay distribution networks exist today, none of these technologies satisfactorily addresses all of the above concerns.In this paper, we argue that an application-customizable hybrid overlay is well suited to meet these challenges. To this end, we propose an architecture called scattercast that relies on a network of strategically located agents called Scatter-Cast proXies or SCXs. These agents collaboratively provide the broadcast service for a session. Clients locate a nearby SCX and tap into the session via that SCX. Scattercast constructs a hybrid overlay network composed of unicast links between SCXs that interconnect locally scoped multicast regions. Rather than define a single standardized service model for transmitting data on top of the overlay, scattercast builds a customizable transport framework that provides adaptability by leveraging application-defined semantics to drive the distribution of content. We demonstrate the ability of our architecture to provide efficient distribution via a set of simulation experiments. Finally, we present our experience with the adaptability of the framework by describing two applications, a real-time Internet radio and an online slide-presentation tool, both of which we have built on top of a prototype implementation of the architecture.
Query optimization in multidatabase systems
Authors: Qiang Zhu
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

A multidatabase system (MDBS) integrates information from autonomous local databases managed by heterogeneous database management systems (DBMS) in a distributed environment. For a query involving more than one database, global query optimization should be performed to achieve good overall system performance. The significant differences between an MDBS and a traditional distributed database system (DDBS) make query optimization in the former more challenging than in the latter. Challenges for query optimization in an MDBS are discussed in this paper. A two-phase optimization approach for processing a query in an MDBS is proposed. Several global query optimization techniques suitable for an MDBS, such as semantic query optimization, query optimization via probing queries, parametric query optimization and adaptive query optimization, are suggested. The architecture of a global query optimizer incorporating these techniques is designed.
Real time facial expression recognition in video using support vector machines
Authors: Philipp Michel, Rana El Kaliouby
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

Enabling computer systems to recognize facial expressions and infer emotions from them in real time presents a challenging research topic. In this paper, we present a real time approach to emotion recognition through facial expression in live video. We employ an automatic facial feature tracker to perform face localization and feature extraction. The facial feature displacements in the video stream are used as input to a Support Vector Machine classifier. We evaluate our method in terms of recognition accuracy for a variety of interaction and classification scenarios. Our person-dependent and person-independent experiments demonstrate the effectiveness of a support vector machine and feature tracking approach to fully automatic, unobtrusive expression recognition in live video. We conclude by discussing the relevance of our work to affective and intelligent man-machine interfaces and exploring further improvements.
Solving Mathematical Exercises that Involve Symbolic Computations
Authors: Fernando Díez, Roberto Moriyón
Venue: Computing in Science and Engineering (2004)

In this article, we illustrate this last claim by briefly reviewing the most advanced tutoring systems currently representing mathematical concepts by means of symbolic information. We also describe the three core modules in MathEdu: MathSolver, MathDesigner, and MathTrainer.
Developing Earth System Science Knowledge to Manage Earth's Natural Resources
Authors: Roger L. King, Ronald J. Birk
Venue: Computing in Science and Engineering (2004)

This article provides a rationale and proposed course of action for the global observing and modeling community to work together toward a solution for managing the Earth's natural resources (e.g., water, energy, agriculture) for the common good. The computational science and engineering communities have the opportunity to build the infrastructure to use the observations, the computational models, and the knowledge about Earth system science to enable decision support to be used globally, nationally, regionally, and locally.
Effective and efficient FPGA synthesis through general functional decomposition
Authors: L. JóŹwiak, A. Chojnacki
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

In this paper, a new information-driven circuit synthesis method is discussed that targets LUT-based FPGAs and FPGA-based reconfigurable system-on-a-chip platforms. The method is based on the bottom-up general functional decomposition and theory of information relationship measures that we previously developed. It differs considerably from all other known methods. The experimental results from the automatic circuit synthesis tool that implements the method clearly demonstrate that the information-driven general functional decomposition based on information relationship measures efficiently produces very fast and compact FPGA circuits.
Developing a conductive oxygen barrier for ferroelectric integration
Authors: J. A. Johnson, J. G. Lisoni, D. J. Wouters
Venue: Microelectronic Engineering (2003)

For high-density FeRAM memories, the 1T-1C architecture has been proposed. In this scheme, the ferrocapacitor (FeCAP), a metal\ferroelectric film\metal-like sandwich, is placed directly on top of polysilicon or tungsten plugs contacted to the underlying CMOS technology. Our ferroelectric material of choice, SrBi2Ta2O9 (SBT), requires crystallization anneals ranging from 650 to 800 °C in full oxygen. The bottom electrode (BE) needs to be conductive, as well as an oxygen barrier to protect the underlying plug from oxidation. We have developed a BE stack combination consisting of Pt/IrO2/Ir/Ti(Al)N. Each layer plays a critical role in the performance of the barrier. Issues such as thermal expansion, stress relaxation, grain growth, and oxidation can be critical in order to have a working bottom electrode. For capacitor formation, the complete stack is etched and covered by SBT. Since all layers are in contact with SBT, it is important to understand how the ferroelectric interacts with both the individual layers and the combined structure. In this paper, we will present our understanding of the chemical reactivity between SBT and the BE stack, which has been successfully engineered to prevent oxidation of the underlying plug.
Fast k-Nearest Neighbor Classification Using Cluster-Based Trees
Authors: Bin Zhang, Sargur N. Srihari
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--Most fast k{\hbox{-}}{\rm{nearest}} neighbor (k{\hbox{-}}{\rm{NN}}) algorithms exploit metric properties of distance measures for reducing computation cost and a few can work effectively on both metric and nonmetric measures. We propose a cluster-based tree algorithm to accelerate k{\hbox{-}}{\rm{NN}} classification without any presuppositions about the metric form and properties of a dissimilarity measure. A mechanism of early decision making and minimal side-operations for choosing searching paths largely contribute to the efficiency of the algorithm. The algorithm is evaluated through extensive experiments over standard NIST and MNIST databases.
Integral equation methods for scattering from an impedance crack
Authors: Rainer Kress, Kuo-Ming Lee
Venue: Journal of Computational and Applied Mathematics (2003)

For the scattering problem for time-harmonic waves from an impedance crack in two dimensions, we give a uniqueness and existence analysis via a combined single- and double-layer potential approach in a Hölder space setting leading to a system of integral equations that contains a hypersingular operator. For its numerical solution we describe a fully discrete collocation method based on trigonometric interpolation and interpolatory quadrature rules including a convergence analysis and numerical examples.
A simulation model for X.500 directories: initial experiences
Authors: M. A. Bauer, J. M. Bennett, J. MacAuley, A. D. Marshall
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

The X.500 Standard has been proposed as the basis for a directory service in distributed systems. There is some question as to whether it is suited to this use. This paper describes the initial work on the development of an X.500 simulation testbed to be used in investigating the behaviour of X.500 directories in large distributed environments. The initial version of the testbed has been developed using the Quipu prototype implementation of X.500 and the Nest network simulation tool. The long-term goals of this work are twofold: first, to evaluate the effectiveness of X.500 in providing directory services in a distributed system environment and, second, to evaluate and explore proposed changes to the Standard. This paper outlines the X.500 simulation model, discusses its underlying assumptions and describes initial experiments in using it to evaluate a network of X.500 directory and user agents. It also discusses the approach used, reports on experiences with the existing tools and identifies further enhancements to facilitate use of such tools for simulating other, similar distributed applications.
RoboCupJunior: learning with educational robotics
Authors: Elizabeth Sklar, Amy Eguchi, Jeffrey Johnson
Venue: AI Magazine (2003)

The RoboCupJunior division of RoboCup is now entering its third year of international participation and is growing rapidly in size and popularity. This article first outlines the history of the junior league since it was first demonstrated in Paris at RoboCup-1998 and describes how it has evolved into the international sensation it is today. Although the popularity of the event is self-evident, we are working to identify and quantify the educational benefits of the initiative. The remainder of the article focuses on describing our efforts to encapsulate these qualities, highlighting results from a pilot study conducted at RoboCupJunior-2000 and presenting new data from a subsequent study of RoboCupJunior-2001.
The mathematics of statistical machine translation: parameter estimation
Authors: Peter F. Brown, Vincent J. Della Pietra, Stephen A. Della Pietra, Robert L. Mercer
Venue: Computational Linguistics (1993)

We describe a series of five statistical models of the translation process and give algorithms for estimating the parameters of these models given a set of pairs of sentences that are translations of one another. We define a concept of word-by-word alignment between such pairs of sentences. For any given pair of such sentences each of our models assigns a probability to each of the possible word-by-word alignments. We give an algorithm for seeking the most probable of these alignments. Although the algorithm is suboptimal, the alignment thus obtained accounts well for the word-by-word relationships in the pair of sentences. We have a great deal of data in French and English from the proceedings of the Canadian Parliament. Accordingly, we have restricted our work to these two languages; but we feel that because our algorithms have minimal linguistic content they would work well on other pairs of languages. We also feel, again because of the minimal linguistic content of our algorithms, that it is reasonable to argue that word-by-word alignments are inherent in any sufficiently large bilingual corpus.
Face Recognition in Hyperspectral Images
Authors: Zhihong Pan, Glenn Healey, Manish Prasad, Bruce Tromberg
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Abstract--Hyperspectral cameras provide useful discriminants for human face recognition that cannot be obtained by other imaging methods. We examine the utility of using near-infrared hyperspectral images for the recognition of faces over a database of 200 subjects. The hyperspectral images were collected using a CCD camera equipped with a liquid crystal tunable filter to provide 31 bands over the near-infrared (0.7\mum-1.0\mum). Spectral measurements over the near-infrared allow the sensing of subsurface tissue structure which is significantly different from person to person, but relatively stable over time. The local spectral properties of human tissue are nearly invariant to face orientation and expression which allows hyperspectral discriminants to be used for recognition over a large range of poses and expressions. We describe a face recognition algorithm that exploits spectral measurements for multiple facial tissue types. We demonstrate experimentally that this algorithm can be used to recognize faces over time in the presence of changes in facial pose and expression.
The evolution of objects into hyper-objects: will it be mostly harmless?
Authors: Irene Mavrommati, Achilles Kameas
Venue: Personal and Ubiquitous Computing (2003)

Objects may in the future become enhanced with new digital properties and information-communication capabilities, thus turning them into Hyper-Objects. This paper describes an approach towards defining Hyper-Objects, and examines to what extent their advance affects our existing lifestyle patterns.
Two bijective proofs for the arborescent form of the good-Lagrange formula and some applications to colored rooted trees and cacti
Authors: Michel Bousquet, Cedric Chauve, Gilbert Labelle, Pierre Leroux
Venue: Theoretical Computer Science (2003)

Goulden and Kulkarni (J. Combin. Theory Ser. A 80 (2) (1997) 295) give a bijective proof of an arborescent form of the Good-Lagrange multivariable inversion formula. This formula was first stated explicitly by Bender and Richmond (Electron. J. Combin. 5 (1) (1998) 4pp) but is implicit in Goulden and Kulkarni (1997). In this paper, we propose two new simple bijective proofs of this formula and we illustrate the interest of these proofs by applying them to the enumeration and random generation of colored rooted trees and rooted m-ary cacti.
Accurate mode-separated energy release rates for delamination cracks
Authors: Hae-Soo Oh
Venue: Journal of Computational Physics (2004)

Babuska and Oh introduced a new approach, called the method of auxiliary mapping (MAM), that can effectively handle singularities in the framework of the p-version of the FEM. In this paper, this new approach is generalized so that it can yield highly accurate energy release rates for the cracks in composite materials. The results obtained by this method are more accurate than those obtained by the conventional methods (quarter-point singularity elements). Moreover, it is demonstrated that the mode-separated energy rates of interlaminar cracks of a laminate virtually converge when its layers are of the same material and have different fiber orientations.
Interactive teaching materials in PDF using JavaScript
Authors: Petr Sojka
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

The use of JavaScript language for adding interaction to portable teaching materials of a high typographical quality in PDF file format is described. An extended version of the program TEX called pdfTEX is extremely useful for such purposes. It is shown that applications similar to those done by CGI script on the web can be done in PDF, exploiting the embedded JavaScript engine implementation in PDF viewers.
Static analysis of Ravenscar programs
Authors: P. N. Amey, B. J. Dobbing
Venue: Proceedings of the 12th international workshop on Real-time Ada (2003)

The Ravenscar Profile provides support for deterministic, multi-tasking programming as an integral part of a standardized language. A key element in the exploitation of the advantages of the Profile within the critical systems market is its use with verification tools. An established static analysis tool for this market operates on sequential programs in the SPARK language, which is an annotated subset of Ada 95 that avoids ambiguity and allows all language rule violations to be detected prior to execution. The authors show how the principles of SPARK have been successfully extended to encompass the Profile, thereby realising the benefits of constructing multi-tasking programs with the same degree of rigour that is currently possible using sequential SPARK.
Microscopic derivation of zero-flux boundary condition in one-dimensional random walk in presence of a totally reflecting barrier
Authors: Marius Orlowski
Venue: Microelectronic Engineering (2003)

In this paper a rigorous probabilistic two-probability-parameter model of a diffusion barrier is investigated that describes comprehensively reflection, absorption, and segregation phenomena at a diffusion barrier. As a special case, a rigorous analysis of counting paths for 1D random walk in the presence of a reflecting barrier is presented. This paper defines and makes distinction between partially and totally reflecting barriers. So far, in the literature only a special case of partially reflecting barrier has been dealt with. A combinatorial formula is derived showing that in the presence of a totally reflecting barrier (at mb=0) the probability of a particle departing from position m=2j and arriving at position m=2k on the positive axis after N= 2M steps is given by W2j(2k,N) = [C(2M, M-j +k)-C(2M, M-j-k-l)]/[C(2M,M)+ 2 Σi=0j C(2M,M + i)], where C(n,m) denotes the binomial coefficient. This formula enables easy computation of any random walk redistribution of a diffusing species near or at the totally reflecting barrier. The analysis shows that for a particle starting its random walk at the barrier, the probability of finding it at the interface is diminishing with the number of diffusion steps N = 2M as 1/(M + 1) an_d that the peak of the probability distribution is moving away from the barrier with the increasing number of steps as √4M. Thus, the subsurface region is progressively depleted. The present analysis has bearing on the treatment of diffusion of impurities and point defects in thin films and in subsurface layers.
Simulation of computer system architectures
Authors: D. N. Serpanos, M. Gambrili, D. Chaviaras
Venue: Applied system simulation: methodologies and applications (2003)

Development of computer systems architectures requires the specification of computer systems and the evaluation of alternative architectures, so that architects make the appropriate choices for the designed system. The development of computer system models and their analysis is a necessary step in this process. Simulation is an indispensable tool in this process. In this chapter, we present the main goals, methodologies and tool architectures for computer system simulation and we analyze a case architecture, a high-speed router, which constitutes an important, representative and demanding conventional computer system. In the process of its analysis, we describe how we develop simulation models for the router, the important parameters in our analyses and representative results for typical traffic environments, in order to demonstrate typical use, evaluation of alternative architectural decisions and useful results of simulation in the development of sophisticated router architectures.
Competition and Outsourcing with Scale Economies
Authors: Gérard P. Cachon, Patrick T. Harker
Venue: Management Science (2002)

Scale economies are commonplace in operations, yet because of analytical challenges, relatively little is known about how firms should compete in their presence. This paper presents a model of competition between two firms that face scale economies; (i.e., each firm's cost per unit of demand is decreasing in demand). A general framework is used, which incorporates competition between two service providers with price- and time-sensitive demand (a queuing game), and competition between two retailers with fixed-ordering costs and pricesensitive consumers (an Economic Order Quantity game). Reasonably general conditions are provided under which there exists at most one equilibrium, with both firms participating in the market. We demonstrate, in the context of the queuing game, that the lower cost firm in equilibrium may have a higher market share and a higher price, an enviable situation. We also allow each firm to outsource their production process to a supplier. Even if the supplier's technology is no better than the firms' technology and the supplier is required to establish dedicated capacity (so the supplier's scale can be no greater than either firm's scale), we show that the firms strictly prefer to outsource. We conclude that scale economies provide a strong motivation for outsourcing that has not previously been identified in the literature.
Wavelet Image Compression Using Universal Coefficients Matrix Detail Estimation
Authors: Leonardo E. Urbano Sánchez, Héctor M. Pérez Meana, Mariko Nakano Miyatake
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

This paper represents a low complexity imagecompression algorithm by application of thetwo-dimensional discrete wavelet transform andthe estimation of the detail matrices from theinformation matrix of the transformed image,using an adaptable RLS filter which willestimate the detail matrices with universalcoefficients. The reconstructed image will besynthesized by using the estimated detailmatrices and information matrix provided by theWavelet transform.