ppxscal/embedding_network huggingface dataset:
Modeling and Design of an Agent-Based Micro-simulation of the Swiss Highway Network
Authors: Michael Schumacher, Laurent Grangier, Radu Jurca
Venue: Engineering Environment-Mediated Multi-Agent Systems: International Workshop, EEMMAS 2007, Dresden, Germany, October 5, 2007. Selected Revised and Invited Papers (2008)

Multiagent simulations can be elegantly modeled and designed by enhancing the role of the environment in which agents evolve, called the agent environment. In particular, the agent environment may have the role of a governing infrastructure that regulates with laws or norms the actions taken by the agents. The focus of modeling and design is thus shifted from a subjective view of agents towards a more objective view of the whole multiagent system. In this paper, we apply the idea of a governing environment to model and design a multi-agent system for a micro-simulation of the Swiss highway network. The goal of the simulation is to show how traffic jams and accordion phenomena may be handled with appropriate local regulations on speed limits. A natural modeling would give segments the capacity to regulate the speed based on observed local events. We developed the simulation platform from scratch in order to accommodate our design choices and a realistic complexity. This paper presents in details our modeling and design choices, and first experimental results.
A Web-Based Asynchronous Discussion System and Its Evaluation
Authors: Hisayoshi Kunimune, Kenzou Yokoyama, Takeshi Takizawa, Takuya Hiramatsu, Yasushi Fuwa
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

This paper describes the evaluation of an asynchronous discussion supporting system for web-based materials. The system, which is named "Writable Web," provides the features assisting asynchronous discussion by sharing annotations. We improve the features in order to support the annotation sharing of the system on the basis of the first trial experiment conducted in an experimental class. Then, we carry out the second experiment in an actual class. The system is evaluated from two aspects. One aspect is the effect of the asynchronous discussion, which is measured from the scores obtained in a written assignment, and other is the functionality of the features based on the result of a questionnaire survey carried out after the experiment.
Model-Level Integration of the OCL Standard Library Using a Pivot Model with Generics Support
Authors: Matthias Bräuer, Birgit Demuth
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)

OCL 2.0 specifies a standard library of predefined types and associated operations. A model-level representation of the library is required to reference its elements within the abstract syntax model created by an OCL parser. Existing OCL engines build this model in the implementation code which severely limits reusability, flexibility and maintainability. To address these problems, we show how a common pivot model with explicit support for template types can help to externalize the definition of the standard library and integrate it with instances of arbitrary domain-specific modeling languages. We exemplify the feasibility of our approach with a prototypical implementation for the Dresden OCL2 Toolkit and present a tailored EMF editor for modeling the OCL types and operations. We limit our discussion to the model level, i.e., we do not consider an implementation of the standard library for an execution engine.
A Novel Optimization Strategy for the Nonlinear Systems Identification
Authors: Xin Tan, Huaqian Yang
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Hopfield neural networks are the recurrent artificial neural networks. A novel method using Gaussian-Hopfield neural network (GHNN) to identify the discrete-time nonlinear systems is proposed. And then, the genetic algorithm is used to search for global optimization, which can improve the speed of searching for the global optimal parameters for the Gaussian basis functions (GBFs). In the end, simulation experiments are described in detail. The simulation results demonstrated that the proposed method can be successfully used to identify discrete-time nonlinear systems with good performance.
Creating the World's Largest Reconfigurable Supercomputing System Based on the Scalable SGI® Altix® 4700 System Infrastructure and Benchmarking Life-Science Applications
Authors: Haruna Cofer, Matthias Fouquet-Lapar, Timothy Gamerdinger, Christopher Lindahl, Bruce Losure, Alan Mayer, James Swoboda, Teruo Utsumi
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

