ppxscal/embedding_network huggingface dataset:
Design and preliminary study of the W-PRDR: a new congestion control scheme for wireless networks
Authors: Ilhem Lengliz, Abir Ben Ali, Farouk Kamoun
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

This work presents the design and preliminary performance evaluation of a new congestion control mechanism for multimedia applications over wireless networks: the Wireless Proportional and Derivative Algorithm (W-PRDR). W-PRDR is based on the exchange of RTCP reports to feed the sources with the supported rate so that they can adapt their transmission rate according to the loss state and the allowed fair share bandwidth in the network. In order to fit to a wireless environment, we enhanced the original PRDR algorithm with a loss discrimination scheme to distinguish between congestion losses and random errors due to wireless transmission. We show through simulation the capacity of the W-PRDR mechanism to improve the transmission rate under different simulated network topologies.
Assemblies as Phase-Locked Pattern Sets That Collectively Win the Competition for Coherence
Authors: Thomas Burwick
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

The formation of temporal coding assemblies requires synchronizing mechanisms to establish the coherence of the corresponding patterns, as well as desynchronizing mechanisms that separate it from other possibly overlapping patterns. Here, we use a recently proposed desynchronizating mechanism, denoted as acceleration. This mechanism lets each unit of the network oscillate with higher frequency in case of stronger and/or more coherent input from the other units. In the context of Hebbian memory, it implies a competition for coherence among the stored patterns. The profound effect on the segmentation of patterns is demonstrated. Going beyond earlier discussions, we also illustrate the concept of an assembly as a collection of phase-locked coherent patterns. This points to a role of synchronization strength as controlling the degree of association, that is, determining the number of patterns that are collected in the assembly.
Opponent Provocation and Behavior Classification: A Machine Learning Approach
Authors: Ramin Fathzadeh, Vahid Mokhtari, Mohammad Reza Kangavari
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

Opponent Modeling is one of the most attractive and practical arenas in Multi Agent System (MAS) for predicting and identifying the future behaviors of opponent. This paper introduces a novel approach using rule based expert system towards opponent modeling in RoboCup Soccer Coach Simulation. In this scene, an autonomous coach agent is able to identify the patterns of the opponent by analyzing the opponent's past games and advising own players. For this purpose, the main goal of our research comprises two complementary parts: (a) developing a 3-tier learning architecture for classifying opponent behaviors. To achieve this objective, sequential events of the game are identified using environmental data. Then the patterns of the opponent are predicted using statistical calculations. Eventually, by comparing the opponent patterns with the rest of team's behavior, a model of the opponent is constructed. (b) designing a rule based expert system containing provocation strategies to expedite detection of opponent patterns. These items mentioned are used by coach, to model the opponent and generate an appropriate strategy to play against the opponent. This structure is tested in RoboCup Soccer Coach Simulation and MRLCoach was the champion at RoboCup 2006 in Germany.
The Detection of an Approaching Sound Source Using Pulsed Neural Network
Authors: Kaname Iwasa, Takeshi Fujisumi, Mauricio Kugler, Susumu Kuroyanagi, Akira Iwata, Mikio Danno, Masahiro Miyaji
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

Current automobiles' safety systems based on video cameras and movement sensors fail when objects are out of the line of sight. This paper proposes a system based on pulsed neural networks able to detect if a sound source is approaching a microphone or moving away from it. The system, based on PN models, compares the sound level difference between consecutive instants of time in order to determine its relative movement. Moreover, the combined level difference information of all frequency channels permits to identify the type of the sound source. Experimental results show that, for three different vehicles sounds, the relative movement and the sound source type could be successfully identified.
Automatic GUI Generation for Meta-data Based PUCC Sensor Gateway
Authors: Masatoshi Ogura, Hiroshi Mineno, Norihiro Ishikawa, Tomoyuki Osano, Tadanori Mizuno
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

Many kinds of communication protocols exist for sensor networks. Therefore, it is difficult to use the sensing data from different kinds of sensor networks. The Peer-to-Peer Universal Computin a Consortium (PUCC) is investigating studies on a seamless peer-to-peer communications technology platform that enables the creation of ubiquitous high level services between connected network devices as well as sensor networks. We developed an automatic graphical user interface (GUI) generation module for a meta-data based PUCC sensor gateway (GW). This module makes it easy to configure a personal service that enables the combination of different kinds of events in heterogeneous sensor networks.
Cores of Simplicial Complexes
Authors: Mario Marietti, Damiano Testa
Venue: Discrete Computational Geometry (2008)

