ppxscal/embedding_network huggingface dataset:
Traits at work: The design of a new trait-based stream library
Authors: Damien Cassou, Stéphane Ducasse, Roel Wuyts
Venue: Computer Languages, Systems and Structures (2009)

Recent years saw the development of a composition mechanism called traits. Traits are pure units of behavior that can be composed to form classes or other traits. The trait composition mechanism is an alternative to multiple or mixin inheritance in which the composer has full control over the trait composition. To evaluate the expressiveness of traits, some hierarchies were refactored, showing code reuse. However, such large refactorings, while valuable, may not exhibit all possible composition problems, since the hierarchies were previously expressed using single inheritance and following certain patterns. This paper presents our work on designing and implementing a new trait-based stream library named Nile. It evaluates how far traits enable reuse, what problems can be encountered when building a library using traits from scratch and compares the traits solution to alternative composition mechanisms. Nile's core allows the definition of compact collection and file streaming libraries as well as the implementation of a backward-compatible new stream library. Nile method size shows a reduction of 40% compared to the Squeak equivalent. The possibility to reuse the same set of traits to implement two distinct libraries is a concrete illustration of trait reuse capability.
Computing an approximate jam/fold equilibrium for 3-player no-limit Texas Hold'em tournaments
Authors: Sam Ganzfried, Tuomas Sandholm
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

A recent paper computes near-optimal strategies for two-player no-limit Texas hold'em tournaments; however, the techniques used are unable to compute equilibrium strategies for tournaments with more than two players. Motivated by the widespread popularity of multiplayer tournaments and the observation that jam/fold strategies are nearoptimal in the two player case, we develop an algorithm that computes approximate jam/fold equilibrium strategies in tournaments with three --- and potentially even more --- players. Our algorithm combines an extension of fictitious play to imperfect information games, an algorithm similar to value iteration for solving stochastic games, and a heuristic from the poker community known as the Independent Chip Model which we use as an initialization. Several ways of exploiting suit symmetries and the use of custom indexing schemes made the approach computationally feasible. Aside from the initialization and the restriction to jam/fold strategies, our high level algorithm makes no poker-specific assumptions and thus also applies to other multiplayer stochastic games of imperfect information.
Layered Learning for a Soccer Legged Robot Helped with a 3D Simulator
Authors: A. Cherubini, F. Giannone, L. Iocchi
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

Mobile robots can benefit from machine learning approaches for improving their behaviors in performing complex activities. In recent years, these techniques have been used to find optimal parameter sets for many behaviors. In particular, layered learning has been proposed to improve learning rate in robot learning tasks. In this paper, we consider a layered learning approach for learning optimal parameters of basic control routines, behaviours and strategy selection. We compare three different methods in the different layers: genetic algorithm, Nelder-Mead, and policy gradient. Moreover, we study how to use a 3D simulator for speeding up robot learning. The results of our experimental work on AIBO robots are useful not only to state differences and similarities between different robot learning approaches used within the layered learning framework, but also to evaluate a more effective learning methodology that makes use of a simulator.
The power of Pi
Authors: Nicolas Oury, Wouter Swierstra
Venue: ACM SIGPLAN Notices (2008)

This paper exhibits the power of programming with dependent types by dint of embedding three domain-specific languages: Cryptol, a language for cryptographic protocols; a small data description language; and relational algebra. Each example demonstrates particular design patterns inherent to dependently-typed programming. Documenting these techniques paves the way for further research in domain-specific embedded type systems.
DIGMAP --- Discovering Our Past World with Digitised Maps
Authors: José Borbinha, Gilberto Pedrosa, Diogo Reis, João Luzio, Bruno Martins, João Gil, Nuno Freire
Venue: Proceedings of the 11th European conference on Research and Advanced Technology for Digital Libraries (2007)

DIGMAP is a project that will develop solutions for georeferenced digital libraries, especially focused on historical materials and in the promoting of our cultural and scientific heritage. The final results of the project will consist in a set of services available in the Internet, and in reusable open-source software solutions. The main service will be a specialized digital library, reusing metadata from European national libraries, to provide discovery and access to contents. Relevant metadata from third party sources will be also reused, as also descriptions and references to any other relevant external resource. The initiative will make a proof of concept reusing and enriching the contents from several European national libraries.
Multi-Agent System: A Guiding Metaphor for the Organization of Software Development Projects
Authors: Lawrence Cabac
Venue: Proceedings of the 5th German conference on Multiagent System Technologies (2007)

