ppxscal/embedding_network huggingface dataset:
A Distributed Multi-Robot Cooperative Hunting Algorithm Based on Limit-cycle
Authors: Ming Wu, Feifei Huang, Long Wang, Jiyin Sun
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

This paper proposed a limit-cycle based algorithm for cooperative hunting task using multiple mobile robots. By integrating the model-based system and the behavior-based system, a hybrid distributed control system is established, which emphasizes on the autonomy and intelligence of each robot. On the one hand, the algorithm uses artificial potential field for multi-robot formation. On the other hand, the limit-cycle based algorithm is introduced to enable the robot team to pursue themoving target and ultimately encircle the target in a symmetrical circle formation. In addition, the paper designs a heading direction control law for obstacle avoidance, and solves the problem of robot freezing caused by counteraction between repulsion and attraction. Simulation results show the effectiveness and reliability of the proposed method in cooperative hunting control.
CEDA Currents
Venue: IEEE Design Test (2009)

This newsletter covers news, research, and events related to the IEEE Council on Electronic Design Automation.
User Centric Media of the Future Internet
Authors: Janko Calic, Petros Daras, Nick Achilleopoulos, Marianna Panebarco, Oscar Mayora, Peter Stollenmayer, Doug Williams, Tim Pennick, Nadia Magnenat-Thalmann, Carmen Guerrero, Michiel Pelt, Tim McGrath, Eugenia Fuenmayor, Nikolaos Papaoulakis, Federico Alvarez, Elias Kalapanidas, Alex Shani, Jean-Yves Le Moine
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Having witnessed a rapid development of the digital media literacy in the modern society due to a multitude of technological advances in the low-cost photography, cinematography and 2D/3D graphic design, there is a proliferation of high quality media content generated, distributed and experienced by the end users. This phenomenon, known as the User Centric Media (UCM), will play a significant role in forming of rapidly approaching era of the Future Internet. The aim of this paper is to present the consolidated opinion of the UCM cluster composed of representatives of ongoing FP6 & FP7 EU funded projects, under the guidance of the Networked Media Systems Unit of the Information Society and Media Directorate General of the European Commission. Our goal is to identify concrete scientific challenges that will probably be the constitutional pillars of the research in the area of Future Media Internet (FMI), with a particular emphasis on the issues of personalized & creative media, 3D & immersive media, and Future Internet communities.
Formal Testing of Multimodal Interactive Systems
Authors: Jullien Bouchet, Laya Madani, Laurence Nigay, Catherine Oriat, Ioannis Parissis
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

This paper presents a method for automatically testing interactive multimodal systems. The method is based on the Lutess testing environment, originally dedicated to synchronous software specified using the Lustre language. The behaviour of synchronous systems, consisting of cycles starting by reading an external input and ending by issuing an output, is to a certain extent similar to the one of interactive systems. Under this hypothesis, the paper presents our method for automatically testing interactive multimodal systems using the Lutess environment. In particular, we show that automatic test data generation based on different strategies can be carried out. Furthermore, we show how multimodality-related properties can be specified in Lustre and integrated in test oracles.
An automated reasoning system
Authors: L. Wos, S. K. Winker, E. L. Lusk
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

This paper is an introduction to an automated reasoning program developed at Northern Illinois University and Argonne National Laboratory over the past nine years. Recently the program has reached the stage where it can be considered a useful research tool in a variety of disciplines. It has solved open problems in mathematics and participated in the design of new electronic circuits. Here we describe the general types of capabilities provided to the user by the program and give examples of how they are currently being used in diverse areas of investigation.
Kode viciousObvious truths
Authors: George V. Neville-Neil
Venue: Communications of the ACM (2009)

How to determine when to put the brakes on late-running projects and untested software patches.
A Simulation of Seismic Wave Propagation at High Resolution in the Inner Core of the Earth on 2166 Processors of MareNostrum
Authors: Dimitri Komatitsch, Jesús Labarta, David Michéa
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

