ppxscal/embedding_network huggingface dataset:
A Load Scattering Algorithm for Dynamic Routing of Automated Material Handling Systems
Authors: Alex K. Ng, Janet Efstathiou, Henry Y. Lau
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

An agent-based dynamic routing strategy for a generic automated material handling systems (AMHS) is developed. The strategy employs an agent-based paradigm in which the control points of a network of AMHS components are modelled as cooperating node agents. With the inherent features of route discovery a set of shortest and near-shortest path, an average-flow route selection algorithm is developed to scatter the load of an AMHS. Their performance is investigated through a detailed simulation study. The performance of the proposed dynamic routing strategy is benchmarked with the shortest path algorithm. The results of the simulation experiments are presented and their performance compared under a number of performance indices including the hop count, flow and ability to balance network loading.
A power-efficient data gathering scheme on grid sensor networks
Authors: Chow-Sing Lin, Chia-Nan Huang, Rong-Jyue Fang
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

Wireless sensor networks are composed of a group of geographically dispersed sensor nodes and a sink node, which can be utilized in military application and environmental observation of scientific research. Sensor nodes route the collected data to the sink node via multi-hop wireless links. Batteries usually serve as the power source for sensor nodes and typically can not be recharged or replaced when the energy is exhausted. Therefore, how to efficiently utilize the energy and thus prolong the overall life time of a sensor network is an important issue. In the past, the chain architecture proposed in PEGASIS is demonstrated to succeed in prolonging the life time of a sensor network. However, it incurs significant propagation delay in transmitting sensed data to the sink node. In this paper, we propose a novel data gathering scheme based on a chain-oriented grid architecture, called Grid Chain (G-Chain). Through the proposed G-Chain scheme, we restrict the transmission distance between nodes to prevent the energy consumption from being proportional to the transmission distance to the fourth power. In addition, we also use the multiple greedy chains algorithm to form chain in the cells, thereby effectively reducing the transmission delay. The simulation results show that our proposed approach can achieve energy efficiency, especially when sensor nodes are densely deployed. Moreover, the G-Chain can also reduce delay in data transmission, balance the energy consumption among sensor nodes, and prolong the life time of a sensor network.
Putting Performance Engineering into Model-Driven Engineering: Model-Driven Performance Engineering
Authors: Mathias Fritzsche, Jendrik Johannes
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)

Late identification of performance problems can lead to significant additional development costs. Hence, it is necessary to address performance in several development phases by performing a performance engineering process. We show that Model-Driven Engineering (MDE) specifics can be utilised for performance engineering. Therefore, we propose a process combining MDE and performance engineering called Model-Driven Performance Engineering (MDPE).Additionally we present our first experiences in application of MDPE concepts.
Multi-agent Simulation to Implementation: A Practical Engineering Methodology for Designing Space Flight Operations
Authors: William J. Clancey, Maarten Sierhuis, Chin Seah, Chris Buckley, Fisher Reynolds, Tim Hall, Mike Scott
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

OCAMS is a practical engineering application of multi-agent systems technology, involving redesign of the tools and practices in a complex, distributed system. OCAMS is designed to assist flight controllers in managing interactions with the file system onboard the International Space Station. The "simulation to implementation" development methodology combines ethnography, participatory design, multiagent simulation, and agent-based systems integration. We describe the model of existing operations and how it was converted into a future operations simulation that embeds a multiagent tool that automates part of the work. This hybrid simulation flexibly combines actual and simulated systems (e.g., mail) and objects (e.g., files) with simulated people, and is validated with actual data. A middleware infrastructure for agent societies is thus demonstrated in which agents are used to link arbitrary hardware and software systems to distributed teams of people on earth and in space--the first step in developing an interplanetary multiagent system.
High-performance technical computing with erlang
Authors: Alceste Scalas, Giovanni Casu, Piero Pili
Venue: Proceedings of the 7th ACM SIGPLAN workshop on ERLANG (2008)

