ppxscal/embedding_network huggingface dataset:
Charisma: orchestrating migratable parallel objects
Authors: Chao Huang, Laxmikant Kale
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

The parallel programming paradigm based on migratable objects, as embodied in Charm++, improves programmer productivity by automating resource management. The programmer decomposes an application into a large number of parallel objects, while an intelligent run-time system assigns those objects to processors. It migrates objects among processors to effect dynamic load balance and communication optimizations. In addition, having multiple sets of objects representing distinct computations leads to improved modularity and performance. However, for complex applications involving many sets of objects, Charm++'s programming model tends to obscure the global flow of control in a parallel program: One must look at the code of multiple objects to discern how the multiple sets of objects are orchestrated in a given application. In this paper, we present Charisma, an orchestration notation that allows expression of Charm++ functionality without fragmenting the expression of control flow. Charisma separates expression of parallelism, including control flow and macro data-flow, from sequential components of the program. The sequential components only consume and publish data. Charisma expression of multiple patterns of communication among message-driven objects. A compiler generates Charm++ communication and synchronization code via static dependence analysis. As Charisma out puts standard Charm++ code, the functionality and performance benefits of the adaptive run-time system, such as automatic load balancing, are retained. In the paper, we show that Charisma programs scale up to 1024 processors without introducing undue overhead.
SIMPLE in practice [educational software]
Authors: M. Hagler, K. C. Wetzel, W. M. Marcy
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

SIMPLE makes it easy to combine existing software to structure and deploy complex interactive learning environments for students. A unique feature of SIMPLE environments is that the interactions of the learner with the environment can be automatically and unobtrusively logged into a file that the instructor can examine for progress and problems on the part of the learner. The instructor can even play back the log file on screen to reconstruct a particular learning session. The paper presents actual experience with SIMPLE environments used by all students in a first course in electronics for electrical engineers at Texas Tech University and some students in a basic course in mathematics at Amarillo College.
A comparison of alternative parse tree paths for labeling semantic roles
Authors: Reid Swanson, Andrew S. Gordon
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

The integration of sophisticated inference-based techniques into natural language processing applications first requires a reliable method of encoding the predicate-argument structure of the propositional content of text. Recent statistical approaches to automated predicate-argument annotation have utilized parse tree paths as predictive features, which encode the path between a verb predicate and a node in the parse tree that governs its argument. In this paper, we explore a number of alternatives for how these parse tree paths are encoded, focusing on the difference between automatically generated constituency parses and dependency parses. After describing five alternatives for encoding parse tree paths, we investigate how well each can be aligned with the argument substrings in annotated text corpora, their relative precision and recall performance, and their comparative learning curves. Results indicate that constituency parsers produce parse tree paths that can more easily be aligned to argument substrings, perform better in precision and recall, and have more favorable learning curves than those produced by a dependency parser.
Context-Sensitive Security Framework for Pervasive Environments
Authors: Charles-Eric Pigeot, Yann Gripay, Marian Scuturici, Jean-Marc Pierson
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Pervasive systems enable us to have an overview of what digital environments will look like in the future. Opportu- nities given by pervasive systems, both in terms of applica- tions and services to the user are manifold and very promis- ing. From the user point of view, privacy and security of her personal data is a real issue, which must be addressed to make pervasive systems accepted. A wide adoption of per- vasive systems can not be possible without an integrated approach to security. We propose a model of security and privacy for pervasive environments, integrated with an ar- chitecture, namely PerSE, in which privacy is a main con- cern and is at the core of the conception.
Shadow Box: an interactive learning toy for children
Authors: Ja-Young Sung, Aaron Levisohn, Ji-won Song, Ben Tomassetti, Ali Mazalek
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

The Shadow Box is a tangible computing project that exploits visual association and auditory clues to teach children the representational relationship between words and their meanings. The Shadow Box contains three major components: the main box, picture blocks and word blocks. The Shadow Box activates when a block or a matching pair of blocks is placed inside. The box prompts children to find matching blocks and combine them together. When children successfully combine the right word and picture, the box rewards them with an animated video as if they had made the objects come alive. An informal study shows that children responded positively to the concept of the box. They played with it for a length of time and engaged in a collaborative learning process with other children.
Dynamic Workflow Control with Global States Monitoring
Authors: Marek Tudruj, D. Kopanski, J. Borkowski
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