FPGA accelerated systems in High Performance Computing are typically limited to single digit numbers of FPGAs in a Single System Image (SSI). However, SGI has built an SSI system with 70 FPGAs to study the feasibility of running real-world customer test cases on such a large scale system. This paper will detail the system architecture, the implementation, and the results of performing both a real-world bioinformatics benchmark and a synthetic global bandwidth test where all 70 FPGAs were driven by a single process.
Computational Materials Science at the Cutting Edge
Authors: Stefan Blügel
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Material science is a field which cuts through physics, chemistry, biology, and engineering working with an enormous spectrum of different material systems and structures on quite different length and time scale and symmetry, on different degrees of hardness or softness as well as on liquids. The degree to which new functionalities of magnetic clusters, quantum dots, bio-molecules or carbon nanowires can be exploited for specific applications depends heavily on our ability to design devices with optimal behavior in response to external stimulation, such as applied voltage. While the basic physical effects are often well understood, quantitative simulations with predictive power that do not rely on empirical models and parameters pose a major challenge. This is due to the large numerical effort of the calculations, to accurately describe quantum effects at atomic and larger distances. Therefore, modern quantum simulations in material science depend heavily on efficient algorithms and powerful computer hardware. 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
Real-Time Car License Plate Recognition Improvement Based on Spatiognitron Neural Network
Authors: Dariusz Król, Maciej Maksym
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

This article describes real-time car license plate recognition (CLPR) system based on spatiognitron neural network comparing to other ANPR/CLPR systems. Our neural network architecture is very efficient and improves whole recognition process. Spatiognitron neural network is inspired by biological neural structure --- the mammalian primary visual cortex. This theory describes so called receptive fields, which are responsible for recognizing different kinds of features in the input image. This network also uses analog-like recognition method. In this method, the neural network responds in real-time. This is connected with reorganizing classical paradigm of image recognition process. The character of recognition stage is performed before the image segmentation. This approach seems to be more logical and it was certified in many quality tests of recognition process in commercial NeuroCar system.
Finding the Reduct Subject to Preference Order of Attributes
Authors: Xiaofeng Zhang, Yongsheng Zhao, Hailin Zou
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

In machine learning and knowledge discovery, rough set theory is a useful tool to be employed as a preprocessing step for dimension reduction. However, for a given system, there may be more than one reduct to be selected. Different reducts will lead to discovered knowledge, which may be concise, precise, general, understandable and practically useful in different levels. It is a crucial issue to select the most suitable features or properties of the objects in a dataset in the machine learning process. In this paper, some external information is added to information system and may be simply regarded as user preference on attributes. Consequently, it will guide the procedure of retrieving reducts, which will give birth to the reduct subject to preference order of attributes.
Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs
Authors: Umberto Straccia
Venue: Reasoning Web: 4th International Summer School 2008, Venice, Italy, September 7-11, 2008, Tutorial Lectures (2008)

Managing uncertainty and/or vagueness is starting to play an important role in Semantic Web representation languages. Our aim is to overview basic concepts on representing uncertain and vague knowledge in current Semantic Web ontology and rule languages (and their combination).
Facilitating Mobile Service Provisioning in IP Multimedia Subsystem (IMS) Using Service Oriented Architecture
Authors: Igor Radovanović, Amit Ray, Johan Lukkien, Michel Chaudron
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

This paper presents an extension of the IMS software architecture using a service orientation, which provides flexibility of mobile service provisioning. The suggested extension facilitates composition of new mobile services in run-time based on the existing services and enables the end users to become mobile service providers. Moreover, it enables addition of new mobile services with plug-n-play similar to an addition of an end user device to the network. With this extension, the core system architecture of IMS is not affected. The extension is realized by introducing Web services in combination with the SIP protocol. Using SIP will enable operators to remain in control of mobile service provisioning as they are the owners of the IMS networks. This property of the extension may also facilitate its acceptance by the operators. A proof-of-concept prototype is discussed to demonstrate feasibility of the proposed extension.
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Authors: William Yeoh, Ariel Felner, Sven Koenig
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Distributed constraint optimization (DCOP) problems are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOP problems optimally with memory-bounded and asynchronous algorithms. We introduce Branch-and-Bound ADOPT (BnB-ADOPT), a memory-bounded asynchronous DCOP algorithm that uses the message passing and communication framework of ADOPT, a well known memory-bounded asynchronous DCOP algorithm, but changes the search strategy of ADOPT from best-first search to depth-first branch-and-bound search. Our experimental results show that BnB-ADOPT is up to one order of magnitude faster than ADOPT on a variety of large DCOP problems and faster than NCBB, a memory-bounded synchronous DCOP algorithm, on most of these DCOP problems.
7th International Workshop on Ocl4All: Modelling Systems with OCL
Authors: David Akehurst, Martin Gogolla, Steffen Zschaler
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)