We use 2166 processors of the MareNostrum (IBM PowerPC 970) supercomputer to model seismic wave propagation in the inner core of the Earth following an earthquake. Simulations are performed based upon the spectral-element method, a high-degree finite-element technique with an exactly diagonal mass matrix. We use a mesh with 21 billion grid points (and therefore approximately 21 billion degrees of freedom because a scalar unknown is used in most of the mesh). A total of 2.5 terabytes of memory is needed. Our implementation is purely based upon MPI. We optimize it using the ParaVer analysis tool in order to significantly improve load balancing and therefore overall performance. Cache misses are reduced based upon renumbering of the mesh points.
Detection of MMORPG bots based on behavior analysis
Authors: Ruck Thawonmas, Yoshitaka Kashifuji, Kuan-Ta Chen
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Game bots, i.e., autoplaying game clients, are currently causing troubles to both game publishers and bona fide players of Massively Multiplayer Online Role-Playing Games (MMORPGs). Use of game bots leads to collapse of game balance, decrease of player satisfaction, and even retirement from game. To prevent this, in-game polices, played by actual human players or game masters, often roam around game zones and individually question suspicious players, which is obviously laborious and ineffective task. In contrast to other work on automatic detection of MMORPG game bots based on the window events such as keystrokes, the game traffic, and the CAPTCHA test, our research focuses on log typically recorded by game publishers for database rollback. In particular, our research is based on discrepancies in action frequencies and action types in the log between human and bot characters. We propose the bot-detection methodology consisting of two stages. In the first stage an unknown character will be classified as "bot" if its frequencies of particular actions are much higher than those of known human characters. In the second stage, the rest of characters will be classified by the support vector machine classifier based on their action types. We evaluate the proposed methodology using game log of a Korean MMORPG titled Cabal Online and confirm its effectiveness.
Virtual European School - VES
Authors: C. Bouras, D. Fotakis, V. Kapoulas, A. Koubek, H. Mayer, H. Rehatschek
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The Virtual European School (VES) is an ongoing European project - funded by the Educational Multimedia Task Force Initiative of the European Union - with the aim to develop a comprehensive on-line resource of teaching material for secondary school education. The system will be fed by a group of smaller publishing houses from fferent European countries (Austria, Italy, Greece, Great Britain) specialised in educational material. The offer will contain multimedia material, CBT products, and also additional background materials, such as passages from schoolbooks, or Internet reso ces. The technical structure of the VES system will be based on Internet technologies, with interconnected VES servers in each participating region. The multimedia material will be stored in a database, with multi-lingual annotations for each project. The exist three user groups within the VES: publishers, teachers and pupils.
Creating and using matrix representations of social interaction
Authors: Alan R. Wagner
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

This paper explores the use of an outcome matrix as a computational representation of social interaction suitable for implementation on a robot. An outcome matrix expresses the reward afforded to each interacting individual with respect to pairs of potential behaviors. We detail the use of the outcome matrix as a representation of interaction in social psychology and game theory, discuss the need for modeling the robot's interactive partner, and contribute an algorithm for creating outcome matrices from perceptual information. Experimental results explore the use of the algorithm with different types of partners and in different environments.
Theory of general linear automata
Authors: I. K. Rystsov
Venue: Cybernetics and Systems Analysis (2009)

Linear and affine automata are considered in their general form. The concept of dimensions of a finite automaton is introduced and finite automata of maximal dimensions are shown to be possible. The state reachability problem in monomial form is proved to be undecidable for two-dimensional affine automata. An analogue of Moore's theorem and theorems on homogenous and diagnostic words are also proved. An application of linear automata to mathematical economics is considered.
Learning, Interactional, and Motivational Outcomes in One-to-One Synchronous Computer-mediated versus Face-to-Face Tutoring
Authors: Stephanie Ann Siler, Kurt Vanlehn
Venue: International Journal of Artificial Intelligence in Education (2009)

Face-to-face (FTF) human-human tutoring has ranked among the most effective forms of instruction. However, because computer-mediated (CM) tutoring is becoming increasingly common, it is instructive to evaluate its effectiveness relative to face-to-face tutoring. Does the lack of spoken, face-to-face interaction affect learning gains and motivation? In this study, pairs of undergraduate students and tutors worked on physics problems either face-to-face or via a typed chat window. Although face-to-face tutoring took less time, students learned equal amounts in the two conditions. In both conditions, short tutor turns were associated with increased student learning. In both conditions, students who were more active had higher learning gains. Students in the CM condition who gained more produced more words per conversational turn. The same relationship was found in the FTF context only after back-channel feedback was taken out. A more direct measure of student activity, the relative proportion of student-initiated actions in problem-solving, was more strongly associated with student learning in the FTF context, but only for students with higher verbal SAT scores. Of the motivational variables we investigated, only students' ability goals (i.e. wanting to demonstrate one's ability to others) were influenced somewhat differently by the two contexts. These results suggest that although the difference in communication medium changes superficial characteristics of the tutoring such as its duration, most of the important pedagogical characteristics - learning gains, tutorial interaction, the activity measures associated with learning gains, and student motivation - were not affected.
Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three
Authors: Md. Abul Samee, Md. Jawaherul Alam, Muhammad Abdullah Adnan, Md. Saidur Rahman
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

