ppxscal/embedding_network huggingface dataset:
Comparison of global histogram methods for 2D and 3D entropy based image segmentation
Authors: Georgi Petrov, Panayot Iliev, Plamen Tzvetkov
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

In this paper we explain two functional models for entropy based image segmentation: using global 2D and 3D image histograms of grayscale images. We compare results obtained by both methods for different type of images such as: biomedical and micro objects, digital video records and natural photographs. Short introduction of multistage gradient 3D entropy segmentation for texture analysis is also introduced. 2D and 3D entropy segmented images can be combined to achieve better results in applications such as digital video databases and multimedia information retrieval frameworks, micro object classification for material analysis and biomedical applications.
Expressive Intelligence: Artificial Intelligence, Games and New Media
Authors: Michael Mateas
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

Artificial intelligence methods open up new possibilities in art and entertainment, enabling the creation of believable characters with rich personalities and emotions, interactive story systems that incorporate player interaction into the construction of dynamic plots, and interactive installations and sculptural works that are able to perceive and respond to the human environment. At the same time as AI opens up new fields of artistic expression, AI-based art itself becomes a fundamental research agenda, posing and answering novel research questions which would not be raised unless doing AI research in the context of art and entertainment. I call this agenda, in which AI research and art mutually inform each other, Expressive AI. These ideas will be illustrated by looking at several current and past projects, including the interactive drama Facade. As a new game genre, interactive drama involves socially and emotionally charged interaction with characters in the context of a dynamically evolving plot.
Recovering Repetitive Sub-functions from Observations
Authors: Guy-Vincent Jourdan, Hasan Ural, Shen Wang, Hüsnü Yenigün
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

This paper proposes an algorithm which, given a set of observations of an existing concurrent system that has repetitive sub-functions, constructs a Message Sequence Charts (MSC) graph where repetitive sub-functions of the concurrent system are identified. This algorithm makes fewer assumptions than previously published work, and thus requires fewer and easier to generate observations to construct the MSC-graph. The constructed MSC-graph may then be used as input to existing synthesis algorithms to recover the design of the existing concurrent system.
A practical method for weak stationarity test of network traffic with long-range dependence
Authors: Ming Li, Yun-Yun Zhang, Wei Zhao
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

Testing the stationarity of real traffic remains a problem worth studying. Due to the importance of traffic theory in the Internet, to find a solution to such a problem brooks no delay. This paper presents a way to do the weak stationarity test of traffic with long-range dependence (LRD) as a single history traffic series of finite length. How to apply this method to real traffic on a packet-by-packet basis is demonstrated.
Circular Road Signs Recognition with Affine Moment Invariants and the Probabilistic Neural Classifier
Authors: Bogusław Cyganek
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

In this paper the neural classifier for recognition of the circular shaped road signs is presented. This classifier belongs to the road signs recognition module, which in turn is a part of a driver assisting system. The circular shaped prohibition and obligation signs constitute the very important groups within the set of road signs. In this case however, it is not possible for a detector to determine rotation of the shapes that would allow dimension reduction of the search space. Thus the classifier has to be able to properly work with all possible affine deformations. To alleviate this problem we propose to use as features the statistical moments which were shown to be invariant within an affine group of transformations. The classification is performed by the probabilistic neural network which is trained with sign examples extracted from the real traffic scenes. The obtained results show good accuracy of classification and fast operation time.
A demonstration of frequency hopping ad hoc and sensor network synchronization method on warp boards
Authors: Teemu Vanninen, Hannu Tuomivaara, Juha Huovinen
Venue: Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization (2008)

Despite of the fact that the time synchronization is one of the main issues in frequency hopping mobile ad hoc networks (FH MANET) or time synchronous wireless sensor networks (TWSN), it seems to be a rarely issued research subject. In the former case a network wide time reference is needed in FH code phase synchronization and in the latter case, e.g., in time stamping of the sensed phenomenon. Herein, a previously developed, simulated and published (by the authors) network time and FH code phase synchronization method that is a MANET compliant is demonstrated in a real-time environment on wireless open-access research platforms (WARP). The time or FH code phase synchronization process consists of both initial synchronization and synchronization maintaining phases. The proposed initial decision making method is master free and based on node identifiers (ID) and local information that a node collects from the surroundings. The synchronization is maintained by regularly transmitted (and received) synchronization messages. The demonstration cases are organized so that the frequency hopping characteristics of the waveform are shown together with the algorithm's ability to conduct an initial synchronization, the synchronization maintaining and late-entries to the existing network. Further, a payload data-streaming with the synchronized FH waveform is demonstrated.
Towards an Ontological Account of Agent-Oriented Goals
Authors: Renata S. Guizzardi, Giancarlo Guizzardi, Anna Perini, John Mylopoulos
Venue: Software Engineering for Multi-Agent Systems V: Research Issues and Practical Applications (2007)

