ppxscal/embedding_network huggingface dataset:
End-user strategy programming
Authors: Christoph Neumann, Ronald A. Metoyer, Margaret Burnett
Venue: Journal of Visual Languages and Computing (2009)

Rule-based programming systems can be fragile because they force the user to account for all logical alternatives. If an unconsidered case does arise during execution, program behavior falls through the cracks into unspecified behavior. We investigate rule-based, end-user strategy programming by introducing our Interactive Football Playbook-a domain specific, end-user programming environment to allow American football coaches to create animated football scenarios by associating strategy information with virtual football players. We address the problem of rule explosion through ''rule bending'' to support a minimalist, scaffolding-driven programming environment. Additionally, we introduce visual language representations for logical and sequential ''and'' to mitigate end-user confusion with the semantic meaning of these ''and'' constructs.
On solving large systems of polynomial equations appearing In discrete differential geometry
Authors: Thomas Wolf
Venue: ACM Communications in Computer Algebra (2009)

The poster describes methods that combined find all solutions of a very large overdetermined polynomial algebraic system for only up to 22 unknowns but with billions of equations all homogeneous of degree 8 with on average millions of terms each. This problem resulted from the classification of all integrable 3-dimensional scalar discrete quasilinear equations Q3 = 0 on an elementary cubic cell of the lattice Z3.
Efficient approximation algorithms for shortest cycles in undirected graphs
Authors: Andrzej Lingas, Eva-Marta Lundell
Venue: Information Processing Letters (2009)

We describe a simple combinatorial approximation algorithm for finding a shortest (simple) cycle in an undirected graph. Given an adjacency-list representation of an undirected graph G with n vertices and unknown girth k, our algorithm returns with high probability a cycle of length at most 2k for even k and 2k+2 for odd k, in time O(n^3^2logn). Thus, in general, it yields a 223 approximation. For a weighted, undirected graph, with non-negative edge weights in the range {1,2,...,M}, we present a simple combinatorial 2-approximation algorithm for a minimum weight (simple) cycle that runs in time O(n^2logn(logn+logM)).
Experiences of a value assessment for products
Authors: Pasi Ojala
Venue: Software Process: Improvement and Practice (2009)

In the near history, software process and product improvement has been recognized as a usable possibility to increase the quality of software development. Recently the costs and value of software process improvement (SPI) as well as the cost-effectiveness and productivity of software development have become vitally important to many companies as competition has become tougher. The main purpose of this study is to collect experiences whether the value assessment for products support earlier-defined value-based approach and whether the value assessment works in practise, what are the strengths and weaknesses of using it and is it useful to companies. This is done by implementing value assessment in a case company step by step to study which phases possibly work and which phases possibly do not work. The industrial case shows that proposed value assessment for products is useful and supports value-based approach. As well it demonstrates in practice, the strengths and weaknesses of using it and what should be taken into consideration when implementing it. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Brief paper: Networked-based robust H∞ control design using multiple levels of network traffic
Authors: Sung Hyun Kim, PooGyeon Park
Venue: Automatica (Journal of IFAC) (2009)

This paper proposes a method of designing a network-traffic-dependent controller based on not only the deterministic information from the current timestamp but also the stochastic information from the finite sequence of the past timestamps. For its practical implementation, this paper introduces two algorithms: pattern generation (PG) algorithm and pattern identification (PI) algorithm. The PG algorithm classifies off-line the network traffic into some separate patterns using training sequences of timestamps, based on which a less conservative networked control system is designed. Also, the PI algorithm searches on-line for a pattern representing the recent network traffic, which is applied as a decision reference for operating the designed network-traffic-dependent controller.
Insight
Authors: Salvador Simo Busom
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

A homeless woman who lives in an alley meets a girl who looks at her differently than other people.
Vision labs: seeing UCD as a relational practice
Authors: Mads Bødker, Janni Nielsen
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

Relational aspects in user-centered design, UCD, are largely overlooked in the literature. We use criticism of UCD to facilitate a discussion of how discourse, activities, and materials give shape to user involvement in design activities. Drawing on experiments with the workshop format for devising innovations and creative solutions with users, we introduce some criteria and points of interest in the development of a workshop format we call Vision Labs.
Translation of Intermediate Language to Timed Automata with Discrete Data
Authors: Agata Janowska, Paweł Janowski, Dobiesław Wróblewski
Venue: Fundamenta Informaticae (2008)