High-performance Technical Computing (HPTC) is a branch of HPC (High-performance Computing) that deals with scientific applications, such as physics simulations. Due to its numerical nature, it has been traditionally based on low-level or mathematically-oriented languages (C, C++, Fortran), extended with libraries that implement remote execution and inter-process communication (like MPI and PVM). But those libraries just provide what Erlang does out-of-the-box: networking, process distribution, concurrency, interprocess communication and fault tolerance. So, is it possible to use Erlang as a foundation for developing HPTC applications? This paper shows our experiences in using Erlang for distributed number-crunching systems. We introduce two extensions: a simple and efficient foreign function interface (FFI), and an Erlang binding for numerical libraries. We use them as a basis for developing a simple mathematically-oriented programming language (in the style of Matlab™) compiled into Core Erlang. These tools are later used for creating a HPTC framework (based on message-passing) and an IDE for distributed applications. The results of this research and development show that Erlang/OTP can be used as a platform for developing large and scalable numerical applications.
Lessons learned: game design for large public displays
Authors: Matthias Finke, Anthony Tang, Rock Leung, Michael Blackstock
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

This paper presents the design and deployment of Polar Defence, an interactive game for a large public display. We designed this display based on a model of "users" and their interactions with large public displays in public spaces, which we derived from prior work. We conducted a four-day user study of this system in a public space to evaluate the game and its impact on the surrounding environment. Our analysis showed that the installation successfully encouraged participation among strangers, and that its design and deployment addressed many of the challenges described by prior research literature. Finally, we reflect on this deployment to provide design guidance to other researchers building large interactive public displays for public spaces.
The Local True Weight Decay Recursive Least Square Algorithm
Authors: Chi Sing Leung, Kwok-Wo Wong, Yong Xu
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

The true weight decay recursive least square (TWDRLS) algorithm is an efficient fast online training algorithm for feedforward neural networks. However, its computational and space complexities are very large. This paper first presents a set of more compact TWDRLS equations. Afterwards, we propose a local version of TWDRLS to reduce the computational and space complexities. The effectiveness of this local version is demonstrated by simulations. Our analysis shows that the computational and space complexities of the local TWDRLS are much smaller than those of the global TWDRLS.
Strategic Alignment in the Context of e-Services --- An Empirical Investigation of the INSTAL Approach Using the Italian eGovernment Initiative Case Study
Authors: Gianluigi Viscusi, Laure-Hélène Thevenet, Camille Salinesi
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

Strategic alignment is an issue that is not just met in companies, but also in governments, governmental agencies and public administrations. This paper investigates the issues raised by strategic alignment in the context of eGovernment initiatives focused on e-services. The analysis reports a case study that explores the strategic alignment issue with the INSTAL method. Two facets are tackled: (a) the modeling of strategic alignment using a formal approach, and (b) the elicitation of evolution requirements based on the analysis of strategic alignment models.
Reality-Check for DTN Routing Algorithms
Authors: Arshad Islam, Marcel Waldvogel
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Many applications of ad-hoc networks include intermittent connectivity. Anyone wishing to implement routing into her delay-tolerant network can select from a wide variation of options, but the choice is hard, as there is no strong comparative evidence to the relative performance of the algorithms. Every paper uses a different setting, mostly far from realistic. In our desire to improve the basis for decisions, we simulated a promising selection of DTN routing algorithms in three vastly different scenarios, all based on publicly available real-world traces. Using our open-source DTN simulator, we compare and analyse 11 routing techniques, then provide explanations for the behaviour and give advice for choosing a suitable mechanism. To our own surprise, the results challenge the conventional wisdom gained from synthetic simulations and poses the question whether the world is ready for DTNs.
Vortex: A New Family of One-Way Hash Functions Based on AES Rounds and Carry-Less Multiplication
Authors: Shay Gueron, Michael E. Kounavis
Venue: Proceedings of the 11th international conference on Information Security (2008)

