ppxscal/embedding_network huggingface dataset:
Robots as dogs?: children's interactions with the robotic dog AIBO and a live australian shepherd
Authors: Gail F. Melson, Peter H. Kahn,  Jr., Alan M. Beck, Batya Friedman, Trace Roberts, Erik Garrett
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This study investigated the interactions of 72 children (ages 7 to 15) with Sony's robotic dog AIBO in comparison to a live Australian Shepherd dog. Results showed that more children conceptualized the live dog, as compared to AIBO, as having physical essences, mental states, sociality, and moral standing. Based on behavioral analyses, children also spent more time touching and within arms distance of the live dog, as compared to AIBO. That said, a surprising majority of children conceptualized and interacted with AIBO in ways that were like a live dog. Discussion focuses on two questions. First, is it possible that a new technological genre is emerging in HCI that challenges traditional ontological categories (e.g., between animate and inanimate)? Second, are pervasive interactions with a wide array of "robotic others" -- increasingly sophisticated personified computational artifacts that mimic biological forms and pull psychologically in mental, social, and moral ways -- a good thing for human beings.
Selecting the Numerical Flux in Discontinuous Galerkin Methods for Diffusion Problems
Authors: Robert M. Kirby, George Em Karniadakis
Venue: Journal of Scientific Computing (2005)

In this paper we present numerical investigations of four different formulations of the discontinuous Galerkin method for diffusion problems. Our focus is to determine, through numerical experimentation, practical guidelines as to which numerical flux choice should be used when applying discontinuous Galerkin methods to such problems. We examine first an inconsistent and weakly unstable scheme analyzed in Zhang and Shu, Math. Models Meth. Appl. Sci. (M3AS)13, 395--413 (2003), and then proceed to examine three consistent and stable schemes: the Bassi--Rebay scheme (J. Comput. Phys. 131, 267 (1997)), the local discontinuous Galerkin scheme (SIAM J. Numer. Anal. 35, 2440--2463 (1998)) and the Baumann--Oden scheme (Comput. Math. Appl. Mech. Eng. 175, 311--341 (1999)). For an one-dimensional model problem, we examine the stencil width, h-convergence properties, p-convergence properties, eigenspectra and system conditioning when different flux choices are applied. We also examine the ramifications of adding stabilization to these schemes. We conclude by providing the pros and cons of the different flux choices based upon our numerical experiments.
Signature Buffer: Bridging Performance Gap between Registers and Caches
Authors: Lu Peng, Jih-Kwon Peir, Konrad Lai
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

Data communications between producer instructions and consumer instructions through memory incur extra delays that degrade processor performance. In this paper, we introduce a new storage media with a novel addressing mechanism to avoid address calculations. Instead of a memory address, each load and store is assigned a signature for accessing the new storage. A signature consists of the color of the base register along with its displacement value. A unique color is assigned to a register whenever the register is updated. When two memory instructions have the same signature, they address to the same memory location. This memory signature can be formed early in the processor pipeline. A small Signature Buffer, addressed by the memory signature, can be established to permit stores and loads bypassing normal memory hierarchy for fast data communication. Performance evaluations based on an Alpha 21264-like pipeline using SPEC2000 integer benchmarks show that an IPC (Instruction-Per-Cycle) improvement of 13-18% is possible using a small 8-entry signature buffer.
Publication notes
Authors: Schiettecatte
Venue: ACM SIGCHI Bulletin (1991)

This book comes as a reminder that HCI does not only occur when users interact with a word-processor to produce a document, or use a spreadsheet to produce a financial model, but also when they control and manage complex dynamic systems (complex dynamic systems in this case include such things as chemical plants or nuclear power stations). This book consists of a collection of papers (each paper making up a chapter, there are 12 chapters in the book) brought together to illustrate the problems involved in designing computer interfaces to manage complex dynamic systems. An interesting thing to point out about these papers is that all but one of them were written by Europeans. The book in itself is a very good example of international collaboration, with authors from two different continents and eight different countries. This book also gives us a look into the kind of research that is going on in Europe in terms of Human-Computer Interaction and complex dynamic systems. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Game-Based Analysis of Denial-of-Service Prevention Protocols
Authors: Ajay Mahimkar, Vitaly Shmatikov
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

