ppxscal/embedding_network huggingface dataset:
dream.Medusa: A Participatory Performance
Authors: Robyn Taylor, Pierre Boulanger, Patrick Olivier
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

We describe a system which allows several audience members to participate in a performance of an interactive media piece. The performance is created using Max/MSP and Jitter, and is controlled by live voice as well as by participant-operated manipulated objects. The performance was created as part of an interactive art exhibit exploring a night of dreaming and was devised in order to explore the experience of lucid dreaming. We discuss our experiences with the performance and the potential use of participatory performance as a vehicle for exploring wider issues in interaction design.
Random neural networks with synchronized interactions
Authors: Erol Gelenbe, Stelios Timotheou
Venue: Neural Computation (2008)

Large-scale distributed systems, such as natural neuronal and artificial systems, have many local interconnections, but they often also have the ability to propagate information very fast over relatively large distances. Mechanisms that enable such behavior include very long physical signaling paths and possibly saccades of synchronous behavior that may propagate across a network. This letter studies the modeling of such behaviors in neuronal networks and develops a related learning algorithm. This is done in the context of the random neural network (RNN), a probabilistic model with a well-developed mathematical theory, which was inspired by the apparently stochastic spiking behavior of certain natural neuronal systems. Thus, we develop an extension of the RNN to the case when synchronous interactions can occur, leading to synchronous firing by large ensembles of cells. We also present an O(N3) gradient descent learning algorithm for an N-cell recurrent network having both conventional excitatory-inhibitory interactions and synchronous interactions. Finally, the model and its learning algorithm are applied to a resource allocation problem that is NP-hard and requires fast approximate decisions.
Delegations guided by trust and autonomy
Authors: Henry Hexmoor, Shahram Rahimi, Rachil Chandran
Venue: Web Intelligence and Agent Systems (2008)

This paper explores delegation decisions predicated on models of trust and autonomy among agents. In socially rich environments, trust and autonomy of artificial agents are key attributes for rational delegation decisions. Social agents are affected by many social attributes such as benevolence, social exchanges, power, and norms. We present cognitively inspired working models of trust and autonomy for delegation among agents that accounts for these social attributes. These models are validated in a simulation of a group of agents who delegate tasks in order to locate the most socially well-suited individuals for performing that task. We define autonomy in such an objective manner that agents who have the highest autonomy with respect to a task will generally be the most socially well suited. Benevolence, social reciprocation, and norms most directly contribute to autonomy and proportionally to social suitability. Derived social power directly contributes to social suitability, whereas independently assigned social power ranking overrides the suitability. We show that trust and autonomy in an agent group changes under various social settings.
Knowledge organization with pattern recognition in an auto-adaptive system
Authors: Camille Havas, Othalia Larue, Mickael Camus
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Computer Science has always been on a quest for autonomy. Today neural networks are quite competitive, however common machines do not satisfy their expectations. Complex systems and adaptive systems are emerging. This paper pioneers a new kind of image recognition. The combination of a regressive approach to neural networks and a high level of knowledge organization enables even more performing recognition. This project is developed with the Oz/Mozart system and based on the Camus and Cardon multi-agent system. A new type of agent has been created for this purpose. Experiments are discussed at the end of the paper. The system is able to understand its environment and to make autonomous decisions based on this environment.
Exploiting Structural Hierarchy in Articulated Objects Towards Robust Motion Capture
Authors: C. Canton-Ferrer, J. R. Casas, M. Pardàs
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

This paper presents a general analysis framework towards exploiting the underlying hierarchical and scalable structure of an articulated object for pose estimation and tracking. The Scalable Human Body Model (SHBM) is presented as a set of human body models ordered following a hierarchy criteria. The concept of annealing is applied to derive a generic particle filtering scheme able to perform a sequential filtering over the models contained in the SHBM leading to a structural annealing process. This scheme is applied to perform human motion capture in a multi-camera environment. Finally, the effectiveness of the proposed system is addressed by comparing its performance with the standard and annealed particle filtering approaches over an annotated database.
Ways to Develop Human-Level Web Intelligence: A Brain Informatics Perspective
Authors: Ning Zhong
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