In this work we propose the introduction of multi-agent concepts for the organization of software development projects of (especially multi-agent) application design and implementation. This is expressed by the guiding metaphor (German: Leitbild) of a multi-agent system of developers.Team orientation and concurrent development are two aspects that are crucial in every large development project. Consequently, the organizational structure of the programming team has to take account for both. If the developed application is distributed, concurrent and team-oriented --- e.g. a multi-agent application --- one approach is to aim for a comparable (homomorphic) structure of a developed system and development team. We achieve this by reintroducing the multi-agent system: metaphor into the organizational structure of the development team.Agent attributes such as autonomy, communication, cooperation, self-organization and the capacity for teamwork are transferred by the guiding metaphor back to team members. Concurrency and distribution of resources and processes is naturally supported by the guiding metaphor.This guiding metaphor can be applied to any project organization. However, it is best suited for the organization of multi-agent application development, due to the similarity in structure.
Modeling with the Timing Definition Language (TDL)
Authors: Wolfgang Pree, Josef Templ
Venue: Model-Driven Development of Reliable Automotive Services: Second Automotive Software Workshop, ASWSD 2006, San Diego, CA, USA, March 15-17, 2006, Revised Selected Papers (2006)

This paper describes the model-based development process of hard real-time software with the Timing Definition Language (TDL): modeling and simulation of TDL components in Matlab®/Simulink®, their mapping to a specific platform and finally the code generation.
Data Mining in Tourism Demand Analysis: A Retrospective Analysis
Authors: Rob Law, Henry Mok, Carey Goh
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

Despite numerous studies have applied various forecasting models to tourism demand analysis, data mining techniques have been largely overlooked by academic researchers in tourism forecasting prior to 1999. Based on our review of published articles in tourism journals that applied data mining techniques to tourism demand forecasting, we find that the application of data mining techniques are still at their infancy. This paper concludes with practical implications and future research areas.
Comparison between 2D and 3D Local Binary Pattern Methods for Characterisation of Three-Dimensional Textures
Authors: Ludovic Paulhac, Pascal Makris, Jean-Yves Ramel
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

Our purpose is to extend the Local Binary Pattern method to three dimensions and compare it with the two-dimensional model for three-dimensional texture analysis. To compare these two methods, we made classification experiments using three databases of three-dimensional texture images having different properties. The first database is a set of three-dimensional images without any distorsion or transformation, the second contains additional gaussian noise. The last one contains similar textures as the first one but with random rotations according x, y and z axis. For each of these databases, the three-dimensional Local Binary Pattern method outperforms the two-dimensional approach which has more difficulties to provide correct classifications.
Context Data to Improve Association in Visual Tracking Systems
Authors: A. M. Sánchez, M. A. Patricio, J. García, J. M. Molina
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

A key aspect in visual surveillance systems is robust movement segmentation, which is still a difficult and unresolved problem. In this paper, we propose an architecture based on a two-layer image-processing modules: General Tracking Layer (GTL) and Context Layer (CL). GTL describe a generic multipurpose tracking process for video-surveillance systems. CL is designed as a symbolic reasoning system that manages the symbolic interface data between GTL modules in order to asses a specific situation and take the appropriate decision about visual data association. Our architecture has been used to improve the association process of a tracking system and tested in two different scenarios to show the advantages in improved performance and output continuity.
A Novel Near-Field Localization Method Based on Second Order Statistics
Authors: Hongbo Liu, Wei Zhang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The bearing and range estimation of near-field sources is studied and a novel method is presented. In our proposed algorithm the second-order statistics was used to estimate bearing of near-field sources. By exploiting the Toeplitz property of covariance matrix of far-field sources, we reconstruct a far-field approximate covariance matrix with respect to bearing only for near-field sources, which allows for the bearing estimation using the generalized far-field root MUSIC algorithm. The range estimation of all sources is consequently obtained in one time search by defining a novel 1-D MUSIC spectrum. The method has the merits of good estimation precision and its effectiveness is approved by the simulation results.
Wi-Fi neighborcast: enabling communication among nearby clients
Authors: Ranveer Chandra, Jitendra Padhye, Lenin Ravindranath
Venue: Proceedings of the 9th workshop on Mobile computing systems and applications (2008)

