ppxscal/embedding_network huggingface dataset:
Educating via entertainment media: the Sesame Workshop approach
Authors: Glenda L. Revelle
Venue: Computers in Entertainment (CIE) (2003)

Sesame Workshop was founded 35 years ago to investigate whether entertainment media could be used to educate children. At that time the medium in question was television. As the Sesame Street television show prepares to celebrate its 35th year on the air, the television programming schedule now includes a wide variety of other educational programming for young children, and researchers are in almost universal agreement that television can be used successfully for educational purposes. In recent years, the Workshop has faced the same challenge with a variety of interactive entertainment media (including videogames, DVD, and interactive television); i.e., these media all might have potential for educating children, but neither the platforms themselves nor the typical programming for these media are being planned with any particular thought toward education. This paper describes how the Sesame Street "experiment" has been continued and extended, by adapting interactive media platforms designed for entertainment so that they can be used to deliver educational experiences to young children. The paper also outlines Sesame Workshop's educational philosophy and approach, as applied in the interactive arena, and identifies some of the challenges and solutions in designing interfaces and interactive educational experiences that can be used and enjoyed by preschool-age children. Two specific research projects are described as examples of this approach: one details the development of an adapted software interface to make console videogame systems accessible to young children and the other evaluates a new approach to creating interactive television programming for young children on a DVD platform.
A unifying approach to the security of distributed and multi-threaded programs
Authors: Heiko Mantel, Andrei Sabelfeld
Venue: Journal of Computer Security (2003)

The security of computation at the level of a specific programming language and the security of complex systems at a more abstract level are two major areas of current security research. With the objective to integrate the two, this article proposes an adequate translation of a timing-sensitive security property for simple multi-threaded programs into a more general security framework. Soundness and completeness of the translation guarantee that the trace-based specification of the translation of a multi-threaded program is secure if and only if the original program is secure. Finally, the translation is extended to a distributed setting, and it is demonstrated how to derive global security of the overall system from local security of each thread. The translation is presented as a two-step process where the first step is independent from the concrete programming language.
Computer-augmented learning programs for college instructors
Authors: Frederick H. Bell
Venue: ACM SIGCUE Outlook (1975)

A regional network of five small colleges supported by a university timesharing computer system provided the experimental setting for a teacher education program in educational applications of computers. The conclusions resulted from a three-year project to develop, implement, and evaluate a prototype program to educate college professors in techniques for using computers in their classrooms. The findings indicate that system reliability (as defined by the user) and significant professional assistance in computer-related curriculum development are key factors for the success of a regional program.
Crawling for Domain-Speci.c Hidden Web Resources
Authors: André Bergholz, Boris Chidlovskii
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

The Hidden Web, the part of the Web that remains unavailable for standard crawlers, has become an important research topic during recent years. Its size is estimated to 400 to 500 times larger than that of the Publicly Indexable Web (PIW). Furthermore, the information on the Hidden Web is assumed to be more structured, because it is usually stored in databases. In this paper we describe a crawler which starting from the PIW finds entry points into the Hidden Web. The crawler is domain-specific and is initialized with pre-classified documents and relevant keywords. We describe our approach to the automatic identification of Hidden Web resources among encountered HTML forms. We conduct a series of experiments using thetop-level categories in the Google Directory and report our analysis of the discovered Hidden Web resources.
Visualizing the Expertise Space
Authors: Zan Huang, Hsinchun Chen, Fei Guo, Jennifer Jie Xu, Soushan Wu, Wun-Hwa Chen
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Expertise management systems are being widely adopted in organizations to manage tacit knowledge embedded in employees' heads. These systems have successfully applied many information technologies developed in fields such as information retrieval and document management to support expertise information collection, processing, and distribution. In this paper, we investigate the potentials of applying visualization techniques to support exploration of an expertise space. We implemented two widely applied dimensionality reduction visualization techniques, the self-organizing map and multidimensional scaling, to generate expert map and expertise field map visualizations based on an expertise data set. Our proposed approach is generic for automatic mapping of expertise space of an organization, research field, scientific domain, etc. Our initial analysis on the visualization results indicated that the expert map and expertise field map captured useful underlying structures of the expertise space and had the potential to support more efficient and effective expertise information searching and browsing.
Teaching computation to undergraduate scientists
Authors: Daniel T. Kaplan
Venue: ACM SIGCSE Bulletin (2004)

This paper describes the motivation and design of an introductory computational course for natural, physical, and social scientists.
Sink-to-sensors reliability in sensor networks
Authors: Seung-Jong Park, Raghupathy Sivakumar
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