In this paper, we briefly investigate several ways to develop human-level Web intelligence (WI) from a brain informatics (BI) perspective. BI can be regarded as brain sciences in WI centric IT age and emphasizes on a systematic approach for investigating human information processing mechanism. The recently designed instrumentation (fMRI etc.) and advanced IT are causing an impending revolution in both WI and BI, making it possible for us to understand intelligence in depth and develop human-level Web intelligence.
A Comparison of Standard Compliant Ways to Define Domain Specific Languages
Authors: Ingo Weisemöller, Andy Schürr
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

Domain specific languages are of increasing importance for today's software development processes. Their area of application ranges from process modeling over architecture description and system design to behavioral specification and simulation. There are numerous approaches for the definition and implementation of DSLs. Among others, the OMG offers UML profiles as a lightweight extension of a predefined multi-purpose language and MOF as a metamodeling language, which can be used to define DSLs from scratch. This contribution investigates various approaches to define DSLs, focusing on architectural description languages as an example. Besides the usage of UML profiles and the definition of an entirely new language with MOF, the adaption of the UML based on a metamodel extension is also considered. As a consequence of the shortcomings depicted for the different approaches, we suggest to combine UML profiles and metamodeling in order to compensate their weaknesses and take advantage of their benefits.
Automated Addition of Fault-Tolerance to SCR Toolset: A Case Study
Authors: Fuad Abujarad, Sandeep S. Kulkarni
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Automated addition of fault-tolerance to existing programs is highly desirable, as it allows the designer to focus on the system behavior in the absence of faults and leave the fault-tolerance aspect to automated techniques that guarantee correctness by construction. Automated addition of fault-tolerance is expected to be more successful if it is done under the hood, i.e., where the designer can continue to utilize existing tools and the addition of fault-tolerance is orthogonal to the tools that they use. This will reduce the learning curve for adding fault-tolerance as well as make addition of fault-tolerance across different design tools. With this motivation, in this paper, we focus on automated addition of fault-tolerance to the SCR tools. We illustrate our approach using two case studies: an Altitude Switch Controller and an Automobile Cruise Controller.
Comparative Studies Simplified in GPFlow
Authors: Lawrence Buckingham, James M. Hogan, Paul Roe, Jiro Sumitomo, Michael Towsey
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

We present a novel, web-accessible scientific workflow system which makes large-scale comparative studies accessible without programming or excessive configuration requirements. GPFlow allows a workflow defined on single input values to be automatically lifted to operate over collections of input values and supports the formation and processing of collections of values without the need for explicit iteration constructs. We introduce a new model for collection processing based on key aggregation and slicing which guarantees processing integrity and facilitates automatic association of inputs, allowing scientific users to manage the combinatorial explosion of data values inherent in large scale comparative studies. The approach is demonstrated using a core task from comparative genomics, and builds upon our previous work in supporting combined interactive and batch operation, through a lightweight web-based user interface.
Development of a National Syllabus Repository for Higher Education in Ireland
Authors: Arash Joorabchi, Abdulhussain E. Mahdi
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

With the significant growth in electronic education materials such as syllabus documents and lecture notes available on the Internet and intranets, there is a need for developing structured central repositories of such materials to allow both educators and learners to easily share, search and access them. This paper reports on our on-going work to develop a national repository for course syllabi in Ireland. In specific, it describes a prototype syllabus repository system for higher education in Ireland that has been developed by utilising a number of information extraction and document classification techniques, including a new fully unsupervised document classification method that uses a web search engine for automatic collection of training set for the classification algorithm. Preliminary experimental results for evaluating the system's performance are presented and discussed.
Imperfect Answers in Multiple Choice Questionnaires
Authors: Javier Diaz, Maria Rifqi, Bernadette Bouchon-Meunier, Sandra Jhean-Larose, Guy Denhiére
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

Multiple choice questions (MCQs) are the most common and computably tractable ways of assessing the knowledge of a student, but they restrain the students to express a precise answer that doesn't really represent what they know, leaving no room for ambiguities or doubts. We propose Ev-MCQs (Evidential MCQs), an application of belief function theory for the management of the uncertainty and imprecision of MCQ answers. Intelligent Tutoring Systems (ITS) and e-Learning applications could exploit the richness of the information gathered through the acquisition of imperfect answers through Ev-MCQs in order to obtain a richer student model, closer to the real state of the student, considering their degree of knowledge acquisition and misconception.
Model-based risk assessment
Authors: Hany H. Ammar
Venue:  (2006)

