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 and equipment for allocating to a television programme already conditionally accessed a complementary conditional access

Abstract: The invention concerns a method and equipment for allocating to a television programme already conditionally accessed a complementary conditional access. The method consists in the following steps: receiving a message by means (102A, 112) provided with access rights to a programme, restoring the control words, constituting complementary access control and access entitlement messages corresponding to a complementary access system and re-emitting the unmodified initial programme with, in addition, the complementary messages linked to the complementary access control. The invention is applicable in the field of television.

Speech recognition method, device, and computer program

Abstract: A speech recognition method including for a spoken expression: a) providing a vocabulary of words including predetermined subsets of words, b) assigning to each word of at least one subset an individual score as a function of the value of a criterion of the acoustic resemblance of that word to a portion of the spoken expression, c) for a plurality of subsets, assigning to each subset of the plurality of subsets a composite score corresponding to a sum of the individual scores of the words of said subset, d) determining at least one preferred subset having the highest composite score.

Cosine-modulated filterbanks based on extended Gaussian functions

Abstract: A new family of cosine-modulated filterbanks based on functions called extended Gaussian functions (EGFs) is obtained. The design is particularly simple since it is mainly based on a closed-form expression. Nearly perfect reconstruction cosine-modulated filterbanks are obtained as well as guidelines to estimate the filterbank parameters. This analytical design method can be used to produce, with a controlled accuracy, filterbanks with practically no upper limitations in the number of coefficients and subbands. Furthermore, a slight modification of the prototype filter coefficients is sufficient to satisfy exactly the perfect reconstruction constraints. An analysis of the time-frequency localization of the discrete prototype filters also shows that under certain conditions, EGF prototypes are at less than 0.3% from the optimal upper bound.

Process for coding by transformation for the transmission of picture signals

Abstract: A process for coding by transformation for the transmission of an image signal, comprises a stage of breaking down the image into blocks, each block containing a set of matrix-organized digital data and representing part of the picture, said process being characterized in that it comprises, for each block a step of detecting the movement of the block by comparing said block of the current image with the corresponding block of the preceding image, transmitting a non-refreshing code for the block and an identification code for the block in the image if the block is fixed, if a movement is detected in the block, breaking down the block into several subblocks, movement detection in each subblock by comparison with the corresponding subblock of the corresponding block of the preceding picture and transmission of a code which is a function of the movement of the subblock, if the block is moving.

A branch and cut algorithm for hub location problems with single assignment

Abstract: The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and to develop a branch and cut algorithm based on these results.