Availability is a critical issue in modern distributed systems. While many techniques and protocols for preventing denial of service (DoS) attacks have been proposed and deployed in recent years, formal methods for analyzing and proving them correct have not kept up with the state of the art in DoS prevention. This paper proposes a new protocol for preventing malicious bandwidth consumption, and demonstrates how game-based formal methods can be successfully used to verify availability-related security properties of network protocols. We describe two classes of DoS attacks aimed at bandwidth consumption and resource exhaustion, respectively. We then propose our own protocol, based on a variant of client puzzles, to defend against bandwidth consumption, and use the JFKr key exchange protocol as an example of a protocol that defends against resource exhaustion attacks. We specify both protocols as alternating transition systems (ATS), state their security properties in alternating-time temporal logic (ATL) and verify them using MOCHA, a model checker that has been previously used to analyze fair exchange protocols.
BEM for 3D unsteady-state flow problems in porous media with a finite-conductivity horizontal wellbore
Authors: Yueming Cheng, Duane A. McVay, W. John Lee
Venue: Applied Numerical Mathematics (2005)

This paper presents a Boundary Element Method (BEM) for the solution of unsteady-state fluid flow problems in a 3D domain. A general 3D reservoir model was developed in a bounded porous media with Neumann's, Dirichlet's or mixed boundary conditions. To consider the influence of frictional pressure loss in a horizontal wellbore on the reservoir performance behavior, a wellbore hydraulics model was developed and coupled with the reservoir model. The coupled model was solved using a sequential iterative approach, which converges rapidly.The model developed can account for practical reservoir and well conditions, and thus provides a powerful tool to reliably predict production performance and rigorously simulate pressure transient testing for horizontal wells. This model is validated by example problems and its applicability is demonstrated by various cases.
Linear bipolar OTAs employing exponential-law circuits: Research Articles
Authors: Fujihiko Matsumoto, Shintaro Nakamura, Hiroki Wasaki, Yasuaki Noguchi
Venue: International Journal of Circuit Theory and Applications (2004)

This paper presents design of linear bipolar OTAs, which are composed of two function blocks; one is an exponential-law circuit and the other is a core cell. Multi-tanh cells are employed as the core cell. This kind of OTA has lower power dissipation relatively to the conventional multi-tanh cell. According as the order of the multi-tanh core cell becomes higher, the number of circuit realization for the core cell increases. For example, we have two OTAs for the core circuit of an emitter-coupled pair and four OTAs for the doublet core cell. Thus, we consider the generalized OTAs for an arbitrary order n of the core cell and obtain a formula to give the realization number of the linear OTAs for n. According to the formula, there must be eight OTAs in the case of n=3. All of the eight OTAs are examined. Analysis and simulation results show that the OTAs have advantage in their characteristics, such as linear input range, power dissipation, noise, and frequency response. Copyright 2004 John Wiley & Sons, Ltd.
Bayesian filtering implementation for web content
Authors: Jonathan Bulava, Brian Wanner
Venue: Journal of Computing Sciences in Colleges (2005)

The overall project goal is to design, implement and deploy a Bayesian filtering system used to calculate the suitability of web content in an online community of similar-minded uses. It is in this environment where community leaders can create web filters that prevent access to content deemed inappropriate by the community (e.g. corporate offices, church groups, etc.). Our current research focuses on producing an efficient technique to enable a filter, and acquire swift performance for the filter when calculating the validity of a web page.
Solanaceae &mdash; a model for linking genomics with biodiversity: Conference Reviews
Authors: Sandra Knapp, Lynn Bohs, Michael Nee, David M. Spooner
Venue: Comparative and Functional Genomics (2004)