The software agent paradigm has received considerable attention recently, both in research and industrial practice. However, adoption of this software paradigm remains elusive in software engineering practice. We claim that part of the adoption problem lies with the fact that mentalistic and social concepts underlying agents are subjective and complex for the average practitioner. Specifically, although there are many efforts related to the topic coming from philosophy, cognitive sciences and computer science, a uniform and well-founded semantic view on these concepts is currently lacking. This work extends an existing upper-level ontology and offers it as a foundation for evaluating and designing agent-oriented modeling languages. In particular, the paper focuses on the concept of goal, aiming at disambiguating its definition, discussing its different manifestations, and clarifying its relation to other important agent-related concepts. For that, we examine how goals are conceived and used according to some relevant literature on agent-orientation. In addition, related work on akin fields, especially philosophy and AI are used as a basis for the proposed ontological extensions.
A Simulated Annealing and 2DPCA Based Method for Face Recognition
Authors: Zhijie Xu, Laisheng Wang, Liming Yang
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

In this paper we address the problem of face recognition based on two-dimensional principal component analysis (2DPCA). The similarity measure plays an important role in pattern recognition. However, with reference to the 2DPCA based method for face recognition, studies on similarity measures are quite few. We propose a new method to identify the similarity measure by simulated annealing (SA), which is called SA similarity measure. Experimental results on two famous face databases show that the proposed method outperforms the state of the art methods in terms of recognition accuracy.
Computational geometry column 51
Authors: Joseph O'Rourke
Venue: ACM SIGACT News (2008)

Can a simple spherical polygon always be triangulated? The answer depends on the definitions of "polygon" and "triangulate". Define a spherical polygon to be a simple, closed curve on a sphere S composed of a finite number of great circle arcs (also known as geodesic arcs) meeting at vertices. Can every spherical polygon be triangulated? Figure 1 shows an example of what is intended.1 The planar analog is well-known and a cornerstone of computational geometry: the interior of every planar simple polygon can be triangulated (and efficiently so). The situation for spherical polygons is not so straightforward. There are three complications.
AIMSS: An Architecture for Data Driven Simulations in the Social Sciences
Authors: Catriona Kennedy, Georgios Theodoropoulos, Volker Sorge, Edward Ferrari, Peter Lee, Chris Skelcher
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

This paper presents a prototype implementation of an intelligent assistance architecture for data-driven simulation specialising in qualitative data in the social sciences. The assistant architecture semi-automates an iterative sequence in which an initial simulation is interpreted and compared with real-world observations. The simulation is then adapted so that it more closely fits the observations, while at the same time the data collection may be adjusted to reduce uncertainty. For our prototype, we have developed a simplified agent-based simulation as part of a social science case study involving decisions about housing. Real-world data on the behaviour of actual households is also available. The automation of the data-driven modelling process requires content interpretation of both the simulation and the corresponding real-world data. The paper discusses the use of Association Rule Mining to produce general logical statements about the simulation and data content and the applicability of logical consistency checking to detect observations that refute the simulation predictions.
Adding Local Constraints to Bayesian Networks
Authors: Mark Crowley, Brent Boerlage, David Poole
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

When using Bayesian networks, practitioners often express constraints among variables by conditioning a common child node to induce the desired distribution. For example, an `or' constraint can be easily expressed by a node modelling a logical `or' of its parents' values being conditioned to true. This has the desired effect that at least one parent must be true. However, conditioning also alters the distributions of further ancestors in the network. In this paper we argue that these side effects are undesirable when constraints are added during model design. We describe a method called shielding to remove these side effects while remaining within the directed language of Bayesian networks. This method is then compared to chain graphs which allow undirected and directed edges and which model equivalent distributions. Thus, in addition to solving this common modelling problem, shielded Bayesian networks provide a novel method for implementing chain graphs with existing Bayesian network tools.
Comparision of constraint design of FIR filter on complex error function and on magnitude and phase independently
Authors: Raghvendra Kumar, Lillie Dewan
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