A minimum segment drawing Γ of a planar graph G is a straight line drawing of G that has the minimum number of segments among all straight line drawings of G. In this paper, we give a linear-time algorithm for computing a minimum segment drawing of a series-parallel graph with the maximum degree three. To the best of our knowledge, this is the first algorithm for computing minimum segment drawings of an important subclass of planar graphs.
Discrete geometric mechanics for variational time integrators
Authors: Ari Stern, Mathieu Desbrun
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

In this chapter, we present a geometric---instead of a traditional numerical-analytic---approach to the problem of time integration. Geometry at its most abstract is the study of symmetries and their associated invariants. Variational approaches based on such notions are commonly used in geometric modeling and discrete differential geometry. Here we will treat mechanics in a similar way. Indeed, the very essence of a mechanical system is characterized by its symmetries and invariants. Thus preserving these symmetries and invariants (e.g., certain momenta) into the discrete computational setting is of paramount importance if one wants discrete time integration to properly capture the underlying continuous motion. Motivated by the well-known variational and geometric nature of most dynamical systems, we review the use of discrete variational principles as a way to derive robust, and accurate time integrators.
MaZda-A software package for image texture analysis
Authors: Piotr M. Szczypiński, Michał Strzelecki, Andrzej Materka, Artur Klepaczko
Venue: Computer Methods and Programs in Biomedicine (2009)

MaZda, a software package for 2D and 3D image texture analysis is presented. It provides a complete path for quantitative analysis of image textures, including computation of texture features, procedures for feature selection and extraction, algorithms for data classification, various data visualization and image segmentation tools. Initially, MaZda was aimed at analysis of magnetic resonance image textures. However, it revealed its effectiveness in analysis of other types of textured images, including X-ray and camera images. The software was utilized by numerous researchers in diverse applications. It was proven to be an efficient and reliable tool for quantitative image analysis, even in more accurate and objective medical diagnosis. MaZda was also successfully used in food industry to assess food product quality. MaZda can be downloaded for public use from the Institute of Electronics, Technical University of Lodz webpage.
New Regulations to the Next Generation Network
Authors: Yunping Liu, Xiongjian Liang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

The next generation network technologies are enriched shortly. We expect to employ a broadband network with a quality of service, safety and costing low, which loads data, voice, video or multimedia. In the new time, what changes should the regulations take place? We find that regulators should consider fair and free competition, saving market resources, securities, intellectual property rights and public frequencies allotting. In this paper, we will give the reasons and discuss some means we can take.
A Fast Reassembly Methodology for Polygon Fragment
Authors: Gang Xu, Yi Xian
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

A new general methodology is introduced for computer-aided reassembly of the polygon image fragments. Since polygon image fragment has a characteristic that it has obvious corners, this methodology takes advantage of such characteristic, and detects the corners by Hough transform and fuzzy reasoning. Meanwhile, it computes the length of each side, compares the side length, finds out the sides with equal length in different fragments, and then computes the gray correlation of equal sides to determine the most optimal matching location for reassembly. Experimental results show that the reassembly methodology for polygon fragment based on corner alignment and gray correlation is effective and fast.
The probability of link and route maintenance in multi hop mobile ad hoc networks
Authors: Yong Shou Wu, Do-hyeon Lee, Eun Su Kim, Jae-il Jung
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Mobile ad hoc networks are being development quickly due to the availability of cheap 802.11 chips nowadays. A lot of algorithms are proposed to enhance the performance of mobile ad hoc networks. The main challenge in mobile ad hoc networks is mobility. Due to the moving node in the mobile ad hoc network, the route breaks frequently. In most of algorithms in the mobile ad hoc network, when constituting a route to destination node, the previous relay node will select as furthest node as possible to construct shortest path. The furthest node the previous node selects as the next hop relay node, the more possibly the link of the route will break in a short time. Researches need to be done in order to study the relation between the link and route maintenance probability and factors that affect the link and route maintenance probability. In this paper, we suggested the link maintenance probability model. And based on the link maintenance probability, route maintenance probability model was provided for mobile ad hoc networks.
The Application of Regression Analysis in Correlation Research of Economic Growth in Jilin Province and Regional Income Distribution Gap
Authors: Shaojie Zhang, Yanhua Wu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The method used here was the combination of time sequence data and section data, the static analysis and dynamic analysis. Added variation coefficient and the GDP growth rate were adopted. The correlation between regional income gap between residents in Jilin Province and the economic growth in Jilin Province was analyzed with regression Analysis method.
Quantified epistemic logics for reasoning about knowledge in multi-agent systems
Authors: F. Belardinelli, A. Lomuscio
Venue: Artificial Intelligence (2009)