This year's OCL workshop at the MODELS conference looked out to usages of OCL outside the direct context of UML or beyond the capabilities of standard OCL. It was a very interesting and successful workshop, which apart from the presentation of 10 papers a lively discussion on various topics surround current usage of OCL was held. Six main topics recurred throughout the discussions: (1) Means and uses of transformation to other languages, (2) Support for side-effects and executability, (3) Continuing need for OCL, (4) Providing extensions to the standard, (5) Platform independence of the language, (6) Formality of the language. This summary report presents the results of the workshop and the discussions.
Development of a Speech Recognizer with the Tecnovoz Database
Authors: José Lopes, Cláudio Neves, Arlindo Veiga, Alexandre Maciel, Carla Lopes, Fernando Perdigão, Luís Sá
Venue: Proceedings of the 8th international conference on Computational Processing of the Portuguese Language (2008)

This paper describes the development of a robust speech recognition using a database collected in the scope of the Tecnovoz project. The speech recognition system is speaker independent, robust to noise and operates in a small footprint embedded hardware platform. Some issues about the database, the training of the acoustic models, the noise suppression front-end and the recognizer's confidence measure are addressed in the paper. Although the database was especially designed for specific small-vocabulary tasks, the best system performance was obtained using triphone models rather than whole-word models.
Back to the Complexity of Universal Programs
Authors: Alain Colmerauer
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

I start with three examples illustrating my contribution to constraint programming: the problem of cutting a rectangle into different squares in Prolog III, a complicated constraint for Prolog IV, the optimal narrowing of the sortedness constraint. Then I switch to something quite different: to machines, in particular to Turing machines. After the declarative aspect, the basic computational aspect!The paper provides a framework enabling to define and determine the complexity of various universal programs U for various machines. The approach consists of first defining the complexity as the average number of instructions to be executed by U, when simulating the execution of one instruction of a program P with input x.To obtain a complexity that does not depend on P or x, we introduce the concept of an introspection coefficient expressing the average number of instructions executed by U, for simulating the execution of one of its own instructions. We show how to obtain this coefficient by computing a square matrix whose elements are numbers of executed instructions when running selected parts of U on selected data. The coefficient then becomes the greatest eigenvalue of the matrix.We illustrate the approach using two examples of particularly efficient universal programs: one for a three-symbol Turing Machine (blank symbol not included) with an introspection coefficient of 3 672.98, the other for an indirect addressing arithmetic machine with an introspection coefficient of 26.27.
A system for online compression of high-speed network measurements
Authors: Konstantinos G. Kyriakopoulos, David J. Parish
Venue: International Journal of Internet Protocol Technology (2008)

Measuring metrics of high-speed networks produces large amounts of information over long periods of time, making the conventional storage of the data practically inefficient. Such metrics are derived from packet information and can be represented as time series signals. This paper looks at the Wavelet transform as a method of analysing and compressing measurement signals. A live system calculates these measurements and performs wavelet techniques to preserve the significant information and discard the small variations. An investigation of an appropriate wavelet is presented along with results from off-line and on-line experiments. Finally, a comparison of compression performance is presented against bzip2.
Interview with Herman Tavani, winner of the 2008 SIGCAS Service Award
Authors: Kathrine Andrews Henderson
Venue: ACM SIGCAS Computers and Society (2008)

I sat down with SIGCAS 2008 Outstanding Service Award recipient, Dr. Herman Tavani a few weeks ago to chat about his long-standing relationship with SIGCAS. Our conversation started out with a simple question, how long have you been a member? Answer, 14 years. And with that, the stories, the friendships, and his hopes for SIGCAS started flowing. --- KAH
On induced-universal graphs for the class of bounded-degree graphs
Authors: Louis Esperet, Arnaud Labourel, Pascal Ochem
Venue: Information Processing Letters (2008)