An important feature of this paper is that both the algorithm presented in this paper allow for design constraints which often arise in practical filter design problems. Meeting required minimum stopband attenuation or a maximum deviation from the desired magnitude and phase responses in the passbands are common design constraints that can be handled by both the methods compared here. Constraints designing can be done either by constraints on complex error function or constraints on magnitude and phase of error. This paper shows the comparison of these two techniques.
Improving Cutting-Stock Plans with Multi-objective Genetic Algorithms
Authors: César Muñoz, María Sierra, Jorge Puente, Camino R. Vela, Ramiro Varela
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

In this paper, we confront a variant of the cutting-stock problem with multiple objectives. The starting point is a solution calculated by a heuristic algorithm, termed SHRP, that aims to optimize the two main objectives, i.e. the number of cuts and the number of different patterns. Here, we propose a multi-objective genetic algorithm to optimize other secondary objectives such as changeovers, completion times of orders pondered by priorities and open stacks. We report experimental results showing that the multi-objective genetic algorithm is able to improve the solutions obtained by SHRP on the secondary objectives.
Proceedings of the 2008 ACM SIGPLAN workshop on ML
Venue: International Conference on Functional Programming (2008)

It is our great pleasure to welcome you to ML 2008 - the 2008 ACM SIGPLAN Workshop on ML. ML is a family of programming languages that includes dialects known as Standard ML, Objective Caml, and F#. The development of these languages has inspired a large amount of computer science research, both practical and theoretical. This workshop aims to build on previous occasions (recent instances are ML 2005 in Tallinn, Estonia; 2006 in Portland, Oregon; and 2007 in Freiburg, Germany), providing a forum to encourage discussion and research on ML and related technology. The 2008 Workshop on ML is held in conjunction with the 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008) in Victoria, British Columbia, Canada on Sunday, September 21, 2008. In response to the call for papers, we received 13 submissions. Each paper was reviewed by at least 3 program committee members or external reviewers. After a 5-day electronic discussion, the program committee selected 9 papers for presentation at the workshop. We are also fortunate to have an invited talk from Andrew Kennedy, researcher in Programming Principles and Tools Group, Microsoft Research Cambridge, about his recent work on types for units of measure in F#.
Automatic extraction of the main terminology used in empirical software engineering through text mining techniques
Authors: Francisco P. Romero, José A. Olivas, Marcela Genero, Mario Piattini
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

The need for an explicit common terminology within Empirical Software Engineering (an ESE-Glossary of terms) was highlighted in the ISERN 2007 meeting [2]. The goal was to define a glossary of terms related to ESE based on an initial glossary published in http://lens-ese.cos.ufrj.br/wikiese. This initial glossary was built manually, based on expert knowledge. However, owing to the dynamic nature of the research works in ESE, this glossary must be dynamically updated with information extracted from the relevant documents in the research domain. Automation is, therefore, mandatory. We propose a text mining technique for the automatic extraction of the most relevant terms used in ESE documents. Our technique also provides the relationships between terms, with the degree of affinity between them. Our approach could, therefore, be useful in the improvement of the initial glossary of terms and in discovering relationships between terms.
Business Relationships in Grid Workflows
Authors: Ioannis Papagiannis, Dimosthenis Kyriazis, Magdalini Kardara, Vassiliki Andronikou, Theodora Varvarigou
Venue: Proceedings of the 5th international workshop on Grid Economics and Business Models (2008)