Several applications require physically nearby Wi-Fi clients to communicate with each other. In this paper, we present a new group communication paradigm, called Neighborcast, that forms a multicast group among all nearby clients, even when they are on different frequency channels or associated to different Access Points. We describe three ways in which neighborcast can be implemented, and present three applications that will benefit from this new group communication paradigm.
BCR: Balanced Congestion Control after Spurious RTO
Authors: Jaehyung Lee, Soobeen Ahn, Hyunseung Choo
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

TCP has been used as the standard for reliable transmission of application traffic in the internet. Recently, many kinds of wireless TCP schemes, such as TCP Westwood, have been developed with the emergence of wireless networks. Various algorithms have been suggested that are aimed at improving its performance in wireless networks. In this paper, we focus on the spurious timeouts that occur in such networks. E-RTO efficiently treats delay spikes that come from the retransmission of lost packets by the reliable wireless link layer. Also, it efficiently handles delay spikes with segment losses. However, it does not address the mobility of the user in the network. We tried to give a solution to this problem by proposing an BCR algorithm, and we evaluated the performance of BCR through simulation using NS-2. Through the experiment, we showed that the throughput and goodput of BCR are better than those of E-RTO.
Statistical and geometric methods for shape-driven segmentation and tracking
Authors: Allen Tannenbaum
Venue:  (2008)

Computer Vision aims at developing techniques to extract and exploit information from images. The successful applications of computer vision approaches are multiple and have benefited diverse fields such as manufacturing, medicine or defense. Some of the most challenging tasks performed by computer vision systems are arguably segmentation and tracking. Segmentation can be defined as the partitioning of an image into homogeneous or meaningful regions. Tracking also aims at extracting meaning or information from images, however, it is a dynamic task that operates on temporal (video) sequences. Active contours have been proven to be quite valuable at performing the two aforementioned tasks. The active contours framework is an example of variational approaches, in which a problem is compactly (and elegantly) described and solved in terms of energy functionals. The objective of the proposed research is to develop statistical and shape-based tools inspired from or completing the geometric active contours methodology. These tools are designed to perform segmentation and tracking. The approaches developed in the thesis make an extensive use of partial differential equations and differential geometry to address the problems at hand. Most of the proposed approaches are cast into a variational framework. The contributions of the thesis can be summarized as follows: (1) An algorithm is presented that allows one to robustly track the position and the shape of a deformable object. (2) A variational segmentation algorithm is proposed that adopts a shape-driven point of view. (3) Diverse approaches are introduced for including prior knowledge on shapes in the geometric active contour framework. (4) A framework is proposed that combines statistical information extracted from images with shape information learned a priori from example. (5) A technique is developed to jointly segment a 3D object of arbitrary shape in a 2D image and estimate its 3D pose with respect to a referential attached to a unique calibrated camera. (6) A methodology for the non-deterministic evolution of curves is presented, based on the theory of interacting particles systems.
Performance Evaluation of Two Search Space Reduction Methods for a Distributed Network Architecture
Authors: Leonard Barolli, Makoto Ikeda, Arjan Durresi, Fatos Xhafa, Akio Koyama
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

In our previous work, we proposed a distributed network architecture which integrates routing and CAC strategies using cooperative agents. However, in the previous research, we did not evaluated the performance of all agents. In this paper, we evaluate the performance of two search space reduction methods which are used for reduction of the search space of a GA-based routing approach. Thus, the GA can find a feasible route very fast.
Transaction Calculus
Authors: He Jifeng
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

Transaction-based services are increasingly being applied in solving many universal interoperability problems. Exception and failure are the typical phenomena of the execution of long-running transactions. To accommodate these new program features, we extend the Guarded Command Language by addition of compensation and coordination combinators, and enrich the standard design model with new healthiness conditions. The paper proposes a mathematical framework for transactions where a transaction is treated as a mapping from its environment to compensable programs. We provide a transaction refinement calculus, and show that every transaction can be converted to primitive one which simply consists of a forward activity and a compensation module.
Automata-Based Axiom Pinpointing
Authors: Franz Baader, Rafael Peñaloza
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base that have the consequence in question (MinA). Most of the pinpointing algorithms described in the DL literature are obtained as extensions of tableau-based reasoning algorithms for computing consequences from DL knowledge bases. In this paper, we show that automata-based algorithms for reasoning in DLs can also be extended to pinpointing algorithms. The idea is that the tree automaton constructed by the automata-based approach can be transformed into a weighted tree automaton whose so-called behaviour yields a pinpointing formula, i.e., a monotone Boolean formula whose minimal valuations correspond to the MinAs. We also develop an approach for computing the behaviour of a given weighted tree automaton.
Coherence Index of Radial Conjunctive Fuzzy Systems
Authors: David Coufal
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