The issue of relability, thus far, has not been addressed throughly to any extent in sensor networking research. To the best of our knowledge the first such work that focused on some aspect of reliable communication in sensor networks appeared only in [1]. In this paper, we focus on the problem of communication reliability from the sink to the sensors in a static network.
Differential Data Protection for Dynamic Distributed Applications
Authors: Patrick Widener, Karsten Schwan, Fabián E. Bustamante
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

We present a mechanism for providing differential dataprotection to publish/subscribe distributed systems, such asthose used in peer-to-peer computing, grid environments,and others. This mechanism, termed "security overlays",incorporates credential-based communication channel creation,subscription and extension. We describe a conceptualmodel of publish/subscribe services that is made concreteby our mechanism. We also present an application,Active Video Streams, whose reimplementation using securityoverlays allows it to react to high-level security policiesspecified in XML without significant performance lossor the necessity for embedding policy-specific code into theapplication.
An effective strategy for legacy systems evolution
Authors: Maseud Rahgozar, Farhad Oroumchian
Venue: Journal of Software Maintenance: Research and Practice (2003)

A large number of organizations depend on the business-critical information systems for their daily activities that have been developed over the last two decades or more. These systems are called Legacy Information Systems (LISs). They mostly run on old software and hardware technology tools and environments. They are hard to modify, expensive to maintain and difficult to integrate with new technology tools and programs. They need to be evolved into modern environments. The LIS modernization is a long outstanding problem of the IT community. This paper presents a classification of current approaches to this problem and suggests guidelines and a methodology for an optimal solution based on many years of professional experiences of the authors in this area. Parts of this methodology have been implemented and tested in many migration projects and they have proven to be effective. This approach optimizes the time, the human resources and the global costs and reduces the risk factors and side effects of renovation projects by developing migration tools once per platform.
Virtual memory on data diffusion architectures
Authors: Jorge Buenabad-Chávez, Henk L. Muller, Paul W. A. Stallard, David H. D. Warren
Venue: Parallel Computing (2003)

Data diffusion architectures (also known as cache only memory architectures) provide, a shared address space on top of distributed memory. Their distinctive feature is that data diffuses, or migrates and replicates, in main memory according to whichever processors are using the data. This requires an associative organisation of main memory, which decouples each address and its data item from any physical location. A data item can thus be placed and replicated where it is needed. Also, the physical address space does not have to be fixed and contiguous. It can be any set of addresses within the address range of the processors, possibly varying over time, provided it is smaller than the size of main memory. This flexibility is similar to that of a virtual address space, and offers new possibilities to organise a virtual memory system.We present an analysis of possible organisations of virtual memory on such architectures, and propose two main alternatives: traditional virtual memory (TVM) is organised around a fixed and contiguous physical address space using a traditional mapping; associative memory virtual memory (AMVM) is organised around a variable and non-contiguous physical address space using a simpler mapping.To evaluate TVM and AMVM, we extended a multiprocessor emulation of a data diffusion architecture to include part of the Mach operating system virtual memory. This extension implements TVM; a slightly modified version implements AMVM. On applications tested, AMVM shows a marginal performance gain over TVM. We argue that AMVM will offer greater advantages with higher degrees of parallelism or larger data sets.
An Enhanced Concurrency Control Scheme for Multidimensional Index Structures
Authors: Seok Il Song, Young Ho Kim, Jae Soo Yoo
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--In this paper, we propose an enhanced concurrency control algorithm that maximizes the concurrency of multidimensional index structures. The factors that deteriorate the concurrency of index structures are node splits and minimum bounding region (MBR) updates in multidimensional index structures. The properties of our concurrency control algorithm are as follows: First, to increase the concurrency by avoiding lock coupling during MBR updates, we propose the PLC (Partial Lock Coupling) technique. Second, a new MBR update method is proposed. It allows searchers to access nodes where MBR updates are being performed. Finally, our algorithm holds exclusive latches not during whole split time but only during physical node split time that occupies the small part of a whole split process. For performance evaluation, we implement the proposed concurrency control algorithm and one of the existing link technique-based algorithms on MIDAS-III that is a storage system of a BADA-IV DBMS. We show through various experiments that our proposed algorithm outperforms the existing algorithm in terms of throughput and response time. Also, we propose a recovery protocol for our proposed concurrency control algorithm. The recovery protocol is designed to assure high concurrency and fast recovery.
Acknowledgements
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2003)

