ppxscal/embedding_network huggingface dataset:
Power efficient gathering of correlated data: optimization, NP-completeness and heuristics
Authors: Răzvan Cristescu, Martin Vetterli
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

This paper studies the interaction between the communication costs in a sensor network and the structure of the data that it measures. We formulate an optimization problem for power efficient data gathering and show that the problem is NP-complete. We propose scalable, distributed and efficient heuristics for solving this problem and show by numerical simulations that the power consumption can be significantly improved over direct transmission or the shortest path tree. Our algorithms provide solutions close to a computationally heavy heuristic used as benchmark, simulated annealing, which is provably optimal in the limit.
Building a massively multiplayer game for the million: Disney's Toontown Online
Authors: Mark R. Mine, Joe Shochet, Roger Hughston
Venue: Computers in Entertainment (CIE) (2003)

This paper presents an overview of the lessons learned building Disney's Toontown Online, a 3D massively multiplayer online game (MMP) for children ages seven and older. The paper is divided into three main parts. The first presents design highlights of Toontown Online and focuses on the challenge of building an MMP for kids. In particular, we discuss ways of incorporating kid-friendly socialization into an MMP. The second part of the paper presents an overview of Panda-3D, the VR Studio's open source 3D graphics engine. We focus on the aspects of Panda-3D that helped to facilitate the development of Toontown. In particular, Panda's expressive, platform-agnostic scene graph architecture, and flexible scripting language tools for distributed storytelling. We finish with an overview of Toontown's server architecture and present our nothing-but-net strategy for downloading a full-featured 3D online game.
The evolution of US state government home pages from 1997 to 2002
Authors: Terry Ryan, Richard H. G. Field, Lorne Olfman
Venue: International Journal of Human-Computer Studies (2003)

We examined the home pages of the 50 US states over the years 1997-2002 to discover the dimensions underlying people's perceptions of state government home pages, to observe how those dimensions have changed over the years, to identify different types of state home pages, and to see how these types have changed. We found that three primary dimensions explain the variation in perceptions of home pages. These are the layout of the page, its navigation support, and its information density. Over the years, variation in navigation support declined and variation in information density increased. We discovered that four types of state government home page have existed continuously from 1997 to 2001. These are the 'Long List of Text Links', the 'Simple Rectangle', the 'Short L', and the 'High Density/Long L'. To this taxonomy, two other page types can be added: the 'Portal' page and the 'Boxes' page. The taxonomy we have identified allows for a better understanding of the design of US state home pages, and may generalize to other categories of home pages.
An Example of CSCLIP Delivery and Research Technologies with Some Preliminary Findings from the Field
Authors: Richard E. Potter, Pierre A. Balthazard
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

This paper presents research based on the development and use of two CSCLIP technologiespresently used in university settings that are also useful in advancing CSCLIP research. The tools specifically deliver rich CSCLIP experiential learning, particularly affective behavioral learning dealing with group communication and dynamics, motivation and attitude, communication skills, information exchange. We describe these tools and their theoretical bases and then present an overview of a study that compares their performance with their non-computer supported counterpart.
The Future of Web Services
Authors: N. J. Davies, D. Fensel, M. Richardson
Venue: BT Technology Journal (2004)

Much of the Web's success can be attributed to its simplicity. It offers a straightforward means by which static information could be published and interconnected on a global basis. The Web Services initiative effectively adds computational objects to the static information of yesterday's Web and as such offers a distributed services capability over a network. Web Services have the potential to create new paradigms for both the delivery of software capabilities and the models by which networked enterprises will trade.Today's Web Services technology, useful though it is, will be enhanced over the next 2&frac25; years by the harnessing of Semantic Web technology to deliver a step change in capability. Web Services provide an easy way to make existing (or indeed new) components available to applications via the Internet. However, currently, Web Services are essentially described using semi-structured natural language mechanisms, which means that considerable human intervention is needed to find and combine Web Services into an end application.The Semantic Web will enable the accessing of Web resources by semantic content rather than just by keywords. Resources (in this case Web Services) are defined in such a way that they can be automatically &lsquo;understood&rsquo; and processed by machine. This will enable the realisation of Semantic Web Services, involving the automation of service discovery, acquisition, composition and monitoring. Software agents will be able automatically to create new services from already published services, with potentially huge implications for models of eBusiness.Having identified limitations in current Web Services technology, this paper will survey existing research in Semantic Web Services, most notably USA's DAML-S initiative and the European WSMF work, and describe BT's research into creating a set of tools to support next-generation Semantic Web Services.
Ideology and pedagogy: the uses of and justifications for computers and the internet in elementary schools
Authors: Scott Adam Webber
Venue:  (2003)