The aim of this work is to describe the translation from Intermediate Language, one of the input formalisms of the model checking platform VerICS, to timed automata with discrete data and to compare it with the translation to classical timed automata. The paper presents syntax and semantics of both formalisms, the translation rules as well as a simple example.
Energy-Aware Error Correction for QoS-Provisioning Real-Time Communications in Wireless Networks
Authors: Kyong Hoon Kim, Wan Yeon Lee, Jong Kim
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A key issue in QoS-provisioning real-time wireless communications is to provide the QoS requirement with low energy consumption. In this paper, we propose an energy-efficient error correction scheme for real-time communications with QoS requirements in wireless networks. The QoS requirement of a message stream is modeled with (m, k) constraint, implying that at least m messages should be sent to a receiver during any window of k periods. The proposed scheme adaptively selects an error correcting code in an energy-efficient manner so that it maximizes the number of QoS provisionings per unit energy consumption.
The Tableau Workbench
Authors: Pietro Abate, Rajeev Goré
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The Tableau Workbench (TWB) is a generic framework for building automated theorem provers for arbitrary propositional logics. The TWB has a small core that defines its general architecture, some extra machinery to specify tableau-based provers and an abstraction language for expressing tableau rules. This language allows users to ''cut and paste'' tableau rules from textbooks and to specify a search strategy for applying those rules in a systematic manner. A new logic module defined by a user is translated and compiled with the proof engine to produce a specialized theorem prover for that logic. The TWB provides various hooks for implementing blocking techniques using histories and variables, as well as hooks for utilising/defining optimisation techniques. We describe the latest version of the TWB which has changed substantially since our system description in TABLEAUX 2003.
Ranking objects based on relationships and fixed associations
Authors: Albert Angel, Surajit Chaudhuri, Gautam Das, Nick Koudas
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically obtained through widely available Information Extraction tools. At the same time, interesting known associations typically hold among these entities. For instance, a corpus might contain discussions on hotels, cities and airlines; fixed associations among these entities may include: airline A operates a flight to city C, hotel H is located in city C. A plethora of applications necessitate the identification of associated entities, each best matching a given set of keywords. Consider the sample query: Find a holiday package in a "pet-friendly" hotel, located in a "historical" yet "lively" city, with travel operated by an "economical" and "safe" airline. These keywords are unlikely to occur in the textual description of entities themselves, (e.g., the actual hotel name or the city name or the airline name). Consequently to answer such queries, one needs to exploit both relationships between entities and documents (e.g., keyword "pet-friendly" occurs in a document that contains an entity specifying a hotel name H), and the known associations between entities (e.g., hotel H is located in city C). In this work, we focus on the class of "entity package finder" queries outlined above. We demonstrate that existing techniques cannot be efficiently adapted to solve this problem, as the resulting algorithm relies on estimations with excessive runtime and/or storage overheads. We propose an efficient algorithm to process such queries, over large corpora. We devise early pruning and termination strategies, in the presence of joins and aggregations (executed on entities extracted from text), that do not depend on any estimates. Our analysis and experimental evaluation on real and synthetic data demonstrates the efficiency and scalability of our approach.
Designing technology for emergent literacy: The PictoPal initiative
Authors: Susan McKenney, Joke Voogt
Venue: Computers Education (2009)

PictoPal is the name of a technology-supported intervention designed to foster the development of emergent reading and writing skills in four and five year old children. Following the theoretical underpinnings and a brief description of PictoPal, this article describes how children worked with the technology; how the intervention elicited their engagement with literacy concepts both on the computer and off; and effects on early literacy learning. Observation results indicate that children are able to work independently with the program after a few instruction sessions. Observation data yield insight in the nature of adult guidance and the way the results of computer activities were implemented in off-computer classroom activities, as well as areas where this could be improved. Comparison of the four pre-post test experiments used to assess learning effects, suggest that the on-computer activities in PictoPal can yield a statistically significant learning effect, but only when integration with off-computer activities is present.
Performance Issues in CD-ROM based Storage Systems for Multimedia
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