Issue Acknowledgements Flash homepage design Alex Lieu, Jonny Rodriquez, Michael Borys 3-Pin Media Flash animation and sound effects Jay Popeski, Jeffrey Blyseth Axis Graphics Video recording John Michael Ferrari, Eric Huff Video and sound editing Eric Huff Copyediting and Proofreading Roma Simon, Irma Strolia, Cathy Georges Student volunteers Armen Aghaeian, Jessica Chavez Producer Newton Lee Also thanks to all authors, interviewees, reviewers, editorial board advisors, Mark Mandelbaum and the entire ACM staff for their support. 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
SPH simulations of time-dependent Poiseuille flow at low Reynolds numbers
Authors: Leonardo Di G. Sigalotti, Jaime Klapp, Eloy Sira, Yasmin Meleán, Anwar Hasmy
Venue: Journal of Computational Physics (2003)

A working Smoothed Particle Hydrodynamics (SPH) formalism for solving the equations of motion of a viscous fluid is presented. The method is based on a standard symmetrized SPH expression for the viscous forces, which involves only first-order derivatives of the kernel through a direct evaluation of the viscous stress tensor. Therefore, the interpolation can be performed using low-order kernels of compact support without compromising the accuracy and stability of the results. In principle, the scheme is suitable for treating compressible fluids with arbitrary shear and bulk viscosities. Here, we demonstrate that when it is combined with the pressure-gradient correction proposed by Morris et al., the method is also suitable for solving the Navier-Stokes equations for incompressible flows without any further assumptions. Simulations using the method show close agreement with the analytic series solutions for plane Poiseuille and Hagen-Poiseuille flows at very low Reynolds numbers. At least for these specific tests, the results obtained are essentially independent of employing either a cubic or a quintic spline kernel.
Modeling and verification of a class of real-time systems by the use of high level petri nets
Authors: George Hassapis, Dimitra Ananidou
Venue: Journal of Systems and Software (2003)

Homogeneous, shared memory multiprocessors that incorporate real-time operating systems constitute in many corporations the basic platforms for developing applications of plant monitoring and automation. In this work, a template model based on the High Level Petri Net (HLPN) formalism is proposed for this class of computers. Mapping functional and timing requirements of the application software to states of this model and searching for their existence in the reachability tree of the net can verify the satisfaction of these requirements. A state searching algorithm has been developed for the case of a shared memory multiprocessor in which there is a bus-based interconnection network supporting a single communication channel for the exchange of data among the CPUs, the common memory and the computer interfaces. This algorithm groups the infinite number of states of the HLPN to a number of finite regions, identifies the region, which the desired state belongs to, and checks for the existence of a path from the initial state that leads to this region. In order to demonstrate the use of the template in the modeling and verification of timing and functional specifications of a system of the considered class, the implementation of the automation functions of a chemical reactor by a VME-bus based multiprocessor with two CPUs and running under the control of the OS-9 operating system was studied. In this study the template model was used to create a specific for this application HLPN model. The response times of two automation functions were predicted by the use of this model and compared with those derived from the operating characteristics of the reactor.
Optimization of micro-controllers by partitioning
Authors: G. Tarroux, B. Rouzeyre, G. Sagnes
Venue: Proceedings of the conference on European design automation (1991)

In this paper, we present a new partitioning method for Finite State Machines (FSMs). The method is particularly well suited for &mu;-controller circuits. It consists in grouping the &mu;-instructions of the control graph into classes according to a compatibility property of the output values. Only one sequence of output values is then generated for all &mu;-instructions of a given class. The resulting structure is composed of three machines: a STATE machine which generates the next states, a COMMAND machine and a FILTER machine. The COMMAND outputs and the FILTER outputs are merged via a logical AND to obtain the final outputs. This structure leads to an area reduction of 34 % to 65 % for the examples presented.
XWebSOGO: an ontology language to describe and query web sources
Authors: Edna Ruckhaus, María-Esther Vidal
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

Ontologies play an important role in the Semantic Web. Currently, several Web ontology languages have been proposed and there has been a substantial effort towards the formalization of different knowledge domains. However, it is difficult to identify the ontologies for a specific domain and their annotated Web sources.XWebSOGO is a Web ontology language modeled after RDF and RDF Schema, that allows users to specify a domain in terms of its relevant entities' properties, the services that can be implemented on these entities, their query capabilities and the links that can connect them. In addition, XWebSOGO allows users to describe Web sources in terms of certain domain ontologies. Finally, XWebSOGO can be used to discover ontologies or Web sources that meet certain properties. XWebSOGOQL is a language used to query ontologies and annotated sources. An XWebSOGOQL query can be seen as a conjunctive query, where predicates are defined in terms of XWebSOGO basic concepts. In this paper, we define XWebSOGO and provide a formal definition of a query in XWebSOGOQL.
Beware of counting LOC
Authors: Phillip G. Armour
Venue: Communications of the ACM (2004)