Based on six months of fieldwork in two elementary schools, I examined the ways that educators within the system of schooling make use of computers and the Internet and then justify this use. Taking a critical approach to the study of communication and culture and based on participant observation and in-depth, open-ended interviews with teachers, principals, and district officials, I explored the ways that these educators, when making decisions regarding the use of technology, rely mainly on ideological justifications related to the perceived importance of technology in society rather than on either the potential pedagogical usefulness of the technology or their own experience seeing the often limited benefits of such technology in a school setting. The school-based use of computers and the Internet is justified mainly either as providing increased student effectiveness in the future or as required for students' future success and even survival in a technology-heavy society. Students are being trained, as early as elementary school, to prepare for high-tech careers, to possess specific technology-related skills, and with the belief that these skills guarantee them a successful future (meaning a high paying job). This may not be the case, however. My work is a critique not only of the current uses of computers and the Internet and the justifications on which this use is based, but overall can be seen adding to the voices critical of a notion that use of technology (and technology itself) is reflective of progress. My major contention is that the perceived importance of computers and other Information and Communication Technologies (ICTs) and suggestions that they must necessarily appear in curriculum plans and budget proposals is being driven not solely or even primarily by pedagogy or by best practices in schools, but by the ideology surrounding the importance of technology in society, the perceived connection between things technological and notions of progress, and the belief that computer and Internet skills will be critical to the future success of the 10-year-olds at Harper and Lincoln elementary schools.
Neuroanatomical database of normal Japanese brains
Authors: Kazunori Sato, Yasuyuki Taki, Hiroshi Fukuda, Ryuta Kawashima
Venue: Neural Networks (2003)

To develop a high-resolution in vivo human neuroanatomy database for Japanese brains, a data set on 1547 normal subjects between the ages of 16 and 79 years has been collected. First, we determined individual reference brains of normal Japanese for each age and gender group. We found there exists cross-generational changes in brain shape, that is, the young generation has a shorter and wider brain than the older generation. Second, we determined the effect of aging on the volume of gray matter and white matter by voxel based morphometry. A significant negative correlation between the gray matter volume and age was observed. We assume that this kind of database is quite useful to investigators who are engaged in basic neuroscience, clinical diagnostics and evaluation of neuropsychiatric disorders in patients.
Control structures for multi-machine multi-converter systems with upstream coupling
Authors: A. Bouscayrol, B. Davat, B. de Fornel, B. François, J. P. Hautier, F. Meibody-Tabar, E. Monmasson, M. Pietrzak-David, H. Razik, E. Semail, F. Benkhoris
Venue: Mathematics and Computers in Simulation (2003)

A multi-machine multi-converter system formalism has been proposed to describe systems composed of several electrical machines and converters. This description points out coupling elements, which have to distribute energy. Control structures have already been proposed for systems with downstream coupling. This paper is focused on control structures for systems with upstream coupling. Several solutions can be found by moving control blocks.
Analysis of policy management models and specification languages
Authors: Issam Aib, Nazim Agoulmine, Mauro Sergio Fonseca, Guy Pujolle
Venue: Network control and engineering for Qos, security and mobility II (2003)

In this work, we will focus on the work undertaken in the specification of policies, the different notations developed, and how policies are deployed within a managed system. We will motivate, analyze, and classify all major existing policy notations through several criteria and try to consider the consistent merging of their strengths into a more appropriate framework. We also propose a set of enhancing features to existing policy specification notions namely domain membership rules, role compatibility rules, and light events. The work ends by an enumeration of the set of features which a policy specification language needs to model in order to facilitate the process of implementing adaptive Quality of Service management and rapid deployment of customized services.
Metadata-based modeling of information resources on the Web
Authors: S. Ayse Özel, I. Sengör Altingövde, Özgür Ulusoy, Gültekin Özsoyoǧlu, Z. Meral Özsoyoǧlu
Venue: Journal of the American Society for Information Science and Technology (2004)

