Orange S.A.

About: Orange S.A. is a company organization based out in Paris, France. It is known for research contribution in the topics: Terminal (electronics) & Signal. The organization has 6735 authors who have published 9190 publications receiving 156440 citations. The organization is also known as: Orange SA & France Télécom.

Method of and apparatus for managing data representative of a business in a database

Abstract: A computer implemented method of finding, in a first database using a social network, a business entity providing a desired product or service, the method comprising: receiving, via a network from a user terminal of a first social network user, search criteria data representative of search criteria for a desired product or service, the first social network user being associated with a first social graph defining one or more relationships between the first social network user and further social network users of the social network; transmitting search criteria data to a first database storing a directory of businesses entities providing products or services; receiving from the database a plurality of identifier data, each identifier data identifying a respective business entity providing a product or service satisfying the search criteria; determining for each identified business entity if there is a link between the identified business entity and any of the further social network users linked to the first social network user by the first social graph; providing, for display on the user terminal, a list of selectable identified business entities and for those identified business identities in the list for which a link between at least one of said further social network user exists, displaying relationship data identifying relationships between the said business entity and any of the further social network users.

Process of combined authentication of a telecommunication terminal and of a user module

Abstract: The terminal and the user module are authenticated in a combined manner on the basis of an authentication key calculated on the one hand by the terminal and on the other hand by the network. A session key is firstly calculated by the user module on the basis of a secret user key, of a terminal identification parameter and of a first random number. Calculation of the authentication key by the terminal involves this session key calculated by the user module, a secret terminal identification key and a second random number. The network calculates in the same way the session key and the authentication key by retrieving the secret keys on the basis of the identification parameters transmitted by the terminal. The terminals can then be authenticated by the network independently of the associated user modules.

Optimal multipath congestion control and request forwarding in Information-Centric Networks

Abstract: The evolution of the Internet into a distributed Information access system calls for a paradigm shift to enable an evolvable future network architecture. Information-Centric Networking (ICN) proposals rethink the communication model around named data, in contrast with the host-centric transport view of TCP/IP. Information retrieval is natively pull-based, driven by user requests, point-to-multipoint and intrinsically coupled with in-network caching. In this paper, we tackle the problem of joint multipath congestion control and request forwarding in ICN for the first time. We formulate it as a global optimization problem with the twofold objective of maximizing user throughput and minimizing overall network cost. We solve it via decomposition and derive a family of optimal congestion control strategies at the receiver and of distributed algorithms for dynamic request forwarding at network nodes. An experimental evaluation of our proposal is carried out in different network scenarios to assess the performance of our design and to highlight the benefits of an ICN approach.

A finite element method based on Whitney forms to solve Maxwell equations in the time domain

Abstract: A new finite element method in the time domain based on the Whitney forms is presented. Using edge elements and face elements for space discretization of the fields and a leap-frog scheme in time, the algorithm gives a direct way to solve Maxwell equations in general unstructured meshes. >

A formal model for semantic web service composition

Abstract: Automated composition of Web services or the process of forming new value added Web services is one of the most promising challenges in the semantic Web service research area. Semantics is one of the key elements for the automated composition of Web services because such a process requires rich machine-understandable descriptions of services that can be shared. Semantics enables Web service to describe their capabilities and processes, nevertheless there is still some work to be done. Indeed Web services described at functional level need a formal context to perform the automated composition of Web services. The suggested model (i.e., Causal link matrix) is a necessary starting point to apply problem-solving techniques such as regression-based search for Web service composition. The model supports a semantic context in order to find a correct, complete, consistent and optimal plan as a solution. In this paper an innovative and formal model for an AI planning-oriented composition is presented.