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 processing at least one coded binary audio flux organized into frames

Abstract: At least one coded binary audio flux organized into frames is created from digital audio signals which were coded by transforming them from the time domain into the frequency domain. Transform coefficients of the signals in the frequency domain are quantized and coded according to a set of quantizers. The set is determined from a set of values extracted from the signals. The values make up selection parameters of the set of quantizers. The parameters are also present in the frames. A partial decoding state decodes then dequantizes transform coefficients produced by the coding based on a set of quantizers determined from the selection parameters contained in the frames of the coded binary audio flux or of each coded binary audio flux. The partially decoded frames are subjected to processing in the frequency domain. The thus-processed frames are then made available for use in a later utilization step.

Mobile Ontology: Towards a Standardized Semantic Model for the Mobile Domain

Abstract: Ontologies will be crucial for the future development of Next Generation Service Delivery Platforms. While various projects have defined ontologies for the mobile domain, there is yet little agreement on a common semantic model. One reason is the intrinsically hard problem of finding, using, mapping and evolving already existing ontologies. In this paper we present the Mobile Ontology, an effort within the IST project SPICE to converge towards a standardized ontology. Our approach is based on a minimal core ontology that defines common concepts for sub-ontologies of relevant domains and that is easily extensible towards existing and future ontologies. It is our intention to make this ontology available to other projects and collaboratively work on standardized ontology for the mobile domain.

Secure electronic coupon delivery to mobile device

Abstract: A system, method, device and interface for providing and redeeming an electronic coupon that provides for authenticating access of a user to an electronic coupon server, receiving selection from the user of at least one of an event, transportation, secured location, good, authorization, and service, generating a reservation number corresponding to the selection, encrypting the reservation number based on a first string of characters that is uniquely associated with a mobile device that will be utilized for redeeming the electronic coupon, transmitting the encrypted reservation number to the mobile device, retrieving a second string of characters from the mobile device, wherein the second string of characters corresponds to the first string of characters, decrypting the encrypted reservation number on the mobile device using the retrieved second string of characters, generating the electronic coupon from the decrypted reservation number, and presenting the electronic coupon to an authentication device for redemption

Method and apparatus for quantum distribution of an encryption key

Abstract: Process and device for quantum distribution of an encryption key. According to the invention, a light beam is modulated by a signal, the phase of which can be adjusted at random. On reception, the received beam is modulated by a signal, the phase of which is also adjustable. The intensity of one of the lateral modes is measured, which depends on the difference between the two phases used. The key is distributed by the photons contained in one of the lateral modes. Application to cryptography with secret key.

Two-level processor-sharing scheduling disciplines: mean delay analysis

Abstract: Inspired by several recent papers that focus on scheduling disciplines for network flows, we present a mean delay analysis of Multilevel Processor Sharing (MLPS) scheduling disciplines in the context of M/G/1 queues. Such disciplines have been proposed to model the effect of the differentiation between short and long TCP flows in the Internet. Under MLPS, jobs are classified into classes depending on their attained service. We consider scheduling disciplines where jobs within the same class are served either with Processor Sharing (PS) or Foreground Background (FB) policy, and the class that contains jobs with the smallest attained service is served first. It is known that the FB policy minimizes (maximizes) the mean delay when the hazard rate of the job size distribution is decreasing (increasing). Our analysis, based on pathwise and meanwise arguments of the unfinished truncated work, shows that Two-Level Processor Sharing (TLPS) disciplines, e.g., FB+PS and PS+PS, are better than PS scheduling when the hazard rate of the job size distribution is decreasing. If the hazard rate is increasing and bounded, we show that PS outperforms PS+PS and FB+PS. We further extend our analysis to study local optimality within a level of an MLPS scheduling discipline.