This paper deals with the problem of modeling Web information resources using expert knowledge and personalized user information for improved Web searching capabilities. We propose a "Web information space" model, which is composed of Web-based information resources (HTML/XML [Hypertext Markup Language/Extensible Markup Language] documents on the Web), expert advice repositories (domain-expert-specified metadata for information resources), and personalized information about users (captured as user profiles that indicate users' preferences about experts as well as users' knowledge about topics).Expert advice, the heart of the Web information space model, is specified using topics and relationships among topics (called metalinks), along the lines of the recently proposed topic maps. Topics and metalinks constitute metadata that describe the contents of the underlying HTML/XML Web resources. The metadata specification process is semiautomated, and it exploits XML DTDs (Document Type Definition) to allow domain-expert guided mapping of DTD elements to topics and metalinks. The expert advice is stored in an object-relational database management system (DBMS).To demonstrate the practicality and usability of the proposed Web information space model, we created a prototype expert advice repository of more than one million topics/metalinks for DBLP (Database and Logic Programming) Bibliography data set. We also present a query interface that provides sophisticated querying facilities for DBLP Bibliography resources using the expert advice repository.
An efficient two-dimensional compaction algorithm for VLSI symbolic layout
Authors: Shao-Jun Wei, Jacques Leroy, Raymond Crappe
Venue: Proceedings of the conference on European design automation (1990)

The 2-dimensional compaction problem for VLSI symbolic layout is considered. Through carefully arranging the constraints among the elements which are represented as rectangles and the compaction strategies including the basic 2-dimensional compaction and the jog, the goal to compact the layout so that its bounding rectangle has a minimum or an approximately minimum area, is achieved. A systematical search method is recommended to find the proper jog points on the wires. A reversed compaction is used to optimize the compacted result. The procedure of designers' work is fully considered in order to accelerate the compacting process.
Minimization of Crosstalk Noise, Delay and Power Using a Modi.ed Bus Invert Technique
Authors: Matheos Lampropoulos, Bashir M. Al-Hashimi, Paul Rosinger
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Previously reported bus encoding approaches reduce crosstalk delay but they ignore the effects of inductive coupling between the bus lines, i.e. crosstalk noise. Aiming to solve this issue, this paper presents a modified bus-invert technique which minimizes crosstalk noise, as well as delay and power, at the expense of a small area overhead.
The Number of m-ary Search Trees on n Keys
Authors: James Allen Fill, Robert P. Dobrow
Venue: Combinatorics, Probability and Computing (1997)

Problems associated with m-ary trees have been studied by computer scientists and combinatorialists. It is well known that a simple generalization of the Catalan numbers counts the number of m-ary trees on n nodes. In this paper we consider &tau;m, n, the number of m-ary search trees on n keys, a quantity that arises in studying the space of m-ary search trees under the uniform probability model. We prove an exact formula for &tau;m, n, both by analytic and by combinatorial means. We use uniform local approximations for sums of i.i.d. random variables to study the asymptotic development of &tau;m, n for fixed m as n&rarr;&infin;.
Teaching IT in secondary education through problem-based learning could be really beneficial
Authors: Georgouli Ekaterini, Bakoyannis Spyros, Giannakoulias Panagiotis
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

This article attempts to stress the need for extended research on the use of constructivist's elements for the teaching of Information Technology in Secondary Education. In our case study, we tried to draw conclusions by questioning adolescents for their Problem-Based Learning experience during a three-month Internet-Programming course.
Distributed recovery with K-optimistic logging
Authors: Om P. Damani, Yi-Min Wang, Vijay K. Garg
Venue: Journal of Parallel and Distributed Computing (2003)

Fault-tolerance techniques based on checkpointing and message logging have been increasingly used in real-world applications to reduce service down-time. Most industrial applications have chosen pessimistic logging because it allows fast and localized recovery. The price that they must pay, however, is the high failure-free overhead. In this paper, we introduce the concept of K-optimistic logging where K is the degree of optimism that can be used to fine-tune the trade-off between failure-free overhead and recovery efficiency. Traditional pessimistic logging and optimistic logging then become the two extremes in the entire spectrum spanned by K-optimistic logging. Our results generalize several previously known protocols.Our approach is to prove that only dependencies on those states that may be lost upon a failure need to be tracked on-line, and so transitive dependency tracking can be performed with a variable-size vector. The size of the vector piggy-backed on a message then indicates the number of processes whose failures may revoke the message, and K corresponds to the upper bound on the vector size. Furthermore, the parameter K is dynamically tunable in response to changing system characteristics.
MOVE CLICK MOVE: creating an animation DVD
Authors: Deanna Morse
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