The paper introduces the so-called coherence index of a conjunctive radial fuzzy system. The index can be treated as a measure of consistency of knowledge stored in the rule base of the system. Conjunctive fuzzy systems are the systems which employ fuzzy conjunctions for combination of antecedents (IF parts) with consequents (THEN parts) in theirs IF-THEN rules. Radial fuzzy systems are the systems which employ radial functions for representation of membership functions of incorporated fuzzy sets; and exhibiting the radial shape preservation property. Due to this property an effective mathematical analysis of these systems can be carried out. 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
Cross-Layer Scheduling for Multiple Video Streams over a Hierarchical Emergency-Deployed Network
Authors: Virginia Corvino, Velio Tralli, Roberto Verdone
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Wireless ad hoc networks attract raising interest in research due to flexibility of application and deployment. Moreover, cross-layer design is emerging as one of the most appealing approaches in network design. In this paper we focus on cross-layer scheduling of video traffic over a wireless hierarchical ad hoc network, where nodes are equipped with a camera device and are deployed over an endangered indoor area, transmitting video streams to a special node, namely the sink. This node is enroled to collect, elaborate and send them to a control unit which takes decisions accordingly. In particular, we address the problem of the multiple access in the transmission from the nodes equipped with camera devices to the sink. The scheduling strategy proposed takes into account information coming from both the physical layer and the application level. Results will show that the cross-layer strategy significantly outperforms the Maximum Throughput in case of heavily loaded systems and performs like the Maximum Throughput in case of fully loaded system.
Preliminary specifications for 100 Gigabit optical Ethernet
Authors: Micheal Berger, Jorge Seoane, Christoffer Jespersen, Lars Dittmann
Venue: Proceedings of the 6th WSEAS International Conference on Applied Electromagnetics, Wireless and Optical (2008)

This paper summarizes the work done on determining preliminary specifications for Ethernet at 100 Gigabit. A first set of tentative specifications based on previous work on 10 Gigabit Ethernet and simulation results is provided. These specifications are to be refined later in the project based on real measurements. Specifications will influence design of transmitter and receiver in the GIBON project respectively. Feedback on components target characteristics will in turn be used for refining the preliminary specifications provided. The paper also discusses Transmission impairments at high bitrates including Chromatic dispersion, Polarization mode dispersion and Non-Linear effects.
Computer Vision, Inspired by the Human Brain
Authors: Pam Frost Gorder
Venue: Computing in Science and Engineering (2008)

As scientists work to develop intelligent machines, some are taking their cues from biology. Such is the case at the Center for Biological and Computational Learning at MIT, where a computer model is emulating the human brain's vision center. The model replicates what happens during the first few fractions of a second after we see an object—the part of vision performed by the unconscious mind.
Relevant Representations for the Inference of Rational Stochastic Tree Languages
Authors: François Denis, Édouard Gilbert, Amaury Habrard, Faïssal Ouardi, Marc Tommasi
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

Recently, an algorithm - DEES - was proposed for learning rational stochastic tree languages. Given a sample of trees independently and identically drawn according to a distribution defined by a rational stochastic language, DEES outputs a linear representation of a rational series which converges to the target. DEES can then be used to identify in the limit with probability one rational stochastic tree languages. However, when DEES deals with finite samples, it often outputs a rational tree series which does not define a stochastic language. Moreover, the linear representation can not be directly used as a generative model. In this paper, we show that any representation of a rational stochastic tree language can be transformed in a reduced normalised representation that can be used to generate trees from the underlying distribution. We also study some properties of consistency for rational stochastic tree languages and discuss their implication for the inference. We finally consider the applicability of DEES to trees built over an unranked alphabet.
Towards Modal Logic Formalization of Role-Based Access Control with Object Classes
Authors: Junghwa Chae
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

This paper addresses a variation of the role-based access control (RBAC) model with a classification mechanism for objects and a notion of class hierarchies. In the proposed model, the authorization tasks are performed based on the classes instead of the individual objects. This results in more flexibility in terms of security administrative tasks such as downgrading or upgrading individual objects and permission assignments. A formalization for this model is presented using K45 modal logic. The prefixed tableaux method is used to reason about the access control. The required rules for the reasoning process are also presented. The proposed model is applied, via an example to protect the secrecy of the information in a typical organization.