We introduce quantified interpreted systems, a semantics to reason about knowledge in multi-agent systems in a first-order setting. Quantified interpreted systems may be used to interpret a variety of first-order modal epistemic languages with global and local terms, quantifiers, and individual and distributed knowledge operators for the agents in the system. We define first-order modal axiomatisations for different settings, and show that they are sound and complete with respect to the corresponding semantical classes. The expressibility potential of the formalism is explored by analysing two MAS scenarios: an infinite version of the muddy children problem, a typical epistemic puzzle, and a version of the battlefield game. Furthermore, we apply the theoretical results here presented to the analysis of message passing systems [R. Fagin, J. Halpern, Y. Moses, M. Vardi, Reasoning about Knowledge, MIT Press, 1995; L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communication of the ACM 21 (7) (1978) 558-565], and compare the results obtained to their propositional counterparts. By doing so we find that key known meta-theorems of the propositional case can be expressed as validities on the corresponding class of quantified interpreted systems.
From Outermost Termination to Innermost Termination
Authors: René Thiemann
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important technique for program verification. To capture the evaluation mechanism of a programming language one has to take care of the evaluation strategy, where we focus on the outermost strategy.As there are only few techniques available to analyze outermost termination of TRSs directly, we introduce a new transformation such that a TRS is outermost terminating iff the transformed TRS is innermost terminating. In this way all of the several techniques that have been developed to investigate innermost termination become applicable to analyze outermost termination, too. We have implemented the transformation and successfully evaluated it on a large collection of TRSs.
Operational Semantics for Declarative Networking
Authors: Juan A. Navarro, Andrey Rybalchenko
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

Declarative Networking has been recently promoted as a high-level programming paradigm to more conveniently describe and implement systems that run in a distributed fashion over a computer network. It has already been used to implement various networked systems, e.g., network overlays, Byzantine fault tolerance protocols, and distributed hash tables. Declarative Networking relies upon a rule-based programming language that resembles Datalog and allows one to declaratively specify the flow of networking events. However, the presence of asynchronous communication, distribution, and imperative modification of the program state in Declarative Networking applications have been an obstacle for defining its semantics. Currently, the reference semantics is determined by the runtime environment only, which hinders further application development and makes any efforts to develop program analysis and verification tools impossible. In this paper, we propose an operational semantics for Declarative Networking that addresses these problems. The semantics is parameterized to keep open a design space required at the current stage of the language development. We also report on our first experience with an interpreter for Declarative Networking applications that implements the proposed semantics.
Photoshop Lightroom Essential Training
Authors: Chris Orwig
Venue:  (2007)

Photoshop Lightroom is a powerful new photographic workflow application designed to help photographers expand their creative potential. Photoshop Lightroom Essential Training is all about using this revolutionary new tool to its full potential. One of the main challenges of photography is dealing with the sheer volume of images that result from each shoot. In Photoshop Lightroom Essential Training , instructor and professional photographer Chris Orwig explains how browsing, organizing, and adjusting images in Photoshop Lightroom dynamically improves photo management, processing, and presentation. The training empowers photographers to establish a more effective and creative workflow so they can focus on what it s all about, the photo! Exercise files (full resolution raw files) accompany the tutorials.Topics Include:Understanding the core features and workflows of Photoshop LightroomOrganizing, rating, filtering, and managing a robust image database Processing raw imagesUsing essential time-saving shortcutsUsing Lightroom and Photoshop effectivelyDesigning slideshow presentationsPrinting and layout techniquesCreating and publishing effective web galleriesStreamlining the photographic workflowDuration: 6.5 hoursOn 1 DVD-ROM