We present Vortex a new family of one way hash functions that can produce message digests of 256 bits. The main idea behind the design of these hash functions is that we use well known algorithms that can support very fast diffusion in a small number of steps. We also balance the cryptographic strength that comes from iterating block cipher rounds with SBox substitution and diffusion (like Whirlpool) against the need to have a lightweight implementation with as small number of rounds as possible. We use only 3 AES rounds but with a stronger key schedule. Our goal is not to protect a secret symmetric key but to support perfect mixing of the bits of the input into the hash value. Three AES rounds are followed by our variant of Galois Field multiplication. This achieves cross-mixing between 128-bit sets. We present a set of qualitative arguments why we believe Vortex is secure.
A `Pumping' Model for the Spreading of Computer Viruses
Authors: Geoffrey Canright, Kenth Engø-Monsen
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

We present qualitative arguments concerning the probable infection pattern in a directed graph under the (weak or strong) influence of the outside world. This question is relevant for real computer viruses, which spread by following the (logical) directed links formed by address lists. Our arguments build on previous work in two (seemingly unrelated) areas: epidemic spreading on undirected graphs, and eigenvectors of directed graphs as applied to Web page ranking. More specifically, we borrow a recently proven result (used to design a 'sink remedy' for Web link analysis) and use it to argue for a threshold effect: that the effects of the outside world will not appear in the pattern of infection until the strength of the influence of the outside world exceeds a finite threshold value. We briefly discuss possible tests of this prediction, and its implications.
Copeland Voting Fully Resists Constructive Control
Authors: Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

Control and bribery are settings in which an external agent seeks to influence the outcome of an election. Faliszewski et al. [9] proved that Llull voting (which is here denoted by Copeland1) and a variant (here denoted by Copeland0) of Copeland voting are computationally resistant to many, yet not all, types of constructive control and that they also provide broad resistance to bribery. We study a parameterized version of Copeland voting, denoted by Copeland ¿ , where the parameter ¿ is a rational number between 0 and 1 that specifies how ties are valued in the pairwise comparisons of candidates in Copeland elections. For each rational ¿, 0 < ¿< 1, and each previously studied control scenario, we either prove that Copeland ¿ is computationally vulnerable to control in that scenario (i.e., we give a P-time algorithm that determines whether control is possible, and if so, determines exactly how to exert the control) or we prove that Copeland ¿ is computationally resistant to control in that scenario (i.e., we prove that control problem to be NP-hard). In particular, we prove that Copeland0.5, the system commonly referred to as "Copeland voting," provides full resistance to constructive control. Among systems with a polynomial-time winner problem, this is the first natural election system proven to have full resistance to constructive control. Looking at rational ¿, 0 < ¿< 1, we give a broad set of results on bribery and on the fixed-parameter tractability of bounded-case control for Copeland ¿ (previously only Copeland0 and Copeland1 had been studied), and we introduce and obtain fixed-parameter tractability results even in a new, more flexible model of control (that we dub "extended control").
Honest bounds for complexity classes of recursive functions
Authors: Albert R. Meyer, Robert Moll
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

A new simplified proof of the McCreight-Meyer Honesty or Naming Theorem is given. Let t be a recursive function, and let F(t) be the set of recursive function computable within time bound t. Then it is shown that an honest recursive t′ can be found which is arbitrarily large on a dense set of arguments such that F(t) = F(t′).
A Practical MDA Approach for Autonomic Profiling and Performance Assessment
Authors: Fabio Perez Marzullo, Rodrigo Novo Porto, Divany Gomes Lima, Jano Moreira Souza, José Roberto Blaschek
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

By releasing their Model Driven Architecture (MDA) as a new standard, the Object Management Group (OMG) [1] proposed a new development concept toward existing traditional paradigms. It set a new exciting research area in which it would be possible to develop truly independent and powerful programming environments capable of achieving new levels of productivity, performance and maintainability. With this goal in mind, this paper describes a research conducted with the purpose of improving database performance through the union of autonomic computing aspects and MDA. It is widely accepted that the model development approach is gaining importance in IT projects today; therefore the technique discussed here, presents a way of assessing performance, identifying flaws and improving software activities in order to create a self-managed environment. With new defined stereotypes and tagged values; in conjunction with profiling libraries, and relying on autonomic aspects, the proposed extension enables code generation in order to conduct a thorough set of performance analysis, indicating the best suitable database configuration for a given functionality. After setting the underlying problem, explaining tools configuration and concepts and describing the profiling technique, it presents a study based on a real project conducted by the Brazilian Ministry of Defense.
On two qualitative approaches to tolerant inclusion operators
Authors: P. Bosc, O. Pivert
Venue: Fuzzy Sets and Systems (2008)

This paper is devoted to two extensions of the inclusion operator. The general idea advocated here is the tolerance for qualitative exceptions, which leads to the definition of a tolerant inclusion. The strategy proposed is founded on the (graded) allowance for low-intensity exceptions. Two approaches are presented and discussed in terms of properties and their use for database flexible querying serves as an illustration.
An Upper Bound on the Average Size of Silhouettes
Authors: M. Glisse, S. Lazard
Venue: Discrete Computational Geometry (2008)

It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for a large class of objects, namely for polyhedra or, more generally, tessellated surfaces that approximate surfaces in some reasonable way. The approximated surfaces are two-manifolds that may be nonconvex and nondifferentiable and may have boundaries. The tessellated surfaces should, roughly speaking, have no short edges, have fat faces, and the distance between the mesh and the surface it approximates should never be too large. We prove that such tessellated surfaces of complexity n have silhouettes of expected size $O(\sqrt{n}),$ where the average is taken over all points of view. The viewpoints can be chosen at random at infinity or at random in a bounded region.
Tracking Articulated Hand Underlying Graphical Model with Depth Cue
Authors: Tangli Liu, Wei Liang, Xinxiao Wu, Lei Chen
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Visual tracking of articulated objects in real 3D space is challenging with applications in advanced human–computer interfaces and gesture semantic understanding. In this paper, graphical model, constructing articulated human hand, and NBP algorithm embedded with CAMSHIFT, inferencing hand configuration in 3D space, are applied for visual hand tracking. We also introduce image depth cue captured by two calibrated cameras together with color and edge as observation model. Depth cue allows our method to track human hand incomparatively accurate distance from cameras, especially in cluttered scenes with objects of similar color or edge. All those image cues are converted necessarily to probability distribution applied for the graphical model frame. The proposed method promotes the tracking efficiency and robustness proved by experiments and theory analysis.
Distance Education Network for Strengthening the Education Movement in Nigeria
Authors: Ezeja Ogili
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

Nigeria is the largest race in African continent with a population of 140,000,000 people. It also contributes to the high rate of illiterates among the nine populous countries of the world. Existence has always meant for man, a succession of challenges. Moreover, the preservation and utilization of natural resources can only be assured through heavy investments in knowledge and ability aimed at all inhabitants of our country Nigeria. Education represents the conscious, deliberate and well equipped aspect of that steady progression which is the law of all human beings. Challenges are still with us and have not loss nothing in each particular life or given community they arise in different combination and obey a different order of priorities. 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
Quality-Based Score Normalization for Audiovisual Person Authentication
Authors: Enrique Argones Rúa, José Luis Castro, Carmen García Mateo
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

This paper addresses the problem of biometric audiovisual person authentication in realistic acquisition conditions. Differences in environmental factors or acquisition devices between enrollment and test conditions modify the verification scores distribution and degrade verification performance if not taken into account. A theoretical framework that incorporates quality measures to biometric authentication is introduced. As a result, the necessary and sufficient condition that a quality measure must hold to enable improved verification performance is given. Two quality-based score normalization techniques are derived that successfully incorporate quality factors in the verification decision process. Experiments on the multimodal BANCA database for video-based face verification and speaker verification show a statistically significant verification performance improvement when using the proposed quality-based score normalization techniques.
Internal and External Memory in Neuroevolution for Learning in Non-stationary Problems
Authors: Francisco Bellas, Jose A. Becerra, Richard J. Duro
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

This paper deals with the topic of learning through neuroevolutionary algorithms in non-stationary settings. This kind of algorithms that evolve the parameters and/or the topology of a population of Artificial Neural Networks have provided successful results in optimization problems in stationary settings. Their application to non-stationary problems, that is, problems that involve changes in the objective function, still requires more research. In this paper we address the problem through the integration of implicit, internal or genotypic, memory structures and external explicit memories in an algorithm called Promoter Based Genetic Algorithm with External Memory (PBGA-EM). The capabilities introduced in a simple genetic algorithm by these two elements are shown on different tests where the objective function of a problem is changed in an unpredictable manner.
Technical Section: Circular spatial filtering under high-noise-variance conditions
Authors: Nilamani Bhoi, Sukadev Meher
Venue: Computers and Graphics (2008)

This paper introduces a novel circular spatial filtering scheme for suppressing additive white Gaussian noise (AWGN) under high-noise-variance conditions. In this method, a circular spatial-domain window, whose weights are derived from two independent functions: (i) spatial distance and (ii) gray level distance, is employed for filtering. The proposed filter is different from the Bilateral filter [Tomasi C, Manduchi R. Bilateral filtering for gray and color images. In: Proceedings of the IEEE internal conference on computer vision 1998. p. 836-46] and performs well under high-noise conditions. It is capable of smoothing Gaussian noise as well as retaining detailed information of images. It gives significant performance in terms of peak-signal-to-noise ratio (PSNR) and universal quality index (UQI) and outperforms many known existing spatial-domain and wavelet-domain filters. The filtered image also gives better visual quality than the existing methods.