Recent progress in understanding the phylogeny of the economically important plant family Solanaceae makes this an ideal time to develop models for linking the new data on plant genomics with the huge diversity of naturally occurring species in the family. Phylogenetics provides the framework with which to investigate these linkages but, critically, good species-level descriptive resources for the Solanaceae community are currently missing. Phylogeny in the family as a whole is briefly reviewed, and the new NSF Planetary Biodiversity Inventories project &lsquo;PBI: Solanum&mdash;a worldwide treatment&rsquo; is described. The aims of this project are to provide species-level information across the global scope of the genus Solanum and to make this available over the Internet. The project is in its infancy, but will make available nomenclatural information, descriptions, keys and illustrative material for all of the approximately 1500 species of Solanum. With this project, the opportunity of linking valid, up-to-date taxonomic information about wild species of Solanum with the genomic information being generated about the economically important species of the genus (potato, tomato and eggplant) can be realized. The phylogenetic framework in which the PBI project is set is also of enormous potential benefit to other workers on Solanum. The community of biologists working with Solanaceae has a unique opportunity to effectively link genomics and taxonomy for better understanding of this important family, taking plant biology to a new level for the next century. Copyright &copy; 2004 John Wiley & Sons, Ltd.
The effects of fitness functions on genetic programming-based ranking discovery for Web search: Research Articles
Authors: Weiguo Fan, Edward A. Fox, Praveen Pathak, Harris Wu
Venue: Journal of the American Society for Information Science and Technology (2004)

Genetic-based evolutionary learning algorithms, such as genetic algorithms (GAs) and genetic programming (GP), have been applied to information retrieval (IR) since the 1980s. Recently, GP has been applied to a new IR task&mdash;discovery of ranking functions for Web search&mdash;and has achieved very promising results. However, in our prior research, only one fitness function has been used for GP-based learning. It is unclear how other fitness functions may affect ranking function discovery for Web search, especially since it is well known that choosing a proper fitness function is very important for the effectiveness and efficiency of evolutionary algorithms. In this article, we report our experience in contrasting different fitness function designs on GP-based learning using a very large Web corpus. Our results indicate that the design of fitness functions is instrumental in performance improvement. We also give recommendations on the design of fitness functions for genetic-based information retrieval experiments. &copy; 2005 Wiley Periodicals, Inc.
Project LOGOS at Case Western Reserve University
Authors: C. W. Rose, J. P. Barden
Venue: ACM SIGDA Newsletter (1972)

The descriptive title of Project LOGOS is <u>Computer-Aided Design and Certification of Computer Systems.</u> This account is based on unpublished papers presented at the Primary Seminar on Project LOGOS, 27-28 Octover 1971 at the University and on reports to the sponsor, The Advanced Research Projects Agency of the Department of Defense.
The Development of Intelligent Beamforming Antenna Systems for Stratospheric Platforms in the Millimeter-Wave Band
Authors: Hiroyuki Tsuji, Masayuki Oodo, Ryu Miura, Mikio Suzuki
Venue: Wireless Personal Communications: An International Journal (2005)

In this paper, we describe intelligent beamforming antenna systems that can be used in the millimeter-wave band for High-altitude platform systems. We have developed two antenna systems for the millimeter-wave band and have designed experiments to test the efficiency of the developed systems. One is a multi-beam-horn antenna that enables high-speed transmission, and the other is an array antenna that digitally controls antenna beams. These antenna systems are also designed to work in the stratosphere. We also describe our solutions to the problems of low temperature and low pressure and show that the two antenna systems can function well in the stratosphere through tests conducted on the ground.
The Role of HAPs in Supporting Multimedia Broadcast and Multicast Services in Terrestrial-Satellite Integrated Systems
Authors: Giuseppe Araniti, Antonio Iera, Antonella Molinaro
Venue: Wireless Personal Communications: An International Journal (2005)