This paper shows how to organize dynamic workflow execution control based on predicates computed on internal global states of activities. Such paradigm has been implemented using special control processes called synchronizers. The proposed ideas extend the ordinary task and application workflow schemes by providing dynamic functional features. The proposed control has been provided in a graphical parallel program design environment, which includes a flexible infrastructure for designing advanced cluster or Grid level distributed programs. The paper presents a description of the proposed Grid programming environment and explains involved dynamic workflow implementation features.
Knowledge Management for Multi- and Crossdisciplinary Research Projects
Authors: Pieter J. Beers, Pieter W. G. Bots
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Theories on knowledge management (KM) have matured to include organizational practices, information systems and knowledge processes. Sharing of knowledge between actors having different (scientific) perspectives has received relatively little attention, whereas this is especially relevant to large-scale multidisciplinary research projects. In such projects, the actors are academics, the knowledge content is diverse and shaped (and often confined) by scientific disciplines, whereas strategies to cross disciplinary boundaries seem to be lacking. These projects face the challenge of overcoming disciplinary and theoretical differences in order to reap the benefits of crossdisciplinary inquiry. This minitrack focuses on the management of knowledge within large-scale multidisciplinary and crossdisciplinary research projects.
Survivable network design under optimal and heuristic interdiction scenarios
Authors: J. Cole. Smith, Churlzu Lim, Fransisca Sudargho
Venue: Journal of Global Optimization (2007)

We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular, we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first to construct a network and transmit an initial set of flows through the network. The enemy acts next to destroy a set of constructed arcs in the designer's network, and the designer acts last to transmit a final set of flows in the network. Most studies of this nature assume that the enemy will act optimally; however, in real-world scenarios one cannot necessarily assume rationality on the part of the enemy. Hence, we prescribe optimal network design algorithms for three different profiles of enemy action: an enemy destroying arcs based on capacities, based on initial flows, or acting optimally to minimize our maximum profits obtained from transmitting flows.
Short period teaching-learning cycles
Authors: M. B. de la Barra
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

A model for managing the processes involved in the teaching of mathematics to engineering students is introduced. Based on small units of content, key processes such as motivation, delivery of the lesson, study, evaluation of learning, correction, reinforcement and projection are successively developed constituting short period teaching-learning cycles that require no longer than a teaching period. Numerous advantages concerning quality, efficiency and productivity are reported. The variability in the learning performance is reduced and the average mark is increased as predicted by Bloom's (1976) theory of learning. Finally the use of short cycles allows us to set up a continuous improvement approach and study the results of any adopted didactic strategy.
Method of creating web services from web applications
Authors: Yusuke Nakano, Yoji Yamato, Michiharu Takemoto, Hiroshi Sunaga
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Web 2.0 is becoming popular among people who are interested in creating or providing more useful services on the Internet. Mashup is one of the most important methods in Web 2.0, which creates services by combining components on the Internet, such as Web services. Mashup enables many people to create various services easily and use services created by many other people. To create such a variety of useful services, we need a large number of components, but there are not so many components available on the Internet yet. We describe an effective method of creating wrappers that make Web applications usable as Web services. The method extracts important segments, such as search results of a hotel search application, from an HTML document generated by the web application and generates extraction rules for the wrappers. This extraction is performed by using the characteristic depth of each tag in the HTML document.
Safe use of X window system protocol across a firewall
Authors: Brian L. Kahn
Venue: Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5 (1995)

