Search results for "Computation Theory & Mathematics"

Left-star order structure of Rickart *-rings

2015

Janowitz proved in 1983 that the initial segments of a Rickart *-ring with the star order are orthomodular posets. In this paper, the same result is proved for the left-star order , which was introduced by Marovtet al., by finding an orthogonality which corresponds to in a certain way and then applying a result proved by Cīrulis which states that the initial segments of any quasi-orthomodular set are orthomodular.

A Framework to Improve the Disaster Response Through a Knowledge-Based Multi-Agent System

2017

The disaster response still faces problems of collaboration due to lack of policies concerning the information exchange during the response. Moreover, plans are prepared to respond to a disaster, but drills to apply them are limited and do not allow to determine their efficiency and conflicts with other organizations. This paper presents a framework allowing for different organizations involving in the disaster response to assess their collaboration through its simulation using an explicit representation of their knowledge. This framework is based on a multi-agent system composed of three generic agent models to represent the organizational structure of disaster response. The decision-makin…

Assignment of Roles and Channels for a Multichannel MAC in Wireless Mesh Networks

2009

International audience; A multichannel MAC improves throughput in wireless mesh networks by multiplexing transmissions over orthogonal channels. In this paper, we propose an efficient way for constructing the wireless mesh structure associated with Molecular MAC, a multichannel MAC layer designed for efficient packet forwarding. Molecular MAC outperforms other classical approaches, but requires a specific structure for efficient operation. First, we propose a centralized protocol that provides an upper bound for constructing such a molecular structure through a MILP (Mixed Integer Linear Programming) formulation that maximizes network capacity. Then, we present two distributed self-stabiliz…

A Learning Automata Based Solution to Service Selection in Stochastic Environments

2010

Published version of a paper published in the book: Trends in Applied Intelligent Systems. Also available on SpringerLink: http://dx.doi.org/10.1007/978-3-642-13033-5_22 With the abundance of services available in today’s world, identifying those of high quality is becoming increasingly difficult. Reputation systems can offer generic recommendations by aggregating user provided opinions about service quality, however, are prone to ballot stuffing and badmouthing . In general, unfair ratings may degrade the trustworthiness of reputation systems, and changes in service quality over time render previous ratings unreliable. In this paper, we provide a novel solution to the above problems based …

“Anti-Bayesian” flat and hierarchical clustering using symmetric quantiloids

2017

A myriad of works has been published for achieving data clustering based on the Bayesian paradigm, where the clustering sometimes resorts to Naive-Bayes decisions. Within the domain of clustering, the Bayesian principle corresponds to assigning the unlabelled samples to the cluster whose mean (or centroid) is the closest. Recently, Oommen and his co-authors have proposed a novel, counter-intuitive and pioneering PR scheme that is radically opposed to the Bayesian principle. The rational for this paradigm, referred to as the “Anti-Bayesian” (AB) paradigm, involves classification based on the non-central quantiles of the distributions. The first-reported work to achieve clustering using the A…

EV-planning: Electric vehicle itinerary planning

2014

International audience; In the latest few years, lot of efforts have been done to pave the way to sustainable mobility, in order to solve pollution problems and fuel shortage. The use of electric vehicles (EV) is considered as one of the best ecologic and economic solution. However, autonomy barriers and limitations slow the progress and the deployment of this technology. In this paper, we propose an advanced electric vehicles' fleet management architecture. This architecture considers the most important factors that can affect the traveling mode of electric vehicles, in order to offer different services to fleet management companies for an efficient monitoring and management of their fleet…

Indexed Two-Dimensional String Matching

2016

A genetic approach to the maximum common subgraph problem

2019

Finding the maximum common subgraph of a pair of given graphs is a well-known task in theoretical computer science and with considerable practical applications, for example, in the fields of bioinformatics, medicine, chemistry, electronic design and computer vision. This problem is particularly complex and therefore fast heuristics are required to calculate approximate solutions. This article deals with a simple yet effective genetic algorithm that finds quickly a solution, subject to possible geometric constraints.

Computing the Arrangement of Circles on a Sphere, with Applications in Structural Biology

2009

International audience; Balls and spheres are the simplest modeling primitives after affine ones, which accounts for their ubiquitousness in Computer Science and Applied Mathematics. Amongst the many applications, we may cite their prevalence when it comes to modeling our ambient 3D space, or to handle molecular shapes using Van der Waals models. If most of the applications developed so far are based upon simple geometric tests between balls, in particular the intersection test, a number of applications would obviously benefit from finer pieces of information. Consider a sphere $S_0$ and a list of circles on it, each such circle stemming from the intersection between $S_0$ and another spher…

Quantum counter automata

2011

The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA. This is the first demonstration of the superiority of a quantum model to the corresponding classical one in the real-time case with an error bound less than 1. We also introduce a generalization of the rtQ1CA, the quantum one-way one-counter automaton (1Q1CA), and show that they too are superior to the corresponding family of probabilistic machines. For this purpose, we provide gene…