Seeking a better method for estimating system size in an attempt to measure knowledge content.
Asymptotic analysis and simple approximation of the loss probability of the GIX/M/c/K queue
Authors: Bara Kim, Bong Dae Choi
Venue: Performance Evaluation (2003)

We consider the GIX/M/c/K queues with partial rejection or total rejection, and find an asymptotic behavior of loss probability of the GIX/M/c/K queue as K tends to infinity. The asymptotic loss probability is expressed only in terms of the roots of the characteristic equation and the boundary probabilities of the corresponding GIX/M/c queue. Numerical examples show that the asymptotic loss probability is a quite accurate approximation for the loss probability of the GIX/M/c/K queue even when the system capacity K is moderate.
The expressive power of urgent, lazy and busy-waiting actions in timed processes
Authors: Flavio Corradini, Dino Di Cola
Venue: Mathematical Structures in Computer Science (2003)

In this paper we show how the expressive power of a language for the description of timed processes strongly affects the discriminating power of urgent and patient actions. In a sense, it studies the interplay between syntax and semantics of time-critical systems.
A Case Study of Emergent and Intentional Organizational Change: Some Implications for Customer Relationship Management Success
Authors: Carl-Erik Wikström
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

The shift from a product-oriented business strategy to a customer-focused one has been a major change agent in companies recently. Many companies have invested heavily in technologies enabling a customer-focused relationship marketing strategy. However, there are mixed results as to how successful firms have been in implementing customer relationshipmanagement systems. The challenge of managing organizational change has been raised as a potential factor affecting the successful outcome of CRM efforts. Our argument is that the proposed relationship between CRM success and organizational change should be made more explicit in order to thoroughly investigate this challenge. Our paper contributes to this by presenting the results of an exploratory single case study. We identified several change events on different observational levels. Our findings suggest that to succeed, one should first identify both emergent and planned change processes. Then one could evaluate, whether change events - triggered by these processes - might effect one another in a way which could endanger the successful CRM implementation outcome.
Spin Squeezing Criterion with Local Unitary Invariance
Authors: A. R. Usha Devi, Xiaoguang Wang, B. C. Sanders
Venue: Quantum Information Processing (2003)

We propose a spin squeezing criterion for arbitrary multi-qubit states that is invariant under local unitary operations. We find that, for arbitrary pure two-qubit states, spin squeezing is equivalent to entanglement, and multi-qubit states are entangled if this new spin squeezing parameter is less than unity.PACS: 03.67.-a; 03.65.Ud
A Global Rule Induction Approach to Information Extraction
Authors: Jing Xiao, Tat-Seng Chua, Jimin Liu
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

The ability to extract desired pieces of information from natural language texts is an important task with a growing number of potential applications. This paper presents a novel pattern rule induction learning system, GRID, which emphasizes on utilizing global feature distribution in all of the training instances in order to make better decision on rule induction. GRID incorporates features at lexical, syntactical and semantic levels simultaneously. It induces rules by adopting a combination of top-down and bottom-up approaches. The features chosen in GRID are general and they were applied successfully to both semi-structured text and free text. Our experimental results on some publicly available webpage corpora and MUC-4 test set indicate that our approach is effective.
GWindows: robust stereo vision for gesture-based control of windows
Authors: Andrew Wilson, Nuria Oliver
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

Perceptual user interfaces promise modes of fluid computer-human interaction that complement the mouse and keyboard, and have been especially motivated in non-desktop scenarios, such as kiosks or smart rooms. Such interfaces, however, have been slow to see use for a variety of reasons, including the computational burden they impose, a lack of robustness outside the laboratory, unreasonable calibration demands, and a shortage of sufficiently compelling applications. We address these difficulties by using a fast stereo vision algorithm for recognizing hand positions and gestures. Our system uses two inexpensive video cameras to extract depth information. This depth information enhances automatic object detection and tracking robustness, and may also be used in applications. We demonstrate the algorithm in combination with speech recognition to perform several basic window management tasks, report on a user study probing the ease of using the system, and discuss the implications of such a system for future user interfaces.
Incentive Mechanisms in Dynamic Active Systems
Authors: D. A. Novikov, T. E. Shokhina
Venue: Automation and Remote Control (2003)

Consideration was given to the problem of incentives in the dynamic multiagent active system. The problem of design was solved, and coordination of the plans given by the principal to the agents was studied.