This paper describes a method for safe use of the X window system protocol across a firewall. The approach uses an agent in the communications stream to enforce an access control policy. Topics covered include risks, policy, implementation, and a summary of prototype efforts. Results can be applied to other distributed or client/server applications.
Minitrack: HCI Issues in Healthcare IT
Authors: Ann Fruhling, E. Vance Wilson
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In order to comply with changing regulations and to improve support for office staff, clinicians, and patients, healthcare organizations worldwide are currently undertaking massive transformations and additions to their IT infrastructure. History suggests that the success of the healthcare applications that emerge from this process will depend to a large degree on the ability of people to use them effectively and efficiently. Human-computer interaction (HCI) research can provide valuable guidance to improve the usability of healthcare IT. Potential exists for HCI researchers to apply existing knowledge to improving healthcare IT as well as to formulate new theories and practices specific to the healthcare context. Our goal in initiating this minitrack is to provide a focused outlet at HICSS for HCI researchers in healthcare domains to share and discuss the results of their work.
Exact and Speedy Computation of Legendre Moments on Binary Images
Authors: G. A. Papakostas, E. G. Karakasis, D. E. Koulouriotis
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

A novel algorithm for the computation of Legendre moments, which ensures high accuracy and low computation time, is presented in this paper. The presented method exploits the compression capabilities, the image block representation exhibits. By describing the images with a set of homogenous blocks, keeping only the upper left and down right pixel coordinates, the long time consuming formulas used to compute Legendre moments, can be converted to more efficient ones. A typical comparison of the proposed method with the conventional one concludes to very impressive and promising results.
A novel orthogonal NMF-based belief compression for POMDPs
Authors: Xin Li, William K. W. Cheung, Jiming Liu, Zhili Wu
Venue: Proceedings of the 24th international conference on Machine learning (2007)

High dimensionality of POMDP's belief state space is one major cause that makes the underlying optimal policy computation intractable. Belief compression refers to the methodology that projects the belief state space to a low-dimensional one to alleviate the problem. In this paper, we propose a novel orthogonal non-negative matrix factorization (O-NMF) for the projection. The proposed O-NMF not only factors the belief state space by minimizing the reconstruction error, but also allows the compressed POMDP formulation to be efficiently computed (due to its orthogonality) in a value-directed manner so that the value function will take same values for corresponding belief states in the original and compressed state spaces. We have tested the proposed approach using a number of benchmark problems and the empirical results confirms its effectiveness in achieving substantial computational cost saving in policy computation.
The social affordances of computer-supported collaborative learning environments
Authors: K. Kreijns
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Field observations report that contemporary computer-supported collaborative learning (CSCL) environments do not completely fulfill the expectations of both educators and learners regarding their potential for supporting interactive learning and collaborative knowledge construction. This raises questions amongst educators whether CSCL environments do indeed provide genuine opportunities for learning processes that rely on social interaction. The authors believe that one of the factors that may explain this is the generally accepted assumption that social interaction can be taken for granted. Social interaction in CSCL environments can no more be taken for granted than it can in face-to-face settings. A theoretical framework is presented proposing the support of social interaction by embedding certain properties in the CSCL environment that act as social contextual facilitators relevant for the learner's social interaction. They refer to these properties as social affordances. A group awareness widget (GAW) is a software tool providing the learner with group awareness on the others in different contexts while at the same time enabling the learner to communicate with them. The authors hypothesize that GAWs provoke social affordances and formulate guidelines for designing GAWs.
A Non-conservative Approach to Software Pattern Detection
Authors: Niklas Pettersson, Welf Lowe
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

Pattern detection in software systems is one of several collaborating techniques for reverse engineering and program comprehension. Unfortunately, it is a hard problem in both theory and practice. A recent method to increase efficiency is based on conservatively filtering edges of a software system's structure graph, i.e., only removing edges guaranteed not to be part of any pattern instance. This leads to planar graphs in many cases allowing for efficient matching algorithms. This paper shows the feasibility of a non-conservative filtering approach, where even edges possibly part of a pattern instance can be removed to reach planarity. We show theoretically that not only decreased accuracy is possible due to non-conservative filtering, but also increased accuracy. We also perform an experimental evaluation supporting this statement. The paper complements the safe filtering method and together the two approaches allow for efficient pattern detection for all systems and patterns.
Analytical and simulation results for the general coalescent
Authors: Simon Tavare
Venue:  (2006)