CD-ROMs have proliferated as a distribution media for desktop machines for a large variety of multimedia applications (targeted for a single-user environment) like encyclopedias, magazines and games. With CD-ROM capacities of more than 3GB being available in the near future, they will form an integral part of Video On Demand (VoD) servers to store full-length movies and multimedia. In the first section of this paper we look at issues related to the single-user desktop environment. Since these multimedia applications are highly interactive in nature, we take a pragmatic approach, and have made a detailed study of the multimedia application behavior in terms of the I/O request patterns generated to the CD-ROM subsystem by tracing these patterns. We discuss prefetch buffer design and seek time characteristics in the context of the analysis of these traces. We show that it is best to place multimedia streams near the center of the CD-ROM. We present the parameters of an adaptive main-memory hosted cache that receives caching hints from the application to reduce the latency when the user moves from one node of the hyper graph to another. We show that short-throw seeks of distance 100 are the most important.In the second section we look at the use of CD-ROMs in a Video on Demand server (VoD) and discuss the problem of scheduling multiple request streams and buffer management in this scenario. We adapt C-SCAN (Circular SCAN) algorithm to suit the CD-ROM drive characteristics and prove that it is optimal in terms of buffer size management. We provide computationally inexpensive relations by which this algorithm can be implemented. We then propose a `constant- full-load' admission control algorithm which admits new request streams from a pool of dummy requests without disrupting the continuity of playback of the previous request streams. The algorithm also supports operations such as fast forward and replay. 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
Deriving Instructional Design Principles from Multimedia Presentations with Animations
Authors: Roxana Moreno, Richard E. Mayer
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

The purpose of this paper is to propose a set of instructional design principles as derived from a review of recent empirical studies on multimedia learning with animations. In all studies, students viewed a computer-generated animation depicting the process of lightning formation. Different elements from the interface were varied in order to analyze the effect that such variation had on students' performance. To assess students' understanding of the material, they were asked to write explanations of how lightning forms (retention test), to give names for parts of an illustration (matching test), and to apply what they have learned to solve new problems (transfer test). Based on the results of each study, a different design principle is proposed.
Creating and analysing models in IBM Task Modeler
Authors: Mark Farmer, Colin Bird
Venue: Proceedings of the 21st British HCI Group Annual Conference on HCI 2008: People and Computers XXI: HCI...but not as we know it - Volume 2 (2007)

We illustrate the basic constituents of a model and demonstrate how the facilities of Task Modeler, such as the visualization options, enable the rapid creation, analysis, and communication of the model
Emotion-based music recommendation by affinity discovery from film music
Authors: Man-Kwan Shan, Fang-Fei Kuo, Meng-Fen Chiang, Suh-Yin Lee
Venue: Expert Systems with Applications: An International Journal (2009)

With the growth of digital music, the development of music recommendation is helpful for users to pick desirable music pieces from a huge repository of music. The existing music recommendation approaches are based on a user's preference on music. However, sometimes, it might better meet users' requirement to recommend music pieces according to emotions. In this paper, we propose a novel framework for emotion-based music recommendation. The core of the recommendation framework is the construction of the music emotion model by affinity discovery from film music, which plays an important role in conveying emotions in film. We investigate the music feature extraction and propose the Music Affinity Graph and Music Affinity Graph-Plus algorithms for the construction of music emotion model. Experimental result shows the proposed emotion-based music recommendation achieves 85% accuracy in average.
Tracking without Background Model for Time-of-Flight Cameras
Authors: Luca Bianchi, Riccardo Gatti, Luca Lombardi, Paolo Lombardi
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Time-of-flight (TOF) cameras are relatively new sensors that provide a 3D measurement of a scene. By means of the distance signal, objects can be separated from the background on the basis of their distance from the sensor. For virtual studios applications, this feature can represent a revolution as virtual videos can be produced without a studio. When TOF cameras become available to the consumer market, everybody may come to be a virtual studio director. We study real-time fast algorithms to enable unprofessional virtual studio applications by TOF cameras. In this paper we present our approach to foreground segmentation, based on smart-seeded region growing and Kalman tracking. With respect to other published work, this method allows for working with a non-stationary camera and with multiple actors or moving objects in the foreground providing high accuracy for real-time computation.
Cost-Efficient Dragonfly Topology for Large-Scale Systems
Authors: John Kim, William Dally, Steve Scott, Dennis Abts
Venue: IEEE Micro (2009)

It is more efficient to use increasing pin bandwidth by creating high-radix routers with a large number of narrow ports instead of low-radix routers with fewer wide ports. Building networks using high-radix routers lowers cost and improves performance, but also presents many challenges. The dragonfly topology minimizes network cost by reducing the number of global channels required.
Techniques for efficient placement of synchronization primitives
Authors: Alexandru Nicolau, Guangqiang Li, Arun Kejariwal
Venue: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (2009)

Harnessing the hardware parallelism of the emerging multi-cores systems necessitates concurrent software. Unfortunately, most of the existing mainstream software is sequential in nature. Although one could auto-parallelize a given program, the efficacy of this is largely limited to floating-point codes. One of the ways to alleviate the above limitation is to parallelize programs, which cannot be auto-parallelized, via explicit synchronization. In this regard, efficient placement of the synchronization primitives - say, post, wait - plays a key role in achieving high degree of thread-level parallelism (TLP). In this paper, we propose novel compiler techniques for the above. Specifically, given a control flow graph (CFG), the proposed techniques place a post as early as possible and place a wait as late as possible in the CFG, subject to dependences. We demonstrate the efficacy of our techniques, on a real machine, using real codes, specifically, from the industry-standard SPEC CPU benchmarks, the Linux kernel and other widely used open source codes. Our results show that the proposed techniques yield significantly higher levels of TLP than the state-of-the-art.
Undergraduate education in the computer system of software school, Fudan University
Authors: Yijian Huang, Weihua Zhang, Binyu Zang
Venue: Proceedings of the 1st ACM Summit on Computing Education in China on First ACM Summit on Computing Education in China (2008)

Recently, the multi-core technology is adopted on more and more computing platforms. As a result, the IT industry demands programmers to have solid knowledge in the whole computer system, so that they can develop highly efficient programs for various multi-core platforms. Consequently, it becomes a great challenge for undergraduate education to foster such programmers. To meet this challenge, the Software School of Fudan University builds up the current curriculum architecture to achieve effective education in the computer system. It is a progressive chain of four courses and several methods are adopted for it. We choose the most suitable textbooks and give them explanation and complement by teachers. Students are provided with full practical opportunities as well as open topics for innovative survey and analysis. The education plans are also flexibly adapted to students' career plans.
Linking business and requirements engineering: is solution planning a missing activity in software product companies?
Authors: Laura Lehtola, Marjo Kauppinen, Jarno V&#x00e4;h&#x00e4;niitty, Marko Komssi
Venue: Requirements Engineering (2009)

A strong link between strategy and product development is important, since companies need to select requirements for forthcoming releases. However, in practice, connecting requirements engineering (RE) and business planning is far from trivial. This paper describes the lessons learned from four software product companies that have recognized the need for more business-oriented long-term planning. The study was conducted using the action research approach. We identified five practices that seem to strengthen the link between business decisions and RE. These are (1) explicating the planning levels and time horizons; (2) separating the planning of products&#x2019; business goals from R&D resource allocation; (3) planning open-endedly with a pre-defined rhythm; (4) emphasizing whole-product thinking; and (5) making solution planning visible. To support whole-product thinking and solution planning, we suggest that companies create solution concepts. The purpose of the solution concept is to provide a big picture of the solution and guide RE activities.
On the complement graph and defensive k-alliances
Authors: J. M. Sigarreta, S. Bermudo, H. Fernau
Venue: Discrete Applied Mathematics (2009)

In this paper, we obtain several tight bounds of the defensive k-alliance number in the complement graph from other parameters of the graph. In particular, we investigate the relationship between the alliance numbers of the complement graph and the minimum and maximum degree, the domination number and the isoperimetric number of the graph. Moreover, we prove the NP-completeness of the decision problem underlying the defensive k-alliance number.
PHP: A BEGINNER'S GUIDE, 1 edition
Authors: Vikram Vaswani
Venue:  (2008)

Essential Skills--Made Easy!Learn how to build dynamic, data-driven Web applications using PHP. Covering the latest release of this cross-platform, open-source scripting language, PHP: A Beginner's Guide teaches you how to write basic PHP programs and enhance them with more advanced features such as MySQL and SQLite database integration, XML input, and third-party extensions. This fast-paced tutorial provides one-stop coverage of software installation, language syntax and data structures, flow control routines, built-in functions, and best practices. Designed for Easy Learning: Key Skills Concepts--Lists of specific skills covered in the chapter Ask the Expert--Q A sections filled with bonus information and helpful tips Try This--Hands-on exercises that show how to apply your skillsNotes--Extra information related to the topic being coveredTips--Helpful reminders or alternate ways of doing things Cautions--Errors and pitfalls to avoidSelf-Tests--Chapter-ending quizzes to test your knowledgeAnnotated Syntax--Example code with commentary that describes the programming techniques being illustratedTable of contentsPart I: Understanding PHP BasicsChapter 1. Introducing PHPChapter 2. Using Variables and OperatorsChapter 3. Controlling Program FlowChapter 4. Working with ArraysChapter 5. Using Functions and ClassesPart II: Working with Data from Other SourcesChapter 6. Working with Files and DirectoriesChapter 7. Working with Databases and SQLChapter 8. Working with XMLChapter 9. Working with Cookies, Sessions, and HeadersPart III: Security and TroubleshootingChapter 10. Handling ErrorsChapter 11. Securing PHPChapter 12. Expanding PHPPart IV: AppendixesAppendix A. Installing and Configuring Required SoftwareAppendix B. Answers to Self TestIndex