For a family F of graphs, a graph U is said to be F-induced-universal if every graph of F is an induced subgraph of U. We give a construction for an induced-universal graph for the family of graphs on n vertices with degree at most k. For k even, our induced-universal graph has O(n^k^/^2) vertices and for k odd it has O(n^@?^k^/^2^@?^-^1^/^klog^2^+^2^/^kn) vertices. This construction improves a result of Butler by a multiplicative constant factor for the even case and by almost a multiplicative n^1^/^k factor for the odd case. We also construct induced-universal graphs for the class of oriented graphs with bounded incoming and outgoing degree, slightly improving another result of Butler.
Biological Sequence Data Preprocessing for Classification: A Case Study in Splice Site Identification
Authors: A. K. Baten, S. K. Halgamuge, Bill Chang, Nalin Wickramarachchi
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

The increasing growth of biological sequence data demands better and efficient analysis methods. Effective detection of various regulatory signals in these sequences requires the knowledge of characteristics, dependencies, and relationship of nucleotides in the surrounding region of the regulatory signals. A higher order Markov model is generally regarded as a useful technique for modeling higher order dependencies of the nucleotides. However, its implementation requires estimating a large number of computationally expensive parameters. In this paper, we propose a hybrid method consisting of a first order Markov model for sequence data preprocessing and a multilayer perceptron neural network for classification. The Markov model captures the compositional features and dependencies of nucleotides in terms of probabilistic parameters which are used as inputs to the classifier. The classifier combines the Markov probabilities nonlinearly for signal detection. When applied to the splice site detection problem using three widely used data sets, it is observed that the proposed hybrid method is able to model higher order dependencies with better classification accuracies.
Automatic Methods for Integrating Biomedical Data Sources in a Mediator-Based System
Authors: Fleur Mougin, Anita Burgun, Olivier Bodenreider, Julie Chabalier, Olivier Loréal, Pierre Beux
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

The information needed by biologists and physicians for research purposes is distributed over many heterogeneous sources. Integration systems provide a single, centralized and homogeneous interface for users to query multiple information sources simultaneously. The major limitation of integration systems, including mediator-based systems, is that the tasks involved in their creation and maintenance remain mainly manual. To address this limitation, we developed automated methods for facilitating the creation of a mediator-based system. We first implemented an automatic method for acquiring the local schemas of the sources to be integrated. We derived the global schema from the UMLS. Finally, we proposed schema- and instance-based approaches to mapping data elements from the local schemas to the global schema. To illustrate the applicability of our methods, we created a mediator-based system integrating eleven biomedical sources. This prototype is operational, available on the Internet (http://www.med.univ-rennes1.fr/cgi-bin/mougin/These/system.pl) and its evolution is managed semi-automatically.
An ontology-based support for product conceptual design
Authors: Xiaomeng Chang, Asli Sahin, Janis Terpenny
Venue: Robotics and Computer-Integrated Manufacturing (2008)

The research presented in this paper is a follow-up of our prior work involving the development of a graphical modeling tool to support designers at the conceptual design stage. To close the loop for supporting designers in generating design concepts flexibly, fast, and easily, an ontology-based approach for knowledge management that works along with the graphical modeling tool is discussed. Ontology and databases for the tool are developed to promote the systematic capture of design knowledge and efficient reuse of the design knowledge selection. In order to locate the proper information and query the data from the databases, the relationship between the ontology and databases, the data analysis process, ontology enrichment, and the ontology-based query engine are built to offer users multiple design results according to users' requirements. A tire design example is presented to demonstrate the proposed approach. The ontology-based method described in this paper can help retrieve and save the complex relations, support the reasoning, integrate heterogeneous data resources and offer users more accurate, proper and comprehensive data.
The Irony of Craigslist
Authors: Charles Day
Venue: Computing in Science and Engineering (2008)

Columnist Charles Day looks a little closer at irony and how it plays into social interaction over the Web.
Educational game design for online education
Authors: Pablo Moreno-Ger, Daniel Burgos, Iván Martínez-Ortiz, José Luis Sierra, Baltasar Fernández-Manjón
Venue: Computers in Human Behavior (2008)

The use of educational games in learning environments is an increasingly relevant trend. The motivational and immersive traits of game-based learning have been deeply studied in the literature, but the systematic design and implementation of educational games remain an elusive topic. In this study some relevant requirements for the design of educational games in online education are analyzed, and a general game design method that includes adaptation and assessment features is proposed. Finally, a particular implementation of that design is described in light of its applicability to other implementations and environments.