In this dissertation, I study aspects of coalescent theory in the population genetics setting. The thesis focuses on five different yet interrelated problems. The first presents a Bayesian approach for inferring the expansion time of a population. Both analytical and simulation approaches are described. The second problem concerns the age of an allele observed at a given frequency in a sample, and the age of an allele given its frequency and additional information about SNPs in the region. New representations for the distribution of the age are given, as are novel simulation methods. The third problem is motivated by the age of alleles question, in cases where the mutation rate is so high that simulation of the relevant distributions is impossible. Limit distributions, in the limit of large mutation rate and/or expansion rate, are given. The results are applied to estimate the age of the Delta F508 mutation in cystic fibrosis. The fourth problem provides a Bayesian approach for inferring the insertion time of a transposable element, given information about SNPs and haplotyps in the region. The approach is illustrated with data from the L1 insertion elements in man. The final problem addresses the joint behavior of the ages of pairs of mutations. The limiting case of large population size is also studied, thereby extending earlier results in the literature. The methods are applied to study the common apoE mutations in man.
Towards a DL-Based Semantic User Model for Web Personalization
Authors: Yanwu Yang, Marie-Aude Aufaure, Christophe Claramunt
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

User models play a kernel role in recommender and web personalization systems, especially in an information-rich world. In a knowledge-based user interface environment, a semantic user modeling component serves as important inputs for personalization human-computer interactions and adaptive strategies for interfaces. This paper proposes a semantic user model integrated into a web personalization system which that is based on an expressive description logic language. The user model employs both static and dynamic user information to predict user features relevant to a given application domain. The logic-based user-modeling framework acts as a support for a semantic Web personalization system to tailor information services to the user. Our user-modeling approach is exemplarily applied to the tourism domain, to describe user information and identify user's classification.
A COTS-Based Approach for Evolving legacy Systems
Authors: Gerald Kotonya, John Hutchinson
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

The potential benefits of evolving legacy systems to COTS-based component architectures are well documented These include rapid non-intrusive modernization through the use of COTS sojiware components, and signzQicantly reduced post maintenance costs. However, the hype has not translated to a corresponding increase in the migration of legacy systems to COTS-based architectures. There are two main reasons for this. First, many legacy systems provide adequate core functionality. For this type of legacy system, replacement may not be the most cost-effective solution. Secondly, there is a general lack of scalable methods and tools that support COTS-based evolution of legacy systems. This paper describes our experience in using a component-based method to evolve a legacy system.
A practical approach for enabling online analysis of event streams
Authors: Sebastian Salvucci, Mariano Cilia, Alejandro Buchmann
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

The event-based paradigm has gained interest as a solution for integrating large-scale distributed and loosely coupled systems. It also has been propelled by the growth of event-based applications like ambient intelligence, utility monitoring, event-driven supply chain management (eSCM), multi-player games, etc. The pub/sub paradigm is particularly relevant for implementing these types of applications. The core of a pub/sub system is the notification service and there are several commercial products, open source and research projects that implement it. The nature of notification services (distribution, scale, large amount of concurrent messages processed) as well as the diversity of their implementations, make their run time analysis difficult. The few existing solutions that address this problem are mainly proprietary and focus on single aspects of the behavior. A general solution would significantly support research, development and tuning of these services. This paper introduces a notification service-independent analysis framework that enables online analysis of their behavior based on streamed observations, flexibly defined metrics and visual representations thereof.
Efficient Simulation of Large-Scale P2P Networks: Compact Data Structures
Authors: Andreas Binzenhofer, Tobias Hossfeld, Gerald Kunzmann, Kolja Eger
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

One of the most important design goals of current Peer-to- Peer (p2p) technology is to be able to offer its service to an arbitrary large number of users. Discrete event simulation is often applied to quantitatively and qualitatively evaluate the performance and scalability of such systems before they are deployed. However, the number of users, processes and events which can be simulated is limited by both the central memory and the time available. In this paper we present compact data structures and event design algorithms, which are intended to be a further step towards efficient simulation of large scale p2p systems. In particular, we give guidelines on how to increase the number of peers which can be simulated and show how to find a good trade-off between computational time and memory consumption in large scale p2p simulation.