New-generation telecommunications systems are expected to meet the rising user exigencies of mobility and ubiquitous access to multimedia services. As a consequence, 3GPP consortium has introduced the Multimedia Broadcast and Multicast Service (MBMS) concept into 3G/beyond-3G networks. Supporting MBMS in next generation hybrid wireless platforms becomes a challenging issue due to high traffic load deriving from both signaling message exchange and data transmission between multicast sources (BM-SC) and end users. Therefore, in this context, key research issues are surely: effective exploitation of the limited radio spectrums available, coordination of users accessing radio resources, as well as provisioning of desired QoS guarantees. Given the high mobility profiles typical of UMTS users, it clearly appears that the cited target performance can only be achieved through networking solutions based on an overlapped terrestrial-HAP-satellite coverage. An inter-working scenario where HAPs operate in synergy with the UMTS terrestrial and satellite segments seems to be the most promising solution to provide mobile users with MBMS services. Our work, dealing with architectural design options, takes into account many metrics relevant to aspects, such as: frequency allocation, costs in terms of resource utilization, signaling traffic load, number and location of customers, reliability, possible retransmission paths, user mobility, and QoS.
An experiment on knowledge discovery in chemical databases
Authors: Sandra Berasaluce, Claude Laurenço, Amedeosw Napoli, Gilles Niel
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

In this paper, we present an experiment on knowledge discovery in chemical reaction databases. Chemical reactions are the main elements on which relies synthesis in organic chemistry, and this is why chemical reactions databases are of first importance. From a problem-solving process point of view, synthesis in organic chemistry must be considered at several levels of abstraction: mainly a strategic level where general synthesis methods are involved, and a tactic level where actual chemical reactions are applied. The research work presented in this paper is aimed at discovering general synthesis methods from chemical reaction databases in order to design generic and reusable synthesis plans. The knowledge discovery process relies on frequent levelwise itemset search and association rule extraction, but also on chemical knowledge involved within every step of the knowledge discovery process. Moreover, the overall process is supervised by an expert of the domain. The principles of this original periment on mining chemical reaction databases and its results are detailed and discussed.
Hardware-compatible vertex compression using quantization and simplification
Authors: Budirijanto Purnomo, Jonathan Bilodeau, Jonathan D. Cohen, Subodh Kumar
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2005)

We present a vertex compression technique suitable for efficient decompression on graphics hardware. Given a user-specified number of bits per vertex, we automatically allocate bits to vertex attributes for quantization to maximize quality, guided by an image-space error metric. This allocation accounts for the constraints of graphics hardware by packing the quantized attributes into bins associated with the hardware's vectorized vertex data elements. We show that this general approach is also applicable if the user specifies a total desired model size. We present an algorithm that integrally combines vertex decimation and attribute quantization to produce the best quality model for a user-specified data size. Such models have an appropriate balance between the number of vertices and the number of bits per vertex.Vertex data is transmitted to and optionally stored in video memory in the compressed form. The vertices are decompressed on-the-fly using a vertex program at rendering time. Our algorithms not only work well within the constraints of current graphics hardware but also generalize to a setting where these constraints are relaxed. They apply to models with a wide variety of vertex attributes, providing new tools for optimizing space and bandwidth constraints of interactive graphics applications.
Numerical software for minicomputers
Authors: J. C. Nash
Venue: ACM SIGNUM Newsletter (1976)

Largely by accident, the author has found himself developing numerical software for small (about 7K byte) computers. In response to a mention of this field by the Editor of SIGNUM Newsletter, in the October 1974 issue, it seems appropriate to mention some of the experience accumulated at Agriculture Canada in the past 18 months. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Integrating OO concepts into a CS0 course
Authors: Chuck Pheatt
Venue: Journal of Computing Sciences in Colleges (2004)