In this research effort, we focus on model-based risk assessment. Risk assessment is essential in any plan intended to manage software development or maintenance process. Subjective techniques are human intensive and error-prone. Risk assessment should be based on architectural attributes that we can quantitatively measure using architectural level metrics. Software architectures are emerging as an important concept in the study and practice of software engineering nowadays, due to their emphasis on large-scale composition of software product, and to their support for emerging software engineering paradigms, such as product line engineering, component based software engineering, and software evolution. In this dissertation, we generalize our earlier work on reliability-based risk assessment. We introduce error propagation probability in the assessment methodology to account for the dependency among the system components. Also, we generalize the reliability-based risk assessment to account for inherent functional dependencies. Furthermore, we develop a generic framework for maintainability-based risk assessment which can accommodate different types of software maintenance. First, we introduce and define maintainability-based risk assessment for software architecture. Within our assessment framework, we investigate the maintainability-based risk for the components of the system, and the effect of performing the maintenance tasks on these components. We propose a methodology for estimating the maintainability-based risk when considering different types of maintenance. As a proof of concept, we apply the proposed methodology on several case studies. Moreover, we automate the estimation of the maintainability-based risk assessment methodology.
Theorem Proving for Verification (Invited Tutorial)
Authors: John Harrison
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

There are numerous verification techniques in active use. Traditional testing and simulation usually only provide a limited guarantee, since they can seldom exercise all possible situations. Methods based on abstraction consciously simplify the problem to make its complete analysis tractable, but still do not normally completely verify the ultimate target. We will confine ourselves here to full formal verification techniques that can be used to prove complete correctness of a (model of a) system with respect to a formal specification. Roughly speaking, these methods model the system and specification in a logical formalism and then apply general methods to determine whether the formal expressions are valid, indicating correctness of the model with respect to the specification. Typical formalisms include: Propositional logic, a.k.a. Boolean algebra Temporal logic (CTL, LTL etc.) Quantifier-free combinations of first-order theories Full first-order logic Higher-order logic or first-order logic with arithmetic or set theory This list is organized approximately in order of increasing logical generality, with formalisms later in the list often subsuming earlier ones. But there is a price to be paid for this generality: deciding validity in the formalisms becomes successively more difficult.
NASA's Manned Spacecraft Computers
Authors: James E. Tomayko
Venue: IEEE Annals of the History of Computing (1985)

Many people believe that NASA's extensive use of computers has kept the agency at the forefront of computer development. This study evaluates the hypothesis in regard to computers used on board manned spacecraft. The results show that NASA's contributions to computer science were made primarily in the areas of software verification and fault tolerance, and that overall, NASA has adopted proved technology for manned space flight operations. This technology is consistently behind the state of the art in terms of hardware, but the continued use of older technology in manned spacecraft is not necessarily a negative development. The computer power used in the Apollo, Gemini, and shuttle programs has been sufficient for the requirements of the missions. Most important, reliability has been ensured. 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
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
Authors: Jérémie Chalopin, Antoni Mazurkiewicz, Yves Métivier
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [2] and models introduced and studied by Mazurkiewicz [17,18]. We encode these models by labelled (hyper)graphs and relabelling rules on this labelled (hyper)graphs called negotiations. Then for these models, we give complete characterisations of labelled graphs in which the naming problem can be solved. Our characterizations are expressed in terms of locally constrained homomorphisms that are generalisations of known graph homomorphisms.
A simulation-based methodology for inventory analysis due to product proliferation
Authors: Ali K. Kamrani, Arun K. Adat
Venue: International Journal of Computer Applications in Technology (2008)

A fundamental insight into product variety and its impact on operation costs on an assembly line is critical to any manufacturing firm. The proposed methodology aims at developing a cost model to analyse the impact of product variety on a mixed model assembly line. A production line that assembles vehicles based on Toyota's Just-In-Time (JIT) production system is considered. Model drop sequence on the assembly line is generated using the Toyota's goal-sharing algorithm. The assembly line is modelled using Witness&reg; simulation software to analyse the behaviour of the manufacturing system for product proliferation. Selective output parameters of the simulation model are monitored and used in the cost model to understand the direct and indirect costs of product variety. Informed decisions regarding a new product rollout can be made using the information obtained from this model.
A Characterization of Key Properties of Environment-Mediated Multiagent Systems
Authors: Hartmut Schmeck, Christian Müller-Schloer
Venue: Engineering Environment-Mediated Multi-Agent Systems: International Workshop, EEMMAS 2007, Dresden, Germany, October 5, 2007. Selected Revised and Invited Papers (2008)