We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. Applying this method to complexes arising from graphs, we give topological meaning to classical graph invariants. As a consequence, we answer some questions raised in (Ehrenborg and Hetyei in Eur. J.&#x00a0;Comb. 27(6):906&#x2013;923, 2006) on the independence complex and the dominance complex of a forest and obtain improved algorithms to compute their homotopy types.
A numerical algorithm for solving Laplace and poisson type partical differential equations on a uniform rectangular mesh with Dirichlet and Neumann boundary conditions
Authors: Vasos Pavlika
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

In this paper a numerical algorithm is described for solving the boundary value problem associated with Laplace and Poisson type equations with Dirichlet, Neumann and Robin boundary conditions. An analytic treatment of the governing partial differential equation is undertaken to illustrate the unsuitability of attempting a solution using the technique of separation of variables. Exact solutions are set up and the algorithm is compared against this exact solution determined on a unit square. The technique used was found to be in good agreement with the exact solutions that were considered. The governing partial differential equation arises naturally when considering flow problems when the physical plane is mapped onto an infinite rectangle with the mutually orthogonal coordinates being the stream function Ψ(x, y) and the velocity potential function ϕ(x, y) as described in Pavlika [5].
Statistical process control for software: a systematic approach
Authors: Nicola Boffoli, Giovanni Bruno, Danilo Caivano, Gemma Mastelloni
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Software process monitoring is a complex activity. Recently many authors have been suggesting the use of Statistical Process Control (SPC) for software process monitoring while others have pointed out potential pitfalls in using this approach. SPC is often used "as is" without the appropriate customizations or extensions to software, given the peculiarities and differences of software processes compared to manufacturing ones. As so the starting point to understand how and whether SPC can be used in software is to understand its contribution in monitoring processes. This work puts together experience collected by the authors in using SPC in industrial contexts, points out the main issues concerning software process monitoring and highlights how the technique addresses them. The main contribution of the paper is to formalize and put a set of guidelines together in a disciplined process for guiding practitioners in correctly using SPC during process monitoring.
Implementation of 802.21 for Seamless Handover Across Heterogeneous Networks
Authors: Wonseok Lee, Mun-Seok Kang, Mi-Sook Lim
Venue: Proceedings of the 10th Asia-Pacific Network Operations and Management Symposium on Managing Next Generation Networks and Services (2007)

MIH (Media Independent Handover)[1] is the standard technology of IEEE 802.21. It gives seamless handover to mobile terminals that have multiple wireless interfaces. Recently, many mobile terminals having multiple wireless interfaces are emerging on the market. Thus, the handover technology, which makes it possible to hand-over between heterogeneous networks, is attracting the attention of network operators. In this article, we explain IEEE 802.21 framework and its laboratory implementation and compare between IEEE 802.21-based handover and non-802.21-based handover. We performed laboratory experiments on handover between IEEE 802.11 (WiFi) access networks and IEEE 802.3 (Ethernet) using MIH Functions. We also analyzed and compared 802.21-assisted handover and non-802.21-assisted handover.
A Neural Network Based Optimization Method for a Kind of QPPs and Application
Authors: Shiehshing Lin
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

In this paper, we present a neural network based optimization method for solving a kind of quadratic programming problems (QPPs) with equality and inequality constraints. The proposed method is appropriate for distributed implementation and can be used as a basic optimization module for managing optimization problems of large distributed systems. We test the proposed method in a real PC-Network for power system state estimation problem. Several cases are considered and obtain some successfully results. 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
Programming Robots in Primary Schools Deserves a Renewed Attention
Authors: G. Barbara Demo
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

Robot programming is introduced in primary schools in order to offer both children and teachers the opportunity of concrete programming that is approaching the basics of informatics as a science while performing activities concerning the standard curricula subjects. Fundamental components of our proposal are: a) the use of different types of small autonomous robots as computer systems children develop programs for, b) programming with a textual, Logo-like language in order to avoid problems caused by the language in use during first programming activities, c) a cross-disciplinary didactical methodology where each robot activity is a learning environment nurturing as its principal concern concepts from traditional school subjects, d) a community of practice teachers can rely on, so that they do not hesitate experimenting because guaranteed of quick technical and pedagogical help. During 2007/2008 school year, the approach concerned about 30 primary school classes using different robots.
A CSP-Based Approach for Solving Parity Game
Authors: Min Jiang, Changle Zhou, Guoqing Wu, Fan Zhang
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