The award winning MOVE-CLICK-MOVE DVD has an interface that is "whimsical" and playful. Aimed at educators and students of animation, the DVD is a retrospective of the work of educator and award wining independent filmmaker/animator Deanna Morse. This presentation will consider the challenges and benefits of using the features specific to DVD technology (multi-angles, non-linear menu access, etc.) to illustrate animation techniques and approaches. There will be discussion of the production process, especially user interface design. Sample content from the DVD will illustrate how the DVD is used in the classroom setting to introduce students to basic techniques of animation. A primary goal of the project is to demystify the animation process. The MOVE-CLICK-MOVE DVD shows viewers that anyone can animate, using simple tools, if they just have the patience.
Shared interactive video for teleconferencing
Authors: Chunyuan Liao, Qiong Liu, Don Kimber, Patrick Chiu, Jonathan Foote, Lynn Wilcox
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We present a system that allows remote and local participants to control devices in a meeting environment using mouse or pen based gestures "through" video windows. Unlike state-of-the-art device control interfaces that require interaction with text commands, buttons, or other artificial symbols, our approach allows users to interact with devices through live video of the environment. This naturally extends our video supported pan/tilt/zoom (PTZ) camera control system, by allowing gestures in video windows to control not only PTZ cameras, but also other devices visible in video images. For example, an authorized meeting participant can show a presentation on a screen by dragging the file on a personal laptop and dropping it on the video image of the presentation screen. This paper presents the system architecture, implementation tradeoffs, and various meeting control scenarios.
Is Internet-Speed Software Development Different?
Authors: Richard Baskerville, Balasubramaniam Ramesh, Linda Levine, Jan Pries-Heje, Sandra Slaughter
Venue: IEEE Software (2003)

In a multiphase study conducted from 2000 to 2002, the authors examined the relationships between Internet-speed software development practices and agile and traditional development principles, and compared the two sets of principles. They found some overlap between traditional software development principles and agile principles but also some important differences for example, traditional development stresses a formal, controlled environment whereas agile development promotes an informal, collaborative environment. Moreover, although some Internet-speed development practices seem similar to traditional software development practices, their configurations and deployment are more closely aligned to agile development principles.
Evaluating Refined Queries in Top-k Retrieval Systems
Authors: Kaushik Chakrabarti, Michael Ortega-Binderberger, Sharad Mehrotra, Kriengkrai Porkaew
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--In many applications, users specify target values for certain attributes/features without requiring exact matches to these values in return. Instead, the result is typically a ranked list of ¿top k¿ objects that best match the specified feature values. User subjectivity is an important aspect of such queries, i.e., which objects are relevant to the user and which are not depends on the perception of the user. Due to the subjective nature of top-k queries, the answers returned by the system to an user query often do not satisfy the users need right away, either because the weights and the distance functions associated with the features do not accurately capture the users perception or because the specified target values do not fully capture her information need or both. In such cases, the user would like to refine the query and resubmit it in order to get back a better set of answers. While there has been a lot of research on query refinement models, there is no work that we are aware of on supporting refinement of top-k queries efficiently in a database system. Done naively, each ¿refined¿ query can be treated as a ¿starting¿ query and evaluated from scratch. This paper explores alternative approaches that significantly improve the cost of evaluating refined queries by exploiting the observation that the refined queries are not modified drastically from one iteration to another. Our experiments over a real-life multimedia data set show that the proposed techniques save more than 80 percent of the execution cost of refined queries over the naive approach and is more than an order of magnitude faster than a simple sequential scan.
Nantonac collaborative filtering: recommendation based on order responses
Authors: Toshihiro Kamishima
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

A recommender system suggests the items expected to be preferred by the users. Recommender systems use collaborative filtering to recommend items by summarizing the preferences of people who have tendencies similar to the user preference. Traditionally, the degree of preference is represented by a scale, for example, one that ranges from one to five. This type of measuring technique is called the semantic differential (SD) method. Web adopted the ranking method, however, rather than the SD method, since the SD method is intrinsically not suited for representing individual preferences. In the ranking method, the preferences are represented by orders, which are sorted item sequences according to the users' preferences. We here propose some methods to recommed items based on these order responses, and carry out the comparison experiments of these methods.
Datapath optimization using feedback
Authors: David W. Knapp
Venue: Proceedings of the conference on European design automation (1991)

This paper describes recent experience with Fasolt, a software tool that automatically optimizes a register-level datapath. Fasolt uses a model of layout to drive the choice of optimizing transformations at the levels of scheduling and allocation; hence it is a feedback-driven optimization system. In choosing transformations, Fasolt takes placement and wiring into account in a way that has not been demonstrated in any other high-level synthesis system. Fasolt is also cyclic in that high-level transformations trigger changes at lower levels, which after analysis trigger further high-level changes. This implementation of Fasolt has an expanded set of transformation rules, timing-driven and area-driven transformations, and improved layout modeling capability. This paper presents experimental results on three basic test cases and two major variations on the layout software.