This paper describes the use of field programmable integrated circuits (FPIC) in introducing object oriented (OO) programming concepts into a CS0 Course. Using a low cost device known as the OOPIC (Object-Oriented Programmable Integrated Circuits), students can easily control hardware circuitry while being exposed to OO programming concepts. The OOPIC device simplifies hardware programming by allowing students to use common programming languages (Visual Basic, Java, or C) and a simple development environment to create and test programs. In addition to introducing the use of an OO approach to problem solving, the device provides students an opportunity to deal with simple circuits.
Metrics Suite for Class Complexity
Authors: John Michura, Miriam A. M. Capretz
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Though software engineering seems to focus on the development of software, most of the funds are spent maintaining and testing the systems. The ability to predict effort required to test and maintain is valuable to an organization interested in allocating project resources accordingly. This paper reviews the metrics cyclomatic complexity and weighted methods per class. The flaws in weighted methods per class are examined and a suite of metrics to determine and justify class complexity is proposed. This paper also discusses the design of a software tool that can be used to extract the values for the proposed metrics suite. The benefits of the software tool are also discussed.
Evaluation of alternative presentation control techniques
Authors: Xiang Cao, Eyal Ofek, David Vronay
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Although slideshow presentation applications, such as PowerPoint™ have been popular for years, the techniques commercially available to control them rely on mouse and keyboard, which can be restrictive for the presenters. We evaluated two representative alternative designs of presentation control techniques - Bare Hand and Laser Pointer, through a Wizard-of-Oz user study. The result showed that Bare Hand was better than Laser Pointer and Standard (mouse/keyboard) control in terms of acceptance and preference from both presenters and audience. We also proposed design directions based on user feedback.
Conical Partition Algorithm for Maximizing the Sum of dc Ratios
Authors: Yang Dai, Jianming Shi, Shouyang Wang
Venue: Journal of Global Optimization (2005)

The following problem is considered in this paper: $$max_{x\in d\{\Sigma^m_{j=1}g_j(x)|h_j(x)\},}\, where\,g_j(x)\geq 0\, and\,h_j(x) > 0, j = 1,\ldots,m,$$ are d.c. (difference of convex) functions over a convex compact set D in R^n. Specifically, it is reformulated into the problem of maximizing a linear objective function over a feasible region defined by multiple reverse convex functions. Several favorable properties are developed and a branch-and-bound algorithm based on the conical partition and the outer approximation scheme is presented. Preliminary results of numerical experiments are reported on the efficiency of the proposed algorithm.
Book review: Artificial Intelligence with Statistical Pattern Recognition by Edward A. Patrick and James M. Fattu (Prentice-Hall Inc.)
Venue: Issue 109 (July 1989) (1989)

"Artificial Intelligence with Statistical Pattern Recognition" is a curious and frustrating book. Its authors, Edward A. Patrick and James M. Fattu, repeatedly claim to be making a contribution as fundamental as that of the Rev. Thomas Bayes, yet their level of rhetoric surely obscures the possible contribution of the work. While the authors' intended goal of applying statistical pattern recognition for purposes of inference in complex domains is important, the book has been criticized for being long on hype and short on clarity.
Time difference of arrival estimation of speech source in a noisy and reverberant environment
Authors: Tsvi G. Dvorkind, Sharon Gannot
Venue: Signal Processing (2005)

Determining the spatial position of a speaker finds a growing interest in video conference scenarios where automated camera steering and tracking are required. Speaker localization can be achieved with a dual-step approach. In the preliminary stage a microphone array is used to extract the time difference of arrival (TDOA) of the speech signal. These readings are then used by the second stage for the actual localization. In this work we present novel, frequency domain, approaches for TDOA calculation in a reverberant and noisy environment. Our methods are based on the speech quasistationarity property, noise stationarity and on the fact that the speech and the noise are uncorrelated. The mathematical derivations in this work are followed by an extensive experimental study which involves static and tracking scenarios.