No matter from the theoretical or practical perspective, solving parity game plays a very important role. On one side, this problem possesses some amazing properties of computational complexity, and people are still searching for a polynomial time algorithm. On the other side, solving it and modal mu-calculus are almost the same in nature, so any efficient algorithm concerning this topic can be applied to model checking problem of modal mu-calculus. Considering the importance of modal mu-calculus in the automatic verification field, a series of model checkers will benefit from it. The main purpose of our study is to use constraints satisfaction problem (CSP), a deeply-studied and widely-accepted method, to settle parity game. The significance lies in that we can design efficient model checker through introducing various CSP algorithms, hence open a door to explore this problem of practical importance from a different viewpoint. In the paper, we propose a CSP-based algorithm and the related experimental results are presented.
MADeM: a multi-modal decision making for social MAS
Authors: Francisco Grimaldo, Miguel Lozano, Fernando Barber
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

This paper presents MADeM, a multi-modal agent decision making to provide virtual agents with socially acceptable decisions. We consider multi-modal decisions as those that are able to merge multiple information sources received from a MAS. MADeM performs social decisions since it relies on auctions, a well known market-based coordination mechanism. Our social agents express their preferences for the different solutions considered for a specific decision problem, using utility functions. Therefore, coordinated social behaviors such as task passing or planned meetings can be evaluated to finally obtain socially acceptable behaviors. Additionally, MADeM is able to simulate different kinds of societies (e.g. elitist, utilitarian, etc), as well as social attitudes of their members such as, egoism, altruism, indifference or reciprocity. MADeM agents have been successfully verified in a 3D dynamic environment while simulating a virtual university bar, where different types of waiters (eg. coordinated, social, egalitarian) and customers (e.g. social, lazy) interact to finally animate complex social scenes.
Bacterial Foraging Based Optimization Design of Fuzzy PID Controllers
Authors: Hung-Cheng Chen
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

In this paper, a bacterial foraging optimization scheme (BFOS) is proposed for the multi-objective optimization design of a fuzzy PID controller and applies it to the control of an active magnetic bearing (AMB) system. Different from PID controllers with fixed gains, the fuzzy PID controller is expressed in terms of fuzzy rules whose rule consequences employ analytical PID expressions. The PID gains are adaptive and the fuzzy PID controller has more flexibility and capability than the conventional ones. Moreover, it can be easily utilized to develop a precise and fast control algorithm in optimal design. The BFOS is used to design the fuzzy PID controller. The centers of the triangular membership functions and the PID gains for all fuzzy control rules are selected as parameters to be determined. The dynamic model of AMB system for axial motion is also presented. The simulation results of this AMB system show that a fuzzy PID controller designed via the proposed BFOS has good performance.
A New Property of Hamming Graphs and Mesh of d-ary Trees
Authors: Alain Bretto, Cerasela Jaulin, Luc Gillibert, Bernard Laget
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

In this article we characterize two well-known graphs used in many applications, particularly in network applications: Hamming graphs and meshes of d-ary trees MT(d,1). More precisely, we show that they are so-called $\mathbb{G}$-graphs. $\mathbb{G}$-graphs are a new type of graphs constructed from a group. They have nice algebraic proprieties and can be regular or semi-regular.
The panoptic state: Privacy, surveillance and the balance of risk
Authors: Frank Bannister
Venue: Information Polity (2005)

Advances in technology and changes in the way that we communicate and store information have steadily increased the vulnerability of informational privacy. This vulnerability is compounded by a combination of increased concerns about citizen security and developments in e-government designed to improve state services and reform the public sector. Starting from a statement of principle of the right to informational privacy, recent technological developments are surveyed, the dangers they pose to privacy and existing protections are discussed. The question of risk in this context is then explored and, resulting from this, a number of mechanisms for achieving a better balance between the right to individual privacy and the need for communal security in an information society are proposed.
Symmetrical Invariant LBP Texture Descriptor and Application for Image Retrieval
Authors: Zhiping Shi, Fei Ye, Qing He, Zhongzhi Shi
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