The increasing presence of application scenarios which are based on large collections of active components having to adapt continuously to changing environmental requirements has led to several research initiatives with the objective to create new concepts for the design and operation of environment-mediated multiagent systems. In particular, Autonomic Computing (AC) and Organic Computing (OC) have developed the vision of systems possessing life-like properties: They self-organize, adapt to their dynamically changing environments, and establish other so-called self-x properties, like self-healing, self-configuration, self-optimization etc. The impact of these initiatives will depend crucially on our ability to demonstrate the benefits of these systems with respect to some essential properties. Therefore, we need a clear understanding of some key notions like adaptivity, robustness, flexibility, or their degree of autonomy, allowing for self-x properties.In this paper, a system classification of robust, adaptable, and adaptive systems is presented. Furthermore, a degree of autonomy is characterized to be able to quantify how autonomously a system is working. The degree of autonomy distinguishes and measures external control which is exhibited directly by the user (no autonomy) from internal control of a system which might be fully controlled by an observer/controller architecture that is part of the system (full autonomy). Finally, learning and of trustworthiness are briefly addressed, since these are further essential aspects of self-organizing, adaptive systems.
Altruism, Selfishness, and Destructiveness on the Social Web
Authors: John Riedl
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

Many online communities are emerging that, like Wikipedia, bring people together to build community-maintained artifacts of lasting value (CALVs). What is the nature of people's participation in building these repositories? What are their motives? In what ways is their behavior destructive instead of constructive? Motivating people to contribute is a key problem because the quantity and quality of contributions ultimately determine a CALV's value. We pose three related research questions: 1) How does intelligent task routing--matching people with work--affect the quantity of contributions? 2) How does reviewing contributions before accepting them affect the quality of contributions? 3) How do recommender systems affect the evolution of a shared tagging vocabulary among the contributors? We will explore these questions in the context of existing CALVs, including Wikipedia, Facebook, and MovieLens.
Interactive Exploration of Large Dynamic Networks
Authors: Mathias Pohl, Peter Birke
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

A variety of applications especially in the area of Web 2.0 produce frequently altering hierarchical networks. Thus application operators, members of community websites but also media scientists often are interested in gaining deeper insights in the complex structures of their project and its development over time. In order to enable a suitable visualization of such networks it is not only required to implement an intelligent data management but also a suitable network drawing engine that cares for the user's needs --- especially for visualization of network dynamics. This paper presents the Xldn visualization tool that enables visual exploration of evolving hierarchical networks. It includes a layout generation algorithm that allows for the preservation of the mental map --- a crucial property when visualizing dynamic networks. By utilization of an efficient data management and a parallel implementation of the graph drawing algorithm Xldn provides a reasonably fast and interactive network visualization. This way Xldn facilitates an in-depth evolution analysis of large hierarchic networks.
A Traceability Technique for Specifications
Authors: Aharon Abadi, Mordechai Nisenson, Yahalomit Simionovici
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

Traceability in software involves discovering links between different artifacts, and is useful for a myriad of tasks in the software life cycle. We compare several different Information Retrieval techniques for this task, across two data sets involving real-world software with the accompanying specifications and documentation. The techniques compared include dimensionality reduction methods, probabilistic and information theoretic approaches, and the standard vector space model.
Benchmarking in digital circuit design
Authors: Lech Józwiak
Venue: Proceedings of the 7th WSEAS International Conference on Microelectronics, Nanoelectronics, Optoelectronics (2008)

This paper focuses on benchmarking, which is the main experimental approach to the design method and EDA-tool analysis, characterization and evaluation. We discuss the importance and difficulties of benchmarking, as well as the recent research effort related to it. To resolve several serious problems related to quality of benchmarking and use of practical industrial benchmarks, we proposed an adequate benchmarking methodology based on the statistical experimental design approach, and developed corresponding digital circuit benchmark generators. These benchmark generators enable research, evaluation and fine-tuning of circuit synthesis methods and EDA-tools largely independent of the actual industrial benchmarks, and much better than having only some industrial benchmarks. Using the results of extensive experiments that involved large sets of diverse benchmarks generated with our FSM benchmark generator, we discuss several crucial problems of benchmarking and demonstrate how to resolve them.