Although initially designed to cover the needs of computationally-intensive applications, Grid technology of nowadays aims at providing an infrastructure that can also serve the needs of the business domain. Taking into consideration that the available service providers may have business / strategic relationships, this paper focuses on describing an approach for modeling these relationships. Furthermore and since these relationships may affect the parameters regarding the offered Quality of Service (QoS) level, we present a metric for characterizing a service providers "friendliness". The latter can be used to promote the most positively influential providers and put aside those with a negative influence during a QoS-based selection process in Grid workflow management systems.
Simplest Instructions: Finding Easy-to-Describe Routes for Navigation
Authors: Kai-Florian Richter, Matt Duckham
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However, numerous findings in cognitive science show that the ease of use and communication of route instructions depends on factors other than just the length of a route, such as the number and complexity of decision points. Building on previous work to improve the automatic generation of route instructions, this paper presents an algorithm for finding routes associated with the "simplest" instructions, taking into account fundamental principles of human direction giving, namely decision point complexity, references to landmarks, and spatial chunking. The algorithm presented can be computed in the same order of time complexity as Dijkstra's shortest path algorithm, O(n 2). Empirical evaluation demonstrates that the algorithm's performance is comparable to previous work on "simplest paths," with an average increase of path length of about 10% compared to the shortest path. However, the instructions generated are on average 50% shorter than those for shortest or simplest paths. The conclusions argue that the compactness of the descriptions, in combination with the incorporation of the basic cognitive principles of chunking and landmarks, provides evidence that these instructions are easier to understand.
Pricing a contingent claim with random interval or fuzzy random payoff in one-period setting
Authors: Surong You, Jiajin Le, Xiaodong Ding
Venue: Computers Mathematics with Applications (2008)

This article proposes a method for pricing a contingent claim with random interval and fuzzy random payoff. On introduction of the acceptability concept based on classical no-arbitrage argument, a price interval and a fuzzy price are obtained in random interval market and fuzzy random market, respectively. New definitions on replicative strategies, sub-replicative and sup-replicative ones, in two market setting are given. Some interesting results similar to those in the classical random market are presented.
A multi-site virtual cluster system for wide area networks
Authors: Takahiro Hirofuchi, Takeshi Yokoi, Tadashi Ebara, Yusuke Tanimura, Hirotaka Ogawa, Hidetomo Nakada, Yoshio Tanaka, Satoshi Sekiguchi
Venue: First USENIX Workshop on Large-Scale Computing (2008)

A virtual cluster is a promising technology for reducing management costs and improving capacity utilization in datacenters and computer centers. However, recent cluster virtualization systems do not have the maximum scalability and flexibility required, due to limited hardware resources at one site. Therefore, we are now developing an advanced cluster management system for multi-site virtual clusters; which provides a virtual cluster composed of distributed computer resources over wide area networks. This system has great advantages over other cluster management systems designed only for single-site resources; users can create a cluster of virtual machines from local and remote physical clusters in a scalable manner, and dynamically change the number of cluster nodes on demand, seamlessly. In our system, a multi-site cluster achieves a monolithic system view of cluster nodes to enable existing applications to be deployed quickly and managed flexibly, just as in physical clusters. In this paper, we propose an advanced cluster virtualization mechanism composed of two key techniques. An L2 network extension of virtual machine networks allows transparent deployment over networks for distributed virtual cluster nodes, and a transparent package caching mechanism greatly optimizes data transfers in virtual cluster deployment over network latencies. Experimental results show multisite virtual clusters have sufficient feasibility in WAN environments and promise great scalability for a large-scale number of virtual nodes.
A Mechanism of KEDB-Centric Fault Management to Optimize the Realization of ITIL Based ITSM
Authors: Bom Soo Kim, Young Dae Kim, Chan Kyou Hwang, Jae Hyoung Yoo
Venue: Proceedings of the 10th Asia-Pacific Network Operations and Management Symposium on Managing Next Generation Networks and Services (2007)

On the process of converting existing IT service management structure into ITIL based ITSM structure, many of operation management systems that introduced the guideline of ITIL are able to confront several side effects at operation of fault management process. The typical instances of the side effects are business disorder caused by refinement of fault management process, accuracy decrease of RCA (Root cause analysis) caused by reliability shortage of KEDB information, and delay of fault recovery time caused by the collaboration work to handle a fault between management steps, etc. In this paper, we proposed several mechanisms for KEDB-centric fault management in order to minimize the side effects of fault management process of the ITIL based ITSM. The main objects of proposed fault management mechanisms are to support effective collaboration system for handling a fault between management steps, to provide essential information for analyzing faults, and to provide accurate fault recovery path for prompt handling of various types of faults. The proposed mechanisms were applied to an implementation of Internet service resource management system in KT. As the result, the proposed mechanisms contributed to achieve business goals that are expected by introduction of ITIL based ITSM paradigm, such as TCO reduction through effective resource management and systematic management of service quality based on SLA with customer.