In this paper, we present a symmetrical invariant LBP (SILBP) texture descriptor based on the texture pattern equivalent, which is defined according to visual perception of textures. Then we extend the SILBP to linear SILBP. Our experiments on image retrieval show that the proposed texture discriptor has the advantages of symmetrical invariant, rotation robustness and computing simplicity.
Dynamic Pipeline Mapping (DPM)
Authors: A. Moreno, E. César, A. Guevara, J. Sorribes, T. Margalef, E. Luque
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Parallel/distributed application development is an extremely difficult task for non-expert programmers, and support tools are therefore needed for all phases of the development cycle of this kind of applications. In particular, dynamic performance tuning tools can take advantage of the knowledge about the application's structure given by a skeleton based programming tool. This study shows the definition of a strategy for dynamically improving the performance of pipeline applications. This strategy, which has been called Dynamic Pipeline Mapping, improves the application's throughput by gathering the pipe's fastest stages and replicating its slowest ones. We have evaluated the new algorithm by experimentation and simulation, and results show that DPM leads to significant performance improvements.
A Behavioral Analysis in Decision Making Using Weather Information with the Fuzzy Target Based Decision Model
Authors: Akio Hiramatsu, Van-Nam Huynh, Yoshiteru Nakamori
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

In this paper, we discuss a behavioral model of decision making using weather information, making use of the so-called fuzzy target based decision model. Due to forecasting uncertainty in weather forecasts, many decision problems in practice influenced by weather information have been formulated as that of decision making under uncertainty. After introducing the fuzzy target based decision model which states that, after assessing a fuzzy target, the decision maker should select the decision which maximizes the probability of meeting his target, we will show that different behaviors of the decision maker about his target can lead to different decisions. This behavioral analysis not only provides an interpretation for influence of psychological personality features of the decision maker on his decisions, but also has a corresponding link to attitudes towards risk in terms of utility function.
Towards Variable Service Compositions Using VxBPEL
Authors: Chang-Ai Sun, Marco Aiello
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

The Business Process Execution Language (BPEL) is a widely recognized executable language supporting the specification of process-oriented service compositions. However, the language is limited in addressing variable requirements in the description of business processes. We propose to construct variable and maintainable Web services compositions with VxBPEL, an extension to BPEL we developed to define variability in business process specification. We present the main concepts of VxBPEL and show how to achieve better adaptation and variability maintenance of service compositions, which is particularly desired in the context of dynamically changing business goals and processes.
SLAM by Combining Multidimensional Scaling and Particle Filtering
Authors: Hongmo Je, Daijin Kim
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

This paper presents an algorithm for the simultaneous localization and mapping (SLAM) problem. Inspired by the basic idea of the FastSLAM which separates the robot pose estimation problem and mapping problem, we use the particle filter (PF) to estimate the pose of individual robot and use the multidimensional scaling (MDS), one of the distance mapping method, to find the relative coordinates of landmarks toward the robot. We apply the proposed algorithm to not only the single robot SLAM, but also the multi-robot SLAM. Experimental results demonstrate the effectiveness of the proposed algorithm over the FastSLAM.
Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
Authors: Goichiro Hanaoka
Venue: Proceedings of the 3rd international conference on Information Theoretic Security (2008)

In this paper, we briefly review two independent studies: (1) an information-theoretic definition and constructions of non-malleable encryption, and (2) applications of information-theoretically secure tools for enhancing security of computationally secure cryptographic primitives.
An Adaptive DVS Checkpointing Scheme for Fixed-Priority Tasks with Reliability Constraints in Dependable Real-Time Embedded Systems
Authors: Kyong Hoon Kim, Jong Kim
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Recent research on embedded real-time systems has focused on dynamic power management for fault-tolerance or dependability. In this paper, we provide an adaptive checkpointing scheme for fixed priority-based DVS scheduling in dependable real-time systems. Since there are some trade-offs in selection of dynamic processor scaling in terms of energy consumption and task reliability, we provide an adaptive energy-aware scaling assignment scheme with the feasibility test for fixed-priority scheduling with checkpointing. In the provided scheme, we analyze the number of tolerable faults of a task and the optimal checkpointing interval in order to meet the deadline and guarantee its specified reliability. The feasibility analysis of the fixed priority-based scheduling algorithm in dependable real-time systems is provided as well.