Search results for " Computer"
showing 10 items of 6910 documents
Models of Computation, Riemann Hypothesis, and Classical Mathematics
1998
Classical mathematics is a source of ideas used by Computer Science since the very first days. Surprisingly, there is still much to be found. Computer scientists, especially, those in Theoretical Computer Science find inspiring ideas both in old notions and results, and in the 20th century mathematics. The latest decades have brought us evidence that computer people will soon study quantum physics and modern biology just to understand what computers are doing.
Knot Theory, Jones Polynomial and Quantum Computing
2005
Knot theory emerged in the nineteenth century for needs of physics and chemistry as these needs were understood those days. After that the interest of physicists and chemists was lost for about a century. Nowadays knot theory has made a comeback. Knot theory and other areas of topology are no more considered as abstract areas of classical mathematics remote from anything of practical interest. They have made deep impact on quantum field theory, quantum computation and complexity of computation.
Producer's spatial equilibrium with a fuzzy constraint
1980
The classical theory of the producer’s equilibrium rests on two sets of particularly restrictive hypotheses. First it is implicitely assumed that all inputs and outputs are located in a single place where the producer is also implanted and where the production is carried out. Next it is assumed that the producer follows a precise behaviour pattern, by this we mean that the producer has complete information concerning the conditions of hisproductive activity and he has perfect command over both the set of inputs and the set of outputs; he realises the maximum profit allowed by the technological constraint which limits his possible actions and by the given price system. The aim of this study …
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection
2012
We introduce a span program that decides st-connectivity, and generalize the span program to develop quantum algorithms for several graph problems. First, we give an algorithm for st-connectivity that uses O(n d^{1/2}) quantum queries to the n x n adjacency matrix to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disconnected. We also show that if T is a path, a star with two subdivided legs, or a subdivision of a claw, its presence as a subgraph in the input graph G can be detected with O(n) quantum queries to the adjacency matrix. Under the promise that G either contains T as a subgraph or does not contain T…
Robustified smoothing for enhancement of thermal image sequences affected by clouds
2015
Obtaining radiometric surface temperature information with both high acquisition rate and high spatial resolution is still not possible through a single sensor. However, in several earth observation applications, the fusion of data acquired by different sensors is a viable solution for so called image sharpening. A related issue is the presence of clouds, which may impair the performance of the data fusion algorithms. In this paper we propose a robustified setup for the sharpening of thermal images in a non real-time scenario, capable to deal with missing thermal data due to cloudy pixels, and robust with respect to cloud mask misclassifications. The effectiveness of the presented technique…
Self-establishing a Service Level Agreement within Autonomic Cloud Networking Environment
2014
International audience; Today, cloud networking which is the ability to connect the user with his cloud services and to interconnect these services within an inter-cloud approach, is one of the recent research areas in the cloud computing research communities. The main drawback of cloud networking consists in the lack of Quality of Service (QoS) guarantee and management in conformance with a corresponding Service Level Agreement (SLA). Several research works have been proposed for the SLA establishing in cloud computing, but not in cloud networking. In this paper, we propose an architecture for self-establishing an end-to-end service level agreement between a Cloud Service User (CSU) and a …
Autonomic Brokerage Service for an End-to-End Cloud Networking Service Level Agreement
2014
8 pages; International audience; Today, cloud networking which is the ability to connect the user with his cloud services and to interconnect these services within an inter-cloud approach, is one of the recent research areas in the cloud computing research communities. The main drawback of cloud networking consists in the lack of Quality of Service (QoS) assurance and management in conformance with a corresponding Service Level Agreement (SLA). In this paper, we propose a framework for self-establishing an end-to-end service level agreement between a Cloud Service User (CSU) and multiple Cloud Service Providers (CSPs) in a cloud networking environment using brokerage service. We focus on Qo…
Efficient unsupervised clustering for spatial bird population analysis along the Loire river
2015
International audience; This paper focuses on application and comparison of Non Linear Dimensionality Reduction (NLDR) methods on natural high dimensional bird communities dataset along the Loire River (France). In this context, biologists usually use the well-known PCA in order to explain the upstream-downstream gradient.Unfortunately this method was unsuccessful on this kind of nonlinear dataset.The goal of this paper is to compare recent NLDR methods coupled with different data transformations in order to find out the best approach. Results show that Multiscale Jensen-Shannon Embedding (Ms JSE) outperform all over methods in this context.
Structural clustering of millions of molecular graphs
2014
We propose an algorithm for clustering very large molecular graph databases according to scaffolds (i.e., large structural overlaps) that are common between cluster members. Our approach first partitions the original dataset into several smaller datasets using a greedy clustering approach named APreClus based on dynamic seed clustering. APreClus is an online and instance incremental clustering algorithm delaying the final cluster assignment of an instance until one of the so-called pending clusters the instance belongs to has reached significant size and is converted to a fixed cluster. Once a cluster is fixed, APreClus recalculates the cluster centers, which are used as representatives for…
ROS/Gazebo Based Simulation of Co-operative UAVs
2019
UAVs can be assigned different tasks such as e.g., rendez-vous and space coverage, which require processing and communication capabilities. This work extends the architecture ROS/Gazebo with the possibility of simulation of co-operative UAVs. We assume UAV with the underlying attitude controller based on the open-source Ardupilot software. The integration of the co-ordination algorithm in Gazebo is implemented with software modules extending Ardupilot with the capability of sending/receiving messages to/from drones, and executing the co-ordination protocol. As far as it concerns the simulation environment, we have extended the world in Gazebo to hold more than one drone and to open a specif…